permvisit.h

来自「the FXT library: fast transforms and low」· C头文件 代码 · 共 42 行

H
42
字号
#if !defined HAVE_PERMVISIT_H__#define      HAVE_PERMVISIT_H__#include "fxttypes.h"#include "aux0/funcemu.h"class perm_visit{protected:    void first();    ulong next_recursion();    ulong n;    ulong q;    ulong idx;    ulong *x;  // current permutation    ulong *xi; // inverse of x[]    funcemu<ulong> *fe;public:    perm_visit(ulong nn);    ~perm_visit();    ulong next()    {        if ( 0==q )  return 0;        else        {            q = next_recursion();            return  ( q ? ++idx : 0 );        }    }    ulong current()  const  { return idx; }    const ulong *data()  const  { return x; }    const ulong *idata()  const  { return xi; }};// -------------------------#endif  // !defined HAVE_PERMVISIT_H__

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?