ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability

หน่วยงาน Central Queensland University, Australia

รายละเอียด

ชื่อเรื่อง : Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability
นักวิจัย : Guo, Wanwu.
คำค้น : Computer software. , Programming (Mathematics) , Set theory. , Java (Computer program language) , 700102 Application tools and system utilities , 700199 Computer software and services not elsewhere classified , 230101 Mathematical Logic, Set Theory, Lattices and Combinatorics , 280401 Analysis of Algorithms and Complexity , 280301 Programming Techniques , Algorithm -- Sets -- Output format -- Java Collections -- Reusability -- Complexity
หน่วยงาน : Central Queensland University, Australia
ผู้ร่วมงาน : -
ปีพิมพ์ : 2550
อ้างอิง : http://hdl.cqu.edu.au/10018/16907 , cqu:3134
ที่มา : Guo, W 2007, 'Flexible Selection of Output Format for Sets in Java Collections: Algorithms and their Complexity and Reusability', WSEAS Transactions On Mathematics, vol. 6, no. 2, pp. 309-315.
ความเชี่ยวชาญ : -
ความสัมพันธ์ : WSEAS transactions on mathematics Athens, Greece : World Scientific and Engineering Academy and Society (WSEAS), 2007. Vol. 6, issue 2 (February 2007), p. 309-315 7 pages Refereed 1109-2769 , aCQUIRe [electronic resource] : Central Queensland University Institutional Repository.
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

Set, a collection of distinct values, is widely used in many applications. There are three applicable set classes included in the Java Collections. TreeSet produces a sorted output in ascending order whereas HashSet provides an output with random order. LinkedHashSet, a subclass of HashSet, produces an output in insertion order, but does not support the sorted output. Three algorithms are proposed in this paper to modify the existing set classes in the Java Collections so that they can provide multiple output formats for users to select from. The algorithm at application-level does not change the current configurations of the set classes, but it offers little reusability. The algorithm at method level introduces an internal method for producing sorted output into the LinkedHashTable class, in addition to its default output in insertion order. This can be achieved without change to other configurations of the class. If this method is placed in the HashSet class, users can freely choose their preferred output format from random order, insertion order, or ascending order. The algorithm at class level proposes a new LinkedTreeSet class that is implemented using both a balanced BST and a doubly linked list. The basic operations of this class may be slightly slower than that in the TreeSet class.

บรรณานุกรม :
Guo, Wanwu. . (2550). Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability.
    กรุงเทพมหานคร : Central Queensland University, Australia.
Guo, Wanwu. . 2550. "Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability".
    กรุงเทพมหานคร : Central Queensland University, Australia.
Guo, Wanwu. . "Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability."
    กรุงเทพมหานคร : Central Queensland University, Australia, 2550. Print.
Guo, Wanwu. . Flexible selection of output format for sets in Java collections : algorithms and their complexity and reusability. กรุงเทพมหานคร : Central Queensland University, Australia; 2550.