{"id":30145,"date":"2023-01-13T12:28:57","date_gmt":"2023-01-13T06:58:57","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/"},"modified":"2023-01-13T12:28:57","modified_gmt":"2023-01-13T06:58:57","slug":"solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/","title":{"rendered":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed]"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

Since you haven’t shown what you’ve done so far I’m assuming that you haven’t started on a solution, so here’s a high level algorithm:<\/p>\n

In that case, use String.Split(' ')<\/code> to split the searchstring<\/code> by each space.<\/p>\n

Use a foreach<\/code> loop on the resulting array of strings and use string concatenation to complete, if a word was already used before that’s not or<\/code> or and<\/code>, don’t add it to the resulting string.
\nIf the previous word was or<\/code> or and<\/code> and the current one also is, don’t add it to the resulting string.
\nIf the previous word wasn’t or<\/code> or and<\/code> and the current one isn’t, add or<\/code> to the resulting string.<\/p>\n

EDIT: Now that the code has been posted, I can see what’s wrong<\/p>\n

this conditional:<\/p>\n

    if (output.Contains(\" \") && !output.Contains(\"and\") && !output.Contains(\"or\"))\n    {\n        return string.Join(\" or \", output.Split(' ').Select(I => I.Trim()));\n    }\n<\/code><\/pre>\n
is only getting called if the output doesn’t contain any instance of and<\/code> or or<\/code> <\/p>\n
Do the check to see if or<\/code> needs to be added within your foreach<\/code> loop, and get rid of that conditional<\/p>\n
e.g:<\/p>\n
            foreach (var item in strArray)\n            {\n                currStr = item.Trim();\n                keywordFlag = searchKeywords.Contains(prevStr) && searchKeywords.Contains(currStr);\n                duplicateFlag = outputArray.Contains(currStr) && !searchKeywords.Contains(currStr);\n                if (!currStr.Equals(prevStr) && !keywordFlag && !duplicateFlag)\n                {\n                    if (!searchKeywords.Contains(prevStr) && !searchKeywords.Contains(currStr) && prevStr != \"\")\n                    {\n                        outputArray.Add(\"or\");\n                    }\n                    outputArray.Add(currStr);\n                    prevStr = currStr;\n                }\n            }\n<\/code><\/pre>\n
Also, where you’re checking to see if there are only 2 tokens in the array, you’re only accounting for if they put or<\/code> or and<\/code> after a word, what happens if they put in or Oyster<\/code> as an input string?  The resulting string would just be or<\/code><\/p>\n
you need to account for that:<\/p>\n
            if (outputArray.Count() == 2)\n            {\n                if(searchKeywords.Contains(outputArray[0]))\n                    outputArray.Remove(outputArray[0]);\n                else if(searchKeywords.Contains(outputArray[1]))\n                    outputArray.Remove(outputArray[1]);\n            }\n<\/code><\/pre>\n<\/p><\/div>\n
<\/div>\n<\/div>\n
            3<\/span> <\/p><\/div>\n<\/div>\n
[ad_2]<\/p>\n
solved C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"
[ad_1] Since you haven’t shown what you’ve done so far I’m assuming that you haven’t started on a solution, so here’s a high level algorithm: In that case, use String.Split(‘ ‘) to split the searchstring by each space. Use a foreach loop on the resulting array of strings and use string concatenation to complete, if … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[1822,324,4567,844,500],"class_list":["post-30145","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c-5-0","tag-c","tag-duplicate-removal","tag-full-text-search","tag-sql-server"],"yoast_head":"\n[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] Since you haven’t shown what you’ve done so far I’m assuming that you haven’t started on a solution, so here’s a high level algorithm: In that case, use String.Split(' ') to split the searchstring by each space. Use a foreach loop on the resulting array of strings and use string concatenation to complete, if ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-01-13T06:58:57+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed]\",\"datePublished\":\"2023-01-13T06:58:57+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\"},\"wordCount\":247,\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"keywords\":[\"c#-5.0\",\"c++\",\"duplicate-removal\",\"full-text-search\",\"sql-server\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\",\"url\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\",\"name\":\"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#website\"},\"datePublished\":\"2023-01-13T06:58:57+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/jassweb.com\/solved\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/jassweb.com\/solved\/#website\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/jassweb.com\/solved\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/jassweb.com\/solved\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\/\/jassweb.com\/solved\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"contentUrl\":\"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"contentUrl\":\"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\/\/jassweb.com\"],\"url\":\"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb","og_description":"[ad_1] Since you haven’t shown what you’ve done so far I’m assuming that you haven’t started on a solution, so here’s a high level algorithm: In that case, use String.Split(' ') to split the searchstring by each space. Use a foreach loop on the resulting array of strings and use string concatenation to complete, if ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/","og_site_name":"JassWeb","article_published_time":"2023-01-13T06:58:57+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed]","datePublished":"2023-01-13T06:58:57+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/"},"wordCount":247,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c#-5.0","c++","duplicate-removal","full-text-search","sql-server"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/","name":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with 'AND' 'OR' [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-01-13T06:58:57+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-c-full-text-search-string-format-string-remove-all-adjacent-duplicates-and-append-with-and-or-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] C# Full-text search string format : string remove all adjacent duplicates and append with ‘AND’ ‘OR’ [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/image\/","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1776403586","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/30145","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=30145"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/30145\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=30145"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=30145"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=30145"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}