rename functions
Dependencies
- [2]
CMHGXE7Yconcise implementation (type theoretically and computationally slightly worse) - [3]
VLK55FT2initial implementation of crystal operators
Change contents
- replacement in Data/Crystal.idr at line 8
e' : Nat -> Nat -> Orderinge' i j =-- U_q(\mathcal{g}) q->0 limit-- idk about superalgebra case--todo: prove braiding relation--todo: prove that we change i -> i+1paren : Nat -> Nat -> Orderingparen i j = - replacement in Data/Crystal.idr at line 19
f' : Nat -> Nat -> Orderingf' i = contra . e' iscan : Ordering -> Nat -> Maybe Natscan LT Z = Nothingscan LT (S x) = Just xscan EQ x = Just $ xscan GT x = Just $ S $ x(+) : Ordering -> Nat -> Maybe NatLT + Z = NothingLT + (S x) = Just xEQ + x = Just $ xGT + x = Just $ S $ x - replacement in Data/Crystal.idr at line 25
scanner : (Maybe $ Fin n, Nat) -> (Ordering, Fin n) -> (Maybe $ Fin n, Nat)scanner (x, y) (w, z) with (scan w y)scan : (Maybe $ Fin n, Nat) -> (Ordering, Fin n) -> (Maybe $ Fin n, Nat)scan (x, y) (w, z) with (w + y) - replacement in Data/Crystal.idr at line 30
fi : {n : Nat} -> Vect n Ordering -> Maybe $ Fin nfi a = fst $ foldl scanner (Nothing, Z) $ zip a $ allFins nargmin : {n : Nat} -> Vect n Ordering -> Maybe $ Fin nargmin a = fst $ foldl scan (Nothing, Z) $ zip a $ allFins n - replacement in Data/Crystal.idr at line 35
e i x = pure $ replaceAt (complement !(fi $ e' i <$> reverse x)) i xe i x = pure $ replaceAt (complement !(argmin $ paren i <$> reverse x)) i x - replacement in Data/Crystal.idr at line 39
f i x = pure $ replaceAt !(fi $ f' i <$> x) (S i) x[2.598]f i x = pure $ replaceAt !(argmin $ (contra . paren i) <$> x) (S i) x