List implementation where remove(Object) is fast?

Does anyone know of an implementation of the java.util.List interface where the the method boolean remove(Object o) is much faster than traversing through the list until it finds the right one? Perhaps something that takes advantage of the hash code of the object being removed?
Thanks

So you want a List that acts like a Map?
Couldn't you just use a Map?
Explain your problem domain better and we shall help
you see the light.
Well no - I would simply like a List that acts like a List, and whose remove(Object) method is faster than just scanning through each element.
I only mentioned use of the hash code as one way this could be implemented. To expand on that: Currently the LinkedList class internally maintains a list of Entry objects. Each of these objects has a reference to the previous and next Entry and the 'current' list element object. The problem is that the remove(Object) method has to go through each Entry one by one, searching for a list element that equals the object to be removed. To fix this problem the list implementation could also maintain a HashMap whose 'keys' are the list elements and whose 'values' are a (secondary) list of Entry objects associated with that key. Now the remove(Object) method could use the object to be removed to look up the 'list of associated Entry objects'. The first Entry in this (secondary) list is the one that needs to be removed.
But perhaps it's best if I describe the overlying problem: I want to write a program that randomly generates integers at the rate of about 10 per second. For each integer the program should calculate how many times in the past hour that number has been generated. What's the fastest way to calculate this?

Similar Messages

Problems with List Implementation

I have a list implementation that is like a linked list but contains 'n' elements in each node, set to 8 by default.
The list has a head node, and a tail node.
This is a revisit on an assignment, I'm trying to fix it.
The problem is when a number of elements have been added and then deleted from the end of the list. Then more elements are added.
I'm using a JUnit test case to test this, and what happens is about 25 elements are added and removed, but when it gets to adding a new elements after recently deleting some items towards the end of the list. My list fails because, I am unable to assign value to my tail from within my iterator.
The compiletime error I get is:
Type mismatch: cannot convert from chunklist.ChunkList<T>.Chunk<T> to chunklist.ChunkList<T>.Chunk<T>
I need to assign my tail to the previous Chunk (node), because in my iterator when I delete a Chunk the tail doesn't get automatically assigned to the previous.
Anyone know how I can get around this retarded error? or what I can do to solve my problem?
Edit: casting to Chunk<T> doesn't work either it's the same compiletime error
I have deleted all irrelevant methods and comments from this: The error is in the deleteChunk() method. I need to point tail back to the previous node there.
package chunklist;
import java.util.AbstractCollection;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
public class ChunkList<T> extends AbstractCollection<T>
    @SuppressWarnings({ "unchecked", "hiding" })
    private class Chunk<T>
        private T[] data;
        private Chunk<T> next;
        private int chunkSize;
        public Chunk()
            this.data = (T[])new Object[ARRAY_SIZE];
            this.next = null;
            this.chunkSize = 0;
        public boolean equalsChunk(Chunk<T> c)
            if (c == null)
                return false;
            else if (this.chunkSize != c.chunkSize)
                return false;
            else if (this.next != c.next)
                return false;
            else
                for(int i=0; i<this.chunkSize; ++i)
                    if (!(this.data.equals(c.data[i])))
