Latest recipes tagged "search"

Tkinter search box (Python)

2017-04-08T12:27:36-07:00

Python recipe 580773 by Miguel Martínez López (entry, search, searchbox, tkinter). Revision 9.

Instead of using two colors for active background and normal background, I use only one color and opacity parameter.

I trigger the feeling of a button using different colors when the mouse is and isn't over. Many modern HTML search boxes uses the same approach.

Command function receives text of entry box when button is pressed.

Recursive find replace in files using regex (Python)

2016-04-28T13:24:15-07:00

Python recipe 580653 by ccpizza (files, regex, replace, search). Revision 5.

Recursively find and replace text in files under a specific folder with preview of changed data in dry-run mode

Example Usage

See what is going to change (dry run):

find_replace.py --dir project/myfolder --search-regex "\d{4}-\d{2}-\d{2}" --replace-regex "2012-12-12" --dryrun

Do actual replacement:

find_replace.py --dir project/myfolder --search-regex "\d{4}-\d{2}-\d{2}" --replace-regex "2012-12-12"

Do actual replacement and create backup files:

find_replace.py --dir project/myfolder --search-regex "\d{4}-\d{2}-\d{2}" --replace-regex "2012-12-12" --create-backup

Same action as previous command with short-hand syntax:

find_replace.py -d project/myfolder -s "\d{4}-\d{2}-\d{2}" -r "2012-12-12" -b

Output of find_replace.py -h:

DESCRIPTION:
    Find and replace recursively from the given folder using regular expressions

optional arguments:
  -h, --help            show this help message and exit
  --dir DIR, -d DIR     folder to search in; by default current folder
  --search-regex SEARCH_REGEX, -s SEARCH_REGEX
                        search regex
  --replace-regex REPLACE_REGEX, -r REPLACE_REGEX
                        replacement regex
  --glob GLOB, -g GLOB  glob pattern, i.e. *.html
  --dryrun, -dr         don't replace anything just show what is going to be
                        done
  --create-backup, -b   Create backup files

USAGE:
   find_replace.py -d [my_folder] -s <search_regex> -r <replace_regex> -g [glob_pattern]

asskick.py (Python)

2014-09-20T08:16:57-07:00

Python recipe 578940 by p@ntut$ (kickass, search, torrents).

URL: http://pantuts.com/2014/09/20/asskick-py-python-script-search-download-torrents-kickass/

Python script to search and download torrents from KickAss torrents.

Setting up a listbox filter in Tkinter(python 2.7) (Python)

2014-04-10T10:25:38-07:00

Python recipe 578860 by Wykleph (filter, listbox, python, search, searchbar, tkinter). Revision 3.

If you have a listbox and need to filter the contents of the listbox based on the contents of an entry field, this will help you! Shoutout to Nikola-K for the revision. It's much simpler now :D

grep in Python (Python)

2014-03-05T19:47:50-08:00

Python recipe 578845 by Andy Dustman (generator, grep, search).

The grep() function is inspired by UNIX grep, but is not limited to string patterns and files or streams.

Locate and see the biggest cross in a random matrix (Python)

2013-09-13T13:31:03-07:00

Python recipe 578657 by alexander baker (numpy, python, search).

Interesting search space problem.

Search engine (Batch)

2013-10-10T16:18:09-07:00

Batch recipe 578646 by greg zakharov (search). Revision 2.

Quick search on files index embedded directly in the command script. For example: "search.cmd exe$" - looks for all EXE files in index or just "search.cmd blahblahblah" - looks for all matches with "blahblahblah" in paths. To remove index from script use "search.cmd /fix:me" command (without quotes).

Finding sets in the card game SET! (Python)

2013-04-05T12:49:36-07:00

Python recipe 578508 by Sander Evers (algorithm, optimization, search, setgame). Revision 2.

In the card game SET!, players are shown an array of 12 (or more) symbol cards and try to identify a so-called 3-card set among these cards as quickly as possible.

A card has four attributes (number, shape, color and shading), each of which can take 3 possible values. In a set, for each attribute, all three cards should have either the same value, or the three different values.

This recipe solves the problem of finding all sets within an array of an arbitrary number of cards, showing some clever optimizations and celebrating the clarity of Python in expressing the algorithms.

Windows Registry: Search & Destroy (Python)

2012-07-12T12:23:05-07:00

Python recipe 578209 by Stephen Chappell (archive, delete, old, search, windows_registry).

If you know that your registry has useless information in it and want to remove entries, this recipe was provide you with a simple way of accomplishing such a purpose. After entering strings to match and causing an EOF, the program will search for what you entered, and is designed to automatically delete what was requested. This is committed for archival to be run under Python 2.5 or later versions.

Find a line of text in another file (Python)

2012-06-15T15:45:18-07:00

Python recipe 578164 by sami jan (line, search). Revision 2.

This is a simple recipe - it reads a line in file, removes the line-ending and attempts to search throughout another file for the same line, anywhere in the file

In case a line is missing, the line number is printed to stdout

Find Path to Object (Python)

2012-02-05T07:07:33-08:00

Python recipe 578033 by Stephen Chappell (path, search).

After wondering what the easiest what to access one object from another was, the following functions were written to automatically discover the shortest path possible. The find function takes the item to find and the object to find it from and tries finding out the best access path. The optional arguments control the search depth, memory usage, et cetera. The nth function is a helper function for accessing data containers that cannot be indexed into. As a final note, line thirteen (while candidates:) will probably never evaluate to false.

Find Multiple Elements In a List (Python)

2011-11-05T23:40:41-07:00

Python recipe 577943 by Alexander James Wallar (enumerate, find, list, search, search_list).

This algorithm searches for more than one element in a list. The input is a list that you want to search through and a list of elements that you want to search for. The output is a multidimensional list with the positions of the elements you are searching for in the search list in the order that you listed them.

Python Multidimensional List Searcher (Python)

2011-10-29T22:21:39-07:00

Python recipe 577929 by Alexander James Wallar (element, elements, find, finder, list, python, search).

This module/function lets you find a 2 dimensional list of indices for elements you are looking for in a super list. Example:

find([1,1,1,2,1,2,3,3],[1,2,3])

returns: [[0, 1, 2, 4], [3, 5], [6, 7]]

Python Binary Search Tree (Python)

2011-08-08T00:15:09-07:00

Python recipe 577830 by sivarama sarma (algorithms, maximum, minimum, search, sort).

A data structure that holds a sorted collection of values, and supports efficient insertion, deletion, sorted iteration, and min/max finding. Values may sorted either based on their natural ordering, or on a key function (specified as an argument to the search tree's constructor). The search tree may contain duplicate values (or multiple values with equal keys) -- the ordering of such values is undefined.

This implementation was made with efficiency in mind. In particular, it is more than twice as fast as the other native-Python implementations I tried (which all use objects to store search tree nodes).

Simple graph algorithms with a modular design (Python)

2011-04-21T13:40:32-07:00

Python recipe 577668 by jimmy2times (algorithms, breadth, depth, directed, first, graph, object, oriented, python, search, theory, undirected, visit). Revision 7.

The purpose of this recipe is to look at algorithmic graph theory from an object-oriented perspective.

A graph is built on top of a dictionary indexed by its vertices, each item being the set of neighbours of the key vertex. This ensures that iterating through the neighbours of a vertex is still efficient in sparse graphs (as with adjacency lists) while at the same time checking for adjacency is expected constant-time (as with the adjacency matrix).

Any valid class of graph must implement the interface defined by AbstractGraph.

A generic search algorithm takes as input a graph, source and target vertices and a queue. A queue must implement the methods Q.get(), Q.put() and Q.empty() in such a way to get the desired order in visiting the vertices.

Given this pattern, breadth-first and depth-first search are essentially defined by the corresponding expansion policies: the first one uses an actual FIFO queue, the second one a LIFO queue (or stack).

Binary search function. (Python)

2011-02-07T06:37:52-08:00

Python recipe 577565 by Kevin L. Sitze (binary, binary_search, bsearch, functional, lower_bound, optimal_solution, search, upper_bound). Revision 3.

For a number of years Python has provided developers with the special parameters 'cmp' and 'key' on list.sort and __builtin__.sorted. However Python does not provide a built-in mechanism for doing binary searches on such sorted lists. This recipe provides a simple function that allows you to perform binary searches on your sorted sequences.

Python Binary Search Tree (Python)

2011-01-10T02:27:08-08:00

Python recipe 577540 by Edward Loper (algorithms, maximum, minimum, search, sort). Revision 2.

kd-tree for nearest neighbor search in a k-dimensional space (Python)

2010-12-17T15:49:08-08:00

Python recipe 577497 by Matteo Dell'Amico (nearest, neighbor, search, tree). Revision 5.

The kd-tree can be used to organize efficient search for nearest neighbors in a k-dimensional space.

Search nth smallest element in really big file (Python)

2010-11-30T17:38:38-08:00

Python recipe 577478 by Teodor Kichatov (big, file, kth, python, search, selection, smallest).

Search nth smallest float in really big file (more, more and more bigger than available RAM) in a single pass through the file

if your file more than 150GB - you should use a more appropriate sampling params to the data more - you can use tempfile to store data(interval) returned from func fill_interval data: file with only one float number per line, good shuffled

Select some nth smallest elements, quickselect, inplace (Python)

2010-11-30T07:32:42-08:00

Python recipe 577477 by Teodor Kichatov (quickselect, search, selection).

fork of http://code.activestate.com/recipes/269554-select-the-nth-smallest-element/ O(n) quicksort style algorithm for looking up data based on rank order. Useful for finding medians, percentiles, quartiles, and deciles. Equivalent to [data[n] for n in positions] when the data is already sorted.