#if !defined  HAVE_RGS_KINCR_H__
#define       HAVE_RGS_KINCR_H__

#include "comb/comb-print.h"
#include "fxttypes.h"


class rgs_kincr
// Restricted growth strings (RGS) s[0,...,n-1] so that s[k] <= s[k-1]+k
// Lexicographic order.
// The number of length-n RGS is
// 1, 2, 7, 37, 268, 2496, 28612, 391189, 6230646 (seq A107877)
{
public:
    ulong *s_;  // restricted growth string
    ulong n_;   // Length of strings

public:
    rgs_kincr(ulong n)
    {
        n_ = n;
        s_ = new ulong[n_];
        first();
    }

    ~rgs_kincr()
    {
        delete [] s_;
    }

    void first()
    {
        ulong n = n_;
        for (ulong k=0; k<n; ++k)  s_[k] = 0;
    }

    ulong next()
    // Return index of first changed element in s[],
    // Return zero if current string is the last
    {
        ulong k = n_;

    start:
        --k;
        if ( k==0 )  return 0;

        ulong sk = s_[k] + 1;
//        ulong mp = s_[k-1] + 1 + (k&1);
//        ulong mp = s_[k-1] + 2 - (k&1);
        ulong mp = s_[k-1] + k;  // A107877
        if ( sk > mp )  // "carry"
        {
            s_[k] = 0;
            goto start;
        }

        s_[k] = sk;
        return k;
    }

    const ulong* data()  const  { return s_; }

    void print(bool dfz=false)  const
    { print_vec(0, data(), n_, dfz); }
};
// -------------------------


#endif  // !defined HAVE_RGS_KINCR_H__
