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

Fibonacci Butt Sort

Name: Anonymous 2009-08-16 23:08

Let us discuss the various implementations of theFIBONACCI BUTT SORT.

Name: Anonymous 2009-11-14 23:31

That's good, I was kind of missing the buttsort.

Name: Anonymous 2009-11-14 23:33

i wouldn't mind /b/ share some foolproof an hero methods.

p.s. i don't have an ipod.

Name: Anonymous 2009-11-15 17:17

Hey /prog/.

Name: Anonymous 2009-11-23 23:56

>>153


^^^^ HAY EVERYONE LOOK AT THIS INTENSE FAILURE ^^^^^^[/b][/b][/b][/b][/b][/b]

Name: Anonymous 2009-11-24 5:21

BUTTSORT MY ANUS

Name: Anonymous 2009-11-24 5:25

>>165
That's kinda the point.

Name: Anonymous 2009-11-24 5:32

>>165
ANUSSORT MY BUTT

Name: Anonymous 2009-11-24 5:36

Anyone noticed this thread is not threadstopped? Because the same faggot that posted >>1 makes the spam!

Name: Anonymous 2009-11-24 5:36

>>168
wat. email: sage. where's that?

Name: Anonymous 2009-11-24 5:37

lol 4chan disabled email

Name: Anonymous 2009-11-24 5:41

test

Name: Anonymous 2009-11-24 5:41

>>168
Precisely.

Name: Anonymous 2009-11-24 5:42

Well, buttsorting an anus is a bit like sorting an AVL tree.

Name: Anonymous 2009-11-24 5:43

HAXUS THE EMAIL

Name: Anonymous 2009-11-24 5:44

FUCK the Haxus meme just got haxed.

Name: Anonymous 2009-11-24 6:33

h

Name: Anonymous 2009-11-24 6:59

>>173
Don't you hate the kind of trolls that troll a board simply by putting technical terms together? also every idiot that'll jump in and say "but I know how to sort AVL trees!" AVL trees do NOT get sorted. They are self balanced you you!

Name: Anonymous 2009-11-24 8:13

>>177
lol lol i trol u

Name: Anonymous 2009-11-24 8:20

>>177
How old are you 12? Its either that or you're clearly retarded either way. I'd rather be 5ft 6 than be as retarded as you.

Name: Anonymous 2009-11-24 10:13

>>177
Balancing involves sorting... they are just refering to being able to properly implement an AVL tree including the balancing (or sorting) aspects.

It's obvious to me, you must just have assburgers.

Name: Anonymous 2009-11-24 10:16

yea!

Name: Anonymous 2009-11-24 10:17

[newlineInjection]\n[/newlineInjection]

Name: Anonymous 2009-11-24 10:20

Name: Anonymous 2009-11-24 10:20

%0A%3C/span%3E%3Cspan%20class=

Name: Anonymous 2009-11-24 10:25

‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂

Name: Anonymous 2009-11-24 10:28

◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂
‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂‬◙◙◙◙◙◙◙◙◙◙◙‍╩╩╩╩⌐∂

Name: Anonymous 2009-11-24 10:29

Name: Anonymous 2009-11-24 10:35

TRUE TRUTH EXPERT

Name: Anonymous 2009-11-24 10:37

>>30
GHCi, version 6.10.4: http://www.haskell.org/ghc/  :? for help
Loading package ghc-prim ... linking ... done.
Loading package integer ... linking ... done.
Loading package base ... linking ... done.
[1 of 1] Compiling Main             ( fibs.hs, interpreted )

fibs.hs:1:11: Not in scope: `b'

fibs.hs:1:15: Not in scope: `i'

fibs.hs:1:30: Not in scope: `u'

fibs.hs:1:33: Not in scope: `o'
Failed, modules loaded: none.
Prelude>


WHAT?

Name: Anonymous 2009-11-24 11:08

YET ANOTHER HASKELL FAILUER

Name: Anonymous 2009-11-25 1:01

>>177
AVL trees do NOT get sorted. They are self balanced you you!

   joke
  _____
 /     \
/  you  \

Anii do not need buttsorting, they are self buttsorted

Name: Anonymous 2009-11-25 1:06

>>191
win

Name: Anonymous 2009-11-25 12:29

There is always a cheek to the left, one anus, and a cheek to the right, so I guess butttrees are naturally quite well-balanced.

Name: Anonymous 2009-11-25 16:08

Left cheek anus right cheek, arranged in an infinite set of Penrose tiles.

Name: Anonymous 2009-11-26 5:32


(defun compose (&rest fns)
  (if fns
      (let ((fn1 (car (last fns)))
        (fns (butlast fns)))
    #'(lambda (&rest args)
        (reduce #'funcall fns
            :from-end t
            :initial-value (apply fn1 args))))
    #'identity))

(defun cycle-fns (&rest functions)
       (let* ((n (length functions))
          (p 0)
          (array (loop
                with a = (make-array (list n)
                         :element-type 'function
                         :initial-element #'identity)
                for function in functions
                for i from 0 to (1- n)
                do (setf (aref a i) function)
                finally (return a))))
         (lambda (&rest args)
           (prog1
           (apply (aref array p) args)
         (setf p (mod (1+ p) n))))))

(defun bbcode (tag)
  (lambda (i)
    (format nil "[~A]~A[/~A]" tag i tag)))

(defun fibonacci-buttsort (string)
   (funcall (compose (bbcode "b") (bbcode "i"))
        (with-output-to-string (s)
          (mapc (lambda (x) (princ x s))
            (map 'list (cycle-fns (bbcode "o") (bbcode "u"))
             string)))))


EXPERT ARTIST

Name: Anonymous 2009-11-26 5:40

>>195
Come to think of it, i could get rid of (map 'list ...) by composing (princ ... s) with (cycle-fns ...)

Name: Anonymous 2009-11-26 5:52

>>195
Your cycle-fns function seems unnecessarily complicated, why not just use a circular list + pop or something like:

(let ((ht (make-hash-table :test #'equal)))
  (defun cycle (&rest args)
    (symbol-macrolet ((h (gethash args ht)))
      (unless h (setf h args))
      (pop h))))

Name: Anonymous 2009-11-26 9:05

>>197
stop using symbol-macrolet like a C preprocessor.

Name: 197 2009-11-26 9:26

>>198
AFAIK, the way I'm using it is perfectly valid, and is one of the intended usages of the SYMBOL-MACROLET special operator. In that example, h represents the place of the arguments list in the hashtable, when used directly, you use the accessor to obtain the value, when used during SETF, you write to that place, so the symbol h represents a place within the hashtable. CL has things like WITH-SLOTS, which does the exact same thing - abstracts a place which points to a location within some object, and treats it like a symbol, which is perfectly fine usage. What is your argument against this?

Name: Anonymous 2009-11-26 13:57

buttsorted binary dicks tree

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List