* adding fortran tutorial
* [fortran/en] fixing some typos
* [fortran/en] changed a word
* [fortran/en] changed another word
* [fortran/en] typos and improvements.
* [fortran/en] moving comments around
* [fortran/en] moving print statement introduction to appropriate section
* [fortran/en] changing exit code to generic error code
* [fortran/en] changing bessel_j0 (available from fortran 2008) to log10 (available since fortran 77).
* [fortran/en] being explicit about using cleaner Fortran 2003 notation
* [fortran/en] code whitespace consistency
* [fortran/en] adding examples on implied-DO loops.
* [fortran/en] small adjustment to implied-DO loop example to make it more idiomatic
* Add name to contributors list
* Fix typo
* Note convention on curly-braced blocks
* Replace hardcoded link to 2.1.1 documentation with generic current link
* Add notes on Elixir agents
* Add explanation of maps
* Add name to contributors list
* Fix code fence that was obscuring markdown
* Fix syntax error
* Remove disputed comment
* Remove from contributors list
* Added bash intro edits
* Fixed page header
* Finalizing updates
Implemented my changes in the main bash code chunk instead of as an out-of-code prologue
* Final touches
* Added citation for John and mkdir content
* Added removed original intro back in
* Update bash.html.markdown
Moved "hard way" link to top of article
Fixed spacing
Grouped `rm` commands
* Fixed typos
* Adding border related styleguides
Adding border related styleguides. Most of the modern designs have borders for their elements.
* Spacing the comments like the rest of the file
* Adding a reference for treemap
Adding reference for a treemap
* Removing my name from the contributors list
Removing my name from the contributors list as it requires a significant contribution to add my name to it.
* Add set and dict comprehensions for python 2 and 3
* Clean up formatting and generator explanation
* Include documentation for generator comprehensions
* Added the Logical and bitwise operators section
* Added a note for Short Circuit evaluation
Excerpt from https://en.wikipedia.org/wiki/Short-circuit_evaluation
C++ uses minimal evaluation, or McCarthy evaluation (after John McCarthy (computer scientist)) is the semantics of some Boolean operators in some programming languages in which the second argument is executed or evaluated only if the first argument does not suffice to determine the value of the expression: when the first argument of the AND function evaluates to false, the overall value must be false; and when the first argument of the OR function evaluates to true, the overall value must be true. In some programming languages (Lisp), the usual Boolean operators are short-circuit.