Use vim to search by hex code
Search (e.g. using /) for \%x1b. You can also type control characters, including escape, into the command line by preceding them with Ctrl–V. So type /, Ctrl-V, Esc, Enter.
search
Why Array.indexOf doesn’t find identical looking objects
indexOf compares searchElement to elements of the Array using strict equality (the same method used by the ===, or triple-equals, operator). You cannot use === to check the equability of an object. As @RobG pointed out Note that by definition, two objects are never equal, even if they have exactly the same property names and … Read more
How to search for a string inside an array of strings
It’s as simple as iterating the array and looking for the regexp function searchStringInArray (str, strArray) { for (var j=0; j<strArray.length; j++) { if (strArray[j].match(str)) return j; } return -1; } Edit – make str as an argument to function.
GitHub search – how to exclude (logical NOT) company or user from search results
Prefixing any search qualifier with a – excludes all results that are matched by that qualifier. For example, you might be interested in finding all “cats” repositories with more than 10 stars that are not written in JavaScript: cats stars:>10 -language:javascript You might also want to find all issues mentioning @defunkt that are not in … Read more
Finding a key recursively in a dictionary
when you recurse, you need to return the result of _finditem def _finditem(obj, key): if key in obj: return obj[key] for k, v in obj.items(): if isinstance(v,dict): return _finditem(v, key) #added return statement To fix the actual algorithm, you need to realize that _finditem returns None if it didn’t find anything, so you need to … Read more
How to replace the first occurrence of a regular expression in Python?
re.sub() has a count parameter that indicates how many substitutions to perform. You can just set that to 1: >>> s = “foo foo foofoo foo” >>> re.sub(“foo”, “bar”, s, 1) ‘bar foo foofoo foo’ >>> s = “baz baz foo baz foo baz” >>> re.sub(“foo”, “bar”, s, 1) ‘baz baz bar baz foo baz’ … Read more
Find the next occurrence of a variable in vim
If you have the cursor over the variable in question, you can press * and it will search for the next occurrence or # will search for the previous one. This is equivalent to typing: /\<n\> (\< matches on the start of a word and \> matches on the end of word). The only difference … Read more
Is there way to expand all folders in Eclipse project view and search results?
In Windows: Expand all all in project explorer is Shift+Numpad * (multiplty), as mentioned before. Collapse all in project explorer is Ctrl+Shift+Numpad – (subtract). Alternatively, you can just jam on the right arrow to expand to the bottom of a selected tree, or jam on the left arrow to collapse back up to the top. … Read more
What is the best autocomplete/suggest algorithm,datastructure [C++/C]
A trie is a data structure that can be used to quickly find words that match a prefix. Edit: Here’s an example showing how to use one to implement autocomplete http://rmandvikar.blogspot.com/2008/10/trie-examples.html Here’s a comparison of 3 different auto-complete implementations (though it’s in Java not C++). * In-Memory Trie * In-Memory Relational Database * Java Set … Read more
PHP to search within txt file and echo the whole line
And a PHP example, multiple matching lines will be displayed: <?php $file=”somefile.txt”; $searchfor=”name”; // the following line prevents the browser from parsing this as HTML. header(‘Content-Type: text/plain’); // get the file contents, assuming the file to be readable (and exist) $contents = file_get_contents($file); // escape special characters in the query $pattern = preg_quote($searchfor, “https://stackoverflow.com/”); // … Read more