Changes between Version 2 and Version 3 of BitShuffle


Ignore:
Timestamp:
May 6, 2014, 11:55:04 PM (5 years ago)
Author:
cameron
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • BitShuffle

    v2 v3  
    5858vector as the second argument, and an index vector
    5959for deposits.   In the example, the vector for deposits is
    60 {{{<0, 2, 5, 6, 8, 8, 8, 8>}}} 
     60{{{<0, 8, 1, 8, 8, 2, 3, 8>}}} 
    6161
    6262The code generation problem is thus to recognize these
     
    6969  a. the selection pattern consists of two parts:  a strictly increasing sequence of positions from the first argument (<0, 2, 5, 6> in the example), followed by a selectors from the second argument (<8, 8, 8, 8> in the example).
    7070
    71 For {{{pdep}}}, only the selection pattern differs.   In this case, the selection pattern must consist of interspersed
    72 selectors (<0, 1, 2, ...>) from the first vector and arbitrary selectors from the second vector.
     71For {{{pdep}}}, only the selection pattern differs.   In this case, the selection pattern must consist of consecutive
     72selectors (<0, 1, 2, ...>) from the first vector interspersed with canoncial selectors for zeroes from the second vector.
    7373
    7474=== LLVM Support for pdep and pext ===