return false;
return true;
}// end of Chunk<T>
@SuppressWarnings({ "hiding", "unchecked" })
private class ChunkItr<T> implements Iterator<T>
private Chunk<T> currentChunk;
private Chunk<T> previousChunk;
private Chunk<T> nextChunk;
private int currentElement;
public ChunkItr()
currentChunk = (Chunk<T>) head;
previousChunk = null;
nextChunk = (Chunk<T>) head.next;
currentElement = 0;
@Override
public boolean hasNext()
if (currentChunk == null)
return false;
else
if (currentElement < currentChunk.chunkSize)
return true;
return (currentChunk.next != null);
@Override
public T next()
if (!hasNext())
throw new NoSuchElementException();
T elementToReturn = null;
while (elementToReturn == null)
if ((currentElement == ARRAY_SIZE) ||
(currentElement == currentChunk.chunkSize))
previousChunk = currentChunk;
currentChunk = currentChunk.next;
currentElement = 0;
if (nextChunk != null)
nextChunk = currentChunk.next;
if (currentChunk.data[currentElement] != null)
elementToReturn = (T) currentChunk.data[currentElement];
++currentElement;
return elementToReturn;
@Override
public void remove()
if (currentChunk == null)
throw new IllegalStateException();
else
for (int i=currentElement-1;i<currentChunk.chunkSize;++i)
{ // shift everything down
if ( (i != 7) && (i >= 0) )
currentChunk.data[i] = currentChunk.data[i+1];
else if (i==7)
break;
currentChunk.data[currentChunk.chunkSize-1] = null;
--currentChunk.chunkSize;
--numOfElements;
--currentElement;
if (currentElement < 0)
currentElement = 0;
if (currentChunk.chunkSize <= 0)
deleteChunk();
public void deleteChunk()
if (previousChunk == null) //* @head *//
if (head.next != null)
head = head.next;
currentChunk = (Chunk<T>) head;
nextChunk = currentChunk.next;
currentElement = 0;
else currentElement=0;
else if (nextChunk == null) //* @tail *//
currentChunk = previousChunk;
currentChunk.next = null;
nextChunk = currentChunk.next;
currentElement = currentChunk.chunkSize;
tail = currentChunk; // THIS DOESN'T WORK, << ERROR HERE
else //* @middle *//
currentChunk = currentChunk.next;
previousChunk.next = currentChunk;
nextChunk = currentChunk.next;
currentElement = 0;
// back @ head? (just deleted Chunk before head)
if (currentChunk.equalsChunk((Chunk<T>) head))
previousChunk = null;
} // end ChunkItr
private static final int ARRAY_SIZE = 8;
private Chunk<T> head;
private Chunk<T> tail;
private int numOfElements;
public ChunkList()
head = null;
tail = null;
numOfElements = 0;
public void addNewChunk()
if (head == null)
head = new Chunk<T>();
tail = head;
else
tail.next = new Chunk<T>();
tail = tail.next;
@Override
public boolean add(T t)
if (t == null)
throw new IllegalArgumentException();
if (head == null)
addNewChunk();
if (tail.chunkSize == ARRAY_SIZE)
addNewChunk();
tail.data[tail.chunkSize] = t;
numOfElements++;
tail.chunkSize++;
return true;
@Override
public Iterator<T> iterator()
return new ChunkItr<T>();
@Override
public boolean remove(Object o)
// creates iterator and calls iterators remove method when it finds o.
Edited by: G-Unit on Nov 14, 2010 5:07 AM

