anchor.diff:                      |> Seq.filter (fun (q, _) -> p = q)
                       |> Seq.map (fun (_, cs) -> cs)
                       |> Set.unionMany)
  -
   
               for contrib in contributions do
                 let core =
  
positive.code:                 }
                  let node = Node (p, cs, rv)
                  Result.Ok <| step context resolver nextState (node :: path)
                | None -> Result.Error NoPrivateSolution
            })
  
          let solutions =
            results
            |> AsyncSeq.collect(fun x ->
              match x with
              | Result.Ok next -> next
              | _ -> AsyncSeq.empty
            )
  
          let errors =
  
negative.code: 
  
    let pruneSelections (selections: Map<PackageIdentifier, ResolvedVersion * Solution>) (deps: Set<Dependency>) =
      let rec loop (visited: Set<PackageIdentifier>) (deps: Set<Dependency>) : seq<PackageIdentifier * ResolvedVersion> = seq {
        let notVisited =
          deps
  