kwqptrdictimpl.cpp

手机浏览器源码程序,功能强大

/*
 * Copyright (C) 2003 Apple Computer, Inc.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE COMPUTER, INC. OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 
 */

#include "KWQPtrDictImpl.h"
#include "KWQHashTable.h"
#include "KWQRefPtr.h"

typedef void (* DeleteFunction) (void *);
static unsigned int KWQHashPtrFunction( void* ptr_, unsigned int size_ )
{
	return ((unsigned int)ptr_) % size_;
}

class KWQPtrDictPrivate
OOM_MODIFIED
{
public:
		
    KWQPtrDictPrivate(int size, DeleteFunction );
    KWQPtrDictPrivate(const KWQPtrDictPrivate &dp);
    ~KWQPtrDictPrivate();
    
    DeleteFunction del;
    KWQRefPtr<KWQHashTable<void*, void*> >	table;
    KWQPtrDictIteratorPrivate *iterators;
};

class KWQPtrDictIteratorPrivate
OOM_MODIFIED
{
public:
    KWQPtrDictIteratorPrivate(KWQPtrDictPrivate *);
    ~KWQPtrDictIteratorPrivate();
    
    void remove(void *key);
    void dictDestroyed();
    
    uint count;
    uint pos;
    void **keys;
    void **values;
    KWQPtrDictPrivate *dict;
    KWQPtrDictIteratorPrivate *next;
    KWQPtrDictIteratorPrivate *prev;
};

KWQPtrDictPrivate::KWQPtrDictPrivate(int size, DeleteFunction deleteFunc) :
    del(deleteFunc), 
    table( new KWQHashTable<void*, void*>( KWQHashPtrFunction, size )),
    iterators( 0 )
{	
}

KWQPtrDictPrivate::KWQPtrDictPrivate(const KWQPtrDictPrivate &dp) :     
    del(dp.del), 
    table(dp.table),
    iterators( 0 )
{
}

KWQPtrDictPrivate::~KWQPtrDictPrivate()
{
}

KWQPtrDictImpl::KWQPtrDictImpl(int size, DeleteFunction deleteFunc) :
    d(new KWQPtrDictPrivate(size, deleteFunc))
{
}

KWQPtrDictImpl::KWQPtrDictImpl(const KWQPtrDictImpl &di) :
    d(new KWQPtrDictPrivate(*di.d))
{
}

KWQPtrDictImpl::~KWQPtrDictImpl()
{
    delete d;
}

void KWQPtrDictImpl::clear(bool deleteItems)
{
   	KWQHashTable<void*, void*>::iterator it = d->table->begin();
	KWQHashTable<void*, void*>::iterator end = d->table->end();
	
    if (deleteItems && d->del) {
        DeleteFunction deleteFunc = d->del;
    	while( it!= end )
    	{
    		deleteFunc( it.value() );
    		++it;
    	}
    }
    d->table->clear();
}

uint KWQPtrDictImpl::count() const
{
	return d->table->count();
}

void KWQPtrDictImpl::insert(void *key, const void *value)
{
	d->table->insert( key, const_cast<void*>(value) );
}

bool KWQPtrDictImpl::remove(void *key, bool deleteItem)
{
	KWQHashTable<void*, void*>::iterator it = d->table->find( key );
	
	if( it != d->table->end() )
	{
		if( deleteItem && d->del )
			(d->del)( it.value() );
		
		d->table->remove( key );

	    for (KWQPtrDictIteratorPrivate *it = d->iterators; it; it = it->next) {
	        it->remove(key);
	    }		
		return true;
	}
	
	return false;
}

void *KWQPtrDictImpl::find(void *key) const
{
	KWQHashTable<void*, void*>::iterator it = d->table->find( key );
	if( it != d->table->end() )
		return it.value();
    
    return NULL;
}

void KWQPtrDictImpl::swap(KWQPtrDictImpl &di)
{
    KWQPtrDictPrivate *tmp;

    tmp = di.d;
    di.d = d;
    d = tmp;
}

KWQPtrDictImpl &KWQPtrDictImpl::assign(const KWQPtrDictImpl &di, bool deleteItems)
{
    KWQPtrDictImpl tmp(di);

    if (deleteItems) {
	clear(true);
    }

    swap(tmp);

    return *this;
}


void *KWQPtrDictImpl::take(void *key)
{
    void *value = find(key);
    remove(key, false);
    return value;
}

KWQPtrDictIteratorPrivate::KWQPtrDictIteratorPrivate(KWQPtrDictPrivate *d) :
    count(d->table->count()),
    pos(0),
#ifndef __OOM__    
    keys(new void * [count]),
    values(new void * [count]),
#else
    keys( (void**)MemoryManager::Alloc(count * sizeof(void*)) ),
    values( (void**)MemoryManager::Alloc(count * sizeof(void*)) ),
#endif    
    dict(d),
    next(d->iterators),
    prev(0)
{
    d->iterators = this;
    if (next) {
        next->prev = this;
    }
    
    KWQHashTable<void*, void*>::iterator it = d->table->begin();
    KWQHashTable<void*, void*>::iterator end = d->table->end();
    
    unsigned int i = 0;
    while( it!= end )
    {
    	keys[i] = it.key();
    	values[i] = it.value();
    	++it;
    	++i;
    }
}

KWQPtrDictIteratorPrivate::~KWQPtrDictIteratorPrivate()
{
    if (prev) {
        prev->next = next;
    } else if (dict) {
        dict->iterators = next;
    }
    if (next) {
        next->prev = prev;
    }

#ifndef __OOM__    
    delete [] keys;
    delete [] values;
#else
	MemoryManager::Free( keys );
	MemoryManager::Free( values );
#endif    
}

KWQPtrDictIteratorImpl::KWQPtrDictIteratorImpl(const KWQPtrDictImpl &di) : 
    d(new KWQPtrDictIteratorPrivate(di.d))
{
}

KWQPtrDictIteratorImpl::~KWQPtrDictIteratorImpl()
{
    delete d;
}

uint KWQPtrDictIteratorImpl::count() const
{
    return d->count;
}

void *KWQPtrDictIteratorImpl::current() const
{
    if (d->pos >= d->count) {
	return NULL;
    }
    return d->values[d->pos];
}

void *KWQPtrDictIteratorImpl::currentKey() const
{
    if (d->pos >= d->count) {
	return NULL;
    }
    return d->keys[d->pos];
}

void *KWQPtrDictIteratorImpl::toFirst()
{
    d->pos = 0;
    return current();
}

void *KWQPtrDictIteratorImpl::operator++()
{
    ++d->pos;
    return current();
}

void KWQPtrDictIteratorPrivate::remove(void *key)
{
    for (uint i = 0; i < count; ) {
        if (keys[i] != key) {
            ++i;
        } else {
            --count;
            if (pos > i) {
                --pos;
            }
            memmove(&keys[i], &keys[i+1], sizeof(keys[i]) * (count - i));
            memmove(&values[i], &values[i+1], sizeof(values[i]) * (count - i));
        }
    }
}

void KWQPtrDictIteratorPrivate::dictDestroyed()
{
    count = 0;
    dict = 0;
}