Index
$#! · 0-9 · A · B · C · D · E · F · G · H · I · J · K · L · M · N · O · P · Q · R · S · T · U · V · W · X · Y · Z
P
 pa_to_da, packed_array
 pa_to_q, packed_array
 pa_to_ua, packed_array
 pa_type
 Package
 packed_array
 pair
 pair_comparator
 parent, tree_node
 partition, text
 pause, kitchen_timer
 peek, deque
 peek_first, deque
 peek_last, deque
 pop, deque
 Properties
 prune, tree_node
 push, deque
 putil
Q
 q_to_da
 q_to_pa, packed_array
 q_to_ua
 q_type
 queue
static function void pa_to_da(const ref pa_type pa,  
ref da_type da,  
input bit reverse =  0)
(STATIC) Converts a packed array of type T to a dynamic array of the same type.
static function void pa_to_q(const ref pa_type pa,  
ref q_type q,  
input bit reverse =  0)
(STATIC) Converts a packed array of type T to a queue of the same type.
static function void pa_to_ua(const ref pa_type pa,  
ref ua_type ua,  
input bit reverse =  0)
(STATIC) Converts a packed array of type T to an unpacked array of the same type.
typedef T [WIDTH-1:0] pa_type
The shorthand of the packed array of type T.
typedef T [WIDTH-1:0] pa_type
The shorthand of the packed array type of type T.
virtual class packed_array #(type T =  bit,
int WIDTH =  1)
A parameterized class that manages a packed array.
class pair#(type T1 =  int,
type T2 =  T1)
Provides a pair that carries two values, which can be different types.
class pair_comparator#(type T =  pair) extends comparator#(T)
(SINGLETON) Provides strategies to compare pairs.
tree_node_type parent
The parent node of this tree node.
static function three_strings partition(string s,
string sep)
(STATIC) Searches the first occurrence of the specified separator in the given string and returns an array of three strings.
function void pause()
Pauses the timer.
virtual function bit peek(ref e)
(VIRTUAL) Retrieves the head of the deque but does not remove the element.
virtual function bit peek_first(ref e)
(VIRTUAL) Retrieves the head of the deque but does not remove the element.
virtual function bit peek_last(ref e)
(VIRTUAL) Retrieves the tail of the deque but does not remove the element.
virtual function T pop()
(VIRTUAL) Pops an element from the deque as if it is a stack.
virtual function tree_node_type prune(int index =  0)
(VIRTUAL) Removes the specified child (and its descendants).
virtual function void push(e)
(VIRTUAL) Pushes an element to the deque as if it is a stack.
virtual class putil #(type T =  int)
(VIRTUAL) Provides a parameterized utility function.
static function void q_to_da(const ref q_type q,  
ref da_type da,  
input bit reverse =  0)
(STATIC) Converts a queue of type T to a dynamic array of the same type.
static function void q_to_da(const ref q_type q,  
ref da_type da,  
input bit reverse =  0)
(STATIC) Converts a queue of type T to a dynamic array of the same type.
static function void q_to_pa(const ref q_type q,  
ref pa_type pa,  
input bit reverse =  0)
(STATIC) Converts a queue of type T to a packed array of the same type.
static function void q_to_ua(const ref q_type q,  
ref ua_type ua,  
input bit reverse =  0)
(STATIC) Converts a queue of type T to an unpacked array of the same type.
static function void q_to_ua(const ref q_type q,  
ref ua_type ua,  
input bit reverse =  0)
(STATIC) Converts a queue of type T to an unpacked array of the same type.
typedef T q_type[$]
The shorthand of the queue type of type T.
typedef T q_type[$]
The shorthand of the queue type of type T.
typedef T q_type[$]
The shorthand of the queue of type T.
typedef T q_type[$]
The shorthand of the queue type of type T.
virtual class queue #(type T =  bit,
int SIZE =  1)
A parameterized class that manages a queue.