- Vlach, M.: Základní numerické metody (1971)
- Kohout, V.: Diferenciální geometrie (1971)
- Havrda, J.: Matematické programování (1972?)
- Kufner, A.: Geometrie Hilbertova prostoru (1973, 1975?)
- Beran, L.: Grupy a svazy (1974)
- Vlach, M.: Optimální řízení regulovatelných systémů (1975?)
- Ježek, J.: Univerzální algebra a teorie modelů (1976?)
- ???
- Boček, L.: Tenzorový počet (1976)
- Pondělíček, B.: Algebraické struktury s binárními operacemi (1977)
This file contains 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
module Melsort (melsort) where | |
-- TODO: Linked lists are not the best for this algorithm performance-wise. | |
-- Consider a different structure, perhaps Vector. | |
-- TODO: Some preconditions are required. | |
push :: Ord a => a -> [[a]] -> [[a]] | |
push x [] = [[x]] | |
push x ([y]:ls) -- TODO: Is it possible that ls /= [] here? It's not. | |
| x <= y = [x, y ] : ls |
This is an incomplete list of tools that aid in detecting type errors in JavaScript and statically typed languages that compile to JavaScript.
-
Flow is a type checker with gradual typing capabilities, classes, parametric polymorphism with constraints (bounded polymorphism), function overloading, union and intersection types, and modules.
-
TypeScript is a typed superset of JavaScript (todo: which version? ES6/7?) backed by Microsoft.It features contextual typing, interfaces and classes, parametric polymorphism (generics with
This file contains 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
/*! normalize.css v3.0.2 | MIT License | git.io/normalize */ | |
html { | |
font-family: sans-serif; | |
-ms-text-size-adjust: 100%; | |
-webkit-text-size-adjust: 100%; | |
} | |
body { margin: 0; } |
This file contains 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
// http://stackoverflow.com/a/2553109/227159 | |
/** | |
* In its constructor temp_value stores a reference to a variable and a copy of the | |
* variable's original value. In its destructor it restores the referenced variable | |
* to its original value. So, no matter what you did to the variable between | |
* construction and destruction, it will be reset when the temp_value object goes out | |
* of scope. | |
*/ |
This file contains 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
gcc -v --help 2>&1 | awk '/-W/ && !/=/ && !/[oO]ptions/ && !/larger-than/ { print $1 }' |
This file contains 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
#:This list | |
.PHONY: ? | |
?:;@for file in "Makefile $$(perl -lne 'print for m|^include\s+(.*)$$|g' Makefile)"; do \ | |
perl -0777 -ne 'while (m/#:\s*(.*?)\n\.PHONY:\s*(.*?)\n/sg) { print "make $$2\t# $$1\n"; }' "$${file}"; \ | |
done | sort -u | column -ts $$'\t' | |
# Source: https://github.com/gtramontina/sourcing/blob/023cae5/Makefile#L68-L72 |
This file contains 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
license: gpl-3.0 |
This file contains 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
import itertools | |
([1, 2, 5][i % 3] * 10**(i // 3) for i in itertools.count(0)) |