Performance of the bit package2 years ago
A performance example | Boolean data types | % memory consumption of filter | % time extracting | % time assigning | % time subscripting with 'which' | % time assigning with 'which' | % time Boolean NOT | % time Boolean AND | % time Boolean OR | % time Boolean EQUALITY | % time Boolean XOR | % time Boolean SUMMARY | Fast methods for integer set operations | % time for sorting | % time for unique | % time for duplicated | % time for anyDuplicated | % time for sumDuplicated | % time for match | % time for in | % time for notin | % time for union | % time for intersect | % time for setdiff | % time for symdiff | % time for setequal | % time for setearly
bit 4.6.99Dr. Jens Oehlschlägelbit-performance.Rmd