Help for this page

Select Code to Download


  1. or download this
    $ time ./llil4map long* long* long* | cksum
    llil4map start
    ...
           real time     0m43.973s   0m27.461s
           user         25m08.532s  20m02.479s
           sys           0m55.602s   0m43.250s
    
  2. or download this
    $ time ./llil4vec long* long* long* | cksum
    llil4vec start
    ...
           real time     3m57.228s   3m38.118s   1m50.092s
           user         73m27.931s  70m13.776s  45m32.094s
           sys           2m42.941s   2m29.584s   2m20.917s
    
  3. or download this
    #pragma omp parallel for schedule(static, 1) reduction(+:num_lines)
    for (int i = 0; i < nfiles; ++i) {
    ...
             propvec.emplace_back(std::move(*it));
       }
    }
    
  4. or download this
    // Reduce a vector range (tally adjacent count fields of duplicate key
    + names)
    static void reduce_vec(auto& vec)  
    ...
          vec.resize(std::distance(it1, ++itw));
       }
    }
    
  5. or download this
    string_cnt.h   - original + key length stored with count
    string_cnt_f.h - fixed-length-only version
    string_cnt_u.h - union std::array
    
  6. or download this
       // Free dynamically allocated memory in parallel.
    #ifndef FIXED_LENGTH_ONLY
    ...
       for (size_t i = 0; i < propvec.size(); i++)
          propvec[i].free();
    #endif