summaryrefslogtreecommitdiffstats
path: root/src/utils/ArrayChunk.js
diff options
context:
space:
mode:
authorJohn Molakvoæ (skjnldsv) <skjnldsv@protonmail.com>2019-12-11 20:38:14 +0100
committerJohn Molakvoæ (skjnldsv) <skjnldsv@protonmail.com>2019-12-17 14:02:40 +0100
commitb501e72f31bbaf90d89e3c55ef2438b002244d0b (patch)
treeffe999b2cc4f3d2c31ef7aaff55e95d38825fb54 /src/utils/ArrayChunk.js
parent42024d21866b5fbb3b3644d0bfb81b17d2e605c9 (diff)
Grid virtual scroller
Signed-off-by: John Molakvoæ (skjnldsv) <skjnldsv@protonmail.com>
Diffstat (limited to 'src/utils/ArrayChunk.js')
-rw-r--r--src/utils/ArrayChunk.js39
1 files changed, 39 insertions, 0 deletions
diff --git a/src/utils/ArrayChunk.js b/src/utils/ArrayChunk.js
new file mode 100644
index 00000000..ff212228
--- /dev/null
+++ b/src/utils/ArrayChunk.js
@@ -0,0 +1,39 @@
+/**
+ * @copyright Copyright (c) 2019 John Molakvoæ <skjnldsv@protonmail.com>
+ *
+ * @author John Molakvoæ <skjnldsv@protonmail.com>
+ *
+ * @license GNU AGPL version 3 or any later version
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as
+ * published by the Free Software Foundation, either version 3 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
+const arrayRange = function(n) {
+ // Array.range(5) --> [0,1,2,3,4]
+ return Array.apply(null, Array(n)).map((x, i) => i)
+}
+
+/**
+ * Split an array into chunks
+ *
+ * @param {Array} arr an array to split
+ * @param {number} count lenght of the chunk
+ * @returns {Array}
+ */
+export default function(arr = [], count = 5) {
+ return arrayRange(Math.ceil(arr.length / count)).map((x, i) =>
+ arr.slice(i * count, i * count + count)
+ )
+}