Paths.hs

-- Note: this is an automatically generated file. Do not edit.

-- | The TermGraph : TypeGraph conformance relation: path erasure (a subterm position maps to the subtype position of its type) plus node typing, partial on the computation fragment.

module Hydra.Validate.Paths where

import qualified Hydra.Ast as Ast
import qualified Hydra.Coders as Coders
import qualified Hydra.Core as Core
import qualified Hydra.Docs as Docs
import qualified Hydra.Error.Checking as Checking
import qualified Hydra.Error.Core as ErrorCore
import qualified Hydra.Error.File as ErrorFile
import qualified Hydra.Error.Packaging as ErrorPackaging
import qualified Hydra.Error.System as ErrorSystem
import qualified Hydra.Errors as Errors
import qualified Hydra.File as File
import qualified Hydra.Graph as Graph
import qualified Hydra.Json.Model as Model
import qualified Hydra.Overlay.Haskell.Lib.Lists as Lists
import qualified Hydra.Overlay.Haskell.Lib.Logic as Logic
import qualified Hydra.Overlay.Haskell.Lib.Optionals as Optionals
import qualified Hydra.Overlay.Haskell.Lib.Pairs as Pairs
import qualified Hydra.Packaging as Packaging
import qualified Hydra.Parsing as Parsing
import qualified Hydra.Paths as Paths
import qualified Hydra.Query as Query
import qualified Hydra.Regex as Regex
import qualified Hydra.Relational as Relational
import qualified Hydra.System as System
import qualified Hydra.Tabular as Tabular
import qualified Hydra.Testing as Testing
import qualified Hydra.Time as Time
import qualified Hydra.Topology as Topology
import qualified Hydra.Typed as Typed
import qualified Hydra.Typing as Typing
import qualified Hydra.Util as Util
import qualified Hydra.Validation as Validation
import qualified Hydra.Variants as Variants
import Prelude hiding  (Enum, Ordering, decodeFloat, encodeFloat, fail, lines, map, pure, sum, unlines)
import qualified Data.Scientific as Sci
import Data.Void

-- | Erase a subterm path to the subtype path of its type, if wholly within the data fragment
eraseSubtermPath :: Paths.SubtermPath -> Maybe Paths.SubtypePath
eraseSubtermPath path =

      let steps = Paths.unSubtermPath path
          go =
                  \acc -> \step -> Optionals.match acc Nothing (\stateP ->
                    let out = Pairs.first stateP
                        pendingEntry = Pairs.second stateP
                    in (Logic.ifElse pendingEntry (case step of
                      Paths.SubtermStepPairFirst -> Just (Lists.concat2 out [
                        Paths.SubtypeStepMapKeys], False)
                      Paths.SubtermStepPairSecond -> Just (Lists.concat2 out [
                        Paths.SubtypeStepMapValues], False)
                      _ -> Nothing) (case step of
                      Paths.SubtermStepMapEntry _ -> Just (out, True)
                      _ -> Optionals.map (\st -> (Lists.concat2 out [
                        st], False)) (eraseSubtermStep step))))
          result = Lists.foldl go (Just ([], False)) steps
      in (Optionals.bind result (\stateP -> Logic.ifElse (Pairs.second stateP) Nothing (Just (Paths.SubtypePath (Pairs.first stateP)))))

-- | The subtype-side analog of a subterm step on the data fragment, or nothing on the computation fragment
eraseSubtermStep :: Paths.SubtermStep -> Maybe Paths.SubtypeStep
eraseSubtermStep step =
    case step of
      Paths.SubtermStepListElement _ -> Just Paths.SubtypeStepListElement
      Paths.SubtermStepSetElement _ -> Just Paths.SubtypeStepSetElement
      Paths.SubtermStepOptionalGiven -> Just Paths.SubtypeStepOptionalElement
      Paths.SubtermStepInjectField v0 -> Just (Paths.SubtypeStepUnionField v0)
      Paths.SubtermStepRecordField v0 -> Just (Paths.SubtypeStepRecordField v0)
      _ -> Nothing