/
table-navigation.js
164 lines (133 loc) · 5.46 KB
/
table-navigation.js
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
160
161
162
163
164
// Copyright (c) 2010, Maik Gosenshuis
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of the copyright holder nor the
// names of its contributors may be used to endorse or promote products
// derived from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL MAIK GOSENSHUIS BE LIABLE FOR ANY
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
(function() {
Element.addMethods('TABLE', {
expand: function(table) {
var key = 'expanded-matrix',
matrix = table.retrieve(key);
if (!matrix) {
matrix = buildExpandedMatrix(table);
table.store(key, matrix);
}
return matrix;
}
});
Element.addMethods(['TD','TH'], {
cellUp: getAdjacentCell.curry(-1, 0),
cellDown: getAdjacentCell.curry(1, 0),
cellLeft: getAdjacentCell.curry(0, -1),
cellRight: getAdjacentCell.curry(0, 1)
});
function buildExpandedMatrix(table) {
var rows = table.select('tr'),
matrixWidth = rows[0] ? calculateFirstRowSize(rows[0]) : 0,
matrix = [],
positions = $H();
rows.each(function(row, rowIndex) {
var colIndex = 0;
// Account for leading cells from previous iterations that span multiple rows.
if (Object.isArray(matrix[rowIndex])) {
while (matrix[rowIndex][colIndex]) {
colIndex += 1;
}
}
row.childElements().each(function(cell) {
var colspan = parseInt(cell.readAttribute('colspan') || 1, 10),
rowspan = parseInt(cell.readAttribute('rowspan') || 1, 10),
cellId = cell.identify();
for (var c = colIndex, targetCol = colIndex + colspan; c < targetCol; c++) {
for (var r = rowIndex, targetRow = rowIndex + rowspan; r < targetRow; r++) {
// Initialize the rows lazily so we don't have to calculate up front how tall
// our matrix will be.
if (!Object.isArray(matrix[r])) {
matrix[r] = fillArray(matrixWidth, null);
}
// If we try to set a certain location in our index multiple times, there has
// to be something wrong with the markup. We can't take a guess when this happens.
if (Object.isElement(matrix[r][c])) {
throw "Cell at #{row},#{column} already occupied. Invalid markup.".interpolate({
row: r,
column: c
});
}
matrix[r][c] = cell;
// Keep track of all positions the cell occupies in the expanded table.
(positions.get(cellId) || positions.set(cellId, [])).push({ row: r, column: c });
}
colIndex += 1;
}
// Check if we don't stumble upon a cell from an earlier row that spans multiple rows.
while (matrix[rowIndex][colIndex]) {
colIndex += 1;
}
});
});
// The public API of the expanded matrix object.
return {
get: function(r, c) {
if (typeof r === 'object') {
c = r.column;
r = r.row;
}
if (!Object.isArray(matrix[r])) {
return undefined;
}
return matrix[r][c];
},
size: function() {
return {
width: matrix[0] ? matrix[0].size() : 0,
height: matrix.size()
};
},
positions: function(cell) {
return positions.get(cell.identify());
}
};
}
function getAdjacentCell(rowDelta, columnDelta, cell) {
var expandedMatrix = cell.up('table').expand(),
position;
position = expandedMatrix.positions(cell).sort(function(a, b) {
var result = 0;
result += (rowDelta <= 0) ? a.row - b.row : b.row - a.row;
result += (columnDelta <= 0) ? a.column - b.column : b.column - a.column;
return result;
}).first();
return expandedMatrix.get(position.row + rowDelta, position.column + columnDelta);
}
function calculateFirstRowSize(row) {
return row.childElements().inject(0, function(size, cell) {
return size + parseInt(cell.readAttribute('colspan') || 1, 10);
});
}
function fillArray(width, placeholder) {
var result = [];
for (var i = 0; i < width; i++) {
result.push(placeholder);
}
return result;
}
})();