String search function
$begingroup$
I'm trying to return a list of objects called orders based on a string search that the user enters. orders has a title and a description. The function loops through the orders object and tries to find matches between the search string and order titles or descriptions.
searchOrders(search: string, orders: Order): Order {
const tempOrders = [...orders];
const orderToReturn = ;
// Loop through all of the orders given to us.
for ( let i = 0; i < tempOrders.length; i++) {
// assign the orders title to a temporary variable
const tempTitle = tempOrders[i].title;
// Loop through the title of the order
for ( let j = 0; j < tempTitle.length - search.length + 1; j++) {
let tempCompareTitle = '';
// Create the tempCompareTitle string
for ( let k = 0; k < search.length; k++ ) {
tempCompareTitle = tempCompareTitle + tempTitle[j + k];
}
// If it finds a match, push it to the array and end the loop.
if ( search === tempCompareTitle ) {
orderToReturn.push(tempOrders[i]);
j = tempTitle.length;
// get rid of the description so that it won't add redundent orders to the array.
tempOrders[i].description = '';
}
}
// compare the search vaule to descriptions
const tempDescription = tempOrders[i].description;
for ( let j = 0; j < tempDescription.length - search.length + 1; j++) {
let tempCompareDescription = '';
for ( let k = 0; k < search.length; k++ ) {
tempCompareDescription = tempCompareDescription + tempDescription[j + k];
}
if ( search === tempCompareDescription ) {
orderToReturn.push(tempOrders[i]);
j = tempDescription.length;
}
}
}
return orderToReturn;
}
search typescript
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm trying to return a list of objects called orders based on a string search that the user enters. orders has a title and a description. The function loops through the orders object and tries to find matches between the search string and order titles or descriptions.
searchOrders(search: string, orders: Order): Order {
const tempOrders = [...orders];
const orderToReturn = ;
// Loop through all of the orders given to us.
for ( let i = 0; i < tempOrders.length; i++) {
// assign the orders title to a temporary variable
const tempTitle = tempOrders[i].title;
// Loop through the title of the order
for ( let j = 0; j < tempTitle.length - search.length + 1; j++) {
let tempCompareTitle = '';
// Create the tempCompareTitle string
for ( let k = 0; k < search.length; k++ ) {
tempCompareTitle = tempCompareTitle + tempTitle[j + k];
}
// If it finds a match, push it to the array and end the loop.
if ( search === tempCompareTitle ) {
orderToReturn.push(tempOrders[i]);
j = tempTitle.length;
// get rid of the description so that it won't add redundent orders to the array.
tempOrders[i].description = '';
}
}
// compare the search vaule to descriptions
const tempDescription = tempOrders[i].description;
for ( let j = 0; j < tempDescription.length - search.length + 1; j++) {
let tempCompareDescription = '';
for ( let k = 0; k < search.length; k++ ) {
tempCompareDescription = tempCompareDescription + tempDescription[j + k];
}
if ( search === tempCompareDescription ) {
orderToReturn.push(tempOrders[i]);
j = tempDescription.length;
}
}
}
return orderToReturn;
}
search typescript
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I'm trying to return a list of objects called orders based on a string search that the user enters. orders has a title and a description. The function loops through the orders object and tries to find matches between the search string and order titles or descriptions.
searchOrders(search: string, orders: Order): Order {
const tempOrders = [...orders];
const orderToReturn = ;
// Loop through all of the orders given to us.
for ( let i = 0; i < tempOrders.length; i++) {
// assign the orders title to a temporary variable
const tempTitle = tempOrders[i].title;
// Loop through the title of the order
for ( let j = 0; j < tempTitle.length - search.length + 1; j++) {
let tempCompareTitle = '';
// Create the tempCompareTitle string
for ( let k = 0; k < search.length; k++ ) {
tempCompareTitle = tempCompareTitle + tempTitle[j + k];
}
// If it finds a match, push it to the array and end the loop.
if ( search === tempCompareTitle ) {
orderToReturn.push(tempOrders[i]);
j = tempTitle.length;
// get rid of the description so that it won't add redundent orders to the array.
tempOrders[i].description = '';
}
}
// compare the search vaule to descriptions
const tempDescription = tempOrders[i].description;
for ( let j = 0; j < tempDescription.length - search.length + 1; j++) {
let tempCompareDescription = '';
for ( let k = 0; k < search.length; k++ ) {
tempCompareDescription = tempCompareDescription + tempDescription[j + k];
}
if ( search === tempCompareDescription ) {
orderToReturn.push(tempOrders[i]);
j = tempDescription.length;
}
}
}
return orderToReturn;
}
search typescript
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I'm trying to return a list of objects called orders based on a string search that the user enters. orders has a title and a description. The function loops through the orders object and tries to find matches between the search string and order titles or descriptions.
searchOrders(search: string, orders: Order): Order {
const tempOrders = [...orders];
const orderToReturn = ;
// Loop through all of the orders given to us.
for ( let i = 0; i < tempOrders.length; i++) {
// assign the orders title to a temporary variable
const tempTitle = tempOrders[i].title;
// Loop through the title of the order
for ( let j = 0; j < tempTitle.length - search.length + 1; j++) {
let tempCompareTitle = '';
// Create the tempCompareTitle string
for ( let k = 0; k < search.length; k++ ) {
tempCompareTitle = tempCompareTitle + tempTitle[j + k];
}
// If it finds a match, push it to the array and end the loop.
if ( search === tempCompareTitle ) {
orderToReturn.push(tempOrders[i]);
j = tempTitle.length;
// get rid of the description so that it won't add redundent orders to the array.
tempOrders[i].description = '';
}
}
// compare the search vaule to descriptions
const tempDescription = tempOrders[i].description;
for ( let j = 0; j < tempDescription.length - search.length + 1; j++) {
let tempCompareDescription = '';
for ( let k = 0; k < search.length; k++ ) {
tempCompareDescription = tempCompareDescription + tempDescription[j + k];
}
if ( search === tempCompareDescription ) {
orderToReturn.push(tempOrders[i]);
j = tempDescription.length;
}
}
}
return orderToReturn;
}
search typescript
search typescript
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 14 mins ago
Jamal♦
30.3k11119227
30.3k11119227
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 1 hour ago
Happy SheepHappy Sheep
11
11
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Happy Sheep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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
});
}
});
Happy Sheep 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%2f214083%2fstring-search-function%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
Happy Sheep is a new contributor. Be nice, and check out our Code of Conduct.
Happy Sheep is a new contributor. Be nice, and check out our Code of Conduct.
Happy Sheep is a new contributor. Be nice, and check out our Code of Conduct.
Happy Sheep 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%2f214083%2fstring-search-function%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