Show simple item record

dc.contributor.authorFrias Moya, Leonor
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-05-25T11:57:35Z
dc.date.available2016-05-25T11:57:35Z
dc.date.issued2005-11
dc.identifier.citationFrias, L. "Extending STL maps using LBSTs". 2005.
dc.identifier.urihttp://hdl.handle.net/2117/87314
dc.description.abstractAssociative containers are basic generic classes of the C++ standard library. Access to the elements can be done by key or iterator, but not by rank. This paper presents a new implementation of the map class, which extends the Standard with the ability to support efficient direct access by rank without using extra space. This is achieved using LBST trees. This document reports on the algorithmic engineering of this implementation as well as, experimental results that show its competitive performance compared to the widespread GCC library map implementation.
dc.format.extent19 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-05-48-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherDictionary
dc.subject.otherRank operations
dc.subject.otherLogarithmic binary SearchTrees
dc.subject.otherSTL
dc.titleExtending STL maps using LBSTs
dc.typeExternal research report
dc.rights.accessOpen Access
drac.iddocument18536063
dc.description.versionPostprint (published version)
upcommons.citation.authorFrias, L.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder