re2c::ord_hash_set_t Class Reference

#include <ord_hash_set.h>

Public Member Functions
	ord_hash_set_t ()
	~ord_hash_set_t ()
size_t	size () const
size_t	insert (const void *data, size_t size)
template<typename data_t >
size_t	deref (size_t i, data_t *&data)

Detailed Description

Definition at line 19 of file ord_hash_set.h.

Constructor & Destructor Documentation

re2c::ord_hash_set_t::ord_hash_set_t

(

)

Definition at line 69 of file ord_hash_set.h.

    : elems()
    , lookup()
{}

re2c::ord_hash_set_t::~ord_hash_set_t

(

)

Definition at line 74 of file ord_hash_set.h.

{
    std::for_each(elems.begin(), elems.end(), free);
}

Member Function Documentation

template<typename data_t >

size_t re2c::ord_hash_set_t::deref	(	size_t	i,
		data_t *&	data
	)

Definition at line 106 of file ord_hash_set.h.

{
    elem_t *e = elems[i];
    data = reinterpret_cast<data_t*>(e->data);
    return e->size / sizeof(data_t);
}

Here is the caller graph for this function:

size_t re2c::ord_hash_set_t::insert	(	const void *	data,
		size_t	size
	)

Definition at line 84 of file ord_hash_set.h.

{
    const hash_t h = hash(data, size);

    std::map<hash_t, elem_t*>::const_iterator i = lookup.find(h);
    if (i != lookup.end())
    {
        for (elem_t *e = i->second; e; e = e->next)
        {
            if (e->size == size
                && memcmp(e->data, data, size) == 0)
            {
                return e->index;
            }
        }
    }

    const size_t index = elems.size();
    elems.push_back(lookup[h] = make_elem(lookup[h], index, size, data));
    return index;
}

Here is the caller graph for this function:

size_t re2c::ord_hash_set_t::size

(

)

const

Definition at line 79 of file ord_hash_set.h.

{
    return elems.size();
}

Here is the caller graph for this function:

---

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

• util/ord_hash_set.h