jQuery DataTables – Filter column by exact match
This will give you exact result for a column. table.column(i) .search(“^” + $(this).val() + “$”, true, false, true) .draw(); ie . search( input , regex, smart , caseInsen )
search
oracle blob text search
This is quite possible and easy to do. Simply use dbms_lob.instr in conjunction with utl_raw.cast_to_raw So in your case, if t1 is a BLOB the select would look like: select * from table1 where dbms_lob.instr (t1, — the blob utl_raw.cast_to_raw (‘foo’), — the search string cast to raw 1, — where to start. i.e. offset … Read more
Most efficient way to search the last X lines of a file?
# Tail from __future__ import with_statement find_str = “FIREFOX” # String to find fname = “g:/autoIt/ActiveWin.log_2” # File to check with open(fname, “r”) as f: f.seek (0, 2) # Seek @ EOF fsize = f.tell() # Get Size f.seek (max (fsize-1024, 0), 0) # Set pos @ last n chars lines = f.readlines() # Read … Read more
Automatically expand all in Eclipse Search results
No but you can use the keyboard shortcuts of your OS. On Linux, use Nk* (* on the numpad) to expand the current node and all children. Windows user can use Shift+Nk* On the Mac, select all nodes with Command+A and then expand them with Command+Right Arrow
How to optimally solve the flood fill puzzle?
As a heuristic, you could construct a graph where each node represents a set of contiguous, same-colour squares, and each node is connected to those it touches. (Each edge weighted as 1). You could then use a path-finding algorithm to calculate the “distance” from the top left to all other nodes. Then, by looking the … Read more
find svn revision by removed text
Building on khmarbaise’s script, I came up with this: #!/bin/bash file=”$1″ REVISIONS=`svn log $file -q –stop-on-copy |grep “^r” | cut -d”r” -f2 | cut -d” ” -f1` for rev in $REVISIONS; do prevRev=$(($rev-1)) difftext=`svn diff –old=$file@$prevRev –new=$file@$rev | tr -s ” ” | grep -v ” -\ \- ” | grep -e “$2″` if [ … Read more
O(klogk) time algorithm to find kth smallest element from a binary heap
Well, your intuition was right that we need extra data structure to achieve O(klogk) because if we simply perform operations on the original heap, the term logn will remain in the resulting complexity. Guessing from the targeted complexity O(klogk), I feel like creating and maintaining a heap of size k to help me achieve the … Read more
Fuzzy Searching with Mongodb?
I believe that to do “fuzzy” search you will need to use regex. This should accomplish what you’re looking for (escapeRegex function source here): function escapeRegex(text) { return text.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, “\\$&”); }; router.get(“https://stackoverflow.com/”, function(req, res) { if (req.query.search) { const regex = new RegExp(escapeRegex(req.query.search), ‘gi’); Jobs.find({ “name”: regex }, function(err, foundjobs) { if(err) { console.log(err); } … Read more
Find a file by name or path in Visual Studio Code
When you have opened a folder in a workspace you can do Ctrl+P (Cmd+P on Mac) and start typing the filename, or extension to filter the list of filenames if you have: plugin.ts page.css plugger.ts You can type css and press enter and it will open the page.css. If you type .ts the list is … Read more
“super star” or find the word under the cursor equivalent in emacs
As pointed out by paldepind, isearch-forward-symbol-at-point (M-s., by default) is a close equivalent to * in Vim. This function is available starting in GNU Emacs 24.4; if your Emacs is different or older, read on for alternatives. Usually I just do (M-b …) C-s C-w … C-s. That is: M-b to move to beginning of … Read more