minidxer’s blog

WP-Cache:an extremely efficient WordPress page caching system

February 28th, 2008 — admin

WP-Cache is an extremely efficient WordPress page caching system to make you site much faster and responsive. It works by caching Worpress pages and storing them in a static file for serving future requests directly from the file rather than loading and compiling the whole PHP code and the building the page from the database. WP-Cache allows to serve hundred of times more pages per second, and to reduce the response time from several tenths of seconds to less than a millisecond. Read the rest of this entry »

Posted in Uncategorized. 1 Comment »

Open Source MP3 Player

February 19th, 2008 — admin

Posted in Uncategorized. 3 Comments »

coolcode test

February 3rd, 2008 — admin

/*
Copyright (c) 2006 - 2008 Eric J. Feminella <eric@ericfeminella.com>
All rights reserved.
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.
@internal
*/
package com.ericfeminella.collections
{
import flash.utils.Dictionary;
import mx.collections.IList;
/**
*
* Defines the contract for lightweight HashMap implementations
* which are to expose an API into a managed collection of key
* value pairs
*
*/
public interface IMap
{
/**
*
* Adds a key / value pair to the current Map
*
* @param the key to add to the map
* @param the value of the specified key
*
*/
function put(key:*, value:*) : void;
/**
*
* Places all name / value pairs into the current
* <code>IMap</code> instance.
*
* @param an <code>Object</code> of name / value pairs
*
*/
function putAll(table:Dictionary) : void;
/**
*
* <code>putEntry</code> is intended as a pseudo-overloaded
* <code>put</code> implementation whereby clients may call
* <code>putEntry</code> to pass an <code>IHashMapEntry</code>
* implementation.
*
* @param concrete <code>IHashMapEntry</code> implementation
*
*/
function putEntry(entry:IHashMapEntry) : void;
/**
*
* Removes a key / value from the HashMap instance
*
* @param key to remove from the map
*
*/
function remove(key:*) : void;
/**
*
* Determines if a key exists in the HashMap instance
*
* @param the key in which to determine existance in the map
* @return true if the key exisits, false if not
*
*/
function containsKey(key:*) : Boolean;
/**
*
* Determines if a value exists in the HashMap instance
*
* @param the value in which to determine existance in the map
* @return true if the value exisits, false if not
*
*/
function containsValue(value:*) : Boolean;
/**
*
* Returns a key value from the HashMap instance
*
* @param the key in which to retrieve the value of
* @return the value of the specified key
*
*/
function getKey(value:*) : *;
/**
*
* Returns a key value from the HashMap instance
*
* @param the key in which to retrieve the value of
* @return the value of the specified key
*
*/
function getValue(key:*) : *;
/**
*
* Returns each key added to the HashMap instance
*
* @return String Array of key identifiers
*
*/
function getKeys() : Array;
/**
*
* Returns each value assigned to each key in the HashMap instance
*
* @return Array of values assigned for all keys in the map
*
*/
function getValues() : Array;
/**
*
* Retrieves the size of the HashMap instance
*
* @return the current size of the map instance
*
*/
function size() : int;
/**
*
* Determines if the HashMap instance is empty
*
* @return true if the current map is empty, false if not
*
*/
function isEmpty() : Boolean;
/**
*
* Resets all key value assignments in the HashMap instance to null
*
*/
function reset() : void;
/**
*
* Resets all key / values defined in the HashMap instance to null
*
*/
function resetAllExcept(key:*) : void;
/**
*
* Clears all key / values defined in the HashMap instance
*
*/
function clear() : void;
/**
*
* Clears all key / values defined in the HashMap instance
* with the exception of the specified key
*
*/
function clearAllExcept(key:*) : void;
/**
*
* <code>putEntry</code> is intended as a pseudo-overloaded
* <code>put</code> implementation whereby clients may call
* <code>putEntry</code> to pass an <code>IHashMapEntry</code>
* implementation.
*
* @param concrete <code>IHashMapEntry</code> implementation
*
*/
function getEntries() : IList;
}
}