| Package | Description |
|---|---|
| net.lecousin.framework.io |
New java Input/Output model adding more flexibility and asynchronous operations.
|
| net.lecousin.framework.math |
Utility classes.
|
| Modifier and Type | Field and Description |
|---|---|
protected List<RangeLong> |
FragmentedSubIO.fragments |
| Modifier and Type | Method and Description |
|---|---|
protected void |
FragmentedSubIO.writeAsync(Iterator<RangeLong> it,
RangeLong r,
long p,
int done,
long pos,
ByteBuffer buffer,
Consumer<Pair<Integer,IOException>> ondone,
AsyncSupplier<Integer,IOException> sp) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
FragmentedSubIO.writeAsync(Iterator<RangeLong> it,
RangeLong r,
long p,
int done,
long pos,
ByteBuffer buffer,
Consumer<Pair<Integer,IOException>> ondone,
AsyncSupplier<Integer,IOException> sp) |
| Constructor and Description |
|---|
FragmentedSubIO(IO.Seekable io,
List<RangeLong> fragments,
boolean closeParentIOOnClose,
String description)
Constructor.
|
Readable(IO.Readable.Seekable io,
List<RangeLong> fragments,
boolean closeParentIOOnClose,
String description)
Constructor.
|
ReadWrite(T io,
List<RangeLong> fragments,
boolean closeParentIOOnClose,
String description)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
RangeLong |
RangeLong.copy() |
RangeLong |
RangeLong.intersect(RangeLong r)
Return the intersection between this range and the given range.
|
RangeLong |
RangeLong.Parser.parse(String string) |
RangeLong |
FragmentedRangeLong.removeBestRangeForSize(long size)
If a range with the exact size exists, it is returned.
|
RangeLong |
FragmentedRangeLong.removeBiggestRange()
Remove the largest range.
|
| Modifier and Type | Method and Description |
|---|---|
Pair<RangeLong,RangeLong> |
RangeLong.removeIntersect(RangeLong o)
Remove the intersection between this range and the given range, and return the range before and the range after the intersection.
|
Pair<RangeLong,RangeLong> |
RangeLong.removeIntersect(RangeLong o)
Remove the intersection between this range and the given range, and return the range before and the range after the intersection.
|
| Modifier and Type | Method and Description |
|---|---|
void |
FragmentedRangeLong.addRange(RangeLong r) |
boolean |
FragmentedRangeLong.containsOneValueIn(RangeLong range)
Return true if this fragmented range contains at least one value of the given range.
|
RangeLong |
RangeLong.intersect(RangeLong r)
Return the intersection between this range and the given range.
|
Pair<RangeLong,RangeLong> |
RangeLong.removeIntersect(RangeLong o)
Remove the intersection between this range and the given range, and return the range before and the range after the intersection.
|
| Modifier and Type | Method and Description |
|---|---|
void |
FragmentedRangeLong.addCopy(Collection<RangeLong> col)
Add the given ranges.
|
void |
FragmentedRangeLong.addRanges(Collection<RangeLong> ranges)
Add the given ranges.
|
boolean |
FragmentedRangeLong.containsOneValueIn(Collection<RangeLong> ranges)
Return true if this fragmented range contains at least one value of the given ranges.
|
| Constructor and Description |
|---|
FragmentedRangeLong(RangeLong r)
Constructor.
|
RangeLong(RangeLong copy)
Copy.
|
Copyright © 2019. All rights reserved.