fix the bug in sorting sequences

source/sample/transformer/T2TTrainer.cpp

@@ -525,6 +525,7 @@ int T2TTrainer::LoadBuf(FILE * file, bool isSorted, int step)
 
 
     /* sort the sequences by length */
     /* sort the sequences by length */
     if (isSorted) {
     if (isSorted) {
+        CheckNTErrors(seqCount % step == 0, "Wrong number of sequences!");
         SampleNode * nodes = new SampleNode[seqCount];
         SampleNode * nodes = new SampleNode[seqCount];
         int count = 0;
         int count = 0;
         int offset = 0;
         int offset = 0;
@@ -540,18 +541,18 @@ int T2TTrainer::LoadBuf(FILE * file, bool isSorted, int step)
             offset += node.size;
             offset += node.size;
         }
         }
 
 
-        qsort(nodes, seqCount, sizeof(SampleNode), CompareSampleNode);
+        qsort(nodes, count, sizeof(SampleNode), CompareSampleNode);
 
 
         count = 0;
         count = 0;
         offset = 0;
         offset = 0;
-        for(int i = 0; i < seqCount; i++){
+        for(int i = 0; i < seqCount; i += step){
             SampleNode &node = nodes[count];
             SampleNode &node = nodes[count];
             memcpy(buf2 + offset, node.p, sizeof(int) * node.size);
             memcpy(buf2 + offset, node.p, sizeof(int) * node.size);
             for(int j = 0; j < step; j++){
             for(int j = 0; j < step; j++){
-                seqLen2[count + j] = seqLen[node.id + j];
-                seqOffset[count + j] = offset + (j > 0 ? seqLen[node.id + j - 1] : 0);
+                seqLen2[i + j] = seqLen[node.id + j];
+                seqOffset[i + j] = offset + (j > 0 ? seqLen[node.id + j - 1] : 0);
             }
             }
-            count += step;
+            count += 1;
             offset += node.size;
             offset += node.size;
         }
         }