Lines Matching full:code
60 * Static utility methods pertaining to {@code primtyp} primitives, that are not
71 * The number of bytes required to represent a primitive {@code primtyp}
77 * Returns a hash code for {@code value}; equal to the result of invoking
78 * {@code ((WrapperCl) value).hashCode()}.
80 * @param value a primitive {@code primtyp} value
81 * @return a hash code for the value
88 * Returns the {@code primtyp} value that is equal to {@code value}, if possible.
90 * @param value any value in the range of the {@code primtyp} type
91 * @return the {@code primtyp} value that equals {@code value}
92 * @throws IllegalArgumentException if {@code value} is greater than {@link
102 * Returns the {@code primtyp} nearest in value to {@code value}.
104 * @param value any {@code long} value
105 * @return the same value cast to {@code primtyp} if it is in the range of the
106 * {@code primtyp} type, {@link WrapperCl#MAX_VALUE} if it is too large,
120 * Compares the two specified {@code primtyp} values. The sign of the value
121 * returned is the same as that of {@code ((WrapperCl) a).compareTo(b)}.
123 * @param a the first {@code primtyp} to compare
124 * @param b the second {@code primtyp} to compare
125 * @return a negative value if {@code a} is less than {@code b}; a positive
126 * value if {@code a} is greater than {@code b}; or zero if they are equal
133 * Returns {@code true} if {@code target} is present as an element anywhere in
134 * {@code array}.
136 * @param array an array of {@code primtyp} values, possibly empty
137 * @param target a primitive {@code primtyp} value
138 * @return {@code true} if {@code array[i] == target} for some value of {@code
151 * Returns the index of the first appearance of the value {@code target} in
152 * {@code array}.
154 * @param array an array of {@code primtyp} values, possibly empty
155 * @param target a primitive {@code primtyp} value
156 * @return the least index {@code i} for which {@code array[i] == target}, or
157 * {@code -1} if no such index exists.
175 * Returns the start position of the first occurrence of the specified {@code
176 * target} within {@code array}, or {@code -1} if there is no such occurrence.
178 * <p>More formally, returns the lowest index {@code i} such that {@code
180 * the same elements as {@code target}.
182 * @param array the array to search for the sequence {@code target}
183 * @param target the array to search for as a sub-sequence of {@code array}
205 * Returns the index of the last appearance of the value {@code target} in
206 * {@code array}.
208 * @param array an array of {@code primtyp} values, possibly empty
209 * @param target a primitive {@code primtyp} value
210 * @return the greatest index {@code i} for which {@code array[i] == target},
211 * or {@code -1} if no such index exists.
229 * Returns the least value present in {@code array}.
231 * @param array a <i>nonempty</i> array of {@code primtyp} values
232 * @return the value present in {@code array} that is less than or equal to
234 * @throws IllegalArgumentException if {@code array} is empty
248 * Returns the greatest value present in {@code array}.
250 * @param array a <i>nonempty</i> array of {@code primtyp} values
251 * @return the value present in {@code array} that is greater than or equal to
253 * @throws IllegalArgumentException if {@code array} is empty
268 * For example, {@code concat(new primtyp[] {a, b}, new primtyp[] {}, new
269 * primtyp[] {c}} returns the array {@code {a, b, c}}.
271 * @param arrays zero or more {@code primtyp} arrays
290 * Returns a big-endian representation of {@code value} in a ?-element byte
291 * array; equivalent to {@code
293 * value {@code ?} would yield the byte array {@code {?}}.
308 * Returns the {@code primtyp} value whose big-endian representation is
309 * stored in the first ? bytes of {@code bytes}; equivalent to {@code
311 * {@code {?}} would yield the {@code primtyp} value {@code ?}.
316 * @throws IllegalArgumentException if {@code bytes} has fewer than ?
327 * Returns an array containing the same values as {@code array}, but
328 * guaranteed to be of a specified minimum length. If {@code array} already
329 * has a length of at least {@code minLength}, it is returned directly.
330 * Otherwise, a new array of size {@code minLength + padding} is returned,
331 * containing the values of {@code array}, and zeroes in the remaining places.
337 * @throws IllegalArgumentException if {@code minLength} or {@code padding} is
339 * @return an array containing the values of {@code array}, with guaranteed
340 * minimum length {@code minLength}
359 * Returns a string containing the supplied {@code primtyp} values separated
360 * by {@code separator}. For example, {@code join("-", 1?, 2?, 3?)} returns
361 * the string {@code "1-2-3"}.
365 * @param array an array of {@code primtyp} values, possibly empty
383 * Returns a comparator that compares two {@code primtyp} arrays
387 * shorter array as the lesser. For example, {@code [] < [1] < [1, 2] < [2]}.
417 * Copies a collection of {@code WrapperCl} instances into a new array of
418 * primitive {@code primtyp} values.
420 * <p>Elements are copied from the argument collection as if by {@code
424 * @param collection a collection of {@code WrapperCl} objects
425 * @return an array containing the same values as {@code collection}, in the
427 * @throws NullPointerException if {@code collection} or any of its elements
447 * but any attempt to set a value to {@code null} will result in a {@link
451 * {@code WrapperCl} objects written to or read from it. For example, whether
452 * {@code list.get(0) == list.get(0)} is true for the returned list is
