{"id":4573,"date":"2014-03-30T13:41:46","date_gmt":"2014-03-30T13:41:46","guid":{"rendered":"https:\/\/unknownerror.org\/index.php\/2014\/03\/30\/keeping-track-of-boolean-data-collection-of-common-programming-errors\/"},"modified":"2014-03-30T13:41:46","modified_gmt":"2014-03-30T13:41:46","slug":"keeping-track-of-boolean-data-collection-of-common-programming-errors","status":"publish","type":"post","link":"https:\/\/unknownerror.org\/index.php\/2014\/03\/30\/keeping-track-of-boolean-data-collection-of-common-programming-errors\/","title":{"rendered":"Keeping track of boolean data-Collection of common programming errors"},"content":{"rendered":"

I need to keep track of n samples. The information I am keeping track of is of boolean type, i.e. something is true or false. As soon as I am on sample n+1, i basically want to ignore the oldest sample and record information about the newest one.<\/p>\n

So say I keep track of samples, I may have something like<\/p>\n

OLDEST 0 0 1 1 0 NEWEST<\/p>\n

If the next sample is 1, this will become<\/p>\n

OLDEST 0 1 1 0 1 NEWEST<\/p>\n

if the next one is 0, this will become…<\/p>\n

OLDEST 1 1 0 1 0 NEWEST<\/p>\n

So what is the best way to implement this in terms of simplicity and memory?<\/p>\n

Some ideas I had:<\/p>\n

\n
\n

Vector of bool (this would require shifting elements so seems expensive) Storing it as bits…and using bit shifting (memorywise –cheap? but is there a limit on the number of samples?) Linked lists? (might be an overkill for the task)<\/p>\n<\/blockquote>\n<\/blockquote>\n

Thanks for the ideas and suggestions \ud83d\ude42<\/p>\n","protected":false},"excerpt":{"rendered":"

I need to keep track of n samples. The information I am keeping track of is of boolean type, i.e. something is true or false. As soon as I am on sample n+1, i basically want to ignore the oldest sample and record information about the newest one. So say I keep track of samples, […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-4573","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts\/4573","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/comments?post=4573"}],"version-history":[{"count":0,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts\/4573\/revisions"}],"wp:attachment":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/media?parent=4573"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/categories?post=4573"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/tags?post=4573"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}