heap of each sentence

source/sample/transformer/T2TSearch.cpp

@@ -28,6 +28,19 @@ using namespace nts;
 namespace transformer
 {
     
+/* constructor */
+T2TSearch::T2TSearch()
+{
+    fullHypos = NULL;
+}
+
+/* de-constructor */
+T2TSearch::~T2TSearch()
+{
+    if(fullHypos != NULL)
+        delete[] fullHypos;
+}
+
 /*
 initialize the model
 >> argc - number of arguments
@@ -93,13 +106,13 @@ prepare for search
 */
 void T2TSearch::Prepare(int batchSize, int beamSize)
 {
-    if (heaps != NULL)
-        delete[] heaps;
+    if (fullHypos != NULL)
+        delete[] fullHypos;
 
-    heaps = new XHeap<MIN_HEAP, float>[batchSize];
+    fullHypos = new XHeap<MIN_HEAP, float>[batchSize];
 
     for (int i = 0; i < batchSize; i++)
-        heaps[i].Init(beamSize);
+        fullHypos[i].Init(beamSize);
 }
 
 /* 
@@ -254,7 +267,7 @@ void T2TSearch::Expand(T2TStateBundle * prev, T2TStateBundle * beam)
 }
 
 /* 
-collect hypotheses with ending symbol. Given a beam of hypotheses,
+collect hypotheses with ending symbols. Given a beam of hypotheses,
 we remove the finished hypotheses and keep them in a heap.
 >> beam  - the beam that keeps a number of states
 */
@@ -264,6 +277,8 @@ void T2TSearch::Collect(T2TStateBundle * beam)
 
     for (int i = 0; i < beam->stateNum; i++) {
         T2TState & state = states[i];
+        
+        state.pid = state.last->pid;
     }
 }
 

source/sample/transformer/T2TSearch.h

@@ -48,14 +48,14 @@ private:
     int beamSize;
 
     /* we keep the final hypotheses in a heap for each sentence in the batch. */
-    XHeap<MIN_HEAP, float> * heaps;
+    XHeap<MIN_HEAP, float> * fullHypos;
 
 public:
     /* constructor */
-    T2TSearch() {};
+    T2TSearch();
 
     /* de-constructor */
-    ~T2TSearch() {};
+    ~T2TSearch();
     
     /* initialize the model */
     void InitModel(int argc, char ** argv);