gfx/graphite2/src/Sparse.cpp

Wed, 31 Dec 2014 06:09:35 +0100

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Dec 2014 06:09:35 +0100
changeset 0
6474c204b198
permissions
-rw-r--r--

Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.

michael@0 1 /* GRAPHITE2 LICENSING
michael@0 2
michael@0 3 Copyright 2011, SIL International
michael@0 4 All rights reserved.
michael@0 5
michael@0 6 This library is free software; you can redistribute it and/or modify
michael@0 7 it under the terms of the GNU Lesser General Public License as published
michael@0 8 by the Free Software Foundation; either version 2.1 of License, or
michael@0 9 (at your option) any later version.
michael@0 10
michael@0 11 This program is distributed in the hope that it will be useful,
michael@0 12 but WITHOUT ANY WARRANTY; without even the implied warranty of
michael@0 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
michael@0 14 Lesser General Public License for more details.
michael@0 15
michael@0 16 You should also have received a copy of the GNU Lesser General Public
michael@0 17 License along with this library in the file named "LICENSE".
michael@0 18 If not, write to the Free Software Foundation, 51 Franklin Street,
michael@0 19 Suite 500, Boston, MA 02110-1335, USA or visit their web page on the
michael@0 20 internet at http://www.fsf.org/licenses/lgpl.html.
michael@0 21
michael@0 22 Alternatively, the contents of this file may be used under the terms of the
michael@0 23 Mozilla Public License (http://mozilla.org/MPL) or the GNU General Public
michael@0 24 License, as published by the Free Software Foundation, either version 2
michael@0 25 of the License or (at your option) any later version.
michael@0 26 */
michael@0 27 #include <cassert>
michael@0 28 #include "inc/Sparse.h"
michael@0 29 #include "inc/bits.h"
michael@0 30
michael@0 31 using namespace graphite2;
michael@0 32
michael@0 33 sparse::chunk sparse::empty_chunk = {0,0};
michael@0 34
michael@0 35 sparse::~sparse() throw()
michael@0 36 {
michael@0 37 if (m_array.map == &empty_chunk) return;
michael@0 38 free(m_array.values);
michael@0 39 }
michael@0 40
michael@0 41
michael@0 42 sparse::mapped_type sparse::operator [] (const key_type k) const throw()
michael@0 43 {
michael@0 44 mapped_type g = key_type(k/SIZEOF_CHUNK - m_nchunks) >> (sizeof k*8 - 1);
michael@0 45 const chunk & c = m_array.map[g*k/SIZEOF_CHUNK];
michael@0 46 const mask_t m = c.mask >> (SIZEOF_CHUNK - 1 - (k%SIZEOF_CHUNK));
michael@0 47 g *= m & 1;
michael@0 48
michael@0 49 return g*m_array.values[g*(c.offset + bit_set_count(m >> 1))];
michael@0 50 }
michael@0 51
michael@0 52
michael@0 53 size_t sparse::capacity() const throw()
michael@0 54 {
michael@0 55 size_t n = m_nchunks,
michael@0 56 s = 0;
michael@0 57
michael@0 58 for (const chunk *ci=m_array.map; n; --n, ++ci)
michael@0 59 s += bit_set_count(ci->mask);
michael@0 60
michael@0 61 return s;
michael@0 62 }

mercurial