public class NdStringSet
extends java.lang.Object
This implementation should only be used when the set is expected to be small. It uses a singly linked list for storing strings in Database. Which means that a linear lookup is needed to find strings in the list. An in-memory, lazily-loaded, cache is provided so the list will only be fully retrieved once in the lifetime of this instance. A BTree will be more efficient for larger sets.
| Constructor and Description |
|---|
NdStringSet(Database db,
long ptr) |
| Modifier and Type | Method and Description |
|---|---|
long |
add(java.lang.String str)
Adds the given string to the receiving set.
|
void |
clearCaches() |
long |
find(java.lang.String str)
Search for the given string in the receiver.
|
long |
remove(java.lang.String str)
Return a pointer to the record of the String that was removed.
|
public NdStringSet(Database db, long ptr) throws CoreException
CoreExceptionpublic void clearCaches()
public long add(java.lang.String str)
throws CoreException
CoreExceptionpublic long find(java.lang.String str)
throws CoreException
CoreExceptionpublic long remove(java.lang.String str)
throws CoreException
CoreException