Package | Description |
---|---|
org.hypergraphdb |
Welcome to HyperGraphDB
|
org.hypergraphdb.algorithms | |
org.hypergraphdb.query | |
org.hypergraphdb.query.impl | |
org.hypergraphdb.util |
Modifier and Type | Method and Description |
---|---|
static <T> Mapping<HGHandle,T> |
HGQuery.hg.deref(HyperGraph graph)
|
static Mapping<HGLink,HGHandle> |
HGQuery.hg.linkProjection(int targetPosition)
Return a
Mapping that takes a link atom and returns a target at the given position. |
static Mapping<HGLink,HGHandle> |
HGQuery.hg.linkProjection(Ref<Integer> targetPosition)
Return a
Mapping that takes a link atom and returns a target at the given position. |
static Mapping<HGHandle,HGHandle> |
HGQuery.hg.targetAt(HyperGraph graph,
int targetPosition)
Return a
Mapping that given a handle to a link will return the target (handle) at the specified
target position. |
Modifier and Type | Method and Description |
---|---|
static HGQueryCondition |
HGQuery.hg.apply(Mapping<?,?> m,
HGQueryCondition c)
Return a "condition" that transforms the result set by applying an arbitrary
Mapping to each
element. |
Modifier and Type | Method and Description |
---|---|
static Double |
GraphClassics.dijkstra(HGHandle start,
HGHandle goal,
HGALGenerator adjacencyGenerator,
Mapping<HGHandle,Double> weight,
Map<HGHandle,Double> distanceMatrix,
Map<HGHandle,HGHandle> predecessorMatrix)
Implements Dijkstra's algorithm for finding the shortest path between two
nodes (i.e.
|
void |
GraphClassics.kruskall(Iterator<HGHandle> links,
Mapping<HGHandle,Double> weight,
Map<HGHandle,HGHandle> parentMatrix) |
void |
GraphClassics.prim(HGHandle start,
HGALGenerator adjencyGenerator,
Mapping<HGHandle,Double> weight,
Map<HGHandle,HGHandle> parentMatrix) |
Modifier and Type | Method and Description |
---|---|
Mapping<?,?> |
MapCondition.getMapping() |
Modifier and Type | Method and Description |
---|---|
void |
MapCondition.setMapping(Mapping<?,?> mapping) |
Constructor and Description |
---|
MapCondition(HGQueryCondition condition,
Mapping<?,?> mapping) |
Modifier and Type | Class and Description |
---|---|
class |
DerefMapping<T> |
class |
LinkProjectionMapping |
Modifier and Type | Method and Description |
---|---|
Mapping |
ResultMapQuery.getMapping() |
Modifier and Type | Method and Description |
---|---|
void |
ResultMapQuery.setMapping(Mapping mapping) |
Constructor and Description |
---|
FilteredRAResultSet(HGRandomAccessResult<T> searchResult,
Mapping<T,Boolean> predicate,
int lookahead) |
FilteredResultSet(HGSearchResult<T> searchResult,
Mapping<T,Boolean> predicate,
int lookahead)
The constructor assumes the underlying set is already positioned to the
first matching entity.
|
MappedResult(HGSearchResult<From> r,
Mapping<From,To> f) |
PredicateBasedFilter(HyperGraph graph,
HGQuery<T> query,
Mapping<T,Boolean> predicate) |
PredicateBasedRAFilter(HyperGraph graph,
HGQuery<T> query,
Mapping<T,Boolean> predicate) |
ResultMapQuery(HGQuery query,
Mapping mapping)
Create a query that transforms the output of a given query by
the specified mapping.
|
Modifier and Type | Class and Description |
---|---|
class |
CompositeMapping<From,To,Intermediate> |
Modifier and Type | Method and Description |
---|---|
static <T> T |
HGUtils.cloneObject(T p,
Mapping<Pair<Object,String>,Boolean> propertyFilter) |
static void |
HGUtils.directoryRecurse(File top,
Mapping<File,Boolean> mapping) |
static <T> long |
HGUtils.queryBatchProcess(HGQuery<T> query,
Mapping<T,Boolean> F,
int batchSize,
T startAfter,
long first)
Process a potentially large query result in batches where each batch is a encapsulated
in a single transaction.
|
void |
CallbackFuture.setCompletionListener(Mapping<CallbackFuture<T>,T> listener) |
static void |
HGUtils.visit(Object object,
Mapping<Object,Boolean> visitor) |
Constructor and Description |
---|
CompositeMapping(Mapping<From,Intermediate> first,
Mapping<Intermediate,To> second) |
CompositeMapping(Mapping<From,Intermediate> first,
Mapping<Intermediate,To> second) |
FilteredSortedSet(HGSortedSet<E> delegate,
Mapping<E,Boolean> predicate) |
FilterIterator(Iterator<T> iter,
Mapping<T,Boolean> ignore) |
MappedFuture(Future<From> future,
Mapping<From,To> map) |
Copyright © 2015. All rights reserved.