"all arguments in '...' must be Ranges objects"
### Equivalent to, but much faster than, 'endoapply(x, range)'.
## 'x_start' and 'x_end' are CompressedIntegerList objects with the
"the XVector package is required by the \"range\" method "
## 'sv' and 'ev' are XIntegerViews objects (see XVector package).
"'drop.empty.ranges' must be TRUE or FALSE"
"'min.gapwidth' must be a single integer"
"'with.inframe.attrib' must be TRUE or FALSE"
### 'with.inframe.attrib' is ignored for now.
"'with.inframe.attrib' argument not yet supported "
"when reducing a CompressedIRangesList object"
"'with.mapping' muse be FALSE in 'reduce,IntervalForest'"
"'start' must be an integer vector or NA"
## starts: original starts and end+1 when inside another interval
## ends: original ends and start-1 when inside another interval
## unlist CompressedIntegerList, with integer(0) as 0
## make intervals disjoint by segregating them into separate Ranges
# minimize work for sorted ranges (common)

if (length(args) == 0L)  # should never happen
stop("all arguments in '...' must be Ranges objects")
xx <- do.call(c, lapply(args, as, "IRanges"))
y <- .Call2("IRanges_range", xx, PACKAGE="IRanges")
stop("the XVector package is required by the \"range\" method ",
is_not_empty_view <- width(sv) != 0L  # same as 'width(ev) != 0L'
as(range(as(x, "CompressedIRangesList"), ..., na.rm = na.rm),
setMethod("range", "RangedData", function(x, ..., na.rm) {
stop("'drop.empty.ranges' must be TRUE or FALSE")
stop("'min.gapwidth' must be a single integer")
stop("'with.mapping' must be TRUE or FALSE")
stop("'with.inframe.attrib' must be TRUE or FALSE")
ans <- unsafe.update(x, start=C_ans$start, width=C_ans$width,
endoapply(x, reduce, drop.empty.ranges = drop.empty.ranges,
stop("'with.inframe.attrib' argument not yet supported ",
"when reducing a CompressedIRangesList object")
ans_unlistData <- new2("IRanges", start=C_ans$start, width=C_ans$width,
stop("'drop.empty.ranges' must be FALSE in ",
stop("'with.mapping' muse be FALSE in 'reduce,IntervalForest'")
min.gapwidth = min.gapwidth, with.mapping = with.mapping,
function(x, by = character(), drop.empty.ranges=FALSE,
values[rep(i, length.out = length(rngs)), ,
new2(class(y), ranges = ranges, values = values, check = FALSE)
stop("'start' must be a single integer")
x@ranges <- gaps(ranges(x), start=start, end=end)
stop("'start' must be an integer vector or NA")
stop("'end' must be an integer vector or NA")
mendoapply(gaps, x, start = start, end = end)
if ((length(start) != 1) || (length(end) != 1)) {
as(gaps(as(x, "CompressedIRangesList"), start = start, end = end),
adj_start <- sort(unique(c(starts, ends + 1L)))
adj_end <- sort(unique(c(ends, starts - 1L)))
adj <- update(x, start=head(adj_start, -1L), end=tail(adj_end, -1L),
setMethod("disjoin", "RangesList", function(x) endoapply(x, disjoin))
w[elementLengths(x) != 0L] <- unlist(x, use.names=FALSE)
if (sum(.wunlist(width(rng) + 1)) > .Machine$integer.max)
off0 <- head(.wunlist(width(rng) + 1L), -1L)
offset <- c(1L, cumsum(off0)) - .wunlist(start(rng))
local <- unlist(shift(x, offset), use.names=FALSE)
vec <- unlist(start(shift(rng, offset)), use.names=FALSE)
if (isNotSorted(start(x))) { # minimize work for sorted ranges (common)
bins <- .Call2("Ranges_disjointBins", start(x), width(x),
setMethod("disjointBins", "RangesList", function(x) seqapply(x, disjointBins))