mirror of
https://github.com/bsnes-emu/bsnes.git
synced 2025-02-23 22:52:34 +01:00
092cac9073
byuu says:
Changelog:
- synchronizes lots of nall changes
- changes displayed program title from tomoko to higan(*)
- browser dialog sort is case-insensitive
- .sys folders look at user-selected library path; no longer hard-coded
Tried to get rid of the file modes from the Windows browser dialog, but
it was being a bitch so I left it on for now.
- The storage locations and binary still use tomoko. I'm not really sure
what to do here. The idea is there may be more than one "higan" UI in
the future, but I don't want people to go around calling the entire
program by the UI name. For official Windows releases, I can rename
the binaries to "higan-{profile}.exe", and by putting the config files
with the binary, they won't ever see the tomoko folder. Linux is of
course trickier.
Note: Windows users will need to edit hiro/components.hpp and comment
out these lines:
#define Hiro_Console
#define Hiro_IconView
#define Hiro_SourceView
#define Hiro_TreeView
I forgot to do that, and too lazy to upload another WIP.
137 lines
3.0 KiB
C++
137 lines
3.0 KiB
C++
#ifndef NALL_HASHSET_HPP
|
|
#define NALL_HASHSET_HPP
|
|
|
|
//hashset
|
|
//
|
|
//search: O(1) average; O(n) worst
|
|
//insert: O(1) average; O(n) worst
|
|
//remove: O(1) average; O(n) worst
|
|
//
|
|
//requirements:
|
|
// auto T::hash() const -> unsigned;
|
|
// auto T::operator==(const T&) const -> bool;
|
|
|
|
namespace nall {
|
|
|
|
template<typename T>
|
|
struct hashset {
|
|
hashset() = default;
|
|
hashset(unsigned length) : length(bit::round(length)) {}
|
|
hashset(const hashset& source) { operator=(source); }
|
|
hashset(hashset&& source) { operator=(move(source)); }
|
|
~hashset() { reset(); }
|
|
|
|
auto operator=(const hashset& source) -> hashset& {
|
|
reset();
|
|
if(source.pool) {
|
|
for(unsigned n = 0; n < source.count; n++) {
|
|
insert(*source.pool[n]);
|
|
}
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
auto operator=(hashset&& source) -> hashset& {
|
|
reset();
|
|
pool = source.pool;
|
|
length = source.length;
|
|
count = source.count;
|
|
source.pool = nullptr;
|
|
source.length = 8;
|
|
source.count = 0;
|
|
return *this;
|
|
}
|
|
|
|
auto capacity() const -> unsigned { return length; }
|
|
auto size() const -> unsigned { return count; }
|
|
auto empty() const -> bool { return count == 0; }
|
|
|
|
auto reset() -> void {
|
|
if(pool) {
|
|
for(unsigned n = 0; n < length; n++) {
|
|
if(pool[n]) {
|
|
delete pool[n];
|
|
pool[n] = nullptr;
|
|
}
|
|
}
|
|
delete pool;
|
|
pool = nullptr;
|
|
}
|
|
length = 8;
|
|
count = 0;
|
|
}
|
|
|
|
auto reserve(unsigned size) -> void {
|
|
//ensure all items will fit into pool (with <= 50% load) and amortize growth
|
|
size = bit::round(max(size, count << 1));
|
|
T** copy = new T*[size]();
|
|
|
|
if(pool) {
|
|
for(unsigned n = 0; n < length; n++) {
|
|
if(pool[n]) {
|
|
unsigned hash = (*pool[n]).hash() & (size - 1);
|
|
while(copy[hash]) if(++hash >= size) hash = 0;
|
|
copy[hash] = pool[n];
|
|
pool[n] = nullptr;
|
|
}
|
|
}
|
|
}
|
|
|
|
delete pool;
|
|
pool = copy;
|
|
length = size;
|
|
}
|
|
|
|
auto find(const T& value) -> maybe<T&> {
|
|
if(!pool) return nothing;
|
|
|
|
unsigned hash = value.hash() & (length - 1);
|
|
while(pool[hash]) {
|
|
if(value == *pool[hash]) return *pool[hash];
|
|
if(++hash >= length) hash = 0;
|
|
}
|
|
|
|
return nothing;
|
|
}
|
|
|
|
auto insert(const T& value) -> maybe<T&> {
|
|
if(!pool) pool = new T*[length]();
|
|
|
|
//double pool size when load is >= 50%
|
|
if(count >= (length >> 1)) reserve(length << 1);
|
|
count++;
|
|
|
|
unsigned hash = value.hash() & (length - 1);
|
|
while(pool[hash]) if(++hash >= length) hash = 0;
|
|
pool[hash] = new T(value);
|
|
|
|
return *pool[hash];
|
|
}
|
|
|
|
auto remove(const T& value) -> bool {
|
|
if(!pool) return false;
|
|
|
|
unsigned hash = value.hash() & (length - 1);
|
|
while(pool[hash]) {
|
|
if(value == *pool[hash]) {
|
|
delete pool[hash];
|
|
pool[hash] = nullptr;
|
|
count--;
|
|
return true;
|
|
}
|
|
if(++hash >= length) hash = 0;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
protected:
|
|
T** pool = nullptr;
|
|
unsigned length = 8; //length of pool
|
|
unsigned count = 0; //number of objects inside of the pool
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|