Fossil SCM
Fix to the uintnocase collating sequence. See [forum:/forumpost/56250e7ff0|forum post 56250e7ff0].
Commit
b39475b6253408c09f8af09e8517ac7c47f71e8c646d4916c47d7ed8cd5f615d
Parent
b731e1f65bae4b4…
1 file changed
+1
-2
M
src/db.c
+1
-2
| --- src/db.c | ||
| +++ src/db.c | ||
| @@ -1395,13 +1395,12 @@ | ||
| 1395 | 1395 | const unsigned char *zA = (const unsigned char*)pKey1; |
| 1396 | 1396 | const unsigned char *zB = (const unsigned char*)pKey2; |
| 1397 | 1397 | int i=0, j=0, x; |
| 1398 | 1398 | (void)notUsed; |
| 1399 | 1399 | while( i<nKey1 && j<nKey2 ){ |
| 1400 | - if( fossil_isdigit(zA[i]) ){ | |
| 1400 | + if( fossil_isdigit(zA[i]) && fossil_isdigit(zB[j]) ){ | |
| 1401 | 1401 | int k; |
| 1402 | - if( !fossil_isdigit(zB[j]) ) return x; | |
| 1403 | 1402 | while( i<nKey1 && zA[i]=='0' ){ i++; } |
| 1404 | 1403 | while( j<nKey2 && zB[j]=='0' ){ j++; } |
| 1405 | 1404 | k = 0; |
| 1406 | 1405 | while( i+k<nKey1 && fossil_isdigit(zA[i+k]) |
| 1407 | 1406 | && j+k<nKey2 && fossil_isdigit(zB[j+k]) ){ |
| 1408 | 1407 |
| --- src/db.c | |
| +++ src/db.c | |
| @@ -1395,13 +1395,12 @@ | |
| 1395 | const unsigned char *zA = (const unsigned char*)pKey1; |
| 1396 | const unsigned char *zB = (const unsigned char*)pKey2; |
| 1397 | int i=0, j=0, x; |
| 1398 | (void)notUsed; |
| 1399 | while( i<nKey1 && j<nKey2 ){ |
| 1400 | if( fossil_isdigit(zA[i]) ){ |
| 1401 | int k; |
| 1402 | if( !fossil_isdigit(zB[j]) ) return x; |
| 1403 | while( i<nKey1 && zA[i]=='0' ){ i++; } |
| 1404 | while( j<nKey2 && zB[j]=='0' ){ j++; } |
| 1405 | k = 0; |
| 1406 | while( i+k<nKey1 && fossil_isdigit(zA[i+k]) |
| 1407 | && j+k<nKey2 && fossil_isdigit(zB[j+k]) ){ |
| 1408 |
| --- src/db.c | |
| +++ src/db.c | |
| @@ -1395,13 +1395,12 @@ | |
| 1395 | const unsigned char *zA = (const unsigned char*)pKey1; |
| 1396 | const unsigned char *zB = (const unsigned char*)pKey2; |
| 1397 | int i=0, j=0, x; |
| 1398 | (void)notUsed; |
| 1399 | while( i<nKey1 && j<nKey2 ){ |
| 1400 | if( fossil_isdigit(zA[i]) && fossil_isdigit(zB[j]) ){ |
| 1401 | int k; |
| 1402 | while( i<nKey1 && zA[i]=='0' ){ i++; } |
| 1403 | while( j<nKey2 && zB[j]=='0' ){ j++; } |
| 1404 | k = 0; |
| 1405 | while( i+k<nKey1 && fossil_isdigit(zA[i+k]) |
| 1406 | && j+k<nKey2 && fossil_isdigit(zB[j+k]) ){ |
| 1407 |