recoll / Code / Diff of /src/rcldb/rcldb

Diff of /src/rcldb/rcldb_p.h [334e16] .. [edba3b]

Switch to unified view


...
    // purge because we actually don't know it, and the code fakes a
    // text length based on the term count.
    size_t txtlen;
};
#endif // IDX_THREADS

class TextSplitDb;

// A class for data and methods that would have to expose
// Xapian-specific stuff if they were in Rcl::Db. There could actually be
// 2 different ones for indexing or query as there is not much in
// common.
...
    bool xdocToUdi(Xapian::Document& xdoc, string &udi);

    /** Check if doc is indexed by term */
    bool hasTerm(const string& udi, int idxi, const string& term);

    /** Update existing Xapian document for pure extended attrs change */
    bool docToXdocXattrOnly(TextSplitDb *splitter, const string &udi, 
              Doc &doc, Xapian::Document& xdoc);
    /** Remove all terms currently indexed for field defined by idx prefix */
    bool clearField(Xapian::Document& xdoc, const string& pfx, 
          Xapian::termcount wdfdec);

    /** Check if term wdf is 0 and remove term if so */
    bool clearDocTermIfWdf0(Xapian::Document& xdoc, const string& term);

    /** Compute list of subdocuments for a given udi. We look for documents 
     * indexed by a parent term matching the udi, the posting list for the 
     * parentterm(udi)  (As suggested by James Aylett)
     *
     * Note that this is not currently recursive: all subdocs are supposed 

	a/src/rcldb/rcldb_p.h		b/src/rcldb/rcldb_p.h
	...		...
63	// purge because we actually don't know it, and the code fakes a	63	// purge because we actually don't know it, and the code fakes a
64	// text length based on the term count.	64	// text length based on the term count.
65	size_t txtlen;	65	size_t txtlen;
66	};	66	};
67	#endif // IDX_THREADS	67	#endif // IDX_THREADS
		68
		69	class TextSplitDb;
68		70
69	// A class for data and methods that would have to expose	71	// A class for data and methods that would have to expose
70	// Xapian-specific stuff if they were in Rcl::Db. There could actually be	72	// Xapian-specific stuff if they were in Rcl::Db. There could actually be
71	// 2 different ones for indexing or query as there is not much in	73	// 2 different ones for indexing or query as there is not much in
72	// common.	74	// common.
	...		...
139	bool xdocToUdi(Xapian::Document& xdoc, string &udi);	141	bool xdocToUdi(Xapian::Document& xdoc, string &udi);
140		142
141	/** Check if doc is indexed by term */	143	/** Check if doc is indexed by term */
142	bool hasTerm(const string& udi, int idxi, const string& term);	144	bool hasTerm(const string& udi, int idxi, const string& term);
143		145
		146	/** Update existing Xapian document for pure extended attrs change */
		147	bool docToXdocXattrOnly(TextSplitDb *splitter, const string &udi,
		148	Doc &doc, Xapian::Document& xdoc);
		149	/** Remove all terms currently indexed for field defined by idx prefix */
		150	bool clearField(Xapian::Document& xdoc, const string& pfx,
		151	Xapian::termcount wdfdec);
		152
		153	/** Check if term wdf is 0 and remove term if so */
		154	bool clearDocTermIfWdf0(Xapian::Document& xdoc, const string& term);
		155
144	/** Compute list of subdocuments for a given udi. We look for documents	156	/** Compute list of subdocuments for a given udi. We look for documents
145	* indexed by a parent term matching the udi, the posting list for the	157	* indexed by a parent term matching the udi, the posting list for the
146	* parentterm(udi) (As suggested by James Aylett)	158	* parentterm(udi) (As suggested by James Aylett)
147	*	159	*
148	* Note that this is not currently recursive: all subdocs are supposed	160	* Note that this is not currently recursive: all subdocs are supposed