اسلاید پاورپوینت: منظومه (collection) ، عنصر (element) و کلید (key)…

 

عناوین اصلی استخراج شده از این فایل پاورپوینت

عناوین اصلی استخراج شده از این فایل پاورپوینت

● CS 602
Collections
● Overview
● Benefits
● Core Collections Framework
● Core Collections Framework (Cont’d)
● Operations Supported by Collection interface
● Iteration
● Set
● Example Code
● Set Implementation Comparisons
● List
● Typical usage of List
● List Iterator
● List Operations
● Algorithms available for List
● Queue
● Map
● Map (Cont’d)
● Map Implementations
● SortedSet
● SortedMap
● Map: Pitfalls
● ThreadSafety
● Bibliography

نوع زبان : انگلیسی حجم : ۰٫۱۳ مگا بایت
نوع فایل : اسلاید پاورپوینت تعداد اسلایدها: ۲۴ صفحه
زمان استخراج مطلب : ۲۰۱۸/۱۱/۰۲ ۰۴:۴۶:۱۰ پسوند فایل : ppt

لینک دانلود رایگان لینک دانلود کمکی

 

در صورتی که محتوای فایل ارائه شده با عنوان مطلب سازگار نبود یا مطلب مذکور خلاف قوانین کشور بود لطفا در بخش دیدگاه (در پایین صفحه) به ما اطلاع دهید. جهت جستجوی پاورپوینت های بیشتر بر روی اینجا کلیک کنید.

این مطلب در تاریخ ۲۰۱۸/۱۱/۰۲ ۰۴:۴۶:۱۰ به صورت خودکار استخراج شده است. در صورت اعلام عدم رضایت تهیه کننده ی آن، طبق قوانین سایت از روی وب گاه حذف خواهد شد. همچنین این مطلب برگرفته از وب سایت زیر است و مسئولیت انتشار آن با منبع اصلی است.

https://web.njit.edu/~gblank/cs602/Collections.ppt

بخشی از محتوای متن استخراج شده از این فایل ppt

بخشی از محتوای متن استخراج شده از این فایل ppt

