return Iterators.getOnlyElement(iterable.iterator(), defaultValue);
  }

  /**
   * Copies an iterable's elements into an array.
   *
   * @param iterable the iterable to copy
   * @param type the type of the elements
   * @return a newly-allocated array into which all the elements of the iterable have been copied
   */
  @GwtIncompatible // Array.newInstance(Class, int)

        assertEquals(0, SMBUtil.readInt2(buffer, offset + 2));

        // Verify Reserved (4 bytes at offset+4, should be 0)
        assertEquals(0, SMBUtil.readInt4(buffer, offset + 4));

        // Verify file ID is copied correctly (16 bytes starting at offset+8)
        byte[] copiedFileId = new byte[16];
        System.arraycopy(buffer, offset + 8, copiedFileId, 0, 16);
        assertArrayEquals(testFileId, copiedFileId);
    }

   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the
   * cartesian set is constructed, the input sets are merely copied. Only as the resulting set is
   * iterated are the individual lists created, and these are not retained after iteration.
   *
   * @param sets the sets to choose elements from, in the order that the elements chosen from those

            // When
            int bytesWritten = copy.encode(buffer, startIndex);

            // Then
            assertEquals(HEADER_SIZE, bytesWritten);

            // Verify source key is copied correctly
            for (int i = 0; i < SOURCE_KEY_SIZE; i++) {
                assertEquals(sourceKey[i], buffer[startIndex + i], "Source key byte at position " + i + " doesn't match");
            }
        }

   *
   * <p>The {@link Table#cellSet()} iteration order of the provided table determines the iteration
   * ordering of all views in the returned table. Note that some views of the original table and the
   * copied table may have different iteration orders. For more control over the ordering, create a
   * {@link Builder} and call {@link Builder#orderRowsBy}, {@link Builder#orderColumnsBy}, and
   * {@link Builder#putAll}
   *

   * list of size {@code m x n x p}, its actual memory consumption is much smaller. When the
   * cartesian product is constructed, the input lists are merely copied. Only as the resulting list
   * is iterated are the individual lists created, and these are not retained after iteration.
   *
   * @param lists the lists to choose elements from, in the order that the elements chosen from

            assertTrue(result > 0);

            // Verify header
            for (int i = 0; i < 8; i++) {
                assertEquals((byte) 0xFF, testBuffer[i]);
            }

            // Verify name was copied
            byte[] nameCheck = new byte[testName.length];
            System.arraycopy(testBuffer, 8, nameCheck, 0, testName.length);
            assertArrayEquals(testName, nameCheck);
        }

        @Test

    return Iterators.getOnlyElement(iterable.iterator(), defaultValue);
  }

  /**
   * Copies an iterable's elements into an array.
   *
   * @param iterable the iterable to copy
   * @param type the type of the elements
   * @return a newly-allocated array into which all the elements of the iterable have been copied
   */
  @GwtIncompatible // Array.newInstance(Class, int)

 *   <li>Static methods named {@code of}, accepting an explicit list of elements or entries.
 *   <li>Static methods named {@code copyOf} (or {@code copyOfSorted}), accepting an existing
 *       collection whose contents should be copied.
 *   <li>A static nested {@code Builder} class which can be used to populate a new immutable
 *       instance.
 * </ul>
 *
 * <h4>Warnings</h4>
 *
 * <ul>

            int dataOffsetValue = SMBUtil.readInt2(buffer, headerStart + 2);
            assertEquals(headerStart - 0 + 48, dataOffsetValue); // Assuming getHeaderStart() returns 0

            // Verify data is copied
            assertArrayEquals(data, Arrays.copyOfRange(buffer, headerStart + 48, headerStart + 48 + data.length));

            // Verify total bytes written
            assertEquals(48 + data.length, bytesWritten);