tagtreeencoder.h

来自「这是在PCA下的基于IPP库示例代码例子,在网上下了IPP的库之后,设置相关参数」· C头文件 代码 · 共 88 行

/* ////////////////////////////////////////////////////////////////////////
//
//                  INTEL CORPORATION PROPRIETARY INFORMATION
//     This software is supplied under the terms of a license agreement or
//     nondisclosure agreement with Intel Corporation and may not be copied
//     or disclosed except in accordance with the terms of that agreement.
//          Copyright(c) 2002-2005 Intel Corporation. All Rights Reserved.
//
//
//
*/

/*
//  TagTreeEncoder implements tag tree coding system defined
//      in B.10.2 article of standard. It is used for packed header writing.
//
//
//
*/

#ifndef __TAGTREEENCODER_H__
#define __TAGTREEENCODER_H__

#include "phbitout.h"
#include "tagtree.h"

class TagTreeEncoder : public TagTree
{
public:
    TagTreeEncoder();
    TagTreeEncoder(const TagTreeEncoder& tt);
    TagTreeEncoder& operator=(const TagTreeEncoder& tt);

    void SetValue(unsigned int n, int value) const;

    template<class BitOutput>
        bool Encode(unsigned int n, int threshold, BitOutput &out) const
    {
        Node *leaf = &m_nodes[n];
        Node *stk[32 - 1];
        Node **stkptr;
        Node *node;

        stkptr = stk;
        node = leaf;

        while (node->m_parent)
        {
            *stkptr++ = node;
            node = node->m_parent;
        }

        int low = 0;
        for (;;)
        {
            if (low > node->m_state) node->m_state = low;
            else                     low = node->m_state;

            while (low < threshold)
            {
                if (low >= node->m_value)
                {
                    if (!node->m_isKnown)
                    {
                        out.Write1();
                        node->m_isKnown = 1;
                    }
                    break;
                }
                out.Write0();
                low++;
            }
            node->m_state = low;

            if (stkptr == stk) break;

            node = *--stkptr;

        }
        return leaf->m_state < threshold;
    }

};

#endif // __TAGTREEENCODER_H__