Eneboo - Documentación para desarrolladores
|
Ir al código fuente de este archivo.
Clases | |
struct | BtOps |
struct | BtCursorOps |
'defines' | |
#define | SQLITE_N_BTREE_META 10 |
#define | btOps(pBt) (*((BtOps **)(pBt))) |
#define | btCOps(pCur) (*((BtCursorOps **)(pCur))) |
#define | sqliteBtreeClose(pBt) (btOps(pBt)->Close(pBt)) |
#define | sqliteBtreeSetCacheSize(pBt, sz) (btOps(pBt)->SetCacheSize(pBt, sz)) |
#define | sqliteBtreeSetSafetyLevel(pBt, sl) (btOps(pBt)->SetSafetyLevel(pBt, sl)) |
#define | sqliteBtreeBeginTrans(pBt) (btOps(pBt)->BeginTrans(pBt)) |
#define | sqliteBtreeCommit(pBt) (btOps(pBt)->Commit(pBt)) |
#define | sqliteBtreeRollback(pBt) (btOps(pBt)->Rollback(pBt)) |
#define | sqliteBtreeBeginCkpt(pBt) (btOps(pBt)->BeginCkpt(pBt)) |
#define | sqliteBtreeCommitCkpt(pBt) (btOps(pBt)->CommitCkpt(pBt)) |
#define | sqliteBtreeRollbackCkpt(pBt) (btOps(pBt)->RollbackCkpt(pBt)) |
#define | sqliteBtreeCreateTable(pBt, piTable) (btOps(pBt)->CreateTable(pBt,piTable)) |
#define | sqliteBtreeCreateIndex(pBt, piIndex) (btOps(pBt)->CreateIndex(pBt, piIndex)) |
#define | sqliteBtreeDropTable(pBt, iTable) (btOps(pBt)->DropTable(pBt, iTable)) |
#define | sqliteBtreeClearTable(pBt, iTable) (btOps(pBt)->ClearTable(pBt, iTable)) |
#define | sqliteBtreeCursor(pBt, iTable, wrFlag, ppCur) (btOps(pBt)->Cursor(pBt, iTable, wrFlag, ppCur)) |
#define | sqliteBtreeMoveto(pCur, pKey, nKey, pRes) (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes)) |
#define | sqliteBtreeDelete(pCur) (btCOps(pCur)->Delete(pCur)) |
#define | sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData)) |
#define | sqliteBtreeFirst(pCur, pRes) (btCOps(pCur)->First(pCur, pRes)) |
#define | sqliteBtreeLast(pCur, pRes) (btCOps(pCur)->Last(pCur, pRes)) |
#define | sqliteBtreeNext(pCur, pRes) (btCOps(pCur)->Next(pCur, pRes)) |
#define | sqliteBtreePrevious(pCur, pRes) (btCOps(pCur)->Previous(pCur, pRes)) |
#define | sqliteBtreeKeySize(pCur, pSize) (btCOps(pCur)->KeySize(pCur, pSize) ) |
#define | sqliteBtreeKey(pCur, offset, amt, zBuf) (btCOps(pCur)->Key(pCur, offset, amt, zBuf)) |
#define | sqliteBtreeKeyCompare(pCur, pKey, nKey, nIgnore, pRes) (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes)) |
#define | sqliteBtreeDataSize(pCur, pSize) (btCOps(pCur)->DataSize(pCur, pSize)) |
#define | sqliteBtreeData(pCur, offset, amt, zBuf) (btCOps(pCur)->Data(pCur, offset, amt, zBuf)) |
#define | sqliteBtreeCloseCursor(pCur) (btCOps(pCur)->CloseCursor(pCur)) |
#define | sqliteBtreeGetMeta(pBt, aMeta) (btOps(pBt)->GetMeta(pBt, aMeta)) |
#define | sqliteBtreeUpdateMeta(pBt, aMeta) (btOps(pBt)->UpdateMeta(pBt, aMeta)) |
#define | sqliteBtreeIntegrityCheck(pBt, aRoot, nRoot) (btOps(pBt)->IntegrityCheck(pBt, aRoot, nRoot)) |
#define | sqliteBtreeGetFilename(pBt) (btOps(pBt)->GetFilename(pBt)) |
#define | sqliteBtreeCopyFile(pBt1, pBt2) (btOps(pBt1)->Copyfile(pBt1, pBt2)) |
#define | sqliteBtreePager(pBt) (btOps(pBt)->Pager(pBt)) |
'typedefs' | |
typedef struct Btree | Btree |
typedef struct BtCursor | BtCursor |
typedef struct BtOps | BtOps |
typedef struct BtCursorOps | BtCursorOps |
Funciones | |
int | sqliteBtreeOpen (const char *zFilename, int mode, int nPg, Btree **ppBtree) |
int | sqliteRbtreeOpen (const char *zFilename, int mode, int nPg, Btree **ppBtree) |
#define btCOps | ( | pCur | ) | (*((BtCursorOps **)(pCur))) |
#define btOps | ( | pBt | ) | (*((BtOps **)(pBt))) |
#define SQLITE_N_BTREE_META 10 |
#define sqliteBtreeBeginCkpt | ( | pBt | ) | (btOps(pBt)->BeginCkpt(pBt)) |
#define sqliteBtreeBeginTrans | ( | pBt | ) | (btOps(pBt)->BeginTrans(pBt)) |
#define sqliteBtreeClearTable | ( | pBt, | |
iTable | |||
) | (btOps(pBt)->ClearTable(pBt, iTable)) |
#define sqliteBtreeClose | ( | pBt | ) | (btOps(pBt)->Close(pBt)) |
#define sqliteBtreeCloseCursor | ( | pCur | ) | (btCOps(pCur)->CloseCursor(pCur)) |
#define sqliteBtreeCommit | ( | pBt | ) | (btOps(pBt)->Commit(pBt)) |
#define sqliteBtreeCommitCkpt | ( | pBt | ) | (btOps(pBt)->CommitCkpt(pBt)) |
#define sqliteBtreeCopyFile | ( | pBt1, | |
pBt2 | |||
) | (btOps(pBt1)->Copyfile(pBt1, pBt2)) |
#define sqliteBtreeCreateIndex | ( | pBt, | |
piIndex | |||
) | (btOps(pBt)->CreateIndex(pBt, piIndex)) |
#define sqliteBtreeCreateTable | ( | pBt, | |
piTable | |||
) | (btOps(pBt)->CreateTable(pBt,piTable)) |
#define sqliteBtreeCursor | ( | pBt, | |
iTable, | |||
wrFlag, | |||
ppCur | |||
) | (btOps(pBt)->Cursor(pBt, iTable, wrFlag, ppCur)) |
#define sqliteBtreeData | ( | pCur, | |
offset, | |||
amt, | |||
zBuf | |||
) | (btCOps(pCur)->Data(pCur, offset, amt, zBuf)) |
#define sqliteBtreeDataSize | ( | pCur, | |
pSize | |||
) | (btCOps(pCur)->DataSize(pCur, pSize)) |
#define sqliteBtreeDelete | ( | pCur | ) | (btCOps(pCur)->Delete(pCur)) |
#define sqliteBtreeDropTable | ( | pBt, | |
iTable | |||
) | (btOps(pBt)->DropTable(pBt, iTable)) |
#define sqliteBtreeFirst | ( | pCur, | |
pRes | |||
) | (btCOps(pCur)->First(pCur, pRes)) |
#define sqliteBtreeGetFilename | ( | pBt | ) | (btOps(pBt)->GetFilename(pBt)) |
#define sqliteBtreeGetMeta | ( | pBt, | |
aMeta | |||
) | (btOps(pBt)->GetMeta(pBt, aMeta)) |
#define sqliteBtreeInsert | ( | pCur, | |
pKey, | |||
nKey, | |||
pData, | |||
nData | |||
) | (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData)) |
#define sqliteBtreeIntegrityCheck | ( | pBt, | |
aRoot, | |||
nRoot | |||
) | (btOps(pBt)->IntegrityCheck(pBt, aRoot, nRoot)) |
#define sqliteBtreeKey | ( | pCur, | |
offset, | |||
amt, | |||
zBuf | |||
) | (btCOps(pCur)->Key(pCur, offset, amt, zBuf)) |
#define sqliteBtreeKeyCompare | ( | pCur, | |
pKey, | |||
nKey, | |||
nIgnore, | |||
pRes | |||
) | (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes)) |
#define sqliteBtreeKeySize | ( | pCur, | |
pSize | |||
) | (btCOps(pCur)->KeySize(pCur, pSize) ) |
#define sqliteBtreeLast | ( | pCur, | |
pRes | |||
) | (btCOps(pCur)->Last(pCur, pRes)) |
#define sqliteBtreeMoveto | ( | pCur, | |
pKey, | |||
nKey, | |||
pRes | |||
) | (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes)) |
#define sqliteBtreeNext | ( | pCur, | |
pRes | |||
) | (btCOps(pCur)->Next(pCur, pRes)) |
#define sqliteBtreePager | ( | pBt | ) | (btOps(pBt)->Pager(pBt)) |
#define sqliteBtreePrevious | ( | pCur, | |
pRes | |||
) | (btCOps(pCur)->Previous(pCur, pRes)) |
#define sqliteBtreeRollback | ( | pBt | ) | (btOps(pBt)->Rollback(pBt)) |
#define sqliteBtreeRollbackCkpt | ( | pBt | ) | (btOps(pBt)->RollbackCkpt(pBt)) |
#define sqliteBtreeSetCacheSize | ( | pBt, | |
sz | |||
) | (btOps(pBt)->SetCacheSize(pBt, sz)) |
#define sqliteBtreeSetSafetyLevel | ( | pBt, | |
sl | |||
) | (btOps(pBt)->SetSafetyLevel(pBt, sl)) |
#define sqliteBtreeUpdateMeta | ( | pBt, | |
aMeta | |||
) | (btOps(pBt)->UpdateMeta(pBt, aMeta)) |
typedef struct BtCursorOps BtCursorOps |