src: re2c::Range Class Reference

src

#include <range.h>

Collaboration diagram for re2c::Range:

Collaboration graph

[legend]

Public Member Functions
	~Range ()

Range *	next () const

uint32_t	lower () const

uint32_t	upper () const

Static Public Member Functions
static Range *	sym (uint32_t c)

static Range *	ran (uint32_t l, uint32_t u)

static Range *	add (const Range r1, const Range r2)

static Range *	sub (const Range r1, const Range r2)

Static Public Attributes
static free_list< Range * >	vFreeList

Friends
template<uint8_t >
Range *	re2c_test::range (uint32_t n)

Detailed Description

Definition at line 15 of file range.h.

Constructor & Destructor Documentation

re2c::Range::~Range ( )

inline

Definition at line 35 of file range.h.

     {
         vFreeList.erase (this);
     }

Here is the call graph for this function:

Member Function Documentation

Range * re2c::Range::add	(	const Range *	r1,
		const Range *	r2
	)

static

Definition at line 26 of file range.cc.

 {
     Range * head = NULL;
     Range * tail = NULL;
     for (; r1 && r2;)
     {
         if (r1->lb < r2->lb)
         {
             append_overlapping (head, tail, r1);
             r1 = r1->nx;
         }
         else
         {
             append_overlapping (head, tail, r2);
             r2 = r2->nx;
         }
     }
     for (; r1; r1 = r1->nx)
     {
         append_overlapping (head, tail, r1);
     }
     for (; r2; r2 = r2->nx)
     {
         append_overlapping (head, tail, r2);
     }
     return head;
 }

Here is the caller graph for this function:

uint32_t re2c::Range::lower ( ) const

inline

Definition at line 40 of file range.h.

40 { return lb; }

Here is the caller graph for this function:

Range* re2c::Range::next ( ) const

inline

Definition at line 39 of file range.h.

39 { return nx; }

Here is the caller graph for this function:

static Range* re2c::Range::ran	(	uint32_t	l,
		uint32_t	u
	)

inlinestatic

Definition at line 31 of file range.h.

     {
         return new Range (NULL, l, u);
     }

Here is the caller graph for this function:

Range * re2c::Range::sub	(	const Range *	r1,
		const Range *	r2
	)

static

Definition at line 61 of file range.cc.

 {
     Range * head = NULL;
     Range ** ptail = &head;
     while (r1)
     {
         if (!r2 || r2->lb >= r1->ub)
         {
             append (ptail, r1->lb, r1->ub);
             r1 = r1->nx;
         }
         else if (r2->ub <= r1->lb)
         {
             r2 = r2->nx;
         }
         else
         {
             if (r1->lb < r2->lb)
             {
                 append (ptail, r1->lb, r2->lb);
             }
             while (r2 && r2->ub < r1->ub)
             {
                 const uint32_t lb = r2->ub;
                 r2 = r2->nx;
                 const uint32_t ub = r2 && r2->lb < r1->ub
                     ? r2->lb
                     : r1->ub;
                 append (ptail, lb, ub);
             }
             r1 = r1->nx;
         }
     }
     return head;
 }

Here is the caller graph for this function:

static Range* re2c::Range::sym ( uint32_t c )

inlinestatic

Definition at line 27 of file range.h.

     {
         return new Range (NULL, c, c + 1);
     }

Here is the caller graph for this function:

uint32_t re2c::Range::upper ( ) const

inline

Definition at line 41 of file range.h.

41 { return ub; }

Here is the caller graph for this function:

Friends And Related Function Documentation

template<uint8_t >

Range* re2c_test::range ( uint32_t n )

friend

Member Data Documentation

free_list< Range * > re2c::Range::vFreeList

static

Definition at line 18 of file range.h.

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

util/range.h
util/range.cc