@@ -92,7 +92,7 @@ class CLTree : ITree, IBulkTree {
92
92
}
93
93
94
94
fun getSize (): Long {
95
- return (nodesMap ? : return 0L ).calculateSize(store.newBulkQuery()).execute ()
95
+ return (nodesMap ? : return 0L ).calculateSize(store.newBulkQuery()).executeQuery ()
96
96
}
97
97
98
98
fun prefetchAll () {
@@ -315,43 +315,43 @@ class CLTree : ITree, IBulkTree {
315
315
}
316
316
317
317
override fun getAllChildren (parentId : Long ): Iterable <Long > {
318
- val children = getChildren(resolveElement(parentId)!! , store.newBulkQuery()).execute ()
318
+ val children = getChildren(resolveElement(parentId)!! , store.newBulkQuery()).executeQuery ()
319
319
return children.map { it.id }
320
320
}
321
321
322
322
override fun getDescendants (root : Long , includeSelf : Boolean ): Iterable <CLNode > {
323
323
val parent = resolveElement(root)
324
- return getDescendants(parent!! , store.newBulkQuery(), includeSelf).execute ().map { CLNode (this , it) }
324
+ return getDescendants(parent!! , store.newBulkQuery(), includeSelf).executeQuery ().map { CLNode (this , it) }
325
325
}
326
326
327
327
override fun getDescendants (rootIds : Iterable <Long >, includeSelf : Boolean ): Iterable <CLNode > {
328
328
val bulkQuery = store.newBulkQuery()
329
329
val roots: IBulkQuery .Value <List <CPNode >> = resolveElements(rootIds.toList(), bulkQuery)
330
- val descendants = roots.mapBulk { bulkQuery.map (it) { getDescendants(it, bulkQuery, includeSelf) } }
331
- return descendants.execute ().flatten().map { CLNode (this , it) }
330
+ val descendants = roots.flatMap { bulkQuery.flatMap (it) { getDescendants(it, bulkQuery, includeSelf) } }
331
+ return descendants.executeQuery ().flatten().map { CLNode (this , it) }
332
332
}
333
333
334
334
override fun getAncestors (nodeIds : Iterable <Long >, includeSelf : Boolean ): Set <Long > {
335
335
val bulkQuery = store.newBulkQuery()
336
336
val nodes: IBulkQuery .Value <List <CPNode >> = resolveElements(nodeIds, bulkQuery)
337
- val ancestors = nodes.mapBulk { bulkQuery.map (it) { getAncestors(it, bulkQuery, includeSelf) } }
337
+ val ancestors = nodes.flatMap { bulkQuery.flatMap (it) { getAncestors(it, bulkQuery, includeSelf) } }
338
338
val result = HashSet <Long >()
339
- ancestors.execute ().forEach { result.addAll(it.map { it.id }) }
339
+ ancestors.executeQuery ().forEach { result.addAll(it.map { it.id }) }
340
340
return result
341
341
}
342
342
343
343
override fun getChildren (parentId : Long , role : String? ): Iterable <Long > {
344
344
checkChildRoleId(parentId, role)
345
345
val parent = resolveElement(parentId)
346
- val children = getChildren(parent!! , store.newBulkQuery()).execute ()
346
+ val children = getChildren(parent!! , store.newBulkQuery()).executeQuery ()
347
347
return children
348
348
.filter { it.roleInParent == role }
349
349
.map { it.id }
350
350
}
351
351
352
352
override fun getChildRoles (sourceId : Long ): Iterable <String ?> {
353
353
val parent = resolveElement(sourceId)
354
- val children: Iterable <CPNode > = getChildren(parent!! , store.newBulkQuery()).execute ()
354
+ val children: Iterable <CPNode > = getChildren(parent!! , store.newBulkQuery()).executeQuery ()
355
355
return children.map { it.roleInParent }.distinct()
356
356
}
357
357
@@ -443,7 +443,7 @@ class CLTree : ITree, IBulkTree {
443
443
override fun visitChanges (oldVersion : ITree , visitor : ITreeChangeVisitor ) {
444
444
val bulkQuery = store.newBulkQuery()
445
445
visitChanges(oldVersion, visitor, bulkQuery)
446
- (bulkQuery as ? BulkQuery )?.process ()
446
+ (bulkQuery as ? BulkQuery )?.executeQuery ()
447
447
}
448
448
449
449
fun visitChanges (oldVersion : ITree , visitor : ITreeChangeVisitor , bulkQuery : IBulkQuery ) {
@@ -512,7 +512,7 @@ class CLTree : ITree, IBulkTree {
512
512
}
513
513
}
514
514
515
- bulkQuery.map (listOf (oldVersion.getChildren(oldElement, bulkQuery), getChildren(newElement, bulkQuery))) { it }.onSuccess { childrenLists ->
515
+ bulkQuery.flatMap (listOf (oldVersion.getChildren(oldElement, bulkQuery), getChildren(newElement, bulkQuery))) { it }.onReceive { childrenLists ->
516
516
val (oldChildrenList, newChildrenList) = childrenLists
517
517
val oldChildren: MutableMap <String ?, MutableList <CPNode >> = HashMap ()
518
518
val newChildren: MutableMap <String ?, MutableList <CPNode >> = HashMap ()
@@ -567,15 +567,15 @@ class CLTree : ITree, IBulkTree {
567
567
}
568
568
569
569
fun resolveElement (id : Long ): CPNode ? {
570
- return resolveElement(id, NonBulkQuery (store)).execute ()
570
+ return resolveElement(id, NonBulkQuery (store)).executeQuery ()
571
571
}
572
572
573
573
fun resolveElement (id : Long , bulkQuery : IBulkQuery ): IBulkQuery .Value <CPNode ?> {
574
574
if (id == 0L ) {
575
575
return bulkQuery.constant(null )
576
576
}
577
577
val hash = nodesMap!! .get(id, bulkQuery)
578
- return hash.mapBulk {
578
+ return hash.flatMap {
579
579
if (it == null ) throw NodeNotFoundException (id)
580
580
createElement(it, bulkQuery)
581
581
}
@@ -587,24 +587,24 @@ class CLTree : ITree, IBulkTree {
587
587
val b: IBulkQuery .Value <List <KVEntryReference <CPNode >>> = a.map { hashes: List <KVEntryReference <CPNode >? > ->
588
588
hashes.mapIndexed { index, s -> s ? : throw NodeNotFoundException (ids[index]) }
589
589
}
590
- return b.mapBulk { hashes -> createElements(hashes, bulkQuery) }
590
+ return b.flatMap { hashes -> createElements(hashes, bulkQuery) }
591
591
}
592
592
593
593
fun createElement (hash : KVEntryReference <CPNode >? , query : IBulkQuery ): IBulkQuery .Value <CPNode ?> {
594
594
return if (hash == null ) {
595
595
query.constant(null )
596
596
} else {
597
- query[ hash]
597
+ query.query( hash)
598
598
}
599
599
}
600
600
601
601
fun createElement (hash : KVEntryReference <CPNode >? ): CPNode ? {
602
- return createElement(hash, NonBulkQuery (store)).execute ()
602
+ return createElement(hash, NonBulkQuery (store)).executeQuery ()
603
603
}
604
604
605
605
fun createElements (hashes : List <KVEntryReference <CPNode >>, bulkQuery : IBulkQuery ): IBulkQuery .Value <List <CPNode >> {
606
- return bulkQuery.map (hashes) { hash: KVEntryReference <CPNode > ->
607
- bulkQuery[ hash] .map { n -> n!! }
606
+ return bulkQuery.flatMap (hashes) { hash: KVEntryReference <CPNode > ->
607
+ bulkQuery.query( hash) .map { n -> n!! }
608
608
}
609
609
}
610
610
@@ -635,9 +635,9 @@ class CLTree : ITree, IBulkTree {
635
635
getDescendants(node, bulkQuery, false )
636
636
.map { descendants -> (sequenceOf(node) + descendants).asIterable() }
637
637
} else {
638
- getChildren(node, bulkQuery).mapBulk { children: Iterable <CPNode > ->
638
+ getChildren(node, bulkQuery).flatMap { children: Iterable <CPNode > ->
639
639
val d: IBulkQuery .Value <Iterable <CPNode >> = bulkQuery
640
- .map (children) { child: CPNode -> getDescendants(child, bulkQuery, true ) }
640
+ .flatMap (children) { child: CPNode -> getDescendants(child, bulkQuery, true ) }
641
641
.map { it.flatten() }
642
642
d
643
643
}
0 commit comments