consarray.js 3.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
  1. // Copyright 2009 the V8 project authors. All rights reserved.
  2. // Redistribution and use in source and binary forms, with or without
  3. // modification, are permitted provided that the following conditions are
  4. // met:
  5. //
  6. // * Redistributions of source code must retain the above copyright
  7. // notice, this list of conditions and the following disclaimer.
  8. // * Redistributions in binary form must reproduce the above
  9. // copyright notice, this list of conditions and the following
  10. // disclaimer in the documentation and/or other materials provided
  11. // with the distribution.
  12. // * Neither the name of Google Inc. nor the names of its
  13. // contributors may be used to endorse or promote products derived
  14. // from this software without specific prior written permission.
  15. //
  16. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  17. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  18. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  19. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  20. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  21. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  22. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  23. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  24. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  25. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  26. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  27. /**
  28. * Constructs a ConsArray object. It is used mainly for tree traversal.
  29. * In this use case we have lots of arrays that we need to iterate
  30. * sequentally. The internal Array implementation is horribly slow
  31. * when concatenating on large (10K items) arrays due to memory copying.
  32. * That's why we avoid copying memory and insead build a linked list
  33. * of arrays to iterate through.
  34. *
  35. * @constructor
  36. */
  37. function ConsArray() {
  38. this.tail_ = new ConsArray.Cell(null, null);
  39. this.currCell_ = this.tail_;
  40. this.currCellPos_ = 0;
  41. };
  42. /**
  43. * Concatenates another array for iterating. Empty arrays are ignored.
  44. * This operation can be safely performed during ongoing ConsArray
  45. * iteration.
  46. *
  47. * @param {Array} arr Array to concatenate.
  48. */
  49. ConsArray.prototype.concat = function(arr) {
  50. if (arr.length > 0) {
  51. this.tail_.data = arr;
  52. this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
  53. }
  54. };
  55. /**
  56. * Whether the end of iteration is reached.
  57. */
  58. ConsArray.prototype.atEnd = function() {
  59. return this.currCell_ === null ||
  60. this.currCell_.data === null ||
  61. this.currCellPos_ >= this.currCell_.data.length;
  62. };
  63. /**
  64. * Returns the current item, moves to the next one.
  65. */
  66. ConsArray.prototype.next = function() {
  67. var result = this.currCell_.data[this.currCellPos_++];
  68. if (this.currCellPos_ >= this.currCell_.data.length) {
  69. this.currCell_ = this.currCell_.next;
  70. this.currCellPos_ = 0;
  71. }
  72. return result;
  73. };
  74. /**
  75. * A cell object used for constructing a list in ConsArray.
  76. *
  77. * @constructor
  78. */
  79. ConsArray.Cell = function(data, next) {
  80. this.data = data;
  81. this.next = next;
  82. };