github.com/siglens/siglens@v0.0.0-20240328180423-f7ce9ae441ed/pkg/segment/segexecutionsort_test.go (about)

     1  /*
     2  Copyright 2023.
     3  
     4  Licensed under the Apache License, Version 2.0 (the "License");
     5  you may not use this file except in compliance with the License.
     6  You may obtain a copy of the License at
     7  
     8      http://www.apache.org/licenses/LICENSE-2.0
     9  
    10  Unless required by applicable law or agreed to in writing, software
    11  distributed under the License is distributed on an "AS IS" BASIS,
    12  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    13  See the License for the specific language governing permissions and
    14  limitations under the License.
    15  */
    16  
    17  package segment
    18  
    19  import (
    20  	"os"
    21  	"testing"
    22  
    23  	dtu "github.com/siglens/siglens/pkg/common/dtypeutils"
    24  	"github.com/siglens/siglens/pkg/config"
    25  	"github.com/siglens/siglens/pkg/segment/query"
    26  	"github.com/siglens/siglens/pkg/segment/query/metadata"
    27  	"github.com/siglens/siglens/pkg/segment/structs"
    28  	"github.com/siglens/siglens/pkg/segment/utils"
    29  	serverutils "github.com/siglens/siglens/pkg/server/utils"
    30  	log "github.com/sirupsen/logrus"
    31  	"github.com/stretchr/testify/assert"
    32  )
    33  
    34  func Test_SortResultsArossMultipleFiles(t *testing.T) {
    35  	config.InitializeTestingConfig()
    36  	_ = query.InitQueryNode(getMyIds, serverutils.ExtractKibanaRequests)
    37  	numBuffers := 5
    38  	numEntriesForBuffer := 10
    39  	fileCount := 10
    40  	dir := "data/"
    41  	metadata.InitMockColumnarMetadataStore(dir, fileCount, numBuffers, numEntriesForBuffer)
    42  
    43  	value1, _ := utils.CreateDtypeEnclosure("*", 0)
    44  	valueFilter := structs.FilterCriteria{
    45  		ExpressionFilter: &structs.ExpressionFilter{
    46  			LeftInput:      &structs.FilterInput{Expression: &structs.Expression{LeftInput: &structs.ExpressionInput{ColumnName: "*"}}},
    47  			FilterOperator: utils.Equals,
    48  			RightInput:     &structs.FilterInput{Expression: &structs.Expression{LeftInput: &structs.ExpressionInput{ColumnValue: value1}}},
    49  		},
    50  	}
    51  	timeRange := &dtu.TimeRange{
    52  		StartEpochMs: 0,
    53  		EndEpochMs:   uint64(numEntriesForBuffer),
    54  	}
    55  	simpleNode := &structs.ASTNode{
    56  		AndFilterCondition: &structs.Condition{FilterCriteria: []*structs.FilterCriteria{&valueFilter}},
    57  		TimeRange:          timeRange,
    58  	}
    59  
    60  	descendingSort := &structs.QueryAggregators{
    61  		Sort: &structs.SortRequest{
    62  			ColName:   "key9",
    63  			Ascending: false,
    64  		},
    65  	}
    66  	sizeLimit := uint64(100)
    67  	qc := structs.InitQueryContext("evts", sizeLimit, 0, 0, false)
    68  	result := ExecuteQuery(simpleNode, descendingSort, 1010, qc)
    69  	log.Infof("%d result %+v %+v", 1010, result, result.TotalResults)
    70  	descendingResults := make([]float64, 0)
    71  	for _, v := range result.AllRecords {
    72  		descendingResults = append(descendingResults, v.SortColumnValue)
    73  	}
    74  
    75  	assert.Len(t, descendingResults, int(sizeLimit), "count results")
    76  	lastVal := descendingResults[0]
    77  	for i := 1; i < len(descendingResults); i++ {
    78  		assert.True(t, descendingResults[i] <= lastVal, "descending order, so index should be less than last result")
    79  		lastVal = descendingResults[i]
    80  	}
    81  
    82  	asendingSort := &structs.QueryAggregators{
    83  		Sort: &structs.SortRequest{
    84  			ColName:   "key9",
    85  			Ascending: true,
    86  		},
    87  	}
    88  	result = ExecuteQuery(simpleNode, asendingSort, 1, qc)
    89  	ascendingResults := make([]float64, 0)
    90  	for _, v := range result.AllRecords {
    91  		ascendingResults = append(ascendingResults, v.SortColumnValue)
    92  	}
    93  
    94  	assert.Len(t, ascendingResults, int(sizeLimit), "count results")
    95  	lastVal = ascendingResults[0]
    96  	for i := 1; i < len(ascendingResults); i++ {
    97  		assert.True(t, ascendingResults[i] >= lastVal, "ascending order, so index should be greater than last result")
    98  		lastVal = ascendingResults[i]
    99  	}
   100  
   101  	os.RemoveAll(dir)
   102  }