YoungWinston wrote:
Possibly, but I suspect you'll need to be prepared to defend your design choice with more than just test results. Why did you choose this pattern? Because it's an assignment. I will do some reading when I get around it to it. But for now I don't have time, and don't care to make time. This assignment was annoying as... So many fiddly little errors that took me too long to figure out. For now I hate Lists, I'm happy using the default ones.
1. Introduction
This document is the Project Specification for a ChunkList class to be developed by DBSD202 students this semester.
2. What you must do
The requirements specifications are detailed below:
ChunkList
In this first part of the assignment we will create a data structure called a ChunkList. The ChunkList class implements the Collection interface and >>serves a replacement for ArrayList or LinkedList. A ChunkList is like a regular linked list, except each node contains a little fixed size array of elements >>instead of just a single element. Each node also contains its own "size" int to know how full it is.
The ChunkList will have the following features...
The ChunkList object contains a head pointer to the first chunk, a tail pointer to the last chunk, and an int to track the logical size of the whole >>collection. When the size of the list is 0, the head and tail pointers are null.
Each chunk contains a fixed size T[] array, an int to track how full the chunk is, and a next pointer. The constant ARRAY_SIZE = 8; in the chunk >>class defines the fixed size of the array. Elements should be added to the array starting at its 0 index. The elements in each little array should be >>kept in a contiguous block starting at 0 (this will require shifting elements around in the little array at times). (You may want to do some testing >>with ARRAY_SIZE set to smaller values, but turn it in set to 8.)
ChunkList should be a subclass of AbstractCollection which provides some basic facilities built on top of your add(), iterator(), size() etc. primitives. >>Chunk should be an inner class defined inside of ChunkList. Only ChunkList will see or use the Chunk class directly. It's stylistically ok if ChunkList >>accesses the state (.next, .data, ...) of the Chunk objects, since Chunk essentially is just an integrated part of ChunkList. Add utility methods to >>Chunk where it helps to keep things receiver-
relative (remove for example). ChunkIterator should be a private inner class as in the lecture example.
ChunkList must support the messages: constructor, add(), size(), and iterator(). The iterator must support hasNext(), next(), and remove(). It's >>valid for the client to add "null" as an element, so you cannot use null as some sort of special marker in the array -- use your size int in each chuck. >>Make sure that size() and hasNext() are consistent about the size of the collection.
The empty collection should be implemented as null head and tail pointers. Only allocate chunks when actually needed.
The add() operation should add new elements at the end of the overall collection -- i.e. new elements should always go into the tail chunk. If the >>tail chunk is full, a new chunk should be added and become the new tail. We are not going to trouble ourselves shifting things around to use >>empty space in chunks in the middle of the list. We'll only look at the tail chunk.
Do not use a dummy node because (a) it does not help the code much, and (b) dummy nodes are lame.
Keep a single "size" variable for the whole list that stores the total number of client data elements stored in the list, so you can respond to size() in >>constant time. Similarly, keep a separate size in each chunk to know how full it is. Likewise, add(), hasNext(), next(), and remove() should all run in >>O(1) constant time (they may do computations proportional to ARRAY_SIZE, but not proportional to the overall collection length).
When using iterator.remove() to remove an element from a Chunk, overwrite the pointer to that element with a null to help the garbage >>collector. This is not a requirement, but it's a nice touch.
When an iterator.remove() operation causes a chunk to contain zero elements, that chunk should be removed from the list immediately. The code >>for deletion is quite tricky. You may store a "previous" pointer in each chunk if you wish. It is possible to code it without previous pointers by >>keeping extra pointers in the iterator to remember the two previously seen chunks during iteration. Chunk deletion will need to work for many >>boundary cases -- the first chunk, the last chunk, and so on. This is probably the trickiest part of the whole thing.
When called with correct inputs, ChunkList should return the correct result. However, when called with incorrect inputs -- e.g. iterator.remove() >>without first calling next() -- ChunkList does not need to do anything in particular. It's fine if
your code just gives the wrong output or throws a null pointer or other exception. This is a slight relaxation of the formal Collection interface which >>guarantees to throw particular exceptions for particular errors.
ChunkList Advice — Tight Code
The ChunkIterator is a tricky bit of code. There are about 4 different cases to get right, depending on if the removed chunk was first or last in the >>list. Don't have a separate copy of the remove code for each special case. If you find yourself copying and pasting code, you're doing it wrong. >>Clean up the solution so there is one copy of the remove code and then a few lines to deal with the special cases. This is just general coding style >>advice – avoid proliferating copies of the code for slightly different cases. Try to factor the code down so one copy of the code deals with many >>cases. The remove() method should be about 15 lines long.
Testing
The ChunkList is extremely well suited to unit-testing. This is good, since the ChunkList has such a large number of tricky little boundary cases >>where it can go awry. We will unit-test the ChunkList aggressively, since it's the best way to get the code right.
1. ChunkList Basic Testing
To get started, write some basic unit tests that build up a ChunkList of Strings with add(), and then iterate over it and remove a few elements, >>checking that the list look right before and after the removes. These tests will get the most basic add()/iterator()/remove() code working.
2. ChunkList Super Test
I will provide code for an extremely aggressive test on the ChunkList. Only try this after your basic tests are working. Because the ArrayList (known >>to be correct) and the ChunkList both implement the Collection interface, we can use a unit-test strategy where we do the same operation on >>both an ArrayList and ChunkList, and then verify that they get the same output after each operation.
The SuperTest creates both an ArrayList and a ChunkList. We'll call an "operation" either a single addition or an iteration down the collection doing >>a few random removes. Do the same random operation to both the ArrayList and ChunkList, and then check that the two look the same, element >>by element. Then loop around and do that 4999 more times, checking the two again after each random operation. We want to push on the >>ChunkList
to get every weird combination of list length and this or that chunk being full or empty at the time of add or series of removes in some position.
When you get it take a look at the SuperTest code. It creates a Random(1) for its random number generation, object passing 1 as the seed. In >>this way, the series of "random" operations is the same every time the test is run.
3. ChunkList SpeedTest
The unit-tests should work on the correctness of the ChunkList, and that's the most important thing. Look at the source of the provided >>ChunkSpeed class and try running it. It runs a timing test on the ArrayList, LinkedList, and ChunkList classes. The test is a crude simulation of >>collection add/remove/iterate use. ChunkSpeed prints the milliseconds required to do the following representative mix of operations...
- Use add() to build a 50,000 element collection
- Create an iterator to iterate halfway through the collection
- Use the iterator to remove 10,000 elements at that point
- Creates and runs iterators to run over the whole collection 5 times
The speeds seen depend on many factors, including the ARRAY_SIZE, the specific hardware, the system load, JVM version, etc., and some runs >>will be way off because the GC thread runs during part of the test. Broadly speaking, on average the ChunkList should be roughly as fast or faster >>than the LinkedList, and a lot faster (a factor of 10 or so) than the ArrayList. The speed numbers have a lot of noise in them, so don't worry about >>a single run. The ChunkList might be slower than the LinkedList on occasion. However, if your ChunkList is consistently slower than the Linked List >>or ArrayList, there is probably something wrong with your ChunkList algorithm -- some operation that is supposed to be O(1) is O(n). The most >>important methods to be fast are hasNext() and next(), since they are the most commonly called by the client.Edited by: G-Unit on Nov 15, 2010 7:31 AM
Edited by: G-Unit on Nov 15, 2010 7:44 AM

