v8
V8 is Google’s open source high-performance JavaScript and WebAssembly engine, written in C++.
Loading...
Searching...
No Matches
v8::internal::SamplingCircularQueue< T, Length > Class Template Reference

#include <circular-queue.h>

Collaboration diagram for v8::internal::SamplingCircularQueue< T, Length >:

Classes

struct  Entry
 

Public Member Functions

 SamplingCircularQueue ()
 
 ~SamplingCircularQueue ()
 
 SamplingCircularQueue (const SamplingCircularQueue &)=delete
 
SamplingCircularQueueoperator= (const SamplingCircularQueue &)=delete
 
TStartEnqueue ()
 
void FinishEnqueue ()
 
TPeek ()
 
void Remove ()
 

Private Types

enum  { kEmpty , kFull }
 

Private Member Functions

EntryNext (Entry *entry)
 

Private Attributes

Entry buffer_ [Length]
 
Entryenqueue_pos_
 
Entrydequeue_pos_
 

Detailed Description

template<typename T, unsigned Length>
class v8::internal::SamplingCircularQueue< T, Length >

Definition at line 21 of file circular-queue.h.

Member Enumeration Documentation

◆ anonymous enum

template<typename T , unsigned Length>
anonymous enum
private
Enumerator
kEmpty 
kFull 

Definition at line 45 of file circular-queue.h.

Constructor & Destructor Documentation

◆ SamplingCircularQueue() [1/2]

template<typename T , unsigned L>
v8::internal::SamplingCircularQueue< T, L >::SamplingCircularQueue ( )

Definition at line 15 of file circular-queue-inl.h.

◆ ~SamplingCircularQueue()

template<typename T , unsigned L>
v8::internal::SamplingCircularQueue< T, L >::~SamplingCircularQueue ( )
default

◆ SamplingCircularQueue() [2/2]

template<typename T , unsigned Length>
v8::internal::SamplingCircularQueue< T, Length >::SamplingCircularQueue ( const SamplingCircularQueue< T, Length > & )
delete

Member Function Documentation

◆ FinishEnqueue()

template<typename T , unsigned L>
void v8::internal::SamplingCircularQueue< T, L >::FinishEnqueue ( )

Definition at line 51 of file circular-queue-inl.h.

Here is the call graph for this function:

◆ Next()

template<typename T , unsigned L>
SamplingCircularQueue< T, L >::Entry * v8::internal::SamplingCircularQueue< T, L >::Next ( Entry * entry)
private

Definition at line 58 of file circular-queue-inl.h.

◆ operator=()

template<typename T , unsigned Length>
SamplingCircularQueue & v8::internal::SamplingCircularQueue< T, Length >::operator= ( const SamplingCircularQueue< T, Length > & )
delete

◆ Peek()

template<typename T , unsigned L>
T * v8::internal::SamplingCircularQueue< T, L >::Peek ( )

Definition at line 24 of file circular-queue-inl.h.

Here is the call graph for this function:

◆ Remove()

template<typename T , unsigned L>
void v8::internal::SamplingCircularQueue< T, L >::Remove ( )

Definition at line 34 of file circular-queue-inl.h.

◆ StartEnqueue()

template<typename T , unsigned L>
T * v8::internal::SamplingCircularQueue< T, L >::StartEnqueue ( )

Definition at line 41 of file circular-queue-inl.h.

Member Data Documentation

◆ buffer_

template<typename T , unsigned Length>
Entry v8::internal::SamplingCircularQueue< T, Length >::buffer_[Length]
private

Definition at line 59 of file circular-queue.h.

◆ dequeue_pos_

template<typename T , unsigned Length>
Entry* v8::internal::SamplingCircularQueue< T, Length >::dequeue_pos_
private

Definition at line 61 of file circular-queue.h.

◆ enqueue_pos_

template<typename T , unsigned Length>
Entry* v8::internal::SamplingCircularQueue< T, Length >::enqueue_pos_
private

Definition at line 60 of file circular-queue.h.


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