Use array based storage in container objects (#3600)

Currently, collections use object based solutions for storing elements and iterating on them. If an element is deleted and re-inserted, the storage position is the same as before so the iteration order is wrong. This patch replaces the object based storage with an array based solution that helps to store and iterate elements as expected. JerryScript-DCO-1.0-Signed-off-by: Roland Takacs rtakacs@inf.u-szeged.hu
2020-03-17 19:30:55 +01:00
parent 1cfda262bd
commit 51a9575fd0
10 changed files with 726 additions and 437 deletions
@@ -72,7 +72,6 @@ typedef enum
  LIT_FIRST_INTERNAL_MAGIC_STRING = LIT_INTERNAL_MAGIC_STRING_NATIVE_POINTER,  /**< first index of internal
                                                                                *   magic strings */
  LIT_INTERNAL_MAGIC_STRING_WEAK_REFS, /**< Weak references to the current object */
-  LIT_INTERNAL_MAGIC_STRING_CONTAINER, /**< Literal ID for internal container objects */
  LIT_INTERNAL_MAGIC_STRING_INTERNAL_OBJECT, /**< Internal object ID for internal properties */
  LIT_MAGIC_STRING__COUNT /**< number of magic strings */
 } lit_magic_string_id_t;