Problem with Queue

Scenario is SAP ->XI -> Target system. Here Im using BPM to collect Idocs.
But when I trigger IDoc frm WE19,the message coming to XI and getting inside the queue always.
When I clicked on the blocked message its giving err saying that "Password logon no longer possible - too many failed"
What may be the prob here?
Please help here.
Thanks,
Regards,
Naresh

Hi,
This error "Password logon no longer possible - too many failed" can be handled by the security team who would recreate a new password for the user and distribute it to the other systems.
Thanks
Krithika

Similar Messages

Problem with queue timing out?

Hi all,
I am using a queue to send a cluster between parallel while loops (producer-consumer); however sometimes, but not on all occasions, the enqueue in the producer seems to "freeze" or maybe timesout for no reason (no timeout value is wired to the enqueue or any other element related to that queue process; so I assume it never timesout)...
I have checked this and there is data in the cluster that is being enqueued, but the dequeue in the consumer loop is empty... This does not happen on every execution, just occassionally... If I stop and save the vi, it works fine again but the next occurence of this problem.... If I wire 0ms to the enqueue timeout it also works properly again...
Any suggestions?
Thanks,
Jack

Hi Yamaeda,
Thanks for the input... Please see code attached (a number of subvis are a missing, but these only help with reading the data file and doing basic analysis on the data after the dequeue).... In a nutshell, there are 3 parallel while loops; Loop 1: User Interface; Loop2 : Read, Convert, Plot; and Loop 3: Analyse and Write to File.
The enqueue with the problem is in loop 2 (inside the "Plot" state, then inside the "False" case)... The loop is a rough state machine.
There are no timeouts on the enqueue in loop 2 or corresponding dequeue in loop 3.... The dequeue does not timeout based on a constant "false" from an indicator when the problem occurs.
When the dequeue does not work, memory usuage keep increasing until a "Memory Full Error" and the vi aborts.... This does not happen when it runs properly.
The data being queued can be quite large (upto 1M rows x 7 columns of data and does occur quickly (basically, data in the top graph is min-max decimated based on graph pixel width as I read on the NI white paper for displatying large data sets; the data between the start and stop cursors is then sent as a subarray to the enqueue for a fully display on the bottom graph for closer analysis)... Perhaps the queue is filling? I did not know this was possible (I am using a100ms wait for loop timing).
Any suggestions greatly appreciated.
Thanks,
Jack
Attachments:
Neuro Analysis 2.vi ‏461 KB

Problem with Queue Implementation

Hi there !
I can't solve the implementation of an exercize about Queue.My teacher wrote down just the interface Queue and the first part of the class ArrayQueue implementation.They are the following :
public interface Queue<E>
   public int size();
   public boolean isEmpty();
   public E front() throws EmptyQueueException;
   public void enqueue (E element);
   public E dequeue() throws EmptyQueueException;
public class ArrayQueue<E> implements Queue<E>
   public ArrayQueue(int cap)
      capacity = cap;
      Q = (E[]) new Object[capacity];
   public ArrayQueue()
      this(CAPACITY);
}So the teacher asked to complete the code. I have tried and retried so many times for 3 days.I know it's so easy and I understood how it should work but when I try to write down the code I can't get the final solutions but only mistakes.
During my attempts my better code was this :
package queue;
public class ArrayQueue<E> implements Queue<E>
     @SuppressWarnings("unchecked")
     public ArrayQueue(int cap)
        capacity = cap;
        Q = (E[]) new Object[capacity];
     public ArrayQueue()
        this(CAPACITY);
     public String toString()
        int count = 0;
        for(E element : Q)
             return count +")"+(String)element;
        count++;
        return null;
     public void enqueue(E element)
          try
               if(element == null)
                    throw new IllegalArgumentException();
               if (size() == capacity)
                 throw new FullQueueException();
               if(Q[rear] == null)
                  Q[rear] = element;
                  rear++;
          catch (FullQueueException e)
               System.out.println("The Queue is Full !");
     public E dequeue() throws EmptyQueueException
          try
             E temp;
             if (isEmpty())
                  Q = (E[]) new Object[capacity];
                  front = 0;
                  rear = 0;
                 throw new EmptyQueueException();
            temp = Q[front];
             Q[front] = null;
             front++;
             return temp;
          catch(EmptyQueueException e)
               System.out.println("The Queue is Empty !");
          return null;
     public E front() throws EmptyQueueException
          try
             if(Q[front] == null)
                       front++;
             if (isEmpty())
                 throw new EmptyQueueException();
             return Q[front];
          catch(EmptyQueueException e)
               System.out.println("The Queue is Full !");
          return null;
     public int size()
          return (front + rear);
     public boolean isEmpty()
        return (front == rear);
    public Object[] getQueue()
        return Q;
     protected int capacity;
     public static final int CAPACITY = 1000;
     protected E Q[];
     protected int front = 0;
     protected int rear = 0;
}But the problems are that I can add the element through the method enqueue() and delete it through dequeue() then,but after deleting it the array size is the same and when I print the array elements I see some null,so if I add a new element I get the message of the class FullQueueException because of the size which it's the same.
Moreover if I delete all the elements and then I print the value returned by the method front() I get the NullPointerExceptionError because the returned value is null,but I think it should print it ! But he doesn't!
How should I fix these problems ?
I also wondered during all my attempts how to repeat this procedure after the array size limit is reached.What I really mean is if I delete the element Q[0] and the index front = 1 and rear = n - 1 for example,how can I add with the method enqueue() a new element in Q[0] again ?
Can you help me courteously ?
I hope my explanation was clear because of my English !
Thanks in Advance !

