|
Packit |
8f70b4 |
/*
|
|
Packit |
8f70b4 |
* lftp - file transfer program
|
|
Packit |
8f70b4 |
*
|
|
Packit |
8f70b4 |
* Copyright (c) 1996-2016 by Alexander V. Lukyanov (lav@yars.free.net)
|
|
Packit |
8f70b4 |
*
|
|
Packit |
8f70b4 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
8f70b4 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
8f70b4 |
* the Free Software Foundation; either version 3 of the License, or
|
|
Packit |
8f70b4 |
* (at your option) any later version.
|
|
Packit |
8f70b4 |
*
|
|
Packit |
8f70b4 |
* This program is distributed in the hope that it will be useful,
|
|
Packit |
8f70b4 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
8f70b4 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
Packit |
8f70b4 |
* GNU General Public License for more details.
|
|
Packit |
8f70b4 |
*
|
|
Packit |
8f70b4 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
8f70b4 |
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
Packit |
8f70b4 |
*/
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
#ifndef XMAP_H
|
|
Packit |
8f70b4 |
#define XMAP_H 1
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
#include "xarray.h"
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
class _xmap
|
|
Packit |
8f70b4 |
{
|
|
Packit |
8f70b4 |
protected:
|
|
Packit |
8f70b4 |
struct entry
|
|
Packit |
8f70b4 |
{
|
|
Packit |
8f70b4 |
entry *next;
|
|
Packit |
8f70b4 |
xstring key;
|
|
Packit |
8f70b4 |
};
|
|
Packit |
8f70b4 |
int value_size;
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
int hash_size;
|
|
Packit |
8f70b4 |
int make_hash(const xstring& s) const;
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
xarray_p<_xmap::entry> map;
|
|
Packit |
8f70b4 |
void new_map();
|
|
Packit |
8f70b4 |
void rebuild_map();
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
int entry_count;
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
int each_hash;
|
|
Packit |
8f70b4 |
entry *each_entry;
|
|
Packit |
8f70b4 |
entry *last_entry; // the entry returned by last each_begin/next
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
public:
|
|
Packit |
8f70b4 |
_xmap(int vs);
|
|
Packit |
8f70b4 |
~_xmap();
|
|
Packit |
8f70b4 |
void _add(const xstring& key,void *value);
|
|
Packit |
8f70b4 |
_xmap::entry **_lookup(const xstring& key);
|
|
Packit |
8f70b4 |
_xmap::entry *_lookup_c(const xstring& key) const;
|
|
Packit |
8f70b4 |
entry *_add(const xstring& key);
|
|
Packit |
8f70b4 |
void _remove(entry **ep);
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
entry *_each_begin();
|
|
Packit |
8f70b4 |
entry *_each_next();
|
|
Packit |
8f70b4 |
const xstring& each_key() const { return last_entry ? last_entry->key : xstring::null; }
|
|
Packit |
8f70b4 |
bool each_finished() const { return last_entry==0; }
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
int count() const { return entry_count; }
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
void _move_here(_xmap &o);
|
|
Packit |
8f70b4 |
void _empty();
|
|
Packit |
8f70b4 |
};
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
template<class T> class xmap : public _xmap
|
|
Packit |
8f70b4 |
{
|
|
Packit |
8f70b4 |
xmap& operator=(const xmap&); // make assignment fail
|
|
Packit |
8f70b4 |
xmap(const xmap&); // disable cloning
|
|
Packit |
8f70b4 |
public:
|
|
Packit |
8f70b4 |
xmap() : _xmap(sizeof(T)) {}
|
|
Packit |
8f70b4 |
~xmap() {}
|
|
Packit |
8f70b4 |
static T& payload(entry *e) {
|
|
Packit |
8f70b4 |
return *(T*)(e+1);
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
static T zero;
|
|
Packit |
8f70b4 |
T& lookup_Lv(const xstring& key) {
|
|
Packit |
8f70b4 |
entry **e=_lookup(key);
|
|
Packit |
8f70b4 |
if(e && *e)
|
|
Packit |
8f70b4 |
return payload(*e);
|
|
Packit |
8f70b4 |
return add(key,zero);
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
const T& lookup(const xstring& key) const {
|
|
Packit |
8f70b4 |
entry *e=_lookup_c(key);
|
|
Packit |
8f70b4 |
if(e)
|
|
Packit |
8f70b4 |
return payload(e);
|
|
Packit |
8f70b4 |
return zero;
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
const T& lookup(const char *key) const { return lookup(xstring::get_tmp(key)); }
|
|
Packit |
8f70b4 |
T& operator[](const xstring& key) { return lookup_Lv(key); }
|
|
Packit |
8f70b4 |
void remove(const xstring& key) { _remove(_lookup(key)); }
|
|
Packit |
8f70b4 |
T& add(const xstring& key,T e0) { return payload(_add(key))=e0; }
|
|
Packit |
8f70b4 |
const T& each_begin() { entry *e=_each_begin(); return e?payload(e):zero; }
|
|
Packit |
8f70b4 |
const T& each_next() { entry *e=_each_next(); return e?payload(e):zero; }
|
|
Packit |
8f70b4 |
const T& each_curr() { return last_entry?payload(last_entry):zero; }
|
|
Packit |
8f70b4 |
void move_here(xmap<T> &o) { _move_here(o); }
|
|
Packit |
8f70b4 |
void empty() { _empty(); }
|
|
Packit |
8f70b4 |
bool exists(const xstring& key) const { return _lookup_c(key); }
|
|
Packit |
8f70b4 |
};
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
template<class T> T xmap<T>::zero;
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
template<class T> class xmap_p : public _xmap
|
|
Packit |
8f70b4 |
{
|
|
Packit |
8f70b4 |
void dispose(T *p) { delete p; }
|
|
Packit |
8f70b4 |
public:
|
|
Packit |
8f70b4 |
xmap_p() : _xmap(sizeof(T*)) {}
|
|
Packit |
8f70b4 |
~xmap_p() {
|
|
Packit |
8f70b4 |
for(entry *e=_each_begin(); e; e=_each_next())
|
|
Packit |
8f70b4 |
dispose(payload(e));
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
T*& payload_Lv(entry *e) {
|
|
Packit |
8f70b4 |
return *(T**)(e+1);
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
T* payload(entry *e) const {
|
|
Packit |
8f70b4 |
return *(T**)(e+1);
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
T* lookup(const xstring& key) const {
|
|
Packit |
8f70b4 |
entry *e=_lookup_c(key);
|
|
Packit |
8f70b4 |
if(e)
|
|
Packit |
8f70b4 |
return payload(e);
|
|
Packit |
8f70b4 |
return 0;
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
T* lookup(const char *key) const { return lookup(xstring::get_tmp(key)); }
|
|
Packit |
8f70b4 |
T* borrow(const xstring& key) {
|
|
Packit |
8f70b4 |
entry **e=_lookup(key);
|
|
Packit |
8f70b4 |
if(e && *e) {
|
|
Packit |
8f70b4 |
T *p=payload(*e);
|
|
Packit |
8f70b4 |
_remove(e);
|
|
Packit |
8f70b4 |
return p;
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
return 0;
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
void remove(const xstring& key) {
|
|
Packit |
8f70b4 |
dispose(borrow(key));
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
void add(const xstring& key,T *e0) {
|
|
Packit |
8f70b4 |
entry *e=_add(key);
|
|
Packit |
8f70b4 |
dispose(payload(e));
|
|
Packit |
8f70b4 |
payload_Lv(e)=e0;
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
void add(const char *key,T *e0) { add(xstring::get_tmp(key),e0); }
|
|
Packit |
8f70b4 |
T *each_begin() { entry *e=_each_begin(); return e?payload(e):0; }
|
|
Packit |
8f70b4 |
T *each_next() { entry *e=_each_next(); return e?payload(e):0; }
|
|
Packit |
8f70b4 |
T *each_curr() { return last_entry?payload(last_entry):0; }
|
|
Packit |
8f70b4 |
void each_set(T *n) { payload_Lv(last_entry)=n; }
|
|
Packit |
8f70b4 |
void move_here(xmap_p<T> &o) { _move_here(o); }
|
|
Packit |
8f70b4 |
void empty() {
|
|
Packit |
8f70b4 |
for(int i=0; i
|
|
Packit |
8f70b4 |
while(map[i]) {
|
|
Packit |
8f70b4 |
dispose(payload(map[i]));
|
|
Packit |
8f70b4 |
_remove(&map[i]);
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
}
|
|
Packit |
8f70b4 |
bool exists(const xstring& key) const { return _lookup_c(key); }
|
|
Packit |
8f70b4 |
};
|
|
Packit |
8f70b4 |
|
|
Packit |
8f70b4 |
#endif // XMAP_H
|