The reason is to do not import `std.uni` tables, `std.string` and
probably `std.algorithm`. Note that format is used in CTFE code and
`Exception` handing.
And it is more comfortable to import `format` from `std.format`.
std.format: clean imports (2)
remove import std.math : pow from std.uni
update scope imports in std.algorithm
update scope imports in std.exception
doFormat -> template
update scope imports in std.typecons
update scope imports in std.functional
update scope imports in std.range
update std.conv scope import
std.format: clean imports (2)
remove import std.math : pow from std.uni
update scope imports in std.algorithm
update scope imports in std.exception
doFormat -> template
update scope imports in std.typecons
update scope imports in std.functional
update scope imports in std.range
move sfromat
add public import of sformat
use std.uni
1. Make binaryFun correct for integer comparison.
2. Remove import of half of phobos for 100% cases in phobos.
`sort`, `cmp`, `find`, `startsWith`, `sum` and other algorithms would
be compiled faster.
fix safeOp
fix safeOPs
Fix new unittest
fix binaryReverseArgs
fix not
fix new code
fix spaces after if
optimization
1. CTFE
2. Runtime (without inlining)
change condition
fix new code
fix safeOp
optimize CTFE
CTFE optimization
immutable -> enum
remove aliases
remove macros
CTFE matching
add debug info && fix not
add spaces
minor fix
added debug example
add debug unittests & fix
fix also and add unittests
fix
typo
if (!__ctfe) assert(false); added
use 01
- previous implementation was dropping complete
hash-table whenever max size was reached
- new implementation simply replaces old values
in a fixed size hash-table when hashes collide
- use cuckoo hashing for better space usage and to
reduce collisions of frequently used values
