Array.cpp 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  1. /*
  2. * Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/Function.h>
  27. #include <LibJS/Interpreter.h>
  28. #include <LibJS/Runtime/Array.h>
  29. namespace JS {
  30. Array::Array()
  31. {
  32. set_prototype(interpreter().array_prototype());
  33. put_native_property(
  34. "length",
  35. [this](Object*) {
  36. return Value(length());
  37. },
  38. [](Object*, Value) {
  39. ASSERT_NOT_REACHED();
  40. });
  41. }
  42. Array::~Array()
  43. {
  44. }
  45. Value Array::shift()
  46. {
  47. if (m_elements.size() == 0)
  48. return js_undefined();
  49. return Value(m_elements.take_first());
  50. }
  51. Value Array::pop()
  52. {
  53. if (m_elements.size() == 0)
  54. return js_undefined();
  55. return Value(m_elements.take_last());
  56. }
  57. void Array::push(Value value)
  58. {
  59. m_elements.append(value);
  60. }
  61. void Array::visit_children(Cell::Visitor& visitor)
  62. {
  63. Object::visit_children(visitor);
  64. for (auto& element : m_elements)
  65. visitor.visit(element);
  66. }
  67. Optional<Value> Array::get_own_property(const Object& this_object, const FlyString& property_name) const
  68. {
  69. bool ok;
  70. i32 index = property_name.to_int(ok);
  71. if (ok) {
  72. if (index >= 0 && index < length())
  73. return m_elements[index];
  74. }
  75. return Object::get_own_property(this_object, property_name);
  76. }
  77. bool Array::put_own_property(Object& this_object, const FlyString& property_name, Value value)
  78. {
  79. bool ok;
  80. i32 index = property_name.to_int(ok);
  81. if (ok && index >= 0) {
  82. if (index >= length())
  83. m_elements.resize(index + 1);
  84. m_elements[index] = value;
  85. return true;
  86. }
  87. return Object::put_own_property(this_object, property_name, value);
  88. }
  89. }