FLAGS[prefixFlag or frameFlag or FLAG_PADDED] =
          FLAGS[prefixFlag] + '|'.toString() + FLAGS[frameFlag] + "|PADDED"
      }
    }

    for (i in FLAGS.indices) { // Fill in holes with binary representation.
      if (FLAGS[i] == null) FLAGS[i] = BINARY[i]
    }
  }

  /**
   * Returns a human-readable representation of HTTP/2 frame headers.
   *
   * The format is:
   *

    static final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
      List<Integer> elements = new ArrayList<>(elementsSet);
      /*
       * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it
       * doesn't need one, or it should be suppressed for ContiguousSet.
       */
      for (int i = 0; i < elements.size() - 1; i++) {

    static final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) {
      List<Integer> elements = new ArrayList<>(elementsSet);
      /*
       * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it
       * doesn't need one, or it should be suppressed for ContiguousSet.
       */
      for (int i = 0; i < elements.size() - 1; i++) {

//		{Offset: 18, Length: 3},  // Data fragment for 18..20
//	}
//	var sph sparseHoles = []sparseEntry{
//		{Offset: 0,  Length: 2},  // Hole fragment for 0..1
//		{Offset: 7,  Length: 11}, // Hole fragment for 7..17
//		{Offset: 21, Length: 4},  // Hole fragment for 21..24
//	}
//
// Then the content of the resulting sparse file with a Header.Size of 25 is:
//

		} else { // In a hole fragment
			nf = holeEnd - sr.pos
			if sr.physicalRemaining() == 0 {
				writeLastByte = true
				nf--
			}
			_, err = ws.Seek(nf, io.SeekCurrent)
		}
		sr.pos += nf
		if sr.pos >= holeEnd && len(sr.sp) > 1 {
			sr.sp = sr.sp[1:] // Ensure last fragment always remains
		}
	}

	// If the last fragment is a hole, then seek to 1-byte before EOF, and

// The bytes read must match the number of remaining bytes in the current file.
//
// If the current file is sparse and r is an io.ReadSeeker,
// then readFrom uses Seek to skip past holes defined in Header.SparseHoles,
// assuming that skipped regions are all NULs.
// This always reads the last byte to ensure r is the right size.
//
// TODO(dsnet): Re-export this when adding sparse file support.

        final String virtualHostKey;

        SearchLogContext(final FessConfig fessConfig, final String[] roles, final String userCode, final String userId,
                final HttpServletRequest request, final String clientIp, final String virtualHostKey) {
            this.fessConfig = fessConfig;
            this.roles = roles;
            this.userCode = userCode;
            this.userId = userId;
            this.request = request;

        fields.add("field1");
        List<String> tags = new ArrayList<>();
        tags.add("tag1");
        List<String> roles = new ArrayList<>();
        roles.add("role1");

        elevateWord = new ElevateWord(word, boost, readings, fields, tags, roles);

        // Check that we get the same references
        assertTrue(readings == elevateWord.getReadings());

        String[] tags = { "tag2", "tag1" };
        String[] roles = { "role2", "role1" };
        String[] fields = { "field2", "field1" };
        String[] excludes = { "exclude2", "exclude1" };

        String result1 = popularWordHelper.getCacheKey(seed, tags, roles, fields, excludes);
        String result2 = popularWordHelper.getCacheKey(seed, tags, roles, fields, excludes);

        assertEquals(result1, result2);
    }

        if (tags == null) {
            this.tags = Collections.emptyList();
        } else {
            this.tags = tags;
        }
        if (roles == null) {
            this.roles = Collections.emptyList();
        } else {
            this.roles = roles;
        }
    }

    /**
     * Returns the elevate word.
     *
     * @return the elevate word
     */
    public String getElevateWord() {