Project

General

Profile

« Previous | Next » 

Revision a80e95e4

Added by Leszek Koltunski 12 months ago

implement enumeration of permutations in linear time. This hopefully speeds up all solvers.

View differences:

src/main/java/org/distorted/objectlib/tablebases/TBDino4.java
222 222
    fillPerm(perm,partition,2);
223 223
    fillPerm(perm,partition,3);
224 224

  
225
    return TBDino6.getQuatsFromPerm(perm);
225
    return TBDino.getQuatsFromPerm(perm);
226 226
    }
227 227

  
228 228
///////////////////////////////////////////////////////////////////////////////////////////////////
......
231 231
    {
232 232
    int[] perm = new int[12];
233 233
    System.arraycopy(quats, 0, perm, 0, 12);
234
    TBDino6.getPermFromQuats(perm);
234
    TBDino.getPermFromQuats(perm);
235 235

  
236 236
    int[] part = new int[12];
237 237

  

Also available in: Unified diff