Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
| Comment: | Add documentation for the OP_SorterInsert opcode, formerly omitted by mistake. No changes to code. |
|---|---|
| Downloads: | Tarball | ZIP archive | SQL archive |
| Timelines: | family | ancestors | descendants | both | trunk |
| Files: | files | file ages | folders |
| SHA1: | 16d88a907730e3773a1320dbaf1f82c2bc71d71f |
| User & Date: | drh 2016-10-15 18:37:05 |
Context
|
2016-10-17
| ||
| 00:48 | Small size reduction and performance increase in the string duplicator. check-in: cda998f0 user: drh tags: trunk | |
|
2016-10-15
| ||
| 18:37 | Add documentation for the OP_SorterInsert opcode, formerly omitted by mistake. No changes to code. check-in: 16d88a90 user: drh tags: trunk | |
| 08:56 | Add test case to hook.test. No changes to non-test code. check-in: 2674d779 user: dan tags: trunk | |
Changes
Changes to src/vdbe.c.
5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 |
** If P5 has the OPFLAG_USESEEKRESULT bit set, then the cursor must have
** just done a seek to the spot where the new entry is to be inserted.
** This flag avoids doing an extra seek.
**
** This instruction only works for indices. The equivalent instruction
** for tables is OP_Insert.
*/
case OP_SorterInsert: /* in2 */
case OP_IdxInsert: { /* in2 */
VdbeCursor *pC;
BtreePayload x;
assert( pOp->p1>=0 && pOp->p1<p->nCursor );
pC = p->apCsr[pOp->p1];
|
> > > > > > > |
5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 |
** If P5 has the OPFLAG_USESEEKRESULT bit set, then the cursor must have ** just done a seek to the spot where the new entry is to be inserted. ** This flag avoids doing an extra seek. ** ** This instruction only works for indices. The equivalent instruction ** for tables is OP_Insert. */ /* Opcode: SorterInsert P1 P2 * * * ** Synopsis: key=r[P2] ** ** Register P2 holds an SQL index key made using the ** MakeRecord instructions. This opcode writes that key ** into the sorter P1. Data for the entry is nil. */ case OP_SorterInsert: /* in2 */ case OP_IdxInsert: { /* in2 */ VdbeCursor *pC; BtreePayload x; assert( pOp->p1>=0 && pOp->p1<p->nCursor ); pC = p->apCsr[pOp->p1]; |