Estimated time: 10 minutes
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #!/bin/bash | |
| # | |
| # Requires: | |
| # - gdal_sieve.py | |
| # - ogr2ogr (GDAL) | |
| # - topojson (node.js) | |
| # Grab the relative directory for source file. | |
| SRC_DIR=`dirname $0` |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <string> | |
| #include <vector> | |
| #include <functional> // std::function, std::bind | |
| #include <algorithm> // std::transform, std::remove_if | |
| #include <numeric> // std::accumulate | |
| using namespace std; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Linked list | |
| data class Node<T>(var value: T, var next: Node<T>?); | |
| fun main() { | |
| val head = Node(1, null) | |
| val second = Node(2, Node(3, null)) // two more (init multiple) | |
| head.next = second | |
| println(head.value) // 1 | |
| println(head.next?.value) // 2 |
OlderNewer