Index (flub API)

A B C D E G H I M O P R S T W
All Classes and Interfaces|All Packages

A

accept(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingConsumer
accept(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiConsumer
acceptThrowing(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingConsumer: Invokes the bi-consumer.
acceptThrowing(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiConsumer: Invokes the bi-consumer.
add(Iterable) - Method in class dev.kkorolyov.flub.data.Trie: Adds a complete value to this trie.
add(T) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Adds a new element and returns its index to use for subsequent modifications.
add(T[]) - Method in class dev.kkorolyov.flub.data.Trie
add(T, int) - Method in class dev.kkorolyov.flub.data.WeightedDistribution: Adds a weighted value to this distribution.
add(T, T...) - Method in class dev.kkorolyov.flub.data.Trie
andThen(Converter) - Method in interface dev.kkorolyov.flub.function.convert.Converter
append(Iterable, T...) - Static method in class dev.kkorolyov.flub.collections.Iterables: Returns an iterable which iterates first over all elements in iterable, then over all others
append(T, T...) - Static method in class dev.kkorolyov.flub.collections.Iterables: Convenience overload of Iterables.append(Iterable, Object[]) for "at least one" var-args usages.
apply(Graph) - Method in interface dev.kkorolyov.flub.data.procedure.TopologicalSort: Returns a list of notes denoting a topological sorting of graph.
apply(Graph, T, T) - Method in interface dev.kkorolyov.flub.data.procedure.ShortestPath: Returns a list of nodes denoting a shortest path in graph from start to end.
apply(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingFunction
apply(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiFunction
applyThrowing(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingFunction: Invokes the function
applyThrowing(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiFunction: Invokes the bi-function.
aStar(BinaryOperator, BiFunction) - Static method in interface dev.kkorolyov.flub.data.procedure.ShortestPath: Returns a shortest path procedure which

B

bfs() - Static method in interface dev.kkorolyov.flub.data.procedure.ShortestPath: Returns a shortest path procedure which:
BiConverter<T,R> - Class in dev.kkorolyov.flub.function.convert: Similar to Converter, but able to convert bi-directionally.
BiConverter(Converter, Converter) - Constructor for class dev.kkorolyov.flub.function.convert.BiConverter: Constructs a new bi-converter.

C

clear() - Method in class dev.kkorolyov.flub.data.Graph: Removes all values in this graph.
concat(Iterable...) - Static method in class dev.kkorolyov.flub.collections.Iterables
concat(Iterable) - Static method in class dev.kkorolyov.flub.collections.Iterables: Returns an iterable which iterates over all elements of the given iterables in sequence.
contains(Iterable) - Method in class dev.kkorolyov.flub.data.Trie
contains(T) - Method in class dev.kkorolyov.flub.data.Graph
contains(T) - Method in class dev.kkorolyov.flub.data.Trie.Node
contains(T[]) - Method in class dev.kkorolyov.flub.data.Trie
contains(T, T...) - Method in class dev.kkorolyov.flub.data.Trie
convert(Iterable) - Method in interface dev.kkorolyov.flub.function.convert.Converter: Converts multiple Ts to Rs.
convert(T) - Method in interface dev.kkorolyov.flub.function.convert.Converter: Converts a T to an R.
Converter<T,R> - Interface in dev.kkorolyov.flub.function.convert: Converts elements from T to R.
convertIn(Iterable) - Method in class dev.kkorolyov.flub.function.convert.BiConverter: Converts elements using the incoming handler.
convertIn(R) - Method in class dev.kkorolyov.flub.function.convert.BiConverter: Converts an element using the incoming handler.
convertOut(Iterable) - Method in class dev.kkorolyov.flub.function.convert.BiConverter: Converts elements using the outgoing handler.
convertOut(T) - Method in class dev.kkorolyov.flub.function.convert.BiConverter: Converts an element using the outgoing handler.

D

dev.kkorolyov.flub - module dev.kkorolyov.flub
dev.kkorolyov.flub.collections - package dev.kkorolyov.flub.collections
dev.kkorolyov.flub.data - package dev.kkorolyov.flub.data
dev.kkorolyov.flub.data.procedure - package dev.kkorolyov.flub.data.procedure
dev.kkorolyov.flub.function - package dev.kkorolyov.flub.function
dev.kkorolyov.flub.function.convert - package dev.kkorolyov.flub.function.convert
dev.kkorolyov.flub.function.throwing - package dev.kkorolyov.flub.function.throwing
dfs() - Static method in interface dev.kkorolyov.flub.data.procedure.TopologicalSort: Returns a topological sorting procedure which:
dijkstra() - Static method in interface dev.kkorolyov.flub.data.procedure.ShortestPath: ShortestPath.dijkstra(BinaryOperator) with a convenience adder for numerical edges
dijkstra(BinaryOperator) - Static method in interface dev.kkorolyov.flub.data.procedure.ShortestPath: Returns a shortest path procedure which:

E

enforcing(Converter) - Static method in interface dev.kkorolyov.flub.function.convert.Converter: Returns a converter which converts with delegate and throws if it returns an empty optional.
equals(Object) - Method in class dev.kkorolyov.flub.data.SparseMultiset
equals(Object) - Method in class dev.kkorolyov.flub.function.convert.BiConverter

G

get() - Method in class dev.kkorolyov.flub.data.WeightedDistribution
get() - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingSupplier
get(int) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Returns the element at index i.
get(Iterable) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Returns all elements associated with all keys.
get(Iterable) - Method in class dev.kkorolyov.flub.data.Trie
get(T) - Method in class dev.kkorolyov.flub.data.Graph
get(T) - Method in class dev.kkorolyov.flub.data.Trie.Node
get(T[]) - Method in class dev.kkorolyov.flub.data.Trie
get(T, T...) - Method in class dev.kkorolyov.flub.data.Trie
getEdge() - Method in class dev.kkorolyov.flub.data.Graph.Node.RelatedNode
getInboundRelations() - Method in class dev.kkorolyov.flub.data.Graph.Node
getInbounds() - Method in class dev.kkorolyov.flub.data.Graph.Node
getInbounds(T) - Method in class dev.kkorolyov.flub.data.Graph
getKeys() - Method in class dev.kkorolyov.flub.data.Trie.Node
getNode() - Method in class dev.kkorolyov.flub.data.Graph.Node.RelatedNode
getNodes() - Method in class dev.kkorolyov.flub.data.Graph
getOutboundRelations() - Method in class dev.kkorolyov.flub.data.Graph.Node
getOutbounds() - Method in class dev.kkorolyov.flub.data.Graph.Node
getOutbounds(T) - Method in class dev.kkorolyov.flub.data.Graph
getThrowing() - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingSupplier: Invokes the supplier.
getValue() - Method in class dev.kkorolyov.flub.data.Graph.Node
getValue() - Method in class dev.kkorolyov.flub.data.Trie.Node
getValues() - Method in class dev.kkorolyov.flub.data.Graph
Graph<T,E> - Class in dev.kkorolyov.flub.data: A collection of values connected by weighted outbound and inbound edges to other values.
Graph() - Constructor for class dev.kkorolyov.flub.data.Graph
Graph.Node<T,E> - Class in dev.kkorolyov.flub.data: An individual vertex with outbound and inbound edges in a Graph.
Graph.Node.RelatedNode<T,E> - Class in dev.kkorolyov.flub.data: A connected Graph.Node along with additional connection metadata.

H

hashCode() - Method in class dev.kkorolyov.flub.data.SparseMultiset
hashCode() - Method in class dev.kkorolyov.flub.function.convert.BiConverter

I

inDegree() - Method in class dev.kkorolyov.flub.data.Graph.Node
inDegree(T) - Method in class dev.kkorolyov.flub.data.Graph
isConnected() - Method in class dev.kkorolyov.flub.data.Graph.Node
isConnected(T) - Method in class dev.kkorolyov.flub.data.Graph
isTerminal() - Method in class dev.kkorolyov.flub.data.Trie.Node
Iterables - Class in dev.kkorolyov.flub.collections: Additional utility methods for generating or otherwise working with Iterables.
iterator() - Method in class dev.kkorolyov.flub.data.Graph
iterator() - Method in class dev.kkorolyov.flub.data.SparseMultiset

M

matches(Iterable, Iterable) - Static method in class dev.kkorolyov.flub.collections.Iterables: Checks whether two iterables are composed of the same elements in the same iteration order.
memoize(BiFunction) - Static method in class dev.kkorolyov.flub.function.Memoizer
memoize(Function) - Static method in class dev.kkorolyov.flub.function.Memoizer
memoize(Supplier) - Static method in class dev.kkorolyov.flub.function.Memoizer
Memoizer<T,R> - Class in dev.kkorolyov.flub.function: Memoizes results of function invocations.
Memoizer() - Constructor for class dev.kkorolyov.flub.function.Memoizer

O

outDegree() - Method in class dev.kkorolyov.flub.data.Graph.Node
outDegree(T) - Method in class dev.kkorolyov.flub.data.Graph

P

put(int, Iterable) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Associates keys with element at index i.
put(T, Iterable) - Method in class dev.kkorolyov.flub.data.Graph: Adds or updates a value in this graph.
put(T, Map) - Method in class dev.kkorolyov.flub.data.Graph: Adds or updates a value in this graph.
put(T, T...) - Method in class dev.kkorolyov.flub.data.Graph
put(T, T, E) - Method in class dev.kkorolyov.flub.data.Graph
putUndirected(T, Iterable) - Method in class dev.kkorolyov.flub.data.Graph: Like Graph.put(Object, Iterable), but also adds an inverse edge between connected node pairs.
putUndirected(T, Map) - Method in class dev.kkorolyov.flub.data.Graph: Like Graph.put(Object, Map), but also adds an inverse edge between connected node pairs.
putUndirected(T, T, E) - Method in class dev.kkorolyov.flub.data.Graph
putUndirected(T, T, T...) - Method in class dev.kkorolyov.flub.data.Graph

R

reducing(Converter, Converter...) - Static method in interface dev.kkorolyov.flub.function.convert.Converter
reducing(Iterable) - Static method in interface dev.kkorolyov.flub.function.convert.Converter: Generates a converter which converts inputs using the first matching selective delegate.
remove(int) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Removes element at index i and returns whether such an element existed.
remove(int, Iterable) - Method in class dev.kkorolyov.flub.data.SparseMultiset: Removes associations to keys for element at index i.
remove(Iterable) - Method in class dev.kkorolyov.flub.data.Graph: Removes values from this graph.
remove(T, T...) - Method in class dev.kkorolyov.flub.data.Graph
run() - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingRunnable
runThrowing() - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingRunnable: Invokes the runnable.

S

selective(Predicate, Converter) - Static method in interface dev.kkorolyov.flub.function.convert.Converter: Generates a converter which converts inputs matching a given test.
sever(T, Iterable) - Method in class dev.kkorolyov.flub.data.Graph: Removes outbound edges from a value in this graph.
sever(T, T, T...) - Method in class dev.kkorolyov.flub.data.Graph
severUndirected(T, Iterable) - Method in class dev.kkorolyov.flub.data.Graph: Like Graph.sever(Object, Iterable), but also removes the inverse edge between connected node pairs.
severUndirected(T, T, T...) - Method in class dev.kkorolyov.flub.data.Graph
ShortestPath<T,E> - Interface in dev.kkorolyov.flub.data.procedure: Shortest path procedure on a graph.
size() - Method in class dev.kkorolyov.flub.data.WeightedDistribution
SparseMultiset<T,K> - Class in dev.kkorolyov.flub.data: A collection of T elements supporting multiple K keys/markers on individual elements.
SparseMultiset() - Constructor for class dev.kkorolyov.flub.data.SparseMultiset

T

test(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingPredicate
test(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiPredicate
testThrowing(T) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingPredicate: Invokes the predicate.
testThrowing(T, U) - Method in interface dev.kkorolyov.flub.function.throwing.ThrowingBiPredicate: Invokes the bi-predicate.
ThrowingBiConsumer<T,U,E> - Interface in dev.kkorolyov.flub.function.throwing: A BiConsumer which may throw a checked exception.
ThrowingBiFunction<T,U,R,E> - Interface in dev.kkorolyov.flub.function.throwing: A BiFunction which may throw a checked exception.
ThrowingBiPredicate<T,U,E> - Interface in dev.kkorolyov.flub.function.throwing: A BiPredicate which may throw a checked exception.
ThrowingConsumer<T,E> - Interface in dev.kkorolyov.flub.function.throwing: A Consumer which may throw a checked exception.
ThrowingFunction<T,R,E> - Interface in dev.kkorolyov.flub.function.throwing: A Function which may throw a checked exception.
ThrowingPredicate<T,E> - Interface in dev.kkorolyov.flub.function.throwing: A Predicate which may throw a checked exception.
ThrowingRunnable<E> - Interface in dev.kkorolyov.flub.function.throwing: A Runnable which may throw a checked exception.
ThrowingSupplier<T,E> - Interface in dev.kkorolyov.flub.function.throwing: A Supplier which may throw a checked exception.
TopologicalSort<T> - Interface in dev.kkorolyov.flub.data.procedure: Topological sorting procedure on a graph.
toString() - Method in class dev.kkorolyov.flub.data.SparseMultiset
toString() - Method in class dev.kkorolyov.flub.function.convert.BiConverter
Trie<T> - Class in dev.kkorolyov.flub.data: A tree with nodes connected to other nodes by a given iterable element.
Trie() - Constructor for class dev.kkorolyov.flub.data.Trie
Trie.Node - Class in dev.kkorolyov.flub.data: An individual node in a Trie.

W

WeightedDistribution<T> - Class in dev.kkorolyov.flub.data: A distribution of randomly-selectable weighted values.
WeightedDistribution() - Constructor for class dev.kkorolyov.flub.data.WeightedDistribution

A B C D E G H I M O P R S T W
All Classes and Interfaces|All Packages