List of Master Data Objects in ECC 6.0

Hi All,
Can anyone please provide me a list of Master Data Objects in ECC 6.0? *\[removed by moderator\]
Thanks,
Kaushik Koli.
Edited by: Kaushik Koli on Jul 1, 2008 1:20 PM
Edited by: Jan Stallkamp on Jul 1, 2008 4:32 PM

Hi Gareth,
Thanks for your reply.
I know it is not an easy task but I need to provide a list of master data objects in ECC 6.0.
Can you atleast tell me where to start from? Any manual way of finding it will also do?
Regards,
Kaushik Koli.

LinkedList.remove(Object) O(1) vs O(n)

The LinkedList class documentation says the following:
"All of the operations perform as could be expected for a doubly-linked list. Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index."
Typically one expects the remove operation from a linkedlist to be O(1). (for example [here on wikipedia|http://en.wikipedia.org/wiki/Linked_list] )
This is in theory true however typically in the implementation of a LinkedList internally nodes (or Entry<E> in the case of the java implementation) are made that are wrappers around the actual objects inserted in the list. These nodes also contain the references to the next and previous nodes.
These nodes can be removed from the linked list in O(1). However if you want to remove an a object from the list, you need to map it to the node to be removed. In the java implementation they simply search for the node in O(n). (It could be done without searching but this would require some mapping which requires more memory.)
The java implementation can be seen here:
    public boolean remove(Object o) {
        if (o==null) {
            for (Entry<E> e = header.next; e != header; e = e.next) {
                if (e.element==null) {
                    remove(e);
                    return true;
        } else {
            for (Entry<E> e = header.next; e != header; e = e.next) {
                if (o.equals(e.element)) {
                    remove(e);
                    return true;
        return false;
    }It seems to be a common misconception that this method runs in O(1) while it actually runs in O(n). For example [here in this cheat sheet|http://www.coderfriendly.com/2009/05/23/java-collections-cheatsheet-v2/] and [in this book|http://oreilly.com/catalog/9780596527754/]. I think quite a lot of people think this methode runs in O(1). I think it should be made explicitly clear in the documentation of the class and the method that it runs in O(n).
On a side note: the remove() operation from the LinkedList iterator does perform in O(1).

I agree. It's not at all clear what the objection here is.
To add to Jeff's answer: the remove operation on the LinkedListIterator is O(1) because you don't have to search for the node to unlink - the iterator already has a pointer to it.
I tend to think of two different operations:
- unlink - an operation specific to a linked datastructure which removes a given node from the datastructure and completes in O(1)
- remove - an operation which searches for a given object in the data structure and then removes the node containing that object (using the unlink operation in the case of a linked datastructure). The performance of this depends on the performance of the search and unlink operations. In an unsorted linked list (e.g. the Java LinkedList) the search operation is O(n). So this operation is O(n).

Updation of List Settings through Client object model

Hi all,Is there any way to update List settings through Client object model.
I want to work with all the list settings programmaticaly using client object model.
Is there any way???

Hi,
Handful operations you can do it with client object model as certain limitations are there, which are not in server object model. Sharepoint Client obejct model comes with 3 APIs .i.e .Net managed code, javascript api and silverlight
object model .
For reference , i implemented test code to add list on the Quick launch.
ClientContext clientContext = new ClientContext("Web FullUrl");
Web web = clientContext.Web;
List list = web.Lists.GetByTitle("Test");
list.OnQuickLaunch = true;
list.Update();
clientContext.Load(list);
clientContext.ExecuteQuery();
Regards,
Milan Chauhan
LinkedIn
|
Twitter | Blog
| Email

Sorting a list of different class objects

Hi All ,
How to sort a List a.which contains objects of different Classes, b. objects of same class . Is it possible to sort these by implementing Comparable interface .
Thanks ,
Rajesh Reddy

rajeshreddyk wrote:
Hi All ,
How to sort a List a.which contains objects of different Classes, b. objects of same class . Is it possible to sort these by implementing Comparable interface .Well, if objects of different classes are kept in the same List and you want to sort them together they at least have that in common. They're Comparable-able. -:) To manifest that the different classes could all implement a Comparableable interface (or maybe Intercomparable would be a better choise of name.)

Collection: add(E), remove(Object)

Hello, all!
First of all, I guess very strange see interface collection with
add(E) and remove(Object)... Why is there such collision?
LinkedList<String> list = new LinkedList<String>();
Object o = null;
list.remove(o);NetBeans shows a warning for the last line: Expected type String, actual type Object.
Eclipse and java compiler do not point to it. So how can I understand this? Netbeans fixed remove(Object) to remove(E)?
Can you please help to understand the collision?

mfratto wrote:
The only warning I get in netbeans is to assign the return value, a boolean, to a new variable.I use netbeans 6.7. Probably, You use another version of netbeans from me, so you do not get the same warning.
[see screenshort of the netbeans warning|http://i055.radikal.ru/0907/b2/6203e7e22d79.jpg]
But what that warning is saying is that you declared the LinkedList to contain String objects, but you are trying to remove an Object (which is a parent of String). You can do that, it's just weird to do so. Why wouldn't you just pass a object, a String in this case, of the same type back into list.remove()?
Edited by: mfratto on Jul 23, 2009 5:42 PMwithout sense, I just would like to understand netbeans behavior and "collision" of add(E) and remove(Object) methods.
Edited by: aeuo on Jul 23, 2009 8:47 PM the screenshort was changed to more illustrative one

ConcurrentLinkedQueue remove(Object o) always fails in ActionListener?

Hi,
I tried to write a tiny program where if I click a button, the right String is removed from a ConcurrentLinkedQueue.
However, it doesn't work at all. To troubleshoot, I tried other ConcurrentLinkedQueue methods such as add(), offer(), remove(void). They all work fine except remove(Object o).
According to doc, remove(Object o) works if o.equals(e). So I also overwrote equals(Object o). It still doesn't work.
This is a pesudo code:
class a extends JFrame
public ConcurrentLinkedQueue<String> queue;
public JTextField text;
public JButton button;
public ActionListener removeAction=new ActionListener()
public void actionPerformed(ActionEvent e)
//Supposing it's string "StringA" in the text box GUI.
queue.remove(text.getText());
//false. Can't remove String "StringA" from queue.
public a()
queue.add("StringA");
queue.add("StringB");
queue.add("StringC");
add(text);
add(button);
button.addActionListener(removeAction);
Can anyone help me with it?

809670 wrote:
According to doc, remove(Object o) works if o.equals(e). So I also overwrote equals(Object o). It still doesn't work.Overrode, not overwrote.
Possibilities:
1) There's a huge glaring bug in a significant public method that's been in general use for several years and you're the first one to find it.
2) There's a huge glaring bug in a significant public method that's been in general use for several years and others have found it before, but nobody bothered to fix it.
3) There's something wrong with your equals method.
4) There's something wrong with the code where you call remove.
5) There's something wrong with how you're determining that the object has not been removed.

Unable to get the SharePoint 2013 List names using Client object model for the input URL

Please can you help with this issue.
We are not able to get the SharePoint 2013 List names using Client object model for the input URL.
What we need is to use default credentials to authenticate user to get only those list which he has access to.
clientContext.Credentials = Net.CredentialCache.DefaultCredentials
But in this case we are getting error saying ‘The remote server returned an error: (401) Unauthorized.’
Instead of passing Default Credentials, if we pass the User credentials using:
clientContext.Credentials = New Net.NetworkCredential("Administrator", "password", "contoso")
It authenticates the user and works fine. Since we are developing a web part, it would not be possible to pass the user credentials. Also, the sample source code works perfectly fine on the SharePoint 2010 environment. We need to get the same functionality
working for SharePoint 2013.
We are also facing the same issue while authenticating PSI(Project Server Interface) Web services for Project Server 2013.
Can you please let us know how we can overcome the above issue? Please let us know if you need any further information from our end on the same.
Sample code is here: http://www.projectsolution.com/Data/Support/MS/SharePointTestApplication.zip
Regards, PJ Mistry (Email: [email protected] | Web: http://www.projectsolution.co.uk | Blog: EPMGuy.com)

Hi Mistry,
I sure that CSOM will authenticate without passing the
"clientContext.Credentials = Net.CredentialCache.DefaultCredentials" by default. It will take the current login user credentials by default. For more details about the CSOM operations refer the below link.
http://msdn.microsoft.com/en-us/library/office/fp179912.aspx
-- Vadivelu B Life with SharePoint

Table which stores the list of active ods objects in BW

Hi,
I am trying to find out the list of active ods objects starting with y and Z, Is there any table which has the information regarding that. For Infoobject I found the table as "RSDIOBJ". Can you plz let me know if there is any table for ods.
Thank you in advance,
Raghavendra Reddy BIjevemula

Hi Raghu,
u r typing it wrong..
its "RSDODSO"..
It will definitely work..
which gives all available ODS.
Regards-
MM

Attachment list in Services for Object toolbar

Does anybody know if there is any user exit or BADI that I can use to filter certain file attachments in Attachment list of Services for Object toolbar.
For example, in transaction XK03 (Vendor display), Services for Object toolbar, you can see the Attachment list and it will display list of pc file attachments, however, we have a requirement to display only those that met certain criteria, is there any BADI or user exit for this?
Thanks in advance for your help.

you can use BADI
GOS_SRV_SELECT
for this.
Regards
Raja

Not appear add/remove object merged

Hi,
I have a web intelligence report with a merged, but the option does not appear add/remove object in the merged, however, supposed that this function would be enabled on the version you just updated, as mentioned in this link:
https://scn.sap.com/community/businessobjects-web-intelligence/blog/2013/03/10/what-is-new-with-web-intelligence-bi-41-part-2-core-capabilities
upgrade
BI4.1 SP1 Patch7
regards

Maybe something here will help?
[[Removing the Search Helper Extension and Bing Bar]]

List the used ABAP objects

Hi all,
I'm looking for a standard tool to list the used ABAP objects (Reports, Include, Function Group, CLASSes) in a time
frame of one year or at least since the start-up.
My goal is the identification of the obsolete custom developments to dismiss it.
I have found the transaction SCOV but the goal of this transaction is the estimation of the code
coverage during the test.
Anyone can help me?
Thanks in advantage

This kind of data is stored in table MONI - Monitor table MONI (summarized cluster table!) and in some files of the application server (in the OS behind SAP)
- Transaction STAT or ST03n use data stored in these tables
- Some FM like [SAPWL_SERVLIST_GET_LIST|https://www.sdn.sap.com/irj/scn/advancedsearch?cat=sdn_all&query=sapwl_servlist_get_list&adv=false&sortby=cm_rnd_rankvalue] and [SAPWL_WORKLOAD_GET_STATISTIC|https://www.sdn.sap.com/irj/scn/advancedsearch?query=sapwl_workload_get_statistic&cat=sdn_all] may be used to get the data from each application server
(click on the links to get more information and samples on how to use these FM)
Regards

[svn:bz-trunk] 18926: bug fix BLZ-570 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError

Revision: 18926
Revision: 18926
Author:   [email protected]
Date:     2010-12-01 14:07:19 -0800 (Wed, 01 Dec 2010)
Log Message:
bug fix BLZ-570 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError
We put hard limit to the max object nest level to prevent StackOverFlowError. the default max object nest level is 1024 and it can be configured in the endpoint/serialziation section in service-config.xml.
This needs documentation.
Checkintests pass
Ticket Links:
    http://bugs.adobe.com/jira/browse/BLZ-570
Modified Paths:
    blazeds/trunk/modules/common/src/flex/messaging/errors.properties
    blazeds/trunk/modules/core/src/flex/messaging/endpoints/AbstractEndpoint.java
    blazeds/trunk/modules/core/src/flex/messaging/io/SerializationContext.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/Amf0Input.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/Amf3Input.java
    blazeds/trunk/modules/core/src/flex/messaging/io/amf/AmfIO.java

[svn:bz-4.0.0_fixes] 20451: backporting bug fix BLZ-570/ BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError .

Revision: 20451
Revision: 20451
Author:   [email protected]
Date:     2011-02-24 08:33:31 -0800 (Thu, 24 Feb 2011)
Log Message:
backporting bug fix BLZ-570/BLZ-620 Double linked list with lot of objects result in BlazeDS Error deserializing error : StackOverflowError We put hard limit to the max object nest level to prevent StackOverFlowError. the default max object nest level is 1024 and it can be configured in the endpoint/serialziation section in service-config.xml. This needs documentation. Checkintests pass
Ticket Links:
    http://bugs.adobe.com/jira/browse/BLZ-570
    http://bugs.adobe.com/jira/browse/BLZ-620
Modified Paths:
    blazeds/branches/4.0.0_fixes/modules/common/src/flex/messaging/errors.properties
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/endpoints/AbstractEndpoint.j ava
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/SerializationContext.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/Amf0Input.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/Amf3Input.java
    blazeds/branches/4.0.0_fixes/modules/core/src/flex/messaging/io/amf/AmfIO.java

Dear Pallavi,
Very useful post!
I am looking for similar accelerators for
Software Inventory Accelerator
Hardware Inventory Accelerator
Interfaces Inventory
Customization Assessment Accelerator
Sizing Tool
Which helps us to come up with the relevant Bill of Matetials for every area mentioned above, and the ones which I dont know...
Request help on such accelerators... Any clues?
Any reply, help is highly appreciated.
Regards
Manish Madhav

List implementation where remove(Object) is fast?

Similar Messages

Maybe you are looking for