verifyTableSize(60, 60, 128);
    verifyTableSize(120, 60, 256);
    // if the table is only double the necessary size, we don't bother resizing it
    verifyTableSize(180, 60, 128);
    // but if it's even bigger than double, we rebuild the table
    verifyTableSize(17, 17, 32);
    verifyTableSize(17, 16, 32);
    verifyTableSize(17, 15, 32);
  }

  @GwtIncompatible // RegularImmutableSet.table not in emulation

      return;
    }
    fail("Should have failed");
  }

  /** An interface for the 2 ways that a chaining call might be defined. */
  private interface ChainingCalls {
    // A method that is defined to 'return this'
    @CanIgnoreReturnValue
    ChainingCalls chainingCall();

    // A method that just happens to return a ChainingCalls object
    ChainingCalls nonChainingCall();
  }

        // Test with exact width string
        sb = new StringBuffer();
        ace.appendCol(sb, "exact", 5);
        assertEquals("exact", sb.toString());

        // Test with longer string than width
        sb = new StringBuffer();
        ace.appendCol(sb, "longer string", 5);
        assertEquals("longer string", sb.toString());
    }

    @Test

        nameQueryResponse = new NameQueryResponse(mockConfig);
    }

    @Test
    void constructor_shouldInitializeRecordName() throws NoSuchFieldException, IllegalAccessException {
        // Verify that the 'recordName' field in the superclass (NameServicePacket) is initialized
        Field recordNameField = NameServicePacket.class.getDeclaredField("recordName");

		}
		gr.Close()
	}

	// Test use case 2: Make 9 disks offline, which leaves less than quorum number of disks
	// in a 16 disk Erasure setup. The original disks are 'replaced' with
	// naughtyDisks that fail after 'f' successful StorageAPI method
	// invocations, where f - [0,2)

	// Create "object" under "bucket".

    }

    /**
     * @throws MalformedURLException
     *
     */
    private synchronized void canonicalizePath() {
        final char[] in = this.url.getPath().toCharArray();
        final char[] out = new char[in.length];
        final int length = in.length;
        int prefixLen = 0, state = 0;

        /*
         * The canonicalization routine
         */

   * defer that to Range, since it's ContiguousSet.create() that's used to create the sets. However,
   * that gets messy here, and we already have null tests for Range.
   */

  /*
   * These generators also rely on consecutive integer inputs (not necessarily in order, but no
   * holes).
   */

  // SetCreationTester has some tests that pass in duplicates. Dedup them.

carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices...

    assertThrows(
        IllegalArgumentException.class,
        () -> Traverser.forGraph(createDirectedGraph()).breadthFirst('a'));
  }

  /**
   * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
   * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
   */
  @Test
  public void forGraph_breadthFirstIterable_emptyGraph() {

    assertThrows(
        IllegalArgumentException.class,
        () -> Traverser.forGraph(createDirectedGraph()).breadthFirst('a'));
  }

  /**
   * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that
   * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes.
   */
  @Test
  public void forGraph_breadthFirstIterable_emptyGraph() {