Tutorial by Examples: bon

A practical use case of a generator is to iterate through values of an infinite series. Here's an example of finding the first ten terms of the Fibonacci Sequence. def fib(a=0, b=1): """Generator that yields Fibonacci numbers. `a` and `b` are the seed values""" ...

Template Definition template linux.bonding { subject = {{.Last.Status}}: {{.Eval .Alert.Vars.by_host}} bad bond(s) on {{.Group.host}} body = `{{template "header" .}} <h2>Bond Status</h2> <table> <tr><th>Bond</th><th>Slave&...

The following method computes the Nth Fibonacci number using recursion. public int fib(final int n) { if (n > 2) { return fib(n - 2) + fib(n - 1); } return 1; } The method implements a base case (n <= 2) and a recursive case (n>2). This illustrates the use of re...

You can calculate a number in the Fibonacci sequence using recursion. Following the math theory of F(n) = F(n-2) + F(n-1), for any i > 0, // Returns the i'th Fibonacci number public int fib(int i) { if(i <= 2) { // Base case of the recursive function. // i is either 1...

// Returns the nth number in the Fibonacci sequence function fibonacci(n) { if (n === 1 || n === 0) { return 1; } else { return fibonacci(n - 1) + fibonacci(n - 2); } }

Lazy evaluation means Haskell will evaluate only list items whose values are needed. The basic recursive definition is: f (0) <- 0 f (1) <- 1 f (n) <- f (n-1) + f (n-2) If evaluated directly, it will be very slow. But, imagine we have a list that records all the results, fibs ...

Backbone.js is made up of four separate components: Collections, Models, Routers, and Views. Each of these serve different purposes: Model - represents a single data object, but adds additional functionalities not provided by native JavaScript objects, such as an event system and a more conveni...

How to install the Android Debugging Bridge (ADB) to a Linux system with the terminal using your distro's repositories. Install to Ubuntu/Debian system via apt: sudo apt-get update sudo apt-get install adb Install to Fedora/CentOS system via yum: sudo yum check-update sudo yum install androi...

The Fibonacci numbers are defined inductively as F0 = 0 F1 = 1 Fn+2 = Fn + Fn+1 The sum of the first n+1 Fibonacci numbers is given by F0 + F1 + F2 + ... + Fn = Fn+2 - 1. This summation arises, among other places, in the analysis of Fibonacci heaps, where it's used to provide a lower b...

using System; using System.Collections.Generic; using System.Linq; using System.Numerics; // also add reference to System.Numberics namespace ConsoleApplication33 { class Program { private static IEnumerable<BigInteger> Fibonacci() { BigInteger p...

MarkLogic is first and foremost a search engine, so let's use two different methods to search for this document. Using search:search() This gives a peek into using search:search() to develop search applications. This library provides Google-like search results and will likely speed up your develop...

Include using System.Numerics and add a reference to System.Numerics to the project. using System; using System.Numerics; namespace Euler_25 { class Program { static void Main(string[] args) { BigInteger l1 = 1; BigInteger l2 = 1; ...

The simple and most obvious way to use recursion to get the Nth term of the Fibonnaci sequence is this int get_term_fib(int n) { if (n == 0) return 0; if (n == 1) return 1; return get_term_fib(n - 1) + get_term_fib(n - 2); } However, this algorithm does not scale for higher ...

Debian/Ubuntu # apt-get update & apt-get -y upgrade # apt-get install cron Fedora/CentOS # yum -y update # yum install vixie-cron Arch # pacman --noconfirm -Syu # pacman -S cronie

In most cases, the range_lookup is used as FALSE (an exact match). The default for this parameter is TRUE - it is less commonly used in this form, but this example shows one usecase. A supermarket gives a bonus based on the customers monthly spend. If the customer spends 250 EUR or more in a mon...

;;Find the nth Fibonacci number for any n > 0. ;; Precondition: n > 0, n is an integer. Behavior undefined otherwise. (defun fibonacci (n) (cond ( ;; Base case. ;; The first two Fibonacci numbers (indices 1 and 2) are 1 by defin...

Note: at is not installed by default on most of modern distributions. To execute a job once at some other time than now, in this example 5pm, you can use echo "somecommand &" | at 5pm If you want to catch the output, you can do that in the usual way: echo "somecommand > o...

public static Boolean ExportDB(String DATABASE_NAME , String packageName , String folderName){ //DATABASE_NAME including ".db" at the end like "mayApp.db" String DBName = DATABASE_NAME.substring(0, DATABASE_NAME.length() - 3); File data = Environment.getDataDir...

Assuming you have a model that looks like the following, we will get up an running with a simple barebones read-only API driven by Django REST Framework ("DRF"). models.py class FeedItem(models.Model): title = models.CharField(max_length=100, blank=True) url = models.URLField(b...

def createDissolvedGDB(workspace, gdbName): gdb_name = workspace + "/" + gdbName + ".gdb" if(arcpy.Exists(gdb_name): arcpy.Delete_management(gdb_name) arcpy.CreateFileGDB_management(workspace, gdbName, "") else: arcpy.CreateFi...