7
7
8
8
/**
9
9
* Implementations of stream {@link Collector}s for the maps and sets in this
10
- * package. Variations include map versus bimap , and various sorting options
10
+ * package. Variations include map versus bi-map , and various sorting options
11
11
* for those sets and maps that are ordered.
12
12
*
13
13
* @author run2000
@@ -106,16 +106,16 @@ private Collectors() {
106
106
107
107
/**
108
108
* Returns a {@code Collector} that accumulates the input elements into a
109
- * new {@code ImmutableArrayMap}, created as a bimap , in encounter order.
109
+ * new {@code ImmutableArrayMap}, created as a bi-map , in encounter order.
110
110
* <p>
111
- * A bimap is a map where both keys and values are unique. Any given key
111
+ * A bi-map is a map where both keys and values are unique. Any given key
112
112
* can be mapped "forwards" to a single value; any given value can be
113
113
* mapped "backwards" to a single key.
114
114
*
115
115
* @param <K> the type of keys in the resulting map
116
116
* @param <V> the type of values in the resulting map
117
117
* @return a {@code Collector} which collects all the input keys and values
118
- * into a {@code ImmutableArrayMap}, created as a bimap , in encounter order
118
+ * into a {@code ImmutableArrayMap}, created as a bi-map , in encounter order
119
119
*/
120
120
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableArrayMap <K ,V >> toImmutableArrayBiMap () {
121
121
return Collector .<Map .Entry <? extends K ,? extends V >, ImmutableArrayMapBuilder <K ,V >, ImmutableArrayMap <K ,V >>of (
@@ -144,17 +144,17 @@ private Collectors() {
144
144
145
145
/**
146
146
* Returns a {@code Collector} that accumulates the input elements into a
147
- * new {@code ImmutableHashedArrayMap}, created as a bimap , in
147
+ * new {@code ImmutableHashedArrayMap}, created as a bi-map , in
148
148
* encounter order.
149
149
* <p>
150
- * A bimap is a map where both keys and values are unique. Any given key
150
+ * A bi-map is a map where both keys and values are unique. Any given key
151
151
* can be mapped "forwards" to a single value; any given value can be
152
152
* mapped "backwards" to a single key.
153
153
*
154
154
* @param <K> the type of keys in the resulting map
155
155
* @param <V> the type of values in the resulting map
156
156
* @return a {@code Collector} which collects all the input keys and values
157
- * into a {@code ImmutableHashedArrayMap}, created as a bimap , in
157
+ * into a {@code ImmutableHashedArrayMap}, created as a bi-map , in
158
158
* encounter order
159
159
*/
160
160
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableHashedArrayMap <K ,V >> toImmutableHashedArrayBiMap () {
@@ -254,18 +254,18 @@ private Collectors() {
254
254
255
255
/**
256
256
* Returns a {@code Collector} that accumulates the input elements into a
257
- * new {@code ImmutableSortedArrayMap}, created as a bimap , with elements
257
+ * new {@code ImmutableSortedArrayMap}, created as a bi-map , with elements
258
258
* ordered by their natural order.
259
259
* <p>
260
- * A bimap is a map where both keys and values are unique. Any given key
260
+ * A bi-map is a map where both keys and values are unique. Any given key
261
261
* can be mapped "forwards" to a single value; any given value can be
262
262
* mapped "backwards" to a single key.
263
263
*
264
264
* @param <K> the type of keys in the resulting map
265
265
* @param <V> the type of values in the resulting map
266
266
* @return a {@code Collector} which collects all the input keys and values
267
- * into a {@code ImmutableSortedArrayMap}, with elements ordered by their
268
- * natural order
267
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with
268
+ * elements ordered by their natural order
269
269
*/
270
270
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableSortedArrayMap <K ,V >> toImmutableSortedArrayBiMap () {
271
271
return Collector .<Map .Entry <? extends K ,? extends V >, ImmutableSortedArrayMapBuilder <K ,V >, ImmutableSortedArrayMap <K ,V >>of (
@@ -277,10 +277,10 @@ private Collectors() {
277
277
278
278
/**
279
279
* Returns a {@code Collector} that accumulates the input elements into a
280
- * new {@code ImmutableSortedArrayMap}, created as a bimap , with keys
280
+ * new {@code ImmutableSortedArrayMap}, created as a bi-map , with keys
281
281
* ordered by the given {@code Comparator}.
282
282
* <p>
283
- * A bimap is a map where both keys and values are unique. Any given key
283
+ * A bi-map is a map where both keys and values are unique. Any given key
284
284
* can be mapped "forwards" to a single value; any given value can be
285
285
* mapped "backwards" to a single key.
286
286
*
@@ -289,8 +289,8 @@ private Collectors() {
289
289
* @param keyCmp a comparator for ordering keys, or {@code null} to indicate
290
290
* natural key ordering
291
291
* @return a {@code Collector} which collects all the input keys and values
292
- * into a {@code ImmutableSortedArrayMap}, with keys ordered by the given
293
- * comparator
292
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with keys
293
+ * ordered by the given comparator
294
294
*/
295
295
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableSortedArrayMap <K ,V >> toImmutableSortedArrayBiMapComparingKeys (
296
296
final Comparator <? super K > keyCmp ) {
@@ -303,10 +303,10 @@ private Collectors() {
303
303
304
304
/**
305
305
* Returns a {@code Collector} that accumulates the input elements into a
306
- * new {@code ImmutableSortedArrayMap}, created as a bimap , with values
306
+ * new {@code ImmutableSortedArrayMap}, created as a bi-map , with values
307
307
* ordered by the given {@code Comparator}.
308
308
* <p>
309
- * A bimap is a map where both keys and values are unique. Any given key
309
+ * A bi-map is a map where both keys and values are unique. Any given key
310
310
* can be mapped "forwards" to a single value; any given value can be
311
311
* mapped "backwards" to a single key.
312
312
*
@@ -315,8 +315,8 @@ private Collectors() {
315
315
* @param valCmp a comparator for ordering values, or {@code null}
316
316
* to indicate natural value ordering
317
317
* @return a {@code Collector} which collects all the input keys and values
318
- * into a {@code ImmutableSortedArrayMap}, with values ordered by the given
319
- * comparator
318
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with values
319
+ * ordered by the given comparator
320
320
*/
321
321
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableSortedArrayMap <K ,V >> toImmutableSortedArrayBiMapComparingValues (
322
322
final Comparator <? super V > valCmp ) {
@@ -329,10 +329,10 @@ private Collectors() {
329
329
330
330
/**
331
331
* Returns a {@code Collector} that accumulates the input elements into a
332
- * new {@code ImmutableSortedArrayMap}, created as a bimap , with keys
332
+ * new {@code ImmutableSortedArrayMap}, created as a bi-map , with keys
333
333
* and values ordered by the given {@code Comparator}s.
334
334
* <p>
335
- * A bimap is a map where both keys and values are unique. Any given key
335
+ * A bi-map is a map where both keys and values are unique. Any given key
336
336
* can be mapped "forwards" to a single value; any given value can be
337
337
* mapped "backwards" to a single key.
338
338
*
@@ -343,8 +343,8 @@ private Collectors() {
343
343
* @param valCmp a comparator for ordering values, or {@code null}
344
344
* to indicate natural value ordering
345
345
* @return a {@code Collector} which collects all the input keys and values
346
- * into a {@code ImmutableSortedArrayMap}, with keys and values ordered by
347
- * the given comparators
346
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with keys
347
+ * and values ordered by the given comparators
348
348
*/
349
349
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableSortedArrayMap <K ,V >> toImmutableSortedArrayBiMapComparingKeysAndValues (
350
350
final Comparator <? super K > keyCmp , final Comparator <? super V > valCmp ) {
@@ -398,18 +398,18 @@ private Collectors() {
398
398
399
399
/**
400
400
* Returns a {@code Collector} that accumulates the input elements into a
401
- * new {@code ImmutableUniSortedArrayMap}, created as a bimap , with keys
401
+ * new {@code ImmutableUniSortedArrayMap}, created as a bi-map , with keys
402
402
* ordered by their natural order.
403
403
* <p>
404
- * A bimap is a map where both keys and values are unique. Any given key
404
+ * A bi-map is a map where both keys and values are unique. Any given key
405
405
* can be mapped "forwards" to a single value; any given value can be
406
406
* mapped "backwards" to a single key.
407
407
*
408
408
* @param <K> the type of keys in the resulting map
409
409
* @param <V> the type of values in the resulting map
410
410
* @return a {@code Collector} which collects all the input keys and values
411
- * into a {@code ImmutableSortedArrayMap}, with keys ordered by their
412
- * natural order
411
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with keys
412
+ * ordered by their natural order
413
413
*/
414
414
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableUniSortedArrayMap <K ,V >> toImmutableUniSortedArrayBiMap () {
415
415
return Collector .<Map .Entry <? extends K ,? extends V >, ImmutableUniSortedArrayMapBuilder <K ,V >, ImmutableUniSortedArrayMap <K ,V >>of (
@@ -421,10 +421,10 @@ private Collectors() {
421
421
422
422
/**
423
423
* Returns a {@code Collector} that accumulates the input elements into a
424
- * new {@code ImmutableUniSortedArrayMap}, created as a bimap , with keys
424
+ * new {@code ImmutableUniSortedArrayMap}, created as a bi-map , with keys
425
425
* ordered by the given {@code Comparator}.
426
426
* <p>
427
- * A bimap is a map where both keys and values are unique. Any given key
427
+ * A bi-map is a map where both keys and values are unique. Any given key
428
428
* can be mapped "forwards" to a single value; any given value can be
429
429
* mapped "backwards" to a single key.
430
430
*
@@ -433,8 +433,8 @@ private Collectors() {
433
433
* @param keyCmp a comparator for ordering keys, or {@code null} to indicate
434
434
* natural key ordering
435
435
* @return a {@code Collector} which collects all the input keys and values
436
- * into a {@code ImmutableSortedArrayMap}, with keys ordered by the given
437
- * comparator
436
+ * into a {@code ImmutableSortedArrayMap}, created as a bi-map, with keys
437
+ * ordered by the given comparator
438
438
*/
439
439
public static <K ,V > Collector <Map .Entry <? extends K ,? extends V >, ?, ImmutableUniSortedArrayMap <K ,V >> toImmutableUniSortedArrayBiMapComparing (
440
440
final Comparator <? super K > keyCmp ) {
0 commit comments