indexof

I'm running AQTime on this piece of code, I found that .IndexOf takes 16% of the time vs close to 80% for the other piece... They appear to use the same IsEqual and other routines. Called 116,000 times inserting 30,000 items. None of the List<> objects gets over 200 elements. (I may be using AQTime incorrectly, I'm looking into this) class PointD : IEquatable<PointD> { public double X, Y, Z; bool IEquatable<PointD>.Equals(PointD other) { return ((X == other.X) && (Y == other.Y) && (Z == other.Z)); } } class PerfTest { readonly List<PointD> _pCoord3Points = new List<PointD>(); public int

Edit: This question is out of date as the Polyfill example has been updated. I'm leaving the question here just for reference. Read the correct answer for useful information on bitwise shift operators. Question: On line 7 in the Polyfill example of the Mozilla Array.prototype.indexOf page they comment this: var length = this.length >>> 0; // Hack to convert object.length to a UInt32 But the bitwise shift specification on Mozilla clearly states that the operator returns a value of the same type as the left operand: Shift operators convert their operands to thirty-two-bit integers and return a

I have a string in an Array that contains two commas as well as tabs and white spaces. I'm trying to cut two words in that string, both of them before the commas, I really don't care about the tabs and white spaces. My String looks similar to this: String s = "Address1 Chicago, IL Address2 Detroit, MI" I get the index of the first comma int x = s.IndexOf(','); And from there, I cut the string before the index of the first comma. firstCity = s.Substring(x-10, x).Trim() //trim white spaces before the letter C; So, how do I get the index of the second comma so I can get my second string? I really

I wrote the following snippet to get rid of excessive spaces in slabs of text int index = text.IndexOf(" "); while (index > 0) { text = text.Replace(" ", " "); index = text.IndexOf(" "); } Generally this works fine, albeit rather primative and possibly inefficient. Problem When the text contains " - " for some bizzare reason the indexOf returns a match! The Replace function doesn't remove anything and then it is stuck in a endless loop. Any ideas what is going on with the string.IndexOf? Ah, the joys of text. What you most likely have there, but got lost when posting on SO, is a "soft hyphen".

I'm trying to find out how many times one string appears in another. For my testing, I'm using "ea" for wordOne and "Ilikedthebestontheeastbeachleast" for wordTwo. My output is returning 0 for my "appearance" variable, which should store how many times "ea" appears in wordTwo. Here's the relevant code section: int wordTwoLength = wordTwo.length(); System.out.println(wordTwoLength); while (wordTwoLength > 0) { positionCount = wordTwo.indexOf(wordOne, positionCount); appearances = appearances++; wordTwoLength = (wordTwoLength - positionCount); } System.out.println(appearances); What do you mean