select name from v$datafile
/** A LinkedList that efficiently sorts itself with every add.
*
* @author apodehl
*
*/
public class SortedList< T extends Comparable> extends LinkedList
{
/** Adds this element to the list at the proper sorting position.
* If the element already exists, don't do anything.
*/
@Override
public boolean add(T e)
{
if( size()==0 ) {
return super.add(e);
}
else {
// find insertion index
int idx = -Collections.binarySearch(this, e)-1;
if( idx < 0 ) {
return true; // already added
}
// add at this position
super.add(idx, e);
return true;
}
}
}
import java.util.Collection;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Set;
/**
* One possible implementation of a Bi-directional Map.
*
* Note: there are several variations of BiMap, depending on the behaviour of put(k,v)... Is it allowed to have more
* than one k for one value ?? Modify
*
* @author apodehl
*
* @param
* @param
*/
public class BiMap implements Map
{
Map keyVal; // maps key->value
Map valKey; // maps value->key
public BiMap()
{
keyVal = new LinkedHashMap();
valKey = new LinkedHashMap();
}
@Override
public V put(K key, V val)
{
// --- this implementation allows one-to-one ONLY !! ---
if (valKey.containsKey(val)) {
keyVal.remove(valKey.get(val));
}
if (keyVal.containsKey(key)) {
valKey.remove(keyVal.get(key));
}
// --- remove above if that's not what you want ---
//
valKey.put(val, key);
return keyVal.put(key, val);
}
@Override
public void putAll(Map< ? extends K, ? extends V> m)
{
for (Entry< ? extends K, ? extends V> e : m.entrySet()) {
put(e.getKey(), e.getValue());
}
}
/**
* Type-safe get.
*
* @param key
* @return
*/
public K getKey(V val)
{
return valKey.get(val);
}
/**
* Type-safe get.
*
* @param key
* @return
*/
public V getVal(K key)
{
return keyVal.get(key);
}
@Override
// unfortunately Map interface isn't type-safe
public V get(Object key)
{
return getVal((K) key);
}
/**
* Type-safe contains.
*
* @param key
* @return
*/
public boolean contains(K key)
{
if (keyVal == null) return false;
return keyVal.containsKey(key);
}
/**
* Type-safe containsValue.
*
* @param key
* @return
*/
public boolean containsVal(V val)
{
if (valKey == null) return false;
return valKey.containsKey(val);
}
// unfortunately Map interface isn't type safe here ..
@Override
public boolean containsKey(Object key)
{
return contains((K) key);
}
// unfortunately Map interface isn't type safe here ..
@Override
public boolean containsValue(Object value)
{
return containsVal((V) value);
}
@Override
public Set< java.util.Map.Entry> entrySet()
{
return keyVal.entrySet();
}
@Override
public boolean isEmpty()
{
return keyVal.isEmpty();
}
@Override
public int size()
{
return keyVal.size();
}
@Override
public Collection values()
{
return keyVal.values();
}
public V removeByKey(K key)
{
V val = keyVal.remove(key);
valKey.remove(val);
return val;
}
public K removeByVal(V val)
{
K key = valKey.remove(val);
keyVal.remove(key);
return key;
}
// unfortunately Map interface isn't type-safe
@Override
public V remove(Object key)
{
return removeByKey((K) key);
}
@Override
public Set keySet()
{
return keyVal.keySet();
}
@Override
public void clear()
{
keyVal.clear();
valKey.clear();
}
public String toString()
{
String s = "BiMap:\n";
s += " key->value: " + keyVal.toString();
s += "\n";
s += " value->key: " + valKey.toString();
return s;
}
public static void main(String[] args)
{
BiMap biMap = new BiMap();
biMap.put("A", 1);
biMap.put("B", 2);
System.out.println(biMap); // {A=1, B=2}
biMap.put("C", 2);
System.out.println(biMap); // {A=1, C=2}
biMap.removeByVal(1);
System.out.println(biMap); // {C=2}
}
}
... parse command line options ...
// register shutdown hook Runtime.getRuntime().addShutdownHook(new ShutdownHook(...));
// register uncaught exception handler
Thread.currentThread().setDefaultUncaughtExceptionHandler( new UncaughtExceptionHandler() {
public void uncaughtException(Thread t, Throwable e)
{
e.printStackTrace();
if( e.getClass()==java.lang.OutOfMemoryError.class ) {
System.err.println("FATAL: shutting down because of java.lang.OutOfMemoryError ...");
System.exit(7);
}
}} );
File restart = new File("webservice.restart"); // tell the shell to restart me
restart.createNewFile();
... start your service ...
#!/bin/sh
#try to start service once
${JAVA_HOME}/bin/java -DREPLAYWEB ${JOPT} com.codestreet.replay.jms.shell.web.ReplayWeb $*
# restart again (until webservice.restart file was removed)
while [ -f webservice.restart ]; do
echo "### RESTART ###"
/bin/rm -f webservice.restart # let Java decide if we really want to restart
${JAVA_HOME}/bin/java -DREPLAYWEB ${JOPT} com.codestreet.replay.jms.shell.web.ReplayWeb $*
done
psline=`/bin/ps -aef | /bin/grep "REPLAYWEB" | /bin/grep -v grep`
echo $psline
pid=`echo $psline | /bin/awk '{ print $2}'`
if [ $pid ]
then
/bin/rm -f webservice.restart
echo "stop_webservice: killing Web Service with pid=$pid"
kill $pid
else
echo "stop_webservice: Web Service was not running"
fi
Posts
All Comments
