You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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
Object-Oriented Programming in Fortran 2003 Part 2: Data Polymorphism
Object-Oriented Programming in Fortran 2003 Part 2: Data Polymorphism
Original article by Mark Leair, PGI Compiler Engineer
Note: This article was revised in March 2015 and again in January 2016 to bring it up-to-date with the production software release and to correct errors in the examples.
Výpočet největšího společného dělitele pomocí Euklidova algoritmu
#Euklidův algoritmus
Začnu tedy tím, co jsem se dočetla zajímavýho. 📖
Euklidův algoritmus byl napsán už asi 300 let př. n. l. a to panem matematikem Euklidem v knize Základy. Používá se pro výpočet největšího společného dělitele (greatest common divisor) přirozených čísel.
Existuje taky Rozšířený Euklidův algoritmus, ale o tom zas jindy. Teď už matematika!
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
Simple Makefile to build, run, tag and publish a docker containier to AWS-ECR
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 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
Putting cryptographic primitives together is a lot like putting a jigsaw
puzzle together, where all the pieces are cut exactly the same way, but there
is only one correct solution. Thankfully, there are some projects out there
that are working hard to make sure developers are getting it right.
The following advice comes from years of research from leading security
researchers, developers, and cryptographers. This Gist was [forked from Thomas
Ptacek's Gist][1] to be more readable. Additions have been added from
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
I got inspired to answer the questions posed to F# experts on "Why F#?". I have no claims to be an F# expert but I thought the questions were interesting.
How and when did you get started programming in F#?
I believe I started to look at F# around 2008. I am a language-curious person and was at the time working as a .NET developer so I naturally was excited when discovering F#.
How long did it take before you could code real world apps as much or more productively as in C#?