80 lines
1.9 KiB
C++
80 lines
1.9 KiB
C++
#include <pd/lithium/command.hpp>
|
|
|
|
PD_LITHIUM_API PD::Li::Command::Ref PD::Li::CmdPool::NewCmd() {
|
|
if (pPoolIdx >= pPool.size()) {
|
|
Resize(pPool.size() + 128);
|
|
}
|
|
Command::Ref nu = pPool[pPoolIdx++];
|
|
nu->Layer = Layer;
|
|
nu->Index = pPoolIdx - 1;
|
|
return nu;
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Init(size_t initial_size) {
|
|
Resize(initial_size);
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Deinit() {
|
|
for (auto it : pPool) {
|
|
Command::Delete(it);
|
|
}
|
|
pPool.clear();
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Resize(size_t nulen) {
|
|
if (nulen <= pPool.size()) {
|
|
return; // no idea yet
|
|
}
|
|
size_t oldlen = pPool.size();
|
|
pPool.resize(nulen);
|
|
for (size_t i = oldlen; i < pPool.size(); i++) {
|
|
pPool[i] = Command::New();
|
|
}
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Reset() {
|
|
for (u32 i = 0; i < pPoolIdx; i++) {
|
|
pPool[i]->Clear();
|
|
}
|
|
pPoolIdx = 0;
|
|
}
|
|
|
|
PD::Li::Command::Ref PD::Li::CmdPool::GetCmd(size_t idx) const {
|
|
return pPool[idx];
|
|
}
|
|
PD::Li::Command::Ref PD::Li::CmdPool::GetCmd(size_t idx) { return pPool[idx]; }
|
|
|
|
size_t PD::Li::CmdPool::Size() const { return pPoolIdx; }
|
|
size_t PD::Li::CmdPool::Cap() const { return pPool.size(); }
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Merge(CmdPool& p) {
|
|
Copy(p);
|
|
p.Reset();
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Copy(CmdPool& p) {
|
|
if (pPoolIdx + p.Size() > pPool.size()) {
|
|
Resize(pPoolIdx + p.Size());
|
|
}
|
|
for (size_t i = 0; i < p.Size(); i++) {
|
|
size_t idx = pPoolIdx++;
|
|
*pPool[idx] = *p.GetCmd(i);
|
|
pPool[idx]->Index = idx;
|
|
pPool[idx]->Layer += Layer;
|
|
}
|
|
}
|
|
|
|
PD_LITHIUM_API void PD::Li::CmdPool::Sort() {
|
|
std::sort(begin(), end(), pTheOrder);
|
|
}
|
|
|
|
PD_LITHIUM_API bool PD::Li::CmdPool::pTheOrder(const Command::Ref& a,
|
|
const Command::Ref& b) {
|
|
if (a->Layer == b->Layer) {
|
|
if (a->Tex == b->Tex) {
|
|
return a->Index < b->Index;
|
|
}
|
|
return a->Tex < b->Tex;
|
|
}
|
|
return a->Layer < b->Layer;
|
|
} |