V8 Project
Classes | Public Member Functions | List of all members
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy > Class Template Reference

#include <hashmap.h>

+ Inheritance diagram for v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >:
+ Collaboration diagram for v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >:

Classes

class  Iterator
 
struct  value_type
 

Public Member Functions

 STATIC_ASSERT (sizeof(Key *)==sizeof(void *))
 
 STATIC_ASSERT (sizeof(Value *)==sizeof(void *))
 
 TemplateHashMap (typename TemplateHashMapImpl< AllocationPolicy >::MatchFun match, AllocationPolicy allocator=AllocationPolicy())
 
Iterator begin () const
 
Iterator end () const
 
Iterator find (Key *key, bool insert=false, AllocationPolicy allocator=AllocationPolicy())
 

Additional Inherited Members

- Private Types inherited from v8::internal::TemplateHashMapImpl< AllocationPolicy >
typedef bool(* MatchFun) (void *key1, void *key2)
 
- Private Member Functions inherited from v8::internal::TemplateHashMapImpl< AllocationPolicy >
 TemplateHashMapImpl (MatchFun match, uint32_t capacity=kDefaultHashMapCapacity, AllocationPolicy allocator=AllocationPolicy())
 
 ~TemplateHashMapImpl ()
 
Entry * Lookup (void *key, uint32_t hash, bool insert, AllocationPolicy allocator=AllocationPolicy())
 
void * Remove (void *key, uint32_t hash)
 
void Clear ()
 
uint32_t occupancy () const
 
uint32_t capacity () const
 
Entry * Start () const
 
Entry * Next (Entry *p) const
 
- Static Private Member Functions inherited from v8::internal::TemplateHashMapImpl< AllocationPolicy >
static bool PointersMatch (void *key1, void *key2)
 
- Static Private Attributes inherited from v8::internal::TemplateHashMapImpl< AllocationPolicy >
static const uint32_t kDefaultHashMapCapacity = 8
 

Detailed Description

template<class Key, class Value, class AllocationPolicy>
class v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >

Definition at line 299 of file hashmap.h.

Constructor & Destructor Documentation

◆ TemplateHashMap()

template<class Key , class Value , class AllocationPolicy >
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::TemplateHashMap ( typename TemplateHashMapImpl< AllocationPolicy >::MatchFun  match,
AllocationPolicy  allocator = AllocationPolicy() 
)
inline

Definition at line 329 of file hashmap.h.

332  : TemplateHashMapImpl<AllocationPolicy>(
333  match,
334  TemplateHashMapImpl<AllocationPolicy>::kDefaultHashMapCapacity,
335  allocator) { }
v8::internal::TemplateHashMapImpl::kDefaultHashMapCapacity
static const uint32_t kDefaultHashMapCapacity
Definition: hashmap.h:24

Member Function Documentation

◆ begin()

template<class Key , class Value , class AllocationPolicy >
Iterator v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::begin ( ) const
inline

Definition at line 337 of file hashmap.h.

337 { return Iterator(this, this->Start()); }

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::Start().

+ Here is the call graph for this function:

◆ end()

template<class Key , class Value , class AllocationPolicy >
Iterator v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::end ( ) const
inline

Definition at line 338 of file hashmap.h.

338 { return Iterator(this, NULL); }
NULL
enable harmony numeric enable harmony object literal extensions Optimize object Array DOM strings and string trace pretenuring decisions of HAllocate instructions Enables optimizations which favor memory size over execution speed maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining trace the tracking of allocation sites deoptimize every n garbage collections perform array bounds checks elimination analyze liveness of environment slots and zap dead values flushes the cache of optimized code for closures on every GC allow uint32 values on optimize frames if they are used only in safe operations track concurrent recompilation artificial compilation delay in ms do not emit check maps for constant values that have a leaf deoptimize the optimized code if the layout of the maps changes enable context specialization in TurboFan execution budget before interrupt is triggered max percentage of megamorphic generic ICs to allow optimization enable use of SAHF instruction if enable use of VFP3 instructions if available enable use of NEON instructions if enable use of SDIV and UDIV instructions if enable use of MLS instructions if enable loading bit constant by means of movw movt instruction enable unaligned accesses for enable use of d16 d31 registers on ARM this requires VFP3 force all emitted branches to be in long enable alignment of csp to bytes on platforms which prefer the register to always be NULL
Definition: flag-definitions.h:407

References NULL.

◆ find()

template<class Key , class Value , class AllocationPolicy >
Iterator v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::find ( Key *  key,
bool  insert = false,
AllocationPolicy  allocator = AllocationPolicy() 
)
inline

Definition at line 339 of file hashmap.h.

340  {
341  return Iterator(this, this->Lookup(key, key->Hash(), insert, allocator));
342  }
v8::internal::TemplateHashMapImpl::Lookup
Entry * Lookup(void *key, uint32_t hash, bool insert, AllocationPolicy allocator=AllocationPolicy())
Definition: hashmap.h:114

References v8::internal::TemplateHashMapImpl< AllocationPolicy >::Lookup().

+ Here is the call graph for this function:

◆ STATIC_ASSERT() [1/2]

template<class Key , class Value , class AllocationPolicy >
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::STATIC_ASSERT ( sizeof(Key *)  = =sizeof(void *))

◆ STATIC_ASSERT() [2/2]

template<class Key , class Value , class AllocationPolicy >
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::STATIC_ASSERT ( sizeof(Value *)  = =sizeof(void *))
The documentation for this class was generated from the following file: