#### Union { #union }

Puedes declarar que una variable puede ser cualquiera de **varios tipos**, por ejemplo, un `int` o un `str`.

Para definirlo usas la <dfn title='también llamado "operador OR a nivel de bits", pero ese significado no es relevante aquí'>barra vertical (`|`)</dfn> para separar ambos tipos.

Esto se llama una "unión", porque la variable puede ser cualquiera en la unión de esos dos conjuntos de tipos.

            // Since FLAGS2_RESOLVE_PATHS_IN_DFS is 0x1000, when cast to byte it becomes 0
            // Therefore the method will always return false unless flags has all 0x00 bits set
            // This test verifies actual behavior
            testBlock.setFlags((byte) 0x00);
            assertFalse(testBlock.isResolveInDfs());

	// Date and time when the file was last modified, if Deleted
	// is 'true' this value represents when while was deleted.
	ModTime time.Time `msg:"mt"`

	// Total file size.
	Size int64 `msg:"sz"`

	// File mode bits.
	Mode uint32 `msg:"m"`

	// WrittenByVersion is the unix time stamp of the MinIO
	// version that created this version of the object.
	WrittenByVersion uint64 `msg:"wv"`

	// File metadata

        src[srcIndex + 16] = 0x00; // hex code
        src[srcIndex + 17] = (byte) 0xFE; // All flags except one: 11111110
        // Bit 7: group (1)
        // Bits 6-5: owner node type (11 = 3)
        // Bit 4: being deleted (1)
        // Bit 3: in conflict (1)
        // Bit 2: active (1)
        // Bit 1: permanent (1)

        // MAC address

             * little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant
             * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get
             * that least significant nonzero byte.
             */
            int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;

      return MoreObjects.firstNonNull(existing, created);
    }

    @Override
    public int size() {
      return size;
    }
  }

  /** A bit mask were all bits are set. */
  private static final int ALL_SET = ~0;

  private static int ceilToPowerOfTwo(int x) {
    return 1 << IntMath.log2(x, RoundingMode.CEILING);
  }

  /*

        // Then
        assertTrue(response.haveCapabilitiy(0x01)); // Has this bit
        assertTrue(response.haveCapabilitiy(0x0F)); // Has all these bits
        assertFalse(response.haveCapabilitiy(0x10)); // Doesn't have this bit
        assertFalse(response.haveCapabilitiy(0x40)); // Doesn't have this bit
    }

    @Test

   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,
    // using variant of single-word Wang/Jenkins hash.
    // TODO(kevinb): use Hashing/move this to Hashing?

            });
    assertThat(expected)
        .hasMessageThat()
        .isEqualTo("Could not create BloomFilter of 3327428144502 bits");
  }

  @AndroidIncompatible // OutOfMemoryError
  public void testLargeNumberOfInsertions() {
    // We use horrible FPPs here to keep Java from OOM'ing
    BloomFilter<String> unused =

    /**
     * Flag indicating the message is signed.
     */
    public static final int SMB2_FLAGS_SIGNED = 0x00000008;
    /**
     * Mask for message priority bits.
     */
    public static final int SMB2_FLAGS_PRIORITY_MASK = 0x00000070;
    /**
     * Flag indicating the operation is a DFS operation.
     */
    public static final int SMB2_FLAGS_DFS_OPERATIONS = 0x10000000;