def both[K, V1, V2]()

in storehaus-algebra/src/main/scala/com/twitter/storehaus/algebra/ReadableStoreAlgebra.scala [52:66]

• 15 lines of code
• 5 McCabe index (conditional complexity)

    def both[K, V1, V2](storeA: ReadableStore[K, V1], storeB: ReadableStore[K, V2]
    ): ReadableStore[K, CombinedStoreV[V1, V2]] = {
      new AbstractReadableStore[K, CombinedStoreV[V1, V2]] {
        override def get(k: K) = {
          val fetchA = storeA.get(k)
          val fetchB = storeB.get(k)
          Future.join(fetchA, fetchB).map{
            case (Some(lVal), Some(rVal)) => Some(Left((lVal, rVal)))
            case (Some(lVal), None) => Some(Right(Left(lVal)))
            case (None, Some(rVal)) => Some(Right(Right(rVal)))
            case (None, None) => None
          }
        }
      }
    }