anchor.diff:      names.getUsing(key, name);
       // process the name...
    }
  - ```
  +```
   
   In this case, calling `names.getUsing(key, name)` is equivalent to:
   
  - ```java
  +```java
    name.setLength(0);
    name.append(names.get(key));
  - ```
  +```
   
   The difference is that it doesn't generate garbage. The value type is the value interface. Pass the heap instance to read the data into it without new object allocation:
   
  - ```java
  +```java
    ThreadLocal<PostalCodeRange> cachedPostalCodeRange =
       ThreadLocal.withInitial(() -> Values.newHeapInstance(PostalCodeRange.class));
   
  
positive.code: Unlike `ConcurrentHashMap`, `ChronicleMap` stores its data off-heap; often in a memory mapped file.
  It is recommended that you call `close()` when you have finished working with a `ChronicleMap`.
  
  ``` java
  map.close()
  ```
  
  
negative.code:  PostalCodeRange range = cachedPostalCodeRange.get();
   cityPostalCodes.getUsing(city, range);
   // process the range...
  ```
  
   - If the value type implements `BytesMarshallable`, or `Externalizable`, then `ChronicleMap` attempts to
   reuse the given `using` object by deserializing the value into the given object.
  