code stringlengths 23 201k | docstring stringlengths 17 96.2k | func_name stringlengths 0 235 | language stringclasses 1
value | repo stringlengths 8 72 | path stringlengths 11 317 | url stringlengths 57 377 | license stringclasses 7
values |
|---|---|---|---|---|---|---|---|
@Override
public Set<Characteristics> characteristics() {
return EnumSet.of(Characteristics.IDENTITY_FINISH);
} | @param capacity the initial capacity of the list which collects values.
@return a Java stream collector which can be used to construct a LinearList | characteristics | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> Collector<V, List<V>, List<V>> collector() {
return new Collector<V, List<V>, List<V>>() {
@Override
public Supplier<List<V>> supplier() {
return () -> new List().linear();
}
@Override
public BiConsumer<List<V>, V> accumulator() {
return List::addLast... | @return a Java stream collector which can be used to construct a List | collector | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
@Override
public Supplier<List<V>> supplier() {
return () -> new List().linear();
} | @return a Java stream collector which can be used to construct a List | supplier | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
@Override
public BiConsumer<List<V>, V> accumulator() {
return List::addLast;
} | @return a Java stream collector which can be used to construct a List | accumulator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
@Override
public BinaryOperator<List<V>> combiner() {
return (a, b) -> (List<V>) a.concat(b);
} | @return a Java stream collector which can be used to construct a List | combiner | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
@Override
public Function<List<V>, List<V>> finisher() {
return List::forked;
} | @return a Java stream collector which can be used to construct a List | finisher | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
@Override
public java.util.Set<Characteristics> characteristics() {
return EnumSet.noneOf(Characteristics.class);
} | @return a Java stream collector which can be used to construct a List | characteristics | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> Iterator<V> iterator(IList<V> list, long startIndex) {
return Iterators.range(startIndex, list.size(), list::nth);
} | @return an iterator over the list which repeatedly calls nth() | iterator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> IList<V> concat(IList<V> a, IList<V> b) {
IList<V> result;
if (a.size() == 0) {
result = b;
} else if (b.size() == 0) {
result = a;
} else if (a instanceof ConcatList) {
result = a.concat(b);
} else if (b instanceof ConcatList) {
result = new ConcatList<>(a)... | @return a concatenation of the two lists, which is linear if {@code a} is linear | concat | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> IList<V> reverse(IList<V> l) {
return Lists.from(l.size(), i -> l.nth(l.size() - (i + 1)));
} | @return a concatenation of the two lists, which is linear if {@code a} is linear | reverse | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> IList<V> sort(IList<V> l, Comparator<V> comparator) {
Object[] array = l.toArray();
Arrays.sort(array, (a, b) -> comparator.compare((V) a, (V) b));
return (IList<V>) Lists.from(array);
} | @return a concatenation of the two lists, which is linear if {@code a} is linear | sort | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> IList<V> sort(IList<V> l) {
return sort(l, (Comparator<V>) Comparator.naturalOrder());
} | @return a concatenation of the two lists, which is linear if {@code a} is linear | sort | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <V> IList<V> concat(IList<V>... lists) {
return Arrays.stream(lists).reduce(Lists::concat).orElseGet(List::new);
} | @return a concatenation of all the lists | concat | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Lists.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Lists.java | MIT |
public static <K, V> Map<K, V> from(IMap<K, V> map) {
if (map instanceof Map) {
return (Map<K, V>) map.forked();
} else {
Map<K, V> result = new Map<K, V>(map.keyHash(), map.keyEquality()).linear();
map.forEach(e -> result.put(e.key(), e.value()));
return result.forked();
}
} | @param map another map
@return an equivalent forked map, with the same equality semantics | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public static <K, V> Map<K, V> from(java.util.Map<K, V> map) {
return map.entrySet().stream().collect(Maps.collector(java.util.Map.Entry::getKey, java.util.Map.Entry::getValue));
} | @return a forked map with the same contents as {@code map} | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public static <K, V> Map<K, V> from(Iterator<IEntry<K, V>> entries) {
Map<K, V> m = new Map<K, V>().linear();
entries.forEachRemaining(e -> m.put(e.key(), e.value()));
return m.forked();
} | @param entries an iterator of {@code IEntry} objects
@return a forked map containing the remaining entries | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public static <K, V> Map<K, V> from(IList<IEntry<K, V>> entries) {
return entries.stream().collect(Maps.collector(IEntry::key, IEntry::value));
} | @param entries a list of {@code IEntry} objects
@return a forked map containing these entries | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public static <K, V> Map<K, V> empty() {
return (Map<K, V>) EMPTY;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | empty | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Set<K> keys() {
return new Set<K>((Map<K, Void>) this);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | keys | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public ToLongFunction<K> keyHash() {
return hashFn;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | keyHash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public BiPredicate<K, K> keyEquality() {
return equalsFn;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | keyEquality | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public V get(K key, V defaultValue) {
Object val = MapNodes.get(root, 0, keyHash(key), key, equalsFn, DEFAULT_VALUE);
return val == DEFAULT_VALUE ? defaultValue : (V) val;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | get | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> put(K key, V value, BinaryOperator<V> merge) {
return put(key, value, merge, isLinear() ? editor : new Object());
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | put | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public Map<K, V> put(K key, V value, BinaryOperator<V> merge, Object editor) {
Node<K, V> rootPrime = root.put(0, editor, keyHash(key), key, value, equalsFn, merge);
if (isLinear() && editor == this.editor) {
root = rootPrime;
super.hash = -1;
return this;
} else {
return new Map<K,... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | put | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> update(K key, UnaryOperator<V> update) {
return update(key, update, isLinear() ? editor : new Object());
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | update | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public Map<K, V> update(K key, UnaryOperator<V> update, Object editor) {
return put(key, update.apply(get(key, null)), (BinaryOperator<V>) Maps.MERGE_LAST_WRITE_WINS, editor);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | update | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> remove(K key) {
return remove(key, isLinear() ? editor : new Object());
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | remove | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public Map<K, V> remove(K key, Object editor) {
Node<K, V> rootPrime = (Node<K, V>) root.remove(0, editor, keyHash(key), key, equalsFn);
if (isLinear() && editor == this.editor) {
root = rootPrime;
super.hash = -1;
return this;
} else {
return new Map<K, V>(rootPrime, hashFn, equals... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | remove | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public boolean contains(K key) {
return MapNodes.contains(root, 0, keyHash(key), key, equalsFn);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | contains | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public OptionalLong indexOf(K key) {
long idx = root.indexOf(0, keyHash(key), key, keyEquality());
return idx < 0 ? OptionalLong.empty() : OptionalLong.of(idx);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | indexOf | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public IEntry<K, V> nth(long idx) {
if (idx < 0 || idx >= size()) {
throw new IndexOutOfBoundsException();
}
return root.nth(idx);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | nth | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> forked() {
if (isLinear()) {
return new Map<>(root, hashFn, equalsFn, false);
} else {
return this;
}
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | forked | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> linear() {
if (isLinear()) {
return this;
} else {
return new Map<>(root, hashFn, equalsFn, true);
}
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | linear | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public <U> Map<K, U> mapValues(BiFunction<K, V, U> f) {
return new Map<K, U>(root.mapVals(new Object(), f), hashFn, equalsFn, isLinear());
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | mapValues | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public List<Map<K, V>> split(int parts) {
List<Map<K, V>> list = new List<Map<K, V>>().linear();
MapNodes.split(new Object(), root, (int) Math.ceil(size() / (float) parts))
.stream()
.map(n -> new Map<K, V>(n, hashFn, equalsFn, false))
.forEach(list::addLast);
return list... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | split | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> union(IMap<K, V> m) {
return merge(m, Maps.MERGE_LAST_WRITE_WINS);
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | union | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> merge(IMap<K, V> m, BinaryOperator<V> mergeFn) {
if (m instanceof Map && Maps.equivEquality(this, m)) {
Node<K, V> rootPrime = MapNodes.merge(0, editor, root, ((Map) m).root, equalsFn, mergeFn);
return new Map<>(rootPrime, hashFn, equalsFn, isLinear());
} else {
re... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | merge | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> difference(ISet<K> keys) {
if (keys instanceof Set && Maps.equivEquality(this, keys)) {
return difference(((Set<K>) keys).map);
} else {
return (Map<K, V>) Maps.difference(this.clone(), keys);
}
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | difference | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> intersection(ISet<K> keys) {
if (keys instanceof Set && Maps.equivEquality(this, keys)) {
return intersection(((Set<K>) keys).map);
} else {
Map<K, V> map = (Map<K, V>) Maps.intersection(new Map<K, V>(hashFn, equalsFn).linear(), this, keys);
return isLinear() ? map... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | intersection | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> difference(IMap<K, ?> m) {
if (m instanceof Map && Maps.equivEquality(this, m)) {
Node<K, V> rootPrime = MapNodes.difference(0, editor, root, ((Map) m).root, equalsFn);
return new Map<>(rootPrime == null ? Node.EMPTY : rootPrime, hashFn, equalsFn, isLinear());
} else {
... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | difference | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> intersection(IMap<K, ?> m) {
if (m instanceof Map && Maps.equivEquality(this, m)) {
Node<K, V> rootPrime = MapNodes.intersection(0, editor, root, ((Map) m).root, equalsFn);
return new Map<>(rootPrime == null ? Node.EMPTY : rootPrime, hashFn, equalsFn, isLinear());
} else... | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | intersection | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public long size() {
return root.size();
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | size | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public boolean isLinear() {
return editor != null;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | isLinear | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Iterator<IEntry<K, V>> iterator() {
return root.iterator();
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | iterator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public boolean equals(IMap<K, V> m, BiPredicate<V, V> valEquals) {
if (m instanceof Map && keyHash() == m.keyHash()) {
return root.equals(((Map<K, V>) m).root, equalsFn, valEquals);
} else {
return Maps.equals(this, m, valEquals);
}
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public boolean equals(Object obj) {
if (obj instanceof IMap) {
return equals((IMap<K, V>) obj, Objects::equals);
}
return false;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
@Override
public Map<K, V> clone() {
return isLinear() ? forked().linear() : this;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | clone | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
private int keyHash(K key) {
long hash64 = hashFn.applyAsLong(key);
int hash = (int) ((hash64 >> 32) ^ hash64);
// make sure we don't have too many collisions in the lower bits
hash ^= (hash >>> 20) ^ (hash >>> 12);
hash ^= (hash >>> 7) ^ (hash >>> 4);
return hash;
} | Creates a map.
@param hashFn a function which yields the hash value of keys
@param equalsFn a function which checks equality of keys | keyHash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Map.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Map.java | MIT |
public K key() {
return key;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | key | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public V value() {
return value;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | value | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public String toString() {
return key + " = " + value;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | toString | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public int hashCode() {
return Objects.hash(key, value);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | hashCode | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean equals(Object obj) {
if (obj instanceof IEntry) {
IEntry<K, V> e = (IEntry<K, V>) obj;
return Objects.equals(key, e.key()) && Objects.equals(value, e.value());
}
return false;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public long keyHash() {
return keyHash;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keyHash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public int hashCode() {
return Objects.hash(keyHash, key(), value());
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | hashCode | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean equals(Object obj) {
if (obj instanceof IEntry.WithHash) {
IEntry.WithHash<K, V> e = (IEntry.WithHash<K, V>) obj;
return keyHash == e.keyHash() && Objects.equals(key(), e.key()) && Objects.equals(value(), e.value());
} else {
return false;
}
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> String toString(IMap<K, V> m) {
return toString(m, Objects::toString, Objects::toString);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | toString | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> String toString(IMap<K, V> m, Function<K, String> keyPrinter, Function<V, String> valPrinter) {
StringBuilder sb = new StringBuilder("{");
Iterator<IEntry<K, V>> it = m.entries().iterator();
while (it.hasNext()) {
IEntry<K, V> entry = it.next();
sb.append(keyPrinter.apply(e... | Utility functions for classes implementing {@link IMap}.
@author ztellman | toString | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> long hash(IMap<K, V> m) {
ToLongFunction<K> hashFn = m.keyHash();
return hash(m, e -> (hashFn.applyAsLong(e.key()) * 31) ^ Objects.hashCode(e.value()), Long::sum);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | hash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> long hash(IMap<K, V> m, ToLongFunction<IEntry<K, V>> hash, LongBinaryOperator combiner) {
return m.entries().stream().mapToLong(hash).reduce(combiner).orElse(0);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | hash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> boolean equals(IMap<K, V> a, IMap<K, V> b) {
return equals(a, b, Objects::equals);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> boolean equals(IMap<K, V> a, IMap<K, V> b, BiPredicate<V, V> valEquals) {
if (a.size() != b.size()) {
return false;
} else if (a == b) {
return true;
}
return a.entries().stream().allMatch(e -> {
Object val = ((IMap<K, Object>) b).get(e.key(), DEFAULT_VALUE);
... | Utility functions for classes implementing {@link IMap}.
@author ztellman | equals | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> ISortedMap<K, V> from(ISortedSet<K> keys, Function<K, V> lookup) {
return from(keys, lookup, () -> Iterators.map(keys.iterator(), k -> IEntry.of(k, lookup.apply(k))));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> ISortedMap<K, V> from(
ISortedSet<K> keys,
Function<K, V> lookup,
Supplier<Iterator<IEntry<K, V>>> iterator
) {
return new ISortedMap.Mixin<K, V>() {
@Override
public ISortedSet<K> keys() {
return keys;
}
@Override
public Comparator<K> ... | Utility functions for classes implementing {@link IMap}.
@author ztellman | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ISortedSet<K> keys() {
return keys;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keys | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public Comparator<K> comparator() {
return keys.comparator();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | comparator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public OptionalLong inclusiveFloorIndex(K key) {
return keys.floorIndex(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | inclusiveFloorIndex | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public OptionalLong ceilIndex(K key) {
return keys.ceilIndex(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | ceilIndex | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public long size() {
return keys.size();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | size | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public IEntry<K, V> nth(long idx) {
K key = keys.nth(idx);
return IEntry.of(key, lookup.apply(key));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | nth | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ISortedMap<K, V> put(K key, V value, BinaryOperator<V> merge) {
return new SortedMap<K,V>(comparator()).merge(this, Maps.MERGE_LAST_WRITE_WINS).put(key, value, merge);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | put | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ISortedMap<K, V> remove(K key) {
return new SortedMap<K,V>(comparator()).merge(this, Maps.MERGE_LAST_WRITE_WINS).remove(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | remove | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ISortedMap<K, V> linear() {
return new SortedMap<K,V>(comparator()).linear();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | linear | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public Iterator<IEntry<K, V>> iterator() {
return iterator.get();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | iterator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> IMap<K, V> from(ISet<K> keys, Function<K, V> lookup) {
return from(keys, lookup, () -> Iterators.map(keys.iterator(), k -> IEntry.of(k, lookup.apply(k))));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> IMap<K, V> from(ISet<K> keys, Function<K, V> lookup, Supplier<Iterator<IEntry<K, V>>> iterator) {
return new IMap.Mixin<K, V>() {
@Override
public boolean contains(K key) {
return keys.contains(key);
}
@Override
public Iterator<IEntry<K, V>> iterator() {
... | Utility functions for classes implementing {@link IMap}.
@author ztellman | from | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean contains(K key) {
return keys.contains(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | contains | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public Iterator<IEntry<K, V>> iterator() {
return iterator.get();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | iterator | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public OptionalLong indexOf(K key) {
return keys.indexOf(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | indexOf | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public IEntry<K, V> nth(long idx) {
K key = keys.nth(idx);
return new Entry<>(key, lookup.apply(key));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | nth | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ISet<K> keys() {
return keys;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keys | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public long size() {
return keys.size();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | size | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public ToLongFunction<K> keyHash() {
return keys.valueHash();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keyHash | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public BiPredicate<K, K> keyEquality() {
return keys.valueEquality();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keyEquality | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public IMap<K, V> put(K key, V value, BinaryOperator<V> merge) {
return Map.from(this).put(key, value, merge);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | put | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public IMap<K, V> remove(K key) {
return Map.from(this).remove(key);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | remove | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public IMap<K, V> linear() {
return Map.from(this).linear();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | linear | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
public static <K, V> java.util.Map<K, V> toMap(IMap<K, V> map) {
return new java.util.Map<K, V>() {
@Override
public int size() {
return (int) map.size();
}
@Override
public boolean isEmpty() {
return map.size() == 0;
}
@Override
public boolean cont... | Utility functions for classes implementing {@link IMap}.
@author ztellman | toMap | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public int size() {
return (int) map.size();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | size | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean isEmpty() {
return map.size() == 0;
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | isEmpty | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean containsKey(Object key) {
return map.get((K) key).isPresent();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | containsKey | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public boolean containsValue(Object value) {
return map.entries().stream().anyMatch(e -> Objects.equals(value, e.value()));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | containsValue | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public V get(Object key) {
return map.get((K) key).orElse(null);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | get | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public V put(K key, V value) {
throw new UnsupportedOperationException();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | put | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public V remove(Object key) {
throw new UnsupportedOperationException();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | remove | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public void putAll(java.util.Map<? extends K, ? extends V> m) {
throw new UnsupportedOperationException();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | putAll | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public void clear() {
throw new UnsupportedOperationException();
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | clear | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public java.util.Set<K> keySet() {
return Sets.toSet(
lazyMap(map.entries(), IEntry::key),
k -> map.get(k).isPresent()
);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | keySet | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public Collection<V> values() {
return Lists.toList(lazyMap(map.entries(), IEntry::value));
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | values | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
@Override
public java.util.Set<Entry<K, V>> entrySet() {
return Sets.toSet(
lazyMap(map.entries(), Maps::toEntry),
e -> map.get(e.getKey()).map(v -> Objects.equals(v, e.getValue())).orElse(false)
);
} | Utility functions for classes implementing {@link IMap}.
@author ztellman | entrySet | java | lacuna/bifurcan | src/io/lacuna/bifurcan/Maps.java | https://github.com/lacuna/bifurcan/blob/master/src/io/lacuna/bifurcan/Maps.java | MIT |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.