| Package | Description |
|---|---|
| com.bazaarvoice.jolt.cardinality | |
| com.bazaarvoice.jolt.common.pathelement | |
| com.bazaarvoice.jolt.shiftr | |
| com.bazaarvoice.jolt.shiftr.spec |
| Modifier and Type | Method and Description |
|---|---|
abstract boolean |
CardinalitySpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Object parentContainer)
This is the main recursive method of the CardinalityTransform parallel "spec" and "input" tree walk.
|
boolean |
CardinalityCompositeSpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Object parentContainer)
If this Spec matches the inputkey, then perform one step in the parallel treewalk.
|
boolean |
CardinalityLeafSpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Object parentContainer)
If this CardinalitySpec matches the inputkey, then do the work of modifying the data and return true.
|
Object |
CardinalityLeafSpec.applyToParentContainer(String inputKey,
Object input,
WalkedPath walkedPath,
Object parentContainer)
This should only be used by composite specs with an '@' child
|
| Modifier and Type | Method and Description |
|---|---|
String |
AmpPathElement.evaluate(WalkedPath walkedPath) |
String |
EvaluatablePathElement.evaluate(WalkedPath walkedPath)
Evaluate this key as if it is an write path element.
|
String |
DollarPathElement.evaluate(WalkedPath walkedPath) |
String |
ArrayPathElement.evaluate(WalkedPath walkedPath) |
String |
LiteralPathElement.evaluate(WalkedPath walkedPath) |
LiteralPathElement |
AmpPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
AtPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
MatchablePathElement.match(String dataKey,
WalkedPath walkedPath)
See if this PathElement matches the given dataKey.
|
LiteralPathElement |
DollarPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
StarDoublePathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
ArrayPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
LiteralPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
StarSinglePathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
StarAllPathElement.match(String dataKey,
WalkedPath walkedPath) |
LiteralPathElement |
StarRegexPathElement.match(String dataKey,
WalkedPath walkedPath) |
| Modifier and Type | Method and Description |
|---|---|
void |
ShiftrWriter.write(Object data,
Map<String,Object> output,
WalkedPath walkedPath)
Use the supplied WalkedPath, in the evaluation of each of our PathElements to
build a concrete output path.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
ShiftrLeafSpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Map<String,Object> output)
If this Spec matches the inputkey, then do the work of outputting data and return true.
|
boolean |
ShiftrCompositeSpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Map<String,Object> output)
If this Spec matches the inputKey, then perform one step in the Shiftr parallel treewalk.
|
abstract boolean |
ShiftrSpec.apply(String inputKey,
Object input,
WalkedPath walkedPath,
Map<String,Object> output)
This is the main recursive method of the Shiftr parallel "spec" and "input" tree walk.
|
Copyright © 2014. All Rights Reserved.