| // Compile with: | |
| // $ clang++ -O3 -std=C++11 main.cc -o main | |
| #include <iostream> | |
| #include <random> // The header for the generators. | |
| #include <ctime> // To seed the generator. | |
| using namespace std; | |
| int main() { |
| # Functions to generate networks ("graphs") for spatial ecology. | |
| # | |
| # Stores the graph in a rather inefficient (but easy-to-use) adjacency matrix | |
| # of boolean values. | |
| # | |
| # Key functions: | |
| # - geograph returns a random geometric graph. | |
| # - cgeograph returns a connected random geometric graph. | |
| # - geotree returns a random geometric tree. | |
| # |
| === Run information === | |
| Scheme:weka.classifiers.trees.J48 -C 0.25 -M 2 | |
| Relation: Dataset0 - Sheet1-weka.filters.unsupervised.attribute.Remove-R1-weka.filters.supervised.attribute.NominalToBinary-weka.filters.supervised.attribute.NominalToBinary-weka.filters.supervised.attribute.NominalToBinary-weka.filters.unsupervised.attribute.NumericToNominal-Rfirst-last | |
| Instances: 21 | |
| Attributes: 3 |
| bisection f a b e = if a < b then bis a b else bis b a | |
| where err = if e < 1e-15 then 1e-15 else e | |
| bis a b = let d = (b - a) / 2; m = (b + a) / 2 in | |
| if d < err then | |
| m | |
| else if f a * f m < 0.0 then | |
| bis a m | |
| else | |
| bis m b |
| bisection :: (Double -> Double) -> Double -> Double -> Double -> Maybe Double | |
| bisection f a b err | |
| | err < 1e-15 = Nothing | |
| | abs (b - a) / 2 < err = Nothing | |
| | a < b = bis a b | |
| | otherwise = bis b a | |
| where | |
| bis a b | |
| | d < err || f m == 0.0 = Just m | |
| | f a * f m < 0.0 = bis a m |
| # bisection(lambda x: x**2 - 2.0, 0, 100, 1e-15) | |
| def bisection(f, a, b, err): | |
| if err < 1e-15 or abs(b - a) / 2 < err: | |
| return None | |
| if a > b: | |
| a, b = b, a | |
| m = (b + a) / 2.0 | |
| while (b - a) / 2.0 > err and f(m) != 0.0: | |
| if f(a) * f(m) < 0.0: | |
| b = m |
| fizzbuzz a b x = [fb i | i <- [1..x]] | |
| where | |
| ab = a * b | |
| fb n | |
| | mod n ab == 0 = "FizzBuzz" | |
| | mod n a == 0 = "Fizz" | |
| | mod n b == 0 = "Buzz" | |
| | otherwise = show n | |
| main = mapM_ print $ fizzbuzz 5 7 1000 |
For a project named XXX with a postgreSQL database:
| <!DOCTYPE html> | |
| <html lang="en"> | |
| <head> | |
| <meta http-equiv="Content-Type" content="text/html; charset=UTF-8"> | |
| <meta charset="utf-8"> | |
| <title>Scriptoria -- a database of scientific documents written with distributed revision control systems.</title> | |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
| <meta name="description" content=""> | |
| <meta name="author" content=""> |
| #!/usr/bin/env ruby | |
| if ARGV.length != 1 then | |
| puts 'Provide a single argument between 0.1 (nearly black) and 1.0 (max brigthness).' | |
| exit(42) | |
| end | |
| b = ARGV[0].to_f | |
| b = (if b < 0.1 then 0.1 elsif b > 1.0 then 1.0 else b end).to_s |
