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

Hey /prog/

Name: Anonymous 2011-02-03 19:14

Do you like my list comparison function?

#define NEXT(x) (p = (p)->next)
int compare (struct int_list *p, struct int_list *q) {
     for(; p && q; NEXT(p), NEXT(q));
    
     return p ? q ? p->value < q->value ? -1 : q->value < p->value ? 1 : 0 : 1 : q ? -1 : 0;
}
#undef NEXT

Name: Anonymous 2011-02-03 20:16

return (p?
          (q?
             (p->value < q->value?
                                   -1
                                  :(q->value < p->value? 1 : 0))
             :1)
         :(q? -1 : 0));

=>

return !p? (q? -1 : 0) :
            q? !(p->value < q->value)? !(p->value > q->value)?
            0: 1: -1: 1;

=>

return (p && q)? !(p->value > q->value)? !(p->value < q->value)?
                     0: -1: 1:
                 !p? !q?
                     0: -1: 1;


Also, your code doesn't work.

Name: Anonymous 2011-02-03 21:16

yes

Name: Anonymous 2011-02-03 21:22

And have you tested this "list comparison" function for correctness?

Name: Anonymous 2011-02-03 21:36

>>4
This is /prog/, I never test code when I post it here!

Name: Anonymous 2011-02-04 5:56


#define NEXT(x) (p = (p)->next)


stopped reading there.

Name: Anonymous 2011-02-04 8:20

>>2
What is this revolting vomitous mess of random input?

Name: Anonymous 2011-02-04 13:19

what is the purpose of this code? give a segfault?

Name: Anonymous 2011-02-04 15:33

lol fail

Name: Anonymous 2011-02-04 15:42

>>1,7
Same person
>>2-6,8-9,11-
Same person

Name: Anonymous 2011-02-04 15:48

>>1-10000,999999,1000000
samefag

>>999
nice dubs!

Name: Anonymous 2011-02-04 15:48

>>11
nice dubs!

Name: Anonymous 2011-02-04 16:48

>>14
Nice dubs6!

Name: Anonymous 2011-02-04 16:52

>>11-13
Nice dumbs.

Name: Anonymous 2011-02-04 19:36

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