2016-09-25 22:14:36 +08:00
|
|
|
/*=============================================================================
|
|
|
|
|
# Filename: IDList.h
|
|
|
|
|
# Author: Bookug Lobert
|
|
|
|
|
# Mail: 1181955272@qq.com
|
|
|
|
|
# Last Modified: 2015-10-23 15:03
|
|
|
|
|
# Description: originally written by liyouhuan, modified by zengli
|
|
|
|
|
=============================================================================*/
|
|
|
|
|
|
|
|
|
|
#include "../Util/Util.h"
|
|
|
|
|
|
|
|
|
|
#ifndef _QUERY_IDLIST_H
|
|
|
|
|
#define _QUERY_IDLIST_H
|
|
|
|
|
|
|
|
|
|
class IDList
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
IDList();
|
|
|
|
|
int getID(int _i)const;
|
|
|
|
|
bool addID(int _id);
|
|
|
|
|
|
|
|
|
|
//check whether _id exists in this IDList.
|
|
|
|
|
bool isExistID(int _id) const;
|
|
|
|
|
int size() const;
|
|
|
|
|
bool empty() const;
|
|
|
|
|
const std::vector<int>* getList()const;
|
|
|
|
|
int& operator[] (const int & _i);
|
|
|
|
|
std::string to_str();
|
|
|
|
|
int sort();
|
|
|
|
|
void clear();
|
|
|
|
|
void copy(const std::vector<int>& _new_idlist);
|
|
|
|
|
void copy(const IDList* _new_idlist);
|
|
|
|
|
|
|
|
|
|
// intersect/union _id_list to this IDList, note that the two list must be ordered before using these two functions.
|
|
|
|
|
int intersectList(const int* _id_list, int _list_len);
|
|
|
|
|
int intersectList(const IDList&);
|
|
|
|
|
int unionList(const int* _id_list, int _list_len, bool only_literal=false);
|
|
|
|
|
int unionList(const IDList&, bool only_literal=false);
|
|
|
|
|
int bsearch_uporder(int _key);
|
|
|
|
|
static IDList* intersect(const IDList&, const int*, int);
|
|
|
|
|
private:
|
|
|
|
|
std::vector<int> id_list;
|
|
|
|
|
int erase(int i);
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#endif //_QUERY_IDLIST_H
|
|
|
|
|
|
