Problem in Array List
Hi Friends,
The below problem occurs while assigning bulk records to arraylist
com.sun.corba.se.impl.encoding.CDRInputStream_1_0 checkBlockLength
WARNING: "IOP00810201: (MARSHAL) Data read past end of chunk without closing the chunk"
org.omg.CORBA.MARSHAL: vmcid: SUN minor code: 201 completed: No
at com.sun.corba.se.impl.logging.ORBUtilSystemException.chunkOverflow(Unknown Source)
at com.sun.corba.se.impl.logging.ORBUtilSystemException.chunkOverflow(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.checkBlockLength(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_2.alignAndCheck(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_longlong(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_double(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream.read_double(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.inputPrimitiveField(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.inputClassFields(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.inputObject(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.simpleReadObject(Unknown Source)
at com.sun.corba.se.impl.io.ValueHandlerImpl.readValueInternal(Unknown Source)
at com.sun.corba.se.impl.io.ValueHandlerImpl.readValue(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_value(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_value(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_abstract_interface(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_abstract_interface(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream.read_abstract_interface(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.readObjectDelegate(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.readObjectOverride(Unknown Source)
at java.io.ObjectInputStream.readObject(Unknown Source)
at java.util.ArrayList.readObject(Unknown Source)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(Unknown Source)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(Unknown Source)
at java.lang.reflect.Method.invoke(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.invokeObjectReader(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.inputObject(Unknown Source)
at com.sun.corba.se.impl.io.IIOPInputStream.simpleReadObject(Unknown Source)
at com.sun.corba.se.impl.io.ValueHandlerImpl.readValueInternal(Unknown Source)
at com.sun.corba.se.impl.io.ValueHandlerImpl.readValue(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream_1_0.read_value(Unknown Source)
at com.sun.corba.se.impl.encoding.CDRInputStream.read_value(Unknown Source)
at com.kgisl.kurnia.administration.ejb._AdministrationEJB_Stub.agentfindAll(_AdministrationEJB_Stub.java:296)
at com.kgisl.kurnia.administration.FrmAgentProfileCT.FnLoadTree(FrmAgentProfileCT.java:101)
at com.kgisl.kurnia.administration.FrmAgentProfileCT.<init>(FrmAgentProfileCT.java:301)
at com.kgisl.kurnia.administration.FrmClientTransfer.btnFromAccCodeActionPerformed(FrmClientTransfer.java:314)
at com.kgisl.kurnia.administration.FrmClientTransfer.access$2(FrmClientTransfer.java:313)
at com.kgisl.kurnia.administration.FrmClientTransfer$4.actionPerformed(FrmClientTransfer.java:432)
at javax.swing.AbstractButton.fireActionPerformed(Unknown Source)
at javax.swing.AbstractButton$Handler.actionPerformed(Unknown Source)
at javax.swing.DefaultButtonModel.fireActionPerformed(Unknown Source)
at javax.swing.DefaultButtonModel.setPressed(Unknown Source)
at javax.swing.plaf.basic.BasicButtonListener.mouseReleased(Unknown Source)
at java.awt.Component.processMouseEvent(Unknown Source)
at javax.swing.JComponent.processMouseEvent(Unknown Source)
at java.awt.Component.processEvent(Unknown Source)
at java.awt.Container.processEvent(Unknown Source)
at java.awt.Component.dispatchEventImpl(Unknown Source)
at java.awt.Container.dispatchEventImpl(Unknown Source)
at java.awt.Component.dispatchEvent(Unknown Source)
at java.awt.LightweightDispatcher.retargetMouseEvent(Unknown Source)
at java.awt.LightweightDispatcher.processMouseEvent(Unknown Source)
at java.awt.LightweightDispatcher.dispatchEvent(Unknown Source)
at java.awt.Container.dispatchEventImpl(Unknown Source)
at java.awt.Window.dispatchEventImpl(Unknown Source)
at java.awt.Component.dispatchEvent(Unknown Source)
at java.awt.EventQueue.dispatchEvent(Unknown Source)
at java.awt.EventDispatchThread.pumpOneEventForHierarchy(Unknown Source)
at java.awt.EventDispatchThread.pumpEventsForHierarchy(Unknown Source)
at java.awt.EventDispatchThread.pumpEvents(Unknown Source)
at java.awt.EventDispatchThread.pumpEvents(Unknown Source)
at java.awt.EventDispatchThread.run(Unknown Source)
Thanks in Advance
A) Use a java.util.Set
B) Create a java.util.List from the Set and use Collections.sort()
~
Similar Messages
-
Problem passing multiple array lists to a single method
Hi, all:
I have written a generic averaging method that takes an array list full of doubles, adds them all up, divides by the size of the array list, and spits out a double variable. I want to pass it several array lists from another method, and I can't quite figure out how to do it. Here's the averager method:
public double averagerMethod (ArrayList <Double> arrayList) {
ArrayList <Double> x = new ArrayList <Double> (arrayList); //the array list of integers being fed into this method.
double total = 0;//the total of the integers in that array list.
for (int i = 0; i < x.size(); i++) {//for every element in the array list,
double addition = x.get(i);//get each element,
total = total + addition; //add it to the total,
double arrayListSize = x.size();//get the total number of elements in that array list,
double average = total/arrayListSize;//divide the sum of the elements by the number of elements,
return average;//return the average.
}And here's the method that sends several array lists to that method:
public boolean sameParameterSweep (ArrayList <Double> arrayList) {
sameParameterSweep = false;//automatically sets the boolean to false.
arrayList = new ArrayList <Double> (checker);//instantiate an array list that's the same as checker.
double same = arrayList.get(2); //gets the third value from the array list and casts it to double.
if (same == before) {//if the third value is the same as the previous row's third value,
processARowIntoArrayLists(checker);//send this row to the parseAParameterSweep method.
sameParameterSweep = true;//set the parameter sweep to true.
if (same != before) {//if the third value is NOT the same,
averagerMethod(totalTicks);//go average the values in the array lists that have been stored.
averagerMethod(totalNumGreens);
averagerMethod(totalNumMagentas);
sameParameterSweep = false;
before = same; //problematic!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
return sameParameterSweep;
}Obviously, the problem is that I'm not passing the array lists from this method to the averager method the right way. What am I doing wrong?Encephalopathic wrote:
There are several issues that I see, but the main one is that you are calculating average results but then just discarding them. You never assign the result to a variable.
In other words you're doing this:
averagerMethod(myArrayList); // this discards the resultinstead of this:
someDoubleVariable = averagerMethod(myArrayList); // this stores the resultAlso, do you wish to check for zero-sized array lists before calculating? And what would you return if the array list size were zero?So in solving that problem, I've come up with another one that I can't figure out, and I can't fix this problem until I fix that.
I have several thousand lines of data. They consist of parameter sweeps of given variables. What I'm trying to do is to store pieces of
data in array lists until the next parameter adjustment happens. When that parameter adjustment happens, I want to take the arraylists
I've been storing data in, do my averaging thing, and clear the arraylists for the next set of runs under a given parameter set.
Here's the issue: I'm having the devil of a time telling my application that a given parameter run is over. Imagine me doing stuff to several variables (number of solders, number of greens, number of magentas) and getting columns of output. My data will hold constant the number of soldiers, and for, say, ten runs at 100 soldiers, I'll get varying numbers of greens and magentas at the end of each of those ten runs. When I switch to 150 soldiers to generate data for ten more runs, and so forth, I need to average the number of greens and magentas at the end of the previous set of ten runs. My problem is that I can't figure out how to tell my app that a given parameter run is over.
I have it set up so that I take my data file of, say, ten thousand lines, and read each line into a scanner to do stuff with. I need to check a given line's third value, and compare it to the previous line's third value (that's the number of soldiers). If this line has a third value that is the same as the previous line's third value, send this line to the other methods that break it up and store it. If this line has a third value that is NOT the same as the previous line's third value, go calculate the averages, clear those array lists, and begin a new chunk of data by sending this line to the other methods that break it up and store it.
This is not as trivial a problem as it would seem at first: I can't figure out how to check the previous line's third value. I've written a lot of torturous code, but I just deleted it because I kept getting myself in deeper and deeper with added methods. How can I check the previous value of an array list that's NOT the one I'm fiddling with right now? Here's the method I use to create the array lists of lines of doubles:
public void parseMyFileLineByLine() {
totalNumGreens = new ArrayList <Double>();//the total number of greens for a given parameter sweep
totalNumMagentas = new ArrayList <Double>();//the total number of magentas for a given parameter sweep.
totalTicks = new ArrayList <Double>();//the total number of ticks it took to settle for a given parameter sweep.
for (int i = 8; i < rowStorer.size() - 2; i++) {//for each line,
checker = new ArrayList <Double>();//instantiates an array list to store each piece in that row.
String nextLine = rowStorer.get(i); //instantiate a string that contains all the information in that line.
try {
Scanner rowScanner = new Scanner (nextLine); //instantiates a scanner for the row under analysis.
rowScanner.useDelimiter(",\\s*");//that scanner can use whitespace or commas as the delimiter between information.
while (rowScanner.hasNext()) {//while there's still information in that scanner,
String piece = rowScanner.next(); //gets each piece of information from the row scanner.
double x = Double.valueOf(piece);//casts that stringed piece to a double.
checker.add(x);//adds those doubles to the array list checker.
catch (NoSuchElementException nsee) {
nsee.printStackTrace();
//System.out.println("checker contains: " + checker);
processARowIntoArrayLists(checker);//sends checker to the method that splits it up into its columns.
} -
Adding two array lists together and a text file to an array list
I'm having problems coding these two methods... Could someone explain how to do this? I can't find information on it anywhere... :(
"MagazineList" is the class I'm coding in right now, and I already declared "list" as an array list of another class called "Magazine".
public boolean addAll(MagazineList magazines)
if (list == magazines) {
return false;
else {
list.addAll(magazines);
return true;
public boolean addAll(String filename)
Scanner in = ResourceUtil.openFileScanner(filename);
if (in == null) {
return false;
String line = source.nextLine();
while (!line.equals("")) {
list.add(Magazine(source));
in.close();
}I assume "addAll(MagazineList magazines)" is defined in the MagazineList class?
Then,
list.addAll(magazines);probably needs to be something like:
list.addAll(magazines.list);This uses the private variable ( should be private) list from the input MagazineList, and adds all of those Magazine objects to the list in the current MagazineList.
But, yes, describe your problems more clearly, and you'll get better answers more quickly (because people will be able to understand you and give you a suggestion without asking you another question first). -
How do I extract the length of an element in an Array List
Hello there,
I am facing this problem with an Array List of elements. I am trying to extract the individual length of a particular element in the array list . Now if I know the element is a String is this valid?
int lengthOfElement = 0;
lengthOfElement = ((String)parms.get(i)).length();
Your answer is much appreciated
RegardsSnap!I don't know how many times I've seen people post
saying that they have a list where each element is a
String, but they keep on getting ClassCastException :)Damn those Integers!
� {� -
Problems binding array in C# to stored procedure.
I'm having trouble trying to pass an array of ID's to a stored procedure that is expecting an array (listed the procedure definition below). My current interface doesn't return an error, but it also doesn't insert the proper id's.
STORED PROCEDURE DEFINITION:
TYPE source_ids IS TABLE OF wweb.DM_ASSOCIATIONS.source_id%TYPE INDEX BY PLS_INTEGER;
PROCEDURE add_message_associations
(p_dm_message_id IN wweb.dm_messages.dm_message_id%TYPE
,p_association_type IN wweb.dm_associations.association_type%TYPE
,p_sources IN source_ids
,p_create_user IN wweb.dm_associations.create_user%TYPE)
.......variable definitions here...
v_source_id := p_sources.First;
WHILE v_source_id IS NOT NULL
LOOP
-- Check if this association already exists.
-- If not add them.
v_assoc_exists := 0;
FOR r_chk IN
(SELECT 1 AS assoc_exists_flag
FROM dm_associations a
WHERE a.dm_message_id = p_dm_message_id
AND a.association_type = p_association_type
AND a.source_id = v_source_id)
LOOP
v_assoc_exists := r_chk.assoc_exists_flag;
END LOOP;
IF v_assoc_exists = 0 THEN
-- Add the association
INSERT INTO wweb.dm_associations
(dm_association_id
,dm_message_id
,association_type
,source_id
,source_column_name
,active_flag
,create_date
,create_user
,last_update_date
,last_update_user)
VALUES
(wweb.dm_associations_s.NEXTVAL
,p_dm_message_id
,p_association_type
,v_source_id
,v_source_column_name
,1
,SYSDATE
,p_create_user
,SYSDATE
,p_create_user);
END IF;
.......error handling here...
C# CODE:
OracleParameter[] param = new OracleParameter[4];
param[0] = new OracleParameter("p_dm_message_id", OracleDbType.Long);
param[1] = new OracleParameter("p_association_type", OracleDbType.Varchar2, 5);
param[2] = new OracleParameter("p_sources", OracleDbType.Int32);
param[3] = new OracleParameter("p_create_user", OracleDbType.Varchar2, 25);
param[0].Value = 1;
param[1].Value = "ER";
param[2].Value = new Int32 [] {1, 172, 412, 7953};
param[3].Value = "SVC-GDESAI";
param[2].CollectionType = OracleCollectionType.PLSQLAssociativeArray;
param[2].Size = 4;
param[2].ArrayBindStatus = new OracleParameterStatus[4]{OracleParameterStatus.Success, OracleParameterStatus.Success, OracleParameterStatus.Success, OracleParameterStatus.Success};
cn = new OracleConnection(ConnectionString);
cn.Open();
OracleCommand cmd = new OracleCommand();
cmd.Connection = cn;
cmd.CommandText= "dynamic_messages_api.add_message_associations";
cmd.CommandType= CommandType.StoredProcedure;
foreach (OracleParameter p in param)
if ((p.Direction == ParameterDirection.InputOutput || p.Direction == ParameterDirection.Input) && (p.Value == null || p.Value.ToString() == ""))
p.Value = DBNull.Value;
cmd.Parameters.Add(p);
cmd.ExecuteNonQuery();
This ran fine, and created four rows in the table, but the source id's were (1, 2, 3, 4) instead of (1, 172, 412, 7953) which were the ones I passed in.
Does anyone know what I'm doing wrong here?
Thanks,
GaurangaHi,
I think you have a problem in you PL/SQL procedure. When you receive an array in the procedure, it is your responsibility to parse it explicitely with a loop or to bulk insert with a "forall" (implicit).
For instance, here is an example of a procedure of mine. I don't catch exceptions as I want the C# calling code to know about them:
The type t_* are defined like yours.
procedure UpdateDistribDates(p_bannerid in t_bannerid,
p_promonumber in t_promonumber,
p_datenumber in t_datenumber,
p_actualdate in t_actualdate ) is
BEGIN
-- First delete the existing dates in bulk
FORALL I IN P_BANNERID.FIRST..P_BANNERID.LAST
DELETE FROM PROMODISTRIBDATE
WHERE BANNERID = P_BANNERID(I)
AND PROMONUMBER = P_PROMONUMBER(I);
-- Then, insert the values passed in arrays.
FORALL I IN P_BANNERID.FIRST..P_BANNERID.LAST
INSERT INTO PROMODISTRIBDATE
(BANNERID,
PROMONUMBER,
DATENUMBER,
ACTUALDATE)
VALUES (P_BANNERID(I),
P_PROMONUMBER(I),
P_DATENUMBER(I),
P_ACTUALDATE(I));
END;
As you can see, the FORALL keyword will process the arrays passed as any other PL/SQL array in one chunk.
When you do the insert like:
INSERT INTO wweb.dm_associations
(dm_association_id
,dm_message_id
,association_type
,source_id
,source_column_name
,active_flag
,create_date
,create_user
,last_update_date
,last_update_user)
VALUES
(wweb.dm_associations_s.NEXTVAL
,p_dm_message_id
,p_association_type
,v_source_id
,v_source_column_name
,1
,SYSDATE
,p_create_user
,SYSDATE
,p_create_user);
In source_id, you insert the index of the table, not the value of the field.
I would suggest you completely rewrite this procedure by using the explicit loop like this:
1/ Explicit loop
FOR i IN 1 .. p_sources.COUNT LOOP
-- Check the existence
EXIST_FLAG := 0;
BEGIN
SELECT 1
INTO EXIST_FLAG
FROM ...
WHERE ...
AND a.source_id = p_source(i) <-- You are parsing here
AND ...
EXCEPTION
WHEN OTHERS THEN -- Nothing was found
EXIST_FLAG := 0;
END;
IF (EXIST_FLAG = 1)
INSERT INTO wweb.dm_associations
(dm_association_id
,dm_message_id
,association_type
,source_id
,source_column_name
,active_flag
,create_date
,create_user
,last_update_date
,last_update_user)
VALUES
(wweb.dm_associations_s.NEXTVAL
,p_dm_message_id
,p_association_type
,p_source(i) <-- You parse here
END IF;
END LOOP;
2/ Implicit loop and bulk insert
You would need to completely review the logic and build an array that maps exactly the row of the table you are trying to insert into. Parse the array and check for the existence of your entry, delete the row in memory when not found, then, after the loop do a bulk insert with a "forall".
Hope it helps,
Patrice -
Previous element in array list
hello ppl..
i hope u guys can help me here.. i am developing a program that sort an amount of strings and output to a file..and i place them inside an array list..i use Collections.sort to sort it..
now the problem is..i want to handle duplicate strings meaning deleting the duplicate strings..however my code doesnt seem to work..here it is
Iterator check = c.iterator();
while (check.hasNext() == true)
if (check.previous() == check.next())
check.remove();
br.write(check.next() + "\r\n");
c is my arraylist name. JDK's error is they cannot resolve symbol previous () method but i found it inside util and i imported the whole util..by import java.util.*;
Please help..thank youGood catch. It's very rare that you use == to compare objects. You only do that when you want to see if the two references are both aimed at the same object. Normally what you want to do (and what should be done here) is to use equals to see if the two objects' "contents" or "values" are the same.
>
if (check.previous() == check.next())Did you use this piece in the program?
If so could this be the problem?
I think that when you use the "==" operator it checks
to see if the two objects share the same memory
location.
Like when you are comparing Strings you must use the
String.equals(String s) method they they will never
match with "==".
Maybe this is not the problem but I like to
ramble...
-- Ian -
How to find and display the posistion in an array list
hi all,
i know this is proballly simple but i have an arraylist where every time someone connects to my system it adds them to an arraylist, how can i post back somelike like hi user "1" thanks for connecting and so on. i just dont understand how to find their unique posistion in the array list and display it as a number.
any help would be greatSo to be clear...
You have an arraylist of connections .... for example
ArrayList<ConnectedPeople> connPplArr = new ArrayList();And then each time someone connects you would add a connected people object to the arraylist.
ConnectedPeople, migh contain username etc etc.
You could then do:
ConnectedPeople newConnection..... ;
int index = connPplArr.indexOf( newConnection );
if(int == -1){
add them to your array
index = connPplArr.size();
return "Hello user "+ index;That what you mean?
I know some of it is sudo code, but have I understood your problem?
Edited by: Azzer_Mac on Apr 29, 2008 2:20 AM
Edited by: Azzer_Mac on Apr 29, 2008 2:20 AM -
A suggestion : use "loop array list" instead of ArrayList / LinkedList
ArrayList is good at:
get / set by index : O(1)
appending : O(log(n))
remove last : O(1)
and very bad at:
add middle : O(n)
remove from middle : O(n)
LinkedList is good at:
fast remove from middle, if your iteraror already goes there : O(1)
convenient methods : addFirst, addLast, removeFirst, removeLast : O(1)
and very bad at :
get / set by index : O(n)
here I want to make a suggestion : use "loop array list" instead of the ArrayList and LinkedList.
a "loop array list" is based on array, just like ArrayList. But it has 2 member-variables : the start position, and the real size. the start position can be anywhere within array.length. an element of index "i" is stored in array[ start + i ], and when (start + i > array.length), loop to the beginning of the array; when (start + i < 0), loop to the end of the array.
this "loop array list" has all the good sides:
get / set by index : O(1)
add first / last : O(log(n))
remove first / last : O(log(n))
add / remove from middle : O(n)
(note : because we shrink the backup-array when the real size is too small, add / remove operation take O(log(n)) now.)
the only problem is : add / remove from middle. let's take a look at it.
1. the LinkedList does NOT really add/remove from middle in O(1), you has to locate the element, which is O(n).
2. O(n) is acceptable, O(n^2) is not acceptable. try this : keep removing first element from an very big ArrayList ( size>10^6 ) until it's empty.
the fact is, any list can perform batch-remove / batch-add operation in O(n) instead of O(n^2). it's easy : allocate a new list, iterate the original list, copy the element into the new list if condition is satisfied.
so, instead of "remove from middle", what we need is a new methods : removeAllByCondition( Condition condition ), and now the batch-remove operation can be done in O(n)
here is an implementation of mine. I've tested it on my computer( 512mem + 2G cpu, win2k + jdk1.5 ), it's amazing, just a little slower then ArrayList when add last, and a liitle slower then LinkedList when batch-remove. in all other cases, it's far more better then those 2 kinds of List.
// source code : List2
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
public final class List2<T> extends AbstractList<T> {
private static int initialArrayLength = 4;
private T[] array;
private int start;
private int size;
private void init( T[] newArray, int start_a, int size_a ) {
array = newArray;
start = start_a;
size = size_a;
@SuppressWarnings("unchecked")
private void init() {
init( (T[]) new Object[ initialArrayLength ], 0, 0 );
public List2() {
init();
@SuppressWarnings("unchecked")
public List2( Collection<? extends T> collection ) {
init(
collection.toArray( (T[]) new Object[ collection.size() * 11 / 10 + 1 ] ),
0,
collection.size()
private List2( T[] array_a, int start_a, int size_a ) {
init( array_a, start_a, size_a );
@SuppressWarnings("unchecked")
public static <TT> List2<TT> createV( TT... elements ) {
TT[] array = (TT[]) new Object[ elements.length * 11 / 10 + 1 ];
System.arraycopy( elements, 0, array, 0, elements.length );
return new List2<TT>( array, 0, elements.length );
public static List2<Double> create( double... elements ) {
Double[] array = new Double[ elements.length * 11 / 10 + 1 ];
for( int i=0; i < elements.length; i++ )
array[i] = elements;
return new List2<Double>( array, 0, elements.length );
public static List2<Integer> create( int... elements ) {
Integer[] array2 = new Integer[ elements.length * 11 / 10 + 1 ];
for( int i=0; i < elements.length; i++ )
array2[i] = elements[i];
return new List2<Integer>( array2, 0, elements.length );
public static List2<Character> create( char... elements ) {
Character[] array2 = new Character[ elements.length * 11 / 10 + 1 ];
for( int i=0; i < elements.length; i++ )
array2[i] = elements[i];
return new List2<Character>( array2, 0, elements.length );
public static List2<Character> create( String s ) {
return create( s.toCharArray() );
public List2<T> clone() {
return new List2<T>( this );
// basic
public int size() {
return size;
private int index( int index ) {
int i = start + index;
if( i >= array.length )
i -= array.length;
return i;
public T get( int d ) {
if( d < 0 || d >= size )
throw new IndexOutOfBoundsException();
if( size == 0 )
throw new NoSuchElementException();
return array[ index( d ) ];
public T set( int index, T element ) {
if( index < 0 || index >= size )
throw new IndexOutOfBoundsException();
int i = index( index );
T oldElement = array[i];
array[i] = element;
return oldElement;
@SuppressWarnings("unchecked")
private void copyAndSetToNewArray( int newArrayLength ) {
T[] newArray = (T[]) new Object[ newArrayLength ];
for( int i=0; i<size; i++ )
newArray[i] = array[ index( i ) ];
init( newArray, 0, size );
public void addFirst( T element ) {
if( size == array.length )
copyAndSetToNewArray( size * 3 / 2 + 1 );
int i = index( array.length - 1 );
array[ i ] = element;
start = i;
size++;
public void addLast( T element ) {
if( size == array.length )
copyAndSetToNewArray( size * 3 / 2 + 1 );
array[ index( size ) ] = element;
size++;
public T removeFirst() {
if( size == 0 )
throw new NoSuchElementException();
T oldElement = array[ start ];
array[ start ] = null;
start = index( 1 );
size--;
if( array.length > size * 2 + 1 )
copyAndSetToNewArray( size * 11 / 10 + 1 );
return oldElement;
public T removeLast() {
if( size == 0 )
throw new NoSuchElementException();
int i = index( size - 1 );
T oldElement = array[i];
array[i] = null;
size--;
if( array.length > size * 2 + 1 )
copyAndSetToNewArray( size * 11 / 10 + 1 );
return oldElement;
@SuppressWarnings("unchecked")
public int removeAll( ListCondition<T> condition ) {
T[] newArray = (T[]) new Object[ array.length ];
int iNew = 0;
for( int i=0; i < size; i++ ) {
T element = get( i );
if( ! condition.isConditionSatisfied( this, i, element ) )
newArray[ iNew++ ] = element;
int oldSize = size;
init( newArray, 0, iNew );
if( array.length > size * 2 + 1 )
copyAndSetToNewArray( size * 11 / 10 + 1 );
return size - oldSize;
// aux
public boolean equals(Object obj) {
if( obj == this )
return true;
if( obj instanceof List2 ) {
List2 that = (List2) obj;
if( this.size != that.size )
return false;
for( int i=0; i < size; i++ )
if( ! Tools.equals( this.array[ this.index(i) ], that.array[ that.index(i) ] ) )
return false;
return true;
if( obj instanceof List ) {
List that = (List) obj;
if( this.size != that.size() )
return false;
Iterator thatIter = that.iterator();
for( int i=0; i < size; i++ )
if( ! Tools.equals( this.array[ this.index(i) ], thatIter.next() ) )
return false;
return true;
return true;
public int hashCode() {
int hashCode = 1;
for( int i=0; i < size; i++ ) {
T element = array[ index( i ) ];
hashCode = 31*hashCode + ( element==null ? 0 : element.hashCode() );
return hashCode;
public boolean isEmpty() {
return size == 0;
public T getFirst() {
return get( 0 );
public T getLast() {
return get( size() - 1 );
public T getRandom() {
return get( (int) (Math.random() * size) );
public int indexOf( Object element ) {
for( int i=0; i < size; i++ )
if( Tools.equals( array[ index( i ) ], element ) )
return i;
return -1;
public int lastIndexOf( Object element ) {
for( int i=size-1; i >= 0; i-- )
if( Tools.equals( array[ index( i ) ], element ) )
return i;
return -1;
public boolean contains( Object element ) {
return indexOf( element ) != -1;
public boolean add( T element ) {
addLast( element );
return true;
@Deprecated
public void add( int index, T element ) {
throw new UnsupportedOperationException();
public T remove() {
return removeFirst();
@Deprecated
public boolean remove( Object element ) {
throw new UnsupportedOperationException( "use removeAll( Condition ) instead" );
@Deprecated
public T remove( int index ) {
throw new UnsupportedOperationException( "use removeAll( Condition ) instead" );
public void clear() {
init();
public Object[] toArray() {
Object[] result = new Object[ size ];
for( int i=0; i < size; i++ )
result[i] = array[ index( i ) ];
return result;
@SuppressWarnings("unchecked")
public <TT> TT[] toArray( TT[] a ) {
if( a.length < size )
a = (TT[]) java.lang.reflect.Array.newInstance( a.getClass().getComponentType(), size );
for( int i=0; i < size; i++ )
a[i] = (TT) array[ index( i ) ];
if( a.length > size )
a[size] = null;
return a;
@SuppressWarnings("unchecked")
public void sort() {
Object[] a = toArray();
Arrays.sort( a );
for( int i=0; i < size; i++ )
array[ i ] = (T) a[ i ];
start = 0;
@SuppressWarnings("unchecked")
public void sortDesc() {
Object[] a = toArray();
Arrays.sort( a );
for( int i=0, j=size-1; i < size; i++, j-- )
array[ i ] = (T) a[ j ];
start = 0;
@SuppressWarnings("unchecked")
public void sort( Comparator<T> comparator ) {
T[] a = (T[]) toArray();
Arrays.sort( a, comparator );
for( int i=0; i < size; i++ )
array[ i ] = a[ i ];
start = 0;
@SuppressWarnings("unchecked")
public void sortDesc( Comparator<T> comparator ) {
T[] a = (T[]) toArray();
Arrays.sort( a, comparator );
for( int i=0, j=size-1; i < size; i++, j-- )
array[ i ] = a[ j ];
start = 0;
public String toString( String delimiter ) {
return toString( "", delimiter, "", size() );
public String toString( String prefix, String delimiter, String suffix, int max ) {
StringBuffer stringBuffer = new StringBuffer( prefix );
int dest = Math.min( max, size );
for( int i=0; i < dest; i++ ) {
stringBuffer.append( get(i) );
if( i < dest - 1 )
stringBuffer.append( delimiter );
if( size > max )
stringBuffer.append( "...(" ).append( size() - max ).append( " more)" );
stringBuffer.append( suffix );
return stringBuffer.toString();
// batch operation
public boolean containsAll( Collection<?> that ) {
Set<Object> thisSet = new HashSet<Object>( this );
for( Object element : that )
if( ! thisSet.contains( element ) )
return false;
return true;
@SuppressWarnings("unchecked")
public List2<T> subList( int fromIndex, int toIndex ) {
if( fromIndex < 0 || toIndex > size || toIndex < fromIndex )
throw new IndexOutOfBoundsException();
int newSize = toIndex - fromIndex;
T[] newArray = (T[]) new Object[ newSize * 11 / 10 + 1 ];
for( int i=fromIndex, iNew=0; i < toIndex; i++, iNew++ )
newArray[ iNew ] = array[ index( i ) ];
return new List2<T>( newArray, 0, newSize );
public void addV( T... that ) {
for( T element : that )
addLast( element );
public boolean addAll( Collection<? extends T> that ) {
for( T element : that )
addLast( element );
return ! that.isEmpty();
@Deprecated
public boolean addAll( int index, Collection<? extends T> c ) {
throw new UnsupportedOperationException();
public void removeRest( T element ) {
int position = lastIndexOf( element );
if( position == -1 )
return;
while( ! Tools.equals( element, removeLast() ) );
public void removeAllEquals( final T element ) {
removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T currentElement) {
return currentElement.equals( element );
public void removeAllBetween( final T from, final T to ) {
removeAll( new ListCondition<T>() {
@SuppressWarnings("unchecked")
public boolean isConditionSatisfied(List2 list, int index, T element) {
if( from != null && ((Comparable) from).compareTo( element ) > 0 )
return false;
if( to != null && ((Comparable) to).compareTo( element ) <= 0 )
return false;
return true;
public boolean retainAll( Collection<?> that ) {
final Set<Object> thatSet = new HashSet<Object>( that );
int removeCount = removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T element) {
return ! thatSet.contains( element );
return removeCount > 0;
public boolean removeAll( Collection<?> that ) {
final Set<Object> thatSet = new HashSet<Object>( that );
int removeCount = removeAll( new ListCondition<T>() { public boolean isConditionSatisfied(List2 list, int index, T element) {
return thatSet.contains( element );
return removeCount > 0;
// unit test
private static int maxTestCount = 1000 * 1000;
public static void unitTest() throws Exception {
// thest thoese methods for one time
Tools.ensureEquals( new List2(), new ArrayList() );
Tools.ensureNotEquals( List2.create( "abcde" ), new ArrayList() );
Tools.ensureNotEquals( List2.create( "abcde" ), List2.create( "abcdef" ) );
final List<Double> list1 = new ArrayList<Double>();
final List2<Double> list2 = new List2<Double>();
Runnable[] tasks = new Runnable[] {
// test those methods that do NOT change the list
new Runnable() { public void run() {
Tools.ensureEquals( new List2<Double>( list1 ), list1 );
Tools.ensureEquals( List2.createV( list1.toArray() ), list1 );
Tools.ensureEquals( List2.createV( list1.toArray( new Double[0] ) ), list1 );
double[] doubles = new double[ list1.size() ];
int i = 0;
for( double d : list1 )
doubles[i++] = d;
Tools.ensureEquals( List2.create( doubles ), list1 );
Tools.ensure( list1.isEmpty() == list2.isEmpty() );
Arrays.equals( list1.toArray(), list2.toArray() );
Tools.ensureEquals( list1, list2.clone() );
Double notExistElement = -2.0;
Tools.ensure( list1.indexOf( notExistElement ) == -1 );
Tools.ensure( list1.lastIndexOf( notExistElement ) == -1 );
Tools.ensure( list1.contains( notExistElement ) == false );
Tools.ensureEquals( list1.toString(), list2.toString() );
Tools.ensureEquals( list1.toString(), list2.toString() );
Tools.ensureEquals( list1.hashCode(), list2.hashCode() );
if( list1.isEmpty() )
return;
Tools.ensure( list1.get(0).equals( list2.getFirst() ) );
Tools.ensure( list1.get(list1.size()-1).equals( list2.getLast() ) );
Double existRandomElement = list2.getRandom();
Tools.ensure( list1.contains( existRandomElement ) );
Tools.ensure( list2.contains( existRandomElement ) );
Tools.ensure( list1.indexOf( existRandomElement ) == list2.indexOf( existRandomElement ) );
Tools.ensure( list1.indexOf( existRandomElement ) == list2.indexOf( existRandomElement ) );
int from = (int) (Math.random() * list1.size());
int to = (int) (Math.random() * (list1.size()+1));
if( from > to ) {
int t = from;
from = to;
to = t;
Tools.ensureEquals( list1.subList( from, to ), list2.subList( from, to ) );
// test those methods that change the list
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
int i = (int) (Math.random() * list1.size());
double d = Math.random();
list1.set( i, d );
list2.set( i, d );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
int i = (int) (Math.random() * list1.size());
Tools.ensure( list1.get( i ).equals( list2.get( i ) ) );
new Runnable() { public void run() {
double d = Math.random();
list1.add( 0, d );
list2.addFirst( d );
new Runnable() { public void run() {
double d = Math.random();
list1.add( d );
list2.addLast( d );
new Runnable() { public void run() {
double d = Math.random();
list1.add( d );
list2.addLast( d );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
Tools.ensure( list1.remove( 0 ).equals( list2.removeFirst() ) );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
Tools.ensure( list1.remove( list1.size() - 1 ).equals( list2.removeLast() ) );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
int i = 0;
for( Iterator<Double> iter=list1.iterator(); iter.hasNext(); i++ ) {
iter.next();
if( i % 3 == 0 )
iter.remove();
list2.removeAll( new ListCondition<Double>() { public boolean isConditionSatisfied(List2 list, int index, Double element) {
return index % 3 == 0;
new Runnable() { public void run() {
double d = Math.random();
list1.add( d );
list2.add( d );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
Tools.ensure( list1.remove(0).equals( list2.remove() ) );
new Runnable() { public void run() {
if( list1.isEmpty() )
return;
int r = (int) (Math.random() * list1.size());
Double element = list1.get( r );
int index = list1.lastIndexOf( element );
for( int i=list1.size()-1; i>=index; i-- )
list1.remove( i );
list2.removeRest( element );
new Runnable() { public void run() {
list2.removeRest( Math.random() - 2 );
new Runnable() { public void run() {
list1.clear();
list2.clear();
new Runnable() { public void run() {
Collections.sort( list1 );
list2.sort();
new Runnable() { public void run() {
Collections.sort( list1 );
Collections.reverse( list1 );
list2.sortDesc();
new Runnable() { public void run() {
Comparator<Double> comparator = new Comparator<Double>() { public int compare(Double o1, Double o2) {
return o1.toString().substring(2).compareTo( o2.toString().substring(2) );
Collections.sort( list1, comparator );
list2.sort( comparator );
new Runnable() { public void run() {
Comparator<Double> comparator = new Comparator<Double>() { public int compare(Double o1, Double o2) {
return o1.toString().substring(2).compareTo( o2.toString().substring(2) );
Collections.sort( list1, comparator );
Collections.reverse( list1 );
list2.sortDesc( comparator );
new Runnable() { public void run() {
Double notExistElement = -2.0;
list2.removeAllEquals( notExistElement );
Tools.ensureEquals( list1, list2 );
list2.removeAllBetween( 0.5, 0.6 );
for( Iterator<Double> iter=list1.iterator(); iter.hasNext(); ) {
double d = iter.next();
if( d >= 0.5 && d < 0.6 )
iter.remove();
Tools.ensureEquals( list1, list2 );
System.out.print( "test List2 " );
for( int i=0; i < maxTestCount; i++ ) {
tasks[ (int) (Math.random() * tasks.length) ].run();
Tools.ensureEquals( list1, list2 );
if( i % (maxTestCount/10) == 0 )
System.out.print( "." );
System.out.println( " ok" );
// source code : ListCondition
public interface ListCondition<T> {
boolean isConditionSatisfied( List2 list, int index, T element );Hi,
I have the following statement:
private List list = new ArrayList();
why not use private ArrayList list = new
ArrayList()?
I know ArrayList implements List, so list has a wide
scope, right? What's the benefit?
Thanks,
JieBy using the interface you are not tied to a specific implementation.
Later, you may determine that using a LinkedList is more efficient to your specific code and then all you need to do is change the statement to:
private List list = new LinkedList();As long as you are not casting the list reference to ArrayList (or something along those lines) you would not need to change anything else. -
When can we expect a patch for Object Array List Data Provider?
Hey JSC Team!
When can we expect maybe, just maybe a minor patch for the Object Array List Data Provider loading class problem? Next Month? This Year? Next Year? Near Future? Long in the future? Sometime in the 22nd century?I think one of the problem is
when u declare the ObjectListDataProvider in ur backing bean
it doesnt appear in the design time straight away
u have to clean build close and re open the project
which is quite time consuming. -
Which is lightweight array list or string tokenizer
which is lightweight array list or string tokenizer:
I am reading a flat file and doing some text parsing to find some records which matched my search criteria.
The flat file will have 5K records at the average and each records is in each line. (\n) is the delimiter to the string tokenizer.
My Doubt is:
Will it be good to manipulate all the records to the array list and then manipulating and achieve my task or
Will it be good if i do a just string tokenizer and achieve my task with out an arraylist.
Note: There is no unique fields in the records so no way to use hashmap/table.DrClap wrote:
Faster? Actually the stated requirements were "lightweight" and "good". It guess I assumed what they usually mean to me.
However answering this a different way.
lightweight - your computer won't be heavier no matter which way you choose.
good - it will have no barring on your concious or your place in the after life.
good(2) - Write it the simplest way you think you can and worry about performance later if its a problem. -
Using an array list as a hash map value
Hi,
I have an object which has a "properties" field, which contains certain data for that object.
Most of the time the key/values are both Strings, but in at least one instance, the key is a string, the value needs to be an array list.
The Map is declared as HashMap<String, Object>
when I populate the map, and then attempt to retrieve its value, it seems to work correctly.
But when I try to retrieve the arrayList from another object, using its getter, it doesn't work,
IOW, if I have code like this:
// object created from outside the class where the map is populated
ExampleObject eo = new exampleObject();
eo.getProperties.get("string value that is a key for the map. ");
// if I try to determine the class the value is,
System.out.println("class: " + eo.getProperties,get("string value that is a key for the map. ").getClass());
// the code above indicates the object is a string. I googled and found a suggestion on this forum, that instead of making the map value an arrayList, I should create an object that contains an array list as a field, and then use that new object as the map value. I tried that and had the same problem.
any idea what I'm doing wrong? Hope that's clear...
thanks!!
bp
Edited by: badperson on Aug 13, 2008 9:38 AMthrew this together and it worked fine, so something else is screwed up in my code.
import java.util.*;
public class MapTester {
private HashMap<String, Object> testMap;
private ArrayList testList;
public ArrayList<String> createList(String listName){
System.out.println("creating list");
testList = new ArrayList<String>();
testList.add(listName + " line one");
testList.add(listName + " line two");
testList.add(listName + " line three");
return testList;
public HashMap<String, Object> createMap(String key, Object value){
System.out.println("populating map");
testMap = new HashMap<String, Object>();
testMap.put(key, value);
return testMap;
public static void main(String[] args){
MapTester mapTester = new MapTester();
mapTester.createList("List 1");
mapTester.createMap("listKey", mapTester.getTestList());
System.out.println("retrieving arrayList");
System.out.println("map value is type: " + mapTester.getTestMap().get("listKey").getClass());
public ArrayList getTestList() {
return testList;
public HashMap<String, Object> getTestMap() {
return testMap;
}thanks for the replies
bp -
Using a MergeSort with an Array List
Hi. I'm working on a program that does a MergeSort using an array list. The user is asked to enter 2 arrays of increasing numbers, and my program will create a 3rd array that merges the 2 original ones.
I think I've almost got it down, but I seem to be running into an OutOfBounds error, and I'm not sure why. I've tried changing the initial values of some of my variables to no avail.
I'm kinda new to Java so be gentle.
import java.util.ArrayList;
import cs1.Keyboard;
import java.util.*;
public class MergeSort3
public static void main (String[] args)
ArrayList<Integer> ary1 = new ArrayList<Integer>();
ArrayList<Integer> ary2 = new ArrayList<Integer>();
ArrayList<Integer> ary3 = new ArrayList<Integer>();
int input=0, count=0, ary1count=0, ary2count=0, temp=0;
boolean ok=true;
while(ok)
System.out.println("Enter integers in Array1 from smallest to largest. (-1 to stop): ");
input = Keyboard.readInt();
if(input==-1)
ok=false;
else
ary1.add(input);
ok=true;
while(ok)
System.out.println("Enter integers in Array2 from smallest to largest. (-1 to stop): ");
input = Keyboard.readInt();
if(input==-1)
ok=false;
else
ary2.add(input);
System.out.println("Size of array 1: " + ary1.size());
System.out.println("Size of array 2: " + ary2.size());
int ary3size=ary1.size()+ary2.size();
System.out.println(ary3size);
while(count<ary3size)
if(ary1.get(ary1count)<=ary2.get(ary2count) && ary1count<ary1.size() && ary2count<ary2.size())
ary3.add(ary1.get(ary1count));
ary1count++;
count++;
System.out.println(ary3);
else
temp=ary2.get(ary2count);
ary3.add(temp);
ary2count++;
temp=0;
count++;
while(ary1count>=ary1.size() && ary2count<ary2.size())
ary3.add(ary2.get(ary2count));
ary2count++;
System.out.println(ary3);
}We can't run the program since you're using a non-standard class, csi.Keyboard.
Reduce the problem to a program that only uses standard Java classes, post the new program, AND identify the line that's throwing the error (not just the line number!) and post the exact error message. -
hello,
i have written an array list. The intended purpose is to randomly select 6 out of 8 JTextAreas and set their background to blue. here is the code.
public void RandOcean_actionPerformed(ActionEvent e) {
//This sets the size of the map grid.
final int NUM_ROWS = 10;
final int NUM_COLS = 10;
for (int row = 0; row < NUM_ROWS ; row++ ) {
for (int col = 0 ; col < NUM_COLS ; col++ ) {
//This references the "tiles" to the map grid.
JTextArea[][] grid = new JTextArea[NUM_ROWS][NUM_COLS];
grid[8][2] = t83;
grid[8][3] = t84;
grid[8][4] = t85;
grid[8][5] = t86;
grid[8][6] = t87;
grid[8][7] = t88;
grid[8][8] = t89;}}
//This defines ArrayList
int MAX_SQUARES = 6;
ArrayList squares = new ArrayList();
for ( int i = 0 ; i < MAX_SQUARES ; i++ ){
squares.add(t83);
squares.add(t84);
squares.add(t85);
squares.add(t85);
squares.add(t86);
squares.add(t87);
squares.add(t88);
squares.add(t89);}
//This turns Random reference from arraylist blue and deletes
Random gen = new Random();
while (squares.size() >0) {
int RandomIndex = gen.nextInt(squares.size());
JTextArea current = (JTextArea)squares.get (RandomIndex);
current.setBackground(Color.blue);
squares.remove (RandomIndex);
}The code produces no errors, but instead of randomly coloring 6 out of the 8, it colors all 8. wher have i gone wrong?
thankyou,
morris.King Rene has pointed out your problem, but I am still curious.
Why are you recreating the grid array every time through this nested loop construct?
for (int row = 0; row < NUM_ROWS ; row++ ) {
for (int col = 0 ; col < NUM_COLS ; col++ ) {
// Question:
// Why are you creating this JTextArea array every time through the loop?
//This references the "tiles" to the map grid.
JTextArea[][] grid = new JTextArea[NUM_ROWS][NUM_COLS];RD-R
� {� -
Is possible to pass array/list as parameter in TopLink StoredProcedureCall?
Hi, We need to pass an array/List/Vector of values (each value is a 10 character string) into TopLink's StoredProcedureCall. The maximum number of elements on the list is 3,000 (3,000 * 10 = 30,000 characters).
This exposed two questions:
1. Is it possible to pass a Vector as a parameter in TopLink's StoredProcedureCall, such as
StoredProcedureCall call = new StoredProcedureCall();
call.setProcedureName("STORED_PROCEDURE_NAME");
call.addNamedArgument("PERSON_CODE");
Vector strVect = new Vector(3000);
strVect.add(“ab-gthhjko”);
strVect.add(“cd-gthhjko”);
strVect.add(“ef-gthhjko”);
Vector parameters = new Vector();
parameters.addElement(strVect);
session.executeQuery(query,parameters);
2. If the answer on previous question is yes:
- How this parameter has to be defined in Oracle’s Stored Procedure?
- What is the maximum number of elements/bytes that can be passed into the vector?
The best way that we have found so far was to use single string as a parameter. The individual values would be delimited by comma, such as "ab-gthhjko,cd-gthhjko,ef-gthhjko..."
However, in this case concern is the size that can be 3,000 * 11 = 33, 000 characters. The maximum size of VARCHAR2 is 4000, so we would need to break calls in chunks (max 9 chunks).
Is there any other/more optimal way to do this?
Thanks for your help!
ZoranHello,
No, you cannot currently pass a vector of objects as a parameter to a stored procedure. JDBC will not take a vector as an argument unless you want it to serialize it (ie a blob) .
The Oracle database though does have support for struct types and varray types. So you could define a stored procedure to take a VARRAY of strings/varchar, and use that stored procedure through TopLink. For instance:
StoredProcedureCall call = new StoredProcedureCall();
call.setProcedureName("STORED_PROCEDURE_NAME");
call.addNamedArgument("PERSON_CODE");
oracle.sql.ArrayDescriptor descriptor = new oracle.sql.ArrayDescriptor("ARRAYTYPE_NAME", dbconnection);
oracle.sql.ARRAY dbarray = new oracle.sql.ARRAY(descriptor, dbconnection, dataArray);
Vector parameters = new Vector();
parameters.addElement(dbarray);
session.executeQuery(query,parameters);This will work for any values as long as you are not going to pass in null as a value as the driver can determine the type from the object.
dataArray is an Object array consisting of your String objects.
For output or inoutput parameters you need to set the type and typename as well:
sqlcall.addUnamedInOutputArgument("PERSON_CODE", "PERSON_CODE", Types.ARRAY, "ARRAYTYPE_NAME"); which will take a VARRAY and return a VARRAY type object.
The next major release of TopLink will support taking in a vector of strings and performing the conversion to a VARRAY for you, as well as returning a vector instead of a VARRAY for out arguments.
Check out thread
Using VARRAYs as parameters to a Stored Procedure
showing an example on how to get the conection to create the varray, as well as
http://www.oracle.com/technology/sample_code/tech/java/codesnippet/jdbc/varray/index.html on using Varrays in Oracle, though I'm sure the database docs might have more information.
Best Regards,
Chris -
I would like to create a playlist of some of my voicememos to hear on my iphone5. I have no problem creating the list and can listen on playlist on computer but not when i sync to my phone. How can I listen to voicememos in a playlist on my iPhone?
Hi czigrand,
Thanks for visiting Apple Support Communities.
Currently, you can gift dollar amounts or individual items (EG. songs) on the iTunes Store. See this article for more information:
In the iTunes Store, you can gift a dollar amount or specific music, movies, TV shows, or apps from your iPhone, iPod touch, iPad, Mac, or PC. Follow these steps to send a gift from the iTunes Store.
iTunes: Sending iTunes Gifts
http://support.apple.com/kb/HT2736
Best Regards,
Jeremy
Maybe you are looking for
-
Folks lets suppose that i have developed an application in Java now i want to integrate it in JFX.. is it possible? Can we use Java API's like util, mail API, and other API's while developing rich applications
-
Converting RGB to CMYK - Huge color shift. Any tips on getting some decent color back?
I just downloaded a St. Patricks day background from iStockPhoto. Nice vibrant green. We all know when converting to CMYK from RGB, there is a color shift but this is pretty dang dramatic. Any basic tips on getting some of that vibrant color back aft
-
WD My Cloud Mirror 8TB compatibility
Hi Can anyone tell me if this storage is compatible with AWS from AMAZON?These are the requirements: http://aws.amazon.com/importexport/details/Or is it any WD system compatible? They tell that it's not supported and I want to know why, thing that th
-
Quick Selection Tool Doesn't Use Shift in the Expected Manner
Generally speaking, if you click somewhere with a tool that you stroke on an image, then hold the Shift key down and click somewhere else, the tool will be stroked in a straight line from the prior point to the current point. This is very handy unde
-
IOS 4 question related to iWeb
There's no iOS forum, so I thought I would post this here. Using iWeb '09 I have created a mobile webpage. On that page is a simple link to a business on Google Maps. With the previous version of the iPhone OS (i.e., prior to iOS 4), pressing on this