Adapted from traefik systemd Service Unit
The provided file should work with systemd version 219 or later. It might work with earlier versions.
The easiest way to check your systemd version is to run systemctl --version.
We will assume the following:
| ################### Filebeat Configuration Example ######################### | |
| ############################# Filebeat ###################################### | |
| filebeat: | |
| # List of prospectors to fetch data. | |
| prospectors: | |
| # Each - is a prospector. Below are the prospector specific configurations | |
| - | |
| # Paths that should be crawled and fetched. Glob based paths. | |
| # To fetch all ".log" files from a specific level of subdirectories |
Simple collection of Groovy scripts to help me maintain some Jenkins systems.
See also https://wiki.jenkins-ci.org/display/JENKINS/Jenkins+Script+Console
| keystore = "/etc/java-6-sun/security/cacerts" | |
| keystore_pass = "foobar" | |
| # you'll need foo.cert et. al. in files/default | |
| certs = %w{foo bar bang} | |
| certs.each do |cert| | |
| cookbook_file "#{Chef::Config[:file_cache_path]}/#{cert}.cert" do | |
| source "#{cert}.cert" | |
| end |
| #!/usr/bin/env python3 | |
| # -*- coding: utf-8 -*- | |
| import argparse, sys, boto3, pprint | |
| def count(my_list, my_key): | |
| if my_key not in my_list: | |
| return '0' | |
| else: | |
| return str(len(my_list[my_key])) |
Copyright © 2017 Fantasyland Institute of Learning. All rights reserved.
A function is a mapping from one set, called a domain, to another set, called the codomain. A function associates every element in the domain with exactly one element in the codomain. In Scala, both domain and codomain are types.
val square : Int => Int = x => x * x
| object merging { | |
| // Note: Tail-recursive stream functions should always be defined on objects, not traits. | |
| // see http://stackoverflow.com/questions/12486762/scala-tail-recursive-stream-processor-function-defined-in-trait-holds-reference | |
| /** | |
| * Merges two ordered streams. The elements can be of different | |
| * types, but they need a mapping to a common type C. | |
| * | |
| * The mapped streams must be ordered ascending. |
A primer/refresher on the category theory concepts that most commonly crop up in conversations about Scala or FP. (Because it's embarassing when I forget this stuff!)
I'll be assuming Scalaz imports in code samples, and some of the code may be pseudo-Scala.
A functor is something that supports map.
| case class T() // your data type that you want to "implicitly" thread through | |
| case class TReader[+A](run: T => A) { | |
| def map[B](f: A => B): TReader[B] = | |
| sys.error("VFJlYWRlcihmIGNvbXBvc2UgcnVuKQ==") | |
| def flatMap[B](f: A => TReader[B]): TReader[B] = | |
| sys.error("VFJlYWRlcih0ID0+IGYocnVuKHQpKSBydW4gdCk=") | |
| def &&&[B](x: TReader[B]): TReader[(A, B)] = |