pkg go/ast, method (*KeyValueExpr) End() token.Pos
pkg go/ast, method (*KeyValueExpr) Pos() token.Pos
pkg go/ast, method (*LabeledStmt) End() token.Pos
pkg go/ast, method (*LabeledStmt) Pos() token.Pos
pkg go/ast, method (*MapType) End() token.Pos
pkg go/ast, method (*MapType) Pos() token.Pos
pkg go/ast, method (*Object) Pos() token.Pos
pkg go/ast, method (*Package) End() token.Pos

mvn license:format             # Update license headers
```

### Code Style

- 4 spaces (no tabs), opening brace on same line, max line length 120
- JavaDoc required for public APIs
- License headers required (Apache 2.0)

### Testing

- **Structure**: `src/test/java/org/codelibs/fess/crawler/`
- **Base class**: Extend `PlainTestCase` from UTFlute
- **Test Resources**: `src/test/resources/`

 *
 * <ul>
 *   <li>Memory footprint has a fixed overhead (about 24 bytes per instance).
 *   <li><i>Some</i> construction use cases force the data to be copied (though several construction
 *       APIs are offered that don't).
 *   <li>Can't be passed directly to methods that expect {@code long[]} (though the most common
 *       utilities do have replacements here).
 *   <li>Dependency on {@code com.google.common} / Guava.

   * (In other words, this method must allocate a new array). The caller is thus free to modify the
   * returned array.
   *
   * <p>This method acts as bridge between array-based and collection-based APIs.
   *
   * @return an array containing all of the elements in this queue
   */
  @CanIgnoreReturnValue
  @Override
  public Object[] toArray() {
    E[] items = this.items;

    arrayCopy(array, paramCount, others);
    return new RegularImmutableList<E>(ImmutableList.<E>nullCheckedList(array));
  }

  private static void arrayCopy(Object[] dest, int pos, Object... source) {
    System.arraycopy(source, 0, dest, pos, source.length);
  }

  /** ImmutableList.of API that is friendly to use from JavaScript. */
  @JsMethod(name = "of")
  static <E> ImmutableList<E> jsOf(E... elements) {

TF_Operation* TF_GraphNextOperation(TF_Graph* graph, size_t* pos) {
  if (*pos == 0) {
    // Advance past the first sentinel nodes in every graph (the source & sink).
    *pos += 2;
  } else {
    // Advance to the next node.
    *pos += 1;
  }

  mutex_lock l(graph->mu);
  while (*pos < static_cast<size_t>(graph->graph.num_node_ids())) {
    Node* node = graph->graph.FindNodeId(*pos);

## Migration from another search provider

Please see [MIGRATION.md](MIGRATION.md).

## Data Store

Currently, Fess supports crawling the following [storage locations and APIs](https://fess.codelibs.org/15.5/admin/dataconfig-guide.html):

 - [Confluence/Jira](https://github.com/codelibs/fess-ds-atlassian)
 - [Box](https://github.com/codelibs/fess-ds-box)
 - [CSV](https://github.com/codelibs/fess-ds-csv)

   * is transmitted. If you cannot ensure that your client and server both support HTTP/2, do not
   * use this feature.
   *
   * ### Duplex APIs
   *
   * With regular request bodies it is not legal to write bytes to the sink passed to
   * [RequestBody.writeTo] after that method returns. For duplex requests bodies that condition is

import java.util.concurrent.locks.LockSupport;
import org.jspecify.annotations.Nullable;

@GwtCompatible
@ReflectionSupport(value = ReflectionSupport.Level.FULL)
// Some Android 5.0.x Samsung devices have bugs in JDK reflection APIs that cause
// getDeclaredField to throw a NoSuchFieldException when the field is definitely there.
// Since this class only needs CAS on one field, we can avoid this bug by extending AtomicReference

    long length = 0;
    for (char[] array : arrays) {
      length += array.length;
    }
    char[] result = new char[checkNoOverflow(length)];
    int pos = 0;
    for (char[] array : arrays) {
      System.arraycopy(array, 0, result, pos, array.length);
      pos += array.length;
    }
    return result;
  }

  private static int checkNoOverflow(long result) {
    checkArgument(
        result == (int) result,