class JDBCHashSet<K : Any> : AbstractJDBCHashSet<K, BlobSetTable>
A convenient JDBC table backed hash set with iteration order based on insertion order. See AbstractJDBCHashSet and AbstractJDBCHashMap for further implementation details.
In this subclass, elements are represented by Blobs of Kryo serialized forms of the element objects. If you can extend AbstractJDBCHashSet and implement less Kryo dependent element mappings then that is likely preferrable.
BlobSetTable |
class BlobSetTable : JDBCHashedTable |
<init> |
JDBCHashSet(tableName: String, loadOnInit: Boolean = false) A convenient JDBC table backed hash set with iteration order based on insertion order. See AbstractJDBCHashSet and AbstractJDBCHashMap for further implementation details. |
innerMap |
val innerMap: AbstractJDBCHashMap<K, Unit, T> |
size |
open val size: Int |
table |
val table: T |
addElementToInsert |
fun addElementToInsert(insert: <ERROR CLASS>, entry: K, finalizables: MutableList<() -> Unit>): Unit Implementation should marshall the element to the insert statement. |
elementFromRow |
fun elementFromRow(row: <ERROR CLASS>): K Implementation should return the element object marshalled from the database table row. |
clear |
open fun clear(): Unit |
isEmpty |
open fun isEmpty(): Boolean |
iterator |
open fun iterator(): MutableIterator<K> |
isOrderedAndUnique |
fun <T, I : Comparable<I>> Iterable<T>.isOrderedAndUnique(extractId: T.() -> I): Boolean Determine if an iterable data types contents are ordered and unique, based on their Comparable.compareTo function. |
noneOrSingle |
fun <T> Iterable<T>.noneOrSingle(predicate: (T) -> Boolean): T? Returns the single element matching the given predicate, or fun <T> Iterable<T>.noneOrSingle(): T? Returns single element, or |