summaryrefslogtreecommitdiffstats
path: root/media/scripts/TableSort.js
blob: 1ab80fda0df3fe693b81a534e739810c8dbc8ffb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
function filterTable(tablename)
{
  table = document.getElementById(tablename);

  mindepth = document.getElementById("CaveDepthMin").value;
  maxdepth = document.getElementById("CaveDepthMax").value;
  if(mindepth==0)mindepth=-999999;
  if(maxdepth==0)maxdepth= 999999;

  minlength = document.getElementById("CaveLengthMin").value;
  maxlength = document.getElementById("CaveLengthMax").value;
  if(minlength==0)minlength=-999999;
  if(maxlength==0)maxlength= 999999;

  visitdate = document.getElementById("VisitDate").value;

  visitor = document.getElementById("Visitor").value;

  cavename = document.getElementById("CaveName").value.toLowerCase();

  incomplete = document.getElementById("Incomplete").checked;

  var regexmode = false;
  if(visitor[0]=='/' && visitor[visitor.length-1]=='/')
  {
     regexmode = true;
     visitor = new RegExp(visitor.substr(1,visitor.length-2));
  }
  else
  {
     visitor.toLowerCase();
  }

  rows = table.rows;
  for(i=1; i< rows.length; i++)
  {
    name  = (rows[i].getElementsByTagName("TD")[1]).innerHTML.toLowerCase();

    depth = (rows[i].getElementsByTagName("TD")[2]).innerHTML.toLowerCase();
    depth = Number(depth.replace(/[^0-9.]/g,''));

    length = (rows[i].getElementsByTagName("TD")[3]).innerHTML.toLowerCase();
    length = Number(length.replace(/[^0-9.]/g,''));

    date = (rows[i].getElementsByTagName("TD")[4]).innerHTML.toLowerCase();

    //recentvisitor = (rows[i].getElementsByTagName("TD")[4]).innerHTML.toLowerCase();
    recentvisitor = ""

    if(cavename != "" && !name.includes(cavename))
    {
      rows[i].style.visibility = "collapse";
    }
    if(depth<mindepth || depth>maxdepth)
    {
      rows[i].style.visibility = "collapse";
    }
    if(length<minlength || length>maxlength)
    {
      rows[i].style.visibility = "collapse";
    }
    if(date < visitdate)
    {
      rows[i].style.visibility = "collapse";
    }
    if(visitor != "" && regexmode && !visitor.test(recentvisitor))
    {
      rows[i].style.visibility = "collapse";
    }
    if(visitor != "" && !regexmode && !recentvisitor.includes(visitor))
    {
      rows[i].style.visibility = "collapse";
    }
    
    crow=rows[i].getElementsByTagName("TD");
    for(var j=0; j<crow.length; j++)
    {
      if(crow[j].innerHTML == "" && incomplete)
      {
        rows[i].style.visibility = "collapse";
        break;
      }
    }

  }
}

function filterTableReset(tablename)
{
  table = document.getElementById(tablename);
  rows = table.rows;
  for(i=1; i< rows.length; i++)
  {
    rows[i].style.visibility = "visible";
  }
}


function isOrdered(kvarray,numeric)
{
  for(var i=0;i<kvarray.length-1;i++)
  {
    if(numeric==1 && Number(kvarray[i][0])>Number(kvarray[i+1][0]))
    {
      return false;
    }
    if(numeric!=1 && kvarray[i][0]>kvarray[i+1][0])
    {
      return false;
    }
  }
  return true;
}

function sortTable(n, tablename, numeric) {
  table = document.getElementById(tablename);
  rows = table.rows;
  var ordering = [];
  var i;
  
  //construct key-value pairs for sorting
  for(i = 1; i < rows.length; i++) //remember header rows
  {
    key = rows[i].getElementsByTagName("TD")[n];
    key = key.innerHTML.toLowerCase();
    if(numeric==1)
    {
      key=key.replace(/[^0-9.]/g,'')
    }
    ordering.push([key,i]);
  }

  var ascending = isOrdered(ordering,numeric);
  
  //sort either numerically or alphabetically
  if(numeric==1)
  {
    ordering.sort((x,y) => Number(x[0])-Number(y[0]));
  }
  else
  {
    ordering.sort(); //sorts alphabetically
  }

  if(ascending) ordering.reverse();

  for(i = 0; i < ordering.length; i++) //add sorted list at the end of the table
  {
    var keyval = ordering[i];
    id = keyval[1]; //get rownumber of n^th sorted value
    cln = rows[id].cloneNode(true); //deep clone of current node
    table.insertBefore(cln,null); //add n^th row at the end
  }
  for(i = 1; i < ordering.length+1; i++) //remove unsorted nodes
  {
    table.deleteRow(1);// 0 -> header; 1 -> first row
  }

}