Thanks for all your suggestions men ^^ !
I changed some things in the code :
package queue;
public class ArrayQueue<E> implements Queue<E>
     @SuppressWarnings("unchecked")
     public ArrayQueue(int cap)
        capacity = cap;
        Q = (E[]) new Object[capacity];
     public ArrayQueue()
        this(CAPACITY);
     public String toString()
          String s = "[";
          int count = 0;
          for (int i = front; i < rear; i++) {
               count++;
               s += Q.toString() + (i < rear - 1 ? "," : "");
          s += "] (" + count + " elements)";
          return s;
     public void enqueue(E element)
          try
               if (size() == capacity - 1)
          throw new FullQueueException();
               Q[rear] = element;
               rear = (rear + 1) % capacity;
          catch (FullQueueException e)
               System.out.println("The Queue is Full !");
     public E dequeue() throws EmptyQueueException
          try
          E temp;
          if(isEmpty())
          throw new EmptyQueueException();
     temp = Q[front];
          Q[front] = null;
          front = (front + 1) % capacity;
          return temp;
          catch(EmptyQueueException e)
               System.out.println("The Queue is Empty !");
          return null;
     public E front() throws EmptyQueueException
          try
          if (isEmpty())
          throw new EmptyQueueException();
          return Q[front];
          catch(EmptyQueueException e)
               System.out.println("The Queue is Empty !");
          return null;
     public int size()
          return (capacity - front + rear) % capacity;
     public boolean isEmpty()
return (front == rear);
     protected int capacity;
     public static final int CAPACITY = 1000;
     protected E Q[];
     protected int front;
     protected int rear;
}Now after I delete an element and I use the method enqueue() to add a new one the algorithm does,but
after I delete all the elements I get an element null when I add the element in the array position n - 1.
I have fixed the method toString() as pgt told me to do and it's really great,but dunno why sometimes when I delete an element it says the array has 0 elements also if the array is almost full !
About my code changements,according to my university friend I should reduce front and rear mod the capacity and that's what marlin314 suggested me to do too and I had to change the expression if(size() == capacity) to if(size() == capacity - 1).But the algorithm doesn't work as it should do !

Problem with queues / stacks for a project

