|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use Mapping | |
|---|---|
| org.hypergraphdb | Welcome to HyperGraphDB |
| org.hypergraphdb.algorithms | |
| org.hypergraphdb.query | |
| org.hypergraphdb.query.impl | |
| org.hypergraphdb.util | |
| Uses of Mapping in org.hypergraphdb |
|---|
| Methods in org.hypergraphdb that return Mapping | |
|---|---|
static Mapping<HGHandle,java.lang.Object> |
HGQuery.hg.deref(HyperGraph graph)
|
static Mapping<HGLink,HGHandle> |
HGQuery.hg.linkProjection(int targetPosition)
|
static Mapping<HGHandle,HGHandle> |
HGQuery.hg.targetAt(HyperGraph graph,
int targetPosition)
|
| Methods in org.hypergraphdb with parameters of type Mapping | |
|---|---|
static HGQueryCondition |
HGQuery.hg.apply(Mapping<?,?> m,
HGQueryCondition c)
|
| Uses of Mapping in org.hypergraphdb.algorithms |
|---|
| Methods in org.hypergraphdb.algorithms with parameters of type Mapping | |
|---|---|
static java.lang.Double |
GraphClassics.dijkstra(HGHandle start,
HGHandle goal,
HGALGenerator adjencyGenerator,
Mapping<HGHandle,java.lang.Double> weight,
java.util.Map<HGHandle,java.lang.Double> distanceMatrix,
java.util.Map<HGHandle,HGHandle> predecessorMatrix)
Implements Dijkstra's algorithm for finding the shortest path between two nodes (i.e. |
void |
GraphClassics.kruskall(java.util.Iterator<HGHandle> links,
Mapping<HGHandle,java.lang.Double> weight,
java.util.Map<HGHandle,HGHandle> parentMatrix)
|
void |
GraphClassics.prim(HGHandle start,
HGALGenerator adjencyGenerator,
Mapping<HGHandle,java.lang.Double> weight,
java.util.Map<HGHandle,HGHandle> parentMatrix)
|
| Uses of Mapping in org.hypergraphdb.query |
|---|
| Methods in org.hypergraphdb.query that return Mapping | |
|---|---|
Mapping<?,?> |
MapCondition.getMapping()
|
| Methods in org.hypergraphdb.query with parameters of type Mapping | |
|---|---|
void |
MapCondition.setMapping(Mapping<?,?> mapping)
|
| Constructors in org.hypergraphdb.query with parameters of type Mapping | |
|---|---|
MapCondition(HGQueryCondition condition,
Mapping<?,?> mapping)
|
|
| Uses of Mapping in org.hypergraphdb.query.impl |
|---|
| Classes in org.hypergraphdb.query.impl that implement Mapping | |
|---|---|
class |
DerefMapping
|
class |
LinkProjectionMapping
|
| Methods in org.hypergraphdb.query.impl that return Mapping | |
|---|---|
Mapping |
ResultMapQuery.getMapping()
|
| Methods in org.hypergraphdb.query.impl with parameters of type Mapping | |
|---|---|
void |
ResultMapQuery.setMapping(Mapping mapping)
|
| Constructors in org.hypergraphdb.query.impl with parameters of type Mapping | |
|---|---|
MappedResult(HGSearchResult r,
Mapping f)
|
|
ResultMapQuery(HGQuery query,
Mapping mapping)
Create a query that transforms the output of a given query by the specified mapping. |
|
| Uses of Mapping in org.hypergraphdb.util |
|---|
| Classes in org.hypergraphdb.util that implement Mapping | |
|---|---|
class |
CompositeMapping<From,To>
|
| Methods in org.hypergraphdb.util with parameters of type Mapping | ||
|---|---|---|
static
|
HGUtils.queryBatchProcess(HGQuery<T> query,
Mapping<T,java.lang.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. |
|
| Constructors in org.hypergraphdb.util with parameters of type Mapping | |
|---|---|
CompositeMapping(Mapping<From,java.lang.Object> first,
Mapping<java.lang.Object,To> second)
|
|
CompositeMapping(Mapping<From,java.lang.Object> first,
Mapping<java.lang.Object,To> second)
|
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||