// Copyright (c) 2008 Roberto Raggi // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. #pragma once #include "CPlusPlusForwardDeclarations.h" #include namespace CPlusPlus { template class LiteralTable { LiteralTable(const LiteralTable &other); void operator =(const LiteralTable &other); public: typedef Literal *const *iterator; public: LiteralTable() : _literals(0), _buckets(0), _allocatedLiterals(0), _literalCount(-1), _allocatedBuckets(0) { } ~LiteralTable() { reset(); } void reset() { if (_literals) { Literal **lastLiteral = _literals + _literalCount + 1; for (Literal **it = _literals; it != lastLiteral; ++it) delete *it; std::free(_literals); } if (_buckets) std::free(_buckets); _literals = 0; _buckets = 0; _allocatedLiterals = 0; _literalCount = -1; _allocatedBuckets = 0; } bool empty() const { return _literalCount == -1; } unsigned size() const { return _literalCount + 1; } const Literal *at(unsigned index) const { return _literals[index]; } iterator begin() const { return _literals; } iterator end() const { return _literals + _literalCount + 1; } const Literal *findLiteral(const char *chars, unsigned size) const { if (_buckets) { unsigned h = Literal::hashCode(chars, size); Literal *literal = _buckets[h % _allocatedBuckets]; for (; literal; literal = static_cast(literal->_next)) { if (literal->size() == size && ! std::strncmp(literal->chars(), chars, size)) return literal; } } return 0; } const Literal *findOrInsertLiteral(const char *chars, unsigned size) { if (_buckets) { unsigned h = Literal::hashCode(chars, size); Literal *literal = _buckets[h % _allocatedBuckets]; for (; literal; literal = static_cast(literal->_next)) { if (literal->size() == size && ! std::strncmp(literal->chars(), chars, size)) return literal; } } Literal *literal = new Literal(chars, size); if (++_literalCount == _allocatedLiterals) { if (! _allocatedLiterals) _allocatedLiterals = 4; else _allocatedLiterals <<= 1; _literals = (Literal **) std::realloc(_literals, sizeof(Literal *) * _allocatedLiterals); } _literals[_literalCount] = literal; if (! _buckets || _literalCount * 5 >= _allocatedBuckets * 3) rehash(); else { unsigned h = literal->hashCode() % _allocatedBuckets; literal->_next = _buckets[h]; _buckets[h] = literal; } return literal; } protected: void rehash() { if (_buckets) std::free(_buckets); if (! _allocatedBuckets) _allocatedBuckets = 4; else _allocatedBuckets <<= 1; _buckets = (Literal **) std::calloc(_allocatedBuckets, sizeof(Literal *)); Literal **lastLiteral = _literals + (_literalCount + 1); for (Literal **it = _literals; it != lastLiteral; ++it) { Literal *literal = *it; unsigned h = literal->hashCode() % _allocatedBuckets; literal->_next = _buckets[h]; _buckets[h] = literal; } } protected: Literal **_literals; Literal **_buckets; int _allocatedLiterals; int _literalCount; int _allocatedBuckets; }; } // namespace CPlusPlus