Exemplo n.º 1
0
 public void getReport(reportClass rC, payMap pM)
 {
     for (int i = 0; i < this.arraySize - 1; i++)
     {
         Tuple <int, pMap.info, int, string> finded = pM.findInHashTable(this.array[i].field2);
         rC.pushArray(this.array[i].field1, finded.Item2.field1, null, null);
     }
 }
Exemplo n.º 2
0
 public void getReport(reportClass rC, hashTable eM)
 {
     for (int i = 0; i < this.arraySize - 1; i++)
     {
         Tuple <int, string, string, string, int, string> finded = eM.findInHashTable(this.array[i].field1);
         rC.pushArray(this.array[i].field1, this.array[i].field2, finded.Item3, null);
     }
 }
Exemplo n.º 3
0
 public void getReport(reportClass rC, hashTable eM, payMap pM)
 {
     for (int i = 0; i < this.arraySize - 1; i++)
     {
         Tuple <int, string, string, string, int, string> findedFromEmployee = eM.findInHashTable(this.array[i].field1);
         Tuple <int, pMap.info, int, string> findedFromPay = pM.findInHashTable(this.array[i].field2);
         rC.pushArray(array[i].field1, array[i].field3,
                      findedFromEmployee.Item3, findedFromPay.Item2.field1);
     }
 }
Exemplo n.º 4
0
 public void getReport(node current, reportClass rC, payMap pM)
 {
     if (current != null)
     {
         getReport(current.left, rC, pM);
         Tuple <int, pMap.info, int, string> finded = pM.findInHashTable(current.field2);
         rC.pushArray(current.field2, finded.Item2.field1, current.field1, current.field3);
         getReport(current.right, rC, pM);
     }
 }
Exemplo n.º 5
0
Arquivo: avlTree.cs Projeto: kepon2/cP
 public void getReport(Nodetree current, reportClass rC, payMap pM)
 {
     if (current != null)
     {
         getReport(current.left, rC, pM);
         Tuple <int, pMap.info, int, string> finded = pM.findInHashTable(current.vacancy);
         rC.pushArray(current.FIO, finded.Item2.field1, null, null);
         getReport(current.right, rC, pM);
     }
 }