362 private links
[fiction] From C code with a lot of bugs to Rust with improvments
git merge-base branch1 branch2 will find the common ancestor commit of two branches.
Tip : check that only one commit is applied out of each command
git log branch1..common
git log branch2..common
- Cherry-pick the fix commit in a new branch (based on a common ancestor of the 2 branches) which will be then merged into them.
- Partial fix will be the same technique but the merge will be reverted in the feature branch before merging the feature branch in the master (see this)
Priority order :
- Importance
- transition
- !important
- animation
- normal rules
- Origin
- Website
- User
- Browser
- Specificity
- inline (within a style HTML property)
- id
- class | attribute | pseudo-class
- type | pseudo-element
- Position --> Order of the rules (rules defined later are first applied)
strace programm allow us to figure out what a program does under the hood.
Part 2 (x86 asm, linux kernel)
Part 3 (ftrace, disk layouts, ext4)
Solution : box the iterator and give the proper lifetime in signature function :
pub fn values<'a>(&'a self) -> Box<Iterator<Item = &i32> + 'a> {
// ...
}Thanks a lot for this post; it is much clearer in my mind.
And the explanation for the prelude module.
Covering Rust syntax and most used concept as fast as possible : that's great !
Avec la version en ligne
Les 3ères formes normales en base de données
Wow such great explanations of JIT (Just-In-Time Compiler), Assemnly, JS and WebAssembly all together.
And now we understand why Rust seems better for WebAssembly. The Rust compiler manage the garbage collection at compile time.
And why WebAssembly seems promising.
I guess that more video games will be loaded directly from the web browser in the future
Well, the content is substantial
Oui !
La petite commande bashqui permet de générer un mot de passe :
gpg --gen-random --armor 2 SIZE avec SIZE étant la taille du mot de passe
Un superbe guide pour Android afin de bloquer les noms de domaine publicitaire