Find()

template<typename MonomType>

const MonomType *const * BIBasis::Polynom< MonomType >::Find ( const MonomType & monom ) const

private

Definition at line 662 of file polynom.hpp.

    {
        if (!MonomListHead || *MonomListHead < monom)
        {
            return 0;
        }
 
        MonomType * const *previousPointer = &MonomListHead,
                  * const *currentPointer = 0;
        unsigned long range(Length()), middle;
 
        while ((middle = range >> 1) > 0)
        {
            currentPointer = previousPointer;
            for (unsigned long i = 0; i < middle; ++i)
            {
                currentPointer = &((*currentPointer)->Next);
            }
 
            switch ((**currentPointer).Compare(monom))
            {
            case 1:
                previousPointer = currentPointer;
                range -= middle;
                break;
            case -1:
                range = middle;
                break;
            case 0:
                return currentPointer;
            }
        }
 
        return previousPointer;
    }

References Find(), Length(), and MonomListHead.

Referenced by Find(), and operator+=().