Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^14: 64-bit *nix/gcc expertise required

by Anonymous Monk
on Dec 26, 2010 at 09:04 UTC ( #879196=note: print w/ replies, xml ) Need Help??


in reply to Re^13: 64-bit *nix/gcc expertise required
in thread 64-bit *nix/gcc expertise required (THIS IS NOT OFF TOPIC!)

You see some conflict between understanding his "style", and finding the code it produces incomprehensible.

Perhaps English isn't your first language?


Comment on Re^14: 64-bit *nix/gcc expertise required
Re^15: 64-bit *nix/gcc expertise required
by ysth (Canon) on Dec 26, 2010 at 23:35 UTC
    In context (ikegami being certain he'd solved the Understanderer's problem, the Understanderer being equally certain he hadn't), it was clearly a claim that the "incomprehensible" was Understood.
    --
    A math joke: r = | |csc(θ)|+|sec(θ)|-||csc(θ)|-|sec(θ)|| |
    Online Fortune Cookie Search

      Now that is truly incomprehensible.

      Why not just give ikegami a cuddle. He might just respond in kind.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://879196]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (8)
As of 2014-10-23 02:07 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (123 votes), past polls