Searching a nested data structure for 2 attributesComplex data structure organization in javascript?My...
What is better: yes / no radio, or simple checkbox?
Is there any differences between "Gucken" and "Schauen"?
Why exactly do action photographers need high fps burst cameras?
Citing paywalled articles accessed via illegal web sharing
A starship is travelling at 0.9c and collides with a small rock. Will it leave a clean hole through, or will more happen?
How to prevent users from executing commands through browser URL
How to deal with an incendiary email that was recalled
Injecting creativity into a cookbook
Program that converts a number to a letter of the alphabet
How to acknowledge an embarrassing job interview, now that I work directly with the interviewer?
Avoiding morning and evening handshakes
What is this metal M-shaped device for?
Why is working on the same position for more than 15 years not a red flag?
Using only 1s, make 29 with the minimum number of digits
Explain the objections to these measures against human trafficking
Disable the ">" operator in Rstudio linux terminal
How do you funnel food off a cutting board?
Why do members of Congress in committee hearings ask witnesses the same question multiple times?
Can we use the stored gravitational potential energy of a building to produce power?
How should I handle players who ignore the session zero agreement?
Contest math problem about crossing out numbers in the table
What to do when being responsible for data protection in your lab, yet advice is ignored?
Why doesn't "auto ch = unsigned char{'p'}" compile under C++ 17?
Does static make a difference for a const local variable?
Searching a nested data structure for 2 attributes
Complex data structure organization in javascript?My attempt at a weighted search in JavaScriptSearch for data and order by priority efficientlyGet all combination of a nested object with arbitrary levelsGet all combination of a nested objectJavaScript : Search highest ID in JSON-structure. Increment & return itSearch for layers in Adobe Illustrator by nameFind the most common number in an array of numbersgenerate parent nodes from leaf nodes (child nodes array) in a hierarchical tree structureString search function
$begingroup$
So I have the following data structures
export class BudgetGroupInfo {
name: string;
bcInfo: BudgetCatInfo[] = [];
}
export class BudgetCatInfo {
name: string;
description: string;
bcAccounts: BCAccountInfo[] = [];
}
export class BCAccountInfo {
name: string;
description: string;
}
What I need to be able to do is find which BudgetGroupInfo
contains both BudgetCatInfo.name
and BCAccountInfo.name
This is what I have so far and it works, but I feel like this isn't the most efficient want to do this.
getGroupInfo(budCat: string, account: string, budgetGroupInfo: BudgetGroupInfo[]): BudgetGroupInfo {
let groupInfo = null;
budgetGroupInfo.forEach(infoGroup => {
infoGroup.bcInfo.filter(bcInfo => bcInfo.name == budCat)
.map(bcInfo => bcInfo.bcAccounts)
.forEach(accounts => {
const acctInfo: BCAccountInfo = accounts.find(acct => acct.name == account);
if(acctInfo) {
groupInfo = infoGroup;
}
});
})
return groupInfo;
}
- First I go through the groups and find which ones have the specific
budCat
- I take the valid
BudgetCatInfo
andmap
thebcAccount
array - I search that array and look for the specified
account
- If I find it then I set it for return.
Just a note that there won't always be a result and there will never be multiple matches.
javascript typescript
New contributor
$endgroup$
add a comment |
$begingroup$
So I have the following data structures
export class BudgetGroupInfo {
name: string;
bcInfo: BudgetCatInfo[] = [];
}
export class BudgetCatInfo {
name: string;
description: string;
bcAccounts: BCAccountInfo[] = [];
}
export class BCAccountInfo {
name: string;
description: string;
}
What I need to be able to do is find which BudgetGroupInfo
contains both BudgetCatInfo.name
and BCAccountInfo.name
This is what I have so far and it works, but I feel like this isn't the most efficient want to do this.
getGroupInfo(budCat: string, account: string, budgetGroupInfo: BudgetGroupInfo[]): BudgetGroupInfo {
let groupInfo = null;
budgetGroupInfo.forEach(infoGroup => {
infoGroup.bcInfo.filter(bcInfo => bcInfo.name == budCat)
.map(bcInfo => bcInfo.bcAccounts)
.forEach(accounts => {
const acctInfo: BCAccountInfo = accounts.find(acct => acct.name == account);
if(acctInfo) {
groupInfo = infoGroup;
}
});
})
return groupInfo;
}
- First I go through the groups and find which ones have the specific
budCat
- I take the valid
BudgetCatInfo
andmap
thebcAccount
array - I search that array and look for the specified
account
- If I find it then I set it for return.
Just a note that there won't always be a result and there will never be multiple matches.
javascript typescript
New contributor
$endgroup$
add a comment |
$begingroup$
So I have the following data structures
export class BudgetGroupInfo {
name: string;
bcInfo: BudgetCatInfo[] = [];
}
export class BudgetCatInfo {
name: string;
description: string;
bcAccounts: BCAccountInfo[] = [];
}
export class BCAccountInfo {
name: string;
description: string;
}
What I need to be able to do is find which BudgetGroupInfo
contains both BudgetCatInfo.name
and BCAccountInfo.name
This is what I have so far and it works, but I feel like this isn't the most efficient want to do this.
getGroupInfo(budCat: string, account: string, budgetGroupInfo: BudgetGroupInfo[]): BudgetGroupInfo {
let groupInfo = null;
budgetGroupInfo.forEach(infoGroup => {
infoGroup.bcInfo.filter(bcInfo => bcInfo.name == budCat)
.map(bcInfo => bcInfo.bcAccounts)
.forEach(accounts => {
const acctInfo: BCAccountInfo = accounts.find(acct => acct.name == account);
if(acctInfo) {
groupInfo = infoGroup;
}
});
})
return groupInfo;
}
- First I go through the groups and find which ones have the specific
budCat
- I take the valid
BudgetCatInfo
andmap
thebcAccount
array - I search that array and look for the specified
account
- If I find it then I set it for return.
Just a note that there won't always be a result and there will never be multiple matches.
javascript typescript
New contributor
$endgroup$
So I have the following data structures
export class BudgetGroupInfo {
name: string;
bcInfo: BudgetCatInfo[] = [];
}
export class BudgetCatInfo {
name: string;
description: string;
bcAccounts: BCAccountInfo[] = [];
}
export class BCAccountInfo {
name: string;
description: string;
}
What I need to be able to do is find which BudgetGroupInfo
contains both BudgetCatInfo.name
and BCAccountInfo.name
This is what I have so far and it works, but I feel like this isn't the most efficient want to do this.
getGroupInfo(budCat: string, account: string, budgetGroupInfo: BudgetGroupInfo[]): BudgetGroupInfo {
let groupInfo = null;
budgetGroupInfo.forEach(infoGroup => {
infoGroup.bcInfo.filter(bcInfo => bcInfo.name == budCat)
.map(bcInfo => bcInfo.bcAccounts)
.forEach(accounts => {
const acctInfo: BCAccountInfo = accounts.find(acct => acct.name == account);
if(acctInfo) {
groupInfo = infoGroup;
}
});
})
return groupInfo;
}
- First I go through the groups and find which ones have the specific
budCat
- I take the valid
BudgetCatInfo
andmap
thebcAccount
array - I search that array and look for the specified
account
- If I find it then I set it for return.
Just a note that there won't always be a result and there will never be multiple matches.
javascript typescript
javascript typescript
New contributor
New contributor
New contributor
asked 2 days ago
Raymond HolguinRaymond Holguin
1111
1111
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Raymond Holguin is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214371%2fsearching-a-nested-data-structure-for-2-attributes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Raymond Holguin is a new contributor. Be nice, and check out our Code of Conduct.
Raymond Holguin is a new contributor. Be nice, and check out our Code of Conduct.
Raymond Holguin is a new contributor. Be nice, and check out our Code of Conduct.
Raymond Holguin is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214371%2fsearching-a-nested-data-structure-for-2-attributes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown