V8 Project
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator Class Reference

#include <hashmap.h>

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

Public Member Functions

Iteratoroperator++ ()
 
value_typeoperator-> ()
 
bool operator!= (const Iterator &other)
 

Private Member Functions

 Iterator (const TemplateHashMapImpl< AllocationPolicy > *map, typename TemplateHashMapImpl< AllocationPolicy >::Entry *entry)
 

Private Attributes

const TemplateHashMapImpl< AllocationPolicy > * map_
 
TemplateHashMapImpl< AllocationPolicy >::Entryentry_
 

Friends

class TemplateHashMap
 

Detailed Description

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

Definition at line 308 of file hashmap.h.

Constructor & Destructor Documentation

◆ Iterator()

template<class Key , class Value , class AllocationPolicy >
v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::Iterator ( const TemplateHashMapImpl< AllocationPolicy > *  map,
typename TemplateHashMapImpl< AllocationPolicy >::Entry entry 
)
inlineprivate

Definition at line 319 of file hashmap.h.

320  :
321  map_(map), entry_(entry) { }
const TemplateHashMapImpl< AllocationPolicy > * map_
Definition: hashmap.h:323
TemplateHashMapImpl< AllocationPolicy >::Entry * entry_
Definition: hashmap.h:324
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 map

Member Function Documentation

◆ operator!=()

template<class Key , class Value , class AllocationPolicy >
bool v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::operator!= ( const Iterator other)
inline

Definition at line 316 of file hashmap.h.

316 { return entry_ != other.entry_; }

References v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::entry_.

◆ operator++()

template<class Key , class Value , class AllocationPolicy >
Iterator& v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::operator++ ( )
inline

◆ operator->()

template<class Key , class Value , class AllocationPolicy >
value_type* v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::operator-> ( )
inline

Definition at line 315 of file hashmap.h.

315 { return reinterpret_cast<value_type*>(entry_); }

References v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::entry_.

Friends And Related Function Documentation

◆ TemplateHashMap

template<class Key , class Value , class AllocationPolicy >
friend class TemplateHashMap
friend

Definition at line 326 of file hashmap.h.

Member Data Documentation

◆ entry_

◆ map_

template<class Key , class Value , class AllocationPolicy >
const TemplateHashMapImpl<AllocationPolicy>* v8::internal::TemplateHashMap< Key, Value, AllocationPolicy >::Iterator::map_
private

The documentation for this class was generated from the following file: