Search results

The Monad.Reader/Discuss Issue11/FingerTreeIMap
data Key k v = NoKey | Key k v instance Eq k => Eq (Key k v) where

2 KB (315 words) - 15:19, 6 February 2021
99 questions/Solutions/88
depthfirst (v,e) n | [x|x<-v,x==n] == [] = []

1 KB (123 words) - 03:51, 10 January 2017
99 questions/Solutions/89
dfsbipartite (v,e) ((nv, 0):stack) odd even | [x|x<-v,x==nv] == [] = dfsbipartite (v, e) stack odd even

1 KB (163 words) - 03:51, 10 January 2017
99 questions/Solutions/87
depthfirst (v,e) n | [x|x<-v,x==n] == [] = []

714 bytes (91 words) - 03:50, 10 January 2017
Recursion in a monad
f n = do v <- getLine return $! v : vs

986 bytes (142 words) - 15:18, 6 February 2021
99 questions/Solutions/80
adjToGraph (Adj ((v, a):vs)) = Graph (v : xs) ((a >>= f) ++ ys) f x = if (v, x) `elem` ys || (x, v) `elem` ys

2 KB (245 words) - 03:48, 10 January 2017
Multi-parameter type class
class Monad m => VarMonad m v where new :: a -> m (v a)

1 KB (198 words) - 22:52, 21 July 2021
99 questions/Solutions/94
adjToGraph (Adj ((v, a):vs)) = Graph (v : xs) ((a >>= f) ++ ys) f x = if (v, x) `elem` ys || (x, v) `elem` ys

2 KB (388 words) - 03:47, 10 January 2017
Ru/GHC/Class Instance Extensions
class Map m k v where empty :: m k v

3 KB (170 words) - 23:05, 29 June 2021
99 questions/Solutions/64
In this layout strategy, the position of a node v is obtained by the following two rules: * x(v) is equal to the position of the node v in the inorder sequence

2 KB (337 words) - 03:41, 10 January 2017
99 questions/Solutions/92
koch ((v, us):vs) eused vused vplan = koch vs eused' (vn:vused) ((v, vn):vplan)

3 KB (420 words) - 22:52, 7 June 2017
Unamb
...<hask>unamb u v</hask> is the more terminating of <hask>u</hask> and <hask>v</hask>. ...u v</hask> becomes available when the earlier of <hask>u</hask> and <hask>v</hask> does.

2 KB (356 words) - 21:36, 4 February 2014
A new list type
foldr _ v (End) = v foldr f v (Node _ x xs) = f x (foldr f v xs)

