|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Stores the keys collected by unique and key constraints of elements. The keys are collected when a data tree is validated. The keys are propagated from the "leaves" of the structure towards the root.
Method Summary | |
void |
addKeys(IRef aRef,
java.util.Collection aKeys)
Adds a collection of keys to an index. |
boolean |
contains(IRef aRef,
IKey aKey)
Checks if a key is contained in the key store. |
java.util.Map |
getAmbiguousKeySets()
Gets the map of ambiguous key sets contained in this key store. |
java.util.Map |
getKeySets()
Gets the map of key sets contained in this key store. |
boolean |
isAmbiguous(IRef aRef,
IKey aKey)
Checks if a key is ambiguous in the key store. |
void |
merge(IKeyStore aKeyStore)
Merge keys from a child into this key store. |
Method Detail |
public java.util.Map getKeySets()
public java.util.Map getAmbiguousKeySets()
public void merge(IKeyStore aKeyStore)
aKeyStore
- (required).public void addKeys(IRef aRef, java.util.Collection aKeys)
aRef
- (required). An index reference.aKeys
- (required).public boolean contains(IRef aRef, IKey aKey)
aRef
- (required). An index referenced.aKey
- (required).
true
iff the key is contained in the key store
(and not ambiguous).public boolean isAmbiguous(IRef aRef, IKey aKey)
aRef
- (required). An index referenced.aKey
- (required).
true
iff the key is ambiguous, i.e. was added
several times to the store.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |