Javascript: matching a dynamic string against an array -

-

I'm trying to teach myself Javascript What I assumed was simple, but in relatively quick problems Attended

I am trying to find the string for any other string given by the user.

My code is so far: 

  var source = "XREs2qqAQfjr6NZs6H5wkZdOES5mikexRkOPsj6grQiYNZfFoqXI4Nnc1iONKVrA"; Var searchString = []; // user input searchString = prompt ("enter search string"); Var hit = []; Var one = 0; Var two = 0; Var k = 0; Var source search = function (text) {for each letter of the source (i = 0; i & lt; source.length; i ++) {// if (source [i] === search string [0]) {// If a letter in the source matches the first element in the user input one = source.indexOf (i); // Confused from here (P = Search String. Langham; P & gt; 0; p--) {}}}}; SourceSearch (searchString);   
 I thought:  
     
  •  Check to see if the first loop gets a letter that matches the first letter of the user input < / Li> 
  •  If it matches, check to see if you match the X characters before the next X characters in the next string  
  •  If they all match, then they Hit in the hit array   
     My problem: I do not have to tell if without the statement Gaddafi again how to walk with the array without the victim of a nest, and even then, it would like to work with any input that I programs to consider will not be enough, this.  
     Any ideas will be useful, thank you very much in advance.  
     Note: There are some unstable variables that I was testing, but I could not work them.  
      
     
     
     Other answers indicate as yet, in the JavaScript string a  indexOf  is the function you want if you want to see how this has been done "by hand", then you can modify your function like this:  
      var sourceSearch = function (Text) {var i, j, ok; // Always declare their local variables the world is corrupt! // (i = 0; i & lt; source.length; i ++) for each start position {ok = true; // check for a match (j = searchString.length - 1; ok & amp;; j = 0; -j) {ok = source [i + j] === search string [j]; } If (OK) {// Started from index in search string source}}};   
     This function searches for all the positions on the  source , on which the  search string  was found (of course, you loop on the first success Can break out.) The argument is that in order to use the external loop, in the  source , each candidate is in advance to start the situation and use the internal loop to check that The situation is actually a match condition for  searchString .  
     This is not the best algorithm for the discovery of stars The built-in algorithm is very fast (both because it is a better algorithm and because it is the original code).

Comments

Post a Comment

Popular posts from this blog

excel vba - How to delete Solver(SOLVER.XLAM) code -

-
After opening several examples of macro / code written, I suddenly get stuck with a code that seems safe. Solver (SOLVER.XLAM) is doing this notation and I would like to remove it from my system. I do not think this is a relativant code. Can anyone tell me what should I do? I have already installed something to remove the password but Solver is still asking for password and I can not get rid of it! itemprop = "text"> Solver Excel is add-in If you want to delete it, then Excel Application & gt; Options & gt; Add-ins & gt; Search for 'Go to' button and gt; Uncheck the solver on the list like press something (I can not give you the exact path because I have the Polish version of Excel). Trying to open Solver's VBA code is not good because it There is allegedly copyright. Besides, I do not think Solver creates any disadvantages while working with Excel or VBA.
Read more

github - Teamcity & Git - PR merge builds - anyway to get HEAD commit hash? -

-
I have a team city build project with Gitbab VCS route, I have been triggered for both / head on PR and / Merge the referee. The annoying thing is that you can not do anything useful with the merged hash - it is not present in Gitobb. I want to exclude newsgate packages with head in gutub comet situations in the version number along with Hewash (Newsaging 7) for the music build, but against head hash. However, I can not see a way to get the head hashes while constructing that merge. I just want to head because it's useless - we only care about merge. (PR - Pull Request) This command works reliably while running One on / merge is git log --no-merge -1 ---- = '% h'
Read more

ios - Replace text in UITextView run slowly -

-
I have a UITextView and I change a word like the code at the end of UITextView.text: - (void) Replace TexttechWitWord: (NSString *) word {NSString * currentTextViewText = self.textView.text; CurrentTextViewText = [currentTextViewText stringByReplacingCharactersInRange: NSMakeRange ([self.textView.text length] - [word length], [word length]) withString: word; Self.textView.text = currentTextViewText; } Replacement work is fine, but it runs very slowly and very slowly when the textView now lengthens Is there any better way? I try the replacement range: with text for a week but still stuck. Not to know how to use it to replace it in your case. Please guide! Thanks in advance! This is an important job. As you are using an irreversible string and you are creating a very long string and before Assigned to NSString created from. NSString will be used instead of NSMutableString . - (UITableViewCell *) TableView: (UITableView *) Table View CellForOutPath: (NSIndex...
Read more