Search results

Page title matches

• Es/Librerias y Herramientas/Estructuras de Datos
  {{Es/Traducción en progreso|titulo=Librerias y Herramientas/Estructuras de Datos}} == Librerias y herramientas para Estructuras de datos en Haskell ==
  10 KB (1,459 words) - 19:29, 15 August 2019

Page text matches

• Unix tools/yes
  A simple utility to repeatedly print <code>"y"</code> to standard output. main = let y = putStrLn "y" >> y in y
  472 bytes (67 words) - 03:24, 26 April 2021
• 99 questions/Solutions/14
  and here is the proof that <hask>((.) <$> (:) <*> (:)) = (\y z -> y:y:z)</hask>: \y -> (\x -> (.) (x:)) y (y:) = -- definition of (<*>) for functions
  2 KB (220 words) - 20:45, 28 December 2014
• 99 questions/Solutions/32
  gcd' 0 y = y gcd' x y = gcd' (y `mod` x) x
  777 bytes (117 words) - 19:42, 18 January 2014
• Floyd's cycle-finding algorithm
  where fCycle (x:xs) (_:y:ys) | x == y = fStart xxs xs
  950 bytes (133 words) - 00:39, 5 February 2019
• Uniplate
  variables (Add x y) = variables x ++ variables y variables (Sub x y) = variables x ++ variables y
  2 KB (315 words) - 08:34, 12 May 2016
• Nhc98
  uncommon x y=common (finalsort (x++y)) common (x:y:zs)
  857 bytes (148 words) - 04:14, 18 June 2021
• RodinV08-Package1
  { fie y 2; fie x x-(fie y 1);
  3 KB (276 words) - 15:17, 6 February 2021
• 99 questions/Solutions/9
  getReps (y:ys) | y == x = let (f,r) = getReps ys in (y:f, r)
  2 KB (347 words) - 21:03, 20 December 2018
• Infix expressions
  data Infix f y = f :- y x -:f:- y = x `f` y
  2 KB (240 words) - 23:49, 18 April 2021
• Ternary operator
  Prelude.False ? (_ : y) = y False ? (_ :? y) = y
  847 bytes (121 words) - 23:08, 24 July 2021
• Idiom brackets
  f <$> x <*> y Since f is not a pure function, it's f :: x -> y -> m c. The correct form would be
  2 KB (365 words) - 18:50, 19 September 2017
• 99 questions/Solutions/91
  knightMoves n (x, y) = filter (onBoard n) [(x+2, y+1), (x+2, y-1), (x+1, y+2), (x+1, y-2),
  3 KB (449 words) - 03:45, 10 January 2017
• Untypeable Haskell 98
  g y = bind x y g y = bind x y
  772 bytes (147 words) - 15:19, 6 February 2021
• 99 questions/Solutions/57
  add x t@(Branch y l r) = case compare x y of LT -> Branch y (add x l) r
  741 bytes (117 words) - 22:03, 23 April 2021
• 99 questions/Solutions/65
  layoutAux x y sep Empty = Empty layoutAux x y sep (Branch a l r) =
  2 KB (299 words) - 03:42, 10 January 2017
• 99 questions/Solutions/89
  adjacent = [x | (x,y)<-e,y==nv] ++ [x | (y,x)<-e,y==nv] adjacent = [x | (x,y)<-e,y==nv] ++ [x | (y,x)<-e,y==nv]
  1 KB (163 words) - 03:51, 10 January 2017
• 99 questions/Solutions/64
  * y(v) is equal to the depth of the node v in the tree where layoutAux x y Empty = (Empty, x)
  2 KB (337 words) - 03:41, 10 January 2017
• 99 questions/Solutions/40
  filter (\(x,y) -> isPrime x && isPrime y) $ goldbach n = head [(x,y) | x <- pr, y <- pr, x+y==n]
  1 KB (226 words) - 19:47, 18 January 2014
• 99 questions/Solutions/13
  helper x (y@(a,b):ys) | otherwise = (1,x):y:ys
  3 KB (381 words) - 02:13, 5 March 2019
• IO入門編
  .../code>がIOアクションなら、<code>(x >> y)</code>は<code>x</code>を実行し、結果を破棄し、そのあと<code>y</code>を実行してその結果を返します。 x >> y = x >>= const y
  7 KB (299 words) - 11:39, 22 October 2022

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)