Package | Description |
---|---|
net.quasardb.qdb.jni | |
net.quasardb.qdb.ts |
Modifier and Type | Field and Description |
---|---|
protected TimeRange |
qdb_ts_string_aggregation.time_range |
protected TimeRange |
qdb_ts_double_aggregation.time_range |
protected TimeRange |
qdb_ts_blob_aggregation.time_range |
Modifier and Type | Method and Description |
---|---|
TimeRange |
qdb_ts_string_aggregation.getTimeRange() |
TimeRange |
qdb_ts_double_aggregation.getTimeRange() |
TimeRange |
qdb_ts_blob_aggregation.getTimeRange() |
Modifier and Type | Method and Description |
---|---|
static int |
qdb.ts_batch_push_truncate(long handle,
long batchTable,
TimeRange[] ranges) |
static int |
qdb.ts_blob_get_ranges(long handle,
String alias,
String column,
TimeRange[] ranges,
Reference<qdb_ts_blob_point[]> points) |
static int |
qdb.ts_double_get_ranges(long handle,
String alias,
String column,
TimeRange[] ranges,
Reference<qdb_ts_double_point[]> points) |
static void |
qdb.ts_exp_batch_table_set_truncate_ranges(long batchTables,
long tableNum,
TimeRange[] ranges) |
static int |
qdb.ts_string_get_ranges(long handle,
String alias,
String column,
TimeRange[] ranges,
Reference<qdb_ts_string_point[]> points) |
static int |
qdb.ts_table_get_ranges(long handle,
long localTable,
TimeRange[] ranges) |
Constructor and Description |
---|
qdb_ts_blob_aggregation(TimeRange time_range,
long aggregation_type) |
qdb_ts_blob_aggregation(TimeRange time_range,
long aggregation_type,
long count,
qdb_ts_blob_point result) |
qdb_ts_double_aggregation(TimeRange time_range,
long aggregation_type) |
qdb_ts_double_aggregation(TimeRange time_range,
long aggregation_type,
long count,
qdb_ts_double_point result) |
qdb_ts_string_aggregation(TimeRange time_range,
long aggregation_type) |
qdb_ts_string_aggregation(TimeRange time_range,
long aggregation_type,
long count,
qdb_ts_string_point result) |
Modifier and Type | Method and Description |
---|---|
static TimeRange |
TimeRange.intersect(TimeRange lhs,
TimeRange rhs)
Returns the intersection of two time ranges, that is, the widest possible range that
is contained by both time ranges.
|
static TimeRange |
TimeRange.merge(TimeRange r,
Timespec t)
Merges a new timespec into this time range, and widens the time range if necessary
to be wide enough to contain this time point.
|
static TimeRange |
TimeRange.union(TimeRange lhs,
TimeRange rhs)
Returns the union of two time ranges, that is, the range that can contain both
time ranges.
|
TimeRange |
TimeRange.withBegin(Timespec b)
Returns a copy of this timerange with a different begin.
|
TimeRange |
TimeRange.withEnd(Timespec e)
Returns a copy of this timerange with a different end.
|
Modifier and Type | Method and Description |
---|---|
void |
Writer.flush(TimeRange range)
Flush with specific time range, only useful in the context of a truncate push mode.
|
void |
Writer.flush(TimeRange[] ranges)
Flush with specific time range, only useful in the context of a truncate push mode.
|
void |
ExpWriter.flush(TimeRange[] ranges) |
QueryBuilder |
QueryBuilder.in(TimeRange range)
Adds clause that limits a query's results to a
timerange.
|
static TimeRange |
TimeRange.intersect(TimeRange lhs,
TimeRange rhs)
Returns the intersection of two time ranges, that is, the widest possible range that
is contained by both time ranges.
|
static TimeRange |
TimeRange.merge(TimeRange r,
Timespec t)
Merges a new timespec into this time range, and widens the time range if necessary
to be wide enough to contain this time point.
|
void |
ExpWriter.prepareFlush(TimeRange[] ranges) |
static Reader |
Table.reader(Session session,
String name,
TimeRange[] ranges)
Initializes new reader for a timeseries table.
|
static Reader |
Table.reader(Session session,
Table table,
TimeRange[] ranges)
Initializes new reader for a timeseries table.
|
static TimeRange |
TimeRange.union(TimeRange lhs,
TimeRange rhs)
Returns the union of two time ranges, that is, the range that can contain both
time ranges.
|
Constructor and Description |
---|
Reader(Session session,
Table table,
TimeRange[] ranges) |
Copyright © 2021. All rights reserved.