Home
last modified time | relevance | path

Searched refs:lhs (Results 1 – 25 of 29) sorted by relevance

12

/sqlite-3.40.0/test/
H A Dtkt3997.test19 proc reverse {lhs rhs} {
20 return [string compare $rhs $lhs]
22 proc usual {lhs rhs} {
23 return [string compare $lhs $rhs]
H A Dcollate1.test37 proc hex_collate {lhs rhs} {
38 set lhs_ishex [regexp {^(0x|)[1234567890abcdefABCDEF]+$} $lhs]
41 set lhsx [scan $lhs %x]
43 if {$lhs < $rhs} {return -1}
44 if {$lhs == $rhs} {return 0}
45 if {$lhs > $rhs} {return 1}
53 return [string compare $lhs $rhs]
59 proc numeric_collate {lhs rhs} {
60 if {$lhs == $rhs} {return 0}
61 return [expr ($lhs>$rhs)?1:-1]
H A Dcollate9.test21 proc reverse_sort {lhs rhs} {
22 return [string compare $rhs $lhs]
149 proc reverse_sort {lhs rhs} {
150 return [string compare $lhs $rhs]
H A De_reindex.test99 proc sort_by_length {lhs rhs} {
100 set res [expr {[string length $lhs] - [string length $rhs]}]
102 return [string compare $lhs $rhs]
105 proc sort_by_value {lhs rhs} {
107 set res [expr {$V($lhs) - $V($rhs)}]
109 return [string compare $lhs $rhs]
H A Dvacuum2.test237 proc cmp {lhs rhs} { string compare $lhs $rhs }
247 proc cmp {lhs rhs} { string compare $rhs $lhs }
H A Dfts3expr2.test124 set lhs [lindex $tree 1]
126 set zLeft [tree_to_expr $lhs $all_brackets $implicit_and]
134 catch {set iLeftPrec $prec([lindex $lhs 0])}
H A Drowvalue2.test261 foreach {tn lhs rhs} {
269 set e1 [make_expr1 $lhs $rhs $op]
270 set e2 [make_expr2 $lhs $rhs $op]
H A Dcollate5.test39 proc numeric_collate {lhs rhs} {
40 if {$lhs == $rhs} {return 0}
41 return [expr ($lhs>$rhs)?1:-1]
H A Drandexpr1.tcl217 proc inop {lhs args} {
223 proc betweenop {lhs first second} {
H A Dskipscan5.test72 proc test_collate {enc lhs rhs} {
73 string compare $lhs $rhs
H A Denc2.test199 proc test_collate {enc lhs rhs} {
201 set l [lsearch -exact $::values $lhs]
204 # puts "enc=$enc lhs=$lhs/$l rhs=$rhs/$r res=$res"
H A De_expr.test282 foreach {n2 lhs} $literals {
284 set t [db one " SELECT typeof($lhs $op $rhs) "]
330 foreach {n2 lhs} $literals {
331 if {$rhs!="NULL" && $lhs!="NULL"} {
332 set eq [execsql "SELECT $lhs = $rhs, $lhs != $rhs"]
334 set eq [list [expr {$lhs=="NULL" && $rhs=="NULL"}] \
335 [expr {$lhs!="NULL" || $rhs!="NULL"}]
339 do_execsql_test $test.1 "SELECT $lhs IS $rhs, $lhs IS NOT $rhs" $eq
341 SELECT ($lhs IS $rhs) IS NULL, ($lhs IS NOT $rhs) IS NULL
1303 proc reverse {lhs rhs} {
[all …]
H A Dcollate3.test417 proc numeric_compare {lhs rhs} {
418 if {$rhs > $lhs} {
421 set res [expr ($lhs > $rhs)?1:0]
H A Dcollate4.test559 proc numeric_collate {lhs rhs} {
560 if {$lhs == $rhs} {return 0}
561 return [expr ($lhs>$rhs)?1:-1]
H A Dmisc1.test22 proc numeric_collate {lhs rhs} {
23 if {$lhs == $rhs} {return 0}
24 return [expr ($lhs>$rhs)?1:-1]
29 proc numeric_collate {lhs rhs} {
30 return [string compare $lhs $rhs]
H A Dselect9.test266 proc reverse {lhs rhs} {
267 return [string compare $rhs $lhs]
H A Dvtab1.test47 # vtab1-18.*: Check that the LIKE optimization is not applied when the lhs
449 #proc test_match {lhs rhs} {
450 # lappend ::echo_module MATCH $lhs $rhs
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c1105 pSeg = &pLevel->pNext->lhs; in sortedSplitkeySegment()
1298 && pPtr->pSeg==&pLvl->lhs in segmentPtrEnd()
2783 if( pPtr->pSeg==&pLvl->lhs ){ in mcursorLocationOk()
3475 pSeg = &pMW->pLevel->lhs; in mergeWorkerLoadHierarchy()
3759 pMW->pLevel->lhs.iRoot = iPtr; in mergeWorkerFinishHierarchy()
3971 pSeg = &pMW->pLevel->lhs; in mergeWorkerWrite()
4364 pLinked = &pNext->lhs; in sortedNewToplevel()
4441 assertBtreeOk(pDb, &pNew->lhs); in sortedNewToplevel()
4503 pNew->aRhs[i] = p->lhs; in sortedMergeSetup()
4593 if( pLevel->lhs.iFirst==0 ){ in mergeWorkerInit()
[all …]
H A Dlsm_ckpt.c331 ckptExportSegment(&pLevel->lhs, p, &iOut, pRc); in ckptExportLevel()
585 ckptNewSegment(aIn, &iIn, &pLevel->lhs); in ckptLoadLevels()
1008 pLvl->lhs.pRedirect = &pNew->redirect; in lsmCheckpointDeserialize()
H A Dlsm_file.c1713 if( fsRunEndsBetween(&pLevel->lhs, pIgnore, iFirst, iLast) ){ in fsLevelEndsBetween()
2108 Segment *p = &pLvl->lhs; in lsmFsSortedAppend()
2956 if( 0==(pSeg = startsWith(&pLvl->lhs, iFirst)) ){ in findSegment()
3277 checkBlocks(pFS, &pLevel->lhs, (pLevel->nRight!=0), nBlock, aUsed); in lsmFsIntegrityCheck()
/sqlite-3.40.0/tool/
H A Dlemon.c874 s1 = rp->lhs; in FindFirstSets()
918 sp = lemp->startRule->lhs; in FindStates()
921 sp = lemp->startRule->lhs; in FindStates()
1186 sp = lemp->startRule->lhs; in FindActions()
1189 sp = lemp->startRule->lhs; in FindActions()
2276 psp->lhs = Symbol_new(x); in parseonetoken()
2342 psp->lhs->name); in parseonetoken()
2354 x,psp->lhs->name); in parseonetoken()
2400 rp->lhs = psp->lhs; in parseonetoken()
2408 rp->lhs->rule = rp; in parseonetoken()
[all …]
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5multi.test68 set lhs "( $e1 )"
70 set lhs "$c1 : ( $e1 )"
78 set q1 "t1 MATCH '($lhs) AND ($rhs)'"
H A Dfts5_common.tcl356 proc instcompare {lhs rhs} {
357 foreach {p1 c1 o1} [split $lhs .] {}
/sqlite-3.40.0/ext/fts5/
H A Dmkportersteps.tcl91 proc sort_cb {lhs rhs} {
92 set L [string range [lindex $lhs 0] end-1 end-1]
/sqlite-3.40.0/src/
H A Dvdbeaux.c4597 if( lhs<rhs ){ in sqlite3VdbeRecordCompareWithSkip()
4766 i64 lhs; in vdbeRecordCompareInt() local
4773 testcase( lhs<0 ); in vdbeRecordCompareInt()
4778 testcase( lhs<0 ); in vdbeRecordCompareInt()
4783 testcase( lhs<0 ); in vdbeRecordCompareInt()
4789 testcase( lhs<0 ); in vdbeRecordCompareInt()
4800 lhs = *(i64*)&x; in vdbeRecordCompareInt()
4805 lhs = 0; in vdbeRecordCompareInt()
4808 lhs = 1; in vdbeRecordCompareInt()
4826 if( v>lhs ){ in vdbeRecordCompareInt()
[all …]

12