*/
public interface FieldDesc {

    /**
     * Returns the {@link BeanDesc} of the class that owns this field.
     *
     * @return {@link BeanDesc}
     */
    BeanDesc getBeanDesc();

    /**
     * Returns the field.
     *
     * @return the field
     */
    Field getField();

    /**
     * Returns the field name.
     *
     * @return the field name
     */
    String getFieldName();

  }
}

/** Returns the Content-Length as reported by the response headers. */
internal fun Response.headersContentLength(): Long = headers["Content-Length"]?.toLongOrDefault(-1L) ?: -1L

/** Returns an immutable wrap of this. */
@Suppress("NOTHING_TO_INLINE")
internal inline fun <T> List<T>.unmodifiable(): List<T> = Collections.unmodifiableList(this)

/** Returns an immutable wrap of this. */

  RangeMap<K, V> subRangeMap(Range<K> range);

  /**
   * Returns {@code true} if {@code obj} is another {@code RangeMap} that has an equivalent {@link
   * #asMapOfRanges()}.
   */
  @Override
  boolean equals(@Nullable Object o);

  /** Returns {@code asMapOfRanges().hashCode()}. */
  @Override
  int hashCode();

  /** Returns a readable string representation of this range map. */
  @Override

    /**
     * Returns the identifier of the access result.
     *
     * @return the identifier
     */
    IDTYPE getId();

    /**
     * Sets the identifier of the access result.
     *
     * @param id the identifier
     */
    void setId(IDTYPE id);

    /**
     * Returns the session identifier.
     *
     * @return the session identifier
     */

        boolean result = session.isInUse();

        assertEquals(inUse, result);
        verify(session, times(1)).isInUse();
    }

    // Happy path + edge: getSessionKey returns bytes, empty and null
    @Test
    @DisplayName("getSessionKey returns bytes, empty, then null")
    void getSessionKey_variants() throws CIFSException {
        byte[] key = new byte[] { 10, 20 };

	defer r.mu.Unlock()

	if r.w == r.r {
		if r.isFull {
			return r.size
		}
		return 0
	}

	if r.w > r.r {
		return r.w - r.r
	}

	return r.size - r.r + r.w
}

// Capacity returns the size of the underlying buffer.
func (r *RingBuffer) Capacity() int {
	return r.size
}

// Free returns the length of available bytes to write.
func (r *RingBuffer) Free() int {

  /**
   * Returns a collection view of all values associated with a key. If no mappings in the multimap
   * have the provided key, an empty collection is returned.
   *
   * <p>Changes to the returned collection will update the underlying multimap, and vice versa.
   *
   * <p>Because a {@code SortedSetMultimap} has unique sorted values for a given key, this method

        case 0:
          return (k == 0) ? 1 : 0;
        case 1:
          return 1;
        case -1:
          return ((k & 1) == 0) ? 1 : -1;
        case 2:
          return (k < Long.SIZE) ? 1L << k : 0;
        case -2:
          if (k < Long.SIZE) {
            return ((k & 1) == 0) ? 1L << k : -(1L << k);
          } else {
            return 0;
          }
        default:

   * Integer.MAX_VALUE} elements, returns {@code Integer.MAX_VALUE}.
   */
  public int size() {
    return map.size();
  }

  /** Returns {@code true} if this map contains no key-value mappings. */
  public boolean isEmpty() {
    return map.isEmpty();
  }

  /**
   * Removes all of the mappings from this map. The map will be empty after this call returns.
   *

    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }
    return -1;
  }

  /**
   * Returns the start position of the first occurrence of the specified {@code target} within
   * {@code array}, or {@code -1} if there is no such occurrence.
   *
   * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array,