title |
---|
Comparison to OCaml |
If you come from OCaml or are a newcomer reading a tutorial written on OCaml, this guide's for you! But don't forget that reason-tools can convert between OCaml and Reason syntax on the fly.
OCaml | Reason |
---|
{ | |
"suggest.noselect": false, | |
"coc.preferences.formatOnSaveFiletypes": [ | |
"javascript", | |
"typescript", | |
"typescriptreact", | |
"json", | |
"javascriptreact", | |
"typescript.tsx", | |
"graphql" |
import re | |
import sys | |
urls=[] | |
try: | |
file_name=sys.argv[1] | |
replacement=sys.argv[2] | |
except: | |
print("[!] Enter urls file name") |
title |
---|
Comparison to OCaml |
If you come from OCaml or are a newcomer reading a tutorial written on OCaml, this guide's for you! But don't forget that reason-tools can convert between OCaml and Reason syntax on the fly.
OCaml | Reason |
---|
program myalltoall | |
!Program to show a simple implementation of a deadlock avoiding mpi loop among all processes which, | |
!in principle, is similar to an alltoall loop. However, the main purpose of the technique shown here is to | |
!properly reorder shortest (i.e., each process with just few others) non-blocking communication loops, | |
!in order to alleviate the burden on the communication side (as each exchange is matched, everything | |
!is exchanged very quickly). Here, it is tested against the the mpi_allreduce intrinsic with MPI_SUM | |
!on a single real variable, but IT IS NOT a replacement for allreduce (nor alltoall or any other intrinsic). | |
use, intrinsic :: iso_fortran_env, only : int32, real64 | |
use mpi | |
implicit none |