Popular recipes tagged "meta:requires=none"

A white noise generator to sooth baby to sleep. (Bash)

2017-05-13T12:12:30-07:00

Bash recipe 580801 by Barry Walker (alarm, apple, audio, baby_alarm, cygwin, linux, noise, sleep, sound, whitenoise).

This is a simple BASH, DASH and SH script to sooth a newborn baby to sleep for a laptop with a builtin mic. Develeoped around an Apple MacBook Pro.

Usage:- [./]shush.sh <time in seconds from 18 to 2700> [sensitivity [Hh|Mm|Ll]]<CR>

If time is omitted it defaults to 2 bursts of 9 seconds each and if sensitivity is omitted defaults to [M]edium.

It uses Quicktime Player for Apple OSX 10.12.4 minimum /dev/dsp for CygWin and some Linux flavours and arecored for Linux ALSA machines for baby awake detector.

Upon the two arguments the white noise generator runs for approximately the time given in $1 in bursts of 9 seconds until the time limit is reached. $2 is used to detect of baby is awake and reruns the noise generator again with a new noise waveform.

Enjoy...

Recursive fc/diff for Windows, optionally copy missing/different files (Tcl)

2017-04-08T16:40:25-07:00

Tcl recipe 580776 by John Brearley (compare, file, tcl).

Utility to add recursive capability to fc.exe on Windows. Will optionally copy/update missing or older files as needed. If you have a diff.exe in your path, say from having installed TkDiff utility, the diff.exe will be used as the prirmary compare tool, with fc.exe as the backup tool.

diff_copy.tcl Utility for daily differential backups of large windows directory structures (Tcl)

2017-04-10T13:51:58-07:00

Tcl recipe 580779 by John Brearley (backup, daily, tcl).

When you have terrabytes of data with 100,000+ files, it is no longer practical to blindly copy the entire data structure on a daily basis. I wrote this utility diff_copy.tcl to sort out what has been changed/updated and what new files have been added and only copy the changed & new items. If the date/time of the source file is newer, the file will be copied. If the date/time of the source file is the same as the destination, the file sizes in bytes are checked to decide if a copy is necessary. If the source file is not present on the destination directory, the file is copied. There are options to remove old files from the destination directory or show what would be copied, but not actually do the copy.

Guess a number (Python)

2014-11-15T09:06:05-08:00

Python recipe 578962 by Benoit (function, game, random, sample).

This is just a little game to explain some very basic function in Python for beginner. RANDOM, Loop, Try and except...

Continous Fractions (Python)

2014-09-23T14:30:00-07:00

Python recipe 578936 by juan . Revision 2.

Calculate the continous fraction from a fraction or decimal number

Prime Factorization (Python)

2014-09-19T08:11:54-07:00

Python recipe 578938 by juan .

Calculates the prime factorization from a number.

division digit-by digit calculation (Python)

2014-09-19T08:33:35-07:00

Python recipe 578939 by juan .

Calculate a division digit by digit with t decimals

Greatest common divisor (Python)

2014-09-19T08:03:02-07:00

Python recipe 578937 by juan .

Calculate the Greatest common divisor from two numbers

First n primes numbers (Python)

2014-09-20T19:33:41-07:00

Python recipe 578923 by juan . Revision 6.

Using the Sieve of Eratosthenes find the first n primes numbers.

wrist friendly dictionary (Python)

2013-08-18T22:54:26-07:00

Python recipe 578644 by Ariel Keselman (dictionary, interface, nested).

this dictionary allows easy manual creation of nested hierarchies, like so:

window.style.width=5

or...

window['background-color'].rgb= 255,255,255

Type checking using Python 3.x annotations (Python)

2013-05-23T22:46:19-07:00

Python recipe 578528 by David Mertz (annotations, check, decorator, python3, type, typecheck). Revision 5.

Some other recipes have been suggested to allow type checking by various means. Some of these require the use of type specification in a decorator itself. Others try to be much more elaborate in processing a large variety of annotations (but hence require much more and more convoluted code).

The recipe provided below is very short, and simply provides actual type checking of arguments and return values. It utilizes an unadorned decorator, rather than manufacture one that is parameterized by types or other arguments.

Easy to use, easy to read, python based HTML generation (Python)

2013-06-21T14:47:21-07:00

Python recipe 578436 by Pavlos (html, template, text). Revision 4.

I was looking for a simple way to generate HTML directly in python that does not require learning a new template 'language' nor requires the installation of a big complex package. Closest thing I found was James Casbon's attempt(https://gist.github.com/1461441). This is my version of the same idea.

(2013-04-21) added some simplifications and support for switching off string interpolation. Added to github:

https://github.com/pavlos-christoforou/web

Recipe With No Name Yet (Python)

2012-08-22T17:57:12-07:00

Python recipe 578221 by Cyril (check, debug, decorator, wrapper). Revision 9.

