mirror of
https://github.com/InsanusMokrassar/MicroUtils.git
synced 2025-10-03 14:19:24 +00:00
Compare commits
33 Commits
Author | SHA1 | Date | |
---|---|---|---|
d69fee1732 | |||
178518db5e | |||
6fb20fb973 | |||
831bf44e34 | |||
a4c6c367e3 | |||
bc98e59709 | |||
ef287bc331 | |||
3437f4c712 | |||
618f2dcd79 | |||
6df8ad3095 | |||
eda6221288 | |||
a9859f6a0d | |||
0db88bac25 | |||
daa3d9c0dd | |||
b343b33594 | |||
46e435a448 | |||
7fe62b4ffa | |||
9c94348a15 | |||
bac256e93e | |||
49f59aa129 | |||
800dab5be0 | |||
b9977527b2 | |||
c216dba69d | |||
d4148d52e3 | |||
2006a8cdd0 | |||
feb52ecbd1 | |||
42909c3b7a | |||
706a787163 | |||
1bc14bded6 | |||
f00cb81db1 | |||
ddb8e1efb4 | |||
7a650f5c2f | |||
fc6f5ae2ee |
33
CHANGELOG.md
33
CHANGELOG.md
@@ -1,5 +1,38 @@
|
|||||||
# Changelog
|
# Changelog
|
||||||
|
|
||||||
|
## 0.25.2
|
||||||
|
|
||||||
|
* `Versions`:
|
||||||
|
* `Exposed`: `0.59.0` -> `0.60.0`
|
||||||
|
* `Repo`:
|
||||||
|
* `Cache`:
|
||||||
|
* Add extensions `alsoInvalidate`, `alsoInvalidateAsync`, `alsoInvalidateSync` and `alsoInvalidateSyncLogging`
|
||||||
|
* `Koin`:
|
||||||
|
* Add extensions `singleSuspend` and `factorySuspend` for defining of dependencies with suspendable blocks
|
||||||
|
|
||||||
|
## 0.25.1
|
||||||
|
|
||||||
|
* `Coroutines`:
|
||||||
|
* Add `SortedMapLikeBinaryTreeNode`
|
||||||
|
* `Pagination`:
|
||||||
|
* `Compose`:
|
||||||
|
* One more rework of `InfinityPagedComponent` and `PagedComponent`
|
||||||
|
|
||||||
|
## 0.25.0
|
||||||
|
|
||||||
|
* `Repos`:
|
||||||
|
* `Cache`:
|
||||||
|
* All cache repos now do not have `open` vals - to avoid collisions in runtime
|
||||||
|
|
||||||
|
## 0.24.9
|
||||||
|
|
||||||
|
* `Pagination`:
|
||||||
|
* Make alternative constructor parameter `size` of `PaginationResult` with default value
|
||||||
|
* Add `Pagination.previousPage` extension
|
||||||
|
* `Compose`:
|
||||||
|
* Rework of `InfinityPagedComponentContext`
|
||||||
|
* Rework of `PagedComponent`
|
||||||
|
|
||||||
## 0.24.8
|
## 0.24.8
|
||||||
|
|
||||||
* `Versions`:
|
* `Versions`:
|
||||||
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = true
|
|
@@ -71,7 +71,7 @@ fun <T, M> Flow<T>.subscribeAsync(
|
|||||||
it.invoke(markersMap)
|
it.invoke(markersMap)
|
||||||
}
|
}
|
||||||
|
|
||||||
val job = subscribeSafelyWithoutExceptions(subscope) { data ->
|
val job = subscribeLoggingDropExceptions(subscope) { data ->
|
||||||
val dataCommand = AsyncSubscriptionCommandData(data, subscope, markerFactory, block) { marker ->
|
val dataCommand = AsyncSubscriptionCommandData(data, subscope, markerFactory, block) { marker ->
|
||||||
actor.send(
|
actor.send(
|
||||||
AsyncSubscriptionCommandClearReceiver(marker)
|
AsyncSubscriptionCommandClearReceiver(marker)
|
||||||
|
@@ -1,7 +1,6 @@
|
|||||||
package dev.inmo.micro_utils.coroutines.collections
|
package dev.inmo.micro_utils.coroutines.collections
|
||||||
|
|
||||||
import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
||||||
import dev.inmo.micro_utils.coroutines.waitReadRelease
|
|
||||||
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
||||||
import dev.inmo.micro_utils.coroutines.withWriteLock
|
import dev.inmo.micro_utils.coroutines.withWriteLock
|
||||||
import kotlinx.coroutines.job
|
import kotlinx.coroutines.job
|
||||||
@@ -93,7 +92,7 @@ class SortedBinaryTreeNode<T>(
|
|||||||
* This process will continue until function will not find place to put [SortedBinaryTreeNode] with data or
|
* This process will continue until function will not find place to put [SortedBinaryTreeNode] with data or
|
||||||
* [SortedBinaryTreeNode] with [SortedBinaryTreeNode.data] same as [newData] will be found
|
* [SortedBinaryTreeNode] with [SortedBinaryTreeNode.data] same as [newData] will be found
|
||||||
*/
|
*/
|
||||||
private suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(
|
private suspend fun <T> SortedBinaryTreeNode<T>.upsertSubNode(
|
||||||
subNode: SortedBinaryTreeNode<T>,
|
subNode: SortedBinaryTreeNode<T>,
|
||||||
skipLockers: Set<SmartRWLocker> = emptySet()
|
skipLockers: Set<SmartRWLocker> = emptySet()
|
||||||
): SortedBinaryTreeNode<T> {
|
): SortedBinaryTreeNode<T> {
|
||||||
@@ -149,7 +148,7 @@ private suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(
|
|||||||
* [SortedBinaryTreeNode] with [SortedBinaryTreeNode.data] same as [newData] will be found
|
* [SortedBinaryTreeNode] with [SortedBinaryTreeNode.data] same as [newData] will be found
|
||||||
*/
|
*/
|
||||||
suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(newData: T): SortedBinaryTreeNode<T> {
|
suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(newData: T): SortedBinaryTreeNode<T> {
|
||||||
return addSubNode(
|
return upsertSubNode(
|
||||||
SortedBinaryTreeNode(newData, comparator)
|
SortedBinaryTreeNode(newData, comparator)
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
@@ -198,8 +197,8 @@ suspend fun <T> SortedBinaryTreeNode<T>.findParentNode(data: T): SortedBinaryTre
|
|||||||
*/
|
*/
|
||||||
suspend fun <T> SortedBinaryTreeNode<T>.removeSubNode(data: T): Pair<SortedBinaryTreeNode<T>, SortedBinaryTreeNode<T>>? {
|
suspend fun <T> SortedBinaryTreeNode<T>.removeSubNode(data: T): Pair<SortedBinaryTreeNode<T>, SortedBinaryTreeNode<T>>? {
|
||||||
val onFoundToRemoveCallback: suspend SortedBinaryTreeNode<T>.(left: SortedBinaryTreeNode<T>?, right: SortedBinaryTreeNode<T>?) -> Unit = { left, right ->
|
val onFoundToRemoveCallback: suspend SortedBinaryTreeNode<T>.(left: SortedBinaryTreeNode<T>?, right: SortedBinaryTreeNode<T>?) -> Unit = { left, right ->
|
||||||
left ?.also { leftNode -> addSubNode(leftNode, setOf(locker)) }
|
left ?.also { leftNode -> upsertSubNode(leftNode, setOf(locker)) }
|
||||||
right ?.also { rightNode -> addSubNode(rightNode, setOf(locker)) }
|
right ?.also { rightNode -> upsertSubNode(rightNode, setOf(locker)) }
|
||||||
}
|
}
|
||||||
while (coroutineContext.job.isActive) {
|
while (coroutineContext.job.isActive) {
|
||||||
val foundParentNode = findParentNode(data) ?: return null
|
val foundParentNode = findParentNode(data) ?: return null
|
||||||
|
@@ -0,0 +1,401 @@
|
|||||||
|
package dev.inmo.micro_utils.coroutines.collections
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
||||||
|
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
||||||
|
import dev.inmo.micro_utils.coroutines.withWriteLock
|
||||||
|
import kotlinx.coroutines.job
|
||||||
|
import kotlinx.serialization.Serializable
|
||||||
|
import kotlin.coroutines.coroutineContext
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Creates simple [Comparator] which will use [compareTo] of [T] for both objects
|
||||||
|
*/
|
||||||
|
private fun <T : Comparable<C>, C : T> T.createComparator() = Comparator<C> { o1, o2 -> o1.compareTo(o2) }
|
||||||
|
|
||||||
|
@Serializable
|
||||||
|
class SortedMapLikeBinaryTreeNode<K, V>(
|
||||||
|
val key: K,
|
||||||
|
val value: V,
|
||||||
|
internal val comparator: Comparator<K>,
|
||||||
|
) : Iterable<SortedMapLikeBinaryTreeNode<K, V>> {
|
||||||
|
internal var leftNode: SortedMapLikeBinaryTreeNode<K, V>? = null
|
||||||
|
internal var rightNode: SortedMapLikeBinaryTreeNode<K, V>? = null
|
||||||
|
internal val locker: SmartRWLocker by lazy {
|
||||||
|
SmartRWLocker()
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getLeftNode() = locker.withReadAcquire {
|
||||||
|
leftNode
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getRightNode() = locker.withReadAcquire {
|
||||||
|
rightNode
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getLeftKey() = getLeftNode() ?.key
|
||||||
|
suspend fun getLeftValue() = getLeftNode() ?.value
|
||||||
|
|
||||||
|
suspend fun getRightKey() = getRightNode() ?.value
|
||||||
|
suspend fun getRightValue() = getRightNode() ?.value
|
||||||
|
|
||||||
|
override fun equals(other: Any?): Boolean {
|
||||||
|
return other === this || (other is SortedMapLikeBinaryTreeNode<*, *> && other.key == key && other.rightNode == rightNode && other.leftNode == leftNode)
|
||||||
|
}
|
||||||
|
|
||||||
|
override fun hashCode(): Int {
|
||||||
|
return key.hashCode() * 31 + rightNode.hashCode() + leftNode.hashCode()
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun size(): Int {
|
||||||
|
return locker.withReadAcquire {
|
||||||
|
1 + (leftNode ?.size() ?: 0) + (rightNode ?.size() ?: 0)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This [Iterator] will run from less to greater values of nodes starting the
|
||||||
|
* [dev.inmo.micro_utils.coroutines.collections.SortedMapLikeBinaryTreeNode]-receiver. Due to non-suspending
|
||||||
|
* nature of [iterator] builder, this [Iterator] **DO NOT** guarantee consistent content due to iterations. It
|
||||||
|
* means, that tree can be changed during to iteration process
|
||||||
|
*/
|
||||||
|
override fun iterator(): Iterator<SortedMapLikeBinaryTreeNode<K, V>> = iterator {
|
||||||
|
leftNode ?.let {
|
||||||
|
it.iterator().forEach { yield(it) }
|
||||||
|
}
|
||||||
|
yield(this@SortedMapLikeBinaryTreeNode)
|
||||||
|
rightNode ?.let {
|
||||||
|
it.iterator().forEach { yield(it) }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
override fun toString(): String {
|
||||||
|
return "$key($leftNode;$rightNode)"
|
||||||
|
}
|
||||||
|
|
||||||
|
companion object {
|
||||||
|
operator fun <K : Comparable<K>, V> invoke(
|
||||||
|
key: K,
|
||||||
|
value: V
|
||||||
|
) = SortedMapLikeBinaryTreeNode(
|
||||||
|
key,
|
||||||
|
value,
|
||||||
|
key.createComparator()
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Will add subnode in tree if there are no any node with [newData]
|
||||||
|
*
|
||||||
|
* * If [newData] is greater than [SortedMapLikeBinaryTreeNode.key] of currently checking node,
|
||||||
|
* will be used [SortedMapLikeBinaryTreeNode.rightNode]
|
||||||
|
* * If [newData] is equal to [SortedMapLikeBinaryTreeNode.key] of currently
|
||||||
|
* checking node - will be returned currently checking node
|
||||||
|
* * If [newData] is less than [SortedMapLikeBinaryTreeNode.key] of currently
|
||||||
|
* checking node - will be used [SortedMapLikeBinaryTreeNode.leftNode]
|
||||||
|
*
|
||||||
|
* This process will continue until function will not find place to put [SortedMapLikeBinaryTreeNode] with data or
|
||||||
|
* [SortedMapLikeBinaryTreeNode] with [SortedMapLikeBinaryTreeNode.key] same as [newData] will be found
|
||||||
|
*
|
||||||
|
* @param replaceMode Will replace only value if node already exists
|
||||||
|
*/
|
||||||
|
private suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.upsertSubNode(
|
||||||
|
subNode: SortedMapLikeBinaryTreeNode<K, V>,
|
||||||
|
skipLockers: Set<SmartRWLocker> = emptySet(),
|
||||||
|
replaceMode: Boolean
|
||||||
|
): SortedMapLikeBinaryTreeNode<K, V> {
|
||||||
|
var currentlyChecking = this
|
||||||
|
var latestParent: SortedMapLikeBinaryTreeNode<K, V>? = null
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
try {
|
||||||
|
while (coroutineContext.job.isActive) {
|
||||||
|
if (currentlyChecking.locker !in lockedLockers && currentlyChecking.locker !in skipLockers) {
|
||||||
|
currentlyChecking.locker.lockWrite()
|
||||||
|
lockedLockers.add(currentlyChecking.locker)
|
||||||
|
}
|
||||||
|
val left = currentlyChecking.leftNode
|
||||||
|
val right = currentlyChecking.rightNode
|
||||||
|
val comparingResult = currentlyChecking.comparator.compare(subNode.key, currentlyChecking.key)
|
||||||
|
val isGreater = comparingResult > 0
|
||||||
|
when {
|
||||||
|
comparingResult == 0 -> {
|
||||||
|
val resultNode = if (replaceMode) {
|
||||||
|
subNode
|
||||||
|
} else {
|
||||||
|
val newNode = SortedMapLikeBinaryTreeNode(
|
||||||
|
subNode.key,
|
||||||
|
subNode.value,
|
||||||
|
currentlyChecking.comparator,
|
||||||
|
)
|
||||||
|
newNode.leftNode = currentlyChecking.leftNode
|
||||||
|
newNode.rightNode = currentlyChecking.rightNode
|
||||||
|
newNode
|
||||||
|
}
|
||||||
|
|
||||||
|
latestParent ?.let {
|
||||||
|
when {
|
||||||
|
it.leftNode === currentlyChecking -> it.leftNode = resultNode
|
||||||
|
it.rightNode === currentlyChecking -> it.rightNode = resultNode
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return resultNode
|
||||||
|
}
|
||||||
|
isGreater && right == null -> {
|
||||||
|
currentlyChecking.rightNode = subNode
|
||||||
|
return subNode
|
||||||
|
}
|
||||||
|
isGreater && right != null -> {
|
||||||
|
latestParent = currentlyChecking
|
||||||
|
currentlyChecking = right
|
||||||
|
}
|
||||||
|
left == null -> {
|
||||||
|
currentlyChecking.leftNode = subNode
|
||||||
|
return subNode
|
||||||
|
}
|
||||||
|
else -> {
|
||||||
|
latestParent = currentlyChecking
|
||||||
|
currentlyChecking = left
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.unlockWrite() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to add node")
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Will add subnode in tree if there are no any node with [key]
|
||||||
|
*
|
||||||
|
* * If [key] is greater than [SortedMapLikeBinaryTreeNode.key] of currently checking node,
|
||||||
|
* will be used [SortedMapLikeBinaryTreeNode.rightNode]
|
||||||
|
* * If [key] is equal to [SortedMapLikeBinaryTreeNode.key] of currently
|
||||||
|
* checking node - will be returned currently checking node
|
||||||
|
* * If [key] is less than [SortedMapLikeBinaryTreeNode.key] of currently
|
||||||
|
* checking node - will be used [SortedMapLikeBinaryTreeNode.leftNode]
|
||||||
|
*
|
||||||
|
* This process will continue until function will not find place to put [SortedMapLikeBinaryTreeNode] with data or
|
||||||
|
* [SortedMapLikeBinaryTreeNode] with [SortedMapLikeBinaryTreeNode.key] same as [key] will be found
|
||||||
|
*/
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.upsertSubNode(
|
||||||
|
key: K,
|
||||||
|
value: V
|
||||||
|
): SortedMapLikeBinaryTreeNode<K, V> {
|
||||||
|
return upsertSubNode(
|
||||||
|
SortedMapLikeBinaryTreeNode(key, value, comparator),
|
||||||
|
replaceMode = false
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findParentNode(data: K): SortedMapLikeBinaryTreeNode<K, V>? {
|
||||||
|
var currentParent: SortedMapLikeBinaryTreeNode<K, V>? = null
|
||||||
|
var currentlyChecking: SortedMapLikeBinaryTreeNode<K, V>? = this
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
try {
|
||||||
|
while (coroutineContext.job.isActive) {
|
||||||
|
if (currentlyChecking == null) {
|
||||||
|
return null
|
||||||
|
}
|
||||||
|
if (currentlyChecking.locker !in lockedLockers) {
|
||||||
|
currentlyChecking.locker.acquireRead()
|
||||||
|
lockedLockers.add(currentlyChecking.locker)
|
||||||
|
}
|
||||||
|
val comparingResult = currentlyChecking.comparator.compare(data, currentlyChecking.key)
|
||||||
|
when {
|
||||||
|
comparingResult > 0 -> {
|
||||||
|
currentParent = currentlyChecking
|
||||||
|
currentlyChecking = currentlyChecking.rightNode
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
comparingResult < 0 -> {
|
||||||
|
currentParent = currentlyChecking
|
||||||
|
currentlyChecking = currentlyChecking.leftNode
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
else -> return currentParent
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.releaseRead() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to find node")
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Will remove (detach) node from tree starting with [this] [SortedMapLikeBinaryTreeNode]
|
||||||
|
*
|
||||||
|
* @return If data were found, [Pair] where [Pair.first] is the parent node where from [Pair.second] has been detached;
|
||||||
|
* null otherwise
|
||||||
|
*/
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.removeSubNode(data: K): Pair<SortedMapLikeBinaryTreeNode<K, V>, SortedMapLikeBinaryTreeNode<K, V>>? {
|
||||||
|
val onFoundToRemoveCallback: suspend SortedMapLikeBinaryTreeNode<K, V>.(left: SortedMapLikeBinaryTreeNode<K, V>?, right: SortedMapLikeBinaryTreeNode<K, V>?) -> Unit = { left, right ->
|
||||||
|
left ?.also { leftNode -> upsertSubNode(leftNode, setOf(locker), replaceMode = true) }
|
||||||
|
right ?.also { rightNode -> upsertSubNode(rightNode, setOf(locker), replaceMode = true) }
|
||||||
|
}
|
||||||
|
while (coroutineContext.job.isActive) {
|
||||||
|
val foundParentNode = findParentNode(data) ?: return null
|
||||||
|
foundParentNode.locker.withWriteLock {
|
||||||
|
val left = foundParentNode.leftNode
|
||||||
|
val right = foundParentNode.rightNode
|
||||||
|
when {
|
||||||
|
left != null && left.comparator.compare(data, left.key) == 0 -> {
|
||||||
|
foundParentNode.leftNode = null
|
||||||
|
foundParentNode.onFoundToRemoveCallback(left.leftNode, left.rightNode)
|
||||||
|
return foundParentNode to left
|
||||||
|
}
|
||||||
|
right != null && right.comparator.compare(data, right.key) == 0 -> {
|
||||||
|
foundParentNode.rightNode = null
|
||||||
|
foundParentNode.onFoundToRemoveCallback(right.leftNode, right.rightNode)
|
||||||
|
return foundParentNode to right
|
||||||
|
}
|
||||||
|
else -> {
|
||||||
|
return@withWriteLock // data has been changed, new search required
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to remove node")
|
||||||
|
}
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNode(key: K): SortedMapLikeBinaryTreeNode<K, V>? {
|
||||||
|
var currentlyChecking: SortedMapLikeBinaryTreeNode<K, V>? = this
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
try {
|
||||||
|
while (coroutineContext.job.isActive) {
|
||||||
|
if (currentlyChecking == null) {
|
||||||
|
return null
|
||||||
|
}
|
||||||
|
if (currentlyChecking.locker !in lockedLockers) {
|
||||||
|
currentlyChecking.locker.acquireRead()
|
||||||
|
lockedLockers.add(currentlyChecking.locker)
|
||||||
|
}
|
||||||
|
val comparingResult = currentlyChecking.comparator.compare(key, currentlyChecking.key)
|
||||||
|
when {
|
||||||
|
comparingResult > 0 -> {
|
||||||
|
currentlyChecking = currentlyChecking.rightNode
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
comparingResult < 0 -> {
|
||||||
|
currentlyChecking = currentlyChecking.leftNode
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
else -> return currentlyChecking
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.releaseRead() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to find node")
|
||||||
|
}
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.contains(data: K): Boolean = findNode(data) != null
|
||||||
|
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(from: K, to: K, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedMapLikeBinaryTreeNode<K, V>> {
|
||||||
|
val results = mutableSetOf<SortedMapLikeBinaryTreeNode<K, V>>()
|
||||||
|
val leftToCheck = mutableSetOf(this)
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
val fromComparingFun: (SortedMapLikeBinaryTreeNode<K, V>) -> Boolean = if (fromInclusiveMode) {
|
||||||
|
{ it.comparator.compare(from, it.key) <= 0 }
|
||||||
|
} else {
|
||||||
|
{ it.comparator.compare(from, it.key) < 0 }
|
||||||
|
}
|
||||||
|
val toComparingFun: (SortedMapLikeBinaryTreeNode<K, V>) -> Boolean = if (toInclusiveMode) {
|
||||||
|
{ it.comparator.compare(to, it.key) >= 0 }
|
||||||
|
} else {
|
||||||
|
{ it.comparator.compare(to, it.key) > 0 }
|
||||||
|
}
|
||||||
|
try {
|
||||||
|
while (coroutineContext.job.isActive && leftToCheck.isNotEmpty()) {
|
||||||
|
val currentlyChecking = leftToCheck.first()
|
||||||
|
leftToCheck.remove(currentlyChecking)
|
||||||
|
if (currentlyChecking in results) {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
currentlyChecking.locker.acquireRead()
|
||||||
|
lockedLockers.add(currentlyChecking.locker)
|
||||||
|
if (fromComparingFun(currentlyChecking) && toComparingFun(currentlyChecking)) {
|
||||||
|
results.add(currentlyChecking)
|
||||||
|
currentlyChecking.leftNode ?.let { leftToCheck.add(it) }
|
||||||
|
currentlyChecking.rightNode ?.let { leftToCheck.add(it) }
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
when {
|
||||||
|
currentlyChecking.comparator.compare(to, currentlyChecking.key) < 0 -> currentlyChecking.leftNode ?.let { leftToCheck.add(it) }
|
||||||
|
currentlyChecking.comparator.compare(from, currentlyChecking.key) > 0 -> currentlyChecking.rightNode ?.let { leftToCheck.add(it) }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return results.toSet()
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.releaseRead() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to find nodes range")
|
||||||
|
}
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.deepEquals(other: SortedMapLikeBinaryTreeNode<K, V>): Boolean {
|
||||||
|
val leftToCheck = mutableSetOf(this)
|
||||||
|
val othersToCheck = mutableSetOf(other)
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
try {
|
||||||
|
while (leftToCheck.isNotEmpty() && othersToCheck.isNotEmpty()) {
|
||||||
|
val thisToCheck = leftToCheck.first()
|
||||||
|
leftToCheck.remove(thisToCheck)
|
||||||
|
|
||||||
|
val otherToCheck = othersToCheck.first()
|
||||||
|
othersToCheck.remove(otherToCheck)
|
||||||
|
|
||||||
|
if (thisToCheck.locker !in lockedLockers) {
|
||||||
|
thisToCheck.locker.acquireRead()
|
||||||
|
lockedLockers.add(thisToCheck.locker)
|
||||||
|
}
|
||||||
|
if (otherToCheck.locker !in lockedLockers) {
|
||||||
|
otherToCheck.locker.acquireRead()
|
||||||
|
lockedLockers.add(otherToCheck.locker)
|
||||||
|
}
|
||||||
|
|
||||||
|
if (thisToCheck.key != otherToCheck.key || thisToCheck.value != otherToCheck.value) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
if ((thisToCheck.leftNode == null).xor(otherToCheck.leftNode == null)) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
if ((thisToCheck.rightNode == null).xor(otherToCheck.rightNode == null)) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
thisToCheck.leftNode?.let { leftToCheck.add(it) }
|
||||||
|
thisToCheck.rightNode?.let { leftToCheck.add(it) }
|
||||||
|
|
||||||
|
otherToCheck.leftNode?.let { othersToCheck.add(it) }
|
||||||
|
otherToCheck.rightNode?.let { othersToCheck.add(it) }
|
||||||
|
}
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.releaseRead() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return leftToCheck.isEmpty() && othersToCheck.isEmpty()
|
||||||
|
}
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(from: K, to: K): Set<SortedMapLikeBinaryTreeNode<K, V>> = findNodesInRange(
|
||||||
|
from = from,
|
||||||
|
to = to,
|
||||||
|
fromInclusiveMode = true,
|
||||||
|
toInclusiveMode = true
|
||||||
|
)
|
||||||
|
suspend fun <K, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRangeExcluding(from: K, to: K): Set<SortedMapLikeBinaryTreeNode<K, V>> = findNodesInRange(
|
||||||
|
from = from,
|
||||||
|
to = to,
|
||||||
|
fromInclusiveMode = false,
|
||||||
|
toInclusiveMode = false
|
||||||
|
)
|
||||||
|
suspend fun <K : Comparable<K>, V> SortedMapLikeBinaryTreeNode<K, V>.findNodesInRange(range: ClosedRange<K>): Set<SortedMapLikeBinaryTreeNode<K, V>> = findNodesInRange(
|
||||||
|
from = range.start,
|
||||||
|
to = range.endInclusive,
|
||||||
|
)
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = false
|
|
@@ -7,7 +7,9 @@ fun <T> CoroutineScope.launchSynchronously(block: suspend CoroutineScope.() -> T
|
|||||||
val objectToSynchronize = Object()
|
val objectToSynchronize = Object()
|
||||||
synchronized(objectToSynchronize) {
|
synchronized(objectToSynchronize) {
|
||||||
launch(start = CoroutineStart.UNDISPATCHED) {
|
launch(start = CoroutineStart.UNDISPATCHED) {
|
||||||
result = safelyWithResult(block)
|
result = runCatching {
|
||||||
|
block()
|
||||||
|
}
|
||||||
}.invokeOnCompletion {
|
}.invokeOnCompletion {
|
||||||
synchronized(objectToSynchronize) {
|
synchronized(objectToSynchronize) {
|
||||||
objectToSynchronize.notifyAll()
|
objectToSynchronize.notifyAll()
|
||||||
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = true
|
|
@@ -1,25 +1,20 @@
|
|||||||
package dev.inmo.micro_utils.coroutines
|
package dev.inmo.micro_utils.coroutines
|
||||||
|
|
||||||
import kotlinx.coroutines.*
|
import kotlinx.coroutines.*
|
||||||
|
import kotlinx.coroutines.test.runTest
|
||||||
import kotlin.test.Test
|
import kotlin.test.Test
|
||||||
|
|
||||||
class HandleSafelyCoroutineContextTest {
|
class HandleSafelyCoroutineContextTest {
|
||||||
@Test
|
@Test
|
||||||
fun testHandleSafelyCoroutineContext() {
|
fun testHandleSafelyCoroutineContext() = runTest {
|
||||||
val scope = CoroutineScope(Dispatchers.Default)
|
val scope = this
|
||||||
var contextHandlerHappen = false
|
var contextHandlerHappen = false
|
||||||
var localHandlerHappen = false
|
var localHandlerHappen = false
|
||||||
var defaultHandlerHappen = false
|
|
||||||
defaultSafelyExceptionHandler = {
|
|
||||||
defaultHandlerHappen = true
|
|
||||||
throw it
|
|
||||||
}
|
|
||||||
val contextHandler: ExceptionHandler<Unit> = {
|
|
||||||
contextHandlerHappen = true
|
|
||||||
}
|
|
||||||
val checkJob = scope.launch {
|
val checkJob = scope.launch {
|
||||||
safelyWithContextExceptionHandler(contextHandler) {
|
runCatchingLogging ({
|
||||||
safely(
|
contextHandlerHappen = true
|
||||||
|
}) {
|
||||||
|
runCatchingLogging (
|
||||||
{
|
{
|
||||||
localHandlerHappen = true
|
localHandlerHappen = true
|
||||||
}
|
}
|
||||||
@@ -29,10 +24,8 @@ class HandleSafelyCoroutineContextTest {
|
|||||||
println(coroutineContext)
|
println(coroutineContext)
|
||||||
error("That must happen too:)")
|
error("That must happen too:)")
|
||||||
}
|
}
|
||||||
}
|
}.join()
|
||||||
launchSynchronously { checkJob.join() }
|
|
||||||
assert(contextHandlerHappen)
|
assert(contextHandlerHappen)
|
||||||
assert(localHandlerHappen)
|
assert(localHandlerHappen)
|
||||||
assert(defaultHandlerHappen)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
@@ -1,3 +1,5 @@
|
|||||||
|
package dev.inmo.micro_utils.coroutines
|
||||||
|
|
||||||
import dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode
|
import dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode
|
||||||
import dev.inmo.micro_utils.coroutines.collections.addSubNode
|
import dev.inmo.micro_utils.coroutines.collections.addSubNode
|
||||||
import dev.inmo.micro_utils.coroutines.collections.findNode
|
import dev.inmo.micro_utils.coroutines.collections.findNode
|
||||||
@@ -10,8 +12,6 @@ import kotlin.test.assertEquals
|
|||||||
import kotlin.test.assertTrue
|
import kotlin.test.assertTrue
|
||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
expect val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
|
|
||||||
class SortedBinaryTreeNodeTests {
|
class SortedBinaryTreeNodeTests {
|
||||||
@Test
|
@Test
|
||||||
fun insertOnZeroLevelWorks() = runTest {
|
fun insertOnZeroLevelWorks() = runTest {
|
||||||
@@ -46,7 +46,6 @@ class SortedBinaryTreeNodeTests {
|
|||||||
}
|
}
|
||||||
@Test
|
@Test
|
||||||
fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
|
fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
|
||||||
if (AllowDeepInsertOnWorksTest == false) return@runTest
|
|
||||||
val zeroNode = SortedBinaryTreeNode(0)
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
val rangeRadius = 500
|
val rangeRadius = 500
|
||||||
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
||||||
@@ -124,7 +123,6 @@ class SortedBinaryTreeNodeTests {
|
|||||||
}
|
}
|
||||||
@Test
|
@Test
|
||||||
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
||||||
if (AllowDeepInsertOnWorksTest == false) return@runTest
|
|
||||||
val zeroNode = SortedBinaryTreeNode(0)
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
val rangeRadius = 500
|
val rangeRadius = 500
|
||||||
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
@@ -0,0 +1,118 @@
|
|||||||
|
package dev.inmo.micro_utils.coroutines
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.*
|
||||||
|
import kotlinx.coroutines.test.runTest
|
||||||
|
import kotlin.test.Test
|
||||||
|
import kotlin.test.assertEquals
|
||||||
|
import kotlin.test.assertTrue
|
||||||
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
|
class SortedMapLikeBinaryTreeNodeTests {
|
||||||
|
@Test
|
||||||
|
fun insertOnZeroLevelWorks() = runTest {
|
||||||
|
val zeroNode = SortedMapLikeBinaryTreeNode(0, 0)
|
||||||
|
zeroNode.upsertSubNode(1, 1)
|
||||||
|
zeroNode.upsertSubNode(-1, -1)
|
||||||
|
|
||||||
|
assertEquals(0, zeroNode.key)
|
||||||
|
assertEquals(1, zeroNode.getRightNode() ?.key)
|
||||||
|
assertEquals(-1, zeroNode.getLeftNode() ?.key)
|
||||||
|
|
||||||
|
assertEquals(0, zeroNode.findNode(0) ?.value)
|
||||||
|
assertEquals(1, zeroNode.findNode(1) ?.value)
|
||||||
|
assertEquals(-1, zeroNode.findNode(-1) ?.value)
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun searchOnZeroLevelWorks() = runTest {
|
||||||
|
val zeroNode = SortedMapLikeBinaryTreeNode(0, 0)
|
||||||
|
val oneNode = zeroNode.upsertSubNode(1, 1)
|
||||||
|
val minusOneNode = zeroNode.upsertSubNode(-1, -1)
|
||||||
|
|
||||||
|
val assertingNodesToSearchQuery = mapOf(
|
||||||
|
setOf(oneNode) to (1 .. 1),
|
||||||
|
setOf(zeroNode, oneNode) to (0 .. 1),
|
||||||
|
setOf(minusOneNode, zeroNode, oneNode) to (-1 .. 1),
|
||||||
|
setOf(minusOneNode, zeroNode) to (-1 .. 0),
|
||||||
|
setOf(minusOneNode) to (-1 .. -1),
|
||||||
|
setOf(zeroNode) to (0 .. 0),
|
||||||
|
)
|
||||||
|
|
||||||
|
assertingNodesToSearchQuery.forEach {
|
||||||
|
val foundData = zeroNode.findNodesInRange(it.value)
|
||||||
|
assertTrue(foundData.containsAll(it.key))
|
||||||
|
assertTrue(it.key.containsAll(foundData))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun deepReInsertOnWorks() = runTest(timeout = 300.seconds) {
|
||||||
|
var zeroNode = SortedMapLikeBinaryTreeNode(0, 0)
|
||||||
|
val rangeRadius = 500
|
||||||
|
val nodes = mutableMapOf<Int, SortedMapLikeBinaryTreeNode<Int, Int>>()
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
nodes[i] = zeroNode.upsertSubNode(i, i)
|
||||||
|
if (i == zeroNode.key) {
|
||||||
|
zeroNode = nodes.getValue(i)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
val expectedNode = nodes.getValue(i)
|
||||||
|
val foundNode = zeroNode.findNode(i)
|
||||||
|
|
||||||
|
assertEquals(expectedNode, foundNode)
|
||||||
|
|
||||||
|
if (expectedNode === zeroNode) continue
|
||||||
|
|
||||||
|
val parentNode = zeroNode.findParentNode(i)
|
||||||
|
assertTrue(
|
||||||
|
parentNode ?.getLeftNode() === expectedNode || parentNode ?.getRightNode() === expectedNode,
|
||||||
|
"It is expected, that parent node with data ${parentNode ?.key} will be parent of ${expectedNode.key}, but its left subnode is ${parentNode ?.getLeftNode() ?.key} and right one is ${parentNode ?.getRightNode() ?.key}"
|
||||||
|
)
|
||||||
|
assertTrue(
|
||||||
|
foundNode != null && expectedNode.deepEquals(foundNode)
|
||||||
|
)
|
||||||
|
|
||||||
|
zeroNode.upsertSubNode(i, -i)
|
||||||
|
val foundModifiedNode = zeroNode.findNode(i)
|
||||||
|
assertEquals(foundNode ?.value, foundModifiedNode ?.value ?.times(-1))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
||||||
|
val zeroNode = SortedMapLikeBinaryTreeNode(0, 0)
|
||||||
|
val rangeRadius = 500
|
||||||
|
val nodes = mutableMapOf<Int, SortedMapLikeBinaryTreeNode<Int, Int>>()
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
if (zeroNode.key != i) {
|
||||||
|
nodes[i] = zeroNode.upsertSubNode(i, i)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
nodes[zeroNode.key] = zeroNode
|
||||||
|
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
val expectedNode = nodes.getValue(i)
|
||||||
|
val foundNode = zeroNode.findNode(i)
|
||||||
|
|
||||||
|
assertTrue(expectedNode === foundNode)
|
||||||
|
|
||||||
|
if (expectedNode === zeroNode) continue
|
||||||
|
|
||||||
|
val parentNode = zeroNode.findParentNode(i)
|
||||||
|
assertTrue(
|
||||||
|
parentNode ?.getLeftNode() === expectedNode || parentNode ?.getRightNode() === expectedNode,
|
||||||
|
"It is expected, that parent node with data ${parentNode ?.key} will be parent of ${expectedNode.key}, but its left subnode is ${parentNode ?.getLeftNode() ?.key} and right one is ${parentNode ?.getRightNode() ?.key}"
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
val sourceTreeSize = zeroNode.size()
|
||||||
|
|
||||||
|
var previousData = -rangeRadius - 1
|
||||||
|
for (node in zeroNode) {
|
||||||
|
assertTrue(nodes[node.key] === node)
|
||||||
|
assertTrue(previousData == node.key - 1)
|
||||||
|
previousData = node.key
|
||||||
|
}
|
||||||
|
|
||||||
|
assertTrue(sourceTreeSize == zeroNode.size())
|
||||||
|
}
|
||||||
|
}
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = true
|
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = true
|
|
@@ -1,2 +0,0 @@
|
|||||||
actual val AllowDeepInsertOnWorksTest: Boolean
|
|
||||||
get() = true
|
|
@@ -15,5 +15,5 @@ crypto_js_version=4.1.1
|
|||||||
# Project data
|
# Project data
|
||||||
|
|
||||||
group=dev.inmo
|
group=dev.inmo
|
||||||
version=0.24.8
|
version=0.25.2
|
||||||
android_code_version=288
|
android_code_version=292
|
||||||
|
@@ -7,7 +7,7 @@ kt-coroutines = "1.10.1"
|
|||||||
kslog = "1.4.1"
|
kslog = "1.4.1"
|
||||||
|
|
||||||
jb-compose = "1.7.3"
|
jb-compose = "1.7.3"
|
||||||
jb-exposed = "0.59.0"
|
jb-exposed = "0.60.0"
|
||||||
jb-dokka = "2.0.0"
|
jb-dokka = "2.0.0"
|
||||||
|
|
||||||
sqlite = "3.49.1.0"
|
sqlite = "3.49.1.0"
|
||||||
|
@@ -17,11 +17,13 @@ kotlin {
|
|||||||
jvmMain {
|
jvmMain {
|
||||||
dependencies {
|
dependencies {
|
||||||
api libs.kt.reflect
|
api libs.kt.reflect
|
||||||
|
api project(":micro_utils.coroutines")
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
androidMain {
|
androidMain {
|
||||||
dependencies {
|
dependencies {
|
||||||
api libs.kt.reflect
|
api libs.kt.reflect
|
||||||
|
api project(":micro_utils.coroutines")
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
32
koin/src/jvmMain/kotlin/FactorySuspend.kt
Normal file
32
koin/src/jvmMain/kotlin/FactorySuspend.kt
Normal file
@@ -0,0 +1,32 @@
|
|||||||
|
package dev.inmo.micro_utils.koin
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.doSynchronously
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
import org.koin.core.module.Module
|
||||||
|
import org.koin.core.parameter.ParametersHolder
|
||||||
|
import org.koin.core.qualifier.Qualifier
|
||||||
|
import org.koin.core.qualifier.StringQualifier
|
||||||
|
import org.koin.core.scope.Scope
|
||||||
|
import kotlin.reflect.KClass
|
||||||
|
|
||||||
|
inline fun <reified T : Any> Module.factorySuspend(
|
||||||
|
qualifier: Qualifier? = null,
|
||||||
|
coroutineScope: CoroutineScope? = null,
|
||||||
|
noinline definition: suspend Scope.(ParametersHolder) -> T
|
||||||
|
) = factory(
|
||||||
|
qualifier,
|
||||||
|
if (coroutineScope == null) {
|
||||||
|
{
|
||||||
|
doSynchronously {
|
||||||
|
definition(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
{
|
||||||
|
coroutineScope.doSynchronously {
|
||||||
|
definition(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
)
|
||||||
|
|
32
koin/src/jvmMain/kotlin/SingleSuspend.kt
Normal file
32
koin/src/jvmMain/kotlin/SingleSuspend.kt
Normal file
@@ -0,0 +1,32 @@
|
|||||||
|
package dev.inmo.micro_utils.koin
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.doSynchronously
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
import org.koin.core.module.Module
|
||||||
|
import org.koin.core.parameter.ParametersHolder
|
||||||
|
import org.koin.core.qualifier.StringQualifier
|
||||||
|
import org.koin.core.scope.Scope
|
||||||
|
|
||||||
|
inline fun <reified T : Any> Module.singleSuspend(
|
||||||
|
qualifier: StringQualifier,
|
||||||
|
createdAtStart: Boolean = false,
|
||||||
|
coroutineScope: CoroutineScope? = null,
|
||||||
|
noinline definition: suspend Scope.(ParametersHolder) -> T
|
||||||
|
) = single(
|
||||||
|
qualifier,
|
||||||
|
createdAtStart,
|
||||||
|
if (coroutineScope == null) {
|
||||||
|
{
|
||||||
|
doSynchronously {
|
||||||
|
definition(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
{
|
||||||
|
coroutineScope.doSynchronously {
|
||||||
|
definition(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
)
|
||||||
|
|
@@ -32,7 +32,7 @@ data class PaginationResult<T>(
|
|||||||
page: Int,
|
page: Int,
|
||||||
results: List<T>,
|
results: List<T>,
|
||||||
pagesNumber: Int,
|
pagesNumber: Int,
|
||||||
size: Int
|
size: Int = results.size
|
||||||
) : this(
|
) : this(
|
||||||
page,
|
page,
|
||||||
size,
|
size,
|
||||||
|
@@ -26,6 +26,16 @@ inline fun Pagination.nextPage() =
|
|||||||
size
|
size
|
||||||
)
|
)
|
||||||
|
|
||||||
|
/**
|
||||||
|
* This method DO NOT check [Pagination.page] of receiver. Returns pagination for previous page
|
||||||
|
*/
|
||||||
|
@Suppress("NOTHING_TO_INLINE")
|
||||||
|
inline fun Pagination.previousPage() =
|
||||||
|
SimplePagination(
|
||||||
|
page - 1,
|
||||||
|
size
|
||||||
|
)
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* @param page Current page number
|
* @param page Current page number
|
||||||
* @param size Current page size
|
* @param size Current page size
|
||||||
|
@@ -1,7 +1,14 @@
|
|||||||
package dev.inmo.micro_utils.pagination.compose
|
package dev.inmo.micro_utils.pagination.compose
|
||||||
|
|
||||||
import androidx.compose.runtime.*
|
import androidx.compose.runtime.*
|
||||||
|
import dev.inmo.micro_utils.coroutines.SpecialMutableStateFlow
|
||||||
|
import dev.inmo.micro_utils.coroutines.launchLoggingDropExceptions
|
||||||
|
import dev.inmo.micro_utils.coroutines.runCatchingLogging
|
||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
import kotlinx.coroutines.Job
|
||||||
|
import kotlinx.coroutines.sync.Mutex
|
||||||
|
import kotlinx.coroutines.sync.withLock
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Context for managing infinite pagination in a Compose UI.
|
* Context for managing infinite pagination in a Compose UI.
|
||||||
@@ -15,35 +22,46 @@ import dev.inmo.micro_utils.pagination.*
|
|||||||
*/
|
*/
|
||||||
class InfinityPagedComponentContext<T> internal constructor(
|
class InfinityPagedComponentContext<T> internal constructor(
|
||||||
page: Int,
|
page: Int,
|
||||||
size: Int
|
size: Int,
|
||||||
|
private val scope: CoroutineScope,
|
||||||
|
private val loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>
|
||||||
) {
|
) {
|
||||||
internal val startPage = SimplePagination(page, size)
|
internal val startPage = SimplePagination(page, size)
|
||||||
internal val iterationState: MutableState<Pair<Int, Pagination?>> = mutableStateOf(0 to null)
|
internal val latestLoadedPage = SpecialMutableStateFlow<PaginationResult<T>?>(null)
|
||||||
internal val dataState: MutableState<List<T>?> = mutableStateOf(null)
|
internal val dataState = SpecialMutableStateFlow<List<T>?>(null)
|
||||||
internal var lastPageLoaded = false
|
internal var loadingJob: Job? = null
|
||||||
|
internal val loadingMutex = Mutex()
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Loads the next page of data. If the current page is the last one, the function returns early.
|
* Loads the next page of data. If the current page is the last one, the function returns early.
|
||||||
*/
|
*/
|
||||||
fun loadNext() {
|
fun loadNext(): Job {
|
||||||
if (lastPageLoaded) return
|
return scope.launchLoggingDropExceptions {
|
||||||
if (iterationState.value.second is SimplePagination) return // Data loading has been inited but not loaded yet
|
loadingMutex.withLock {
|
||||||
|
if (latestLoadedPage.value ?.isLastPage == true) return@launchLoggingDropExceptions
|
||||||
iterationState.value = iterationState.value.let {
|
loadingJob = loadingJob ?: scope.launchLoggingDropExceptions {
|
||||||
if ((it.second as? PaginationResult<*>) ?.isLastPage == true) return
|
runCatching {
|
||||||
(it.first + 1) to (it.second ?: startPage).nextPage()
|
loader(latestLoadedPage.value ?.nextPage() ?: startPage)
|
||||||
|
}.onSuccess {
|
||||||
|
latestLoadedPage.value = it
|
||||||
|
dataState.value = (dataState.value ?: emptyList()) + it.results
|
||||||
|
}
|
||||||
|
loadingMutex.withLock {
|
||||||
|
loadingJob = null
|
||||||
|
}
|
||||||
|
}
|
||||||
|
loadingJob
|
||||||
|
} ?.join()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Reloads the pagination from the first page, clearing previously loaded data.
|
* Reloads the pagination from the first page, clearing previously loaded data.
|
||||||
*/
|
*/
|
||||||
fun reload() {
|
fun reload(): Job {
|
||||||
|
latestLoadedPage.value = null
|
||||||
dataState.value = null
|
dataState.value = null
|
||||||
lastPageLoaded = false
|
return loadNext()
|
||||||
iterationState.value = iterationState.value.let {
|
|
||||||
(it.first + 1) to null
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -62,20 +80,17 @@ internal fun <T> InfinityPagedComponent(
|
|||||||
page: Int,
|
page: Int,
|
||||||
size: Int,
|
size: Int,
|
||||||
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
) {
|
) {
|
||||||
val context = remember { InfinityPagedComponentContext<T>(page, size) }
|
val scope = predefinedScope ?: rememberCoroutineScope()
|
||||||
|
val context = remember { InfinityPagedComponentContext<T>(page, size, scope, loader) }
|
||||||
LaunchedEffect(context.iterationState.value.first) {
|
remember {
|
||||||
val paginationResult = loader(context, context.iterationState.value.second ?: context.startPage)
|
context.reload()
|
||||||
if (paginationResult.isLastPage) {
|
|
||||||
context.lastPageLoaded = true
|
|
||||||
}
|
|
||||||
context.iterationState.value = context.iterationState.value.copy(second = paginationResult)
|
|
||||||
context.dataState.value = (context.dataState.value ?: emptyList()) + paginationResult.results
|
|
||||||
}
|
}
|
||||||
|
|
||||||
context.block(context.dataState.value)
|
val dataState = context.dataState.collectAsState()
|
||||||
|
context.block(dataState.value)
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@@ -91,12 +106,14 @@ internal fun <T> InfinityPagedComponent(
|
|||||||
fun <T> InfinityPagedComponent(
|
fun <T> InfinityPagedComponent(
|
||||||
pageInfo: Pagination,
|
pageInfo: Pagination,
|
||||||
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
) {
|
) {
|
||||||
InfinityPagedComponent(
|
InfinityPagedComponent(
|
||||||
pageInfo.page,
|
pageInfo.page,
|
||||||
pageInfo.size,
|
pageInfo.size,
|
||||||
loader,
|
loader,
|
||||||
|
predefinedScope,
|
||||||
block
|
block
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
@@ -114,7 +131,8 @@ fun <T> InfinityPagedComponent(
|
|||||||
fun <T> InfinityPagedComponent(
|
fun <T> InfinityPagedComponent(
|
||||||
size: Int,
|
size: Int,
|
||||||
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
) {
|
) {
|
||||||
InfinityPagedComponent(0, size, loader, block)
|
InfinityPagedComponent(0, size, loader, predefinedScope, block)
|
||||||
}
|
}
|
||||||
|
@@ -1,10 +1,13 @@
|
|||||||
package dev.inmo.micro_utils.pagination.compose
|
package dev.inmo.micro_utils.pagination.compose
|
||||||
|
|
||||||
import androidx.compose.runtime.*
|
import androidx.compose.runtime.*
|
||||||
import dev.inmo.micro_utils.common.Optional
|
import dev.inmo.micro_utils.coroutines.SpecialMutableStateFlow
|
||||||
import dev.inmo.micro_utils.common.dataOrThrow
|
import dev.inmo.micro_utils.coroutines.launchLoggingDropExceptions
|
||||||
import dev.inmo.micro_utils.common.optional
|
|
||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
import kotlinx.coroutines.Job
|
||||||
|
import kotlinx.coroutines.sync.Mutex
|
||||||
|
import kotlinx.coroutines.sync.withLock
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Context for managing paginated data in a Compose UI.
|
* Context for managing paginated data in a Compose UI.
|
||||||
@@ -19,45 +22,73 @@ import dev.inmo.micro_utils.pagination.*
|
|||||||
* @param size Number of items per page.
|
* @param size Number of items per page.
|
||||||
*/
|
*/
|
||||||
class PagedComponentContext<T> internal constructor(
|
class PagedComponentContext<T> internal constructor(
|
||||||
preset: PaginationResult<T>? = null,
|
|
||||||
initialPage: Int,
|
initialPage: Int,
|
||||||
size: Int
|
size: Int,
|
||||||
|
private val scope: CoroutineScope,
|
||||||
|
private val loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>
|
||||||
) {
|
) {
|
||||||
internal val iterationState: MutableState<Pair<Int, Pagination>> = mutableStateOf(0 to SimplePagination(preset?.page ?: initialPage, preset?.size ?: size))
|
internal val startPage = SimplePagination(initialPage, size)
|
||||||
|
internal val latestLoadedPage = SpecialMutableStateFlow<PaginationResult<T>?>(null)
|
||||||
|
internal val dataState = SpecialMutableStateFlow<PaginationResult<T>?>(null)
|
||||||
|
internal var loadingJob: Job? = null
|
||||||
|
internal val loadingMutex = Mutex()
|
||||||
|
|
||||||
internal var dataOptional: PaginationResult<T>? = preset
|
private fun initLoadingJob(
|
||||||
private set
|
skipCheckerInLock: () -> Boolean,
|
||||||
internal val dataState: MutableState<PaginationResult<T>?> = mutableStateOf(dataOptional)
|
pageGetter: () -> Pagination
|
||||||
|
): Job {
|
||||||
|
return scope.launchLoggingDropExceptions {
|
||||||
|
loadingMutex.withLock {
|
||||||
|
if (skipCheckerInLock()) return@launchLoggingDropExceptions
|
||||||
|
loadingJob = loadingJob ?: scope.launchLoggingDropExceptions {
|
||||||
|
runCatching {
|
||||||
|
loader(pageGetter())
|
||||||
|
}.onSuccess {
|
||||||
|
latestLoadedPage.value = it
|
||||||
|
dataState.value = it
|
||||||
|
}
|
||||||
|
loadingMutex.withLock {
|
||||||
|
loadingJob = null
|
||||||
|
}
|
||||||
|
}
|
||||||
|
loadingJob
|
||||||
|
} ?.join()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Loads the next page of data. If the last page is reached, this function returns early.
|
* Loads the next page of data. If the last page is reached, this function returns early.
|
||||||
*/
|
*/
|
||||||
fun loadNext() {
|
fun loadNext(): Job {
|
||||||
iterationState.value = iterationState.value.let {
|
return initLoadingJob(
|
||||||
if (dataState.value ?.isLastPage == true) return
|
{ latestLoadedPage.value ?.isLastPage == true }
|
||||||
(it.first + 1) to it.second.nextPage()
|
) {
|
||||||
|
latestLoadedPage.value ?.nextPage() ?: startPage
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Loads the previous page of data if available.
|
* Loads the previous page of data if available.
|
||||||
*/
|
*/
|
||||||
fun loadPrevious() {
|
fun loadPrevious(): Job {
|
||||||
iterationState.value = iterationState.value.let {
|
return initLoadingJob(
|
||||||
if (it.second.isFirstPage) return
|
{ latestLoadedPage.value ?.isFirstPage == true }
|
||||||
(it.first - 1) to SimplePagination(
|
) {
|
||||||
it.second.page - 1,
|
latestLoadedPage.value ?.previousPage() ?: startPage
|
||||||
it.second.size
|
|
||||||
)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Reloads the current page, refreshing the data.
|
* Reloads the current page, refreshing the data.
|
||||||
*/
|
*/
|
||||||
fun reload() {
|
fun reload(): Job {
|
||||||
iterationState.value = iterationState.value.let {
|
return initLoadingJob(
|
||||||
it.copy(it.first + 1)
|
{
|
||||||
|
latestLoadedPage.value = null
|
||||||
|
true
|
||||||
|
}
|
||||||
|
) {
|
||||||
|
startPage
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -74,46 +105,24 @@ class PagedComponentContext<T> internal constructor(
|
|||||||
*/
|
*/
|
||||||
@Composable
|
@Composable
|
||||||
internal fun <T> PagedComponent(
|
internal fun <T> PagedComponent(
|
||||||
preload: PaginationResult<T>?,
|
|
||||||
initialPage: Int,
|
initialPage: Int,
|
||||||
size: Int,
|
size: Int,
|
||||||
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
) {
|
) {
|
||||||
val context = remember { PagedComponentContext(preload, initialPage, size) }
|
val scope = predefinedScope ?: rememberCoroutineScope()
|
||||||
|
val context = remember { PagedComponentContext<T>(initialPage, size, scope, loader) }
|
||||||
LaunchedEffect(context.iterationState.value) {
|
remember {
|
||||||
context.dataState.value = loader(context, context.iterationState.value.second)
|
context.reload()
|
||||||
}
|
}
|
||||||
|
|
||||||
context.dataState.value ?.let {
|
val pageState = context.dataState.collectAsState()
|
||||||
|
pageState.value ?.let {
|
||||||
context.block(it)
|
context.block(it)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
|
||||||
* Overloaded composable function for paginated components with preloaded data.
|
|
||||||
*
|
|
||||||
* @param T The type of paginated data.
|
|
||||||
* @param preload Preloaded pagination result.
|
|
||||||
* @param loader Suspended function that loads paginated data.
|
|
||||||
* @param block Composable function that renders the UI with the loaded data.
|
|
||||||
*/
|
|
||||||
@Composable
|
|
||||||
fun <T> PagedComponent(
|
|
||||||
preload: PaginationResult<T>,
|
|
||||||
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
|
||||||
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
|
||||||
) {
|
|
||||||
PagedComponent(
|
|
||||||
preload,
|
|
||||||
preload.page,
|
|
||||||
preload.size,
|
|
||||||
loader,
|
|
||||||
block
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Overloaded composable function for paginated components with pagination info.
|
* Overloaded composable function for paginated components with pagination info.
|
||||||
*
|
*
|
||||||
@@ -126,36 +135,18 @@ fun <T> PagedComponent(
|
|||||||
fun <T> PagedComponent(
|
fun <T> PagedComponent(
|
||||||
pageInfo: Pagination,
|
pageInfo: Pagination,
|
||||||
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
) {
|
) {
|
||||||
PagedComponent(
|
PagedComponent(
|
||||||
null,
|
|
||||||
pageInfo.page,
|
pageInfo.page,
|
||||||
pageInfo.size,
|
pageInfo.size,
|
||||||
loader,
|
loader,
|
||||||
|
predefinedScope,
|
||||||
block
|
block
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
|
||||||
* Overloaded composable function for paginated components with an initial page.
|
|
||||||
*
|
|
||||||
* @param T The type of paginated data.
|
|
||||||
* @param initialPage Initial page number.
|
|
||||||
* @param size Number of items per page.
|
|
||||||
* @param loader Suspended function that loads paginated data.
|
|
||||||
* @param block Composable function that renders the UI with the loaded data.
|
|
||||||
*/
|
|
||||||
@Composable
|
|
||||||
fun <T> PagedComponent(
|
|
||||||
initialPage: Int,
|
|
||||||
size: Int,
|
|
||||||
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
|
||||||
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
|
||||||
) {
|
|
||||||
PagedComponent(null, initialPage, size, loader, block)
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Overloaded composable function for paginated components with only a size parameter.
|
* Overloaded composable function for paginated components with only a size parameter.
|
||||||
*
|
*
|
||||||
@@ -168,7 +159,8 @@ fun <T> PagedComponent(
|
|||||||
fun <T> PagedComponent(
|
fun <T> PagedComponent(
|
||||||
size: Int,
|
size: Int,
|
||||||
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
predefinedScope: CoroutineScope? = null,
|
||||||
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
) {
|
) {
|
||||||
PagedComponent(0, size, loader, block)
|
PagedComponent(0, size, loader, predefinedScope, block)
|
||||||
}
|
}
|
||||||
|
@@ -30,15 +30,13 @@ class InfinityPagedComponentTests {
|
|||||||
}
|
}
|
||||||
) {
|
) {
|
||||||
if (it == null) {
|
if (it == null) {
|
||||||
if (this.iterationState.value.second != null) {
|
assertEquals(null, it)
|
||||||
assertEquals(0, (this.iterationState.value.second as? SimplePagination) ?.page)
|
|
||||||
}
|
|
||||||
} else {
|
} else {
|
||||||
assertEquals(expectedList, it)
|
assertEquals(expectedList, it)
|
||||||
}
|
}
|
||||||
|
|
||||||
LaunchedEffect(it ?.size) {
|
LaunchedEffect(it ?.size) {
|
||||||
loadNext()
|
loadNext().join()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -0,0 +1,14 @@
|
|||||||
|
package dev.inmo.micro_utils.repos.annotations
|
||||||
|
|
||||||
|
|
||||||
|
@RequiresOptIn(
|
||||||
|
"Overriding of this invalidate message requires manual launching of invalidation on class initialization process",
|
||||||
|
RequiresOptIn.Level.WARNING
|
||||||
|
)
|
||||||
|
@Target(
|
||||||
|
AnnotationTarget.CONSTRUCTOR,
|
||||||
|
AnnotationTarget.FIELD,
|
||||||
|
AnnotationTarget.PROPERTY,
|
||||||
|
AnnotationTarget.FUNCTION,
|
||||||
|
)
|
||||||
|
annotation class OverrideRequireManualInvalidation
|
@@ -4,6 +4,7 @@ import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
|||||||
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
||||||
import dev.inmo.micro_utils.coroutines.withWriteLock
|
import dev.inmo.micro_utils.coroutines.withWriteLock
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
@@ -12,10 +13,10 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class ReadCRUDCacheRepo<ObjectType, IdType>(
|
open class ReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
protected open val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
protected val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
||||||
protected open val kvCache: KVCache<IdType, ObjectType>,
|
protected val kvCache: KVCache<IdType, ObjectType>,
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
protected open val idGetter: (ObjectType) -> IdType
|
protected val idGetter: (ObjectType) -> IdType
|
||||||
) : ReadCRUDRepo<ObjectType, IdType> by parentRepo, CommonCacheRepo {
|
) : ReadCRUDRepo<ObjectType, IdType> by parentRepo, CommonCacheRepo {
|
||||||
override suspend fun getById(id: IdType): ObjectType? = locker.withReadAcquire {
|
override suspend fun getById(id: IdType): ObjectType? = locker.withReadAcquire {
|
||||||
kvCache.get(id)
|
kvCache.get(id)
|
||||||
@@ -39,6 +40,7 @@ open class ReadCRUDCacheRepo<ObjectType, IdType>(
|
|||||||
kvCache.contains(id)
|
kvCache.contains(id)
|
||||||
} || parentRepo.contains(id)
|
} || parentRepo.contains(id)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() = locker.withWriteLock {
|
override suspend fun invalidate() = locker.withWriteLock {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
@@ -51,11 +53,11 @@ fun <ObjectType, IdType> ReadCRUDRepo<ObjectType, IdType>.cached(
|
|||||||
) = ReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
) = ReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
||||||
|
|
||||||
open class WriteCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
open class WriteCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
||||||
protected open val parentRepo: WriteCRUDRepo<ObjectType, IdType, InputValueType>,
|
protected val parentRepo: WriteCRUDRepo<ObjectType, IdType, InputValueType>,
|
||||||
protected open val kvCache: KeyValueRepo<IdType, ObjectType>,
|
protected val kvCache: KeyValueRepo<IdType, ObjectType>,
|
||||||
protected open val scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
protected val scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
protected open val idGetter: (ObjectType) -> IdType
|
protected val idGetter: (ObjectType) -> IdType
|
||||||
) : WriteCRUDRepo<ObjectType, IdType, InputValueType>, CommonCacheRepo {
|
) : WriteCRUDRepo<ObjectType, IdType, InputValueType>, CommonCacheRepo {
|
||||||
override val newObjectsFlow: Flow<ObjectType> by parentRepo::newObjectsFlow
|
override val newObjectsFlow: Flow<ObjectType> by parentRepo::newObjectsFlow
|
||||||
override val updatedObjectsFlow: Flow<ObjectType> by parentRepo::updatedObjectsFlow
|
override val updatedObjectsFlow: Flow<ObjectType> by parentRepo::updatedObjectsFlow
|
||||||
@@ -117,6 +119,7 @@ open class WriteCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
|||||||
return created
|
return created
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() = locker.withWriteLock {
|
override suspend fun invalidate() = locker.withWriteLock {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
@@ -131,25 +134,26 @@ fun <ObjectType, IdType, InputType> WriteCRUDRepo<ObjectType, IdType, InputType>
|
|||||||
|
|
||||||
|
|
||||||
open class CRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
open class CRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
||||||
override val parentRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
protected val crudRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
||||||
kvCache: KVCache<IdType, ObjectType>,
|
kvCache: KVCache<IdType, ObjectType>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
locker: SmartRWLocker = SmartRWLocker(),
|
locker: SmartRWLocker = SmartRWLocker(),
|
||||||
idGetter: (ObjectType) -> IdType
|
idGetter: (ObjectType) -> IdType
|
||||||
) : ReadCRUDCacheRepo<ObjectType, IdType>(
|
) : ReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
locker,
|
locker,
|
||||||
idGetter
|
idGetter
|
||||||
),
|
),
|
||||||
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
scope,
|
scope,
|
||||||
locker,
|
locker,
|
||||||
idGetter
|
idGetter
|
||||||
),
|
),
|
||||||
CRUDRepo<ObjectType, IdType, InputValueType> {
|
CRUDRepo<ObjectType, IdType, InputValueType> {
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -1,5 +1,8 @@
|
|||||||
package dev.inmo.micro_utils.repos.cache
|
package dev.inmo.micro_utils.repos.cache
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.launchLoggingDropExceptions
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
|
||||||
interface InvalidatableRepo {
|
interface InvalidatableRepo {
|
||||||
/**
|
/**
|
||||||
* Invalidates its internal data. It __may__ lead to autoreload of data. In case when repo makes autoreload,
|
* Invalidates its internal data. It __may__ lead to autoreload of data. In case when repo makes autoreload,
|
||||||
@@ -8,4 +11,14 @@ interface InvalidatableRepo {
|
|||||||
suspend fun invalidate()
|
suspend fun invalidate()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
suspend fun <T : InvalidatableRepo> T.alsoInvalidate() = also {
|
||||||
|
invalidate()
|
||||||
|
}
|
||||||
|
|
||||||
|
fun <T : InvalidatableRepo> T.alsoInvalidateAsync(scope: CoroutineScope) = also {
|
||||||
|
scope.launchLoggingDropExceptions {
|
||||||
|
invalidate()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
typealias CacheRepo = InvalidatableRepo
|
typealias CacheRepo = InvalidatableRepo
|
||||||
|
@@ -5,6 +5,7 @@ import dev.inmo.micro_utils.coroutines.withReadAcquire
|
|||||||
import dev.inmo.micro_utils.coroutines.withWriteLock
|
import dev.inmo.micro_utils.coroutines.withWriteLock
|
||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
@@ -12,8 +13,8 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class ReadKeyValueCacheRepo<Key,Value>(
|
open class ReadKeyValueCacheRepo<Key,Value>(
|
||||||
protected open val parentRepo: ReadKeyValueRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValueRepo<Key, Value>,
|
||||||
protected open val kvCache: KVCache<Key, Value>,
|
protected val kvCache: KVCache<Key, Value>,
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : ReadKeyValueRepo<Key,Value> by parentRepo, CommonCacheRepo {
|
) : ReadKeyValueRepo<Key,Value> by parentRepo, CommonCacheRepo {
|
||||||
override suspend fun get(k: Key): Value? = locker.withReadAcquire {
|
override suspend fun get(k: Key): Value? = locker.withReadAcquire {
|
||||||
@@ -49,6 +50,7 @@ open class ReadKeyValueCacheRepo<Key,Value>(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -58,24 +60,24 @@ fun <Key, Value> ReadKeyValueRepo<Key, Value>.cached(
|
|||||||
) = ReadKeyValueCacheRepo(this, kvCache, locker)
|
) = ReadKeyValueCacheRepo(this, kvCache, locker)
|
||||||
|
|
||||||
open class KeyValueCacheRepo<Key,Value>(
|
open class KeyValueCacheRepo<Key,Value>(
|
||||||
override val parentRepo: KeyValueRepo<Key, Value>,
|
protected val kvRepo: KeyValueRepo<Key, Value>,
|
||||||
kvCache: KVCache<Key, Value>,
|
kvCache: KVCache<Key, Value>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
locker: SmartRWLocker = SmartRWLocker(),
|
locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : ReadKeyValueCacheRepo<Key,Value>(parentRepo, kvCache, locker), KeyValueRepo<Key,Value>, WriteKeyValueRepo<Key, Value> by parentRepo, CommonCacheRepo {
|
) : ReadKeyValueCacheRepo<Key,Value>(kvRepo, kvCache, locker), KeyValueRepo<Key,Value>, WriteKeyValueRepo<Key, Value> by kvRepo, CommonCacheRepo {
|
||||||
protected val onNewJob = parentRepo.onNewValue.onEach {
|
protected val onNewJob = kvRepo.onNewValue.onEach {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
kvCache.set(it.first, it.second)
|
kvCache.set(it.first, it.second)
|
||||||
}
|
}
|
||||||
}.launchIn(scope)
|
}.launchIn(scope)
|
||||||
protected val onRemoveJob = parentRepo.onValueRemoved.onEach {
|
protected val onRemoveJob = kvRepo.onValueRemoved.onEach {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
kvCache.unset(it)
|
kvCache.unset(it)
|
||||||
}
|
}
|
||||||
}.launchIn(scope)
|
}.launchIn(scope)
|
||||||
|
|
||||||
override suspend fun clear() {
|
override suspend fun clear() {
|
||||||
parentRepo.clear()
|
kvRepo.clear()
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
@@ -6,6 +6,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
import dev.inmo.micro_utils.pagination.utils.*
|
import dev.inmo.micro_utils.pagination.utils.*
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
import dev.inmo.micro_utils.repos.cache.cache.KVCache
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
@@ -13,8 +14,8 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class ReadKeyValuesCacheRepo<Key,Value>(
|
open class ReadKeyValuesCacheRepo<Key,Value>(
|
||||||
protected open val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
||||||
protected open val kvCache: KVCache<Key, List<Value>>,
|
protected val kvCache: KVCache<Key, List<Value>>,
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : ReadKeyValuesRepo<Key,Value> by parentRepo, CommonCacheRepo {
|
) : ReadKeyValuesRepo<Key,Value> by parentRepo, CommonCacheRepo {
|
||||||
override suspend fun get(k: Key, pagination: Pagination, reversed: Boolean): PaginationResult<Value> {
|
override suspend fun get(k: Key, pagination: Pagination, reversed: Boolean): PaginationResult<Value> {
|
||||||
@@ -48,6 +49,7 @@ open class ReadKeyValuesCacheRepo<Key,Value>(
|
|||||||
kvCache.contains(k)
|
kvCache.contains(k)
|
||||||
} || parentRepo.contains(k)
|
} || parentRepo.contains(k)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -6,6 +6,7 @@ import dev.inmo.micro_utils.pagination.PaginationResult
|
|||||||
import dev.inmo.micro_utils.repos.KeyValueRepo
|
import dev.inmo.micro_utils.repos.KeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.ReadCRUDRepo
|
import dev.inmo.micro_utils.repos.ReadCRUDRepo
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
@@ -18,7 +19,7 @@ import kotlinx.coroutines.launch
|
|||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
open class AutoRecacheReadCRUDRepo<RegisteredObject, Id>(
|
open class AutoRecacheReadCRUDRepo<RegisteredObject, Id>(
|
||||||
protected open val originalRepo: ReadCRUDRepo<RegisteredObject, Id>,
|
protected val originalRepo: ReadCRUDRepo<RegisteredObject, Id>,
|
||||||
protected val scope: CoroutineScope,
|
protected val scope: CoroutineScope,
|
||||||
protected val kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
protected val kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
||||||
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
||||||
@@ -90,6 +91,7 @@ open class AutoRecacheReadCRUDRepo<RegisteredObject, Id>(
|
|||||||
kvCache.set(idGetter(it), it)
|
kvCache.set(idGetter(it), it)
|
||||||
} ?: kvCache.get(id)
|
} ?: kvCache.get(id)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
|
@@ -2,6 +2,7 @@ package dev.inmo.micro_utils.repos.cache.fallback.crud
|
|||||||
|
|
||||||
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
import kotlinx.coroutines.flow.Flow
|
import kotlinx.coroutines.flow.Flow
|
||||||
@@ -53,6 +54,7 @@ open class AutoRecacheWriteCRUDRepo<RegisteredObject, Id, InputObject>(
|
|||||||
kvCache.set(idGetter(it), it)
|
kvCache.set(idGetter(it), it)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
@@ -8,21 +8,21 @@ import kotlinx.coroutines.CoroutineScope
|
|||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
open class AutoRecacheKeyValueRepo<Id, RegisteredObject>(
|
open class AutoRecacheKeyValueRepo<Id, RegisteredObject>(
|
||||||
override val originalRepo: KeyValueRepo<Id, RegisteredObject>,
|
protected val kvRepo: KeyValueRepo<Id, RegisteredObject>,
|
||||||
scope: CoroutineScope,
|
scope: CoroutineScope,
|
||||||
kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
||||||
recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
||||||
actionWrapper: ActionWrapper = ActionWrapper.Direct,
|
actionWrapper: ActionWrapper = ActionWrapper.Direct,
|
||||||
idGetter: (RegisteredObject) -> Id
|
idGetter: (RegisteredObject) -> Id
|
||||||
) : AutoRecacheReadKeyValueRepo<Id, RegisteredObject> (
|
) : AutoRecacheReadKeyValueRepo<Id, RegisteredObject> (
|
||||||
originalRepo,
|
kvRepo,
|
||||||
scope,
|
scope,
|
||||||
kvCache,
|
kvCache,
|
||||||
recacheDelay,
|
recacheDelay,
|
||||||
actionWrapper,
|
actionWrapper,
|
||||||
idGetter
|
idGetter
|
||||||
),
|
),
|
||||||
WriteKeyValueRepo<Id, RegisteredObject> by AutoRecacheWriteKeyValueRepo(originalRepo, scope, kvCache),
|
WriteKeyValueRepo<Id, RegisteredObject> by AutoRecacheWriteKeyValueRepo(kvRepo, scope, kvCache),
|
||||||
KeyValueRepo<Id, RegisteredObject> {
|
KeyValueRepo<Id, RegisteredObject> {
|
||||||
|
|
||||||
constructor(
|
constructor(
|
||||||
@@ -34,14 +34,14 @@ open class AutoRecacheKeyValueRepo<Id, RegisteredObject>(
|
|||||||
idGetter: (RegisteredObject) -> Id
|
idGetter: (RegisteredObject) -> Id
|
||||||
) : this(originalRepo, scope, kvCache, recacheDelay, ActionWrapper.Timeouted(originalCallTimeoutMillis), idGetter)
|
) : this(originalRepo, scope, kvCache, recacheDelay, ActionWrapper.Timeouted(originalCallTimeoutMillis), idGetter)
|
||||||
|
|
||||||
override suspend fun unsetWithValues(toUnset: List<RegisteredObject>) = originalRepo.unsetWithValues(
|
override suspend fun unsetWithValues(toUnset: List<RegisteredObject>) = kvRepo.unsetWithValues(
|
||||||
toUnset
|
toUnset
|
||||||
).also {
|
).also {
|
||||||
kvCache.unsetWithValues(toUnset)
|
kvCache.unsetWithValues(toUnset)
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun clear() {
|
override suspend fun clear() {
|
||||||
originalRepo.clear()
|
kvRepo.clear()
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -6,6 +6,7 @@ import dev.inmo.micro_utils.pagination.PaginationResult
|
|||||||
import dev.inmo.micro_utils.repos.KeyValueRepo
|
import dev.inmo.micro_utils.repos.KeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.ReadKeyValueRepo
|
import dev.inmo.micro_utils.repos.ReadKeyValueRepo
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
@@ -18,7 +19,7 @@ import kotlinx.coroutines.launch
|
|||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
open class AutoRecacheReadKeyValueRepo<Id, RegisteredObject>(
|
open class AutoRecacheReadKeyValueRepo<Id, RegisteredObject>(
|
||||||
protected open val originalRepo: ReadKeyValueRepo<Id, RegisteredObject>,
|
protected val originalRepo: ReadKeyValueRepo<Id, RegisteredObject>,
|
||||||
protected val scope: CoroutineScope,
|
protected val scope: CoroutineScope,
|
||||||
protected val kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
protected val kvCache: KeyValueRepo<Id, RegisteredObject> = MapKeyValueRepo(),
|
||||||
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
||||||
@@ -100,6 +101,7 @@ open class AutoRecacheReadKeyValueRepo<Id, RegisteredObject>(
|
|||||||
originalRepo.keys(v, pagination, reversed)
|
originalRepo.keys(v, pagination, reversed)
|
||||||
}.getOrElse { kvCache.keys(v, pagination, reversed) }
|
}.getOrElse { kvCache.keys(v, pagination, reversed) }
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
|
@@ -2,6 +2,7 @@ package dev.inmo.micro_utils.repos.cache.fallback.keyvalue
|
|||||||
|
|
||||||
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
import kotlinx.coroutines.flow.Flow
|
import kotlinx.coroutines.flow.Flow
|
||||||
@@ -44,6 +45,7 @@ open class AutoRecacheWriteKeyValueRepo<Id, RegisteredObject>(
|
|||||||
kvCache.set(toSet)
|
kvCache.set(toSet)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
@@ -9,19 +9,19 @@ import kotlinx.coroutines.CoroutineScope
|
|||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
open class AutoRecacheKeyValuesRepo<Id, RegisteredObject>(
|
open class AutoRecacheKeyValuesRepo<Id, RegisteredObject>(
|
||||||
override val originalRepo: KeyValuesRepo<Id, RegisteredObject>,
|
protected val kvsRepo: KeyValuesRepo<Id, RegisteredObject>,
|
||||||
scope: CoroutineScope,
|
scope: CoroutineScope,
|
||||||
kvCache: KeyValueRepo<Id, List<RegisteredObject>> = MapKeyValueRepo(),
|
kvCache: KeyValueRepo<Id, List<RegisteredObject>> = MapKeyValueRepo(),
|
||||||
recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
||||||
actionWrapper: ActionWrapper = ActionWrapper.Direct
|
actionWrapper: ActionWrapper = ActionWrapper.Direct
|
||||||
) : AutoRecacheReadKeyValuesRepo<Id, RegisteredObject> (
|
) : AutoRecacheReadKeyValuesRepo<Id, RegisteredObject> (
|
||||||
originalRepo,
|
kvsRepo,
|
||||||
scope,
|
scope,
|
||||||
kvCache,
|
kvCache,
|
||||||
recacheDelay,
|
recacheDelay,
|
||||||
actionWrapper
|
actionWrapper
|
||||||
),
|
),
|
||||||
WriteKeyValuesRepo<Id, RegisteredObject> by AutoRecacheWriteKeyValuesRepo(originalRepo, scope, kvCache),
|
WriteKeyValuesRepo<Id, RegisteredObject> by AutoRecacheWriteKeyValuesRepo(kvsRepo, scope, kvCache),
|
||||||
KeyValuesRepo<Id, RegisteredObject> {
|
KeyValuesRepo<Id, RegisteredObject> {
|
||||||
|
|
||||||
constructor(
|
constructor(
|
||||||
|
@@ -13,6 +13,7 @@ import dev.inmo.micro_utils.pagination.utils.paginate
|
|||||||
import dev.inmo.micro_utils.repos.KeyValueRepo
|
import dev.inmo.micro_utils.repos.KeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
import dev.inmo.micro_utils.repos.MapKeyValueRepo
|
||||||
import dev.inmo.micro_utils.repos.ReadKeyValuesRepo
|
import dev.inmo.micro_utils.repos.ReadKeyValuesRepo
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
import dev.inmo.micro_utils.repos.cache.fallback.ActionWrapper
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
@@ -24,7 +25,7 @@ import kotlinx.coroutines.launch
|
|||||||
import kotlin.time.Duration.Companion.seconds
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
open class AutoRecacheReadKeyValuesRepo<Id, RegisteredObject>(
|
open class AutoRecacheReadKeyValuesRepo<Id, RegisteredObject>(
|
||||||
protected open val originalRepo: ReadKeyValuesRepo<Id, RegisteredObject>,
|
protected val originalRepo: ReadKeyValuesRepo<Id, RegisteredObject>,
|
||||||
protected val scope: CoroutineScope,
|
protected val scope: CoroutineScope,
|
||||||
protected val kvCache: KeyValueRepo<Id, List<RegisteredObject>> = MapKeyValueRepo(),
|
protected val kvCache: KeyValueRepo<Id, List<RegisteredObject>> = MapKeyValueRepo(),
|
||||||
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
protected val recacheDelay: Long = 60.seconds.inWholeMilliseconds,
|
||||||
@@ -140,6 +141,7 @@ open class AutoRecacheReadKeyValuesRepo<Id, RegisteredObject>(
|
|||||||
}) ?: (kvCache.get(k) ?.contains(v) == true)
|
}) ?: (kvCache.get(k) ?.contains(v) == true)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
|
@@ -3,6 +3,7 @@ package dev.inmo.micro_utils.repos.cache.fallback.keyvalues
|
|||||||
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
import dev.inmo.micro_utils.coroutines.subscribeSafelyWithoutExceptions
|
||||||
import dev.inmo.micro_utils.pagination.utils.doForAllWithNextPaging
|
import dev.inmo.micro_utils.pagination.utils.doForAllWithNextPaging
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
import dev.inmo.micro_utils.repos.cache.FallbackCacheRepo
|
||||||
import dev.inmo.micro_utils.repos.pagination.maxPagePagination
|
import dev.inmo.micro_utils.repos.pagination.maxPagePagination
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
@@ -89,6 +90,7 @@ open class AutoRecacheWriteKeyValuesRepo<Id, RegisteredObject>(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
@@ -8,6 +8,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.Pagination
|
import dev.inmo.micro_utils.pagination.Pagination
|
||||||
import dev.inmo.micro_utils.pagination.PaginationResult
|
import dev.inmo.micro_utils.pagination.PaginationResult
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.*
|
import dev.inmo.micro_utils.repos.cache.*
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
@@ -15,10 +16,10 @@ import kotlinx.coroutines.CoroutineScope
|
|||||||
import kotlinx.coroutines.Dispatchers
|
import kotlinx.coroutines.Dispatchers
|
||||||
|
|
||||||
open class FullReadCRUDCacheRepo<ObjectType, IdType>(
|
open class FullReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
protected open val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
protected val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
||||||
protected open val kvCache: KeyValueRepo<IdType, ObjectType>,
|
protected val kvCache: KeyValueRepo<IdType, ObjectType>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
protected open val idGetter: (ObjectType) -> IdType
|
protected val idGetter: (ObjectType) -> IdType
|
||||||
) : ReadCRUDRepo<ObjectType, IdType>, FullCacheRepo {
|
) : ReadCRUDRepo<ObjectType, IdType>, FullCacheRepo {
|
||||||
protected suspend inline fun <T> doOrTakeAndActualize(
|
protected suspend inline fun <T> doOrTakeAndActualize(
|
||||||
action: KeyValueRepo<IdType, ObjectType>.() -> Optional<T>,
|
action: KeyValueRepo<IdType, ObjectType>.() -> Optional<T>,
|
||||||
@@ -94,20 +95,20 @@ fun <ObjectType, IdType> ReadCRUDRepo<ObjectType, IdType>.cached(
|
|||||||
) = FullReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
) = FullReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
||||||
|
|
||||||
open class FullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
open class FullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
||||||
override val parentRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
protected val crudRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
||||||
override val kvCache: KeyValueRepo<IdType, ObjectType>,
|
kvCache: KeyValueRepo<IdType, ObjectType>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
override val idGetter: (ObjectType) -> IdType
|
idGetter: (ObjectType) -> IdType
|
||||||
) : FullReadCRUDCacheRepo<ObjectType, IdType>(
|
) : FullReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
locker,
|
locker,
|
||||||
idGetter
|
idGetter
|
||||||
),
|
),
|
||||||
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
scope,
|
scope,
|
||||||
locker,
|
locker,
|
||||||
@@ -128,11 +129,12 @@ open class FullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
|||||||
|
|
||||||
protected open suspend fun initialInvalidate() {
|
protected open suspend fun initialInvalidate() {
|
||||||
try {
|
try {
|
||||||
kvCache.actualizeAll(parentRepo, locker = null)
|
kvCache.actualizeAll(crudRepo, locker = null)
|
||||||
} finally {
|
} finally {
|
||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
|
@@ -8,6 +8,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.Pagination
|
import dev.inmo.micro_utils.pagination.Pagination
|
||||||
import dev.inmo.micro_utils.pagination.PaginationResult
|
import dev.inmo.micro_utils.pagination.PaginationResult
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
@@ -15,9 +16,9 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class FullReadKeyValueCacheRepo<Key,Value>(
|
open class FullReadKeyValueCacheRepo<Key,Value>(
|
||||||
protected open val parentRepo: ReadKeyValueRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValueRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, Value>,
|
protected val kvCache: KeyValueRepo<Key, Value>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker()
|
protected val locker: SmartRWLocker = SmartRWLocker()
|
||||||
) : ReadKeyValueRepo<Key, Value>, FullCacheRepo {
|
) : ReadKeyValueRepo<Key, Value>, FullCacheRepo {
|
||||||
protected suspend inline fun <T> doOrTakeAndActualize(
|
protected suspend inline fun <T> doOrTakeAndActualize(
|
||||||
action: KeyValueRepo<Key, Value>.() -> Optional<T>,
|
action: KeyValueRepo<Key, Value>.() -> Optional<T>,
|
||||||
@@ -86,6 +87,7 @@ open class FullReadKeyValueCacheRepo<Key,Value>(
|
|||||||
{ if (it.results.isNotEmpty()) actualizeAll() }
|
{ if (it.results.isNotEmpty()) actualizeAll() }
|
||||||
)
|
)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
@@ -98,7 +100,7 @@ fun <Key, Value> ReadKeyValueRepo<Key, Value>.cached(
|
|||||||
|
|
||||||
open class FullWriteKeyValueCacheRepo<Key,Value>(
|
open class FullWriteKeyValueCacheRepo<Key,Value>(
|
||||||
parentRepo: WriteKeyValueRepo<Key, Value>,
|
parentRepo: WriteKeyValueRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, Value>,
|
protected val kvCache: KeyValueRepo<Key, Value>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker()
|
protected val locker: SmartRWLocker = SmartRWLocker()
|
||||||
) : WriteKeyValueRepo<Key, Value> by parentRepo, FullCacheRepo {
|
) : WriteKeyValueRepo<Key, Value> by parentRepo, FullCacheRepo {
|
||||||
@@ -126,16 +128,16 @@ fun <Key, Value> WriteKeyValueRepo<Key, Value>.caching(
|
|||||||
) = FullWriteKeyValueCacheRepo(this, kvCache, scope)
|
) = FullWriteKeyValueCacheRepo(this, kvCache, scope)
|
||||||
|
|
||||||
open class FullKeyValueCacheRepo<Key,Value>(
|
open class FullKeyValueCacheRepo<Key,Value>(
|
||||||
override val parentRepo: KeyValueRepo<Key, Value>,
|
protected val kvRepo: KeyValueRepo<Key, Value>,
|
||||||
override val kvCache: KeyValueRepo<Key, Value>,
|
kvCache: KeyValueRepo<Key, Value>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
) : //FullWriteKeyValueCacheRepo<Key,Value>(parentRepo, kvCache, scope),
|
) : //FullWriteKeyValueCacheRepo<Key,Value>(parentRepo, kvCache, scope),
|
||||||
KeyValueRepo<Key,Value>,
|
KeyValueRepo<Key,Value>,
|
||||||
WriteKeyValueRepo<Key,Value> by parentRepo,
|
WriteKeyValueRepo<Key,Value> by kvRepo,
|
||||||
FullReadKeyValueCacheRepo<Key, Value>(
|
FullReadKeyValueCacheRepo<Key, Value>(
|
||||||
parentRepo,
|
kvRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
locker
|
locker
|
||||||
) {
|
) {
|
||||||
@@ -151,7 +153,7 @@ open class FullKeyValueCacheRepo<Key,Value>(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun unsetWithValues(toUnset: List<Value>) = parentRepo.unsetWithValues(toUnset)
|
override suspend fun unsetWithValues(toUnset: List<Value>) = kvRepo.unsetWithValues(toUnset)
|
||||||
|
|
||||||
protected open suspend fun initialInvalidate() {
|
protected open suspend fun initialInvalidate() {
|
||||||
try {
|
try {
|
||||||
@@ -160,18 +162,19 @@ open class FullKeyValueCacheRepo<Key,Value>(
|
|||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.actualizeAll(parentRepo, locker)
|
kvCache.actualizeAll(parentRepo, locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun clear() {
|
override suspend fun clear() {
|
||||||
parentRepo.clear()
|
kvRepo.clear()
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun set(toSet: Map<Key, Value>) {
|
override suspend fun set(toSet: Map<Key, Value>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.set(toSet)
|
kvRepo.set(toSet)
|
||||||
kvCache.set(
|
kvCache.set(
|
||||||
toSet.filter {
|
toSet.filter {
|
||||||
parentRepo.contains(it.key)
|
parentRepo.contains(it.key)
|
||||||
@@ -182,7 +185,7 @@ open class FullKeyValueCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun unset(toUnset: List<Key>) {
|
override suspend fun unset(toUnset: List<Key>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.unset(toUnset)
|
kvRepo.unset(toUnset)
|
||||||
kvCache.unset(
|
kvCache.unset(
|
||||||
toUnset.filter {
|
toUnset.filter {
|
||||||
!parentRepo.contains(it)
|
!parentRepo.contains(it)
|
||||||
|
@@ -8,6 +8,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
import dev.inmo.micro_utils.pagination.utils.*
|
import dev.inmo.micro_utils.pagination.utils.*
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import dev.inmo.micro_utils.repos.pagination.maxPagePagination
|
import dev.inmo.micro_utils.repos.pagination.maxPagePagination
|
||||||
@@ -16,9 +17,9 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class FullReadKeyValuesCacheRepo<Key,Value>(
|
open class FullReadKeyValuesCacheRepo<Key,Value>(
|
||||||
protected open val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, List<Value>>,
|
protected val kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : ReadKeyValuesRepo<Key, Value>, FullCacheRepo {
|
) : ReadKeyValuesRepo<Key, Value>, FullCacheRepo {
|
||||||
protected suspend inline fun <T> doOrTakeAndActualize(
|
protected suspend inline fun <T> doOrTakeAndActualize(
|
||||||
action: KeyValueRepo<Key, List<Value>>.() -> Optional<T>,
|
action: KeyValueRepo<Key, List<Value>>.() -> Optional<T>,
|
||||||
@@ -153,6 +154,7 @@ open class FullReadKeyValuesCacheRepo<Key,Value>(
|
|||||||
{ if (it.results.isNotEmpty()) actualizeAll() }
|
{ if (it.results.isNotEmpty()) actualizeAll() }
|
||||||
)
|
)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
@@ -165,7 +167,7 @@ fun <Key, Value> ReadKeyValuesRepo<Key, Value>.cached(
|
|||||||
|
|
||||||
open class FullWriteKeyValuesCacheRepo<Key,Value>(
|
open class FullWriteKeyValuesCacheRepo<Key,Value>(
|
||||||
parentRepo: WriteKeyValuesRepo<Key, Value>,
|
parentRepo: WriteKeyValuesRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, List<Value>>,
|
protected val kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : WriteKeyValuesRepo<Key, Value> by parentRepo, FullCacheRepo {
|
) : WriteKeyValuesRepo<Key, Value> by parentRepo, FullCacheRepo {
|
||||||
@@ -200,14 +202,14 @@ fun <Key, Value> WriteKeyValuesRepo<Key, Value>.caching(
|
|||||||
) = FullWriteKeyValuesCacheRepo(this, kvCache, scope, locker)
|
) = FullWriteKeyValuesCacheRepo(this, kvCache, scope, locker)
|
||||||
|
|
||||||
open class FullKeyValuesCacheRepo<Key,Value>(
|
open class FullKeyValuesCacheRepo<Key,Value>(
|
||||||
override val parentRepo: KeyValuesRepo<Key, Value>,
|
protected val kvsRepo: KeyValuesRepo<Key, Value>,
|
||||||
override val kvCache: KeyValueRepo<Key, List<Value>>,
|
kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
) : KeyValuesRepo<Key, Value>,
|
) : KeyValuesRepo<Key, Value>,
|
||||||
FullReadKeyValuesCacheRepo<Key, Value>(parentRepo, kvCache, locker),
|
FullReadKeyValuesCacheRepo<Key, Value>(kvsRepo, kvCache, locker),
|
||||||
WriteKeyValuesRepo<Key, Value> by parentRepo {
|
WriteKeyValuesRepo<Key, Value> by kvsRepo {
|
||||||
init {
|
init {
|
||||||
if (!skipStartInvalidate) {
|
if (!skipStartInvalidate) {
|
||||||
scope.launchLoggingDropExceptions {
|
scope.launchLoggingDropExceptions {
|
||||||
@@ -235,13 +237,14 @@ open class FullKeyValuesCacheRepo<Key,Value>(
|
|||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.actualizeAll(parentRepo, locker = locker)
|
kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun set(toSet: Map<Key, List<Value>>) {
|
override suspend fun set(toSet: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.set(toSet)
|
kvsRepo.set(toSet)
|
||||||
kvCache.set(
|
kvCache.set(
|
||||||
toSet.filter {
|
toSet.filter {
|
||||||
parentRepo.contains(it.key)
|
parentRepo.contains(it.key)
|
||||||
@@ -252,7 +255,7 @@ open class FullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun add(toAdd: Map<Key, List<Value>>) {
|
override suspend fun add(toAdd: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.add(toAdd)
|
kvsRepo.add(toAdd)
|
||||||
toAdd.forEach {
|
toAdd.forEach {
|
||||||
val filtered = it.value.filter { v ->
|
val filtered = it.value.filter { v ->
|
||||||
parentRepo.contains(it.key, v)
|
parentRepo.contains(it.key, v)
|
||||||
@@ -269,7 +272,7 @@ open class FullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun remove(toRemove: Map<Key, List<Value>>) {
|
override suspend fun remove(toRemove: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.remove(toRemove)
|
kvsRepo.remove(toRemove)
|
||||||
toRemove.forEach {
|
toRemove.forEach {
|
||||||
val filtered = it.value.filter { v ->
|
val filtered = it.value.filter { v ->
|
||||||
!parentRepo.contains(it.key, v)
|
!parentRepo.contains(it.key, v)
|
||||||
@@ -291,7 +294,7 @@ open class FullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun clear(k: Key) {
|
override suspend fun clear(k: Key) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.clear(k)
|
kvsRepo.clear(k)
|
||||||
if (parentRepo.contains(k)) {
|
if (parentRepo.contains(k)) {
|
||||||
return@withWriteLock
|
return@withWriteLock
|
||||||
}
|
}
|
||||||
|
@@ -1,24 +1,23 @@
|
|||||||
package dev.inmo.micro_utils.repos.cache.full.direct
|
package dev.inmo.micro_utils.repos.cache.full.direct
|
||||||
|
|
||||||
import dev.inmo.micro_utils.common.*
|
import dev.inmo.micro_utils.common.Warning
|
||||||
import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
import dev.inmo.micro_utils.coroutines.SmartRWLocker
|
||||||
import dev.inmo.micro_utils.coroutines.launchLoggingDropExceptions
|
import dev.inmo.micro_utils.coroutines.launchLoggingDropExceptions
|
||||||
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
import dev.inmo.micro_utils.coroutines.withReadAcquire
|
||||||
import dev.inmo.micro_utils.coroutines.withWriteLock
|
|
||||||
import dev.inmo.micro_utils.pagination.Pagination
|
import dev.inmo.micro_utils.pagination.Pagination
|
||||||
import dev.inmo.micro_utils.pagination.PaginationResult
|
import dev.inmo.micro_utils.pagination.PaginationResult
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.*
|
import dev.inmo.micro_utils.repos.cache.*
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
import kotlinx.coroutines.Dispatchers
|
import kotlinx.coroutines.Dispatchers
|
||||||
|
|
||||||
open class DirectFullReadCRUDCacheRepo<ObjectType, IdType>(
|
open class DirectFullReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
protected open val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
protected val parentRepo: ReadCRUDRepo<ObjectType, IdType>,
|
||||||
protected open val kvCache: KeyValueRepo<IdType, ObjectType>,
|
protected val kvCache: KeyValueRepo<IdType, ObjectType>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
protected open val idGetter: (ObjectType) -> IdType
|
protected val idGetter: (ObjectType) -> IdType
|
||||||
) : ReadCRUDRepo<ObjectType, IdType>, DirectFullCacheRepo {
|
) : ReadCRUDRepo<ObjectType, IdType>, DirectFullCacheRepo {
|
||||||
protected open suspend fun actualizeAll() {
|
protected open suspend fun actualizeAll() {
|
||||||
kvCache.actualizeAll(parentRepo, locker = locker)
|
kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
@@ -60,20 +59,20 @@ fun <ObjectType, IdType> ReadCRUDRepo<ObjectType, IdType>.directlyCached(
|
|||||||
) = DirectFullReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
) = DirectFullReadCRUDCacheRepo(this, kvCache, locker, idGetter)
|
||||||
|
|
||||||
open class DirectFullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
open class DirectFullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
||||||
override val parentRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
protected val crudRepo: CRUDRepo<ObjectType, IdType, InputValueType>,
|
||||||
override val kvCache: KeyValueRepo<IdType, ObjectType>,
|
kvCache: KeyValueRepo<IdType, ObjectType>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
idGetter: (ObjectType) -> IdType
|
idGetter: (ObjectType) -> IdType
|
||||||
) : DirectFullReadCRUDCacheRepo<ObjectType, IdType>(
|
) : DirectFullReadCRUDCacheRepo<ObjectType, IdType>(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
locker,
|
locker,
|
||||||
idGetter
|
idGetter
|
||||||
),
|
),
|
||||||
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
WriteCRUDRepo<ObjectType, IdType, InputValueType> by WriteCRUDCacheRepo(
|
||||||
parentRepo,
|
crudRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
scope,
|
scope,
|
||||||
locker,
|
locker,
|
||||||
@@ -99,6 +98,8 @@ open class DirectFullCRUDCacheRepo<ObjectType, IdType, InputValueType>(
|
|||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
|
@@ -7,6 +7,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.Pagination
|
import dev.inmo.micro_utils.pagination.Pagination
|
||||||
import dev.inmo.micro_utils.pagination.PaginationResult
|
import dev.inmo.micro_utils.pagination.PaginationResult
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.full.FullKeyValueCacheRepo
|
import dev.inmo.micro_utils.repos.cache.full.FullKeyValueCacheRepo
|
||||||
import dev.inmo.micro_utils.repos.cache.full.FullReadKeyValueCacheRepo
|
import dev.inmo.micro_utils.repos.cache.full.FullReadKeyValueCacheRepo
|
||||||
import dev.inmo.micro_utils.repos.cache.full.FullWriteKeyValueCacheRepo
|
import dev.inmo.micro_utils.repos.cache.full.FullWriteKeyValueCacheRepo
|
||||||
@@ -18,9 +19,9 @@ import kotlinx.coroutines.flow.launchIn
|
|||||||
import kotlinx.coroutines.flow.onEach
|
import kotlinx.coroutines.flow.onEach
|
||||||
|
|
||||||
open class DirectFullReadKeyValueCacheRepo<Key, Value>(
|
open class DirectFullReadKeyValueCacheRepo<Key, Value>(
|
||||||
protected open val parentRepo: ReadKeyValueRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValueRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, Value>,
|
protected val kvCache: KeyValueRepo<Key, Value>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker()
|
protected val locker: SmartRWLocker = SmartRWLocker()
|
||||||
) : DirectFullCacheRepo, ReadKeyValueRepo<Key, Value> {
|
) : DirectFullCacheRepo, ReadKeyValueRepo<Key, Value> {
|
||||||
protected open suspend fun actualizeAll() {
|
protected open suspend fun actualizeAll() {
|
||||||
kvCache.actualizeAll(parentRepo, locker)
|
kvCache.actualizeAll(parentRepo, locker)
|
||||||
@@ -54,6 +55,7 @@ open class DirectFullReadKeyValueCacheRepo<Key, Value>(
|
|||||||
kvCache.keys(v, pagination, reversed)
|
kvCache.keys(v, pagination, reversed)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
@@ -65,8 +67,8 @@ fun <Key, Value> ReadKeyValueRepo<Key, Value>.directlyCached(
|
|||||||
) = DirectFullReadKeyValueCacheRepo(this, kvCache, locker)
|
) = DirectFullReadKeyValueCacheRepo(this, kvCache, locker)
|
||||||
|
|
||||||
open class DirectFullWriteKeyValueCacheRepo<Key, Value>(
|
open class DirectFullWriteKeyValueCacheRepo<Key, Value>(
|
||||||
protected open val parentRepo: WriteKeyValueRepo<Key, Value>,
|
protected val parentRepo: WriteKeyValueRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, Value>,
|
protected val kvCache: KeyValueRepo<Key, Value>,
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
) : DirectFullCacheRepo, WriteKeyValueRepo<Key, Value> by parentRepo {
|
) : DirectFullCacheRepo, WriteKeyValueRepo<Key, Value> by parentRepo {
|
||||||
@@ -86,6 +88,7 @@ open class DirectFullWriteKeyValueCacheRepo<Key, Value>(
|
|||||||
}
|
}
|
||||||
}.launchIn(scope)
|
}.launchIn(scope)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
@@ -101,20 +104,20 @@ fun <Key, Value> WriteKeyValueRepo<Key, Value>.directlyCached(
|
|||||||
) = DirectFullWriteKeyValueCacheRepo(this, kvCache, scope = scope)
|
) = DirectFullWriteKeyValueCacheRepo(this, kvCache, scope = scope)
|
||||||
|
|
||||||
open class DirectFullKeyValueCacheRepo<Key, Value>(
|
open class DirectFullKeyValueCacheRepo<Key, Value>(
|
||||||
override val parentRepo: KeyValueRepo<Key, Value>,
|
protected val kvRepo: KeyValueRepo<Key, Value>,
|
||||||
override val kvCache: KeyValueRepo<Key, Value>,
|
kvCache: KeyValueRepo<Key, Value>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
) : DirectFullCacheRepo,
|
) : DirectFullCacheRepo,
|
||||||
KeyValueRepo<Key, Value> ,
|
KeyValueRepo<Key, Value> ,
|
||||||
WriteKeyValueRepo<Key, Value> by DirectFullWriteKeyValueCacheRepo(
|
WriteKeyValueRepo<Key, Value> by DirectFullWriteKeyValueCacheRepo(
|
||||||
parentRepo,
|
kvRepo,
|
||||||
kvCache,
|
kvCache,
|
||||||
locker,
|
locker,
|
||||||
scope
|
scope
|
||||||
),
|
),
|
||||||
DirectFullReadKeyValueCacheRepo<Key, Value>(parentRepo, kvCache, locker) {
|
DirectFullReadKeyValueCacheRepo<Key, Value>(kvRepo, kvCache, locker) {
|
||||||
init {
|
init {
|
||||||
if (!skipStartInvalidate) {
|
if (!skipStartInvalidate) {
|
||||||
scope.launchLoggingDropExceptions {
|
scope.launchLoggingDropExceptions {
|
||||||
@@ -135,20 +138,21 @@ open class DirectFullKeyValueCacheRepo<Key, Value>(
|
|||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.actualizeAll(parentRepo, locker)
|
kvCache.actualizeAll(parentRepo, locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun clear() {
|
override suspend fun clear() {
|
||||||
parentRepo.clear()
|
kvRepo.clear()
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun unsetWithValues(toUnset: List<Value>) = parentRepo.unsetWithValues(toUnset)
|
override suspend fun unsetWithValues(toUnset: List<Value>) = kvRepo.unsetWithValues(toUnset)
|
||||||
|
|
||||||
override suspend fun set(toSet: Map<Key, Value>) {
|
override suspend fun set(toSet: Map<Key, Value>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.set(toSet)
|
kvRepo.set(toSet)
|
||||||
kvCache.set(
|
kvCache.set(
|
||||||
toSet.filter {
|
toSet.filter {
|
||||||
parentRepo.contains(it.key)
|
parentRepo.contains(it.key)
|
||||||
@@ -159,7 +163,7 @@ open class DirectFullKeyValueCacheRepo<Key, Value>(
|
|||||||
|
|
||||||
override suspend fun unset(toUnset: List<Key>) {
|
override suspend fun unset(toUnset: List<Key>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.unset(toUnset)
|
kvRepo.unset(toUnset)
|
||||||
kvCache.unset(
|
kvCache.unset(
|
||||||
toUnset.filter {
|
toUnset.filter {
|
||||||
!parentRepo.contains(it)
|
!parentRepo.contains(it)
|
||||||
|
@@ -8,6 +8,7 @@ import dev.inmo.micro_utils.coroutines.withWriteLock
|
|||||||
import dev.inmo.micro_utils.pagination.*
|
import dev.inmo.micro_utils.pagination.*
|
||||||
import dev.inmo.micro_utils.pagination.utils.*
|
import dev.inmo.micro_utils.pagination.utils.*
|
||||||
import dev.inmo.micro_utils.repos.*
|
import dev.inmo.micro_utils.repos.*
|
||||||
|
import dev.inmo.micro_utils.repos.annotations.OverrideRequireManualInvalidation
|
||||||
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
import dev.inmo.micro_utils.repos.cache.util.ActualizeAllClearMode
|
||||||
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
import dev.inmo.micro_utils.repos.cache.util.actualizeAll
|
||||||
import kotlinx.coroutines.CoroutineScope
|
import kotlinx.coroutines.CoroutineScope
|
||||||
@@ -15,9 +16,9 @@ import kotlinx.coroutines.Dispatchers
|
|||||||
import kotlinx.coroutines.flow.*
|
import kotlinx.coroutines.flow.*
|
||||||
|
|
||||||
open class DirectFullReadKeyValuesCacheRepo<Key,Value>(
|
open class DirectFullReadKeyValuesCacheRepo<Key,Value>(
|
||||||
protected open val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
protected val parentRepo: ReadKeyValuesRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, List<Value>>,
|
protected val kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
protected open val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : ReadKeyValuesRepo<Key, Value>, DirectFullCacheRepo {
|
) : ReadKeyValuesRepo<Key, Value>, DirectFullCacheRepo {
|
||||||
protected open suspend fun actualizeKey(k: Key) {
|
protected open suspend fun actualizeKey(k: Key) {
|
||||||
kvCache.actualizeAll(locker = locker, clearMode = ActualizeAllClearMode.Never) {
|
kvCache.actualizeAll(locker = locker, clearMode = ActualizeAllClearMode.Never) {
|
||||||
@@ -88,6 +89,7 @@ open class DirectFullReadKeyValuesCacheRepo<Key,Value>(
|
|||||||
return result ?: emptyPaginationResult()
|
return result ?: emptyPaginationResult()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
actualizeAll()
|
actualizeAll()
|
||||||
}
|
}
|
||||||
@@ -100,7 +102,7 @@ fun <Key, Value> ReadKeyValuesRepo<Key, Value>.directlyCached(
|
|||||||
|
|
||||||
open class DirectFullWriteKeyValuesCacheRepo<Key,Value>(
|
open class DirectFullWriteKeyValuesCacheRepo<Key,Value>(
|
||||||
parentRepo: WriteKeyValuesRepo<Key, Value>,
|
parentRepo: WriteKeyValuesRepo<Key, Value>,
|
||||||
protected open val kvCache: KeyValueRepo<Key, List<Value>>,
|
protected val kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
protected val locker: SmartRWLocker = SmartRWLocker(),
|
protected val locker: SmartRWLocker = SmartRWLocker(),
|
||||||
) : WriteKeyValuesRepo<Key, Value> by parentRepo, DirectFullCacheRepo {
|
) : WriteKeyValuesRepo<Key, Value> by parentRepo, DirectFullCacheRepo {
|
||||||
@@ -121,6 +123,7 @@ open class DirectFullWriteKeyValuesCacheRepo<Key,Value>(
|
|||||||
}
|
}
|
||||||
}.launchIn(scope)
|
}.launchIn(scope)
|
||||||
|
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
kvCache.clear()
|
kvCache.clear()
|
||||||
@@ -135,14 +138,14 @@ fun <Key, Value> WriteKeyValuesRepo<Key, Value>.directlyCached(
|
|||||||
) = DirectFullWriteKeyValuesCacheRepo(this, kvCache, scope, locker)
|
) = DirectFullWriteKeyValuesCacheRepo(this, kvCache, scope, locker)
|
||||||
|
|
||||||
open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
||||||
override val parentRepo: KeyValuesRepo<Key, Value>,
|
protected val kvsRepo: KeyValuesRepo<Key, Value>,
|
||||||
override val kvCache: KeyValueRepo<Key, List<Value>>,
|
kvCache: KeyValueRepo<Key, List<Value>>,
|
||||||
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
scope: CoroutineScope = CoroutineScope(Dispatchers.Default),
|
||||||
skipStartInvalidate: Boolean = false,
|
skipStartInvalidate: Boolean = false,
|
||||||
override val locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
locker: SmartRWLocker = SmartRWLocker(writeIsLocked = !skipStartInvalidate),
|
||||||
) : KeyValuesRepo<Key, Value>,
|
) : KeyValuesRepo<Key, Value>,
|
||||||
DirectFullReadKeyValuesCacheRepo<Key, Value>(parentRepo, kvCache, locker),
|
DirectFullReadKeyValuesCacheRepo<Key, Value>(kvsRepo, kvCache, locker),
|
||||||
WriteKeyValuesRepo<Key, Value> by parentRepo {
|
WriteKeyValuesRepo<Key, Value> by kvsRepo {
|
||||||
init {
|
init {
|
||||||
if (!skipStartInvalidate) {
|
if (!skipStartInvalidate) {
|
||||||
scope.launchLoggingDropExceptions {
|
scope.launchLoggingDropExceptions {
|
||||||
@@ -170,13 +173,14 @@ open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
|||||||
locker.unlockWrite()
|
locker.unlockWrite()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@OverrideRequireManualInvalidation
|
||||||
override suspend fun invalidate() {
|
override suspend fun invalidate() {
|
||||||
kvCache.actualizeAll(parentRepo, locker = locker)
|
kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
override suspend fun set(toSet: Map<Key, List<Value>>) {
|
override suspend fun set(toSet: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.set(toSet)
|
kvsRepo.set(toSet)
|
||||||
kvCache.set(
|
kvCache.set(
|
||||||
toSet.filter {
|
toSet.filter {
|
||||||
parentRepo.contains(it.key)
|
parentRepo.contains(it.key)
|
||||||
@@ -187,7 +191,7 @@ open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun add(toAdd: Map<Key, List<Value>>) {
|
override suspend fun add(toAdd: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.add(toAdd)
|
kvsRepo.add(toAdd)
|
||||||
toAdd.forEach {
|
toAdd.forEach {
|
||||||
val filtered = it.value.filter { v ->
|
val filtered = it.value.filter { v ->
|
||||||
parentRepo.contains(it.key, v)
|
parentRepo.contains(it.key, v)
|
||||||
@@ -204,7 +208,7 @@ open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun remove(toRemove: Map<Key, List<Value>>) {
|
override suspend fun remove(toRemove: Map<Key, List<Value>>) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.remove(toRemove)
|
kvsRepo.remove(toRemove)
|
||||||
toRemove.forEach {
|
toRemove.forEach {
|
||||||
val filtered = it.value.filter { v ->
|
val filtered = it.value.filter { v ->
|
||||||
!parentRepo.contains(it.key, v)
|
!parentRepo.contains(it.key, v)
|
||||||
@@ -226,7 +230,7 @@ open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
override suspend fun clear(k: Key) {
|
override suspend fun clear(k: Key) {
|
||||||
locker.withWriteLock {
|
locker.withWriteLock {
|
||||||
parentRepo.clear(k)
|
kvsRepo.clear(k)
|
||||||
if (parentRepo.contains(k)) {
|
if (parentRepo.contains(k)) {
|
||||||
return@withWriteLock
|
return@withWriteLock
|
||||||
}
|
}
|
||||||
|
54
repos/cache/src/jvmMain/kotlin/InvalidateSynchronously.kt
vendored
Normal file
54
repos/cache/src/jvmMain/kotlin/InvalidateSynchronously.kt
vendored
Normal file
@@ -0,0 +1,54 @@
|
|||||||
|
package dev.inmo.micro_utils.repos.cache
|
||||||
|
|
||||||
|
import dev.inmo.kslog.common.KSLog
|
||||||
|
import dev.inmo.micro_utils.coroutines.doSynchronously
|
||||||
|
import dev.inmo.micro_utils.coroutines.runCatchingLogging
|
||||||
|
import kotlinx.coroutines.CoroutineScope
|
||||||
|
|
||||||
|
fun <T : InvalidatableRepo> T.alsoInvalidateSync(
|
||||||
|
scope: CoroutineScope,
|
||||||
|
onFailure: suspend (Throwable) -> Unit = {},
|
||||||
|
) = also {
|
||||||
|
scope.doSynchronously {
|
||||||
|
runCatching {
|
||||||
|
invalidate()
|
||||||
|
}.onFailure {
|
||||||
|
onFailure(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fun <T : InvalidatableRepo> T.alsoInvalidateSync(
|
||||||
|
onFailure: suspend (Throwable) -> Unit = {},
|
||||||
|
) = also {
|
||||||
|
doSynchronously {
|
||||||
|
runCatching {
|
||||||
|
invalidate()
|
||||||
|
}.onFailure {
|
||||||
|
onFailure(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fun <T : InvalidatableRepo> T.alsoInvalidateSyncLogging(
|
||||||
|
scope: CoroutineScope,
|
||||||
|
errorMessageBuilder: CoroutineScope.(Throwable) -> Any = { "Something web wrong" },
|
||||||
|
logger: KSLog = KSLog,
|
||||||
|
) = also {
|
||||||
|
scope.doSynchronously {
|
||||||
|
runCatchingLogging(errorMessageBuilder, logger) {
|
||||||
|
invalidate()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fun <T : InvalidatableRepo> T.alsoInvalidateSyncLogging(
|
||||||
|
errorMessageBuilder: CoroutineScope.(Throwable) -> Any = { "Something web wrong" },
|
||||||
|
logger: KSLog = KSLog,
|
||||||
|
) = also {
|
||||||
|
doSynchronously {
|
||||||
|
runCatchingLogging(errorMessageBuilder, logger) {
|
||||||
|
invalidate()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
@@ -73,7 +73,7 @@ class KtorCRUDRepoTests : CommonCRUDRepoTests() {
|
|||||||
}
|
}
|
||||||
val server = io.ktor.server.engine.embeddedServer(
|
val server = io.ktor.server.engine.embeddedServer(
|
||||||
CIO,
|
CIO,
|
||||||
34567,
|
34568,
|
||||||
"127.0.0.1"
|
"127.0.0.1"
|
||||||
) {
|
) {
|
||||||
install(ContentNegotiation) {
|
install(ContentNegotiation) {
|
||||||
@@ -100,7 +100,7 @@ class KtorCRUDRepoTests : CommonCRUDRepoTests() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
val crudClient = KtorCRUDRepoClient<ComplexData, Int, SimpleData>(
|
val crudClient = KtorCRUDRepoClient<ComplexData, Int, SimpleData>(
|
||||||
"http://127.0.0.1:34567",
|
"http://127.0.0.1:34568",
|
||||||
client,
|
client,
|
||||||
ContentType.Application.Json
|
ContentType.Application.Json
|
||||||
) {
|
) {
|
||||||
|
@@ -63,7 +63,7 @@ class KtorKeyValueRepoTests : CommonKeyValueRepoTests() {
|
|||||||
val repo = MapKeyValueRepo<Int, ComplexData>(map)
|
val repo = MapKeyValueRepo<Int, ComplexData>(map)
|
||||||
val server = io.ktor.server.engine.embeddedServer(
|
val server = io.ktor.server.engine.embeddedServer(
|
||||||
CIO,
|
CIO,
|
||||||
34567,
|
34569,
|
||||||
"127.0.0.1"
|
"127.0.0.1"
|
||||||
) {
|
) {
|
||||||
install(ContentNegotiation) {
|
install(ContentNegotiation) {
|
||||||
@@ -91,7 +91,7 @@ class KtorKeyValueRepoTests : CommonKeyValueRepoTests() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
val crudClient = KtorKeyValueRepoClient<Int, ComplexData>(
|
val crudClient = KtorKeyValueRepoClient<Int, ComplexData>(
|
||||||
"http://127.0.0.1:34567",
|
"http://127.0.0.1:34569",
|
||||||
client,
|
client,
|
||||||
ContentType.Application.Json,
|
ContentType.Application.Json,
|
||||||
Int.serializer(),
|
Int.serializer(),
|
||||||
|
Reference in New Issue
Block a user