cs ۶ ۲ collections arathi bhandari overview a collection is a container that groups similar elements into an entity. examples would include a list of bank accounts set of students group of telephone numbers. the collections framework in java offers a unified approach to store retrieve and manipulate a group of data java’s collection framework has an intuitive approach when compared to other complex frameworks such as c benefits helpful to developers by providing all standard data structures algorithms to let the developer concentrate more on functionality rather than the lower level details faster execution with a range of options available for choice of implementation. the framework aids in improving the quality and performance of java applications. code to interface since the collections framework is coded on the principles of code to interface it aids in inter operability between apis that are not directly related. learning curve easy to learn and start using collections due to the code to interface principles. core collections framework the collection framework forms a suitable hierarchy collection set list queue sortedset map sortedmap core collections framework cont’d the core collections framework is very generic in nature and provides a standard interface to all operations that can be performed. for example the root interface collection is declared as public interface collection e e represents a generic object. collection this interface is pretty much used in declarations and method signatures so any type of collections can be passed around. set a collection interface that cannot take any duplicate elements. list an ordered collection interface that allows duplicate elements and provides object retrieval based on an integer index. queue apart from following the fifo first in first out principles this collection offers variety of implementation. map supports collection of key and value pairs. design does not allow duplicate keys. sorted set ordered version of the set interface. sorted map maintains ascending order of keys. operations supported by collection e interface boolean isempty boolean contains object element boolean remove object element interface e iterator boolean containsall collection c boolean addall collection extends e c boolean removeall collection c c.removeall collections.singleton obj boolean retainall collection c void clear object toarray t t toarray t a iteration two ways to iterate over collections iterator static void loopthrough collection col for iterator e iter col.iterator iter.hasnext object obj iter.next for each static void loopthrough collection col for object obj col access object set set interface it offers inherited services from the root collection interface with the added functionality of restricting duplicate elements. implementations set hashset treeset linkedhashset example code adding unique objects to a collection collection string uniquestring collection string c set string uniquesetstr new hashset string for string str c if uniquestrset.add str system.out.println duplicate deleted str return uniquestrset set implementation comparisons idioms for using bulk operations on sets copy a set when doing bulk operations to retain the original set. example set string unionset new treeset string set۱ unionset.addall set۲ hashset treeset linked hashset storage type hash table red black tree hash table with a linked list performance best performance slower than hashset little costly than hashset order of iteration no guarantee of order of iteration order based orders elements based on insertion list in addition to the core services inherited from the root collection interface the list interface offers positional access search customized iteration range view list implementation arraylist offers better performance compared to linkedlist. list arraylist vector linkedlist typical usage of list bulk operations lista.addall listb append elements. positional access and search eg to swap elements in a list. public static string void swap list string strlist int k int l string strtmp strlist.get l strlist.set k strlist.get l strlist.set l strtmp list iterator customized iteration listiterator offers iteration in both directions forward and backward example for listiterator string liter strlist.listiterator strlist.size liter.hasprevious string str liter.previous list operations range view sublist int from int to returns a view portion of the sublist starting from from to to exclusive. algorithms available for list sort uses mergesort shuffle randomly shuffles elements reverse reverses order of elements rotate rotates list by specified number fill overwrites every element with specified element. copy copies source list into destination. binarysearch performs search usng binary search. indexofsublist returns index of first sublist found. lastindexofsublist returns index of the last sublist found. queue in addition to the inherited core services offered by collection queue offers following methods in two flavors purpose throw exception return special value insert inserts an elements to the queue add obj offer obj remove remove head of the queue and return it. remove poll examine return the head of the queue element peek map basic operations val put object key val get object key val remove object key boolean containskey object key boolean containsvalue object value int size boolean isempty bulk services void putall map extends key extends val map void clear map cont’d views public set key keyset public collection val values public set maps.entry key val entryset examples iteration over a map for map.entry vtype elem map.entryset system.out.print element.getkey element.getvalue to find if a map contains another map if map۱.entryset .containsall map۲.entryset if two map objects contain same keys if map۱.keyset .equals map۲.keyset to find out common keys behave two map objects set ktype common keys new hashset ktype map۱.commonkeys.retainall map۲.keyset map implementations performance increases map hashmap treemap linkedlist hashtable sortedset sortedset stores elements in ascending order as per the natural ordering or as defined by a comparator provided at instantiation time. also the iterator and toarray methods iterate and return array in sorted order. additional services provided sortedset element subset element fromelement element toelement sortedset element headset element toelement sortedset element tailset element fromelement element first element last comparator super element comparator sortedmap organizes data in ascending order based on natural ordering of the keys or a comparator supplied at instantiation time. services provided in addition to map interface comparator super key comparator sortedmap key value submap key from key to sortedmap key value headmap key to sortedmap key value tailmap key from key firstkey key lastkey map pitfalls threadsafety the bulk operations like keyset values and entryset return collections that can be modified automatically when the underlying collection changes. threadsafety collections by default are not threadsafe in order to achieve thread safety the following utility methods from collection can be employed. encapsulation implementation style where the access to the collection is only from a thread safe client synchronization collections.synchronizedlist new linkedlist … unmodifiable collections.unmodifiablelist new linkedlist … fail safe iterator using fail safe iterators makes sure the collection is not modified as it is iterated. bibliography http java.sun.com docs books tutorial collections index.html http www.purpletech.com talks collections.ppt …

کلمات کلیدی پرکاربرد در این اسلاید پاورپوینت: منظومه (collection), عنصر (element), کلید (key), غروب کردن (set), فضال (interface), مقصود (object), فهرست (list), نقشه (map), امر (order), برشته کشیدن (string),

این فایل پاورپوینت شامل ۲۴  اسلاید و به زبان انگلیسی و حجم آن ۰٫۱۳ مگا بایت است. نوع قالب فایل ppt بوده که با این لینک قابل دانلود است. این مطلب برگرفته از سایت زیر است و مسئولیت انتشار آن با منبع اصلی می باشد که در تاریخ ۲۰۱۸/۱۱/۰۲ ۰۴:۴۶:۱۰ استخراج شده است.

https://web.njit.edu/~gblank/cs602/Collections.ppt

  • جهت آموزش های پاورپوینت بر روی اینجا کلیک کنید.
  • جهت دانلود رایگان قالب های حرفه ای پاورپوینت بر روی اینجا کلیک کنید.

پاسخی بگذارید

نشانی ایمیل شما منتشر نخواهد شد. بخش‌های موردنیاز علامت‌گذاری شده‌اند *