Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I don't agree with the tables idea, because I was trying it and realized that even though "BA" in ASCII would contain 5 consecutive 0's for 'B' and 5 consecutive 0's for 'A', they will not add together for 10 consecutive 0's. As a matter of fact, there would be 5 consecutive 0's maximum. (This was in reference to a simple "counting bits in a table idea." Chris Dodd has since expounded on how a table could be used accurately.) </p> <p>I would use an algorithm like this: </p> <pre><code>#include &lt;iostream&gt; #include &lt;algorithm&gt; using namespace std; // Assumes Little Endian architecture int mostConsecutiveBits(char str[], int length) { int currentConsecutiveBits=0; int maxConsecutiveBits=0; char currentBit; char lastBit=0; char currentChar=str[0]; int charCtr,bitCtr; for (charCtr=length-1; charCtr&gt;=0; charCtr--) { currentChar=str[charCtr]; for (bitCtr=0; bitCtr&lt;8; bitCtr++) { currentBit=currentChar &amp; 1; if (currentBit!=lastBit) { maxConsecutiveBits=max(maxConsecutiveBits,currentConsecutiveBits); currentConsecutiveBits=1; lastBit=currentBit; } else { currentConsecutiveBits++; } currentChar=currentChar&gt;&gt;1; } maxConsecutiveBits=max(maxConsecutiveBits,currentConsecutiveBits); } return maxConsecutiveBits; } int main (int argc, char * const argv[]) { cout &lt;&lt; mostConsecutiveBits("AB",2); return 0; } </code></pre> <p>In this algorithm, I assume the bitstream is represented as 8-bit characters. For each character, I look at the very last bit with a bitwise AND. If it's the same as the last bit, then I up the consecutive bit count, otherwise, I reset the count because the bits are no longer consecutive. I then use a bitwise shift operation to move the next bit in the character over for observation. Hope this helps!</p> <p>My answer is effectively a duplicate of David Underhill's answer. :) </p>
    singulars
    1. This table or related slice is empty.
    1. POFinding consecutive bit string of 1 or 0
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USfroggythefrog
    1. USfroggythefrog
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COHe has a char array of bytes, probably each byte is either '0' or '1', allowing you to make your solution even shorter.
      singulars
      1. PO
      1. USearlNameless
    2. COOops.... forgot, of all things, to actually keep track of the biggest number of consecutive 0's, so I added in max_consecutive0s. This is the value you'd want to return, print, etc.
      singulars
      1. PO
      1. USfroggythefrog
    3. CO@earlNameless: But then what fun would it be without bitwise operations? :)
      singulars
      1. PO
      1. USfroggythefrog
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload