mirror of
https://github.com/twitter/the-algorithm.git
synced 2024-12-22 18:21:51 +01:00
Merge 6ee0d2b7ac
into fb54d8b549
This commit is contained in:
commit
6cbdbc9632
@ -75,21 +75,23 @@ class WorkerGetIntersectionHandler @Inject() (
|
|||||||
val rightNeighborsOpt =
|
val rightNeighborsOpt =
|
||||||
rightEdgeMap.get(featureType.rightEdgeType).flatMap(_.get(candidateId))
|
rightEdgeMap.get(featureType.rightEdgeType).flatMap(_.get(candidateId))
|
||||||
|
|
||||||
if (leftNeighborsOpt.isEmpty && rightNeighborsOpt.isEmpty) {
|
(leftNeighborsOpt, rightNeighborsOpt) match {
|
||||||
EmptyWorkerIntersectionValue
|
case (Some(leftNeighbors), None) =>
|
||||||
} else if (rightNeighborsOpt.isEmpty) {
|
EmptyWorkerIntersectionValue.copy(
|
||||||
EmptyWorkerIntersectionValue.copy(
|
leftNodeDegree = computeArraySize(leftNeighbors)
|
||||||
leftNodeDegree = computeArraySize(leftNeighborsOpt.get)
|
)
|
||||||
)
|
case (None, Some(rightNeighbors)) =>
|
||||||
} else if (leftNeighborsOpt.isEmpty) {
|
EmptyWorkerIntersectionValue.copy(
|
||||||
EmptyWorkerIntersectionValue.copy(
|
rightNodeDegree = computeArraySize(rightNeighbors)
|
||||||
rightNodeDegree = computeArraySize(rightNeighborsOpt.get)
|
)
|
||||||
)
|
case (Some(leftNeighbors), Some(rightNeighbors)) =>
|
||||||
} else {
|
IntersectionValueCalculator(
|
||||||
IntersectionValueCalculator(
|
leftNeighbors,
|
||||||
leftNeighborsOpt.get,
|
rightNeighbors,
|
||||||
rightNeighborsOpt.get,
|
request.intersectionIdLimit
|
||||||
request.intersectionIdLimit)
|
)
|
||||||
|
case _ =>
|
||||||
|
EmptyWorkerIntersectionValue
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user