I have to code a calculator that turns an infix expression, where the operator is in the middle, to a postfix expression, where the operators are at the end;
so, for instance, 5 + 5 would really be 5 5 +, and 5 + 5 * 5 / 5 would be 5 5 5 5 + * /.
I've gotten the addition and subtraction working fine, the only problem comes when I have to take into account order of operations (so far).
So, that being said, here is the code:
import java.util.*;
public class iCalc {
      * @param args
     public static void main(String[] args) {
     //     Scanner scan = new Scanner(System.in);
     //     System.out.println("Equation:");
     //     String input = "55+5-10%16."; //might have to store each element in a linked list later
     //     evalExp(input);     //calls evalExp with the input
          String input2 = "55 + 5 * 10 + 16";//declare some dummy input
          //121
          String [] items = input2.split(" ");//split the string's elements into an array
          Queue<String> queue = new LinkedList<String>();//the queue
          Stack<String> stack = new Stack<String>();//make a new stack to store operators
          Stack<String> stackOutput = new Stack<String>();//output stack
          for (String s : items) {//scan the array
              System.out.println("item : " + s);//print out what's being scanned
              if(isNumber(s)) queue.add(s);//add it onto the queue
              if(isOperator(s)) stack.push(s);//add it onto the stack
          //converts to postfix here
         while(!stack.isEmpty()) queue.add(stack.pop());
         evalExp(queue, stackOutput);
     public static void evalExp(Queue<String> exp, Stack<String> outputStack)
          System.out.println("Evaluating the expression...");
          int length = exp.size();
          int temp;
     while(length > 0)
          // 55 5 10 16 + * +
          // 55
          try{
               length--;
               System.out.println("Trying to see if the element is a number...");
               if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                    int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                    temp = 0;
                    for(String s : exp)
                    {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                         temp++;//keeps track of how far you are into the queue
                         outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                         if(temp == spot+1)
                              break;     //(if there were enough elements in the queue popped, end this loop
                    outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
               Double MyNum = Double.parseDouble(exp.remove());
               String MyStackNum = "" + MyNum;
               outputStack.push(MyStackNum);
                    if(outputStack.size() == 2)
                         length--;
                         String operator = popTheOperator(exp);
                         System.out.println("Two numbers have been popped, time to find the operator...");
                         outputStack.push(performMath(outputStack.pop(), outputStack.pop(), operator));
                         for(String s : exp)
                              if(s.equals(operator))
                                   exp.remove(s);
                                   break;
          }     catch(Exception ParseException){
               outputStack.push(performMath(outputStack.pop(), outputStack.pop(), exp.remove()));
          while(!outputStack.isEmpty()) System.out.println("The output stack is:" + outputStack.pop());
     public static boolean isNumber(String s1)
          char[]arr2 = s1.toCharArray();
          for(int i = 0;i<s1.length();i++)
               System.out.println("checking...." + s1);
               if((!Character.isDigit(arr2))) return false;
          return true;
     public static boolean isOperator(String s2)
          char[]arr3 = s2.toCharArray();
          for(int i = 0;i<arr3.length;i++)
               System.out.println("checking...." + arr3[i]);
               if(findOperator(arr3[i])) return true;
          return false;
     public static boolean findOperator(char op)
                    if(op == '+' ||
                         op == '-' ||
                         op == '/' ||
                         op == '*' ||
                         op == '%' ||
                         op == '^' ||
                         op == '&' ||
                         op == '(' ||
                         op == ')' ||
                         op == '|' ||
                         op == '>' ||
                         op == '<' ||
                         op == '=' ||
                         op == '!' ) return true;
          return false;
     // 10 16 + + +
     public static String popTheOperator(Queue<String> myQueue)
          String current = "";
          for(String s: myQueue)
               if(s.equals("*") || s.equals("/"))
                    current = s;
               break;
          if(current == "")
               for(String s: myQueue)
                    if(s.equals("+") || s.equals("-"))
                         current = s;
                         break;
     return current;
     public static String performMath(String operand1, String operand2, String operator)
          String myString = "";
          double result = 0;
          double temp1 = Double.parseDouble(operand1);
          double temp2 = Double.parseDouble(operand2);
          if(operator.equals("+"))
               result = temp1 + temp2;
          else if(operator.equals("-"))
               result = temp2 - temp1;
          else if(operator.equals("/"))
               result = temp1 / temp2;
          else if(operator.equals("*"))
               result = temp1 * temp2;
          else if(operator.equals("%"))
               result = temp1 % temp2;
          else if(operator.equals("^"))
               result = Math.pow(temp1, temp2);
          else if(operator.equals("&"))
          else if(operator.equals("|"))
               result = temp1 - temp2;
          else if(operator.equals(">"))
               if(temp1 > temp2)
                    result = 1;
               else result = 0;
          else if(operator.equals("<"))
               if(temp1 < temp2)
                    result = 1;
               else result = 0;
          else if(operator.equals("="))
               if(temp1 == temp2)
                    result = 1;
               else result = 0;
          else if(operator.equals("!"))
               if(temp1 != temp2) result = 1;
               else result = 0;
          myString = "" + result;
          return myString;
     public static boolean isMultiplyOrDivide(Queue<String> myQueue)
          for(String s : myQueue)//scan the queue
               if(s.equals("*") || s.equals("/"))
                    return true;//it has found a multiply/divide operator!
          return false;
     public static int findMultiplyOrDividePosition(Queue<String> myQueue)
          int position = 0;
          for(String s: myQueue)
               if(s.equals("+") ||
                              s.equals("-") ||
                              s.equals("%") ||
                              s.equals("^") ||
                              s.equals("&") ||
                              s.equals("|") ||
                              s.equals(">") ||
                              s.equals("<") ||
                              s.equals("=") ||
                              s.equals("!")) position ++;
          return position;
}I think that its trying to remove the head, but because the head was already removed, somehow its not letting it remove it; as if by removing the head, there is no new updated head.

               if(isMultiplyOrDivide(exp))//is there a multiply or divide operator
                    int spot = findMultiplyOrDividePosition(exp);//if yes, finds its position in the operators and stores it as an int
                    temp = 0;
                    for(String s : exp)
                    {//PROBLEM: After the first iteration, it suddenly has an empty stack exception
                         temp++;//keeps track of how far you are into the queue
                         outputStack.push(exp.remove());//take the head of the queue, and push it onto the stack
                         if(temp == spot+1)
                              break;     //(if there were enough elements in the queue popped, end this loop
                    outputStack.push(performMath(outputStack.pop(), outputStack.pop(), popTheOperator(exp)));
               }the problem is somewhere in here.

Problems with "queue" to Media Encoder

I just downloaded the latest CC updates yesterday which was for AME and PPCC ...
After the update when i go to >EXPORT> MEDIA > then press queue it locks up/stalls. Nothing goes to AME. I have to keep turning off the process.
I tried a 3 minute clip and it worked but anything above 20 mins it stalls...
Rather than "queue" i have to use "export" which means i cannot use premiere pro while it exports my project. I usually have to export 4-5 things from one project so its very time consuming and its waisting alot of my time.
I tried opening up AME seperately then either drag and drop or go to >add files and adding the sequences from the project, but when i do this i get a message that say "READING XMP' and it just stays like that for ever unless i kill it through task manager...
I run a production company so these kind of issues are super frustrating and costing me money.
Im guessing its has someonthing to do with the new updates as this wasnt occuring before the updates... has anyone had same issues ?
Shouldnt be having these basic problems.... Pls fix or help asap ADOBE !!!
windows 7
adobecc
i7-2600K 3.40Ghz
16GB ram
just realised some other wierd things since the update..... is there anyway of taking off the latest updates and rolling back to the previous version ?

Just a comment:
I'd say you found a workaround...not a solution, though it's helpful to know there IS a way around the problem.
I'm having a similar problem, and am still searching for an answer. (Unfortunately, my project is due tonight, and I'll suffer the lengthy software-only encoding, spending time in this forum rather than gamble/waste time experimenting/uninstalling/re-installing). This is ruining my Easter weekend.
This is my 2nd round of problems using CC (a few months back I uploaded a file which went missing for a few days while Adobe scrambled to fix what was apparentyl a widespread problem, while I had to re-build a project from a prior version. That took me days, though I did it before the file I uploaded was "found". And, of course, I encountered the problem following the latest update at the time...just like today's problem).
I get the sense they're pushing things out, i.e. new "versions"/"updates", before adequate testing is done. I worked in QA for many years in the corp hq of a Fortune 500, and was afraid CC would suffer the "rush" to distribute without proper testing. I feel as if end-users are testing new updates, which makes me question the reliability of new releases. Unfortunately, this raises questions about CC being "professional-level software". If it's not thoroughly tested, how can professionals rely on it?
End of rant...Thanks.

Problem with queue and context change JAVA udf

Hi all,
MY scenorio is from source i get multiple instances and each instance i need to pass to different fields od target
in one source instance i may get multiple values which i have to create multple nodes under one target instance.
my source xml looka like below:
- <CustomFieldsSegment>
- <CustomFields Name="ForeignLanguageonPackaging">
<Value Qualifier="en">English</Value>
<Value Qualifier="fr">French</Value>
</CustomFields>
- <CustomFields Name="LayerHeight">
<Value>5.0</Value>
</CustomFields>
- <CustomFields Name="LayerHeightUOM">
<Value Qualifier="IN">Inches</Value>
</CustomFields>
</CustomFieldsSegment>
</TargetMarketData>
</ItemRegistration>
</Payload>
</ns:MT_TradeItemsExport>
in the above xml the first custom field has qualifier "en' and "fr"
i need to create 2 nodes under one target field.
example:
<AttrMany Name="ForeignLanguageonPackaging">
<Value ="en">en</Value>
<Value ="fr">fr</Value>
</AttrMany>
int eh source node <CustomFields Name="ForeignLanguageonPackaging"> may come in any matter .doesnt come always first
and i wrote udf like below:
public void queue(String[] a,String[] b,String[] c,ResultList result,Container container){
    // write your code here
AbstractTrace traceObj = container.getTrace();
    int baseArrayIndex = 99;
    int ccCount = 0;
    boolean isfound = false;
    for (int i = 0; i < a.length; i++) {
           isfound = false;
        if (a<i>.equals(c[0])) {
        baseArrayIndex = i;
traceObj.addInfo("initial "+ i);
        for (int j = 0; j < b.length; j++) {
            if (b[j].equals(ResultList.CC)) {
            ccCount++;
            } else {
            if ( baseArrayIndex == ccCount ) {
               result.addValue(b[j]);
traceObj.addInfo("result "+ b[j]);
                isfound = true;
        break;
if (!isfound)
result.addSuppress();
traceObj.addInfo("final result "+ result);
Please can anyone help me.
Regards,
jyothi

Hi all,
MY scenorio is from source i get multiple instances and each instance i need to pass to different fields od target
in one source instance i may get multiple values which i have to create multple nodes under one target instance.
my source xml looks like below:each ItemRegistration is one item at target
-<ItemRegistration>
- <CustomFieldsSegment>
- <CustomFields Name="ForeignLanguageonPackaging">
<Value Qualifier="en">English</Value>
<Value Qualifier="fr">French</Value>
</CustomFields>
- <CustomFields Name="LayerHeight">
<Value>5.0</Value>
</CustomFields>
- <CustomFields Name="LayerHeightUOM">
<Value Qualifier="IN">Inches</Value>
</CustomFields>
</CustomFieldsSegment>
</TargetMarketData>
</ItemRegistration>
-<ItemRegistration>
- <CustomFieldsSegment>
- <CustomFields Name="ForeignLanguageonPackaging">
<Value Qualifier="en">English</Value>
<Value Qualifier="fr">French</Value>
</CustomFields>
- <CustomFields Name="LayerHeight">
<Value>5.0</Value>
</CustomFields>
- <CustomFields Name="LayerHeightUOM">
<Value Qualifier="IN">Inches</Value>
</CustomFields>
</CustomFieldsSegment>
</TargetMarketData>
</ItemRegistration>
</Payload>
</ns:MT_TradeItemsExport>
in the above xml the first custom field has qualifier "en' and "fr"
i need to create 2 nodes under one target field.
example:
<AttrMany Name="ForeignLanguageonPackaging">
<Value ="en">en</Value>
<Value ="fr">fr</Value>
</AttrMany>
int eh source node <CustomFields Name="ForeignLanguageonPackaging"> may come in any matter .doesnt come always first
and i wrote udf like below:
public void queue(String] a,String[ b,String[] c,ResultList result,Container container){
// write your code here
AbstractTrace traceObj = container.getTrace();
int baseArrayIndex = 99;
int ccCount = 0;
boolean isfound = false;
for (int i = 0; i < a.length; i++) {
isfound = false;
if (a.equals(c[0])) {
baseArrayIndex = i;
traceObj.addInfo("initial "+ i);
for (int j = 0; j < b.length; j++) {
if (b[j].equals(ResultList.CC)) {
ccCount++;
} else {
if ( baseArrayIndex == ccCount ) {
result.addValue(b[j]);
traceObj.addInfo("result "+ b[j]);
isfound = true;
if (!isfound)
result.addSuppress();
traceObj.addInfo("final result "+ result);
if i have only one item at the source it is working but when 2items are comming from the source my udf is not working.
can anyone help me if you have faced the similar problem or who is fimilar like this kind.
Regards,
jyothi
Edited by: jyothi vonteddu on Oct 21, 2009 9:14 PM
Edited by: jyothi vonteddu on Oct 21, 2009 9:22 PM

Problem with Queues

I have two sensors on a conveyor system that will determine if an object needs to be rejected or not. Another sensor is located 80 cm away where the object will be kicked off the conveyor belt. I was told to use queues but haven't had any luck so far. Could someone explain how they work, and if possible, post a sample code roughly relating to my conveyor system? Thank you!
Solved!
Go to Solution.

Think of a queue as a line at the movie theater. As people come up they get in line. When the person selling tickets is ready they will get the first person in line and sell them a ticket. As more people arive they will get in the end of the line. This process will continue until there is no one left in line. The ticket seller will always take the person at the front of the line and new people will be placed at the end of the line.
There are examples that ship with LabVIEW illustrating how to use queues. Use the example finder and search for queues.
As for your particular situation more detail would be needed in order to give better advice.
Mark Yedinak
"Does anyone know where the love of God goes when the waves turn the minutes to hours?"
Wreck of the Edmund Fitzgerald - Gordon Lightfoot

Problem with Queue and threads

Hello,
the following is the code :
public class Tester extends Thread
private String fname;
public String getFname()
   return fname;
public void setFname(String fname)
   this.fname = fname;
public Tester(String fname){
   super();
this.fname = fname;
}Heres another class
class N {
    Thread r = null;
    public void checkQ()
      Queue q = new ConcurrentLinkedQueue<N>();
      for(int i = 0; i < 13; i++)
         System.out.println("FOR I is "+i);
         r = new Tester("Name" + i);
         q.offer(r);
         processq(q);
    public void processq(Queue queueOfM)
       if(queueOfM.size() > 10)
          System.out.println("size of queueofM is "+queueOfM.size());
        for(int j=0; j < queueOfM.size();j++)
             System.out.println("J is "+j);
             this.r = (Thread)queueOfM.poll();
             this.r.start();
   }When run, the code prints :
FOR I is 0
FOR I is 1
FOR I is 2
FOR I is 3
FOR I is 4
FOR I is 5
FOR I is 6
FOR I is 7
FOR I is 8
FOR I is 9
FOR I is 10
size of queueofm is 11
J is 0
J is 1
J is 2
J is 3
J is 4
J is 5
FOR I is 11
FOR I is 12I was expecting the code to print the J till 11.
Could you please help me find where I went wrong ?

I think I may have been asking a wrong question.
class N {
    Thread r = null;
    public void checkQ()
      Queue q = new ConcurrentLinkedQueue<N>();
      for(int i = 0; i < 13; i++)
         System.out.println("FOR I is "+i);
         r = new Tester("Name" + i);
         q.offer(r);
         processq(q);
    public void processq(Queue queueOfM)
       if(queueOfM.size() > 10)
          System.out.println("size of queueofM is "+queueOfM.size());
        for(int j=0; j < queueOfM.size();j++)
             System.out.println("J is "+j);
             this.r = (Thread)queueOfM.poll();
             this.r.start();
          }The if in the processq method will come true when I is 11. so, once in the if, the for loop is executed. The j is checked till it is < 11 and then the value of j is being printed. So, as I was expecting J should print till atleast 10. However it is printing till 5 and quitting the loop, I dont know how or why, for which I was thinking if someone could show me why.

Problem with Queue Table while dropping schema

Hi,
I want to DROP a schema, but it gives the following error while trying to drop it:
ORA-00604: error occurred at recursive SQL level 1
ORA-24005: must use DBMS_AQADM.DROP_QUEUE_TABLE to drop queue tables
From TOAD, I found that no queue or queue_table exists in the database presently.
I'm using 10.2.0.2 RAC database.
Can anyone help me to drop the schema?
Thanks in advance..
Regards,
Anjan

I have followed the doc 203225.1..
Now getting the following error:
ORA-00081: address range [0x60000000000A89A0, 0x60000000000A89A4) is not readable
ORA-00600: internal error code, arguments: [kzdukl3], [24], [], [], [], [], [], []

Problem with Queue and linked list

Hi... i've got an assignment it start like this.
You are required to write a complete console program in java includin main() to demonstrate the following:
Data Structure: Queue, Priority Queue
Object Involved: Linked-List, PrintJob
Operations Involved:
1. insert
2. remove
3. reset
4. search
Dats all... I've been given this much information... Can any1 try to help me please... How to make a start??? And wat does the print job means???
Can any1 tell me wat am supposed to do...

Hi,
Why don't you start your demo like this?
import java.io.IOException;
public class Demo {
     public Demo() {
     public void startDemo() throws IOException {
          do {
               System.out.println("String Console Demo ");
               System.out.println("\t" + "1. Queue Demo");
               System.out.println("\t" + "2. PriorityQueue Demo");
               System.out.println("\t" + "3. LinkedList Demo");
               System.out.println("\t" + "4. PrintJob Demo");
               System.out.println("Please choose one option");
               choice = (char) System.in.read();
               showDemo(choice);
          } while (choice < '1' || choice > '4');
     public void showDemo(char ch) {
          switch (ch) {
          case '1':
               System.out.println("You have chosen Queue Demo ");
               showOperations();
               break;
          case '2':
               System.out.println("You have chosen Priority Queue Demo ");
               showOperations();
               break;
          case '3':
               System.out.println("You have chosen LinkedList Demo ");
               showOperations();
               break;
          case '4':
               System.out.println("You have chosen Print Job Demo ");
               showOperations();
               break;
     private void showOperations() {
          System.out.println("Please choose any operations ");
          System.out.println("\t" + "1. Insert ");
          System.out.println("\t" + "2. Remove ");
          System.out.println("\t" + "3. Reset ");
          System.out.println("\t" + "4. search ");
     public static void main(String[] args) throws IOException {
          Demo demo = new Demo();
          demo.startDemo();
     private char choice;
Write a separate classes for the data structures show the initial elements and call the methods based on the operations then show the result.
Thanks

Full Export/Import Errors with Queue tables and ApEx

I'm trying to take a full export of an existing database in order to build an identical copy in another database instance, but the import is failing each time and causing problems with queue tables and Apex tables.
I have used both the export utility and Data Pump (both with partial and full exports) and the same problems are occurring.
After import, queue tables in my schema are unstable. They cannot be dropped using the queue admin packages as they throw ORA-24002: QUEUE_TABLE <table> does not exist exceptions. Trying to drop the tables causes the ORA-24005: must use DBMS_AQADM.DROP_QUEUE_TABLE to drop queue tables error
As a result, the schema cannot be dropped at all unless manual data dictionary clean up steps (as per metalink) are done.
The Apex import fails when creating foreign keys to WWV_FLOW_FILE_OBJECTS$PART. It creates the table ok, but for some reason the characters after the $ are missing so the referencing tables try to refer to WWV_FLOW_FILE_OBJECTS$ only.
I am exporting from Enterprise Edition 10.2.0.1 and importing into Standard edition 10.2.0.1, but we are not using any of the features not available in standard, and I doubt this would cause the issues I'm getting.
Can anyone offer any advice on how I can resolve these problems so a full import will work reliably?

Thanks for the lead!
After digging around MetaLink some more, it sounds like I'm running into Bug 5875568 (MetaLink Note:5875568.8) which is in fact related to the multibyte character set. The bug is fixed in the server patch set 10.2.0.4 or release 11.1.0.6.

Problem with initialization Delta queue

Hi Gurus,
I have problem with initialization of delta queue when I try load transaction data from R3 (FM) to BI.
Error message: Deviation of (64 seconds) between qRFC counter (000012365466830000080000) and actual time (08.03.2009 21:10:19).
I have no idea where is the problem because this problem occurs only in PRD systems. In DEV and QUA system everything is OK.
System BI: BI 7.0
Source system: ECC 6.0
Thank you for all answers!
mp

Hi,
Replicate the DS in BW Prod and then Activate Transfer rules and then try.
First you delete the DElta quae in RSA7 for the particular datasource in the R/3
source system then you try to intialize, here you are trying to intialize datasource with
same selection conditons . thats why it is giving shortdump
Check
Business Content and Extractors
Thanks
Reddy

Problem with long response time when looking at queues!

Hello,
I have a problem with extream long response times, when looking at the queues in Message mapping test tool . Does anyone know how to improve performance.
The source message I use is about 200 segments (idoc)
The mapping is done with the graphical tool, with 10-15 field contain standard sap functions for mapping.
Target structure is EDIFACT (xml)
Brgds
Karl Bergströ

Hi Rod.
Go to Apple Menu > System Preferences > Network > Show: Network Port Configurations. Make sure that the configuration used to connect to Internet is at the top of the list. Also, disable any communications/networking configuration enabled, but not in use.
If the above doesn't fix the problem, open Keychain Access > Preferences, and disable Search .Mac For Certificates if it's enabled. Take a look at the following articles for an explanation of why this could fix the problem:
http://www.hawkwings.net/2006/07/18/apple-mail-phones-home-too/
http://www.macgeekery.com/tips/mailapp_doesnt_phone_homeeither

I have just been having problems with my Canon MP250 printer and decided to uninstall and re-install the printer and everytime I try to re-install the printer trough preferences and all I keep getting was a message saying "preparing to queue"......

I have just been having problems with my Canon MP250 printer and decided to uninstall and re-install the printer and everytime I try to re-install the printer trough preferences and all I keep getting was a message saying "preparing to queue"...... I then decided to try and reload the Canon printer drivers and for some silly reason I deleted the existing Canon printer drive. Now I cannot load them from the CD provided with the printer or from downloads through the Apple store. If anyone out there could help me I would be greatly appreciated......

These Canon printer/scanner drivers from Apple - http://support.apple.com/kb/DL899 - should work. The MP250 is listed on the support page. Try downloading and installing them.
Good luck,
Clinton

FYI: MS-7125 BIOS has problem with Hard Drives withNative Command Queuing (NCQ)

For those the have messed my two treads on which both ended up being cause by K8N Neo4 BIOS problem with HD's with NCQ.
Will wonders never cease? MSI Support finally conceded the BIOS has a problem with Hard Drives with NCQ and they have forwarded the problem to their programming department.
However, do not look for any results for above two weeks.
Roger

The problem that this thread has been trying to follow is the incapability of the nVidia RAID Controller with Serial ATA Type 2.5 drives. I know the threads has been hard to follow and part of that is because when I started the thread I had what appeared to be three totally un related problems, but all three were traced down the common problem of the incapability of RAID Controller with Serial ATA Type 2.5 drives.
The title of this thread is MS-7125 BIOS has problem with Hard Drives with Native Command Queuing(NCQ). The statement was true at the time it was written and has nothing to do with memory problems.
Sense the thread was started MSI has fixed the BIOS part of the problem, but we have sense learned the nVidia RAID Controller Command software and its driver has problems too. I have been working MSI Support, they have been using me to test pre-beta BIOS and Drivers soon. Of the testing I have done the pre-beta BIOS worked and the Pre-beta 32-bit driver works. I am assuming that the latest BIOS V1.B had as part of it included fixes was the needed fixes for working with the nVidia RAID Controller as I have test the pre-beta RAID Driver with BIOS Version V1.B as the Raid array function fine windows XP Pro 32-bit Edition. As I have had no communications with MSI support of over a week now I am hoping for a release of 32-bit and 64-bit RAID Drivers. But, nobody should get the hopes up, because through other backdoor sources nVidia is having a hell of a time. One reason for this I heard is that the nVidia RAID Controller is fully software, no hardware other than the electrical drive interfaces. Their problem started when they tried using the old 32-bit code Controller with new 64-bit hardware drivers and now they are having to totally rewrite the controller core in 64-bit code. But, knowing my source, it may all be fiction.
The RAID Array you say is up and running, are the drives full specification SATA 2.5 in other words do the both have 3Gb/s speed and NCQ. If you send me the full part numbers I will check the specifications a get back to you. Because if you have nVidia RAID 0 Array you working you will be the first to have done it and there about 230 people around the world that would like to know how you did it, even MSI, who's pre-beta nVidia RAID Drivers that will work with BIOS V1.B for 32-bit Windows only and nothing for Windows XP 64, would like to know.
Roger

Problem with Queue

Similar Messages

Maybe you are looking for