backends/quartz/bcursor.h

Go to the documentation of this file.

/* bcursor.h: Interface to Btree cursors
 *
 * Copyright 1999,2000,2001 BrightStation PLC
 * Copyright 2002,2003,2004,2006,2010 Olly Betts
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301
 * USA
 */

#ifndef OM_HGUARD_BCURSOR_H
#define OM_HGUARD_BCURSOR_H

#include <xapian/visibility.h>

#include "quartz_types.h"

#include <string>
using std::string;

#define BLK_UNUSED uint4(-1)

class Cursor {
    private:
        // Prevent copying
        Cursor(const Cursor &);
        Cursor & operator=(const Cursor &);

    public:
        Cursor() : p(0), c(-1), n(BLK_UNUSED), rewrite(false)
        {}

        byte * p;
        int c;
        uint4 n;
        bool rewrite;
};

class Btree;

class XAPIAN_VISIBILITY_DEFAULT Bcursor {
    private:
        Bcursor(const Bcursor &);

        Bcursor & operator=(const Bcursor &);

        void rebuild();

        bool is_positioned;

        bool is_after_end;

        bool have_read_tag;

        Btree * B;

        Cursor * C;

        unsigned long version;

        int level;

        bool get_key(string * key) const;

    public:
        Bcursor(Btree *B);

        ~Bcursor();

        string current_key;

        string current_tag;

        void read_tag();

        bool next();
 
        bool prev();

        bool find_entry(const string &key);

        bool after_end() { return is_after_end; }

        void del();
};

#endif /* OM_HGUARD_BCURSOR_H */

---