Topic: LinkedList sort,join,split

LinkedList sort,join,split

1 posts in topic

Flat View

Thread View

Older Post First | Reply to Topic

TOPIC ACTIONS:

Print Topic

Posted By: Dohyeon_KIM
Posted On: Friday, October 12, 2001 01:18 AM

			

			Collections.sort() convert LinkedList
			

			to Array, sort, make new LinkedList,
			

			and return that.
			

			

			Collections.appendAll() add all
			

			elements from new collection not
			

			joining them.
			

			

			No way to split LinkedList without
			

			additional memory allocation.
			

			

			I want merge, sort, join, split. and I
			

			don't want use any integer index for
			

			linked list. (for nested iterating)
			

			

			Is there any modified LinkedList?

Report | Quote This | Send private message | Reply | Print

Re: LinkedList sort,join,split

Posted By: George_McKinney
Posted On: Monday, October 15, 2001 01:36 PM

Are you asking whether there are implementations of LinkedList that include the methods you describe?

Collections.sort(Collection c) returns void; that is, it sorts the Collection without creating a new one.

Collections.appendAll() doesn't exist, though there is an addAll() method in the Collection interface.

I don't know of any implementations/extensions such as those, but one should be fairly easy to code.

Report | Quote This | Send private message | Reply | Print