metaproxy_1::filter::Multi::FrontendSet Struct Reference

Collaboration diagram for metaproxy_1::filter::Multi::FrontendSet:

Classes
class	PresentJob

Public Member Functions
	FrontendSet (std::string setname)
	FrontendSet ()
	~FrontendSet ()
void	round_robin (int pos, int number, std::list< PresentJob > &job)
void	serve_order (int pos, int number, std::list< PresentJob > &job)

Public Attributes
std::list< BackendSet >	m_backend_sets
std::string	m_setname

Detailed Description

Definition at line 68 of file filter_multi.cpp.

Constructor & Destructor Documentation

FrontendSet() [1/2]

mp::filter::Multi::FrontendSet::FrontendSet

(

std::string

setname

)

Definition at line 221 of file filter_multi.cpp.

    :  m_setname(setname)
{
}

FrontendSet() [2/2]

mp::filter::Multi::FrontendSet::FrontendSet

(

)

Definition at line 227 of file filter_multi.cpp.

{
}

~FrontendSet()

mp::filter::Multi::FrontendSet::~FrontendSet

(

)

Definition at line 232 of file filter_multi.cpp.

{
}

Member Function Documentation

round_robin()

void mp::filter::Multi::FrontendSet::round_robin	(	int	pos,
		int	number,
		std::list< PresentJob > &	job
	)

Definition at line 298 of file filter_multi.cpp.

{
    std::list<int> pos;
    std::list<BackendSet>::const_iterator bsit;
    for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end(); bsit++)
    {
        pos.push_back(1);
    }
 
    int p = 1;
#if 1
    // optimization step!
    int omin = 0;
    while(true)
    {
        int min = 0;
        int no_left = 0;
        // find min count for each set which is > omin
        for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end(); bsit++)
        {
            if (bsit->m_count > omin)
            {
                if (no_left == 0 || bsit->m_count < min)
                    min = bsit->m_count;
                no_left++;
            }
        }
        if (no_left == 0) // if nothing greater than omin, bail out.
            break;
        int skip = no_left * min;
        if (p + skip > start)  // step gets us "into" present range?
        {
            // Yes. skip until start.. Rounding off is deliberate!
            min = (start-p) / no_left;
            p += no_left * min;
 
            // update positions in each set..
            std::list<int>::iterator psit = pos.begin();
            for (psit = pos.begin(); psit != pos.end(); psit++)
                *psit += min;
            break;
        }
        // skip on each set.. before "present range"..
        p = p + skip;
 
        std::list<int>::iterator psit = pos.begin();
        for (psit = pos.begin(); psit != pos.end(); psit++)
            *psit += min;
 
        omin = min; // update so we consider next class (with higher count)
    }
#endif
    int fetched = 0;
    bool more = true;
    while (more)
    {
        more = false;
        std::list<int>::iterator psit = pos.begin();
        bsit = m_backend_sets.begin();
 
        for (; bsit != m_backend_sets.end(); psit++,bsit++)
        {
            if (fetched >= number)
            {
                more = false;
                break;
            }
            if (*psit <= bsit->m_count)
            {
                if (p >= start)
                {
                    PresentJob job(bsit->m_backend, *psit);
                    jobs.push_back(job);
                    fetched++;
                }
                (*psit)++;
                p++;
                more = true;
            }
        }
    }
}

serve_order()

void mp::filter::Multi::FrontendSet::serve_order	(	int	pos,
		int	number,
		std::list< PresentJob > &	job
	)

Definition at line 275 of file filter_multi.cpp.

{
    int i;
    for (i = 0; i < number; i++)
    {
        std::list<BackendSet>::const_iterator bsit;
        int voffset = 0;
        int offset = start + i - 1;
        for (bsit = m_backend_sets.begin(); bsit != m_backend_sets.end();
             bsit++)
        {
            if (offset >= voffset && offset < voffset + bsit->m_count)
            {
                PresentJob job(bsit->m_backend, offset - voffset + 1);
                jobs.push_back(job);
                break;
            }
            voffset += bsit->m_count;
        }
    }
}

Member Data Documentation

m_backend_sets

std::list<BackendSet> metaproxy_1::filter::Multi::FrontendSet::m_backend_sets

Definition at line 84 of file filter_multi.cpp.

Referenced by metaproxy_1::filter::Multi::Frontend::search().

m_setname

std::string metaproxy_1::filter::Multi::FrontendSet::m_setname

Definition at line 85 of file filter_multi.cpp.

Referenced by metaproxy_1::filter::Multi::Frontend::search().

---

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

• filter_multi.cpp