The goal is to design simple flows that can be used to ingest data from files by copying and moving files as well as using brokers to send file contents.
You can download Apache Nifi and install it into your machine. Note that the current Apache Nifi needs Java 8. Check the document to see if a minimum configuration should be made for your installation.
Start Nifi server
| # 1. Install brew --> http://brew.sh/ | |
| # 2. run the following commands in your Terminal | |
| brew tap homebrew/dupes | |
| brew tap homebrew/versions | |
| brew tap homebrew/homebrew-php | |
| brew install --with-openssl curl | |
| brew install --with-homebrew-curl --with-apache php71 | |
| brew install php71-mcrypt php71-imagick | |
| # 3. Follow these instructions to make Apache and php-cli use the newer php executable and make the change persist after reboot. | |
| brew info php71 |
| ; Don't forget to change the Icon and Exec path to your needs | |
| ; And save this file into the ~/.local/share/applications/ directory | |
| [Desktop Entry] | |
| Version=1.0 | |
| Type=Application | |
| Name=Notes | |
| Icon=/home/mariocesar/bin/notes.png | |
| Exec=/home/mariocesar/bin/notes.py | |
| Categories=Accessories; |
| I just finally had my mind snap into place with understanding of the Y Combinator. Most explanations I read, even the ones using JS, didn't make much sense and were overly long so here follows my own, much simpler explanation. I will be using JS. | |
| We have fibonacci to start with, very simple recursive function. | |
| It's fixed points are 0 and 1, fib(0) = 0, and fib(1) = 1 | |
| That's all a fix point means, when the f(x) == x | |
| They are important because they are the only values at which recursion can cease. | |
| Our Fibonacci Function | |
| ====================== |
| package main | |
| import ( | |
| "bytes" | |
| "compress/gzip" | |
| "fmt" | |
| "encoding/base64" | |
| "io/ioutil" | |
| ) |
Note: This was written using elasticsearch 0.9.
Elasticsearch will automatically create an index (with basic settings and mappings) for you if you post a first document:
$ curl -X POST 'http://localhost:9200/thegame/weapons/1' -d \
'{
"_id": 1,
| #!/usr/bin/env python | |
| # -*- coding: utf-8 -*- | |
| # | |
| # Test that I passed on codility.com for TopTal company | |
| # | |
| # Task #1 | |
| def binary_gap(N): |
| package example; | |
| import org.apache.lucene.analysis.standard.StandardAnalyzer; | |
| import org.apache.lucene.document.*; | |
| import org.apache.lucene.index.*; | |
| import org.apache.lucene.queryparser.classic.ParseException; | |
| import org.apache.lucene.queryparser.classic.QueryParser; | |
| import org.apache.lucene.search.*; | |
| import org.apache.lucene.store.Directory; | |
| import org.apache.lucene.store.FSDirectory; |
| object hackerrank { | |
| object Solution { | |
| def main(args: Array[String]) { | |
| def fact(n: Int): Int = if (n == 1) 1 else n * fact(n - 1) | |
| for (n <- io.Source.stdin.getLines) { | |
| print(fact(Integer.parseInt(n.toString)) + "\n") | |
| } | |
| } | |
| } |
Disclaimer: The instructions are the collective efforts from a few places online. Nothing here is my original. But I want to put them together in one place to save people from spending the same time as I did.