org.jpos.space.Space Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of jpos Show documentation
jPOS is an ISO-8583 based financial transaction library/framework that can be customized and extended in order to implement financial interchanges.
There is a newer version: 3.0.0
Show newest version
/*
 * jPOS Project [http://jpos.org]
 * Copyright (C) 2000-2013 Alejandro P. Revilla
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as
 * published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program.  If not, see .
 */

package org.jpos.space;


/**
 * Space uses concepts described in the Linda Coordination Language 
 * that eases the implementation of other jPOS components (such as 
 * Channels, Muxes, etc.), but it is not by any means an attempt to provide
 * a full implementation.
 *
 * jPOS's Space is basically a Map where each entry is a LinkedList 
 * of values that can be used as a BlockingQueue
 *
 * One can place entries on a queue by calling Space.out, take them
 * by calling Space.in and read (without taking) by calling Space.rd
 *
 * @author Alejandro Revilla
 * @version $Revision$ $Date$
 * @since 2.0
 * @see TSpace
 * @see SpaceError
 * @see The Linda Coordination Language
 */

public interface Space {
    /**
     * Write a new entry into the Space
     * @param key Entry's key
     * @param value Object value
     */
    public void out (K key, V value);

    /**
     * Write a new entry into the Space, with an timeout value
     * @param key Entry's key
     * @param value Object value
     * @param timeout timeout value
     */
    public void out (K key, V value, long timeout);

    /**
     * Take an entry from the space, waiting forever until one exists.
     * @param key Entry's key
     * @return value
     */
    public V in  (Object key);

    /**
     * Read an entry from the space, waiting forever until one exists.
     * @param key Entry's key
     * @return value
     */
    public V rd  (Object key);

    /**
     * Take an entry from the space, waiting a limited amount of time
     * until one exists.
     * @param key Entry's key
     * @param timeout millis to wait
     * @return value or null
     */
    public V in  (Object key, long timeout);


    /**
     * Read an entry from the space, waiting a limited amount of time
     * until one exists.
     * @param key Entry's key
     * @param timeout millis to wait
     * @return value or null
     */
    public V rd  (Object key, long timeout);


    /**
     * In probe takes an entry from the space if one exists, 
     * return null otherwise.
     * @param key Entry's key
     * @return value or null
     */
    public V inp (Object key);


    /**
     * Read probe reads an entry from the space if one exists, 
     * return null otherwise.
     * @param key Entry's key
     * @return value or null
     */
    public V rdp (Object key);

    /**
     * Write a new entry at the head of a queue.
     * @param key Entry's key
     * @param value Object value
     */
    public void push (K key, V value);

    /**
     * Write a new entry at the head of the queue with a timeout value
     * @param key Entry's key
     * @param value Object value
     * @param timeout timeout value
     */
    public void push (K key, V value, long timeout);

    /**
     * @param keys array of keys to check
     * @return true if one or more keys are available in the space
     */
    public boolean existAny (K[] keys);

    /**
     * @param keys array of keys to check
     * @param timeout to wait for any of the entries to become available
     * @return true if one or more keys are available in the space
     */
    public boolean existAny (K[] keys, long timeout);

    /**
     * Write a single entry at the head of the queue discarding the other entries
     * @param key Entry's key
     * @param value Object value

     */
    public void put (K key, V value);

    /**
     * Write a single entry at the head of the queue discarding the other entries, with timeout.
     * @param key Entry's key
     * @param value Object value
     * @param timeout timeout value
     */
    public void put (K key, V value, long timeout);

}