2020-02-11 12:13:17 +00:00
|
|
|
// Copyright 2017 The Prometheus Authors
|
2020-02-03 19:50:54 +00:00
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
package promql
|
|
|
|
|
|
|
|
import (
|
|
|
|
"encoding/json"
|
2022-06-08 08:47:52 +00:00
|
|
|
"errors"
|
2020-02-03 19:50:54 +00:00
|
|
|
"fmt"
|
|
|
|
"strconv"
|
|
|
|
"strings"
|
|
|
|
|
Style cleanup of all the changes in sparsehistogram so far
A lot of this code was hacked together, literally during a
hackathon. This commit intends not to change the code substantially,
but just make the code obey the usual style practices.
A (possibly incomplete) list of areas:
* Generally address linter warnings.
* The `pgk` directory is deprecated as per dev-summit. No new packages should
be added to it. I moved the new `pkg/histogram` package to `model`
anticipating what's proposed in #9478.
* Make the naming of the Sparse Histogram more consistent. Including
abbreviations, there were just too many names for it: SparseHistogram,
Histogram, Histo, hist, his, shs, h. The idea is to call it "Histogram" in
general. Only add "Sparse" if it is needed to avoid confusion with
conventional Histograms (which is rare because the TSDB really has no notion
of conventional Histograms). Use abbreviations only in local scope, and then
really abbreviate (not just removing three out of seven letters like in
"Histo"). This is in the spirit of
https://github.com/golang/go/wiki/CodeReviewComments#variable-names
* Several other minor name changes.
* A lot of formatting of doc comments. For one, following
https://github.com/golang/go/wiki/CodeReviewComments#comment-sentences
, but also layout question, anticipating how things will look like
when rendered by `godoc` (even where `godoc` doesn't render them
right now because they are for unexported types or not a doc comment
at all but just a normal code comment - consistency is queen!).
* Re-enabled `TestQueryLog` and `TestEndopints` (they pass now,
leaving them disabled was presumably an oversight).
* Bucket iterator for histogram.Histogram is now created with a
method.
* HistogramChunk.iterator now allows iterator recycling. (I think
@dieterbe only commented it out because he was confused by the
question in the comment.)
* HistogramAppender.Append panics now because we decided to treat
staleness marker differently.
Signed-off-by: beorn7 <beorn@grafana.com>
2021-10-09 13:57:07 +00:00
|
|
|
"github.com/prometheus/prometheus/model/histogram"
|
2021-11-08 14:23:17 +00:00
|
|
|
"github.com/prometheus/prometheus/model/labels"
|
2020-02-03 19:50:54 +00:00
|
|
|
"github.com/prometheus/prometheus/promql/parser"
|
|
|
|
"github.com/prometheus/prometheus/storage"
|
2020-10-22 09:00:08 +00:00
|
|
|
"github.com/prometheus/prometheus/tsdb/chunkenc"
|
2020-02-03 19:50:54 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
func (Matrix) Type() parser.ValueType { return parser.ValueTypeMatrix }
|
|
|
|
func (Vector) Type() parser.ValueType { return parser.ValueTypeVector }
|
|
|
|
func (Scalar) Type() parser.ValueType { return parser.ValueTypeScalar }
|
|
|
|
func (String) Type() parser.ValueType { return parser.ValueTypeString }
|
|
|
|
|
|
|
|
// String represents a string value.
|
|
|
|
type String struct {
|
|
|
|
T int64
|
|
|
|
V string
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s String) String() string {
|
|
|
|
return s.V
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s String) MarshalJSON() ([]byte, error) {
|
|
|
|
return json.Marshal([...]interface{}{float64(s.T) / 1000, s.V})
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scalar is a data point that's explicitly not associated with a metric.
|
|
|
|
type Scalar struct {
|
|
|
|
T int64
|
|
|
|
V float64
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s Scalar) String() string {
|
|
|
|
v := strconv.FormatFloat(s.V, 'f', -1, 64)
|
|
|
|
return fmt.Sprintf("scalar: %v @[%v]", v, s.T)
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s Scalar) MarshalJSON() ([]byte, error) {
|
|
|
|
v := strconv.FormatFloat(s.V, 'f', -1, 64)
|
|
|
|
return json.Marshal([...]interface{}{float64(s.T) / 1000, v})
|
|
|
|
}
|
|
|
|
|
|
|
|
// Series is a stream of data points belonging to a metric.
|
|
|
|
type Series struct {
|
2022-04-14 17:46:56 +00:00
|
|
|
Metric labels.Labels
|
|
|
|
Points []Point
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func (s Series) String() string {
|
|
|
|
vals := make([]string, len(s.Points))
|
|
|
|
for i, v := range s.Points {
|
|
|
|
vals[i] = v.String()
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("%s =>\n%s", s.Metric, strings.Join(vals, "\n"))
|
|
|
|
}
|
|
|
|
|
2022-04-17 23:46:26 +00:00
|
|
|
// MarshalJSON is mirrored in web/api/v1/api.go for efficiency reasons.
|
|
|
|
// This implementation is still provided for debug purposes and usage
|
|
|
|
// without jsoniter.
|
2022-04-14 17:46:56 +00:00
|
|
|
func (s Series) MarshalJSON() ([]byte, error) {
|
|
|
|
// Note that this is rather inefficient because it re-creates the whole
|
|
|
|
// series, just separated by Histogram Points and Value Points. For API
|
|
|
|
// purposes, there is a more efficcient jsoniter implementation in
|
|
|
|
// web/api/v1/api.go.
|
|
|
|
series := struct {
|
|
|
|
M labels.Labels `json:"metric"`
|
|
|
|
V []Point `json:"values,omitempty"`
|
|
|
|
H []Point `json:"histograms,omitempty"`
|
|
|
|
}{
|
|
|
|
M: s.Metric,
|
|
|
|
}
|
|
|
|
for _, p := range s.Points {
|
|
|
|
if p.H == nil {
|
|
|
|
series.V = append(series.V, p)
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
series.H = append(series.H, p)
|
|
|
|
}
|
|
|
|
return json.Marshal(series)
|
|
|
|
}
|
|
|
|
|
2020-02-03 19:50:54 +00:00
|
|
|
// Point represents a single data point for a given timestamp.
|
2021-11-02 15:01:32 +00:00
|
|
|
// If H is not nil, then this is a histogram point and only (T, H) is valid.
|
|
|
|
// If H is nil, then only (T, V) is valid.
|
2020-02-03 19:50:54 +00:00
|
|
|
type Point struct {
|
|
|
|
T int64
|
|
|
|
V float64
|
2021-11-29 07:54:23 +00:00
|
|
|
H *histogram.FloatHistogram
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func (p Point) String() string {
|
2021-11-15 19:36:44 +00:00
|
|
|
var s string
|
|
|
|
if p.H != nil {
|
|
|
|
s = p.H.String()
|
|
|
|
} else {
|
|
|
|
s = strconv.FormatFloat(p.V, 'f', -1, 64)
|
|
|
|
}
|
|
|
|
return fmt.Sprintf("%s @[%v]", s, p.T)
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// MarshalJSON implements json.Marshaler.
|
2021-11-25 12:32:37 +00:00
|
|
|
//
|
|
|
|
// JSON marshaling is only needed for the HTTP API. Since Point is such a
|
|
|
|
// frequently marshaled type, it gets an optimized treatment directly in
|
|
|
|
// web/api/v1/api.go. Therefore, this method is unused within Prometheus. It is
|
|
|
|
// still provided here as convenience for debugging and for other users of this
|
|
|
|
// code. Also note that the different marshaling implementations might lead to
|
|
|
|
// slightly different results in terms of formatting and rounding of the
|
|
|
|
// timestamp.
|
2020-02-03 19:50:54 +00:00
|
|
|
func (p Point) MarshalJSON() ([]byte, error) {
|
2022-04-14 17:46:56 +00:00
|
|
|
if p.H == nil {
|
|
|
|
v := strconv.FormatFloat(p.V, 'f', -1, 64)
|
|
|
|
return json.Marshal([...]interface{}{float64(p.T) / 1000, v})
|
|
|
|
}
|
|
|
|
h := struct {
|
|
|
|
Count string `json:"count"`
|
|
|
|
Sum string `json:"sum"`
|
|
|
|
Buckets [][]interface{} `json:"buckets,omitempty"`
|
|
|
|
}{
|
|
|
|
Count: strconv.FormatFloat(p.H.Count, 'f', -1, 64),
|
|
|
|
Sum: strconv.FormatFloat(p.H.Sum, 'f', -1, 64),
|
|
|
|
}
|
|
|
|
it := p.H.AllBucketIterator()
|
|
|
|
for it.Next() {
|
|
|
|
bucket := it.At()
|
2022-05-03 16:18:55 +00:00
|
|
|
if bucket.Count == 0 {
|
|
|
|
continue // No need to expose empty buckets in JSON.
|
|
|
|
}
|
2022-04-14 17:46:56 +00:00
|
|
|
boundaries := 2 // Exclusive on both sides AKA open interval.
|
|
|
|
if bucket.LowerInclusive {
|
|
|
|
if bucket.UpperInclusive {
|
|
|
|
boundaries = 3 // Inclusive on both sides AKA closed interval.
|
|
|
|
} else {
|
|
|
|
boundaries = 1 // Inclusive only on lower end AKA right open.
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if bucket.UpperInclusive {
|
|
|
|
boundaries = 0 // Inclusive only on upper end AKA left open.
|
|
|
|
}
|
|
|
|
}
|
|
|
|
bucketToMarshal := []interface{}{
|
|
|
|
boundaries,
|
|
|
|
strconv.FormatFloat(bucket.Lower, 'f', -1, 64),
|
|
|
|
strconv.FormatFloat(bucket.Upper, 'f', -1, 64),
|
|
|
|
strconv.FormatFloat(bucket.Count, 'f', -1, 64),
|
|
|
|
}
|
|
|
|
h.Buckets = append(h.Buckets, bucketToMarshal)
|
|
|
|
}
|
|
|
|
return json.Marshal([...]interface{}{float64(p.T) / 1000, h})
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Sample is a single sample belonging to a metric.
|
|
|
|
type Sample struct {
|
|
|
|
Point
|
|
|
|
|
|
|
|
Metric labels.Labels
|
|
|
|
}
|
|
|
|
|
|
|
|
func (s Sample) String() string {
|
|
|
|
return fmt.Sprintf("%s => %s", s.Metric, s.Point)
|
|
|
|
}
|
|
|
|
|
2022-04-17 23:46:26 +00:00
|
|
|
// MarshalJSON is mirrored in web/api/v1/api.go with jsoniter because Point
|
|
|
|
// wouldn't be marshaled with jsoniter in all cases otherwise.
|
2020-02-03 19:50:54 +00:00
|
|
|
func (s Sample) MarshalJSON() ([]byte, error) {
|
2022-04-14 17:46:56 +00:00
|
|
|
if s.Point.H == nil {
|
|
|
|
v := struct {
|
|
|
|
M labels.Labels `json:"metric"`
|
|
|
|
V Point `json:"value"`
|
|
|
|
}{
|
|
|
|
M: s.Metric,
|
|
|
|
V: s.Point,
|
|
|
|
}
|
|
|
|
return json.Marshal(v)
|
|
|
|
}
|
|
|
|
h := struct {
|
2020-02-03 19:50:54 +00:00
|
|
|
M labels.Labels `json:"metric"`
|
2022-04-14 17:46:56 +00:00
|
|
|
H Point `json:"histogram"`
|
2020-02-03 19:50:54 +00:00
|
|
|
}{
|
|
|
|
M: s.Metric,
|
2022-04-14 17:46:56 +00:00
|
|
|
H: s.Point,
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
2022-04-14 17:46:56 +00:00
|
|
|
return json.Marshal(h)
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Vector is basically only an alias for model.Samples, but the
|
|
|
|
// contract is that in a Vector, all Samples have the same timestamp.
|
|
|
|
type Vector []Sample
|
|
|
|
|
|
|
|
func (vec Vector) String() string {
|
|
|
|
entries := make([]string, len(vec))
|
|
|
|
for i, s := range vec {
|
|
|
|
entries[i] = s.String()
|
|
|
|
}
|
|
|
|
return strings.Join(entries, "\n")
|
|
|
|
}
|
|
|
|
|
|
|
|
// ContainsSameLabelset checks if a vector has samples with the same labelset
|
|
|
|
// Such a behavior is semantically undefined
|
|
|
|
// https://github.com/prometheus/prometheus/issues/4562
|
|
|
|
func (vec Vector) ContainsSameLabelset() bool {
|
2022-07-13 09:48:10 +00:00
|
|
|
switch len(vec) {
|
|
|
|
case 0, 1:
|
|
|
|
return false
|
|
|
|
case 2:
|
|
|
|
return vec[0].Metric.Hash() == vec[1].Metric.Hash()
|
|
|
|
default:
|
|
|
|
l := make(map[uint64]struct{}, len(vec))
|
|
|
|
for _, ss := range vec {
|
|
|
|
hash := ss.Metric.Hash()
|
|
|
|
if _, ok := l[hash]; ok {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
l[hash] = struct{}{}
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
2022-07-13 09:48:10 +00:00
|
|
|
return false
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Matrix is a slice of Series that implements sort.Interface and
|
|
|
|
// has a String method.
|
|
|
|
type Matrix []Series
|
|
|
|
|
|
|
|
func (m Matrix) String() string {
|
|
|
|
// TODO(fabxc): sort, or can we rely on order from the querier?
|
|
|
|
strs := make([]string, len(m))
|
|
|
|
|
|
|
|
for i, ss := range m {
|
|
|
|
strs[i] = ss.String()
|
|
|
|
}
|
|
|
|
|
|
|
|
return strings.Join(strs, "\n")
|
|
|
|
}
|
|
|
|
|
|
|
|
// TotalSamples returns the total number of samples in the series within a matrix.
|
|
|
|
func (m Matrix) TotalSamples() int {
|
|
|
|
numSamples := 0
|
|
|
|
for _, series := range m {
|
|
|
|
numSamples += len(series.Points)
|
|
|
|
}
|
|
|
|
return numSamples
|
|
|
|
}
|
|
|
|
|
|
|
|
func (m Matrix) Len() int { return len(m) }
|
|
|
|
func (m Matrix) Less(i, j int) bool { return labels.Compare(m[i].Metric, m[j].Metric) < 0 }
|
|
|
|
func (m Matrix) Swap(i, j int) { m[i], m[j] = m[j], m[i] }
|
|
|
|
|
2021-07-29 10:38:11 +00:00
|
|
|
// ContainsSameLabelset checks if a matrix has samples with the same labelset.
|
|
|
|
// Such a behavior is semantically undefined.
|
2020-02-03 19:50:54 +00:00
|
|
|
// https://github.com/prometheus/prometheus/issues/4562
|
|
|
|
func (m Matrix) ContainsSameLabelset() bool {
|
2022-07-13 09:48:10 +00:00
|
|
|
switch len(m) {
|
|
|
|
case 0, 1:
|
|
|
|
return false
|
|
|
|
case 2:
|
|
|
|
return m[0].Metric.Hash() == m[1].Metric.Hash()
|
|
|
|
default:
|
|
|
|
l := make(map[uint64]struct{}, len(m))
|
|
|
|
for _, ss := range m {
|
|
|
|
hash := ss.Metric.Hash()
|
|
|
|
if _, ok := l[hash]; ok {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
l[hash] = struct{}{}
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
2022-07-13 09:48:10 +00:00
|
|
|
return false
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Result holds the resulting value of an execution or an error
|
|
|
|
// if any occurred.
|
|
|
|
type Result struct {
|
|
|
|
Err error
|
|
|
|
Value parser.Value
|
|
|
|
Warnings storage.Warnings
|
|
|
|
}
|
|
|
|
|
|
|
|
// Vector returns a Vector if the result value is one. An error is returned if
|
|
|
|
// the result was an error or the result value is not a Vector.
|
|
|
|
func (r *Result) Vector() (Vector, error) {
|
|
|
|
if r.Err != nil {
|
|
|
|
return nil, r.Err
|
|
|
|
}
|
|
|
|
v, ok := r.Value.(Vector)
|
|
|
|
if !ok {
|
|
|
|
return nil, errors.New("query result is not a Vector")
|
|
|
|
}
|
|
|
|
return v, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Matrix returns a Matrix. An error is returned if
|
|
|
|
// the result was an error or the result value is not a Matrix.
|
|
|
|
func (r *Result) Matrix() (Matrix, error) {
|
|
|
|
if r.Err != nil {
|
|
|
|
return nil, r.Err
|
|
|
|
}
|
|
|
|
v, ok := r.Value.(Matrix)
|
|
|
|
if !ok {
|
|
|
|
return nil, errors.New("query result is not a range Vector")
|
|
|
|
}
|
|
|
|
return v, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// Scalar returns a Scalar value. An error is returned if
|
|
|
|
// the result was an error or the result value is not a Scalar.
|
|
|
|
func (r *Result) Scalar() (Scalar, error) {
|
|
|
|
if r.Err != nil {
|
|
|
|
return Scalar{}, r.Err
|
|
|
|
}
|
|
|
|
v, ok := r.Value.(Scalar)
|
|
|
|
if !ok {
|
|
|
|
return Scalar{}, errors.New("query result is not a Scalar")
|
|
|
|
}
|
|
|
|
return v, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
func (r *Result) String() string {
|
|
|
|
if r.Err != nil {
|
|
|
|
return r.Err.Error()
|
|
|
|
}
|
|
|
|
if r.Value == nil {
|
|
|
|
return ""
|
|
|
|
}
|
|
|
|
return r.Value.String()
|
|
|
|
}
|
|
|
|
|
|
|
|
// StorageSeries simulates promql.Series as storage.Series.
|
|
|
|
type StorageSeries struct {
|
|
|
|
series Series
|
|
|
|
}
|
|
|
|
|
|
|
|
// NewStorageSeries returns a StorageSeries from a Series.
|
|
|
|
func NewStorageSeries(series Series) *StorageSeries {
|
|
|
|
return &StorageSeries{
|
|
|
|
series: series,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ss *StorageSeries) Labels() labels.Labels {
|
|
|
|
return ss.series.Metric
|
|
|
|
}
|
|
|
|
|
|
|
|
// Iterator returns a new iterator of the data of the series.
|
2020-02-06 15:58:38 +00:00
|
|
|
func (ss *StorageSeries) Iterator() chunkenc.Iterator {
|
2020-02-03 19:50:54 +00:00
|
|
|
return newStorageSeriesIterator(ss.series)
|
|
|
|
}
|
|
|
|
|
|
|
|
type storageSeriesIterator struct {
|
|
|
|
points []Point
|
|
|
|
curr int
|
|
|
|
}
|
|
|
|
|
|
|
|
func newStorageSeriesIterator(series Series) *storageSeriesIterator {
|
|
|
|
return &storageSeriesIterator{
|
|
|
|
points: series.Points,
|
|
|
|
curr: -1,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-11-29 07:54:23 +00:00
|
|
|
func (ssi *storageSeriesIterator) Seek(t int64) chunkenc.ValueType {
|
2020-02-03 19:50:54 +00:00
|
|
|
i := ssi.curr
|
|
|
|
if i < 0 {
|
|
|
|
i = 0
|
|
|
|
}
|
|
|
|
for ; i < len(ssi.points); i++ {
|
2021-11-29 07:54:23 +00:00
|
|
|
p := ssi.points[i]
|
|
|
|
if p.T >= t {
|
2020-02-03 19:50:54 +00:00
|
|
|
ssi.curr = i
|
2021-11-29 07:54:23 +00:00
|
|
|
if p.H != nil {
|
|
|
|
return chunkenc.ValFloatHistogram
|
|
|
|
}
|
|
|
|
return chunkenc.ValFloat
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
ssi.curr = len(ssi.points) - 1
|
2021-11-29 07:54:23 +00:00
|
|
|
return chunkenc.ValNone
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ssi *storageSeriesIterator) At() (t int64, v float64) {
|
|
|
|
p := ssi.points[ssi.curr]
|
|
|
|
return p.T, p.V
|
|
|
|
}
|
|
|
|
|
2021-11-12 18:07:41 +00:00
|
|
|
func (ssi *storageSeriesIterator) AtHistogram() (int64, *histogram.Histogram) {
|
2021-11-29 07:54:23 +00:00
|
|
|
panic(errors.New("storageSeriesIterator: AtHistogram not supported"))
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ssi *storageSeriesIterator) AtFloatHistogram() (int64, *histogram.FloatHistogram) {
|
2021-11-07 16:12:04 +00:00
|
|
|
p := ssi.points[ssi.curr]
|
2021-11-12 18:07:41 +00:00
|
|
|
return p.T, p.H
|
2021-06-29 14:38:46 +00:00
|
|
|
}
|
|
|
|
|
2021-11-29 07:54:23 +00:00
|
|
|
func (ssi *storageSeriesIterator) AtT() int64 {
|
|
|
|
p := ssi.points[ssi.curr]
|
|
|
|
return p.T
|
2021-06-30 14:48:13 +00:00
|
|
|
}
|
|
|
|
|
2021-11-29 07:54:23 +00:00
|
|
|
func (ssi *storageSeriesIterator) Next() chunkenc.ValueType {
|
2020-02-03 19:50:54 +00:00
|
|
|
ssi.curr++
|
2021-11-29 07:54:23 +00:00
|
|
|
if ssi.curr >= len(ssi.points) {
|
|
|
|
return chunkenc.ValNone
|
|
|
|
}
|
|
|
|
p := ssi.points[ssi.curr]
|
|
|
|
if p.H != nil {
|
|
|
|
return chunkenc.ValFloatHistogram
|
|
|
|
}
|
|
|
|
return chunkenc.ValFloat
|
2020-02-03 19:50:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func (ssi *storageSeriesIterator) Err() error {
|
|
|
|
return nil
|
|
|
|
}
|