- Efficient search in std::bitset - 1 Update
- Find minimum - 1 Update
| jononanon@googlemail.com: Jan 24 02:42PM -0800 On Saturday, January 24, 2015 at 10:35:55 PM UTC+1, jacob navia wrote: > Given: A vector of N bits > A search pattern of n bits where n < N. > Find the first (if any) occurrence of the pattern in the bit vector. maby ... http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.8175&rep=rep1&type=pdf http://www.busillis.com/o_kulekci/publications/mcs10.pdf http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=5576123 http://security.riit.tsinghua.edu.cn/share/pattern.html etc. https://www.google.com/search?q=fast+search+for+bitpatterns&ie=utf-8 ("bit-parallel", "search", "matching", "bitpattern", "subpattern", etc.) |
| red floyd <no.spam@its.invalid>: Jan 23 04:52PM -0800 On 1/23/2015 4:16 PM, Christopher Pisz wrote: > without looping through it myself? > Is there an std::algorithm and how would I write the predicate? Or do I > sort and use a predicate? std::min_element has a form that takes a comparator. |
| You received this digest because you're subscribed to updates for this group. You can change your settings on the group membership page. To unsubscribe from this group and stop receiving emails from it send an email to comp.lang.c+++unsubscribe@googlegroups.com. |
No comments:
Post a Comment