All packages, except for Tini have been added to termux-root. To install them, simply pkg install root-repo && pkg install docker. This will install the whole docker suite, left only Tini to be compiled manually.
| // ==UserScript== | |
| // @name Amozeshyar Bypass iGap | |
| // @version 1 | |
| // @description Bypass Amozeshyar iGap code | |
| // @author Yedoost | |
| // @match http://stdn.iau.ac.ir/Student/captchaProcess | |
| // @match http://stdn.iau.ac.ir/Student/manageAccount | |
| // @grant none | |
| // ==/UserScript== |
Compile time sequences in D are insane, not insane "crazy" but insanely interesting. One of the selling points of D is that it takes compile time programming in C++ to another level, where templates in C++ were a 'happy?' accident, in D they were purposely built into the language along with other generic and meta-programming tools. To highlight this aspect of the D language, we will implement a selection of templates to manipulate compile time sequences of types, only the text function from the standard library in the std.conv module will be imported which is for concatenating text, we will build everything else including AliasSeq and Nothing from the std.meta module which they are easy one-liners.
This article builds on the concepts of a
| #!/usr/bin/env zsh | |
| set -e; | |
| set +m; # Job control would've been nice, but manual round robin it is, sigh. | |
| if [ -z "${ZSH_VERSION+x}" ]; then | |
| echo 'Try again with zsh.'; | |
| exit 1; | |
| fi; |
| /+ dub.sdl: | |
| name "pointer_arithmetic" | |
| +/ | |
| import std.traits : isPointer, PointerTarget; | |
| template IndirectionCounter(T) | |
| { | |
| static if (isPointer!T) | |
| enum IndirectionCounter = 1 + IndirectionCounter!(PointerTarget!T); |
| " Vim syntax file | |
| " Language: Todo | |
| " Maintainer: Huy Tran | |
| " Latest Revision: 14 June 2020 | |
| if exists("b:current_syntax") | |
| finish | |
| endif | |
| " Custom conceal |
| Mute these words in your settings here: https://twitter.com/settings/muted_keywords | |
| ActivityTweet | |
| generic_activity_highlights | |
| generic_activity_momentsbreaking | |
| RankedOrganicTweet | |
| suggest_activity | |
| suggest_activity_feed | |
| suggest_activity_highlights | |
| suggest_activity_tweet |
| On void linux. | |
| Under `/etc/containers/` there is a file called `registries.conf`. It is complemented by `man 5 containers-registries.conf`. | |
| Change (for me lines 11-12) which say | |
| [registries.search] | |
| registries = [] | |
The USGS provides detailed downloads of fire perimeters, with timestamped files that can be used to show the spread of a major fire over time.
Using the 2017 Thomas fire as an example, we'll process this data into a single SVG file with all the different perimeter measurements.
This index page contains links to a series of shapefiles of the fire boundary, each one with a timestamp:
https://rmgsc.cr.usgs.gov/outgoing/GeoMAC/2017_fire_data/California/Thomas/
| // These hashes are for algorithmic use cases, such as bucketing in hashtables, where security isn't | |
| // needed and 32 or 64 bits is enough (that is, rare collisions are acceptable). These are way simpler | |
| // than sha1 (and all its deps) or similar, and with a short, clean (base 36 alphanumeric) result. | |
| // A simple, *insecure* 32-bit hash that's short, fast, and has no dependencies. | |
| // Output is always 7 characters. | |
| // Loosely based on the Java version; see | |
| // https://stackoverflow.com/questions/6122571/simple-non-secure-hash-function-for-javascript | |
| const simpleHash = str => { | |
| let hash = 0; |