module LinearScan.Prelude0 where


import Debug.Trace (trace, traceShow, traceShowId)
import qualified Prelude
import qualified Data.IntMap
import qualified Data.IntSet
import qualified Data.List
import qualified Data.Ord
import qualified Data.Functor.Identity
import qualified Hask.Utils


flip :: (a1 -> a2 -> a3) -> a2 -> a1 -> a3
flip f y x =
  f x y

const :: a2 -> a1 -> a2
const x x0 =
  x

apply :: (a1 -> a2) -> a1 -> a2
apply f x =
  f x

lebf :: (a1 -> Prelude.Int) -> a1 -> a1 -> Prelude.Bool
lebf f n m =
  (Prelude.<=) (f n) (f m)