ÿØÿà�JFIF������ÿápExif��II*������[������¼ p!ranha?
Server IP : 104.21.87.198  /  Your IP : 172.71.124.200
Web Server : Apache/2.2.15 (CentOS)
System : Linux GA 2.6.32-431.1.2.0.1.el6.x86_64 #1 SMP Fri Dec 13 13:06:13 UTC 2013 x86_64
User : apache ( 48)
PHP Version : 5.6.38
Disable Function : NONE
MySQL : ON  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : ON  |  Sudo : ON  |  Pkexec : OFF
Directory :  /usr/include/QtCore/

Upload File :
Curr3nt_D!r [ Writeable ] D0cum3nt_r0Ot [ Writeable ]

 
Command :
Current File : /usr/include/QtCore/qmap.h
/****************************************************************************
**
** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtCore module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial Usage
** Licensees holding valid Qt Commercial licenses may use this file in
** accordance with the Qt Commercial License Agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Nokia.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file.  Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights.  These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.  Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
** $QT_END_LICENSE$
**
****************************************************************************/

#ifndef QMAP_H
#define QMAP_H

#include <QtCore/qatomic.h>
#include <QtCore/qiterator.h>
#include <QtCore/qlist.h>

#ifndef QT_NO_STL
#include <map>
#endif

#include <new>

QT_BEGIN_HEADER

QT_BEGIN_NAMESPACE

QT_MODULE(Core)

struct Q_CORE_EXPORT QMapData
{
    struct Node {
        Node *backward;
        Node *forward[1];
    };
    enum { LastLevel = 11, Sparseness = 3 };

    QMapData *backward;
    QMapData *forward[QMapData::LastLevel + 1];
    QBasicAtomicInt ref;
    int topLevel;
    int size;
    uint randomBits;
    uint insertInOrder : 1;
    uint sharable : 1;
    uint strictAlignment : 1;
    uint reserved : 29;

    static QMapData *createData(); // ### Qt5 remove me
    static QMapData *createData(int alignment);
    void continueFreeData(int offset);
    Node *node_create(Node *update[], int offset); // ### Qt5 remove me
    Node *node_create(Node *update[], int offset, int alignment);
    void node_delete(Node *update[], int offset, Node *node);
#ifdef QT_QMAP_DEBUG
    uint adjust_ptr(Node *node);
    void dump();
#endif

    static QMapData shared_null;
};


/*
    QMap uses qMapLessThanKey() to compare keys. The default
    implementation uses operator<(). For pointer types,
    qMapLessThanKey() casts the pointers to integers before it
    compares them, because operator<() is undefined on pointers
    that come from different memory blocks. (In practice, this
    is only a problem when running a program such as
    BoundsChecker.)
*/

template <class Key> inline bool qMapLessThanKey(const Key &key1, const Key &key2)
{
    return key1 < key2;
}

#ifndef QT_NO_PARTIAL_TEMPLATE_SPECIALIZATION
template <class Ptr> inline bool qMapLessThanKey(Ptr *key1, Ptr *key2)
{
    Q_ASSERT(sizeof(quintptr) == sizeof(Ptr *));
    return quintptr(key1) < quintptr(key2);
}

template <class Ptr> inline bool qMapLessThanKey(const Ptr *key1, const Ptr *key2)
{
    Q_ASSERT(sizeof(quintptr) == sizeof(const Ptr *));
    return quintptr(key1) < quintptr(key2);
}
#endif // QT_NO_PARTIAL_TEMPLATE_SPECIALIZATION

template <class Key, class T>
struct QMapNode {
    Key key;
    T value;
    QMapData::Node *backward;
    QMapData::Node *forward[1];
};

template <class Key, class T>
struct QMapPayloadNode
{
    Key key;
    T value;
    QMapData::Node *backward;
};

template <class Key, class T>
class QMap
{
    typedef QMapNode<Key, T> Node;
    typedef QMapPayloadNode<Key, T> PayloadNode;

    union {
        QMapData *d;
        QMapData::Node *e;
    };

    static inline int payload() { return sizeof(PayloadNode) - sizeof(QMapData::Node *); }
    static inline int alignment() {
#ifdef Q_ALIGNOF
        return int(qMax(sizeof(void*), Q_ALIGNOF(Node)));
#else
        return 0;
#endif
    }
    static inline Node *concrete(QMapData::Node *node) {
        return reinterpret_cast<Node *>(reinterpret_cast<char *>(node) - payload());
    }

public:
    inline QMap() : d(&QMapData::shared_null) { d->ref.ref(); }
    inline QMap(const QMap<Key, T> &other) : d(other.d)
    { d->ref.ref(); if (!d->sharable) detach(); }
    inline ~QMap() { if (!d) return; if (!d->ref.deref()) freeData(d); }

    QMap<Key, T> &operator=(const QMap<Key, T> &other);
#ifndef QT_NO_STL
    explicit QMap(const typename std::map<Key, T> &other);
    std::map<Key, T> toStdMap() const;
#endif

    bool operator==(const QMap<Key, T> &other) const;
    inline bool operator!=(const QMap<Key, T> &other) const { return !(*this == other); }

    inline int size() const { return d->size; }

    inline bool isEmpty() const { return d->size == 0; }

    inline void detach() { if (d->ref != 1) detach_helper(); }
    inline bool isDetached() const { return d->ref == 1; }
    inline void setSharable(bool sharable) { if (!sharable) detach(); d->sharable = sharable; }
    inline void setInsertInOrder(bool ordered) { d->insertInOrder = ordered; }

    void clear();

    int remove(const Key &key);
    T take(const Key &key);

    bool contains(const Key &key) const;
    const Key key(const T &value) const;
    const Key key(const T &value, const Key &defaultKey) const;
    const T value(const Key &key) const;
    const T value(const Key &key, const T &defaultValue) const;
    T &operator[](const Key &key);
    const T operator[](const Key &key) const;

    QList<Key> uniqueKeys() const;
    QList<Key> keys() const;
    QList<Key> keys(const T &value) const;
    QList<T> values() const;
    QList<T> values(const Key &key) const;
    int count(const Key &key) const;

    class const_iterator;

    class iterator
    {
        friend class const_iterator;
        QMapData::Node *i;

    public:
        typedef std::bidirectional_iterator_tag iterator_category;
        typedef ptrdiff_t difference_type;
        typedef T value_type;
        typedef T *pointer;
        typedef T &reference;

        // ### Qt 5: get rid of 'operator Node *'
        inline operator QMapData::Node *() const { return i; }
        inline iterator() : i(0) { }
        inline iterator(QMapData::Node *node) : i(node) { }

        inline const Key &key() const { return concrete(i)->key; }
        inline T &value() const { return concrete(i)->value; }
#ifdef QT3_SUPPORT
        inline QT3_SUPPORT T &data() const { return concrete(i)->value; }
#endif
        inline T &operator*() const { return concrete(i)->value; }
        inline T *operator->() const { return &concrete(i)->value; }
        inline bool operator==(const iterator &o) const { return i == o.i; }
        inline bool operator!=(const iterator &o) const { return i != o.i; }

        inline iterator &operator++() {
            i = i->forward[0];
            return *this;
        }
        inline iterator operator++(int) {
            iterator r = *this;
            i = i->forward[0];
            return r;
        }
        inline iterator &operator--() {
            i = i->backward;
            return *this;
        }
        inline iterator operator--(int) {
            iterator r = *this;
            i = i->backward;
            return r;
        }
        inline iterator operator+(int j) const
        { iterator r = *this; if (j > 0) while (j--) ++r; else while (j++) --r; return r; }
        inline iterator operator-(int j) const { return operator+(-j); }
        inline iterator &operator+=(int j) { return *this = *this + j; }
        inline iterator &operator-=(int j) { return *this = *this - j; }

        // ### Qt 5: not sure this is necessary anymore
#ifdef QT_STRICT_ITERATORS
    private:
#else
    public:
#endif
        inline bool operator==(const const_iterator &o) const
            { return i == o.i; }
        inline bool operator!=(const const_iterator &o) const
            { return i != o.i; }

    private:
        // ### Qt 5: remove
        inline operator bool() const { return false; }
    };
    friend class iterator;

    class const_iterator
    {
        friend class iterator;
        QMapData::Node *i;

    public:
        typedef std::bidirectional_iterator_tag iterator_category;
        typedef ptrdiff_t difference_type;
        typedef T value_type;
        typedef const T *pointer;
        typedef const T &reference;

        // ### Qt 5: get rid of 'operator Node *'
        inline operator QMapData::Node *() const { return i; }
        inline const_iterator() : i(0) { }
        inline const_iterator(QMapData::Node *node) : i(node) { }
#ifdef QT_STRICT_ITERATORS
        explicit inline const_iterator(const iterator &o)
#else
        inline const_iterator(const iterator &o)
#endif
        { i = o.i; }

        inline const Key &key() const { return concrete(i)->key; }
        inline const T &value() const { return concrete(i)->value; }
#ifdef QT3_SUPPORT
        inline QT3_SUPPORT const T &data() const { return concrete(i)->value; }
#endif
        inline const T &operator*() const { return concrete(i)->value; }
        inline const T *operator->() const { return &concrete(i)->value; }
        inline bool operator==(const const_iterator &o) const { return i == o.i; }
        inline bool operator!=(const const_iterator &o) const { return i != o.i; }

        inline const_iterator &operator++() {
            i = i->forward[0];
            return *this;
        }
        inline const_iterator operator++(int) {
            const_iterator r = *this;
            i = i->forward[0];
            return r;
        }
        inline const_iterator &operator--() {
            i = i->backward;
            return *this;
        }
        inline const_iterator operator--(int) {
            const_iterator r = *this;
            i = i->backward;
            return r;
        }
        inline const_iterator operator+(int j) const
        { const_iterator r = *this; if (j > 0) while (j--) ++r; else while (j++) --r; return r; }
        inline const_iterator operator-(int j) const { return operator+(-j); }
        inline const_iterator &operator+=(int j) { return *this = *this + j; }
        inline const_iterator &operator-=(int j) { return *this = *this - j; }

        // ### Qt 5: not sure this is necessary anymore
#ifdef QT_STRICT_ITERATORS
    private:
        inline bool operator==(const iterator &o) { return operator==(const_iterator(o)); }
        inline bool operator!=(const iterator &o) { return operator!=(const_iterator(o)); }
#endif

    private:
        // ### Qt 5: remove
        inline operator bool() const { return false; }
    };
    friend class const_iterator;

    // STL style
    inline iterator begin() { detach(); return iterator(e->forward[0]); }
    inline const_iterator begin() const { return const_iterator(e->forward[0]); }
    inline const_iterator constBegin() const { return const_iterator(e->forward[0]); }
    inline iterator end() {
        detach();
        return iterator(e);
    }
    inline const_iterator end() const { return const_iterator(e); }
    inline const_iterator constEnd() const { return const_iterator(e); }
    iterator erase(iterator it);
#ifdef QT3_SUPPORT
    inline QT3_SUPPORT iterator remove(iterator it) { return erase(it); }
    inline QT3_SUPPORT void erase(const Key &aKey) { remove(aKey); }
#endif

    // more Qt
    typedef iterator Iterator;
    typedef const_iterator ConstIterator;
    inline int count() const { return d->size; }
    iterator find(const Key &key);
    const_iterator find(const Key &key) const;
    const_iterator constFind(const Key &key) const;
    iterator lowerBound(const Key &key);
    const_iterator lowerBound(const Key &key) const;
    iterator upperBound(const Key &key);
    const_iterator upperBound(const Key &key) const;
    iterator insert(const Key &key, const T &value);
#ifdef QT3_SUPPORT
    QT3_SUPPORT iterator insert(const Key &key, const T &value, bool overwrite);
#endif
    iterator insertMulti(const Key &key, const T &value);
#ifdef QT3_SUPPORT
    inline QT3_SUPPORT iterator replace(const Key &aKey, const T &aValue) { return insert(aKey, aValue); }
#endif
    QMap<Key, T> &unite(const QMap<Key, T> &other);

    // STL compatibility
    typedef Key key_type;
    typedef T mapped_type;
    typedef ptrdiff_t difference_type;
    typedef int size_type;
    inline bool empty() const { return isEmpty(); }

#ifdef QT_QMAP_DEBUG
    inline void dump() const { d->dump(); }
#endif

private:
    void detach_helper();
    void freeData(QMapData *d);
    QMapData::Node *findNode(const Key &key) const;
    QMapData::Node *mutableFindNode(QMapData::Node *update[], const Key &key) const;
    QMapData::Node *node_create(QMapData *d, QMapData::Node *update[], const Key &key,
                                const T &value);
};

template <class Key, class T>
Q_INLINE_TEMPLATE QMap<Key, T> &QMap<Key, T>::operator=(const QMap<Key, T> &other)
{
    if (d != other.d) {
        other.d->ref.ref();
        if (!d->ref.deref())
            freeData(d);
        d = other.d;
        if (!d->sharable)
            detach_helper();
    }
    return *this;
}

template <class Key, class T>
Q_INLINE_TEMPLATE void QMap<Key, T>::clear()
{
    *this = QMap<Key, T>();
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMapData::Node *
QMap<Key, T>::node_create(QMapData *adt, QMapData::Node *aupdate[], const Key &akey, const T &avalue)
{
    QMapData::Node *abstractNode = adt->node_create(aupdate, payload(), alignment());
    QT_TRY {
        Node *concreteNode = concrete(abstractNode);
        new (&concreteNode->key) Key(akey);
        QT_TRY {
            new (&concreteNode->value) T(avalue);
        } QT_CATCH(...) {
            concreteNode->key.~Key();
            QT_RETHROW;
        }
    } QT_CATCH(...) {
        adt->node_delete(aupdate, payload(), abstractNode);
        QT_RETHROW;
    }

    // clean up the update array for further insertions
    /*
    for (int i = 0; i <= d->topLevel; ++i) {
        if ( aupdate[i]==reinterpret_cast<QMapData::Node *>(adt) || aupdate[i]->forward[i] != abstractNode)
            break;
        aupdate[i] = abstractNode;
    }
*/

    return abstractNode;
}

template <class Key, class T>
Q_INLINE_TEMPLATE QMapData::Node *QMap<Key, T>::findNode(const Key &akey) const
{
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
    }

    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        return next;
    } else {
        return e;
    }
}

