mirror of
https://github.com/InsanusMokrassar/MicroUtils.git
synced 2025-09-17 14:29:24 +00:00
Compare commits
31 Commits
Author | SHA1 | Date | |
---|---|---|---|
9c94348a15 | |||
bac256e93e | |||
49f59aa129 | |||
800dab5be0 | |||
b9977527b2 | |||
c216dba69d | |||
d4148d52e3 | |||
2006a8cdd0 | |||
feb52ecbd1 | |||
42909c3b7a | |||
706a787163 | |||
1bc14bded6 | |||
f00cb81db1 | |||
2fbd14956d | |||
24657b43be | |||
659d3b6fa5 | |||
339483c8a3 | |||
51ec46bbd7 | |||
8a059cc26d | |||
ddb8e1efb4 | |||
3bf2ed5168 | |||
e70d34d91a | |||
7a650f5c2f | |||
fc6f5ae2ee | |||
3b7dde3cb1 | |||
0a5cfaba18 | |||
ea527b5e91 | |||
85f11439e8 | |||
98c7b48625 | |||
8b007bb3af | |||
89e2d88d1c |
29
CHANGELOG.md
29
CHANGELOG.md
@@ -1,5 +1,34 @@
|
|||||||
# Changelog
|
# Changelog
|
||||||
|
|
||||||
|
## 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
|
||||||
|
|
||||||
|
* `Versions`:
|
||||||
|
* `Ktor`: `3.1.0` -> `3.1.1`
|
||||||
|
* `KSP`: `2.1.10-1.0.30` -> `2.1.10-1.0.31`
|
||||||
|
* `Common`:
|
||||||
|
* `Compose`:
|
||||||
|
* Add component `LoadableComponent`
|
||||||
|
* `Coroutines`:
|
||||||
|
* Add `SortedBinaryTreeNode`
|
||||||
|
* `Pagination`:
|
||||||
|
* `Compose`:
|
||||||
|
* Add components `PagedComponent` and `InfinityPagedComponent`
|
||||||
|
|
||||||
## 0.24.7
|
## 0.24.7
|
||||||
|
|
||||||
* `Versions`:
|
* `Versions`:
|
||||||
|
@@ -13,6 +13,7 @@ kotlin {
|
|||||||
commonMain {
|
commonMain {
|
||||||
dependencies {
|
dependencies {
|
||||||
api project(":micro_utils.common")
|
api project(":micro_utils.common")
|
||||||
|
api libs.kt.coroutines
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -0,0 +1,74 @@
|
|||||||
|
package dev.inmo.micro_utils.common.compose
|
||||||
|
|
||||||
|
import androidx.compose.runtime.*
|
||||||
|
import dev.inmo.micro_utils.common.Optional
|
||||||
|
import dev.inmo.micro_utils.common.dataOrThrow
|
||||||
|
import dev.inmo.micro_utils.common.optional
|
||||||
|
|
||||||
|
class LoadableComponentContext<T> internal constructor(
|
||||||
|
presetOptional: Optional<T>,
|
||||||
|
) {
|
||||||
|
internal val iterationState: MutableState<Int> = mutableStateOf(0)
|
||||||
|
|
||||||
|
internal var dataOptional: Optional<T> = if (presetOptional.dataPresented) presetOptional else Optional.absent()
|
||||||
|
private set
|
||||||
|
internal val dataState: MutableState<Optional<T>> = mutableStateOf(dataOptional)
|
||||||
|
|
||||||
|
fun reload() {
|
||||||
|
iterationState.value++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Showing data with ability to reload data
|
||||||
|
*
|
||||||
|
* [block] will be shown when [loader] will complete loading. If you want to reload data, just call
|
||||||
|
* [LoadableComponentContext.reload]
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> LoadableComponent(
|
||||||
|
preload: Optional<T>,
|
||||||
|
loader: suspend LoadableComponentContext<T>.() -> T,
|
||||||
|
block: @Composable LoadableComponentContext<T>.(T) -> Unit
|
||||||
|
) {
|
||||||
|
val context = remember { LoadableComponentContext(preload) }
|
||||||
|
|
||||||
|
LaunchedEffect(context.iterationState.value) {
|
||||||
|
context.dataState.value = loader(context).optional
|
||||||
|
}
|
||||||
|
|
||||||
|
context.dataState.let {
|
||||||
|
if (it.value.dataPresented) {
|
||||||
|
context.block(it.value.dataOrThrow(IllegalStateException("Data must be presented, but optional has been changed by some way")))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Showing data with ability to reload data
|
||||||
|
*
|
||||||
|
* [block] will be shown when [loader] will complete loading. If you want to reload data, just call
|
||||||
|
* [LoadableComponentContext.reload]
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> LoadableComponent(
|
||||||
|
preload: T,
|
||||||
|
loader: suspend LoadableComponentContext<T>.() -> T,
|
||||||
|
block: @Composable LoadableComponentContext<T>.(T) -> Unit
|
||||||
|
) {
|
||||||
|
LoadableComponent(preload.optional, loader, block)
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Showing data with ability to reload data
|
||||||
|
*
|
||||||
|
* [block] will be shown when [loader] will complete loading. If you want to reload data, just call
|
||||||
|
* [LoadableComponentContext.reload]
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> LoadableComponent(
|
||||||
|
loader: suspend LoadableComponentContext<T>.() -> T,
|
||||||
|
block: @Composable LoadableComponentContext<T>.(T) -> Unit
|
||||||
|
) {
|
||||||
|
LoadableComponent(Optional.absent(), loader, block)
|
||||||
|
}
|
42
common/compose/src/jvmTest/kotlin/LoadableComponentTests.kt
Normal file
42
common/compose/src/jvmTest/kotlin/LoadableComponentTests.kt
Normal file
@@ -0,0 +1,42 @@
|
|||||||
|
import androidx.compose.runtime.remember
|
||||||
|
import androidx.compose.ui.test.ExperimentalTestApi
|
||||||
|
import androidx.compose.ui.test.runComposeUiTest
|
||||||
|
import dev.inmo.micro_utils.common.compose.LoadableComponent
|
||||||
|
import dev.inmo.micro_utils.coroutines.SpecialMutableStateFlow
|
||||||
|
import kotlinx.coroutines.flow.MutableSharedFlow
|
||||||
|
import kotlinx.coroutines.flow.filter
|
||||||
|
import kotlinx.coroutines.flow.first
|
||||||
|
import kotlinx.coroutines.flow.firstOrNull
|
||||||
|
import org.jetbrains.annotations.TestOnly
|
||||||
|
import kotlin.test.Test
|
||||||
|
import kotlin.test.assertTrue
|
||||||
|
|
||||||
|
class LoadableComponentTests {
|
||||||
|
@OptIn(ExperimentalTestApi::class)
|
||||||
|
@Test
|
||||||
|
@TestOnly
|
||||||
|
fun testSimpleLoad() = runComposeUiTest {
|
||||||
|
val loadingFlow = SpecialMutableStateFlow<Int>(0)
|
||||||
|
val loadedFlow = SpecialMutableStateFlow<Int>(0)
|
||||||
|
setContent {
|
||||||
|
LoadableComponent<Int>({
|
||||||
|
loadingFlow.filter { it == 1 }.first()
|
||||||
|
}) {
|
||||||
|
assert(dataState.value.data == 1)
|
||||||
|
remember {
|
||||||
|
loadedFlow.value = 2
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
waitForIdle()
|
||||||
|
|
||||||
|
assertTrue(loadedFlow.value == 0)
|
||||||
|
|
||||||
|
loadingFlow.value = 1
|
||||||
|
|
||||||
|
waitForIdle()
|
||||||
|
|
||||||
|
assertTrue(loadedFlow.value == 2)
|
||||||
|
}
|
||||||
|
}
|
@@ -0,0 +1,6 @@
|
|||||||
|
package dev.inmo.micro_utils.common
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Creates simple [Comparator] which will use [compareTo] of [T] for both objects
|
||||||
|
*/
|
||||||
|
fun <T : Comparable<C>, C : T> T.createComparator() = Comparator<C> { o1, o2 -> o1.compareTo(o2) }
|
@@ -0,0 +1,319 @@
|
|||||||
|
package dev.inmo.micro_utils.coroutines.collections
|
||||||
|
|
||||||
|
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.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 SortedBinaryTreeNode<T>(
|
||||||
|
val data: T,
|
||||||
|
internal val comparator: Comparator<T>,
|
||||||
|
) : Iterable<SortedBinaryTreeNode<T>> {
|
||||||
|
internal var leftNode: SortedBinaryTreeNode<T>? = null
|
||||||
|
internal var rightNode: SortedBinaryTreeNode<T>? = null
|
||||||
|
internal val locker: SmartRWLocker by lazy {
|
||||||
|
SmartRWLocker()
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getLeftNode() = locker.withReadAcquire {
|
||||||
|
leftNode
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getRightNode() = locker.withReadAcquire {
|
||||||
|
rightNode
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun getLeft() = getLeftNode() ?.data
|
||||||
|
|
||||||
|
suspend fun getRight() = getRightNode() ?.data
|
||||||
|
|
||||||
|
override fun equals(other: Any?): Boolean {
|
||||||
|
return other === this || (other is SortedBinaryTreeNode<*> && other.data == data && other.rightNode == rightNode && other.leftNode == leftNode)
|
||||||
|
}
|
||||||
|
|
||||||
|
override fun hashCode(): Int {
|
||||||
|
return data.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.SortedBinaryTreeNode]-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<SortedBinaryTreeNode<T>> = iterator {
|
||||||
|
leftNode ?.let {
|
||||||
|
it.iterator().forEach { yield(it) }
|
||||||
|
}
|
||||||
|
yield(this@SortedBinaryTreeNode)
|
||||||
|
rightNode ?.let {
|
||||||
|
it.iterator().forEach { yield(it) }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
override fun toString(): String {
|
||||||
|
return "$data($leftNode;$rightNode)"
|
||||||
|
}
|
||||||
|
|
||||||
|
companion object {
|
||||||
|
operator fun <T : Comparable<T>> invoke(
|
||||||
|
data: T,
|
||||||
|
) = SortedBinaryTreeNode(
|
||||||
|
data,
|
||||||
|
data.createComparator()
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Will add subnode in tree if there are no any node with [newData]
|
||||||
|
*
|
||||||
|
* * If [newData] is greater than [SortedBinaryTreeNode.data] of currently checking node,
|
||||||
|
* will be used [SortedBinaryTreeNode.rightNode]
|
||||||
|
* * If [newData] is equal to [SortedBinaryTreeNode.data] of currently
|
||||||
|
* checking node - will be returned currently checking node
|
||||||
|
* * If [newData] is less than [SortedBinaryTreeNode.data] of currently
|
||||||
|
* checking node - will be used [SortedBinaryTreeNode.leftNode]
|
||||||
|
*
|
||||||
|
* 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
|
||||||
|
*/
|
||||||
|
private suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(
|
||||||
|
subNode: SortedBinaryTreeNode<T>,
|
||||||
|
skipLockers: Set<SmartRWLocker> = emptySet()
|
||||||
|
): SortedBinaryTreeNode<T> {
|
||||||
|
var currentlyChecking = this
|
||||||
|
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.data, currentlyChecking.data)
|
||||||
|
val isGreater = comparingResult > 0
|
||||||
|
when {
|
||||||
|
comparingResult == 0 -> return currentlyChecking
|
||||||
|
isGreater && right == null -> {
|
||||||
|
currentlyChecking.rightNode = subNode
|
||||||
|
return subNode
|
||||||
|
}
|
||||||
|
isGreater && right != null -> {
|
||||||
|
currentlyChecking = right
|
||||||
|
}
|
||||||
|
left == null -> {
|
||||||
|
currentlyChecking.leftNode = subNode
|
||||||
|
return subNode
|
||||||
|
}
|
||||||
|
else -> {
|
||||||
|
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 [newData]
|
||||||
|
*
|
||||||
|
* * If [newData] is greater than [SortedBinaryTreeNode.data] of currently checking node,
|
||||||
|
* will be used [SortedBinaryTreeNode.rightNode]
|
||||||
|
* * If [newData] is equal to [SortedBinaryTreeNode.data] of currently
|
||||||
|
* checking node - will be returned currently checking node
|
||||||
|
* * If [newData] is less than [SortedBinaryTreeNode.data] of currently
|
||||||
|
* checking node - will be used [SortedBinaryTreeNode.leftNode]
|
||||||
|
*
|
||||||
|
* 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
|
||||||
|
*/
|
||||||
|
suspend fun <T> SortedBinaryTreeNode<T>.addSubNode(newData: T): SortedBinaryTreeNode<T> {
|
||||||
|
return addSubNode(
|
||||||
|
SortedBinaryTreeNode(newData, comparator)
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
suspend fun <T> SortedBinaryTreeNode<T>.findParentNode(data: T): SortedBinaryTreeNode<T>? {
|
||||||
|
var currentParent: SortedBinaryTreeNode<T>? = null
|
||||||
|
var currentlyChecking: SortedBinaryTreeNode<T>? = 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.data)
|
||||||
|
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] [SortedBinaryTreeNode]
|
||||||
|
*
|
||||||
|
* @return If data were found, [Pair] where [Pair.first] is the parent node where from [Pair.second] has been detached;
|
||||||
|
* null otherwise
|
||||||
|
*/
|
||||||
|
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 ->
|
||||||
|
left ?.also { leftNode -> addSubNode(leftNode, setOf(locker)) }
|
||||||
|
right ?.also { rightNode -> addSubNode(rightNode, setOf(locker)) }
|
||||||
|
}
|
||||||
|
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.data) == 0 -> {
|
||||||
|
foundParentNode.leftNode = null
|
||||||
|
foundParentNode.onFoundToRemoveCallback(left.leftNode, left.rightNode)
|
||||||
|
return foundParentNode to left
|
||||||
|
}
|
||||||
|
right != null && right.comparator.compare(data, right.data) == 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 <T> SortedBinaryTreeNode<T>.findNode(data: T): SortedBinaryTreeNode<T>? {
|
||||||
|
var currentlyChecking: SortedBinaryTreeNode<T>? = 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.data)
|
||||||
|
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 <T> SortedBinaryTreeNode<T>.contains(data: T): Boolean = findNode(data) != null
|
||||||
|
|
||||||
|
suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange(from: T, to: T, fromInclusiveMode: Boolean, toInclusiveMode: Boolean): Set<SortedBinaryTreeNode<T>> {
|
||||||
|
val results = mutableSetOf<SortedBinaryTreeNode<T>>()
|
||||||
|
val leftToCheck = mutableSetOf(this)
|
||||||
|
val lockedLockers = mutableSetOf<SmartRWLocker>()
|
||||||
|
val fromComparingFun: (SortedBinaryTreeNode<T>) -> Boolean = if (fromInclusiveMode) {
|
||||||
|
{ it.comparator.compare(from, it.data) <= 0 }
|
||||||
|
} else {
|
||||||
|
{ it.comparator.compare(from, it.data) < 0 }
|
||||||
|
}
|
||||||
|
val toComparingFun: (SortedBinaryTreeNode<T>) -> Boolean = if (toInclusiveMode) {
|
||||||
|
{ it.comparator.compare(to, it.data) >= 0 }
|
||||||
|
} else {
|
||||||
|
{ it.comparator.compare(to, it.data) > 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.data) < 0 -> currentlyChecking.leftNode ?.let { leftToCheck.add(it) }
|
||||||
|
currentlyChecking.comparator.compare(from, currentlyChecking.data) > 0 -> currentlyChecking.rightNode ?.let { leftToCheck.add(it) }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return results.toSet()
|
||||||
|
} finally {
|
||||||
|
lockedLockers.forEach {
|
||||||
|
runCatching { it.releaseRead() }
|
||||||
|
}
|
||||||
|
}
|
||||||
|
error("Unable to find nodes range")
|
||||||
|
}
|
||||||
|
suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRange(from: T, to: T): Set<SortedBinaryTreeNode<T>> = findNodesInRange(
|
||||||
|
from = from,
|
||||||
|
to = to,
|
||||||
|
fromInclusiveMode = true,
|
||||||
|
toInclusiveMode = true
|
||||||
|
)
|
||||||
|
suspend fun <T> SortedBinaryTreeNode<T>.findNodesInRangeExcluding(from: T, to: T): Set<SortedBinaryTreeNode<T>> = findNodesInRange(
|
||||||
|
from = from,
|
||||||
|
to = to,
|
||||||
|
fromInclusiveMode = false,
|
||||||
|
toInclusiveMode = false
|
||||||
|
)
|
||||||
|
suspend fun <T : Comparable<T>> SortedBinaryTreeNode<T>.findNodesInRange(range: ClosedRange<T>): Set<SortedBinaryTreeNode<T>> = findNodesInRange(
|
||||||
|
from = range.start,
|
||||||
|
to = range.endInclusive,
|
||||||
|
)
|
@@ -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)
|
|
||||||
}
|
}
|
||||||
}
|
}
|
@@ -0,0 +1,176 @@
|
|||||||
|
package dev.inmo.micro_utils.coroutines
|
||||||
|
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.SortedBinaryTreeNode
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.addSubNode
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.findNode
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.findNodesInRange
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.findParentNode
|
||||||
|
import dev.inmo.micro_utils.coroutines.collections.removeSubNode
|
||||||
|
import kotlinx.coroutines.test.runTest
|
||||||
|
import kotlin.test.Test
|
||||||
|
import kotlin.test.assertEquals
|
||||||
|
import kotlin.test.assertTrue
|
||||||
|
import kotlin.time.Duration.Companion.seconds
|
||||||
|
|
||||||
|
class SortedBinaryTreeNodeTests {
|
||||||
|
@Test
|
||||||
|
fun insertOnZeroLevelWorks() = runTest {
|
||||||
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
|
zeroNode.addSubNode(1)
|
||||||
|
zeroNode.addSubNode(-1)
|
||||||
|
|
||||||
|
assertEquals(0, zeroNode.data)
|
||||||
|
assertEquals(1, zeroNode.getRightNode() ?.data)
|
||||||
|
assertEquals(-1, zeroNode.getLeftNode() ?.data)
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun searchOnZeroLevelWorks() = runTest {
|
||||||
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
|
val oneNode = zeroNode.addSubNode(1)
|
||||||
|
val minusOneNode = zeroNode.addSubNode(-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) {
|
||||||
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
|
val rangeRadius = 500
|
||||||
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
nodes[i] = zeroNode.addSubNode(i)
|
||||||
|
}
|
||||||
|
|
||||||
|
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 ?.data} will be parent of ${expectedNode.data}, but its left subnode is ${parentNode ?.getLeftNode() ?.data} and right one is ${parentNode ?.getRightNode() ?.data}"
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
val sourceTreeSize = zeroNode.size()
|
||||||
|
assertTrue(sourceTreeSize == nodes.size)
|
||||||
|
assertTrue(sourceTreeSize == (rangeRadius * 2 + 1))
|
||||||
|
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
val expectedNode = nodes.getValue(i)
|
||||||
|
val parentNode = zeroNode.findParentNode(i)
|
||||||
|
|
||||||
|
if (parentNode == null && i == zeroNode.data && expectedNode === zeroNode) continue
|
||||||
|
|
||||||
|
assertTrue(parentNode != null, "It is expected, that parent node of ${expectedNode.data} will not be null")
|
||||||
|
|
||||||
|
assertTrue(
|
||||||
|
parentNode.getLeftNode() === expectedNode || parentNode.getRightNode() === expectedNode,
|
||||||
|
"It is expected, that parent node with data ${parentNode ?.data} will be parent of ${expectedNode.data}, but its left subnode is ${parentNode ?.getLeftNode() ?.data} and right one is ${parentNode ?.getRightNode() ?.data}"
|
||||||
|
)
|
||||||
|
|
||||||
|
val removeResult = zeroNode.removeSubNode(i)
|
||||||
|
assertTrue(removeResult ?.first === parentNode)
|
||||||
|
assertTrue(removeResult.second === expectedNode)
|
||||||
|
|
||||||
|
nodes[i] = zeroNode.addSubNode(i)
|
||||||
|
assertTrue(nodes[i] != null)
|
||||||
|
assertTrue(nodes[i] != expectedNode)
|
||||||
|
assertTrue(nodes[i] ?.data == i)
|
||||||
|
}
|
||||||
|
|
||||||
|
assertTrue(sourceTreeSize == zeroNode.size())
|
||||||
|
|
||||||
|
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 ?.data} will be parent of ${expectedNode.data}, but its left subnode is ${parentNode ?.getLeftNode() ?.data} and right one is ${parentNode ?.getRightNode() ?.data}"
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
var previousData = -rangeRadius - 1
|
||||||
|
for (node in zeroNode) {
|
||||||
|
assertTrue(nodes[node.data] === node)
|
||||||
|
assertTrue(previousData == node.data - 1)
|
||||||
|
previousData = node.data
|
||||||
|
}
|
||||||
|
|
||||||
|
assertTrue(sourceTreeSize == zeroNode.size())
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun deepInsertOnWorks() = runTest(timeout = 240.seconds) {
|
||||||
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
|
val rangeRadius = 500
|
||||||
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
nodes[i] = zeroNode.addSubNode(i)
|
||||||
|
}
|
||||||
|
|
||||||
|
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 ?.data} will be parent of ${expectedNode.data}, but its left subnode is ${parentNode ?.getLeftNode() ?.data} and right one is ${parentNode ?.getRightNode() ?.data}"
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
val sourceTreeSize = zeroNode.size()
|
||||||
|
|
||||||
|
var previousData = -rangeRadius - 1
|
||||||
|
for (node in zeroNode) {
|
||||||
|
assertTrue(nodes[node.data] === node)
|
||||||
|
assertTrue(previousData == node.data - 1)
|
||||||
|
previousData = node.data
|
||||||
|
}
|
||||||
|
|
||||||
|
assertTrue(sourceTreeSize == zeroNode.size())
|
||||||
|
}
|
||||||
|
@Test
|
||||||
|
fun deepInsertIteratorWorking() = runTest {
|
||||||
|
val zeroNode = SortedBinaryTreeNode(0)
|
||||||
|
val rangeRadius = 500
|
||||||
|
val nodes = mutableMapOf<Int, SortedBinaryTreeNode<Int>>()
|
||||||
|
for (i in -rangeRadius .. rangeRadius) {
|
||||||
|
nodes[i] = zeroNode.addSubNode(i)
|
||||||
|
}
|
||||||
|
|
||||||
|
var previousData = -rangeRadius - 1
|
||||||
|
for (node in zeroNode) {
|
||||||
|
assertTrue(nodes[node.data] === node)
|
||||||
|
assertTrue(previousData == node.data - 1)
|
||||||
|
previousData = node.data
|
||||||
|
}
|
||||||
|
assertTrue(previousData == rangeRadius)
|
||||||
|
}
|
||||||
|
}
|
@@ -15,5 +15,5 @@ crypto_js_version=4.1.1
|
|||||||
# Project data
|
# Project data
|
||||||
|
|
||||||
group=dev.inmo
|
group=dev.inmo
|
||||||
version=0.24.7
|
version=0.25.0
|
||||||
android_code_version=287
|
android_code_version=290
|
||||||
|
@@ -15,7 +15,7 @@ sqlite = "3.49.1.0"
|
|||||||
korlibs = "5.4.0"
|
korlibs = "5.4.0"
|
||||||
uuid = "0.8.4"
|
uuid = "0.8.4"
|
||||||
|
|
||||||
ktor = "3.1.0"
|
ktor = "3.1.1"
|
||||||
|
|
||||||
gh-release = "2.5.2"
|
gh-release = "2.5.2"
|
||||||
|
|
||||||
@@ -23,7 +23,7 @@ koin = "4.0.2"
|
|||||||
|
|
||||||
okio = "3.10.2"
|
okio = "3.10.2"
|
||||||
|
|
||||||
ksp = "2.1.10-1.0.30"
|
ksp = "2.1.10-1.0.31"
|
||||||
kotlin-poet = "1.18.1"
|
kotlin-poet = "1.18.1"
|
||||||
|
|
||||||
versions = "0.51.0"
|
versions = "0.51.0"
|
||||||
|
@@ -15,14 +15,14 @@ kotlin {
|
|||||||
browser {
|
browser {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
nodejs {
|
nodejs {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -15,14 +15,14 @@ kotlin {
|
|||||||
browser {
|
browser {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
nodejs {
|
nodejs {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -15,14 +15,14 @@ kotlin {
|
|||||||
browser {
|
browser {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
nodejs {
|
nodejs {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -15,14 +15,14 @@ kotlin {
|
|||||||
browser {
|
browser {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
nodejs {
|
nodejs {
|
||||||
testTask {
|
testTask {
|
||||||
useMocha {
|
useMocha {
|
||||||
timeout = "60000"
|
timeout = "240000"
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -40,6 +40,8 @@ fun Pagination.intersect(
|
|||||||
inline val Pagination.isFirstPage
|
inline val Pagination.isFirstPage
|
||||||
get() = page == 0
|
get() = page == 0
|
||||||
|
|
||||||
|
fun Pagination.firstPage() = if (isFirstPage) this else SimplePagination(0, size)
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* First number in index of objects. It can be used as offset for databases or other data sources
|
* First number in index of objects. It can be used as offset for databases or other data sources
|
||||||
*/
|
*/
|
||||||
|
@@ -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
|
||||||
|
21
pagination/compose/build.gradle
Normal file
21
pagination/compose/build.gradle
Normal file
@@ -0,0 +1,21 @@
|
|||||||
|
plugins {
|
||||||
|
id "org.jetbrains.kotlin.multiplatform"
|
||||||
|
id "org.jetbrains.kotlin.plugin.serialization"
|
||||||
|
id "com.android.library"
|
||||||
|
alias(libs.plugins.jb.compose)
|
||||||
|
alias(libs.plugins.kt.jb.compose)
|
||||||
|
}
|
||||||
|
|
||||||
|
apply from: "$mppComposeJvmJsAndroidLinuxMingwLinuxArm64Project"
|
||||||
|
|
||||||
|
kotlin {
|
||||||
|
sourceSets {
|
||||||
|
commonMain {
|
||||||
|
dependencies {
|
||||||
|
api project(":micro_utils.pagination.common")
|
||||||
|
api project(":micro_utils.common.compose")
|
||||||
|
api project(":micro_utils.coroutines")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
@@ -0,0 +1,117 @@
|
|||||||
|
package dev.inmo.micro_utils.pagination.compose
|
||||||
|
|
||||||
|
import androidx.compose.runtime.*
|
||||||
|
import dev.inmo.micro_utils.coroutines.SpecialMutableStateFlow
|
||||||
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Context for managing infinite pagination in a Compose UI.
|
||||||
|
*
|
||||||
|
* @param T The type of the data being paginated.
|
||||||
|
* @property iterationState Holds the current pagination state and iteration count.
|
||||||
|
* @property dataState Stores the loaded data, initially null.
|
||||||
|
* @constructor Internal constructor to initialize pagination.
|
||||||
|
* @param page Initial page number.
|
||||||
|
* @param size Number of items per page.
|
||||||
|
*/
|
||||||
|
class InfinityPagedComponentContext<T> internal constructor(
|
||||||
|
page: Int,
|
||||||
|
size: Int
|
||||||
|
) {
|
||||||
|
internal val startPage = SimplePagination(page, size)
|
||||||
|
internal val currentlyLoadingPage = SpecialMutableStateFlow<Pagination?>(startPage)
|
||||||
|
internal val latestLoadedPage = SpecialMutableStateFlow<PaginationResult<T>?>(null)
|
||||||
|
internal val dataState = SpecialMutableStateFlow<List<T>?>(null)
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Loads the next page of data. If the current page is the last one, the function returns early.
|
||||||
|
*/
|
||||||
|
fun loadNext() {
|
||||||
|
if (latestLoadedPage.value ?.isLastPage == true) return
|
||||||
|
if (currentlyLoadingPage.value != null) return // Data loading has been inited but not loaded yet
|
||||||
|
|
||||||
|
currentlyLoadingPage.value = latestLoadedPage.value ?.nextPage() ?: startPage
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Reloads the pagination from the first page, clearing previously loaded data.
|
||||||
|
*/
|
||||||
|
fun reload() {
|
||||||
|
latestLoadedPage.value = null
|
||||||
|
currentlyLoadingPage.value = null
|
||||||
|
loadNext()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Composable function for managing an infinitely paged component.
|
||||||
|
*
|
||||||
|
* @param T The type of the paginated data.
|
||||||
|
* @param page 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. When data is in loading state, block will
|
||||||
|
* receive null as `it` parameter
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
internal fun <T> InfinityPagedComponent(
|
||||||
|
page: Int,
|
||||||
|
size: Int,
|
||||||
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
|
) {
|
||||||
|
val context = remember { InfinityPagedComponentContext<T>(page, size) }
|
||||||
|
|
||||||
|
val currentlyLoadingState = context.currentlyLoadingPage.collectAsState()
|
||||||
|
LaunchedEffect(currentlyLoadingState.value) {
|
||||||
|
val paginationResult = loader(context, currentlyLoadingState.value ?: return@LaunchedEffect)
|
||||||
|
context.latestLoadedPage.value = paginationResult
|
||||||
|
context.currentlyLoadingPage.value = null
|
||||||
|
|
||||||
|
context.dataState.value = (context.dataState.value ?: emptyList()) + paginationResult.results
|
||||||
|
}
|
||||||
|
|
||||||
|
val dataState = context.dataState.collectAsState()
|
||||||
|
context.block(dataState.value)
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Overloaded composable function for an infinitely paged component.
|
||||||
|
*
|
||||||
|
* @param T The type of the paginated data.
|
||||||
|
* @param pageInfo Initial pagination information.
|
||||||
|
* @param loader Suspended function that loads paginated data.
|
||||||
|
* @param block Composable function that renders the UI with the loaded data. When data is in loading state, block will
|
||||||
|
* receive null as `it` parameter
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> InfinityPagedComponent(
|
||||||
|
pageInfo: Pagination,
|
||||||
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
|
) {
|
||||||
|
InfinityPagedComponent(
|
||||||
|
pageInfo.page,
|
||||||
|
pageInfo.size,
|
||||||
|
loader,
|
||||||
|
block
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Overloaded composable function for an infinitely paged component.
|
||||||
|
*
|
||||||
|
* @param T The type of the paginated data.
|
||||||
|
* @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. When data is in loading state, block will
|
||||||
|
* receive null as `it` parameter
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> InfinityPagedComponent(
|
||||||
|
size: Int,
|
||||||
|
loader: suspend InfinityPagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable InfinityPagedComponentContext<T>.(List<T>?) -> Unit
|
||||||
|
) {
|
||||||
|
InfinityPagedComponent(0, size, loader, block)
|
||||||
|
}
|
126
pagination/compose/src/commonMain/kotlin/PagedComponent.kt
Normal file
126
pagination/compose/src/commonMain/kotlin/PagedComponent.kt
Normal file
@@ -0,0 +1,126 @@
|
|||||||
|
package dev.inmo.micro_utils.pagination.compose
|
||||||
|
|
||||||
|
import androidx.compose.runtime.*
|
||||||
|
import dev.inmo.micro_utils.coroutines.SpecialMutableStateFlow
|
||||||
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Context for managing paginated data in a Compose UI.
|
||||||
|
*
|
||||||
|
* @param T The type of data being paginated.
|
||||||
|
* @property iterationState Holds the current pagination state and iteration count.
|
||||||
|
* @property dataOptional Stores the optional preloaded pagination result.
|
||||||
|
* @property dataState Stores the current pagination result.
|
||||||
|
* @constructor Internal constructor for setting up pagination.
|
||||||
|
* @param preset Optional preset pagination result.
|
||||||
|
* @param initialPage Initial page number.
|
||||||
|
* @param size Number of items per page.
|
||||||
|
*/
|
||||||
|
class PagedComponentContext<T> internal constructor(
|
||||||
|
initialPage: Int,
|
||||||
|
size: Int
|
||||||
|
) {
|
||||||
|
internal val startPage = SimplePagination(initialPage, size)
|
||||||
|
internal val currentlyLoadingPageState = SpecialMutableStateFlow<Pagination?>(startPage)
|
||||||
|
internal val latestLoadedPage = SpecialMutableStateFlow<PaginationResult<T>?>(null)
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Loads the next page of data. If the last page is reached, this function returns early.
|
||||||
|
*/
|
||||||
|
fun loadNext() {
|
||||||
|
when {
|
||||||
|
currentlyLoadingPageState.value != null -> return
|
||||||
|
latestLoadedPage.value ?.isLastPage == true -> return
|
||||||
|
else -> currentlyLoadingPageState.value = (latestLoadedPage.value ?.nextPage()) ?: startPage
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Loads the previous page of data if available.
|
||||||
|
*/
|
||||||
|
fun loadPrevious() {
|
||||||
|
when {
|
||||||
|
currentlyLoadingPageState.value != null -> return
|
||||||
|
latestLoadedPage.value ?.isFirstPage == true -> return
|
||||||
|
else -> currentlyLoadingPageState.value = (latestLoadedPage.value ?.previousPage()) ?: startPage
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Reloads the current page, refreshing the data.
|
||||||
|
*/
|
||||||
|
fun reload() {
|
||||||
|
currentlyLoadingPageState.value = latestLoadedPage.value
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Composable function for paginated data displaying in a Compose UI.
|
||||||
|
*
|
||||||
|
* @param T The type of paginated data.
|
||||||
|
* @param preload Optional preloaded pagination result.
|
||||||
|
* @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
|
||||||
|
internal fun <T> PagedComponent(
|
||||||
|
initialPage: Int,
|
||||||
|
size: Int,
|
||||||
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
|
) {
|
||||||
|
val context = remember { PagedComponentContext<T>(initialPage, size) }
|
||||||
|
|
||||||
|
val currentlyLoadingState = context.currentlyLoadingPageState.collectAsState()
|
||||||
|
LaunchedEffect(currentlyLoadingState.value) {
|
||||||
|
val paginationResult = loader(context, currentlyLoadingState.value ?: return@LaunchedEffect)
|
||||||
|
context.latestLoadedPage.value = paginationResult
|
||||||
|
context.currentlyLoadingPageState.value = null
|
||||||
|
}
|
||||||
|
|
||||||
|
val pageState = context.latestLoadedPage.collectAsState()
|
||||||
|
pageState.value ?.let {
|
||||||
|
context.block(it)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Overloaded composable function for paginated components with pagination info.
|
||||||
|
*
|
||||||
|
* @param T The type of paginated data.
|
||||||
|
* @param pageInfo Initial pagination information.
|
||||||
|
* @param loader Suspended function that loads paginated data.
|
||||||
|
* @param block Composable function that renders the UI with the loaded data.
|
||||||
|
*/
|
||||||
|
@Composable
|
||||||
|
fun <T> PagedComponent(
|
||||||
|
pageInfo: Pagination,
|
||||||
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
|
) {
|
||||||
|
PagedComponent(
|
||||||
|
pageInfo.page,
|
||||||
|
pageInfo.size,
|
||||||
|
loader,
|
||||||
|
block
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Overloaded composable function for paginated components with only a size parameter.
|
||||||
|
*
|
||||||
|
* @param T The type of paginated data.
|
||||||
|
* @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(
|
||||||
|
size: Int,
|
||||||
|
loader: suspend PagedComponentContext<T>.(Pagination) -> PaginationResult<T>,
|
||||||
|
block: @Composable PagedComponentContext<T>.(PaginationResult<T>) -> Unit
|
||||||
|
) {
|
||||||
|
PagedComponent(0, size, loader, block)
|
||||||
|
}
|
@@ -0,0 +1,51 @@
|
|||||||
|
import androidx.compose.runtime.LaunchedEffect
|
||||||
|
import androidx.compose.ui.test.ExperimentalTestApi
|
||||||
|
import androidx.compose.ui.test.runComposeUiTest
|
||||||
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
import dev.inmo.micro_utils.pagination.compose.InfinityPagedComponent
|
||||||
|
import dev.inmo.micro_utils.pagination.compose.PagedComponent
|
||||||
|
import org.jetbrains.annotations.TestOnly
|
||||||
|
import kotlin.test.Test
|
||||||
|
import kotlin.test.assertContentEquals
|
||||||
|
import kotlin.test.assertEquals
|
||||||
|
|
||||||
|
class InfinityPagedComponentTests {
|
||||||
|
@OptIn(ExperimentalTestApi::class)
|
||||||
|
@Test
|
||||||
|
@TestOnly
|
||||||
|
fun testSimpleLoad() = runComposeUiTest {
|
||||||
|
var expectedList = listOf<Int>()
|
||||||
|
setContent {
|
||||||
|
InfinityPagedComponent<Int>(
|
||||||
|
size = 1,
|
||||||
|
loader = {
|
||||||
|
PaginationResult(
|
||||||
|
page = it.page,
|
||||||
|
size = it.size,
|
||||||
|
results = (it.firstIndex .. it.lastIndex).toList(),
|
||||||
|
objectsNumber = 3
|
||||||
|
).also {
|
||||||
|
expectedList += it.results
|
||||||
|
}
|
||||||
|
}
|
||||||
|
) {
|
||||||
|
if (it == null) {
|
||||||
|
assertEquals(0, this.currentlyLoadingPage.value ?.page)
|
||||||
|
} else {
|
||||||
|
assertEquals(expectedList, it)
|
||||||
|
}
|
||||||
|
|
||||||
|
LaunchedEffect(it ?.size) {
|
||||||
|
loadNext()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
waitForIdle()
|
||||||
|
|
||||||
|
assertContentEquals(
|
||||||
|
listOf(0, 1, 2),
|
||||||
|
expectedList
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
64
pagination/compose/src/jvmTest/kotlin/PagedComponentTests.kt
Normal file
64
pagination/compose/src/jvmTest/kotlin/PagedComponentTests.kt
Normal file
@@ -0,0 +1,64 @@
|
|||||||
|
import androidx.compose.runtime.LaunchedEffect
|
||||||
|
import androidx.compose.ui.test.ExperimentalTestApi
|
||||||
|
import androidx.compose.ui.test.runComposeUiTest
|
||||||
|
import dev.inmo.micro_utils.pagination.*
|
||||||
|
import dev.inmo.micro_utils.pagination.compose.PagedComponent
|
||||||
|
import org.jetbrains.annotations.TestOnly
|
||||||
|
import kotlin.test.Test
|
||||||
|
import kotlin.test.assertEquals
|
||||||
|
|
||||||
|
class PagedComponentTests {
|
||||||
|
@OptIn(ExperimentalTestApi::class)
|
||||||
|
@Test
|
||||||
|
@TestOnly
|
||||||
|
fun testSimpleLoad() = runComposeUiTest {
|
||||||
|
var expectedPage = PaginationResult(
|
||||||
|
page = 0,
|
||||||
|
size = 1,
|
||||||
|
results = listOf(0),
|
||||||
|
objectsNumber = 3
|
||||||
|
)
|
||||||
|
var previousPage = expectedPage
|
||||||
|
setContent {
|
||||||
|
PagedComponent<Int>(
|
||||||
|
initialPage = 0,
|
||||||
|
size = 1,
|
||||||
|
loader = {
|
||||||
|
previousPage = expectedPage
|
||||||
|
expectedPage = PaginationResult(
|
||||||
|
page = it.page,
|
||||||
|
size = it.size,
|
||||||
|
results = (it.firstIndex .. it.lastIndex).toList(),
|
||||||
|
objectsNumber = 3
|
||||||
|
)
|
||||||
|
expectedPage
|
||||||
|
}
|
||||||
|
) {
|
||||||
|
assertEquals(expectedPage, it)
|
||||||
|
assertEquals(expectedPage.results, it.results)
|
||||||
|
|
||||||
|
if (it.isLastPage || it.page < previousPage.page) {
|
||||||
|
if (it.isFirstPage) {
|
||||||
|
// do nothing - end of test
|
||||||
|
} else {
|
||||||
|
loadPrevious()
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
loadNext()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
waitForIdle()
|
||||||
|
|
||||||
|
assertEquals(
|
||||||
|
PaginationResult(
|
||||||
|
page = 0,
|
||||||
|
size = 1,
|
||||||
|
results = listOf(0),
|
||||||
|
objectsNumber = 3
|
||||||
|
),
|
||||||
|
expectedPage
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
@@ -12,10 +12,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)
|
||||||
@@ -51,11 +51,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
|
||||||
@@ -131,25 +131,25 @@ 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> {
|
||||||
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
override suspend fun invalidate() = kvCache.actualizeAll(parentRepo, locker = locker)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -12,8 +12,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 {
|
||||||
@@ -58,24 +58,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()
|
||||||
}
|
}
|
||||||
|
@@ -13,8 +13,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> {
|
||||||
|
@@ -18,7 +18,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,
|
||||||
|
@@ -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()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -18,7 +18,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,
|
||||||
|
@@ -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(
|
||||||
|
@@ -24,7 +24,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,
|
||||||
|
@@ -15,10 +15,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 +94,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,7 +128,7 @@ 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()
|
||||||
}
|
}
|
||||||
|
@@ -15,9 +15,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>,
|
||||||
@@ -98,7 +98,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 +126,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 +151,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 {
|
||||||
@@ -165,13 +165,13 @@ open class FullKeyValueCacheRepo<Key,Value>(
|
|||||||
}
|
}
|
||||||
|
|
||||||
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 +182,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)
|
||||||
|
@@ -16,9 +16,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>,
|
||||||
@@ -165,7 +165,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 +200,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 {
|
||||||
@@ -241,7 +241,7 @@ open class FullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
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 +252,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 +269,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 +291,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,21 @@
|
|||||||
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.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.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 +57,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,
|
||||||
|
@@ -18,9 +18,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)
|
||||||
@@ -65,8 +65,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 {
|
||||||
@@ -101,20 +101,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 {
|
||||||
@@ -140,15 +140,15 @@ open class DirectFullKeyValueCacheRepo<Key, Value>(
|
|||||||
}
|
}
|
||||||
|
|
||||||
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 +159,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)
|
||||||
|
@@ -15,9 +15,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) {
|
||||||
@@ -100,7 +100,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 {
|
||||||
@@ -135,14 +135,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 {
|
||||||
@@ -176,7 +176,7 @@ open class DirectFullKeyValuesCacheRepo<Key,Value>(
|
|||||||
|
|
||||||
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 +187,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 +204,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 +226,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
|
||||||
}
|
}
|
||||||
|
@@ -11,6 +11,7 @@ String[] includes = [
|
|||||||
":koin:generator:test",
|
":koin:generator:test",
|
||||||
":selector:common",
|
":selector:common",
|
||||||
":pagination:common",
|
":pagination:common",
|
||||||
|
":pagination:compose",
|
||||||
":pagination:exposed",
|
":pagination:exposed",
|
||||||
":pagination:ktor:common",
|
":pagination:ktor:common",
|
||||||
":pagination:ktor:server",
|
":pagination:ktor:server",
|
||||||
|
Reference in New Issue
Block a user