Search results

Page title matches

• Ternary operator
  With a bit of work, we can define a ternary conditional operator in
  847 bytes (121 words) - 23:08, 24 July 2021
• Infix operator
  Putting parentheses around an infix operator converts it into a prefix function: * [[section of an infix operator]]
  1 KB (159 words) - 23:45, 25 June 2021
• Unary operator
  A unary operator is an operator with one parameter. Haskell only has one built-in unary operator, namely the negation operator <hask>-</hask>.
  3 KB (397 words) - 20:54, 24 February 2024
• Relative infix operator precedences
  This would force the use of parentheses in cases where the operator name designers
  1 KB (141 words) - 16:48, 9 April 2009
• Cum pot afla cu ce date opereaza un operator ?
  367 bytes (52 words) - 09:35, 8 February 2010
• Section of an infix operator
  ...tuitively takes an argument and puts it on the "missing" side of the infix operator. Note: as an exception, the "-" (subtraction) operator cannot do a right section, because that would be interpreted as unary negat
  2 KB (233 words) - 17:58, 31 March 2017
• Cu functiile foldl, foldr, map putem sa aplicam un operator utilizator pe o lista ?
  Da. Dar el ar trebui sa fie un operator unar. Puteti aplica si un operator binar la nevoie , in cazul cand , probabil doriti sa obtineti o lista de fu
  157 bytes (29 words) - 15:37, 10 June 2009

Page text matches

• Cu functiile foldl, foldr, map putem sa aplicam un operator utilizator pe o lista ?
  Da. Dar el ar trebui sa fie un operator unar. Puteti aplica si un operator binar la nevoie , in cazul cand , probabil doriti sa obtineti o lista de fu
  157 bytes (29 words) - 15:37, 10 June 2009
• Haskell Quiz/Numeric Maze/Solution Ninju
  data Operator = AddTwo | Double | Halve apply :: Operator -> Integer -> Integer
  1 KB (161 words) - 08:23, 27 November 2009
• La ce serveste apostroful invers (`) ?
  Apostroful invers (`) transforma o functie cu doua argumente intr-un operator infixat. Functia se poate folosi acum si ca un operator: 1 `g` 2
  1,008 bytes (147 words) - 20:38, 18 October 2009
• Unary operator
  A unary operator is an operator with one parameter. Haskell only has one built-in unary operator, namely the negation operator <hask>-</hask>.
  3 KB (397 words) - 20:54, 24 February 2024
• Function composition
  Mathematically, this is most often represented by the <math>\circ</math> operator, where <math>f\circ g</math> (often read as ''f of g'') is the composition In haskell, the type of the <hask>.</hask> operator is <math>(\beta \to \gamma) \to (\alpha \to \beta) \to \alpha \to \gamma</m
  1 KB (233 words) - 23:59, 10 October 2006
• Section of an infix operator
  ...tuitively takes an argument and puts it on the "missing" side of the infix operator. Note: as an exception, the "-" (subtraction) operator cannot do a right section, because that would be interpreted as unary negat
  2 KB (233 words) - 17:58, 31 March 2017
• 99 questions/Solutions/47
  ...ion in the more natural way, as in the example: A and (A or not B). Define operator precedence as usual; i.e. as in Java. Java operator precedence (descending) as far as I could fathom it:
  682 bytes (109 words) - 19:50, 18 January 2014
• Exista o functie cons ca in LISP ?
  Da, numai ca nu se numeste 'cons'. Si este un operator binar infixat - dar in esenta este tot o functie. Despre acest operator se spune ca ar fi provocat mari discutii in comitetul Haskell. Unii vorbito
  846 bytes (132 words) - 19:05, 10 June 2009
• Infix operators
  #redirect [[Infix operator]]
  63 bytes (8 words) - 06:47, 8 June 2023
• $
  ...s the function on its left to the value on its right. At first glance this operator appears redundant, since ordinary application <hask>(f x)</hask> means the ...askell splice and not the infix operator described above. To get the infix operator be sure to separate the $ from the right argument by at least one white spa
  1 KB (208 words) - 00:09, 1 October 2016
• Cum sa scriu impartirea numerelor intregi ?
  ...e apostrofuri inverse si cu minuscula. Primele il fac sa se comporte ca un operator infixat. Nu uitati ca numele functiilor se scriu in Haskell totdeauna cu mi ...apostrofului invers este sa transforme un nume de functie intr-un nume de operator infixat. Deci scrieti:
  2 KB (271 words) - 15:24, 13 March 2011
• De ce numim unii operatori supraincarcati ?
  Acelasi operator se foloseste la doua trei
  287 bytes (45 words) - 09:30, 8 February 2010
• Unary minus
  #REDIRECT [[Unary operator]]
  83 bytes (10 words) - 12:30, 8 June 2023
• Associative operation
  ...ession containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as
  358 bytes (58 words) - 13:51, 19 April 2011
• Diagrams/Dev/Migrate1.0
  === <code>&</code> operator renamed to <code>^&</code> === ...iagrams-0.7 (for constructing literal points and vectors) clashes with the operator of the same name from <code>lens</code>. Thus <code>&</code> has been rena
  2 KB (336 words) - 18:41, 18 February 2014
• Use of infix operators
  ...mail/haskell-cafe/2006-October/018884.html deriving precedences from infix operator characters]
  375 bytes (47 words) - 14:54, 19 March 2007
• DDC/DestructiveUpdate
  Values can be updated with the <hask>(:=)</hask> operator, which copies its second argument over its first. The structure of algebraic data can be modified with the <hask>(#=)</hask> operator. This replaces the constructor at a particular node with a new one.
  3 KB (430 words) - 00:46, 24 February 2018
• Cum definim asocierea si prioritatea operatorilor ?
  ...ix''' urmat de '''numarul ''' nivelului de prioritate urmat de simbolul '''operator'''ului.
  502 bytes (62 words) - 05:43, 31 May 2009
• 99 questions/Solutions/3
  This is (almost) the infix operator !! in Prelude, which is defined as: Or without using the infix operator:
  2 KB (298 words) - 02:32, 15 June 2016
• List notation
  ...n easily mix elements and lists into a list by appending the corresponding operator in each line: ...ingleton list with a [[Section of an infix operator|section]] of the colon operator: <haskell>(:[]) :: a -> [a]</haskell>.
  2 KB (312 words) - 17:33, 10 January 2014

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