struct CrlValueList / crl_value_list_t

Description

List style storage. Has the same CRL syntax as vectors.

When read from a CRL file, lists read back as vectors until the day we implement type declarations in CRL.

To be compatible with vectors, lists have a lot of access functions. Most of them are quite inefficient because accessing a list with an integer index i needs O(i) time. If you access lists directly, use the functions that work on list_key_t instead, which provide direct access to the list cell.

Kinship

Immediate super class: ValueNested

Slots

Inherited Slots

Members

Inherited Members

Detailed Descriptions

ListValue const * children () const

Reader of slot 'children': The list of child values.

cross reference removal is not yet implemented

This reader is NULL safe; for this == NULL, it returns NULL.

[constructor] CrlValueList ()

[constructor] CrlValueList (ValueList const &)

void operator= (ValueList const &)

ListValue const * values () const

This function redirects execution to children().

The implementation is NULL-safe; for this == NULL, this function returns NULL.

int nentries () const

limited editing:

NULL safe: if this == NULL, returns 0

bool empty () const

NULL safe: if this == NULL, returns true

bool non_empty () const

NULL safe: if this == NULL, returns false

list_key_t front () const

list_key_t back () const

Value * first () const

Value * last () const

Value * value (list_key_t) const

If you want to do something like value(k)->get_bool(), use value_bool(k) instead. This also holds for type-exports to int, symbol, string, unsigned_t, signed_t.

bool value_bool (list_key_t) const

Just to be in sync with the get(), nth() and find() methods, we'll have the usual inlined cast functions here, too.

Always preferable over value(k)->get_bool(). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

int value_int (list_key_t) const

Always preferable over value(k)->get_int(). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

symbol_t value_symbol (list_key_t) const

Always preferable over value(k)->get_symbol(). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

char const * value_string (list_key_t) const

Always preferable over value(k)->get_string(). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

bool value (unsigned_t & result, list_key_t) const

Always preferable over value(k)->get(x). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

bool value (signed_t & result, list_key_t) const

Always preferable over value(k)->get(x). This does essentially the same, but potentially works for more cases. See Structure::nth() for a longer explanation.

list_key_t next (list_key_t) const

list_key_t previous (list_key_t) const

list_key_t prepend (Value *)

list append, but returns front() for NULL

list_key_t insert_before (list_key_t key, Value *)

list append and prepend, but returns 'key' for NULL

list_key_t insert_after (list_key_t nth, Value *)

list append and prepend, but returns 'key' for NULL

void erase (list_key_t key)

void erase (list_key_t & iter, list_key_t key)

void reset (list_key_t key)

bool has (list_key_t key) const

void set (list_key_t key, Value * value)

bool set_once (list_key_t key, Value * value)

void set (list_key_t key, AnyValue value)

bool set_once (list_key_t key, AnyValue value)

list_key_t append (AnyValue)

list_key_t prepend (AnyValue)