-
Notifications
You must be signed in to change notification settings - Fork 606
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
KIKIMR-19521 BTreeIndex Charge Interface
- Loading branch information
Showing
17 changed files
with
325 additions
and
167 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,69 @@ | ||
| #pragma once | ||
|
|
||
| #include "flat_table_part.h" | ||
| #include "flat_part_iface.h" | ||
| #include "flat_part_charge_iface.h" | ||
|
|
||
| namespace NKikimr::NTable { | ||
|
|
||
| class TChargeBTreeIndex : public ICharge { | ||
| public: | ||
| TChargeBTreeIndex(IPages *env, const TPart &part, TTagsRef tags, bool includeHistory = false) { | ||
| Y_UNUSED(env); | ||
| Y_UNUSED(part); | ||
| Y_UNUSED(tags); | ||
| Y_UNUSED(includeHistory); | ||
| } | ||
|
|
||
| virtual bool Do(const TRowId row1, const TRowId row2, | ||
| const TKeyCellDefaults &keyDefaults, ui64 itemsLimit, ui64 bytesLimit) const noexcept override { | ||
| // TODO: implement | ||
| Y_UNUSED(row1); | ||
| Y_UNUSED(row2); | ||
| Y_UNUSED(keyDefaults); | ||
| Y_UNUSED(itemsLimit); | ||
| Y_UNUSED(bytesLimit); | ||
| return true; | ||
| } | ||
|
|
||
| virtual bool DoReverse(const TRowId row1, const TRowId row2, | ||
| const TKeyCellDefaults &keyDefaults, ui64 itemsLimit, ui64 bytesLimit) const noexcept override { | ||
| // TODO: implement | ||
| Y_UNUSED(row1); | ||
| Y_UNUSED(row2); | ||
| Y_UNUSED(keyDefaults); | ||
| Y_UNUSED(itemsLimit); | ||
| Y_UNUSED(bytesLimit); | ||
| return true; | ||
| } | ||
|
|
||
| virtual TResult Do(const TCells key1, const TCells key2, const TRowId row1, | ||
| const TRowId row2, const TKeyCellDefaults &keyDefaults, ui64 itemsLimit, | ||
| ui64 bytesLimit) const noexcept override { | ||
| // TODO: implement | ||
| Y_UNUSED(key1); | ||
| Y_UNUSED(key2); | ||
| Y_UNUSED(row1); | ||
| Y_UNUSED(row2); | ||
| Y_UNUSED(keyDefaults); | ||
| Y_UNUSED(itemsLimit); | ||
| Y_UNUSED(bytesLimit); | ||
| return {true, false}; | ||
| } | ||
|
|
||
| virtual TResult DoReverse(const TCells key1, const TCells key2, const TRowId row1, | ||
| const TRowId row2, const TKeyCellDefaults &keyDefaults, ui64 itemsLimit, | ||
| ui64 bytesLimit) const noexcept override { | ||
| // TODO: implement | ||
| Y_UNUSED(key1); | ||
| Y_UNUSED(key2); | ||
| Y_UNUSED(row1); | ||
| Y_UNUSED(row2); | ||
| Y_UNUSED(keyDefaults); | ||
| Y_UNUSED(itemsLimit); | ||
| Y_UNUSED(bytesLimit); | ||
| return {true, false}; | ||
| } | ||
| }; | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,15 @@ | ||
| #include "flat_part_charge_create.h" | ||
| #include "flat_part_charge.h" | ||
| #include "flat_part_charge_btree_index.h" | ||
|
|
||
| namespace NKikimr::NTable { | ||
|
|
||
| THolder<ICharge> CreateCharge(IPages *env, const TPart &part, TTagsRef tags, bool includeHistory) { | ||
| if (part.IndexPages.BTreeGroups) { | ||
| return MakeHolder<TChargeBTreeIndex>(env, part, tags, includeHistory); | ||
| } else { | ||
| return MakeHolder<TCharge>(env, part, tags, includeHistory); | ||
| } | ||
| } | ||
|
|
||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,10 @@ | ||
| #pragma once | ||
|
|
||
| #include "flat_part_charge_iface.h" | ||
| #include "flat_part_iface.h" | ||
|
|
||
| namespace NKikimr::NTable { | ||
|
|
||
| THolder<ICharge> CreateCharge(IPages *env, const TPart &part, TTagsRef tags, bool includeHistory = false); | ||
|
|
||
| } |
Oops, something went wrong.