git-svn-id: svn://db.shs.com.ru/pip@901 12ceb7fc-bf1f-11e4-8940-5bc7170c53b5
This commit is contained in:
491
main.cpp
491
main.cpp
@@ -1,489 +1,14 @@
|
||||
#include "pip.h"
|
||||
|
||||
|
||||
template <typename Key, typename T>
|
||||
class PIHash {
|
||||
//template <typename Key1, typename T1> friend PIByteArray & operator >>(PIByteArray & s, PIHash<Key1, T1> & v);
|
||||
//template <typename Key1, typename T1> friend PIByteArray & operator <<(PIByteArray & s, const PIHash<Key1, T1> & v);
|
||||
public:
|
||||
PIHash() {;}
|
||||
PIHash(const PIHash<Key, T> & other) {*this = other;}
|
||||
virtual ~PIHash() {;}
|
||||
|
||||
PIHash<Key, T> & operator =(const PIHash<Key, T> & other) {
|
||||
if (this == &other) return *this;
|
||||
clear();
|
||||
pih_content = other.pih_content;
|
||||
return *this;
|
||||
}
|
||||
|
||||
typedef T mapped_type;
|
||||
typedef Key key_type;
|
||||
typedef PIPair<Key, T> value_type;
|
||||
/*
|
||||
class iterator {
|
||||
friend class PIHash<Key, T>;
|
||||
private:
|
||||
iterator(const PIHash<Key, T> * v, ssize_t p): parent(v), pos(p) {}
|
||||
const PIHash<Key, T> * parent;
|
||||
ssize_t pos;
|
||||
public:
|
||||
iterator(): parent(0), pos(0) {}
|
||||
const Key & key() const {return const_cast<PIHash<Key, T> * >(parent)->_key(pos);}
|
||||
T & value() {return const_cast<PIHash<Key, T> * >(parent)->_value(pos);}
|
||||
void operator ++() {++pos;}
|
||||
void operator ++(int) {++pos;}
|
||||
void operator --() {--pos;}
|
||||
void operator --(int) {--pos;}
|
||||
bool operator ==(const iterator & it) const {return (pos == it.pos);}
|
||||
bool operator !=(const iterator & it) const {return (pos != it.pos);}
|
||||
};
|
||||
|
||||
class reverse_iterator {
|
||||
friend class PIHash<Key, T>;
|
||||
private:
|
||||
reverse_iterator(const PIHash<Key, T> * v, ssize_t p): parent(v), pos(p) {}
|
||||
const PIHash<Key, T> * parent;
|
||||
ssize_t pos;
|
||||
public:
|
||||
reverse_iterator(): parent(0), pos(0) {}
|
||||
const Key & key() const {return const_cast<PIHash<Key, T> * >(parent)->_key(pos);}
|
||||
T & value() const {return const_cast<PIHash<Key, T> * >(parent)->_value(pos);}
|
||||
void operator ++() {--pos;}
|
||||
void operator ++(int) {--pos;}
|
||||
void operator --() {++pos;}
|
||||
void operator --(int) {++pos;}
|
||||
bool operator ==(const reverse_iterator & it) const {return (pos == it.pos);}
|
||||
bool operator !=(const reverse_iterator & it) const {return (pos != it.pos);}
|
||||
};
|
||||
*/
|
||||
class const_iterator {
|
||||
friend class PIHash<Key, T>;
|
||||
private:
|
||||
const_iterator(const PIHash<Key, T> * v, ssize_t p): parent(v), pos(p), bpos(0) {
|
||||
if (pos == 0) {
|
||||
pos = -1;
|
||||
nextPos();
|
||||
}
|
||||
}
|
||||
void nextPos() {
|
||||
while (++pos < parent->pih_content.size_s()) {
|
||||
if (!parent->pih_content[pos].isEmpty())
|
||||
return;
|
||||
}
|
||||
}
|
||||
const PIHash<Key, T> * parent;
|
||||
ssize_t pos, bpos;
|
||||
public:
|
||||
const_iterator(): parent(0), pos(0) {}
|
||||
//const value_type operator *() const {return parent->_pair(pos);}
|
||||
//const value_type* operator ->() const {cval = parent->_pair(pos); return &cval;}
|
||||
const Key & key() const {return const_cast<PIHash<Key, T> * >(parent)->pih_content[pos][bpos].key;}
|
||||
const T & value() const {return const_cast<PIHash<Key, T> * >(parent)->pih_content[pos][bpos].value;}
|
||||
void operator ++() {
|
||||
if (pos < parent->pih_content.size_s()) {
|
||||
if (bpos >= parent->pih_content[pos].size_s() - 1) {
|
||||
bpos = 0;
|
||||
nextPos();
|
||||
} else
|
||||
++bpos;
|
||||
} else {
|
||||
bpos = 0;
|
||||
++pos;
|
||||
}
|
||||
printf(" ++: %d %d\n", pos, bpos);
|
||||
}
|
||||
//void operator ++(int) {++pos;}
|
||||
void operator --() {
|
||||
--pos;
|
||||
}
|
||||
//void operator --(int) {--pos;}
|
||||
bool operator ==(const const_iterator & it) const {return (pos == it.pos && bpos == it.bpos);}
|
||||
bool operator !=(const const_iterator & it) const {return !(*this == it);}
|
||||
mutable value_type cval;
|
||||
};
|
||||
/*
|
||||
class const_reverse_iterator {
|
||||
friend class PIHash<Key, T>;
|
||||
private:
|
||||
const_reverse_iterator(const PIHash<Key, T> * v, ssize_t p): parent(v), pos(p) {}
|
||||
const PIHash<Key, T> * parent;
|
||||
ssize_t pos;
|
||||
public:
|
||||
const_reverse_iterator(): parent(0), pos(0) {}
|
||||
const value_type operator *() const {return parent->_pair(pos);}
|
||||
const value_type* operator ->() const {cval = parent->_pair(pos); return &cval;}
|
||||
void operator ++() {--pos;}
|
||||
void operator ++(int) {--pos;}
|
||||
void operator --() {++pos;}
|
||||
void operator --(int) {++pos;}
|
||||
bool operator ==(const const_reverse_iterator & it) const {return (pos == it.pos);}
|
||||
bool operator !=(const const_reverse_iterator & it) const {return (pos != it.pos);}
|
||||
mutable value_type cval;
|
||||
};
|
||||
*/
|
||||
//iterator begin() {return iterator(this, 0);}
|
||||
//iterator end() {return iterator(this, size());}
|
||||
const_iterator begin() const {return const_iterator(this, 0);}
|
||||
const_iterator end() const {return const_iterator(this, size());}
|
||||
const_iterator constBegin() const {return const_iterator(this, 0);}
|
||||
const_iterator constEnd() const {return const_iterator(this, size());}
|
||||
//reverse_iterator rbegin() {return reverse_iterator(this, size() - 1);}
|
||||
//reverse_iterator rend() {return reverse_iterator(this, -1);}
|
||||
//const_reverse_iterator rbegin() const {return const_reverse_iterator(this, size() - 1);}
|
||||
//const_reverse_iterator rend() const {return const_reverse_iterator(this, -1);}
|
||||
//const_reverse_iterator constRbegin() const {return const_reverse_iterator(this, size() - 1);}
|
||||
//const_reverse_iterator constRend() const {return const_reverse_iterator(this, -1);}
|
||||
|
||||
size_t size() const {return pih_content.size();}
|
||||
int size_s() const {return pih_content.size_s();}
|
||||
size_t length() const {return pih_content.size();}
|
||||
size_t capacity() const {return pih_content.size();}
|
||||
bool isEmpty() const {return (pih_content.size() == 0);}
|
||||
|
||||
T & operator [](const Key & key) {
|
||||
if (pih_content.isEmpty()) _rehash(1);
|
||||
uint k = piHash(key);
|
||||
int i = _index(k);
|
||||
if (i < pih_content.size_s()) {
|
||||
PIVector<HashEntry> & hv(pih_content[i]);
|
||||
if (hv.size_s() == 1) {
|
||||
if (hv[0].key == k)
|
||||
return hv[0].value;
|
||||
}
|
||||
for (int j = 0; j < hv.size_s(); ++j)
|
||||
if (hv[j].key == k)
|
||||
return hv[j].value;
|
||||
}
|
||||
if (pih_content[i].size_s() >= 3)
|
||||
_rehash(pih_content.size_s() * 2);
|
||||
i = _index(k);
|
||||
pih_content[i] << HashEntry(k);
|
||||
return pih_content[i].back().value;
|
||||
}
|
||||
const T operator [](const Key & key) const {return value(key);}
|
||||
T & at(const Key & key) {return (*this)[key];}
|
||||
const T at(const Key & key) const {return (*this)[key];}
|
||||
|
||||
PIHash<Key, T> & operator <<(const PIHash<Key, T> & other) {
|
||||
if (other.isEmpty()) return *this;
|
||||
for (int i = 0; i < other.pih_content.size_s(); ++i)
|
||||
for (int j = 0; j < other.pih_content[i].size_s(); ++j)
|
||||
insert(other.pih_content[i][j].key, other.pih_content[i][j].value);
|
||||
return *this;
|
||||
}
|
||||
|
||||
bool operator ==(const PIHash<Key, T> & t) const {return (pih_content == t.pih_content);}
|
||||
bool operator !=(const PIHash<Key, T> & t) const {return (pih_content != t.pih_content);}
|
||||
bool contains(const Key & key) const {
|
||||
bool f(false);
|
||||
_find(key, f);
|
||||
return f;
|
||||
}
|
||||
|
||||
PIHash<Key, T> & reserve(size_t new_size) {_rehash(new_size); return *this;}
|
||||
|
||||
PIHash<Key, T> & remove(const Key & key) {
|
||||
uint k = piHash(key);
|
||||
int i = _index(k);
|
||||
if (i >= pih_content.size_s()) return *this;
|
||||
PIVector<HashEntry> & hv(pih_content[i]);
|
||||
for (int j = 0; j < hv.size_s(); ++j)
|
||||
if (hv[j].key == k) {
|
||||
hv.remove(j);
|
||||
--j;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
PIHash<Key, T> & erase(const Key & key) {return remove(key);}
|
||||
PIHash<Key, T> & clear() {pih_content.clear(); return *this;}
|
||||
|
||||
void swap(PIHash<Key, T> & other) {
|
||||
piSwapBinary<PIVector<PIVector<HashEntry> > >(pih_content, other.pih_content);
|
||||
}
|
||||
|
||||
PIHash<Key, T> & insert(const Key & key, const T & value) {
|
||||
(*this)[key] = value;
|
||||
return *this;
|
||||
}
|
||||
const T value(const Key & key, const T & default_ = T()) const {
|
||||
uint k = piHash(key);
|
||||
int i = _index(k);
|
||||
if (i >= pih_content.size_s()) return default_;
|
||||
const PIVector<HashEntry> & hv(pih_content[i]);
|
||||
for (int j = 0; j < hv.size_s(); ++j)
|
||||
if (hv[j].key == k)
|
||||
return hv[j].value;
|
||||
return default_;
|
||||
}
|
||||
PIVector<T> values() const {
|
||||
PIVector<T> ret;
|
||||
for (int i = 0; i < pih_content.size_s(); ++i)
|
||||
for (int j = 0; j < pih_content[i].size_s(); ++j)
|
||||
ret << pih_content[i][j].value;
|
||||
return ret;
|
||||
}
|
||||
/*Key key(const T & value_, const Key & default_ = Key()) const {
|
||||
for (int i = 0; i < pih_content.size_s(); ++i)
|
||||
for (int j = 0; j < pih_content[i].size_s(); ++j)
|
||||
if (pih_content[i][j].value == value_)
|
||||
return pih_content[i][j].key;
|
||||
return default_;
|
||||
}
|
||||
PIVector<Key> keys() const {
|
||||
PIVector<Key> ret;
|
||||
for (int i = 0; i < pih_content.size_s(); ++i)
|
||||
for (int j = 0; j < pih_content[i].size_s(); ++j)
|
||||
ret << pih_content[i][j].key;
|
||||
return ret;
|
||||
}*/
|
||||
|
||||
/*void dump() {
|
||||
piCout << "PIHash" << size() << "entries" << PICoutManipulators::NewLine << "content:";
|
||||
for (size_t i = 0; i < pih_content.size(); ++i)
|
||||
piCout << PICoutManipulators::Tab << i << ":" << pih_content[i];
|
||||
piCout << "index:";
|
||||
for (size_t i = 0; i < pim_index.size(); ++i)
|
||||
piCout << PICoutManipulators::Tab << i << ":" << pim_index[i].key << "->" << pim_index[i].index;
|
||||
}*/
|
||||
|
||||
protected:
|
||||
struct HashEntry {
|
||||
HashEntry(uint k = 0, const T & v = T()): key(k), value(v) {;}
|
||||
uint key;
|
||||
T value;
|
||||
bool operator ==(const HashEntry & s) const {return key == s.key;}
|
||||
bool operator !=(const HashEntry & s) const {return key != s.key;}
|
||||
bool operator <(const HashEntry & s) const {return key < s.key;}
|
||||
bool operator >(const HashEntry & s) const {return key > s.key;}
|
||||
};
|
||||
/*template <typename Key1, typename T1> friend PIByteArray & operator >>(PIByteArray & s, PIDeque<typename PIHash<Key1, T1>::HashEntry> & v);
|
||||
template <typename Key1, typename T1> friend PIByteArray & operator <<(PIByteArray & s, const PIDeque<typename PIHash<Key1, T1>::HashEntry> & v);
|
||||
|
||||
const value_type _pair(ssize_t index) const {
|
||||
if (index < 0 || index >= pim_index.size_s())
|
||||
return value_type();
|
||||
//piCout << "_pair" << index << pim_index[index].index;
|
||||
return value_type(pim_index[index].key, pih_content[pim_index[index].index]);
|
||||
}
|
||||
Key & _key(ssize_t index) {return pim_index[index].key;}
|
||||
T & _value(ssize_t index) {return pih_content[pim_index[index].index];}*/
|
||||
|
||||
inline size_t asize(size_t s) {
|
||||
if (s == 0) return 0;
|
||||
if (pih_content.size() + pih_content.size() >= s && pih_content.size() < s)
|
||||
return pih_content.size() + pih_content.size();
|
||||
ssize_t t = 0, s_ = s - 1;
|
||||
while (s_ >> t) ++t;
|
||||
return (1 << t);
|
||||
}
|
||||
int _index(const uint & k) const {
|
||||
return k % pih_content.size_s();
|
||||
}
|
||||
void _rehash(int ns) {
|
||||
ns = asize(ns);
|
||||
if (pih_content.size_s() == ns) return;
|
||||
PIVector<PIVector<HashEntry> > nhc;
|
||||
nhc.resize(ns);
|
||||
for (int i = 0; i < pih_content.size_s(); ++i) {
|
||||
for (int j = 0; j < pih_content[i].size_s(); ++j) {
|
||||
HashEntry & e(pih_content[i][j]);
|
||||
int ni = e.key % ns;
|
||||
nhc[ni] << e;
|
||||
}
|
||||
}
|
||||
pih_content.swap(nhc);
|
||||
}
|
||||
|
||||
PIVector<PIVector<HashEntry> > pih_content;
|
||||
};
|
||||
|
||||
|
||||
template<typename Key, typename Type>
|
||||
inline PICout operator <<(PICout s, const PIHash<Key, Type> & v) {
|
||||
s.space();
|
||||
s.setControl(0, true);
|
||||
s << "{";
|
||||
bool first = true;
|
||||
for (typename PIHash<Key, Type>::const_iterator i = v.begin(); i != v.end(); ++i) {
|
||||
if (!first)
|
||||
s << ", ";
|
||||
first = false;
|
||||
s << i.key() << ": " << i.value();
|
||||
}
|
||||
s << "}";
|
||||
s.restoreControl();
|
||||
return s;
|
||||
}
|
||||
|
||||
|
||||
struct HS {
|
||||
HS() {i = 0; b0 = b1 = false;}
|
||||
PIString str;
|
||||
int i;
|
||||
bool b0, b1;
|
||||
};
|
||||
PICout operator <<(const PICout & s, const HS & v) {s << v.str << ", i =" << v.i << ", b =" << v.b0 << v.b1; return s;}
|
||||
|
||||
|
||||
|
||||
|
||||
#include <piobject.h>
|
||||
|
||||
typedef PIVector<int> MyType;
|
||||
REGISTER_VARIANT(MyType)
|
||||
|
||||
|
||||
class A: public PIObject {
|
||||
PIOBJECT(A)
|
||||
public:
|
||||
EVENT1(e1, MyType, v)
|
||||
};
|
||||
|
||||
|
||||
class B: public PIObject {
|
||||
PIOBJECT(B)
|
||||
public:
|
||||
EVENT_HANDLER1(void, h1, MyType, v) {piCout << "handler h1" << v;}
|
||||
EVENT_HANDLER(void, th) {piCout << "handler th";}
|
||||
};
|
||||
|
||||
|
||||
|
||||
int main() {
|
||||
B b;
|
||||
PIThread::runOnce([](){piCout << "thread 1"; piMSleep(1000);}, "first");
|
||||
PIThread::runOnce([](){piCout << "thread 2"; piMSleep(500);}, "second");
|
||||
PIThread::runOnce([](){piCout << "thread 3"; piMSleep(0);}, "third");
|
||||
PIThread::runOnce(&b, "th", "first th");
|
||||
PIThread::runOnce(&b, "th", "second th");
|
||||
PIThread::runOnce(&b, "th", "third th");
|
||||
piSleep(2);
|
||||
return 0;
|
||||
//
|
||||
//PITimer timer([](){piCout << "timer";});
|
||||
//t.setSlot(test);
|
||||
//timer.addDelimiter(5, [](void * d){piCout << "delim 5";});
|
||||
//timer.addDelimiter(2, [](){piCout << "delim 2";});
|
||||
//timer.start(100);
|
||||
//piMSleep(2000);
|
||||
|
||||
//A a;
|
||||
//B b;
|
||||
//int iii = 10;
|
||||
//CONNECTL(&a, e1, [&](MyType v){piCout << "lambda" << v << iii; ++iii;});
|
||||
//std::function<void(MyType)> f = [&](MyType v){piCout << "lambda" << v << iii; ++iii;};
|
||||
//piCout << typeid([&](MyType v){piCout << "lambda" << v << iii; ++iii;}).name();
|
||||
//piCout << typeid(f).name();
|
||||
//a.e1(PIVector<int>() << 1 << 2);
|
||||
//piCout << iii;
|
||||
//
|
||||
//return 0;
|
||||
|
||||
/*for (int i = 0; i < 0x2; ++i) {
|
||||
PIByteArray ba, ba2;
|
||||
writeOInt(ba, i); ba2 = ba;
|
||||
uint u = readOInt(ba2);
|
||||
piCout << "p =" << i << ", d =" << ba.toHex() << ", u =" << u;
|
||||
}
|
||||
for (int i = 0x7e; i < 0x82; ++i) {
|
||||
PIByteArray ba, ba2;
|
||||
writeOInt(ba, i); ba2 = ba;
|
||||
uint u = readOInt(ba2);
|
||||
piCout << "p =" << i << ", d =" << ba.toHex() << ", u =" << u;
|
||||
}
|
||||
for (int i = 0x3ffe; i < 0x4002; ++i) {
|
||||
PIByteArray ba, ba2;
|
||||
writeOInt(ba, i); ba2 = ba;
|
||||
uint u = readOInt(ba2);
|
||||
piCout << "p =" << i << ", d =" << ba.toHex() << ", u =" << u;
|
||||
}
|
||||
for (int i = 0x1ffffe; i < 0x200002; ++i) {
|
||||
PIByteArray ba, ba2;
|
||||
writeOInt(ba, i); ba2 = ba;
|
||||
uint u = readOInt(ba2);
|
||||
piCout << "p =" << i << ", d =" << ba.toHex() << ", u =" << u;
|
||||
}*/
|
||||
HS hs;
|
||||
hs.str = "123";
|
||||
hs.i = 321;
|
||||
hs.b1 = true;
|
||||
piCout << hs;
|
||||
PIByteArray ba;
|
||||
{
|
||||
PIChunkStream cs(PIChunkStream::Version_2);
|
||||
cs.add(1, hs.str).add(2, hs.i).add(3, hs.b0).add(4, hs.b1);
|
||||
ba = cs.data();
|
||||
}
|
||||
hs = HS();
|
||||
piCout << ba.size() << ba.toHex();
|
||||
piCout << hs;
|
||||
{
|
||||
PIChunkStream cs(ba);
|
||||
cs.readAll();
|
||||
cs.get(1, hs.str).get(2, hs.i).get(3, hs.b0).get(4, hs.b1);
|
||||
}
|
||||
piCout << hs;
|
||||
|
||||
return 0;
|
||||
|
||||
PIConnection con;
|
||||
PIString _str = "[connection]\ndevice.d = ser://COM2:9600\n";
|
||||
con.configureFromString(&_str);
|
||||
con.start();
|
||||
PISerial * s = con.deviceByName("d")->cast<PISerial>();
|
||||
while (1) {
|
||||
piMSleep(500);
|
||||
piCout << s;
|
||||
if (s)
|
||||
piCout << s->isOpened();
|
||||
}
|
||||
return 0;
|
||||
|
||||
PIHash<PIString, PIString> h;
|
||||
h["1"] = "x";
|
||||
h["2"] = "bbb";
|
||||
h["3"] = "bbc";
|
||||
h["4"] = "aaa";
|
||||
h["5"] = "123";
|
||||
h["6"] = "321";
|
||||
h["7"] = "aaa";
|
||||
h["7"] = "aaa!!!!!";
|
||||
piCout << h.size() << h.capacity();
|
||||
//h.reserve(64);
|
||||
//piCout << h.keys() << h.values();
|
||||
//piCout << (1 << 2);
|
||||
PIHash<PIString, PIString> h2;
|
||||
PIMap<PIString, PIString> m2;
|
||||
PIString prefix = "1234567890";
|
||||
PITimeMeasurer tm;
|
||||
double el = 0.;
|
||||
|
||||
tm.reset();
|
||||
for (int i=0; i<10000; ++i) {
|
||||
h2[prefix + PIString::fromNumber(i)+"1234567890"] = PIString::fromNumber(randomi());
|
||||
}
|
||||
el = tm.elapsed_m(); piCout << el << h2.capacity();
|
||||
|
||||
tm.reset();
|
||||
for (int i=0; i<10000; ++i) {
|
||||
m2[prefix + PIString::fromNumber(i)+"1234567890"] = PIString::fromNumber(randomi());
|
||||
}
|
||||
el = tm.elapsed_m(); piCout << el;
|
||||
piCout << "*********";
|
||||
|
||||
PIString _s;
|
||||
tm.reset();
|
||||
for (int i=10000; i>=0; --i) {
|
||||
_s = h2.value(prefix + PIString::fromNumber(i)+"1234567890");
|
||||
}
|
||||
el = tm.elapsed_m(); piCout << el << h2.capacity();
|
||||
|
||||
tm.reset();
|
||||
for (int i=10000; i>=0; --i) {
|
||||
_s = m2.value(prefix + PIString::fromNumber(i)+"1234567890");
|
||||
}
|
||||
el = tm.elapsed_m(); piCout << el;
|
||||
|
||||
//piCout << __sysoemname__;
|
||||
const char * s = "Eng, Русский №!123";
|
||||
PIString str = PIString::fromUTF8(s);
|
||||
piCout << str.size() << str;
|
||||
str.forEach([](PIChar c){piCout << c; return c;});
|
||||
PIFile f("1.txt", PIIODevice::ReadWrite);
|
||||
f.clear();
|
||||
f << str;
|
||||
return 0;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user