template <class Key, class T>
Q_INLINE_TEMPLATE const T QMap<Key, T>::value(const Key &akey) const
{
    QMapData::Node *node;
    if (d->size == 0 || (node = findNode(akey)) == e) {
        return T();
    } else {
        return concrete(node)->value;
    }
}

template <class Key, class T>
Q_INLINE_TEMPLATE const T QMap<Key, T>::value(const Key &akey, const T &adefaultValue) const
{
    QMapData::Node *node;
    if (d->size == 0 || (node = findNode(akey)) == e) {
        return adefaultValue;
    } else {
        return concrete(node)->value;
    }
}

template <class Key, class T>
Q_INLINE_TEMPLATE const T QMap<Key, T>::operator[](const Key &akey) const
{
    return value(akey);
}

template <class Key, class T>
Q_INLINE_TEMPLATE T &QMap<Key, T>::operator[](const Key &akey)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *node = mutableFindNode(update, akey);
    if (node == e)
        node = node_create(d, update, akey, T());
    return concrete(node)->value;
}

template <class Key, class T>
Q_INLINE_TEMPLATE int QMap<Key, T>::count(const Key &akey) const
{
    int cnt = 0;
    QMapData::Node *node = findNode(akey);
    if (node != e) {
        do {
            ++cnt;
            node = node->forward[0];
        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
    }
    return cnt;
}

template <class Key, class T>
Q_INLINE_TEMPLATE bool QMap<Key, T>::contains(const Key &akey) const
{
    return findNode(akey) != e;
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::insert(const Key &akey,
                                                                       const T &avalue)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *node = mutableFindNode(update, akey);
    if (node == e) {
        node = node_create(d, update, akey, avalue);
    } else {
        concrete(node)->value = avalue;
    }
    return iterator(node);
}

#ifdef QT3_SUPPORT
template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::insert(const Key &akey,
                                                                       const T &avalue,
                                                                       bool aoverwrite)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *node = mutableFindNode(update, akey);
    if (node == e) {
        node = node_create(d, update, akey, avalue);
    } else {
        if (aoverwrite)
            concrete(node)->value = avalue;
    }
    return iterator(node);
}
#endif

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::insertMulti(const Key &akey,
                                                                            const T &avalue)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    return iterator(node_create(d, update, akey, avalue));
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::const_iterator QMap<Key, T>::find(const Key &akey) const
{
    return const_iterator(findNode(akey));
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::const_iterator QMap<Key, T>::constFind(const Key &akey) const
{
    return const_iterator(findNode(akey));
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::find(const Key &akey)
{
    detach();
    return iterator(findNode(akey));
}

template <class Key, class T>
Q_INLINE_TEMPLATE QMap<Key, T> &QMap<Key, T>::unite(const QMap<Key, T> &other)
{
    QMap<Key, T> copy(other);
    const_iterator it = copy.constEnd();
    const const_iterator b = copy.constBegin();
    while (it != b) {
        --it;
        insertMulti(it.key(), it.value());
    }
    return *this;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE void QMap<Key, T>::freeData(QMapData *x)
{
    if (QTypeInfo<Key>::isComplex || QTypeInfo<T>::isComplex) {
        QMapData *cur = x;
        QMapData *next = cur->forward[0];
        while (next != x) {
            cur = next;
            next = cur->forward[0];
#if defined(_MSC_VER) && (_MSC_VER >= 1300)
#pragma warning(disable:4189)
#endif
            Node *concreteNode = concrete(reinterpret_cast<QMapData::Node *>(cur));
            concreteNode->key.~Key();
            concreteNode->value.~T();
#if defined(_MSC_VER) && (_MSC_VER >= 1300)
#pragma warning(default:4189)
#endif
        }
    }
    x->continueFreeData(payload());
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE int QMap<Key, T>::remove(const Key &akey)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;
    int oldSize = d->size;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
        update[i] = cur;
    }

    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        bool deleteNext = true;
        do {
            cur = next;
            next = cur->forward[0];
            deleteNext = (next != e && !qMapLessThanKey<Key>(concrete(cur)->key, concrete(next)->key));
            concrete(cur)->key.~Key();
            concrete(cur)->value.~T();
            d->node_delete(update, payload(), cur);
        } while (deleteNext);
    }
    return oldSize - d->size;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE T QMap<Key, T>::take(const Key &akey)
{
    detach();

    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
        update[i] = cur;
    }

    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        T t = concrete(next)->value;
        concrete(next)->key.~Key();
        concrete(next)->value.~T();
        d->node_delete(update, payload(), next);
        return t;
    }
    return T();
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::erase(iterator it)
{
    QMapData::Node *update[QMapData::LastLevel + 1];
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    if (it == iterator(e))
        return it;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, it.key()))
            cur = next;
        update[i] = cur;
    }

    while (next != e) {
        cur = next;
        next = cur->forward[0];
        if (cur == it) {
            concrete(cur)->key.~Key();
            concrete(cur)->value.~T();
            d->node_delete(update, payload(), cur);
            return iterator(next);
        }

        for (int i = 0; i <= d->topLevel; ++i) {
            if (update[i]->forward[i] != cur)
                break;
            update[i] = cur;
        }
    }
    return end();
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE void QMap<Key, T>::detach_helper()
{
    union { QMapData *d; QMapData::Node *e; } x;
    x.d = QMapData::createData(alignment());
    if (d->size) {
        x.d->insertInOrder = true;
        QMapData::Node *update[QMapData::LastLevel + 1];
        QMapData::Node *cur = e->forward[0];
        update[0] = x.e;
        while (cur != e) {
            QT_TRY {
                Node *concreteNode = concrete(cur);
                node_create(x.d, update, concreteNode->key, concreteNode->value);
            } QT_CATCH(...) {
                freeData(x.d);
                QT_RETHROW;
            }
            cur = cur->forward[0];
        }
        x.d->insertInOrder = false;
    }
    if (!d->ref.deref())
        freeData(d);
    d = x.d;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QMapData::Node *QMap<Key, T>::mutableFindNode(QMapData::Node *aupdate[],
                                                                   const Key &akey) const
{
    QMapData::Node *cur = e;
    QMapData::Node *next = e;

    for (int i = d->topLevel; i >= 0; i--) {
        while ((next = cur->forward[i]) != e && qMapLessThanKey<Key>(concrete(next)->key, akey))
            cur = next;
        aupdate[i] = cur;
    }
    if (next != e && !qMapLessThanKey<Key>(akey, concrete(next)->key)) {
        return next;
    } else {
        return e;
    }
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QList<Key> QMap<Key, T>::uniqueKeys() const
{
    QList<Key> res;
    const_iterator i = begin();
    if (i != end()) {
        for (;;) {
            const Key &aKey = i.key();
            res.append(aKey);
            do {
                if (++i == end())
                    goto break_out_of_outer_loop;
            } while (!(aKey < i.key()));   // loop while (key == i.key())
        }
    }
break_out_of_outer_loop:
    return res;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QList<Key> QMap<Key, T>::keys() const
{
    QList<Key> res;
    const_iterator i = begin();
    while (i != end()) {
        res.append(i.key());
        ++i;
    }
    return res;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QList<Key> QMap<Key, T>::keys(const T &avalue) const
{
    QList<Key> res;
    const_iterator i = begin();
    while (i != end()) {
        if (i.value() == avalue)
            res.append(i.key());
        ++i;
    }
    return res;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE const Key QMap<Key, T>::key(const T &avalue) const
{
    return key(avalue, Key());
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE const Key QMap<Key, T>::key(const T &avalue, const Key &defaultKey) const
{
    const_iterator i = begin();
    while (i != end()) {
        if (i.value() == avalue)
            return i.key();
        ++i;
    }

    return defaultKey;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QList<T> QMap<Key, T>::values() const
{
    QList<T> res;
    const_iterator i = begin();
    while (i != end()) {
        res.append(i.value());
        ++i;
    }
    return res;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QList<T> QMap<Key, T>::values(const Key &akey) const
{
    QList<T> res;
    QMapData::Node *node = findNode(akey);
    if (node != e) {
        do {
            res.append(concrete(node)->value);
            node = node->forward[0];
        } while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key));
    }
    return res;
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::const_iterator
QMap<Key, T>::lowerBound(const Key &akey) const
{
    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    return const_iterator(update[0]->forward[0]);
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::lowerBound(const Key &akey)
{
    detach();
    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->lowerBound(akey));
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::const_iterator
QMap<Key, T>::upperBound(const Key &akey) const
{
    QMapData::Node *update[QMapData::LastLevel + 1];
    mutableFindNode(update, akey);
    QMapData::Node *node = update[0]->forward[0];
    while (node != e && !qMapLessThanKey<Key>(akey, concrete(node)->key))
        node = node->forward[0];
    return const_iterator(node);
}

template <class Key, class T>
Q_INLINE_TEMPLATE typename QMap<Key, T>::iterator QMap<Key, T>::upperBound(const Key &akey)
{
    detach();
    return static_cast<QMapData::Node *>(const_cast<const QMap *>(this)->upperBound(akey));
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE bool QMap<Key, T>::operator==(const QMap<Key, T> &other) const
{
    if (size() != other.size())
        return false;
    if (d == other.d)
        return true;

    const_iterator it1 = begin();
    const_iterator it2 = other.begin();

    while (it1 != end()) {
        if (!(it1.value() == it2.value()) || qMapLessThanKey(it1.key(), it2.key()) || qMapLessThanKey(it2.key(), it1.key()))
            return false;
        ++it2;
        ++it1;
    }
    return true;
}

#ifndef QT_NO_STL
template <class Key, class T>
Q_OUTOFLINE_TEMPLATE QMap<Key, T>::QMap(const std::map<Key, T> &other)
{
    d = QMapData::createData(alignment());
    d->insertInOrder = true;
    typename std::map<Key,T>::const_iterator it = other.end();
    while (it != other.begin()) {
        --it;
        insert((*it).first, (*it).second);
    }
    d->insertInOrder = false;
}

template <class Key, class T>
Q_OUTOFLINE_TEMPLATE std::map<Key, T> QMap<Key, T>::toStdMap() const
{
    std::map<Key, T> map;
    const_iterator it = end();
    while (it != begin()) {
        --it;
        map.insert(std::pair<Key, T>(it.key(), it.value()));
    }
    return map;
}

#endif // QT_NO_STL

template <class Key, class T>
class QMultiMap : public QMap<Key, T>
{
public:
    QMultiMap() {}
    QMultiMap(const QMap<Key, T> &other) : QMap<Key, T>(other) {}

    inline typename QMap<Key, T>::iterator replace(const Key &key, const T &value)
    { return QMap<Key, T>::insert(key, value); }
    inline typename QMap<Key, T>::iterator insert(const Key &key, const T &value)
    { return QMap<Key, T>::insertMulti(key, value); }

    inline QMultiMap &operator+=(const QMultiMap &other)
    { unite(other); return *this; }
    inline QMultiMap operator+(const QMultiMap &other) const
    { QMultiMap result = *this; result += other; return result; }

#if !defined(Q_NO_USING_KEYWORD) && !defined(Q_CC_RVCT)
    // RVCT compiler doesn't handle using-keyword right when used functions are overloaded in child class
    using QMap<Key, T>::contains;
    using QMap<Key, T>::remove;
    using QMap<Key, T>::count;
    using QMap<Key, T>::find;
    using QMap<Key, T>::constFind;
#else
    inline bool contains(const Key &key) const
    { return QMap<Key, T>::contains(key); }
    inline int remove(const Key &key)
    { return QMap<Key, T>::remove(key); }
    inline int count(const Key &key) const
    { return QMap<Key, T>::count(key); }
    inline int count() const
    { return QMap<Key, T>::count(); }
    inline typename QMap<Key, T>::iterator find(const Key &key)
    { return QMap<Key, T>::find(key); }
    inline typename QMap<Key, T>::const_iterator find(const Key &key) const
    { return QMap<Key, T>::find(key); }
    inline typename QMap<Key, T>::const_iterator constFind(const Key &key) const
    { return QMap<Key, T>::constFind(key); }
#endif

    bool contains(const Key &key, const T &value) const;

    int remove(const Key &key, const T &value);

    int count(const Key &key, const T &value) const;

    typename QMap<Key, T>::iterator find(const Key &key, const T &value) {
        typename QMap<Key, T>::iterator i(find(key));
        typename QMap<Key, T>::iterator end(this->end());
        while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
            if (i.value() == value)
                return i;
            ++i;
        }
        return end;
    }
    typename QMap<Key, T>::const_iterator find(const Key &key, const T &value) const {
        typename QMap<Key, T>::const_iterator i(constFind(key));
        typename QMap<Key, T>::const_iterator end(QMap<Key, T>::constEnd());
        while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
            if (i.value() == value)
                return i;
            ++i;
        }
        return end;
    }
    typename QMap<Key, T>::const_iterator constFind(const Key &key, const T &value) const
        { return find(key, value); }
private:
    T &operator[](const Key &key);
    const T operator[](const Key &key) const;
};

template <class Key, class T>
Q_INLINE_TEMPLATE bool QMultiMap<Key, T>::contains(const Key &key, const T &value) const
{
    return constFind(key, value) != QMap<Key, T>::constEnd();
}

template <class Key, class T>
Q_INLINE_TEMPLATE int QMultiMap<Key, T>::remove(const Key &key, const T &value)
{
    int n = 0;
    typename QMap<Key, T>::iterator i(find(key));
    typename QMap<Key, T>::iterator end(QMap<Key, T>::end());
    while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
        if (i.value() == value) {
#if defined(Q_CC_RVCT)
            // RVCT has problems with scoping, apparently.
            i = QMap<Key, T>::erase(i);
#else
            i = erase(i);
#endif
            ++n;
        } else {
            ++i;
        }
    }
    return n;
}

template <class Key, class T>
Q_INLINE_TEMPLATE int QMultiMap<Key, T>::count(const Key &key, const T &value) const
{
    int n = 0;
    typename QMap<Key, T>::const_iterator i(constFind(key));
    typename QMap<Key, T>::const_iterator end(QMap<Key, T>::constEnd());
    while (i != end && !qMapLessThanKey<Key>(key, i.key())) {
        if (i.value() == value)
            ++n;
        ++i;
    }
    return n;
}

Q_DECLARE_ASSOCIATIVE_ITERATOR(Map)
Q_DECLARE_MUTABLE_ASSOCIATIVE_ITERATOR(Map)

QT_END_NAMESPACE

QT_END_HEADER

#endif // QMAP_H
N4m3
5!z3
L45t M0d!f!3d
0wn3r / Gr0up
P3Rm!55!0n5
0pt!0n5
..
--
October 20 2018 03:04:56
0 / 0
0755
QAbstractAnimation
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractConcatenable
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractEventDispatcher
0.037 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractFileEngine
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractFileEngineHandler
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractFileEngineIterator
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractItemModel
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractListModel
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractState
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractTableModel
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QAbstractTransition
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QAnimationGroup
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QArgument
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QAtomicInt
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QAtomicPointer
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QBasicAtomicInt
0.025 KB
February 11 2010 15:55:15
0 / 0
0644
QBasicAtomicPointer
0.025 KB
February 11 2010 15:55:15
0 / 0
0644
QBasicTimer
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QBitArray
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QBitRef
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QBool
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QBuffer
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QByteArray
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QByteArrayMatcher
0.03 KB
February 11 2010 15:55:15
0 / 0
0644
QByteRef
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QCOORD
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QCache
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QChar
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QCharRef
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QChildEvent
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QConcatenable
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QConstString
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QContiguousCache
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QContiguousCacheData
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QContiguousCacheTypedData
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QCoreApplication
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QCryptographicHash
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QCustomEvent
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QDataStream
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QDate
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QDateTime
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QDebug
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QDir
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QDirIterator
0.025 KB
February 11 2010 15:55:15
0 / 0
0644
QDynamicPropertyChangeEvent
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QEasingCurve
0.025 KB
February 11 2010 15:55:15
0 / 0
0644
QEvent
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QEventLoop
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QEventTransition
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QExplicitlySharedDataPointer
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QFSFileEngine
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QFactoryInterface
0.03 KB
February 11 2010 15:55:15
0 / 0
0644
QFile
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QFileInfo
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QFileInfoList
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QFileInfoListIterator
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QFileSystemWatcher
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QFinalState
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QFlag
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QFlags
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QForeachContainer
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QForeachContainerBase
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QFuture
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureInterface
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureInterfaceBase
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureIterator
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureSynchronizer
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureWatcher
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QFutureWatcherBase
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QGenericArgument
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QGenericReturnArgument
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QGlobalStatic
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QGlobalStaticDeleter
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QHash
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHashData
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHashDummyNode
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHashDummyValue
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHashIterator
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHashNode
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QHistoryState
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QIODevice
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QIncompatibleFlag
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QIntegerForSize
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QInternal
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QLatin1Char
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QLatin1Literal
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QLatin1String
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QLibrary
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QLibraryInfo
0.025 KB
February 11 2010 15:55:15
0 / 0
0644
QLine
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QLineF
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QLinkedList
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QLinkedListData
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QLinkedListIterator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QLinkedListNode
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QList
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QListData
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QListIterator
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QLocale
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QMap
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMapData
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMapIterator
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMapNode
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMapPayloadNode
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMargins
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaClassInfo
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaEnum
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaMethod
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaObject
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaObjectAccessor
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaObjectExtraData
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaProperty
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaType
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaTypeId
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QMetaTypeId2
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QMimeData
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QModelIndex
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QModelIndexList
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QMultiHash
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QMultiMap
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableFutureIterator
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableHashIterator
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableLinkedListIterator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableListIterator
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableMapIterator
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableSetIterator
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableStringListIterator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QMutableVectorIterator
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QMutex
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QMutexLocker
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QNoDebug
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QNoImplicitBoolCast
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QObject
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QObjectCleanupHandler
0.034 KB
February 11 2010 15:55:15
0 / 0
0644
QObjectData
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QObjectList
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QObjectUserData
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QPair
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QParallelAnimationGroup
0.036 KB
February 11 2010 15:55:15
0 / 0
0644
QPauseAnimation
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QPersistentModelIndex
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QPluginLoader
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QPoint
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QPointF
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QPointer
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QProcess
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QProcessEnvironment
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QPropertyAnimation
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QQueue
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QReadLocker
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QReadWriteLock
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QRect
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QRectF
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QRegExp
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QResource
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QReturnArgument
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QRunnable
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QScopedArrayPointer
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QScopedPointer
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QScopedPointerArrayDeleter
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QScopedPointerDeleter
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QScopedPointerPodDeleter
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QSemaphore
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QSequentialAnimationGroup
0.038 KB
February 11 2010 15:55:15
0 / 0
0644
QSet
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QSetIterator
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QSettings
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QSharedData
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QSharedDataPointer
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QSharedMemory
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QSharedPointer
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QSignalMapper
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QSignalTransition
0.03 KB
February 11 2010 15:55:15
0 / 0
0644
QSize
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QSizeF
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QSocketNotifier
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QStack
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QState
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QStateMachine
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QStdWString
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QString
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QStringBuilder
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QStringList
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QStringListIterator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QStringMatcher
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QStringRef
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QSysInfo
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QSystemLocale
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QSystemSemaphore
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QTS
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTemporaryFile
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QTextBoundaryFinder
0.032 KB
February 11 2010 15:55:15
0 / 0
0644
QTextCodec
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QTextCodecFactoryInterface
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QTextCodecPlugin
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QTextDecoder
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QTextEncoder
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QTextIStream
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTextOStream
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTextStream
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTextStreamFunction
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTextStreamManipulator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QThread
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QThreadPool
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QThreadStorage
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QThreadStorageData
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QTime
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QTimeLine
0.022 KB
February 11 2010 15:55:15
0 / 0
0644
QTimer
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QTimerEvent
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QTranslator
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QTypeInfo
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QUrl
0.018 KB
February 11 2010 15:55:15
0 / 0
0644
QUuid
0.019 KB
February 11 2010 15:55:15
0 / 0
0644
QVarLengthArray
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QVariant
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVariantAnimation
0.03 KB
February 11 2010 15:55:15
0 / 0
0644
QVariantComparisonHelper
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVariantHash
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVariantList
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVariantMap
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVector
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVectorData
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVectorIterator
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QVectorTypedData
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QWaitCondition
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QWeakPointer
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QWriteLocker
0.027 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamAttribute
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamAttributes
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamEntityDeclaration
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamEntityDeclarations
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamEntityResolver
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamNamespaceDeclaration
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamNamespaceDeclarations
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamNotationDeclaration
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamNotationDeclarations
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamReader
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamStringRef
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QXmlStreamWriter
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
Q_INT16
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_INT32
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_INT64
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_INT8
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_LLONG
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_LONG
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_PID
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_UINT16
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_UINT32
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_UINT64
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_UINT8
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_ULLONG
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Q_ULONG
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
Qt
0.023 KB
February 11 2010 15:55:15
0 / 0
0644
QtAlgorithms
0.024 KB
February 11 2010 15:55:15
0 / 0
0644
QtCleanUpFunction
0.029 KB
February 11 2010 15:55:15
0 / 0
0644
QtConcurrentFilter
0.031 KB
February 11 2010 15:55:15
0 / 0
0644
QtConcurrentMap
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QtConcurrentRun
0.028 KB
February 11 2010 15:55:15
0 / 0
0644
QtContainerFwd
0.026 KB
February 11 2010 15:55:15
0 / 0
0644
QtCore
3.5 KB
February 11 2010 15:55:15
0 / 0
0644
QtDebug
0.02 KB
February 11 2010 15:55:15
0 / 0
0644
QtEndian
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QtGlobal
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QtMsgHandler
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QtPlugin
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
QtPluginInstanceFunction
0.021 KB
February 11 2010 15:55:15
0 / 0
0644
qabstractanimation.h
4.281 KB
February 11 2010 15:55:23
0 / 0
0644
qabstracteventdispatcher.h
3.619 KB
February 11 2010 15:55:23
0 / 0
0644
qabstractfileengine.h
7.66 KB
February 11 2010 15:55:23
0 / 0
0644
qabstractitemmodel.h
16.114 KB
February 11 2010 15:55:23
0 / 0
0644
qabstractstate.h
2.822 KB
February 11 2010 15:55:23
0 / 0
0644
qabstracttransition.h
3.609 KB
February 11 2010 15:55:23
0 / 0
0644
qalgorithms.h
16.037 KB
February 11 2010 15:55:23
0 / 0
0644
qanimationgroup.h
2.911 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic.h
6.676 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_alpha.h
25.44 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_arch.h
3.438 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_arm.h
11.712 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_armv6.h
14.684 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_avr32.h
7.306 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_bfin.h
9.819 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_bootstrap.h
3.028 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_generic.h
8.496 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_i386.h
10.66 KB
February 24 2014 14:00:13
0 / 0
0644
qatomic_ia64.h
25.238 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_macosx.h
2.227 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_mips.h
27.555 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_parisc.h
8.2 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_powerpc.h
22.372 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_s390.h
13.861 KB
February 24 2014 14:00:14
0 / 0
0644
qatomic_sh.h
9.006 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_sh4a.h
17.513 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_sparc.h
16.577 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_symbian.h
8.703 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_vxworks.h
8.307 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_windows.h
15.915 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_windowsce.h
2.112 KB
February 11 2010 15:55:23
0 / 0
0644
qatomic_x86_64.h
10.696 KB
February 24 2014 14:00:13
0 / 0
0644
qbasicatomic.h
6.283 KB
February 11 2010 15:55:23
0 / 0
0644
qbasictimer.h
2.434 KB
February 11 2010 15:55:23
0 / 0
0644
qbitarray.h
6.085 KB
February 11 2010 15:55:23
0 / 0
0644
qbuffer.h
3.269 KB
February 11 2010 15:55:23
0 / 0
0644
qbytearray.h
22.949 KB
February 11 2010 15:55:23
0 / 0
0644
qbytearraymatcher.h
3.207 KB
February 11 2010 15:55:23
0 / 0
0644
qcache.h
5.955 KB
February 11 2010 15:55:23
0 / 0
0644
qchar.h
12.527 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-dist.h
2.247 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-large.h
4.188 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-medium.h
6.41 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-minimal.h
12.587 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-multilib.h
0.883 KB
February 12 2014 12:04:31
0 / 0
0644
qconfig-small.h
7.266 KB
February 11 2010 15:55:23
0 / 0
0644
qconfig-x86_64.h
3.075 KB
February 24 2014 14:03:56
0 / 0
0644
qconfig.h
0.883 KB
February 12 2014 12:04:31
0 / 0
0644
qcontainerfwd.h
2.604 KB
February 11 2010 15:55:23
0 / 0
0644
qcontiguouscache.h
13.14 KB
February 11 2010 15:55:23
0 / 0
0644
qcoreapplication.h
9.891 KB
February 11 2010 15:55:23
0 / 0
0644
qcoreevent.h
15.897 KB
February 11 2010 15:55:23
0 / 0
0644
qcryptographichash.h
2.588 KB
February 11 2010 15:55:23
0 / 0
0644
qdatastream.h
11.123 KB
February 11 2010 15:55:23
0 / 0
0644
qdatetime.h
11.096 KB
February 11 2010 15:55:23
0 / 0
0644
qdebug.h
9.846 KB
February 11 2010 15:55:23
0 / 0
0644
qdir.h
9.4 KB
February 11 2010 15:55:23
0 / 0
0644
qdiriterator.h
3.15 KB
February 11 2010 15:55:23
0 / 0
0644
qeasingcurve.h
3.774 KB
February 11 2010 15:55:23
0 / 0
0644
qendian.h
11.534 KB
February 11 2010 15:55:23
0 / 0
0644
qeventloop.h
3.106 KB
February 11 2010 15:55:23
0 / 0
0644
qeventtransition.h
3.133 KB
February 11 2010 15:55:23
0 / 0
0644
qfactoryinterface.h
2.325 KB
February 11 2010 15:55:23
0 / 0
0644
qfeatures.h
20.823 KB
February 11 2010 15:55:23
0 / 0
0644
qfile.h
6.207 KB
February 11 2010 15:55:23
0 / 0
0644
qfileinfo.h
5.921 KB
February 11 2010 15:55:23
0 / 0
0644
qfilesystemwatcher.h
2.98 KB
February 11 2010 15:55:23
0 / 0
0644
qfinalstate.h
2.465 KB
February 11 2010 15:55:23
0 / 0
0644
qfsfileengine.h
4.15 KB
February 11 2010 15:55:23
0 / 0
0644
qfunctions_vxworks.h
4.62 KB
February 11 2010 15:55:23
0 / 0
0644
qfunctions_wince.h
13.194 KB
February 11 2010 15:55:23
0 / 0
0644
qfuture.h
8.863 KB
February 11 2010 15:55:23
0 / 0
0644
qfutureinterface.h
9.473 KB
February 11 2010 15:55:23
0 / 0
0644
qfuturesynchronizer.h
3.365 KB
February 11 2010 15:55:23
0 / 0
0644
qfuturewatcher.h
6.132 KB
February 11 2010 15:55:23
0 / 0
0644
qglobal.h
83.432 KB
February 11 2010 15:55:23
0 / 0
0644
qhash.h
29.992 KB
February 11 2010 15:55:23
0 / 0
0644
qhistorystate.h
2.962 KB
February 11 2010 15:55:23
0 / 0
0644
qiodevice.h
8.17 KB
February 11 2010 15:55:23
0 / 0
0644
qiterator.h
8.744 KB
February 11 2010 15:55:23
0 / 0
0644
qlibrary.h
3.986 KB
February 11 2010 15:55:23
0 / 0
0644
qlibraryinfo.h
2.771 KB
February 11 2010 15:55:23
0 / 0
0644
qline.h
9.676 KB
February 11 2010 15:55:23
0 / 0
0644
qlinkedlist.h
15.061 KB
February 11 2010 15:55:23
0 / 0
0644
qlist.h
25.321 KB
February 11 2010 15:55:23
0 / 0
0644
qlocale.h
18.97 KB
February 11 2010 15:55:23
0 / 0
0644
qmap.h
31.774 KB
February 11 2010 15:55:23
0 / 0
0644
qmargins.h
4.169 KB
February 11 2010 15:55:23
0 / 0
0644
qmath.h
6.985 KB
February 11 2010 15:55:23
0 / 0
0644
qmetaobject.h
8.644 KB
February 11 2010 15:55:23
0 / 0
0644
qmetatype.h
11.675 KB
February 11 2010 15:55:23
0 / 0
0644
qmimedata.h
3.222 KB
February 11 2010 15:55:23
0 / 0
0644
qmutex.h
4.709 KB
February 11 2010 15:55:23
0 / 0
0644
qnamespace.h
52.609 KB
February 11 2010 15:55:23
0 / 0
0644
qnumeric.h
2.52 KB
February 11 2010 15:55:23
0 / 0
0644
qobject.h
15.94 KB
February 11 2010 15:55:23
0 / 0
0644
qobjectcleanuphandler.h
2.487 KB
February 11 2010 15:55:23
0 / 0
0644
qobjectdefs.h
16.816 KB
February 11 2010 15:55:23
0 / 0
0644
qpair.h
3.793 KB
February 11 2010 15:55:23
0 / 0
0644
qparallelanimationgroup.h
2.899 KB
February 11 2010 15:55:23
0 / 0
0644
qpauseanimation.h
2.661 KB
February 11 2010 15:55:23
0 / 0
0644
qplugin.h
4.757 KB
February 11 2010 15:55:23
0 / 0
0644
qpluginloader.h
3.069 KB
February 11 2010 15:55:23
0 / 0
0644
qpoint.h
9.187 KB
February 11 2010 15:55:23
0 / 0
0644
qpointer.h
5.114 KB
February 11 2010 15:55:23
0 / 0
0644
qprocess.h
7.22 KB
February 11 2010 15:55:23
0 / 0
0644
qpropertyanimation.h
3.044 KB
February 11 2010 15:55:23
0 / 0
0644
qqueue.h
2.397 KB
February 11 2010 15:55:23
0 / 0
0644
qreadwritelock.h
6.245 KB
February 11 2010 15:55:23
0 / 0
0644
qrect.h
21.705 KB
February 11 2010 15:55:23
0 / 0
0644
qregexp.h
5.384 KB
February 11 2010 15:55:23
0 / 0
0644
qresource.h
3.387 KB
February 11 2010 15:55:23
0 / 0
0644
qrunnable.h
2.407 KB
February 11 2010 15:55:23
0 / 0
0644
qscopedpointer.h
5.338 KB
February 11 2010 15:55:23
0 / 0
0644
qsemaphore.h
2.468 KB
February 11 2010 15:55:23
0 / 0
0644
qsequentialanimationgroup.h
3.256 KB
February 11 2010 15:55:23
0 / 0
0644
qset.h
13.413 KB
February 11 2010 15:55:23
0 / 0
0644
qsettings.h
9.985 KB
February 11 2010 15:55:23
0 / 0
0644
qshareddata.h
7.448 KB
February 11 2010 15:55:23
0 / 0
0644
qsharedmemory.h
3.192 KB
February 11 2010 15:55:23
0 / 0
0644
qsharedpointer.h
5.765 KB
February 11 2010 15:55:23
0 / 0
0644
qsharedpointer_impl.h
25.073 KB
February 11 2010 15:55:23
0 / 0
0644
qsignalmapper.h
3.165 KB
February 11 2010 15:55:23
0 / 0
0644
qsignaltransition.h
2.929 KB
February 11 2010 15:55:23
0 / 0
0644
qsize.h
10.108 KB
February 11 2010 15:55:23
0 / 0
0644
qsocketnotifier.h
2.817 KB
February 11 2010 15:55:23
0 / 0
0644
qstack.h
2.688 KB
February 11 2010 15:55:23
0 / 0
0644
qstate.h
3.634 KB
February 11 2010 15:55:23
0 / 0
0644
qstatemachine.h
5.593 KB
February 11 2010 15:55:23
0 / 0
0644
qstring.h
57.731 KB
February 24 2014 14:00:13
0 / 0
0644
qstringbuilder.h
8.092 KB
February 11 2010 15:55:23
0 / 0
0644
qstringlist.h
9.558 KB
February 11 2010 15:55:23
0 / 0
0644
qstringmatcher.h
3.267 KB
February 11 2010 15:55:23
0 / 0
0644
qsystemsemaphore.h
2.951 KB
February 11 2010 15:55:23
0 / 0
0644
qt_windows.h
4.192 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentcompilertest.h
2.35 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentexception.h
3.313 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentfilter.h
28.841 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentfilterkernel.h
11.389 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentfunctionwrappers.h
4.55 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentiteratekernel.h
10.059 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentmap.h
31.673 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentmapkernel.h
9.263 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentmedian.h
3.681 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentreducekernel.h
7.379 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentresultstore.h
7.283 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentrun.h
18.318 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentrunbase.h
3.544 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentstoredfunctioncall.h
54.822 KB
February 11 2010 15:55:23
0 / 0
0644
qtconcurrentthreadengine.h
8.366 KB
February 11 2010 15:55:23
0 / 0
0644
qtemporaryfile.h
3.29 KB
February 11 2010 15:55:23
0 / 0
0644
qtextboundaryfinder.h
3.353 KB
February 11 2010 15:55:23
0 / 0
0644
qtextcodec.h
6.806 KB
February 11 2010 15:55:23
0 / 0
0644
qtextcodecplugin.h
3.157 KB
February 11 2010 15:55:23
0 / 0
0644
qtextstream.h
12.931 KB
February 11 2010 15:55:23
0 / 0
0644
qthread.h
4.269 KB
February 11 2010 15:55:23
0 / 0
0644
qthreadpool.h
3.006 KB
February 11 2010 15:55:23
0 / 0
0644
qthreadstorage.h
4.122 KB
February 11 2010 15:55:23
0 / 0
0644
qtimeline.h
4.286 KB
February 11 2010 15:55:23
0 / 0
0644
qtimer.h
3.46 KB
February 11 2010 15:55:23
0 / 0
0644
qtranslator.h
3.284 KB
February 11 2010 15:55:23
0 / 0
0644
qurl.h
9.85 KB
February 11 2010 15:55:23
0 / 0
0644
quuid.h
5.096 KB
February 11 2010 15:55:23
0 / 0
0644
qvariant.h
18.008 KB
February 11 2010 15:55:23
0 / 0
0644
qvariantanimation.h
4.452 KB
February 11 2010 15:55:23
0 / 0
0644
qvarlengtharray.h
7.454 KB
February 11 2010 15:55:23
0 / 0
0644
qvector.h
25.439 KB
February 11 2010 15:55:23
0 / 0
0644
qwaitcondition.h
2.843 KB
February 11 2010 15:55:23
0 / 0
0644
qxmlstream.h
17.985 KB
February 11 2010 15:55:23
0 / 0
0644
 $.' ",#(7),01444'9=82<.342ÿÛ C  2!!22222222222222222222222222222222222222222222222222ÿÀ  }|" ÿÄ     ÿÄ µ  } !1AQa "q2‘¡#B±ÁRÑð$3br‚ %&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyzƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚáâãäåæçèéêñòóôõö÷øùúÿÄ     ÿÄ µ   w !1AQ aq"2B‘¡±Á #3RðbrÑ $4á%ñ&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz‚ƒ„…†‡ˆ‰Š’“”•–—˜™š¢£¤¥¦§¨©ª²³´µ¶·¸¹ºÂÃÄÅÆÇÈÉÊÒÓÔÕÖ×ØÙÚâãäåæçèéêòóôõö÷øùúÿÚ   ? ÷HR÷j¹ûA <̃.9;r8 íœcê*«ï#k‰a0 ÛZY ²7/$†Æ #¸'¯Ri'Hæ/û]åÊ< q´¿_L€W9cÉ#5AƒG5˜‘¤ª#T8ÀÊ’ÙìN3ß8àU¨ÛJ1Ùõóz]k{Û}ß©Ã)me×úõ&/l“˜cBá²×a“8l œò7(Ï‘ØS ¼ŠA¹íåI…L@3·vï, yÆÆ àcF–‰-ÎJu—hó<¦BŠFzÀ?tãúguR‹u#‡{~?Ú•£=n¾qo~öôüô¸¾³$õüÑ»jò]Mä¦  >ÎÈ[¢à–?) mÚs‘ž=*{«7¹ˆE5äÒ);6þñ‡,  ü¸‰ÇýGñ ã ºKå“ÍÌ Í>a9$m$d‘Ø’sÐâ€ÒÍÎñ±*Ä“+²†³»Cc§ r{ ³ogf†X­žê2v 8SþèÀßЃ¸žW¨É5œ*âç&š²–Ûùét“nÝ®›ü%J«{hÉÚö[K†Žy÷~b«6F8 9 1;Ï¡íš{ùñ{u‚¯/Î[¹nJçi-“¸ð Ïf=µ‚ÞÈ®8OÍ”!c H%N@<ŽqÈlu"š…xHm®ä<*ó7•…Á Á#‡|‘Ó¦õq“êífÛüŸ•­oNÚ{ËFý;– ŠÙ–!½Òq–‹væRqŒ®?„ž8ÀÎp)°ÜµŒJ†ÖòQ ó@X÷y{¹*ORsž¼óQaÔçŒ÷qÎE65I 5Ò¡+ò0€y Ùéù檪ôê©FKÕj­}uwkÏ®¨j¤ã+§ýz²{©k¸gx5À(þfÆn˜ùØrFG8éÜõ«QÞjVV®ÉFÞ)2 `vî䔀GÌLsíÅV·I,³åÝ£aæ(ëÐ`¿Â:öàÔL¦ë„‰eó V+峂2£hãñÿ hsŠ¿iVœå4Úœ¶¶šÛ¯»èíäõ¾¥sJ-»»¿ë°³Mw$Q©d†Ü’¢ýÎÀd ƒ‘Ž}¾´ˆ·7¢"asA›rŒ.v@ ÞÇj”Y´%Š–·–5\Ü²õåË2Hã×­°*¾d_(˜»#'<ŒîØ1œuþ!ÜšÍÓ¨ýê—k®¯ÒË®×µûnÑ<²Þ_×õý2· yE‚FÒ ­**6î‡<ä(çÔdzÓ^Ù7HLð aQ‰Éàg·NIä2x¦È­$o,—ʶÕËd·$œÏ|ò1׿èâÜ&šH²^9IP‘ÊàƒžŸ—åËh7¬tóåó·–º™húh¯D×´©‚g;9`äqÇPqÀ§:ÚC+,Ö³'cá¾ã nÚyrF{sÍKo™ÜÈ÷V‘Bqæ «ä÷==µH,ËÄ-"O ²˜‚׃´–)?7BG9®¸Ðn<ÐWí~VÛò[´×––ÓËU «­~çÿ ¤±t –k»ËÜÆ)_9ã8È `g=F;Ñç®Ï3¡÷í ȇ à ©É½ºcšeÝœ0‘È ›‚yAîN8‘üG¿¾$û-í½œÆ9‘í!ˆ9F9çxëøž*o_žIÆÖZò¥ÓºVùöõ¿w¦Ýˆæ•´ÓYÄ®­³ËV£êƒæõç?áNòîn.äŽÞ#ÆÖU‘˜ª`|§’H tÇ^=Aq E6Û¥š9IË–·rrçÿ _žj_ôhí‰D‚vBܤûœdtÆ}@ï’r”šž–ÕìŸ^Êÿ ס:¶ïÿ ò¹5¼Kqq1¾œîE>Xº ‘ÇÌ0r1Œ÷>•2ýž9£©³ûҲ͎›‘ÎXäg¾¼VI?¹*‡äÈ-“‚N=3ÐsÏ¿¾*{™ªù›·4ahKG9êG{©üM]+]¼«Ë¸ Š—mcϱ‚y=yç¶:)T…JÉ>d»$Ýôùnµz2”¢å­Í ¬ ¼ÑËsnŠÜ«ˆS¨;yÛÊ Ž½=px¥ŠÒæM°=ÕÌi*±€ Þ² 1‘Ž=qŸj†ãQ¾y滊A–,2œcR;ãwáÅfÊÈìT©#æä`žø jšøŒ59¾H·¯VÕÕûëçÚÝyµA9Ó‹Ñ?Çúþºš—QÇ ÔvòßNqù«¼!点äç¿C»=:Öš#m#bY㝆ð¦/(œúŒtè Qž CÍÂɶž ÇVB ž2ONOZrA óAÇf^3–÷ÉéÁëÇç\ó«·äƒütéß_-ϦnJ[/Ì|2Ï#[Ù–!’,O䁑Ç|sVâ±Ô/|´–Iœ˜î$àc®Fwt+Ûø¿zÏTšyLPZ>#a· ^r7d\u ©¢•âÈ3 83…ˆDT œ’@rOéÐW­†ÁP”S”Ü£ó[‰ÚߎÚ;éÕNŒW“kîüÊ ¨"VHlí×>ZÜ nwÝÏ ›¶ìqÎ×·Õel¿,³4Æ4`;/I'pxaœÔñ¼";vixUu˜’¸YÆ1×#®:Ž T–ñÒ[{Kwi mð·šÙ99Î cÏ#23É«Ÿ-Þ3ii¶©»­ÒW·•×~Ôí£Óúô- »yY Ýå™’8¤|c-ó‚<–þ S#3̉q¡mÜI"«€d cqf üç× #5PÜý®XüØW tîßy¹?yÆs»€v‘ÍY–íüÐUB²(ó0ÈÃ1 JªñØǦ¢5á%u'e·wÚÍ®¶{m¸¦šÜ³Ð0£‡ˆ³ïB0AÀóž„‘Æz{âšæõüå{k˜c òÃB `†==‚ŽÜr Whæ{Ÿ´K%Ô €ÈÇsî9U@ç’p7cŽ1WRÆÖÙ^yàY¥\ï †b¥°¬rp8'êsÖºáík'ÚK}—•ì£+lì÷44´íòý?«Ö÷0¤I"Ú³.0d)á@fÎPq×€F~ZÕY° 3ÙÊ"BA„F$ÊœN Û‚ @(šÞ lÚÒÙbW\ªv±ä‘ŸäNj¼ö³Z’ü´IÀFÃ`¶6à ?! NxÇÒ©Ò­†Oª²½’·ŸM¶{êºjÚqŒ©®èþ ‰ ’&yL%?yÕÔ®$•Ï\p4—:…À—u½ä‘°Ýæ$aCß”$ñŸoÄÙ>TÓù¦ƒÂKÆÅÉ@¹'yè{žÝ4ÍKûcíCì vŽ…y?]Ol©Ê|Íê¾Þ_;üÿ Ï¡Rçånÿ rÔ’[m²»˜¡Ž4ùDŽ›Ë) $’XxËëšY8¹i•†Á!‘þpJ•V^0 Œ±õèi²Å²en%·„†8eeù²Yˆ,S†=?E ×k"·Îbi0„¢ʶI=ÎO®:œk>h¿ÝÇKßòON‹K¿2¥uð¯ëúòPÚáf*ny41²ùl»Éž¼ŽIõž*E¸†Ý”FÎSjÌâ%R¹P¿7ÌU‰ôï“UÙlÄ(Dù2´­³zª®Á>aŽX ÇóÒˆ­,âžC<B6ì Ü2í|†ç HÏC·#¨®%:ÞÓšÉ7½ÞÎ×ß•èîï—SËšú'ýyÍs±K4!Ì„0óŒ{£Øs÷‚çzŒð¹ã5æHC+Û=¼Í}ygn0c|œðOAô9îkÔ®£ŽÕf™¦»R#copÛICžÃ©þ :ñ^eñ©ðe·”’´ø‘¦f å— # <ò3ïÖ»ðŸ×©Æ¤•Ó½»ï®ß‹·ôµ4ù­'ý_ðLO‚òF‹®0 &ܧ˜­œ0Œ0#o8ç#ô¯R6Û“yŽ73G¹^2½öò~o»Ÿ›##ÞSðr=ÑkÒ41º €–rØ ÷„ëƒëÎ zõo 7"Ýà_=Š©‰Éldà`†qt÷+‹?æxù©%m,ö{.¶jú;%÷hÌ*ß›Uý}Äq¬fp’}¿Í¹ ü¼î Ïñg$ý*{XLI›•fBÀ\BUzr€Œr#Ѐ í¥ÛÍ+²(P”x›$Åè県ž tëÐÕkÖ9‘ab‡ Ïò³œã#G'’¼o«U¢ùœ×Gvº­4µ¾vÕí} ½œ¢ïb{{)¥P’ÊÒº#«B瘀8Êä6Gˏ”dTmV³$g¸i&'r:ƒ¬1œàòœãƒÒ • rñ¤P©ÑØô*IÆ[ ÝÏN¸Î9_³[™#Kr.Fí¤í*IÁ?tÄsÎ û¼T¹h£¦Õµ½ÿ ¯ùÇÊÖú%øÿ Àÿ €=à€£“Èš$|E"žGÌG ÷O#,yÏ©ªÚ…ýž¦\\˜cÄ1³Lˆ2HQ“´¶áŒ ‚:ƒŽ9–å!Š–͐‚ɾF''‘÷yÇNüûãëpÆ|=~¢D•äµ•vn2„sÓžGLë IUP´Uíw®Ú-/mm£²×Ì–ìíeý] ? øÑüa¨ÞZÏeki,q‰c10PTpAÜÀg%zSß°2Ĥ¡U]®ØŠÜçžI;€èpx?_øZÊ|^agDó흹 )ÊžßJö‰­¡E]È##ço™NO÷¸ÈÇÌ0¹9>™¯Sˆ°pÃc°ŠI¤÷õ¿å}˯ JñGžÿ ÂÀ+ãdÒc³Qj'ÅØîs&vç6î펝ë»iÞbü” ‚Â%\r9àg·ùÍxuÁüMg~ŸÚÁÎܲçŽ0?*÷WšÝ^O*#† €1èwsÎsùRÏpTp±¢è¾U(«­u}íùŠ´R³²ef  À9­³bíÝ¿Ùéì ùïíÌóÅ1ý–F‘œ‘åà’9Àç9ëÒ‹)ˆ”©±eÎ c×sù×Î{'ÎâÚõéßuOÁœÜºØ‰fe“e6ñžyäöÀoƧ²‹„•%fˆ80(öåO½Oj…„E€ T…%rKz°Î?.;{šXÙ‡ŸeUÚd!üx9þtã%wO_øoòcM- j–ÒHX_iK#*) ž@Ž{ ôǽBd¹‰RÝn–ê0«7ˆìyÀ÷Í@¬Ì¢³³’ 9é÷½?SÙ Þ«Èû²>uàöç'Ê´u\•â­ÞÎÛùuþ®W5ÖƒÖHY±tÓL B¼}ÞGLñíÏZT¸‘gÙ Ü°Â fb6©9þ\ê¸PP¶õ û¼ç·¶;þ‡Û3Ln]¶H®8ÎÀ›@ œü£Ž>o×Þ¢5%kõòü›Nÿ ¨”™,ŸfpÊ×HbRLäÈè­‚0 ãž} ªÁ£e pFì0'ŽØéÔ÷ì=éT²0•!…Îzt9ç¾?”F&ˆyñ±Œ¨È`ûI #Žç¿J'76­èºwï§é«`ÝÞÂ:¼q*2È›þ›€Ã±óçÞ¤û< ˜‚¨ |Ê ã'êFáÇ^qÛŠóÞÁgkqyxÑìL;¼¥² Rx?‡¯Y7PŽwnù¶†û¾Ü·.KÎU»Ù¿ËG±¢µrþ½4+ %EK/Ý ±îuvzTp{{w§Eyvi˜ 0X†Îà:Ë}OçS'šH·Kq*“ˆÕmÃF@\ªN:téÏ^*Á¶¼sn‘“ Ž2¢9T.½„\ ýò@>˜7NFïNRÓ·wèôßEÕua'¬[þ¾cö¡̐Oæ¦âÅŠ². Ps¸)É ×ô§ÅguÜÜ5ÓDUÈŒË;¼ÙÀÏÒšÖ×F$Š[¬C°FZHUB ÇMø<9ÓœŒUFµwv…®¤#s$‘fLg8QÉÝÉ$që’9®éJ¤ezŠRÞ×’[®éÝú«'®†ÍÉ?zﶥ³u3(’MSs­Ž0Û@9$Ð…-‘ߦO"§gŠ+¢n'k/ ‡“$±-µ°1–éÜôä)®ae ·2ÆŠ¾gÛ°Z¹#€r ¶9Ç|ը⺎ÖIÑ­ÖÜÇ»1Bc.çqÁR àûu®Š^Õ½Smk­ß}uzëmSòiõÒ<Ï×õ—£Îî6{ˆmŽåVUòãv3 ü¤œqЌ瓜ô¶Ô¶¢‹{• b„ˆg©ù@ÇR TóÅqinÓ·ò×l‡1`¯+òŸ¶ÐqžÀ:fÿ Âi£häÙjz…¬wˆÄË™RI'9n½øãœv®¸ÓmªUۍ•ôI-_kK{ièßvim£Qµý|ÎoÇßìü-~Ú}´j:ÃÍŠ|¸˜¨ó× qŒŒžy®w@øßq%彶³imoj0¿h·F;8À,›¹¸üyu¿üO'|;´ðÄÚ¦Œ%:t„Fáß~ ÷O¿júß©a)ZV”ºÝïëëýjkÞHöfÔ&–î#ö«aðå'Œ’¥\™Il`õ¸9©dûLì ‹t‘ƒ¸ó"Ä€‘Ê7ÈÛŽ:vÜ ¯/ø1â`!»Ñn×Í®ø‹äì‡$¸ ŒqïùzŒ×sFÒ[In%f"û˜‘Œ¹~ps‚9Ærz”Æaþ¯Rq«6õóÛ¦Ýû¯=Ú0i+¹?ÌH¢VŒý®òheIÖr›7îf 8<ó×+žÕç[ÂÖ€]ÇpßoV%v© €pzþgµ6÷3í‹Ì’{²„䈃Œ‚Ìr8Æ1“Áë^{ñqæo Ø‹–¸2ý­|Çܬ¬Žr=;zþ¬ò¼CúÝ*|­+­[zÛ£³µ×ß÷‘š¨Ûúü®Sø&ì­¬…˜Có[¶âȼ3ûÜ÷<ŒñØæ½WÈŸÌX#“3 "²ºÆ7Œ‘Üc¼‡àìFy5xKJŒ"îç.r@ï×Þ½Ä-ÿ þ“}ª}’*Þ!,Fm¸Î@†9b?1W{Yæ3„`Ú¼VõŠÚÛ_kùöG.mhÎñ ôíhí§Ô$.ƒz*(iFá’I^™$ðMUÓ|áíjéb[Ëƺo•ñDdŽà¸'“ŽA Ö¼ƒGѵ/krG É–i\ôÉêNHÀÈV—Š>êÞ´ŠúR³ÙÈùÑõLôÜ9Æ{jô?°°Kýš¥WíZ¿V—m6·E}{X~Æ? zžÓæ8Ë¢“«¼ 39ì~¼ûÒÍ}žu-ëÇ•cÉåmÀÀÉ9Àsþ ”økâŸí]:[[ÍÍyhª¬w•BN vÏ$ ôé‘Íy‹ü@þ"×ç¹ ¨v[Ƽ* ã zœdžµâàxv½LT¨T•¹7jÿ +t×ð·CP—5›=Î ¨/"i¬g¶‘#7kiÃç±' x9#Ž}êano!òKD‘ílï”('¿SÔð?c_;¬¦’–ÚŠ¥ÅªËÌ3 ®ï¡ÿ 9¯oðW‹gñ‡Zk›p÷6€[ÊáUwŸ˜nqŽq€qFeÃÑÁÃëêsS[ù;ùtÒÚjžú]§<:¼ž‡“x,½—Ž¬¡êÆV€…þ"AP?ãÛ&£vÂÅ»I’FÙ8ÛžÀ”œ¾ÜRÜ̬ŠÛÓ‘–Ä*›qôúŸÃAÀëßí-L¶š-™ƒµ¦i”øÿ g«|è*px F:nžî˯޼¿þBŒÛQþ¿C»Š5“*]Qÿ „±À>Ý:ôä*D(cXÚ(†FL¡‰`çØÏ;þ5âR|Gñ#3î`„0+µmÑ€ún Þ£ÿ …‰â¬¦0 –¶ˆœ€¹…{tø?ʯ(_çþ_Š5XY[¡Ù|Q¿ú µŠ2︛sO* Бÿ ×â°<+à›MkÂ÷š…ij ·Ü–ˆ«ò‚?ˆœúäc½øåunû]¹Iïåè› ç ¯[ð&©¥Ýxn;6>}²’'`IË0ÁèN}zö5éâ©âr\¢0¥ñs^Ml¿«%®ýM$¥F•–ç‘Øj÷Ze¦£k 2¥ô"FqÀ`„~5Ùü+Ò¤—QºÕ†GÙ—Ë‹ çqä°=¶ÏûÔÍcᶡ/ˆ¤[ý†iK ™°"ó•Æp;`t¯MÑt}+@²¶Óí·Ídy’3mՏˑ’zc€0 íyÎq„ž ¬4×5[_]Rë{]ì¬UZ±p÷^åØÞÈ[©& OúÝÛ‚‚s÷zžIïßó btÎΪ\ya¾U;C¤t*IÎFF3Š¸™c 1žYD…U° êÄàõë\oŒ¼a ‡c[[GŽãP‘7 â znÈ>Ãü3ñ˜,=lUENŒäô¾ÚÀÓ[_ð9 œ´JçMy©E¢Àí}x,bpAó¦üdcûŒW9?Å[Há$¿¹pÄ™#^9O88©zO=«Ë!µÖüY¨³ªÍy9ûÒ1 úôÚ»M?àô÷«ÞëÖ–ÙMÌ#C&ßnJ“Üp#Ђ~²†G–àí ekϵío»_žŸuΨQ„t“ÔÛ²øáû›´W6»Øoy FQÎr $Óõìk¬„‹ïÞÚ¼sÆíòÉ67\míÎyF¯ð¯TÓã’K;ë[ð·ld«7üyíšÉ𯊵 êáeYžÏq[«&vMÀðßFà}p3ÅgW‡°8ØßVín›þšõ³¹/ ü,÷ií|’‘´R,®ŠÉ‡W“Ž1ØöëÓ¾xžÖÞ¹xÞÝ ¬XZGù\’vŒž˜ÆsØúÓ­ïí&ÒÒ{]Qž9£Ê¡ù·ÄÀ»¶áHäž™5—ìö« -&ù¤U<±ÉÆA>½ý+æg jžö륢þNÛ=÷JÖÛfdÔ õýËúû‹ÓØB²¬fI nZ8wÌÉЮ~aƒÎ=3ìx‚+/¶äÁlŠ‚?™Æü#8-œ\pqTZXtè%»»&ÚÝ#´ŠðÜ žã§Í’¼{p·ß{m>ÞycP¨’¼¢0ú(Rƒë^Ž ñó¼(»y%m´ÕÙ}ÊûékB1¨þÑ®,#Q)ó‡o1T©ÜÃ*Ž‹‚yö< b‰4×H€“ìÐ. ¤²9ÌŠ>„Žãøgšñ ¯Š~)¸ßå\ÛÛoBŒa·L²œg$‚Iã¯ZÈ—Æ~%”äë—È8â)Œcƒ‘Âàu9¯b%)ÞS²¿Ïïÿ 4Öºù}Z/[H%¤vÉ#Ì’x§†b © ³´tÜ{gn=iï%õªÇç]ܧ—! åw„SÓp ·VÈÏ¡?5Âcâb¥_ĤŠz¬—nàþÖΟñKÄöJé=ÌWèêT‹¸÷qÎჟ•q’zWUN«N/ØO^Ÿe|í¾©k{üõ4öV^ïù~G¹êzÂèº|·÷×[’Þ31†rpjg·n Æ0Ý}kåË‹‰nîe¹ËÍ+™ÏVbrOç]'‰¼o®xÎh`¹Ç*±ÙÚ!T$d/$žN>¼WqᯅZ9ÑÒO\ÜÛê1o&,-z ~^NCgNÕéá)ÒÊ©7‰¨¯'Õþ¯þ_¿Ehîþóâ €ï¬uÛûý*ÎK9ä.â-öv<²‘×h$àãúW%ö¯~«g-ÕõÀàG~>Zú¾Iš+(šM³ Û#9äl%ðc¬ ûÝ xÖKG´x®|¸¤Ï™O:Ê8Ã’qÉcÔä‚yÇNJyËŒTj¥&µOmztjÿ ?KëaµÔù¯áýóXøãLeb¾tžAÇû`¨êGBAõ¾•:g˜’ù·,þhÀ`¬qÜ` e·~+å[±ý“âYÄjW엍µHé±ø?Nõô>½âX<5 Ç©ÏѼM¶8cܪXŽÉ^r?¼IróÈS•ZmÇ›™5»òÚÚ7ïu«&|·÷•Î† >[©ÞXHeS$Œyà€ ÷ù²:ò2|óãDf? Z¼PD¶ÓßC(xÆ0|©ßR;ôMsÿ µ´ÔVi¬,͹›Ìxâi˜`¹,GAéÇlV§ÄýF×Yø§ê–‘:Ã=ò2³9n±ÉžØÏ@yÎWžæ±Ãàe„ÄÒN ]ïòêìú_Go'¦ŽÑ’_×õЯðR66þ!›ÑÄ gFMÙ— äžäqôÈ;ÿ eX<#%»Aö‰ãR¤ Í”Ž¹È G&¹Ÿƒ&á?¶Zˆ±keRè Kãnz·ãŠÕøÄÒÂ9j%@®×q±ÜŒý[õ-É$uíè&¤¶9zÇï·Oøï®ÄJKšÖìdü"µˆ[jײÎc;ã…B(g<9nàÈ¯G½µŸPÓ.´Éfâ¼FŽP 31 ‘ÏR}<3šä~ Ã2xVöî Dr Ç\›}Ý#S÷ÈÀëŽHÆI®à\OçKuäI¹†ó(”—GWî ñ³¹¸æ2¨›‹ºÚû%¾ýÖ_3ºNú¯ëúì|ÕÅÖ‰}y lM’ZËîTÿ á[ðÐñ/ˆ9Àû ¸ón3 Mòd‘÷ döª^.ÊñŽ°›BâîNp>cëÏçÍzïíôÏ YÍ%ª¬·ãÏ-*9Ü­ÂãhéŒc¾dÈêú¼Ë,. VŠ÷çeÿ n/¡¼äãõâ=‹xGQKx”|¹bÌŠD@2Œ 8'Ž àúƒŽ+áDÒ&¡¨"Œ§–Žr22 Ç·s]ŸÄ‹«ð%ÚÄ<¹ä’(×{e›HÀqÁç©Ç½`üŽÚõK饚9ƒÄ±€< –úƒú~ çðñO#­Í%iKKlµ¦¾F)'Iê¬Î+Ç(`ñ¾£œdÈ’` ™ºcßéé^ÿ i¸”Û\ý¡æhÔB«aq¸}ãÀÆ:ÜWƒ|FÛÿ BŒÇÀeaŸ-sÊ€:úW½ÜÝÜ<%$µ†%CóDªÀí%IÈÏʤ…ôäñÞŒ÷‘a0“ôŽÚë¤nŸoW÷0«e¶y'Å»aΗ2r’# Û°A^ý9ÉQÔõ=ù5¬£Öü.(Þ’M$~V«=éSÄFN½®©ÔWô»ÿ þHžkR‹ìÏ+µµžöê;khÚI¤m¨‹Ôš–âÖçJ¾_Z•’6 a”Èô> ÕÉaÕ<%®£2n bQŠå\tÈõUÿ ø»þ‹k15‚ÃuCL$ݹp P1=Oøýs¯^u éEJ”–éêŸê½5ýzy›jÛ³á›Ûkÿ ÚOcn±ÛÏîW;boºz{ãžüVÆ¡a£a5½äÎÂks¸J@?1è¿{$䑐=k”øsÖ^nŒ¦)ÝåXÃíùN1ØõÚOJë–xF÷h¸ Œ"Ž?x䜚ü³ì¨c*Fœ¯i;7~ñí׫Ðó¥Ë»3Ãü púw ‰°<Á%»ñž ÿ P+Û^ ¾Ye£ŽCÄŒ„/>˜>•á¶Ìm~&&À>M[hÈÈÿ [Ž•íd…RO@3^Ç(ʽ*¶ÖQZyßþ 1Vº}Ñç?¼O4Rh6R€ª£í¡ûÙ a‚3ß·Õ ü=mRÍ/µ9¤‚0ÑC¼Iè:cŽsÛ¾™x£ÆЬªÍöˢ샒W$•€Å{¨ÀPG ÀÀàŸZìÍ1RÉ0´ðxEË9+Éÿ ^rEÕ—±Š„70l¼áË@û.' ¼¹Žz€N3úUÉ<3á×*?²¬‚ä†"Ùc=p íÛ'¡ª1ñ"økJ†HÒ'»Ÿ+ oÏN¬Ã9 dÙãÜדÏâÍ~æc+j·Jzâ7(£ðW]•æ™?nê´º6åwéåç÷N•ZŠíž›¬|?Ðõ?Ñ-E…®³ÇV$~X¯/…õ x‘LˆÑÜÚÈ7¦pzãÜüë½ðÄ^õtÝYËÍ7ÉÖÕ8ÏUe# #€r=sU¾/é’E§jRC4mxNÝ´9†íuá»›V‘ ZI€­×cr1Ÿpzsøf»¨åV‹ìû`qËLÊIã?\~¼³áËC©êhªOîO»‘ÃmçÛçút×¢x“Z}?Ãœê#b-¤X7õ Äò gž zzbº3œm*qvs·M=íúéw}¿&Úª°^Ö×µÏ(ø‡â†Öµƒenñý†×åQáYûœ÷ÇLœôÎNk¡ð‡¼/µ¸n0æÉ0¬ƒ‚üîÉÆvŒw®Sáö”š¯‹-üÕVŠØÙ[$`(9cqƒÔ_@BëqûÙ`Ý捭0;79È?w<ó |ÙÜkßÌ1±Ëã ¿ìÒ»ðlìï«ÓnªèèrP´NÏš&Žéö Ù¸÷æ°~-_O'‰`°!RÚÚÝ%]Ø%þbß1'¿ÿ X՝áOöÎŒ·‹¬+Åæ*ÛÛ™0¤ƒOÍÔ `u¯¦ÂaèÐÃÓ«‹¨Ô¥µœ¿¯ÉyÅÙ.oÔôŸ Úx&(STðݽ¦õ] ’ÒNóÁäÈùr3í·žÚ[™ƒ¼veÈ÷ÞIõÎGlqÎ=M|«gsªxÅI6 ]Z·Îªä,¨zŒŽÄ~#ØŠúFñiÉqc©éÐD>S딑 GñŽ1éÐ^+ Ëi;Ô„µVÕú»i¯ÈÒ-ZÍ]òܘ®ì` bÛÙ¥_/y(@÷qÐúg Ô÷W0.Ø› 6Ò© r>QƒŒ0+Èîzb¨É+I0TbNñ"$~)ÕÒ6Þ‹{0VÆ27œWWñcÄcX×íôûyKZéðªc'iQ¿¯LaWŠŸS\·Š“źʸ…ôÙÂí|öÀÇåV|!¤ÂGâÛ[[’ï 3OrÙËPY¹=Î1õ5öåTžÑè Ú64/üö?Zëžk}¬¶éào፾á}3“ü]8Éæ¿´n²Žš_6¾pœ)2?úWÓÚ¥¾¨iWúdŽq{*ª1rXŒd…m»‰äcô¯–dâ•ã‘Jº¬§¨#¨® §,df«8ÉÅßN¾hˆ;îÓ=7áùpën®É 6ûJžO2^œÐò JÖø¥²ã›Ò6Ü·‰!wbÍ‚¬O©»õ¬ÿ ƒP=Ä:â¤-&ÙŽ ` È9 r9íϧzë> XÅ7ƒ5X–krÑ¢L 7€ìw}ÑŸNHëŒüþ:2†á¼+u·á÷N/Û'Ðç~ߘô«ëh!ónRéeQ´6QÛÿ èEwëÅÒ|¸Yqó1uêyùzð8 ƒŠù¦Ò;¹ä6öi<'ü³„[íZhu½ ùÍ¡g‚>r¯׊îÌx}bñ2“­k꣧oø~›hTèóËWò4|ki"xßQ˜Ï6øÀLnß‚0 ¹Æ{±–¶Öe#¨27È@^Ìß.1N¾œyç€õ†ñeé·Õã†çQ°€=­Ì©ºB€Ø8<‚ÃSõ®ùcc>×Ú .Fr:žÝGæ=kÁâ,^!Fž ¬,àµ}%¶«îõ¹†"r²ƒGœüYÕd?aÑÍY®49PyU ÷þ!žxÅm|/‚ãNð˜¼PcûTÒ,¹/Ý=FkÏ|u¨¶«â녏{¤m¢]Û¾ïP>®XãÞ½iÓÁ¾ ‰'¬–6ß¼(„ï— í!úÙäzôë^–:œ¨å|,_¿&š×]uÓѵÛô4’j”bž§x‘Æ©ã›á,‚[Ô ÎÞ= ŒËæ ÀùYÁ?ŽïÚ¼?ÁªxºÕÛ,°1¸‘¿Ýäãدv…@¤åq½ºã œàûââ·z8Xýˆþz~—û»™âµj=Ž â~ãáh@'h¼F#·Üp?ŸëQü-løvépx»cŸø…lxâÃûG·‰¶ø”L£©%y?¦úõÆü-Õ¶¥y`Òl7>q’2üA?•F}c‡jB:¸Jÿ +§¹¿¸Q÷°ív=VÑìu[Qml%R7a×IèTõéŽx¬ ?†š7 1†îã-ˆã’L¡lŽ0OÓ=ÅuˆpÇ•¼3ÛùÒ¶W/!|’wŽw^qÔ×Ïaó M8Q¨ãÑ?ëï0IEhÄa¸X•`a ?!ÐñùQ!Rä žqŽžÝO`I0ÿ J“y|ñ!Îã@99>þ8–+éáu…!ù—ä Ê°<÷6’I®z ÅS„¾)Zþ_Öýµ×ËPåOwø÷þ*üïænÖùmØÝûþ¹=>¦½öî×Jh]¼ç&@§nTŒ6IT Àõ^Fxð7Å3!Ö·aÛ$þÿ ¹ã5îIo:ȪmËY[’8ÇӾlj*òû¢¥xõ¾¼ú•åk+\ð¯ HÚoŽl•Ûk,¯ ç²²cõÅ{²Z\ ´ìQ åpzŽ3Ôð}ÿ Jð¯XO¡øÎé€hÙ¥ûLdŒ`““ù6Gá^ÃáÝ^Ë[Ñb¾YåŒÊ»dŽ4 †2§,;ÿ CQÄ´¾°¨c–±”mºV{«ßÕýÄW\ÖŸ‘çŸ,çMRÆí“l-ƒn~ë©ÉÈê Ü?#Ž•¹ðãSÒ¥ÐWNíà½;ãž)™ÎSÈ9cóLj뵿Å«iÍk¨ió­¶X‚7÷ƒ€yãnyÏŽëÞ Öt`×À×V's$È9Ú:ä{wÆEk€«†Çàc—â$éÎ.éí~Ýëk}ÅAÆpörÑ¢‡Šl¡ÑüSs‹¨‰IÝ„óÀ×wñ&eºðf™pŒÆ9gŽTø£lñëÀçŽ NkÊUK0U’p ï^¡ãÈ¥´ø{£ÙHp`’ØåbqÏ©äó^Æ: Ž' ÊóM«õz+ß×ó5Ÿ»('¹­ð¦C„$˜Å¢_ºÈI?»^äã'ñêzž+ë€ñ-½»´}¡Ë*õ?.xÇ^1ŽMyǸ&“—L–îëöâ7…' bqéÎGé]˪â1$o²¸R8Ã`.q€}sÖ¾C9­8cêÆÞíïóòvÓòùœÕfÔÚéýu­èÖ·Ú Å‚_¤³ÜۺƑߝ”àרý:׃xPþÅÕî-/üØmnQìïGΊÙRqê=>¢½õnæ·r!—h`+’;ò3È<“Û©éšóŸx*÷V¹¸×tÈiˆßwiÔÿ |cŒñÏ®3ֽ̰‰Ë Qr©ö½®¼ÛoÑÙZÅÑ«O൯ýw8;k›ÿ x†;ˆJa;‘º9÷÷R+¡ñgŽí|Iáë{ôáo2ʲ9 029ÉÏLí\‰¿¸Ÿb˜ "Bv$£&#ßiê>=ªª©f ’N ëí>¡N­XW­~5×úíø\‰»½Ï^ø(—wÖú¥¤2íŽÞXæÁ$ °eÈ888^nÝë²ñÝÔ^ ÖÚ9Q~Ëå7ï DC¶ÑµƒsËÇè9®Wáþƒ6‡£´·°2\Ý:ÈÑ?(#¨'$õèGJ¥ñW\ÿ ‰E¶—¸™g˜ÌÀ¹;Pv ú±ÎNs·ëŸ’–"Ž/:té+ûË]öJöÓM»ëø˜*‘•^Uý—êd|‰åñMæÔÝ‹23å™6æHùÛ‚ëüñ^…ñ1¢oêûÑEØ.õ7*ÅHtÎp{g<·Á«+¸c¿¿pÓ¾Æby=8É_ÄsÆk¬ñB\jÞÔì••Ë[9Píb‹Bヅ =9­3§ð§LšÛáÖšÆæXÌÞdÛP.0\ãïÛ0?™úJ¸™Ë ”•œº+=<µI£¦í¯õêt¬d‹T¬P=ËFêT>ÍØØ@Ï9<÷AQÌ×»Õ¡xùk",JÎæù±Éç$œŽŸZWH®¯"·UÌQ ’ÙÈ]ÅXg<ã ߨg3-Üqe€0¢¨*Œ$܃ ’Sû 8㎼_/e'+Ï–-èÓ¶¶Õíß[·ÙÙ½î쏗¼sk%§µxä‰â-pÒeÆCrú ôσžû=”šÅô(QW‚Õd\ƒæ. \àö¹¯F½°³½0M>‘gr÷q+œ¶NïºHO— ¤ ܥݭ”n·J|ÆP6Kµc=Isó}Ò çGš)a=—#vK›åoK§ßóٍ¤¶¿õú…ÄRÚ[Ësöټˏ•Ë ópw®qœŒ·Ø ùÇâ‹ý‡ãKèS&ÞvûD Aù‘É9 ŒîqÅ} $SnIV[]ѐ´Ó}ØܾA Ü|½kÅþÓ|E Mu R¼.I¼¶däò‚ÃkÆ}ðy¹vc iUœZ…­Õõ»z¾÷¿n¦*j-É­/àœHã\y5 Û ß™ó0— äŸnzôã#Ô¯,†¥ÚeÔ÷ÜÅ´„“'c…<íÝ€<·SŠ¥k§Ã¢éÆÆÙna‚8–=«ʪ[Ÿ™°pNî02z“ÔÙ–K8.È’Þî(vƒ2®@ äÈûãçžxäÇf¯ˆu¹yUÕîýWšÙ|›ëÒ%Q^í[æ|éo5ZY•^{96ˆY‚§v*x>âº_|U¹Ö´©tûMÒÂ9PÇ#«£#€ éÉñ‘ƒÍz/‰´-į¹°dd,Б›p03ƒœ{ç9=+ Ûᧇ¬¦[‡‚ê婺¸#±ß=³ý¿•Õµjñ½HÙh›Û[§ÚýÊöô÷{˜?ô÷·Ô.u©–_%còcAÀ˜’ }0x9Î>žñÇáÍ9,ahï¦Ì2òÓ ñÛAäry$V²Nð ]=$Ž ‚#Ù‚1ƒƒødõMax‡ÂÖ^!±KkÛ‘ «“Çó²FN8+ëÎ{Ò¼oí§[«ÕMRoËeç×[_m/¦¦k.kôgŽxsSÓ´ý`êzªÜÜKo‰cPC9ÎY‰#§^üý9¹âïÞx£Ë·Ú`±‰‹¤;³–=ÏaôÕAð‚÷kêÁNBéÎælcõö®£Fð†ô2Ò¬]ßÂK$ÓÜ®•”/ÊHàã$ä ¸÷ëf¹Oµúâ“”’²ø­è´µþöjçNü÷üÌ¿ xNïFÒd»¼·h®îT9ŽAµÖ>qÁçÔœtïÒ»\ȶÎîcÞäîó3¶@#ÉIÎ ÔñW.<´’¥–ÑÑ€ÕšA‚ ;†qÓë‚2q ÒÂó$# Çí‡ !Ë}Õ9ÈÎÑÉã=;ŒÇÎuñ+ÉûÏ¥öíeÙ+$úíÜ娯'+êZH4ƒq¶FV‹gïŒ208ÆÌ)íб>M|÷âÍã¾"iì‹¥£Jd´™OÝç;sÈúr+ÜäˆË)DŒ¥šF°*3Õ”d {zÔwºQ¿·UžÉf†~>I+ŒqÔ`ð3œ“Ü×f]œTÁÔn4“ƒø’Ýßõ_«*5šzGCÊ,þ+ê1ò÷O¶¸cœºb2yÇ;cùÕ£ñh¬›áÑŠr¤ÝäNBk¥—á—†gxšX/쑘hŸ*Tçn =û㦠2|(ð¿e·ºÖ$ ýìŸ!'åΰyîî+×öœ=Y:²¦ÓÞ×iü’—ü -BK™£˜›âÆ¡&véðõ-ûÉY¹=Onj¹ø¯¯yf4·±T Pó`çœ7={×mÃ/ ¢˜ZÚòK…G½¥b„’G AãÜœ*í¯Ã¿ IoæI¦NU8‘RwÈã;·€ Û×ëÒ”1Y •£E»ÿ Oyto¢<£Áö·šï,䉧ûA¼sû»Nò}¹üE{ÜÖªò1’õÞr0â}ÎØ#>à/8ïéÎ~—áÍ#ñÎlí§³2f'h”?C÷YËdð:qëõÓ·‚ïeÄ© ÔÈØÜRL+žAÎ3¼g=åšó³Œt3 ÑQ¦ùRÙßE®¼±w_;þhš’Sirÿ ^ˆã¼iੇ|RòO„m°J/“$·l“ ÇÓ¿ÿ [ÑŠÆ“„†Õø>cFÆ6Ø1ƒ– àz7Ldòxäüwá‹ÝAXùO•Úý’é®ähm­ •NÀ±ÌTÈç ƒ‘I$pGž:‚ÄbêW¢®œ´|­¦­nÍ>¶ÖÏ¢§ÎÜ¢ºö¹•%ÄqL^öÛ KpNA<ã¡ …î==ª¸óffËF‡yÌcÉ ©ç$ð=ñÏ­YþÊ’Ú]—¥‚¬‚eDïÎH>Ÿ_ÌTP™a‰ch['çÆÜò7a‡?w°Ïn§âÎ5”’¨¹uÚÛ|´ÓÓc§{O—ü1•ªxsÃZ…ÊÏy¡Ã3¸Ë2Èé» ‘ƒÎ äžÜðA§cáOéúÛ4ý5-fŒï„ù¬ûô.Ç Üsž•Ò¾•wo<¶Ÿ"¬¡º|£ î2sÇ¡éE²ÉFѱrU°dÜ6œ¨ mc†Îxë׺Þ'0²¡Rr„{j¾í·è›µ÷)º·å–‹î2|I®Y¼ºÍË·–ÃÆà㍣'óÆxƒOÆÞ&>\lóÌxP Xc¸ì Sþ5§qà/ê>#žÞW¸if$\3 ® ûÄ“ùŽÕê¾ð<Ó‹H¶óÏ" å·( á‘€:ã†8Ï=+ꨬUA×ÃËÚT’ÑÞöù¥¢]{»ms¥F0\ÑÕ—ô}&ÛB´ƒOŽÚ+›xíÄÀ1 ,v± žIëíZ0ǧ™3 í2®0ทp9öÝÔž)ÓZËoq/Ú“‘L ²ŒmùŽÓ9§[Û#Ä‘\ÞB¬Çs [;à à«g‚2ôòªœÝV§»·¯/[uó½õÛï¾ /šÍ}öüÿ «=x»HŸÂÞ.™ ÌQùŸh´‘#a$‚'¡u<Š›Æ>2>+ƒLSiöwµFó1!eg`£åœ ÷ëÛö}Á¿ÛVÙêv $¬ƒ|,s÷z€ð΃¨x÷ÅD\ÜŒÞmåÔ„ ˆ o| :{ÇÓ¶–òÁn!´0Ål€, ƒ ( ÛŒŒ c¶rsšæ,4‹MÛOH!@¢ ÇŽ„`å²9ÝÃw;AÍt0®¤¡…¯ØÄ.Àì클ƒ‘ßñ5Í,Óëu-ÈÔc¢KÃÓ£òÖ̺U.õL¯0…%2È—"~x ‚[`có±nHàŽyàö™¥keˆìŒÛFç{(Ø©†`Jã#Žwg<“:ÚÉ;M ^\yhûX‡vB·÷zrF?§BÊÔ/s<ÐÈB)Û± ·ÍÔwç5Âã:så§e{mѤï«Òíh—]Wm4âí¿ùþW4bC3¶ª¾Ùr$ pw`àädzt!yŠI„hÂîàM)!edŒm'æ>Ç?wzºK­ìcŒ´¯Ìq6fp$)ãw¡éUl`µ»ARAˆÝÕgr:äŒgƒéé[Ôö±”iYs5Ýï«ÙG—K=þF’æMG«óÿ `ŠKɦuOQ!ÕåŒ/ÎGÞ`@ËqÕzdõâ«Ê/Ö(ƒK´%ŽbMü åÜŸö—>¤óŒŒV‘°„I¢Yž#™¥ùÏÊ@8 œgqöö5ª4vד[¬(q cò¨À!FGaÁõõ¯?§†¥ÏU½í¿WªZ$úyú½ŽzקÉþ?>Ã×È•6°{™™ŽÙ.$`­ÎUœ…çè ' ¤r$1Ø(y7 ðV<ž:È  ÁÎMw¾Â'Øb§øxb7gãО½óÉÊë²,i„Fȹ£§8ãä½k¹¥¦ê/ç{ïê驪2œ/«ü?¯Ô›ìñÜ$þeýœRIåŒg9Ác’zrrNO bÚi¢ ѺË/$,“ª¯Ýä;Œ× ´<ÛÑn³IvŸb™¥ nm–ÄŸ—nÝÀãŽ3ëÍG,.öó³˜Ù£¹u ÊÌrŠ[<±!@Æ:c9ÅZh ì’M5ÄìÌ-‚¼ëÉùqŽGì9¬á ;¨A-ž—évþÖ–^ON·Ô”ŸEý}ú×PO&e[]ÒG¸˜Ûp ƒÃà/Ë·8ûÀ€1ž@¿ÚB*²­¼ñì8@p™8Q“žÆH'8«I-%¸‚ F»“åó6°Uù|¶Ú¸ã ò^Äw¥ŠÖK–1ÜÝK,Žddlí²0PÀü“×ükG…¯U«·¶–´w¶ŽÍ¾©yÞú[Zös•¯Á[™6° ¨¼ÉVæq·,# ìãï‘×8îry®A››¨,ãc66»Ë´ã'æÉù?t}¢æH--Òá"›|ˆ¬[í  7¶ö#¸9«––‹$,+Ëqœ\Êø c€yê^ݸÄa°«™B-9%«×®‹V´w~vÜTéꢷþ¼ˆ%·¹• ’[xç•÷2gØS?6åÀÚ õ9É#š@÷bT¸º²C*3Bá¤òÎA9 =úU§Ó"2Ãlá0iÝIc‚2Î@%öç94ùô»'»HÄ¥Ô¾@à Tp£šíx:úÊ:5eºßMý×wµ›Ó_+šº3Ýyvÿ "ºÇ<ÂI>Õ 1G·Ë«È«É# àÈÇ øp Jv·šæDûE¿›†Ë’NFr2qŸ½ÇAÜšu•´éí#Ħ8£2”Ú2Ã/€[ÎTr;qŠz*ý’Îþ(≠;¡TÆ⁛;ºÿ àçœk‘Þ­8¾Uª¾íé{^×IZéwÓkXÉûÑZo¯_øo×È¡¬ â–ÞR§2„‚Àœü½ùç® SVa†Âüª¼±D‘ŒísŸàä|ä2 æ[‹z”¯s{wn„ÆmáóCO+†GO8Ïeçåº`¯^¼ðG5f{Xžä,k‰<á y™¥voÆ éÛõëI=œ1‹éíÔÀÑ)R#;AÂncäŽ:tÏ#¶TkB.0Œ-ÖÞZÛgumß}fÎJÉ+#2êÔP£žùÈÅi¢%œ3P*Yƒò‚Aì“Ž2r:ƒÐúñi­RUQq‰H9!”={~¼ “JŽV¥»×²m.ÛߺiYl¾òk˜gL³·rT• ’…wHÁ6ä`–Î3ùÌ4Øe³†&òL‘•%clyîAÂäà0 žüç$[3uŘpNOÀÉ=† cï{rYK ååä~FÁ •a»"Lär1Ó¯2Äõæ<™C•.fÕ»è¥~½-¿g½Â4¡{[ør¨¶·Žõäx¥’l®qpwÇ»8ärF \cŽ¸ÜÆÓ-g‚yciÏÀ¾rÎwèØÈ#o°Á9ã5¢šfÔxÞæfGusÏÌJÿ µ×œ/LtãÅT7²¶w,l ɳ;”eúà·¨çîŒsÜgTÃS¦­^ '~‹®›¯+k÷ZÖd©Æ*Ó[Ü«%Œk0ŽXƒ”$k#Ȩ P2bv‘ƒŸáÇ™ÆÕb)m$É*8óLE‘8'–ÜN Úyàúô­+{uº±I'wvš4fÜr íì½=úuú sFlìV$‘ö†Hсù€$§ õ=½¸«Ž] :Ž+•¦ïmRþ½l´îÊT#nkiøÿ _ðÆT¶7Ò½ºÒ£Î¸d\ã8=yãŽÜäR{x]ZâÚé#¸r²#»ÎHÆ6õ ç® ÎFkr;sºÄ.&;só± Ç9êH÷ýSšÕ­tÐU¢-n­ Ì| vqœ„{gŒt§S.P‹’Ž‰_[;m¥Þ­ZýRûÂX{+¥úü¼ú•-àÓ7!„G"“´‹žƒnrYXã¸îp éœ!Ó­oP̏tÑ (‰Þ¹é€sÓ#GLçÕšÑnJý¡!‘Tä#“ß?îýp}xÇ‚I¥Õn#·¸–y'qó@r[ Êô÷<ÔWÃÓ¢áN¥4ԝ’I&ݼ¬¬¼ÞºvéÆ FQV~_ÒüJÖÚt¥¦Xá3BÄP^%ÈÎW-×c¡ú©¤·Iþèk¥š?–UQåIR[’O 5x\ÉhÆI¶K4«2ùªŠŒ<¼óœçØ`u«‚Í.VHä € Ëgfx''9ÆI#±®Z8 sISºku¢ßÞ]úk»Jößl¡B.Ü»ÿ MWe °·Ž%šêɆ¼»Âù³´œ O¿cÐÓÄh©"ÛÜÏ.ÖV ’3nüÄmnq[ŒòznšÖ>J¬òˆæ…qýØP Ž:ä7^0yëWšÍ_79äoaÈ °#q0{ää×mœy”R{vÒÞ¶ÚÏe¥“ÚÆХ̮—õýjR •íç›Ìb„+J yÜØÙ•Ç]¿Ôd þËOL²”9-Œ—õÃc'æÝלçÚ²ìejP“½ âù°¨†ðqòädЃÉäÖÜj÷PÇp“ÍšŠå«‘î <iWN­smª»¶vÓz5»ûì:Rs\Ðßôû×uÔÿÙ