Lines Matching refs:JSThread

45     static JSHandle<Derived> Create(const JSThread *thread, int numberOfElements);
47     static JSHandle<Derived> Insert(const JSThread *thread, const JSHandle<Derived> &table,
50     static JSHandle<Derived> InsertWeakRef(const JSThread *thread, const JSHandle<Derived> &table,
53     static JSHandle<Derived> GrowCapacity(const JSThread *thread, const JSHandle<Derived> &table,
56     static JSHandle<Derived> Remove(const JSThread *thread, const JSHandle<Derived> &table,
59 …static JSHandle<Derived> Shrink(const JSThread *thread, const JSHandle<Derived> &table, int additi…
61     void Rehash(const JSThread *thread, Derived *newTable);
67     inline void RemoveEntry(const JSThread *thread, int entry);
88     inline void SetNumberOfElements(const JSThread *thread, int nof);
90     inline void SetNumberOfDeletedElements(const JSThread *thread, int nod);
92     inline void SetCapacity(const JSThread *thread, int capacity);
96     inline void SetNextTable(const JSThread *thread, JSTaggedValue nextTable);
103     inline void SetElement(const JSThread *thread, int index, JSTaggedValue element);
105     inline void SetKey(const JSThread *thread, int entry, JSTaggedValue key);
107     inline void SetValue(const JSThread *thread, int entry, JSTaggedValue value);
111     inline void SetNextEntry(const JSThread *thread, int entry, JSTaggedValue nextEntry);
120     inline void InsertNewEntry(const JSThread *thread, int bucket, int entry);
124     inline void SetDeletedNum(const JSThread *thread, int entry, JSTaggedValue num);
147 …static JSHandle<LinkedHashMap> Create(const JSThread *thread, int numberOfElements = MIN_CAPACITY);
149 …  static JSHandle<LinkedHashMap> Delete(const JSThread *thread, const JSHandle<LinkedHashMap> &obj,
152     static JSHandle<LinkedHashMap> Set(const JSThread *thread, const JSHandle<LinkedHashMap> &obj,
155 …static JSHandle<LinkedHashMap> SetWeakRef(const JSThread *thread, const JSHandle<LinkedHashMap> &o…
160 …static JSHandle<LinkedHashMap> Shrink(const JSThread *thread, const JSHandle<LinkedHashMap> &table,
165     void Clear(const JSThread *thread);
187 …static JSHandle<LinkedHashSet> Create(const JSThread *thread, int numberOfElements = MIN_CAPACITY);
189 …  static JSHandle<LinkedHashSet> Delete(const JSThread *thread, const JSHandle<LinkedHashSet> &obj,
192     static JSHandle<LinkedHashSet> Add(const JSThread *thread, const JSHandle<LinkedHashSet> &obj,
195 …static JSHandle<LinkedHashSet> AddWeakRef(const JSThread *thread, const JSHandle<LinkedHashSet> &o…
198 …static JSHandle<LinkedHashSet> Shrink(const JSThread *thread, const JSHandle<LinkedHashSet> &table,
203     void Clear(const JSThread *thread);