@@ -92,7 +92,7 @@ class CLTree : ITree, IBulkTree {
9292 }
9393
9494 fun getSize (): Long {
95- return (nodesMap ? : return 0L ).calculateSize(store.newBulkQuery()).execute ()
95+ return (nodesMap ? : return 0L ).calculateSize(store.newBulkQuery()).executeQuery ()
9696 }
9797
9898 fun prefetchAll () {
@@ -315,43 +315,43 @@ class CLTree : ITree, IBulkTree {
315315 }
316316
317317 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 ()
319319 return children.map { it.id }
320320 }
321321
322322 override fun getDescendants (root : Long , includeSelf : Boolean ): Iterable <CLNode > {
323323 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) }
325325 }
326326
327327 override fun getDescendants (rootIds : Iterable <Long >, includeSelf : Boolean ): Iterable <CLNode > {
328328 val bulkQuery = store.newBulkQuery()
329329 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) }
332332 }
333333
334334 override fun getAncestors (nodeIds : Iterable <Long >, includeSelf : Boolean ): Set <Long > {
335335 val bulkQuery = store.newBulkQuery()
336336 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) } }
338338 val result = HashSet <Long >()
339- ancestors.execute ().forEach { result.addAll(it.map { it.id }) }
339+ ancestors.executeQuery ().forEach { result.addAll(it.map { it.id }) }
340340 return result
341341 }
342342
343343 override fun getChildren (parentId : Long , role : String? ): Iterable <Long > {
344344 checkChildRoleId(parentId, role)
345345 val parent = resolveElement(parentId)
346- val children = getChildren(parent!! , store.newBulkQuery()).execute ()
346+ val children = getChildren(parent!! , store.newBulkQuery()).executeQuery ()
347347 return children
348348 .filter { it.roleInParent == role }
349349 .map { it.id }
350350 }
351351
352352 override fun getChildRoles (sourceId : Long ): Iterable <String ?> {
353353 val parent = resolveElement(sourceId)
354- val children: Iterable <CPNode > = getChildren(parent!! , store.newBulkQuery()).execute ()
354+ val children: Iterable <CPNode > = getChildren(parent!! , store.newBulkQuery()).executeQuery ()
355355 return children.map { it.roleInParent }.distinct()
356356 }
357357
@@ -443,7 +443,7 @@ class CLTree : ITree, IBulkTree {
443443 override fun visitChanges (oldVersion : ITree , visitor : ITreeChangeVisitor ) {
444444 val bulkQuery = store.newBulkQuery()
445445 visitChanges(oldVersion, visitor, bulkQuery)
446- (bulkQuery as ? BulkQuery )?.process ()
446+ (bulkQuery as ? BulkQuery )?.executeQuery ()
447447 }
448448
449449 fun visitChanges (oldVersion : ITree , visitor : ITreeChangeVisitor , bulkQuery : IBulkQuery ) {
@@ -512,7 +512,7 @@ class CLTree : ITree, IBulkTree {
512512 }
513513 }
514514
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 ->
516516 val (oldChildrenList, newChildrenList) = childrenLists
517517 val oldChildren: MutableMap <String ?, MutableList <CPNode >> = HashMap ()
518518 val newChildren: MutableMap <String ?, MutableList <CPNode >> = HashMap ()
@@ -567,15 +567,15 @@ class CLTree : ITree, IBulkTree {
567567 }
568568
569569 fun resolveElement (id : Long ): CPNode ? {
570- return resolveElement(id, NonBulkQuery (store)).execute ()
570+ return resolveElement(id, NonBulkQuery (store)).executeQuery ()
571571 }
572572
573573 fun resolveElement (id : Long , bulkQuery : IBulkQuery ): IBulkQuery .Value <CPNode ?> {
574574 if (id == 0L ) {
575575 return bulkQuery.constant(null )
576576 }
577577 val hash = nodesMap!! .get(id, bulkQuery)
578- return hash.mapBulk {
578+ return hash.flatMap {
579579 if (it == null ) throw NodeNotFoundException (id)
580580 createElement(it, bulkQuery)
581581 }
@@ -587,24 +587,24 @@ class CLTree : ITree, IBulkTree {
587587 val b: IBulkQuery .Value <List <KVEntryReference <CPNode >>> = a.map { hashes: List <KVEntryReference <CPNode >? > ->
588588 hashes.mapIndexed { index, s -> s ? : throw NodeNotFoundException (ids[index]) }
589589 }
590- return b.mapBulk { hashes -> createElements(hashes, bulkQuery) }
590+ return b.flatMap { hashes -> createElements(hashes, bulkQuery) }
591591 }
592592
593593 fun createElement (hash : KVEntryReference <CPNode >? , query : IBulkQuery ): IBulkQuery .Value <CPNode ?> {
594594 return if (hash == null ) {
595595 query.constant(null )
596596 } else {
597- query[ hash]
597+ query.query( hash)
598598 }
599599 }
600600
601601 fun createElement (hash : KVEntryReference <CPNode >? ): CPNode ? {
602- return createElement(hash, NonBulkQuery (store)).execute ()
602+ return createElement(hash, NonBulkQuery (store)).executeQuery ()
603603 }
604604
605605 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!! }
608608 }
609609 }
610610
@@ -635,9 +635,9 @@ class CLTree : ITree, IBulkTree {
635635 getDescendants(node, bulkQuery, false )
636636 .map { descendants -> (sequenceOf(node) + descendants).asIterable() }
637637 } else {
638- getChildren(node, bulkQuery).mapBulk { children: Iterable <CPNode > ->
638+ getChildren(node, bulkQuery).flatMap { children: Iterable <CPNode > ->
639639 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 ) }
641641 .map { it.flatten() }
642642 d
643643 }
0 commit comments