About: Inversion list

An Entity of Type: building, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, an inversion list is a data structure that describes a set of non-overlapping numeric ranges, stored in increasing order. The set is stored in an array. Every other element is the first element of a range, and every other element is the first element after that range (a half-open range). For example, for ranges 10-14, 25-37, the inversion list would be: 10 15 25 38 This data structure is used in many Unicode implementations for storing Unicode character ranges (like "Greek characters").

Property Value
dbo:abstract
  • In computer science, an inversion list is a data structure that describes a set of non-overlapping numeric ranges, stored in increasing order. The set is stored in an array. Every other element is the first element of a range, and every other element is the first element after that range (a half-open range). For example, for ranges 10-14, 25-37, the inversion list would be: 10 15 25 38 To search whether an item belongs to any of the ranges, a binary search is made. If the search ends in a "first" element, the searched item is in the set. If the search ends in an "after" element, or outside the array, the searched item is not in the set. This data structure is used in many Unicode implementations for storing Unicode character ranges (like "Greek characters"). (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 43628014 (xsd:integer)
dbo:wikiPageLength
  • 1273 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1101401624 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In computer science, an inversion list is a data structure that describes a set of non-overlapping numeric ranges, stored in increasing order. The set is stored in an array. Every other element is the first element of a range, and every other element is the first element after that range (a half-open range). For example, for ranges 10-14, 25-37, the inversion list would be: 10 15 25 38 This data structure is used in many Unicode implementations for storing Unicode character ranges (like "Greek characters"). (en)
rdfs:label
  • Inversion list (en)
owl:differentFrom
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License