@@ -0,0 +1,597 @@
1+Elm.Native.Array = {};
2+Elm.Native.Array.make = function(elm) {
3+ elm.Native = elm.Native || {};
4+ elm.Native.Array = elm.Native.Array || {};
5+ if (elm.Native.Array.values) return elm.Native.Array.values;
6+ if ('values' in Elm.Native.Array)
7+ return elm.Native.Array.values = Elm.Native.Array.values;
8+
9+ var List = Elm.Native.List.make(elm);
10+
11+ // A RRB-Tree has two distinct data types.
12+ // Leaf -> "height" is always 0
13+ // "table" is an array of elements
14+ // Node -> "height" is always greater than 0
15+ // "table" is an array of child nodes
16+ // "lengths" is an array of accumulated lengths of the child nodes
17+
18+ // M is the maximal table size. 32 seems fast. E is the allowed increase
19+ // of search steps when concatting to find an index. Lower values will
20+ // decrease balancing, but will increase search steps.
21+ var M = 32;
22+ var E = 2;
23+
24+ // An empty array.
25+ var empty = { ctor:"_Array", height:0, table:new Array() };
26+
27+ function get(i, array) {
28+ if (i < 0 || i >= length(array)) {
29+ throw new Error("Index " + i + " is out of range. Check the length of " +
30+ "your array first or use getMaybe or getWithDefault.");
31+ }
32+ return unsafeGet(i, array);
33+ }
34+
35+ function unsafeGet(i, array) {
36+ for (var x = array.height; x > 0; x--) {
37+ var slot = i >> (x * 5);
38+ if (slot > 0) {
39+ while (array.lengths[slot - 1] > i) { slot--; }
40+ i -= array.lengths[slot - 1];
41+ }
42+ array = array.table[slot];
43+ }
44+ return array.table[i];
45+ }
46+
47+ // Sets the value at the index i. Only the nodes leading to i will get
48+ // copied and updated.
49+ function set(i, item, array) {
50+ if (i < 0 || length(array) <= i) {
51+ return array;
52+ }
53+ return unsafeSet(i, item, array);
54+ }
55+
56+ function unsafeSet(i, item, array) {
57+ array = nodeCopy(array);
58+
59+ if (array.height == 0) {
60+ array.table[i] = item;
61+ } else {
62+ var slot = getSlot(i, array);
63+ if (slot > 0) {
64+ i -= array.lengths[slot - 1];
65+ }
66+ array.table[slot] = unsafeSet(i, item, array.table[slot]);
67+ }
68+ return array;
69+ }
70+
71+ function initialize(len, f) {
72+ if (len == 0) { return empty; }
73+ var h = Math.floor(Math.log(len)/Math.log(M));
74+ return initialize_(f, h, 0, len);
75+ }
76+
77+ function initialize_(f, h, from, to) {
78+ if (h == 0) {
79+ var table = new Array((to - from) % (M + 1));
80+ for (var i = 0; i < table.length; i++) {
81+ table[i] = f(from + i);
82+ }
83+ return { ctor:"_Array", height:0, table:table };
84+ }
85+
86+ var step = Math.pow(M, h);
87+ var table = new Array(Math.ceil((to - from) / step));
88+ var lengths = new Array(table.length);
89+ for (var i = 0; i < table.length; i++) {
90+ table[i] = initialize_( f, h - 1, from + (i * step)
91+ , Math.min(from + ((i + 1) * step), to));
92+ lengths[i] = length(table[i]) + (i > 0 ? lengths[i-1] : 0);
93+ }
94+ return { ctor:"_Array", height:h, table:table, lengths:lengths };
95+ }
96+
97+ function fromList(list) {
98+ if (list == List.Nil) { return empty; }
99+
100+ // Allocate M sized blocks (table) and write list elements to it.
101+ var table = new Array(M);
102+ var nodes = new Array();
103+ var i = 0;
104+
105+ while (list.ctor !== '[]') {
106+ table[i] = list._0;
107+ list = list._1;
108+ i++;
109+
110+ // table is full, so we can push a leaf containing it into the
111+ // next node.
112+ if (i == M) {
113+ fromListPush({ ctor:"_Array", height:0, table:table }
114+ , nodes);
115+ table = new Array(M);
116+ i = 0;
117+ }
118+ }
119+
120+ // Maybe there is something left on the table.
121+ if (i > 0) {
122+ fromListPush({ ctor:"_Array", height:0, table:table.splice(0,i) }
123+ , nodes);
124+ }
125+
126+ // Go through all of the nodes and eventually push them into higher nodes.
127+ for (var h = 0; h < nodes.length - 1; h++) {
128+ if (nodes[h].table.length > 0) {
129+ fromListPush(nodes[h], nodes);
130+ }
131+ }
132+
133+ var head = nodes[nodes.length - 1];
134+ if (head.height > 0 && head.table.length == 1) {
135+ return head.table[0];
136+ } else {
137+ return head;
138+ }
139+ }
140+
141+ // Push a node into a higher node as a child.
142+ function fromListPush(toPush, nodes) {
143+ var h = toPush.height;
144+
145+ // Maybe the node on this height does not exist.
146+ if (nodes.length == h) {
147+ nodes.push({ ctor:"_Array", height:h + 1
148+ , table:new Array()
149+ , lengths:new Array() });
150+ }
151+
152+ nodes[h].table.push(toPush);
153+ var len = length(toPush);
154+ if (nodes[h].lengths.length > 0) {
155+ len += nodes[h].lengths[nodes[h].lengths.length - 1];
156+ }
157+ nodes[h].lengths.push(len);
158+
159+ if (nodes[h].table.length == M) {
160+ fromListPush(nodes[h], nodes);
161+ nodes[h] = { ctor:"_Array", height:h + 1
162+ , table:new Array()
163+ , lengths:new Array() };
164+ }
165+ }
166+
167+ // Pushes an item via push_ to the bottom right of a tree.
168+ function push(item, a) {
169+ var pushed = push_(item, a);
170+ if (pushed !== null) {
171+ return pushed;
172+ }
173+
174+ var newTree = create(item, a.height);
175+ return siblise(a, newTree);
176+ }
177+
178+ // Recursively tries to push an item to the bottom-right most
179+ // tree possible. If there is no space left for the item,
180+ // null will be returned.
181+ function push_(item, a) {
182+ // Handle resursion stop at leaf level.
183+ if (a.height == 0) {
184+ if (a.table.length < M) {
185+ var newA = { ctor:"_Array", height:0, table:a.table.slice() };
186+ newA.table.push(item);
187+ return newA;
188+ } else {
189+ return null;
190+ }
191+ }
192+
193+ // Recursively push
194+ var pushed = push_(item, botRight(a));
195+
196+ // There was space in the bottom right tree, so the slot will
197+ // be updated.
198+ if (pushed != null) {
199+ var newA = nodeCopy(a);
200+ newA.table[newA.table.length - 1] = pushed;
201+ newA.lengths[newA.lengths.length - 1]++;
202+ return newA
203+ }
204+
205+ // When there was no space left, check if there is space left
206+ // for a new slot with a tree which contains only the item
207+ // at the bottom.
208+ if (a.table.length < M) {
209+ var newSlot = create(item, a.height - 1);
210+ var newA = nodeCopy(a);
211+ newA.table.push(newSlot);
212+ newA.lengths.push(newA.lengths[newA.lengths.length - 1] + length(newSlot));
213+ return newA
214+ } else {
215+ return null;
216+ }
217+ }
218+
219+ // Converts an array into a list of elements.
220+ function toList(a) {
221+ return toList_(List.Nil, a);
222+ }
223+
224+ function toList_(list, a) {
225+ for (var i = a.table.length - 1; i >= 0; i--) {
226+ list = a.height == 0 ? List.Cons(a.table[i], list) : toList_(list, a.table[i]);
227+ }
228+ return list;
229+ }
230+
231+ // Maps a function over the elements of an array.
232+ function map(f, a) {
233+ var newA = { ctor:"_Array", height:a.height, table:new Array(a.table) };
234+ if (a.height > 0) { newA.lengths = a.lengths; }
235+ for (var i = 0; i < a.table.length; i++) {
236+ newA.table[i] = a.height == 0 ? f(a.table[i]) : map(f, a.table[i]);
237+ }
238+ return newA;
239+ }
240+
241+ // Maps a function over the elements with their index as first argument.
242+ function indexedMap(f, a) {
243+ var newA = { ctor:"_Array", height:a.height, table:new Array(a.table) };
244+ if (a.height > 0) { newA.lengths = a.lengths; }
245+ for (var i = 0; i < a.table.length; i++) {
246+ newA.table[i] = a.height == 0 ? A2(f, i, a.table[i]) : indexedMap(f, a.table[i]);
247+ }
248+ return newA;
249+ }
250+
251+ function foldl(f, b, a) {
252+ for (var i = 0; i < a.table.length; i++) {
253+ b = A2(f, a.height == 0 ? a.table[i] : foldl(f, b, a.table[i]), b);
254+ }
255+ return b;
256+ }
257+
258+ function foldr(f, b, a) {
259+ for (var i = a.table.length; i--; ) {
260+ b = A2(f, a.height == 0 ? a.table[i] : foldr(f, b, a.table[i]), b);
261+ }
262+ return b;
263+ }
264+
265+ // Returns a sliced tree. "to" is inclusive, but this may change,
266+ // when I understand, why e.g. JS does not handle it this way. :-)
267+ // If "from" or "to" is negative, they will select from the end on.
268+ // TODO: currently, it slices the right, then the left. This can be
269+ // optimized.
270+ function slice(from, to, a) {
271+ if (from < 0) { from += length(a); }
272+ if (to < 0) { to += length(a); }
273+ return sliceLeft(from, sliceRight(to, a));
274+ }
275+
276+ function sliceRight(to, a) {
277+ if (to == length(a)) {
278+ return a;
279+ }
280+
281+ // Handle leaf level.
282+ if (a.height == 0) {
283+ var newA = { ctor:"_Array", height:0 };
284+ newA.table = a.table.slice(0, to + 1);
285+ return newA;
286+ }
287+
288+ // Slice the right recursively.
289+ var right = getSlot(to, a);
290+ var sliced = sliceRight(to - (right > 0 ? a.lengths[right - 1] : 0), a.table[right]);
291+
292+ // Maybe the a node is not even needed, as sliced contains the whole slice.
293+ if (right == 0) {
294+ return sliced;
295+ }
296+
297+ // Create new node.
298+ var newA = { ctor:"_Array", height:a.height
299+ , table:a.table.slice(0, right + 1)
300+ , lengths:a.lengths.slice(0, right + 1) };
301+ newA.table[right] = sliced;
302+ newA.lengths[right] = length(sliced) + (right > 0 ? newA.lengths[right - 1] : 0);
303+ return newA;
304+ }
305+
306+ function sliceLeft(from, a) {
307+ if (from == 0) {
308+ return a;
309+ }
310+
311+ // Handle leaf level.
312+ if (a.height == 0) {
313+ var newA = { ctor:"_Array", height:0 };
314+ newA.table = a.table.slice(from, a.table.length + 1);
315+ return newA;
316+ }
317+
318+ // Slice the left recursively.
319+ var left = getSlot(from, a);
320+ var sliced = sliceLeft(from - (left > 0 ? a.lengths[left - 1] : 0), a.table[left]);
321+
322+ // Maybe the a node is not even needed, as sliced contains the whole slice.
323+ if (left == a.table.length - 1) {
324+ return sliced;
325+ }
326+
327+ // Create new node.
328+ var newA = { ctor:"_Array", height:a.height
329+ , table:a.table.slice(left, a.table.length + 1)
330+ , lengths:new Array(a.table.length - left) };
331+ newA.table[left] = sliced;
332+ var len = 0;
333+ for (var i = 0; i < newA.table.length; i++) {
334+ len += length(newA.table[i]);
335+ newA.lengths[i] = len;
336+ }
337+
338+ return newA;
339+ }
340+
341+ // Appends two trees.
342+ // TODO: Add support for appending trees of different sizes. Current
343+ // behavior will just rise the lower tree and then append them.
344+ function append(a,b) {
345+ if (b.height > a.height) { return append(parentise(a, b.height), b); }
346+ if (a.height > b.height) { return append(a, parentise(b, a.height)); }
347+ if (a.height == 0) { return append(parentise(a, 1), parentise(b, 1)); }
348+
349+ var c = append_(a, b);
350+ if (c[1].table.length > 0) {
351+ return siblise(c[0], c[1]);
352+ } else {
353+ return c[0];
354+ }
355+ }
356+
357+ // Returns an array of two nodes. The second node _may_ be empty. This case
358+ // needs to be handled by the function, that called append_. May be only
359+ // called for trees with an minimal height of 1.
360+ function append_(a, b) {
361+ if (a.height == 1) {
362+ // Check if balancing is needed and return based on that.
363+ var toRemove = calcToRemove(a, b);
364+ if (toRemove <= E) {
365+ return [a,b];
366+ }
367+
368+ return shuffle(a, b, toRemove);
369+ }
370+
371+ var appended = append_(botRight(a), botLeft(b));
372+ a = nodeCopy(a), b = nodeCopy(b);
373+
374+ // Adjust the bottom right side of the new tree.
375+ a.table[a.table.length - 1] = appended[0];
376+ a.lengths[a.lengths.length - 1] = length(appended[0])
377+ a.lengths[a.lengths.length - 1] += a.lengths.length > 1 ? a.lengths[a.lengths.length - 2] : 0;
378+
379+ // Adjust the bottom left side of the new tree.
380+ if (appended[1].table.length > 0) {
381+ b.table[0] = appended[1];
382+ b.lengths[0] = length(appended[1]);
383+ for (var i = 1, len = length(b.table[0]); i < b.lengths.length; i++) {
384+ len += length(b.table[i]);
385+ b.lengths[i] = len;
386+ }
387+ } else {
388+ b.table.shift();
389+ for (var i = 1; i < b.lengths.length; i++) {
390+ b.lengths[i] = b.lengths[i] - b.lengths[0];
391+ }
392+ b.lengths.shift();
393+ }
394+
395+ // Check if balancing is needed and return based on that.
396+ var toRemove = calcToRemove(a, b);
397+ if (toRemove <= E || b.table.length == 0) {
398+ return [a,b];
399+ }
400+
401+ return shuffle(a, b, toRemove);
402+ }
403+
404+ // Returns the extra search steps for E. Refer to the paper.
405+ function calcToRemove(a, b) {
406+ var subLengths = 0;
407+ for (var i = 0; i < a.table.length; i++) {
408+ subLengths += a.table[i].table.length;
409+ }
410+ for (var i = 0; i < b.table.length; i++) {
411+ subLengths += b.table[i].table.length;
412+ }
413+
414+ var toRemove = a.table.length + b.table.length
415+ return toRemove - (Math.floor((subLengths - 1) / M) + 1);
416+ }
417+
418+ // get2, set2 and saveSlot are helpers for accessing elements over two arrays.
419+ function get2(a, b, index) {
420+ return index < a.length ? a[index] : b[index - a.length];
421+ }
422+
423+ function set2(a, b, index, value) {
424+ if (index < a.length) {
425+ a[index] = value;
426+ } else {
427+ b[index - a.length] = value;
428+ }
429+ }
430+
431+ function saveSlot(a, b, index, slot) {
432+ set2(a.table, b.table, index, slot);
433+
434+ var l = (index == 0 || index == a.lengths.length) ?
435+ 0 : get2(a.lengths, a.lengths, index - 1);
436+ set2(a.lengths, b.lengths, index, l + length(slot));
437+ }
438+
439+ // Creates a node or leaf with a given length at their arrays for perfomance.
440+ // Is only used by shuffle.
441+ function createNode(h, length) {
442+ if (length < 0) { length = 0; }
443+ var a = { ctor:"_Array", height:h, table:new Array(length) };
444+ if (h > 0) {
445+ a.lengths = new Array(length);
446+ }
447+ return a;
448+ }
449+
450+ // Returns an array of two balanced nodes.
451+ function shuffle(a, b, toRemove) {
452+ var newA = createNode(a.height, Math.min(M, a.table.length + b.table.length - toRemove));
453+ var newB = createNode(a.height, newA.table.length - (a.table.length + b.table.length - toRemove));
454+
455+ // Skip the slots with size M. More precise: copy the slot references
456+ // to the new node
457+ var read = 0;
458+ while (get2(a.table, b.table, read).table.length % M == 0) {
459+ set2(newA.table, newB.table, read, get2(a.table, b.table, read));
460+ set2(newA.lengths, newB.lengths, read, get2(a.lengths, b.lengths, read));
461+ read++;
462+ }
463+
464+ // Pulling items from left to right, caching in a slot before writing
465+ // it into the new nodes.
466+ var write = read;
467+ var slot = new createNode(a.height - 1, 0);
468+ var from = 0;
469+
470+ // If the current slot is still containing data, then there will be at
471+ // least one more write, so we do not break this loop yet.
472+ while (read - write - (slot.table.length > 0 ? 1 : 0) < toRemove) {
473+ // Find out the max possible items for copying.
474+ var source = get2(a.table, b.table, read);
475+ var to = Math.min(M - slot.table.length, source.table.length)
476+
477+ // Copy and adjust size table.
478+ slot.table = slot.table.concat(source.table.slice(from, to));
479+ if (slot.height > 0) {
480+ var len = slot.lengths.length;
481+ for (var i = len; i < len + to - from; i++) {
482+ slot.lengths[i] = length(slot.table[i]);
483+ slot.lengths[i] += (i > 0 ? slot.lengths[i - 1] : 0);
484+ }
485+ }
486+
487+ from += to;
488+
489+ // Only proceed to next slots[i] if the current one was
490+ // fully copied.
491+ if (source.table.length <= to) {
492+ read++; from = 0;
493+ }
494+
495+ // Only create a new slot if the current one is filled up.
496+ if (slot.table.length == M) {
497+ saveSlot(newA, newB, write, slot);
498+ slot = createNode(a.height - 1,0);
499+ write++;
500+ }
501+ }
502+
503+ // Cleanup after the loop. Copy the last slot into the new nodes.
504+ if (slot.table.length > 0) {
505+ saveSlot(newA, newB, write, slot);
506+ write++;
507+ }
508+
509+ // Shift the untouched slots to the left
510+ while (read < a.table.length + b.table.length ) {
511+ saveSlot(newA, newB, write, get2(a.table, b.table, read));
512+ read++; write++;
513+ }
514+
515+ return [newA, newB];
516+ }
517+
518+ // Navigation functions
519+ function botRight(a) { return a.table[a.table.length - 1]; }
520+ function botLeft(a) { return a.table[0]; }
521+
522+ // Copies a node for updating. Note that you should not use this if
523+ // only updating only one of "table" or "lengths" for performance reasons.
524+ function nodeCopy(a) {
525+ var newA = { ctor:"_Array", height:a.height
526+ , table:a.table.slice() };
527+ if (a.height > 0) { newA.lengths = a.lengths.slice(); }
528+ return newA;
529+ }
530+
531+ // Returns how many items are in the tree.
532+ function length(array) {
533+ if (array.height == 0) {
534+ return array.table.length;
535+ } else {
536+ return array.lengths[array.lengths.length - 1];
537+ }
538+ }
539+
540+ // Calculates in which slot of "table" the item probably is, then
541+ // find the exact slot via forward searching in "lengths". Returns the index.
542+ function getSlot(i, a) {
543+ var slot = i >> (5 * a.height);
544+ while (a.lengths[slot - 1] > i) { slot--; }
545+ return slot;
546+ }
547+
548+ // Recursively creates a tree with a given height containing
549+ // only the given item.
550+ function create(item, h) {
551+ if (h == 0) {
552+ return { ctor:"_Array", height:0
553+ , table:[item] };
554+ } else {
555+ return { ctor:"_Array", height:h
556+ , table:[create(item, h - 1)]
557+ , lengths:[1] };
558+ }
559+ }
560+
561+ // Recursively creates a tree that contains the given tree.
562+ function parentise(tree, h) {
563+ if (h == tree.height) {
564+ return tree;
565+ } else {
566+ return { ctor:"_Array", height:h
567+ , table:[parentise(tree, h - 1)]
568+ , lengths:[length(tree)] };
569+ }
570+ }
571+
572+ // Emphasizes blood brotherhood beneath two trees.
573+ function siblise(a, b) {
574+ return { ctor:"_Array", height:a.height + 1
575+ , table:[a, b]
576+ , lengths:[length(a), length(a) + length(b)] };
577+ }
578+
579+ Elm.Native.Array.values = {
580+ empty:empty,
581+ fromList:fromList,
582+ toList:toList,
583+ initialize:F2(initialize),
584+ append:F2(append),
585+ push:F2(push),
586+ slice:F3(slice),
587+ get:F2(get),
588+ set:F3(set),
589+ map:F2(map),
590+ indexedMap:F2(indexedMap),
591+ foldl:F3(foldl),
592+ foldr:F3(foldr),
593+ length:length
594+ };
595+
596+ return elm.Native.Array.values = Elm.Native.Array.values;
597+}