add inverted list implementation

src/indexer/inverted_list.cc

@@ -0,0 +1,36 @@
+//
+// indexer main class definition
+// version: 1.0 
+// Copyright (C) 2018 James Wei (weijianlhp@163.com). All rights reserved
+//
+
+#include "inverted_list.h"
+
+namespace cloris {
+
+bool DocidNode::operator < (const DocidNode& dn) const {
+    return ((this->docid < dn.docid) || 
+            ((this->docid == dn.docid) && (!this->is_belong_to && dn.is_belong_to)));
+}
+
+bool DocidNode::operator == (const DocidNode& dn) const {
+    return (this->docid == dn.docid) && (this->is_belong_to == dn.is_belong_to);
+}
+
+bool DocidNode::operator != (const DocidNode& dn) const {
+    return (this->docid != dn.docid) || (this->is_belong_to != dn.is_belong_to);
+}
+
+void InvertedList::Add(bool is_belong_to, int docid) {
+    auto iter = doc_list_.begin();
+    for (; iter != doc_list_.end(); ++iter) {
+        if (iter->docid >= docid) {
+            break;
+        }
+    }
+    doc_list_.insert(iter, DocidNode(docid, is_belong_to));
+}
+
+} // namespace cloris
+
+

src/indexer/inverted_list.h

@@ -0,0 +1,43 @@
+//
+// indexer main class definition
+// version: 1.0 
+// Copyright (C) 2018 James Wei (weijianlhp@163.com). All rights reserved
+//
+
+#ifndef CLORIS_INVERTED_LIST_H_
+#define CLORIS_INVERTED_LIST_H_
+
+#include <unistd.h>
+#include <list>
+
+namespace cloris {
+
+//
+// we just treat docId AS int-type now
+//
+struct DocidNode {
+    DocidNode(int _docid, bool _is_belong_to) : docid(_docid), is_belong_to(_is_belong_to) {}
+    bool operator < (const DocidNode& dn) const; 
+    bool operator == (const DocidNode& dn) const; 
+    bool operator != (const DocidNode& dn) const; 
+
+    int docid;
+    bool is_belong_to;
+};
+
+// TODO switch general list to skip list 
+class InvertedList {
+public:
+    InvertedList() {}
+    ~InvertedList() {}
+    void Add(bool is_belong_to, int docid); 
+    const std::list<DocidNode>& doc_list() { return doc_list_; }
+    size_t length() const { return doc_list_.size(); }
+private:
+    std::list<DocidNode> doc_list_;
+    // skip_list<DocidNode> list;
+};
+
+} // namespace cloris
+
+#endif // CLORIS_INVERTED_LIST_H_