Please take our Survey
logo       

Choosing A Webhost:
A web hosting service is a type of Internet hosting service that allows individuals and organizations to provide their own website accessible via the World Wide Web. Web hosts are companies that provide space on a server they own for use by their clients as well as providing Internet connectivity, typically in a data center. Web hosts can also provide data center space and connectivity to the Internet for servers they do not own to be located in their data center, called colocation. more...

Nice/stdlib/nice/lang java.nice,1.28,1.29: msg#00138

lang.nice.cvs

Subject: Nice/stdlib/nice/lang java.nice,1.28,1.29

Update of /cvsroot/nice/Nice/stdlib/nice/lang
In directory sc8-pr-cvs1:/tmp/cvs-serv12797/F:/nice/stdlib/nice/lang

Modified Files:
java.nice
Log Message:
retypings for the class methods of java.util.

Index: java.nice
===================================================================
RCS file: /cvsroot/nice/Nice/stdlib/nice/lang/java.nice,v
retrieving revision 1.28
retrieving revision 1.29
diff -C2 -d -r1.28 -r1.29
*** java.nice 28 Aug 2003 22:51:06 -0000 1.28
--- java.nice 29 Aug 2003 13:45:08 -0000 1.29
***************
*** 145,148 ****
--- 145,174 ----
<K,V> V setValue(Map.Entry<K,V>, V) = native Object
Map.Entry.setValue(Object);

+ <T> void ensureCapacity(ArrayList<T>, int) = native void
ArrayList.ensureCapacity(int);
+ <T> void trimToSize(ArrayList<T>) = native void ArrayList.trimToSize();
+ <T> void addFirst(LinkedList<T>, T) = native void LinkedList.addFirst(Object);
+ <T> void addLast(LinkedList<T>, T) = native void LinkedList.addLast(Object);
+ <T> T getFirst(LinkedList<T>) = native Object LinkedList.getFirst();
+ <T> T getLast(LinkedList<T>) = native Object LinkedList.getLast();
+ <T> T removeFirst(LinkedList<T>) = native Object LinkedList.removeFirst();
+ <T> T removeLast(LinkedList<T>) = native Object LinkedList.removeLast();
+ <T> boolean empty(Stack<T>) = native boolean Stack.empty();
+ <T> T peek(Stack<T>) = native Object Stack.peek();
+ <T> T pop(Stack<T>) = native Object Stack.pop();
+ <T> T push(Stack<T>, T) = native Object Stack.push(Object);
+ <T,U | T <: U> int search(Stack<T>, U) = native int Stack.search(Object);
+ <T> void addElement(Vector<T>, T) = native void Vector.addElement(Object);
+ <T> int capacity(Vector<T>) = native int Vector.capacity();
+ <T,U | T <: U> void copyInto(Vector<T>, U[]) = native void
Vector.copyInto(Object[]);
+ <T> T elementAt(Vector<T>, int) = native Object Vector.elementAt(int);
+ <T> T firstElement(Vector<T>) = native Object Vector.firstElement();
+ <T> T lastElement(Vector<T>) = native Object Vector.lastElement();
+ <T> boolean removeElement(Vector<T>, T) = native boolean
Vector.removeElement(Object);
+ <T> void removeElementAt(Vector<T>, int) = native void
Vector.removeElementAt(int);
+ <T> void setElementAt(Vector<T>, T, int) = native void
Vector.setElementAt(Object, int);
+ <T> void insertElementAt(Vector<T>, T, int) = native void
Vector.insertElementAt(Object, int);
+ <T> void setSize(Vector<T>,int) = native void Vector.setSize(int);
+ <T> void trimToSize(Vector<T>) = native void Vector.trimToSize();
+ <T> void removeAllElements(Vector<T>) = native void
Vector.removeAllElements();

<T> Iterator<T> iterator(Collection<T>) =
***************
*** 209,213 ****
<K, V, V0 | V <: V0> java.util.Collection<V0> values(java.util.Map<K, V>) =
native java.util.Collection java.util.Map.values();
! <K, K0, V, V0 | K <: K0, V <: V0> java.util.Set<java.util.Map.Entry<K0, V0>>
entrySet(java.util.Map<K, V>) =
native java.util.Set java.util.Map.entrySet();
<K, V, V0 | V <: V0> boolean contains(java.util.Hashtable<K,V>, V0) =
--- 235,239 ----
<K, V, V0 | V <: V0> java.util.Collection<V0> values(java.util.Map<K, V>) =
native java.util.Collection java.util.Map.values();
! <K, V> java.util.Set<java.util.Map.Entry<K, V>> entrySet(java.util.Map<K, V>)
=
native java.util.Set java.util.Map.entrySet();
<K, V, V0 | V <: V0> boolean contains(java.util.Hashtable<K,V>, V0) =




-------------------------------------------------------
This sf.net email is sponsored by:ThinkGeek
Welcome to geek heaven.
http://thinkgeek.com/sf


<Prev in Thread] Current Thread [Next in Thread>
Google Custom Search

Recently Viewed:
qnx.openqnx.dev...    gcc.libstdc++.c...    solaris.opensol...    information-ret...    misc.misterhous...    web.catalyst.ge...    apache.webservi...    redhat.release....    hardware.lirc/2...    kernel.autofs/2...    technology.sust...    linux.vdr/2003-...    editors.lyx.gen...    org.user-groups...    netbsd.devel.pk...    xdg.devel/2004-...    version-control...    jakarta.slide.d...    debian.packages...    creativecommons...    ports.ppc.embed...    bug-tracking.bu...   
Home | blog view | USPTO Patent Archive | advertise | OSDir is an inevitable website. super tiny logo

Free Magazines

Cisco News
Receive a free quarterly e-newsletter with exclusive articles on how Cisco IT uses its own products and solutions to enable the business.
subscribe

Systems Management News, the newspaper for IT systems administration and data center managers! Each issue of Systems Management News is chock-full of news and analysis to help you understand what's happening in your field.
subscribe

The Enterprise Newsweekly eWeek is the essential technology information source for builders of e-business.
subscribe

Oracle Magazine Oracle Magazine contains technology strategy articles, sample code, tips, Oracle and partner news, how to articles for developers and DBAs, and more. Oracle (NASDAQ: ORCL) is the world's largest enterprise software company.
subscribe

Total Telecom Total Telecom is "The Economist of the communications industry".
subscribe