<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
an	O
inversion	B-Algorithm
list	I-Algorithm
is	O
a	O
data	B-General_Concept
structure	I-General_Concept
that	O
describes	O
a	O
set	O
of	O
non-overlapping	O
numeric	O
ranges	O
,	O
stored	O
in	O
increasing	O
order	O
.	O
</s>
<s>
The	O
set	O
is	O
stored	O
in	O
an	O
array	B-Data_Structure
.	O
</s>
<s>
For	O
example	O
,	O
for	O
ranges	O
10-14	O
,	O
25-37	O
,	O
the	O
inversion	B-Algorithm
list	I-Algorithm
would	O
be	O
:	O
</s>
<s>
If	O
the	O
search	O
ends	O
in	O
an	O
"	O
after	O
"	O
element	O
,	O
or	O
outside	O
the	O
array	B-Data_Structure
,	O
the	O
searched	O
item	O
is	O
not	O
in	O
the	O
set	O
.	O
</s>
<s>
This	O
data	B-General_Concept
structure	I-General_Concept
is	O
used	O
in	O
many	O
Unicode	O
implementations	O
for	O
storing	O
Unicode	O
character	O
ranges	O
(	O
like	O
"	O
Greek	O
characters	O
"	O
)	O
.	O
</s>