Not a very new recipe, but a short one and (I hope) useful :

wrapping any function "f" with two decorators "enter_event" and "exit_event" that will trigger calling of user functions when, ... hum ... evidently, just before entering and just after exiting the "f" function.

Typical usages :

debugging on a function by function basis :
- emit a trace in log file to see when functions are called and check sequences correctness (very usefull when programming by events)
- feed a profile analyzer (by fine tuning which functions are enabled)
- feed a code coverage analyzer ( " )
kind of validator on function calling :
- implement programming by contracts :
  - check that parameters values of "f" function will not have an unexpected value or be of an unexpected type
  - this allow to increase code robustness by narrowing
- implement invariants (eg. check that returned value is always in the excepted range, ...)
- insure that a function follow specifications by meta-checking that has always predictable results (eg. return the fixed expected value for each possible input value, ...)
minimum modification of existing code
in the same thinking line as the "monkey patching" concept

Notes on usage :

recipe works on functions and any kind of methods (methods, class methods, and static methods)
the usage order of "@enter_event" and "@exit_event" decorators doesn't matter : the result will be the same

PLEASE VOTE FOR THIS RECIPE if you like it !

Determinant of matrix of any order (Python)

2012-04-24T10:49:00-07:00

Python recipe 578108 by Sachin Joglekar (algebra, determinant, matrix, order).

A small snipet of code to find the determinant of a mtrix of any order.Input must be a list like [[1,2,3],[4,5,6],[7,8,9]] (for a matrix of order 3). Works fine.

Output data in tabular form (Python)

2012-04-20T19:27:57-07:00

Python recipe 578105 by srikantkt (tabular). Revision 4.

Often times, data lists need to be output in tabular format. Here is a sample that allows specifying table heading and data rows. Came across recipe 577615 after I posted but I am still biased.

Silmultaneous linear equation solver(any order) (Python)

2012-04-24T12:29:30-07:00

Python recipe 578109 by Sachin Joglekar (algebra, crammer, determinants, equation, linear, simultaneous).

Solves simultaneous linear equations of any order using Crammer's rule. Required input is two lists..one for coefficients, and other for constants eg. 2x+3y=8 x+4y=6 will be written as simul([[2,3],[1,4]],[8,6])

Finding complete loops in a map of connected nodes (Python)

2012-04-24T18:47:21-07:00

Python recipe 578110 by Sachin Joglekar (circuit, connection, loops).

This module finds loops in a given map.Input is a dictionary like

d={1:[2,4,5,6],2:[1,3],3:[2,4,5,6],4:[1,3,5],5:[1,3,4],6:[1,3]}

this means node 1 is connected to nodes 2,4,5 and 6 and so on..

Output is a list of complete loops. for above examples,output is

[[1, 4, 5, 1], [3, 4, 5, 3], [1, 2, 3, 4, 1], [1, 2, 3, 5, 1], [1, 2, 3, 6, 1], [1, 4, 3, 5, 1], [1, 4, 3, 6, 1], [1, 5, 3, 6, 1], [1, 2, 3, 4, 5, 1], [1, 4, 5, 3, 6, 1]]

Finding the GCD of a list of numbers (a.k.a. Reducing numbers in a list) (Python)

2010-07-06T18:52:55-07:00

Python recipe 577282 by Stephen Akiki (common, denominator, gcd, greatest, lisst, reduce).

http://akiscode.com/articles/gcd_of_a_list.shtml

This python code snippet allows you to find the GCD of a list of numbers, after this it is a simple matter of diving all the numbers in the list by the GCD to reduce it.

Why this works...

The GCD of a list of numbers [a, b, c] is GCD(GCD(a, b), c). The reduce function does exactly this and thus gives you the GCD of all the numbers in the list.

Infinite Stream Divisor (Python)

2010-07-21T12:50:17-07:00

Python recipe 577326 by Narayana Chikkam (divisor, infinite, stream).

Maintain an F.S.A to keep track of the consequent remainders as states, input symbols as driving actions on each state. O(N) is the time complexity to find the given large string [in some radix(R), for some specific divisor(D)], where N is the length of the Input String which confirms to the Language Rules under the alphabet. O(R*D) is the space complexity to keep the F.S.A in memory for lookup!

Eight Queens With out Permutations (Python)

2010-07-21T10:11:20-07:00

Python recipe 577325 by Narayana Chikkam (eight, queens).

Eight Queens is one of the popular algorithms in backtracking. The solution given below uses simple math to reduce the processing. The logic is keep placing the coins on the board with below rules:

Don't place the coin if there is another coin present in the same row
Don't place the coin if there is another coin present in the same col
Don't place the coin if there is another coin present in any of the diagonal lines.

Keep repeating the above 3 rules recursively until we keep all the coins. Problem Definition: http://en.wikipedia.org/wiki/Eight_queens_puzzle