Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2024-12-22 18:21:51 +01:00
Code Issues Packages Projects Releases Wiki Activity

Avoid raw get

Browse Source
This commit is contained in:
Erik Innocent 2023-04-07 15:27:46 -07:00
parent 138bb51997
commit 6ee0d2b7ac
1 changed files with 17 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
graph-feature-service/src/main/scala/com/twitter/graph_feature_service/worker/handlers/WorkerGetIntersectionHandler.scala
View File

@ -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(leftNeighborsOpt.get) leftNodeDegree = computeArraySize(leftNeighbors)
) )
} else if (leftNeighborsOpt.isEmpty) { case (None, Some(rightNeighbors)) =>
EmptyWorkerIntersectionValue.copy( EmptyWorkerIntersectionValue.copy(
rightNodeDegree = computeArraySize(rightNeighborsOpt.get) rightNodeDegree = computeArraySize(rightNeighbors)
) )
} else { case (Some(leftNeighbors), Some(rightNeighbors)) =>
IntersectionValueCalculator( IntersectionValueCalculator(
leftNeighborsOpt.get, leftNeighbors,
rightNeighborsOpt.get, rightNeighbors,
request.intersectionIdLimit) request.intersectionIdLimit
)
case _ =>
EmptyWorkerIntersectionValue
} }
} }
} }