}
        return false;
    }
    
    @Override
    public int hashCode() {
        return Arrays.hashCode(key);
    }
}
```

### 4.2 Lease Context Structure
```java
package jcifs.internal.smb2.lease;

import jcifs.internal.smb2.create.Smb2CreateContext;

public class Smb2LeaseContext extends Smb2CreateContext {
    // Context name for lease request

    @Override
    public SampleElements<Entry<String, Integer>> samples() {
      return new SampleElements<>(
          mapEntry("one", 114),
          mapEntry("two", 37),
          mapEntry("three", 42),
          mapEntry("four", 19),
          mapEntry("five", 82));
    }

    @SuppressWarnings("unchecked")
    @Override
    public Entry<String, Integer>[] createArray(int length) {

      return values[random.nextInt(values.length)];
    }

    abstract void doIt(ImmutableDoubleArray.Builder builder, AtomicInteger counter);
  }

  private static final Random random = new Random(42);

  public void testLength() {
    assertThat(ImmutableDoubleArray.of().length()).isEqualTo(0);
    assertThat(ImmutableDoubleArray.of(0).length()).isEqualTo(1);

Pi is roughly 3.1445191445191445
```

Job status can also be viewed in a browser by navigating to the YARN ResourceManager Web UI and clicking on job history server information.

### **4.2 WordCount**

WordCount is a simple program that counts how often a word occurs in a text file. The code builds a dataset of (String, Int) pairs called counts, and saves the dataset to a file.

pkg debug/elf, const R_MIPS_TLS_DTPREL_HI16 R_MIPS
pkg debug/elf, const R_MIPS_TLS_DTPREL_LO16 = 45
pkg debug/elf, const R_MIPS_TLS_DTPREL_LO16 R_MIPS
pkg debug/elf, const R_MIPS_TLS_GD = 42
pkg debug/elf, const R_MIPS_TLS_GD R_MIPS
pkg debug/elf, const R_MIPS_TLS_GOTTPREL = 46
pkg debug/elf, const R_MIPS_TLS_GOTTPREL R_MIPS
pkg debug/elf, const R_MIPS_TLS_LDM = 43
pkg debug/elf, const R_MIPS_TLS_LDM R_MIPS

    assertEquals(666, expected.value);
    new EqualsTester()
        .addEqualityGroup(c, Ordering.explicit(42, 5))
        .addEqualityGroup(Ordering.explicit(5, 42))
        .addEqualityGroup(Ordering.explicit(42))
        .testEquals();
    reserializeAndAssert(c);
  }

  public void testExplicit_sortingExample() {
    Comparator<Integer> c = Ordering.explicit(2, 8, 6, 1, 7, 5, 3, 4, 0, 9);

    assertEquals(666, expected.value);
    new EqualsTester()
        .addEqualityGroup(c, Ordering.explicit(42, 5))
        .addEqualityGroup(Ordering.explicit(5, 42))
        .addEqualityGroup(Ordering.explicit(42))
        .testEquals();
    reserializeAndAssert(c);
  }

  public void testExplicit_sortingExample() {
    Comparator<Integer> c = Ordering.explicit(2, 8, 6, 1, 7, 5, 3, 4, 0, 9);

            int flags = readInt4(buffer, dataOffset);
            dataOffset += 4;
            
            this.notificationFilter = readInt4(buffer, dataOffset);
        }
    }
}
```

### 4.2 Directory Cache Entry
```java
package jcifs.internal.smb2.lease;

import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReadWriteLock;

    
    public int getAvailableSendCredits() {
        return sendCredits.get();
    }
    
    public int getAvailableReceiveCredits() {
        return receiveCredits.get();
    }
}
```

### 4.2 RDMA Memory Region
```java
package jcifs.internal.smb2.rdma;

public abstract class RdmaMemoryRegion implements AutoCloseable {
    protected final ByteBuffer buffer;

            assertEquals(0, SMBUtil.readInt2(buffer, headerStart + 40)); // WriteChannelInfoOffset
            assertEquals(0, SMBUtil.readInt2(buffer, headerStart + 42)); // WriteChannelInfoLength
            assertEquals(0x01, SMBUtil.readInt4(buffer, headerStart + 44)); // Write flags

            // Verify data offset is written correctly