Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^6: [OT] The interesting problem of comparing bit-strings. (More info.)

by BrowserUk (Patriarch)
on Mar 25, 2015 at 13:34 UTC ( [id://1121302]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    U64 nextBit( U64 **p, U8 *o ) {                  // p: pointer to poin
    +ter to current quad; o: pointer to current offset
        if( ++( *o ) == 64 ) {                       // increment the offs
    +et and detect transitions across quad boundaries.
    ...
        // Get the 'current' (unshifted) quad value; and the next
        return __shiftleft128( *( *p + 1 ), **p, *o );         // return t
    +he value from the higher location with *o bits from lo shifted in fro
    +m the right.
    }
    
  2. or download this
        mov    rax, QWORD PTR [r11+r9+16]
        mov    r8, QWORD PTR [r11+r9+8]
    
  3. or download this
    ; 41   :     while( hay < eHay ) {                        // until we 
    +reach the end of the haystack
    
    ...
    
    ; 61   :     }
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (5)
As of 2024-04-16 10:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found