c# Programming Glossary: substrings

http://stackoverflow.com/questions/1341847/special-character-in-xpath-query

an expression that concatenates all non double quote substrings with the quotes e.g. concat foo ' ' bar StringBuilder sb new.. StringBuilder sb new StringBuilder sb.Append concat string substrings value.Split ' ' for int i 0 i substrings.Length i bool needComma.. concat string substrings value.Split ' ' for int i 0 i substrings.Length i bool needComma i 0 if substrings i if i 0 sb.Append..

Is there any scenario where the Rope data structure is more efficient than a string builder

http://stackoverflow.com/questions/1863440/is-there-any-scenario-where-the-rope-data-structure-is-more-efficient-than-a-str

unlike java strings do not share the character buffer on substrings a choice with pros and cons in terms of memory footprint. Ropes.. avoid this sort of issue. Ropes allow deferred loading of substrings until required Note that this is hard to get right very easy.. allow Read only strings with significant numbers of common substrings are amenable to simple interning for significant memory savings...

Strong password regex

http://stackoverflow.com/questions/3131025/strong-password-regex

aa is okay aaa is not. Make it . . 1 1 to reject repeated substrings of length more than one like ababab or add . before 1 to reject..

If strings are immutable in .NET, then why does Substring take O(n) time?

http://stackoverflow.com/questions/6742923/if-strings-are-immutable-in-net-then-why-does-substring-take-on-time

is O 1 if n does not grow large. Most people extract tiny substrings from tiny strings so how the complexity grows asymptotically.. irrelevant fast enough is by definition fast enough. The substrings extracted are typically small in size and short in lifetime.. strings and were extracting thousands of overlapping substrings with sizes in the hundred thousand character range and those..

How to convert hex to a byte array?

http://stackoverflow.com/questions/854012/how-to-convert-hex-to-a-byte-array

Invalid hex digit c EDIT Now slightly more efficient no substrings required... It's possible that ParseNybble could be more efficient...

Slow Regex performance

http://stackoverflow.com/questions/9687596/slow-regex-performance

there is no following . Also you're only testing for substrings instead of forcing the regex to match the entire string. And..