ItsDrike/hyprland-dwindle-autogroup
1
0
Fork 0
mirror of https://github.com/ItsDrike/hyprland-dwindle-autogroup.git synced 2024-09-19 21:29:41 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove unnecessary parents deque from addChildNodesToDequeRecursive

Browse source
This commit is contained in:
ItsDrike 2023-04-04 00:14:44 +02:00
parent 16f67af969
commit 93d3948bfb
Signed by: ItsDrike
GPG key ID: FA2745890B7048C0
1 changed files with 4 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
src/main.cpp
View file

@ -14,12 +14,11 @@ inline std::function<void(std::string)> originalToggleGroup = nullptr;
typedef SDwindleNodeData* (*nodeFromWindowT)(void*, CWindow*); typedef SDwindleNodeData* (*nodeFromWindowT)(void*, CWindow*);
inline nodeFromWindowT g_pNodeFromWindow = nullptr; inline nodeFromWindowT g_pNodeFromWindow = nullptr;
void addChildNodesToDequeRecursive(std::deque<SDwindleNodeData*>* pDeque, std::deque<SDwindleNodeData*>* pParents, SDwindleNodeData* node) void addChildNodesToDequeRecursive(std::deque<SDwindleNodeData*>* pDeque, SDwindleNodeData* node)
{ {
if (node->isNode) { if (node->isNode) {
pParents->push_back(node); addChildNodesToDequeRecursive(pDeque, node->children[0]);
addChildNodesToDequeRecursive(pDeque, pParents, node->children[0]); addChildNodesToDequeRecursive(pDeque, node->children[1]);
addChildNodesToDequeRecursive(pDeque, pParents, node->children[1]);
} }
else { else {
pDeque->emplace_back(node); pDeque->emplace_back(node);
@ -64,10 +63,8 @@ void groupCreate(const SDwindleNodeData* PNODE, CHyprDwindleLayout* layout)
originalToggleGroup(""); originalToggleGroup("");
std::deque<SDwindleNodeData*> newGroupMembers; std::deque<SDwindleNodeData*> newGroupMembers;
std::deque<SDwindleNodeData*> parentNodes;
addChildNodesToDequeRecursive( addChildNodesToDequeRecursive(&newGroupMembers, PNODE->pParent->children[0] == PNODE ? PNODE->pParent->children[1] : PNODE->pParent->children[0]);
&newGroupMembers, &parentNodes, PNODE->pParent->children[0] == PNODE ? PNODE->pParent->children[1] : PNODE->pParent->children[0]);
// Make sure one of the child nodes isn't itself a group // Make sure one of the child nodes isn't itself a group
for (auto& n : newGroupMembers) { for (auto& n : newGroupMembers) {