3 KB (587 words) - 15:19, 6 February 2021
Stateful nondeterminism
...in foldl (\(newt,sofar) (v,s) -> let (t'',lst) = runSuperState (f v) s newt

1 KB (169 words) - 05:31, 9 March 2021
Diagrams/Dev/Fixpoint
<code>Transform</code>, <code>V</code>. type Context b v m = Style v ::: Name ::: SubMap b v m ::: ()

7 KB (1,077 words) - 14:56, 12 June 2014
99 questions/Solutions/62B
atLevel (Branch v l r) n | n == 1 = [v]

741 bytes (125 words) - 13:40, 25 December 2016
Diagrams/FAQ
=== Couldn't match type `V (Point R2)' with `R2' === ...[http://projects.haskell.org/diagrams/doc/manual.html#couldn-t-match-type-v-p2-with-r2 the user manual].

958 bytes (158 words) - 03:41, 29 January 2014
Action
search marks (v:vs) = readSTArray marks v >>= \ visited -> writeSTArray marks v True >>

3 KB (428 words) - 04:08, 12 April 2024
LensBeginnersCheatsheet
|<code>at :: Ord k => k -> Lens' (Map k v) (Maybe v)</code> |rowspan="3" valign="top" |<code>Just v</code> -> value is present; <code>Nothing</code> -> value is absent

5 KB (742 words) - 19:22, 22 May 2022
IO入門編
...ションは普通に実行され、<code>v <- x</code>となっている行ではアクション<code>x</code>を実行し、結果を変数<code>v</code>に割り当てます。

7 KB (299 words) - 11:39, 22 October 2022
Denotative
search marks (v:vs) = readSTArray marks v >>= \ visited -> writeSTArray marks v True >>

4 KB (488 words) - 04:24, 5 April 2024
Yhc/Javascript/Programmers guide/EchoCPS2 demo source
romdec v = let rom = (catchJS ((show . fromRoman) v) (\_ -> ""))

4 KB (559 words) - 15:17, 6 February 2021
Monomorphism by annotation of type variables
let v = unsafeLocalState $ newIORef undefined in do writeIORef v ("0" :: [Char])

3 KB (459 words) - 08:33, 18 August 2021
99 questions/Solutions/84
adjacent g v = map fst (g!v) prim' t r mst = let e@(c,u',v') = minimum

1 KB (189 words) - 03:50, 10 January 2017
Euler problems/61 to 70
where gather [xs] (v:vs) = let v' = match xs v

6 KB (979 words) - 10:20, 18 May 2022
Diagrams/Dev/Transformations
...formation'' on a vector space <math>V</math> is a function <math>f : V \to V</math> satisfying * <math>f(kv) = k f(v)</math>

14 KB (2,245 words) - 03:01, 11 April 2015
Cont computations as question-answering boxes
.../code> this question: ''if <code>f</code> were applied to your value <code>v</code> (of type <code>t</code>) how would the resulting box respond to the x >>= f = Cont (\q -> runCont x (\v -> runCont (f v) q))

7 KB (1,253 words) - 23:34, 25 June 2021
Ro/Rodin/Alte exemple
fie v[x]=0; {citeste y;fie v[x]=y;};

1 KB (212 words) - 05:06, 12 July 2021
QuickCheck / GADT
Dyn t v -> RInt -> u == v

8 KB (1,072 words) - 18:32, 16 January 2017
Gtk2Hs/Tutorials/TreeView
v <- Model.listStoreGetValue list s putStrLn $ "selected " ++ v

2 KB (280 words) - 00:46, 9 April 2021
Let's Play Free Games
ub - means "V. Alecsandri" University of Bacau <br>

629 bytes (98 words) - 04:43, 27 February 2019
Partibles for composing monads
mcommute g = \ v u -> g u v mcommute' m = \ v -> liftM ($ v) m

4 KB (691 words) - 08:14, 12 June 2023
MultiCase
Left v, Right v -> v

3 KB (470 words) - 23:09, 11 July 2021
Tiny Identifier Dictionary
| v | v

2 KB (285 words) - 01:34, 14 July 2021
99 questions/Solutions/86
color ((v, e):xs) ys n = if any (\x -> (x, n) `elem` ys) e else color xs ((v, n) : ys) n

2 KB (325 words) - 03:50, 10 January 2017
UrlDisp
cgiAddHeader n v = lift $ cgiAddHeader n v v <- lift ask >>= \c -> liftIO (quickQuery' c queryText [])

4 KB (592 words) - 21:17, 29 June 2021
99 questions/Solutions/85
v = map fst a f p = let n = zip v p

2 KB (287 words) - 03:50, 10 January 2017
Functional dependencies vs. type families
instance (...) => C (FilterParam a) v (FilterResult v) where type Input (FilterParam a) (FilterResult v) = v

6 KB (936 words) - 20:35, 27 January 2014
Heterogenous collections
objectString (IntObject v) = show v objectString (StringObject v) = v

5 KB (863 words) - 11:44, 22 August 2021
Multiplate
> buildDecl (v := e) = (:=) <$> pure v <*> expr child e ...he case of <code>v</code> in <code>v := e</code>, we simply use <code>pure v</code>.

7 KB (1,049 words) - 07:41, 3 March 2022
Blog articles/Libraries
...-revolution-episode-v-the-deb-strikes-back/ The lambda revolution, Episode V, the deb strikes back]

2 KB (179 words) - 09:01, 13 November 2013
99 questions/Solutions/39
snap v origin step = if r==0 then v else v+(step-r) where r = rem (v-origin) step -- NB: origin <= v ; else use MOD

5 KB (696 words) - 19:46, 18 January 2014
Functional dependencies
<haskell>v = extract ('x', 3)</haskell> and it will infer the type <haskell>v :: Char</haskell>

4 KB (706 words) - 22:41, 21 July 2021
Plainly partible
parts (Fresh g u) = [ Fresh g v | v <- parts u ] fresh (Fresh g u) = [ g v | v <- parts u ]

11 KB (1,656 words) - 22:33, 4 July 2022
Diagrams/Dev/Migrate1.3
...Basically this means whenever you saw <code>v</code>, replace it by <code>v n</code>. So: * <code>QDiagram b v m -> QDiagram b v n m</code>

11 KB (1,707 words) - 01:06, 1 May 2015
Research papers/Authors
==V==

8 KB (1,251 words) - 05:43, 1 September 2022
New monads/MonadRandom
liftState t = do v <- get let (x, v') = t v

6 KB (894 words) - 13:41, 2 April 2019
Foldable and Traversable
data Supply s v = Supply { unSupply :: [s] -> ([s],v) } fmap f av = Supply (\l -> let (l',v) = unSupply av l in (l',f v))

11 KB (1,895 words) - 19:00, 18 May 2020
99 questions/Solutions/70
P v >>= f = P $ \ s -> do (x, s') <- v s

7 KB (1,025 words) - 02:14, 23 July 2021
Cookbook/Interactivity
...tp://haskell.org/ghc/docs/latest/html/libraries/base-4.12.0.0/Prelude.html#v%3AputStr putStr] ...tp://haskell.org/ghc/docs/latest/html/libraries/base-4.12.0.0/Prelude.html#v%3AputStrLn putStrLn]

2 KB (218 words) - 21:07, 6 January 2019

Search results

Navigation menu

Search