public void test_getNewInput() {
        // Test getNewInput method
        ProtwordsItem item = new ProtwordsItem(1, "word");
        assertNull(item.getNewInput());

        item.setNewInput("newword");
        assertEquals("newword", item.getNewInput());
    }

    @Test
    public void test_setNewInput() {
        // Test setNewInput method
        ProtwordsItem item = new ProtwordsItem(1, "word");

    public void test_createMode() {
        // Test special behavior when id is 0 (create mode)
        StopwordsItem createItem = new StopwordsItem(0, "newword");
        assertTrue(createItem.isUpdated());
        assertEquals("newword", createItem.getNewInput());
        assertEquals("newword", createItem.toLineString());

        // Non-zero id should not auto-set newInput

        ProtwordsItem newItem = new ProtwordsItem(0, "newWord");

        // Insert the item
        protwordsFile.insert(newItem);

        // Verify the item was added
        protwordsFile.reload(null);
        boolean found = false;
        PagingList<ProtwordsItem> list = protwordsFile.selectList(0, 100);
        for (ProtwordsItem item : list) {
            if ("newWord".equals(item.getInput())) {

 * subtype of {@code Network} that provides methods for adding and removing nodes and edges. If you
 * do not need to mutate a network (e.g. if you write a method than runs a read-only algorithm on
 * the network), you should use the non-mutating {@link Network} interface, or an {@link
 * ImmutableNetwork}.
 *
 * <p>You can create an immutable copy of an existing {@code Network} using {@link
 * ImmutableNetwork#copyOf(Network)}:

  public void validateUndirectedEdges() {
    for (Integer node : network.nodes()) {
      new EqualsTester()
          .addEqualityGroup(
              network.inEdges(node), network.outEdges(node), network.incidentEdges(node))
          .testEquals();
      new EqualsTester()
          .addEqualityGroup(
              network.predecessors(node), network.successors(node), network.adjacentNodes(node))
          .testEquals();

    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentEdges(N1)).containsExactly(E11);
  }

  @Test
  public void incidentNodes_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.incidentNodes(E11).source()).isEqualTo(N1);
    assertThat(network.incidentNodes(E11).target()).isEqualTo(N1);
  }

      },
      "mimetype": {
        "type": "keyword"
      },
      "parent_id": {
        "type": "keyword"
      },
      "role": {
        "type": "keyword"
      },
      "label": {
        "type": "keyword"
      },
      "virtual_host": {
        "type": "keyword"
      },
      "segment": {
        "type": "keyword"
      },
      "site": {
        "type": "keyword"

  /**
   * Returns a view of {@code network} with the direction (if any) of every edge reversed. All other
   * properties remain intact, and further updates to {@code network} will be reflected in the view.
   */
  public static <N, E> Network<N, E> transpose(Network<N, E> network) {
    if (!network.isDirected()) {
      return network; // the transpose of an undirected network is an identical network
    }

/**
 * A concrete interceptor chain that carries the entire interceptor chain: all application
 * interceptors, the OkHttp core, all network interceptors, and finally the network caller.
 *
 * If the chain is for an application interceptor then [exchange] must be null. Otherwise it is for
 * a network interceptor and [exchange] must be non-null.
 */
class RealInterceptorChain(
  internal val call: RealCall,

  }

  @Test
  fun networkInterceptorsRewriteRequestToServer() {
    rewriteRequestToServer(true)
  }

  private fun rewriteRequestToServer(network: Boolean) {
    server.enqueue(MockResponse())
    addInterceptor(network) { chain: Interceptor.Chain ->
      val originalRequest = chain.request()
      chain.proceed(
        originalRequest
          .newBuilder()