This commit is contained in:
commit
568474d52f
1591 files changed
+528213
No files matched your search
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"tool": "godbolt",
|
||||
"compiler": "mojo_1_2_0",
|
||||
"mojoVersion": "1.2.0",
|
||||
"source_sha256": "6cc9da2b05065bbfb293aa17dd81dbbc91e091f91f5af3a878b944b17686bfda",
|
||||
"stdin": "3 1 0 1 0 1 0 78986244726619 -46 1 0 1 0 5 -1 535928355657089 -51 7656119366529843 -51 end\n",
|
||||
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
|
||||
"asked": "2026-11-12",
|
||||
"result": {
|
||||
"compiled": true,
|
||||
"buildStderr": "",
|
||||
"executed": true,
|
||||
"exitCode": 0,
|
||||
"stdout": "24.0\n-2.3738310467722616e-15\n168.49822326347663",
|
||||
"stderr": "",
|
||||
"timedOut": false,
|
||||
"asm": null
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,4 @@
|
||||
def lennard_jones_force(r: Float64, epsilon: Float64, sigma: Float64) -> Float64:
|
||||
var s2 = (sigma / r) * (sigma / r)
|
||||
var s6 = s2 * s2 * s2
|
||||
return 24.0 * epsilon * (2.0 * s6 * s6 - s6) / r
|
||||
@@ -0,0 +1,4 @@
|
||||
def lennard_jones_force(r, epsilon, sigma):
|
||||
s2 = (sigma / r) * (sigma / r)
|
||||
s6 = s2 * s2 * s2
|
||||
return 24.0 * epsilon * (2.0 * s6 * s6 - s6) / r
|
||||
@@ -0,0 +1,42 @@
|
||||
{
|
||||
"name": "LennardJonesForce",
|
||||
"summary": "The force between two particles at distance R under the Lennard-Jones potential: positive pushes them apart.",
|
||||
"tags": [
|
||||
"molecular dynamics",
|
||||
"force"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Allen and Tildesley, Computer Simulation of Liquids, 2nd edition (Oxford, 2017), section 1.3.2, Atomic systems: the potential whose derivative this is"
|
||||
},
|
||||
{
|
||||
"title": "Lennard-Jones, Cohesion, Proc. Phys. Soc. 43 (1931): the 12-6 form",
|
||||
"url": "https://doi.org/10.1088/0959-5309/43/5/301"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "LennardJonesForce(1.0, 1.0, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "LennardJonesForce(1.122462048309373, 1.0, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "LennardJonesForce(2.5, 0.238, 3.4)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "multiply",
|
||||
"file": "ref/python/multiply.py",
|
||||
"note": "The same multiplications."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "multiply",
|
||||
"file": "ref/mojo/multiply.mojo",
|
||||
"note": "The same multiplications in Mojo."
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,10 @@
|
||||
// LennardJonesForce: the force between two particles at distance R under
|
||||
// the Lennard-Jones potential, F(R) = -dV/dR
|
||||
// = 24 Epsilon / R (2 (Sigma / R)^12 - (Sigma / R)^6).
|
||||
// Positive pushes the particles apart; it is 0 at the bottom of the well.
|
||||
FUNCTION LennardJonesForce(R : FLOAT, Epsilon : FLOAT, Sigma : FLOAT) RETURNS FLOAT
|
||||
REQUIRE R > 0.0
|
||||
DECLARE S2 : FLOAT <- (Sigma / R) * (Sigma / R)
|
||||
DECLARE S6 : FLOAT <- S2 * S2 * S2
|
||||
RETURN 24.0 * Epsilon * (2.0 * S6 * S6 - S6) / R
|
||||
ENDFUNCTION
|
||||
@@ -0,0 +1,12 @@
|
||||
{
|
||||
"tool": "dafny",
|
||||
"version": "4.11.0",
|
||||
"flags": [
|
||||
"verify",
|
||||
"--resource-limit",
|
||||
"20000000"
|
||||
],
|
||||
"source_sha256": "0dc08be0ccc13bef1bbad5bc4fa8efc54c39005c803c770a79fec941913ffb86",
|
||||
"verdict": "verified",
|
||||
"summary": "14 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"tool": "godbolt",
|
||||
"compiler": "mojo_1_2_0",
|
||||
"mojoVersion": "1.2.0",
|
||||
"source_sha256": "b82a068dc7a6e6f2af826f55f6ccb5f3493c7b236f1ab8ae80686ac71db93861",
|
||||
"stdin": "4 1 0 1 0 1 0 78986244726619 -46 1 0 1 0 5 -1 535928355657089 -51 7656119366529843 -51 8106479329266893 -53 1 0 1 0 end\n",
|
||||
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
|
||||
"asked": "2026-11-12",
|
||||
"result": {
|
||||
"compiled": true,
|
||||
"buildStderr": "",
|
||||
"executed": true,
|
||||
"exitCode": 0,
|
||||
"stdout": "0.0\n-1.0\n32.09189752256677\n6.6361189532529234",
|
||||
"stderr": "",
|
||||
"timedOut": false,
|
||||
"asm": null
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,59 @@
|
||||
function Pow(x: real, n: nat): real
|
||||
{
|
||||
if n == 0 then 1.0 else x * Pow(x, n - 1)
|
||||
}
|
||||
|
||||
function LJ(r: real, epsilon: real, sigma: real): real
|
||||
requires r > 0.0
|
||||
{
|
||||
4.0 * epsilon * (Pow(sigma / r, 12) - Pow(sigma / r, 6))
|
||||
}
|
||||
|
||||
lemma PowAdd(x: real, a: nat, b: nat)
|
||||
ensures Pow(x, a + b) == Pow(x, a) * Pow(x, b)
|
||||
{
|
||||
if a > 0 {
|
||||
PowAdd(x, a - 1, b);
|
||||
assert Pow(x, a + b) == x * Pow(x, a - 1 + b);
|
||||
}
|
||||
}
|
||||
|
||||
lemma Pow2(x: real)
|
||||
ensures Pow(x, 2) == x * x
|
||||
{
|
||||
assert Pow(x, 1) == x;
|
||||
}
|
||||
|
||||
lemma Pow6(s: real)
|
||||
ensures Pow(s, 6) == (s * s) * (s * s) * (s * s)
|
||||
{
|
||||
Pow2(s);
|
||||
PowAdd(s, 2, 2);
|
||||
PowAdd(s, 4, 2);
|
||||
}
|
||||
|
||||
lemma Pow12(s: real)
|
||||
ensures Pow(s, 12) == Pow(s, 6) * Pow(s, 6)
|
||||
{
|
||||
PowAdd(s, 6, 6);
|
||||
}
|
||||
|
||||
method LennardJones(r: real, epsilon: real, sigma: real) returns (v: real)
|
||||
requires r > 0.0
|
||||
ensures v == LJ(r, epsilon, sigma)
|
||||
{
|
||||
var s := sigma / r;
|
||||
var s2 := s * s;
|
||||
var s6 := s2 * s2 * s2;
|
||||
Pow6(s);
|
||||
Pow12(s);
|
||||
v := 4.0 * epsilon * (s6 * s6 - s6);
|
||||
}
|
||||
|
||||
// The potential crosses zero at R = Sigma.
|
||||
lemma ZeroAtSigma(epsilon: real, sigma: real)
|
||||
requires sigma > 0.0
|
||||
ensures LJ(sigma, epsilon, sigma) == 0.0
|
||||
{
|
||||
assert sigma / sigma == 1.0;
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
double lennard_jones(double r, double epsilon, double sigma) {
|
||||
double s2 = (sigma / r) * (sigma / r);
|
||||
double s6 = s2 * s2 * s2;
|
||||
return 4.0 * epsilon * (s6 * s6 - s6);
|
||||
}
|
||||
@@ -0,0 +1,4 @@
|
||||
def lennard_jones(r: Float64, epsilon: Float64, sigma: Float64) -> Float64:
|
||||
var s2 = (sigma / r) * (sigma / r)
|
||||
var s6 = s2 * s2 * s2
|
||||
return 4.0 * epsilon * (s6 * s6 - s6)
|
||||
@@ -0,0 +1,4 @@
|
||||
def lennard_jones(r, epsilon, sigma):
|
||||
s2 = (sigma / r) * (sigma / r)
|
||||
s6 = s2 * s2 * s2
|
||||
return 4.0 * epsilon * (s6 * s6 - s6)
|
||||
@@ -0,0 +1,2 @@
|
||||
def lennard_jones(r, epsilon, sigma):
|
||||
return 4.0 * epsilon * ((sigma / r) ** 12 - (sigma / r) ** 6)
|
||||
@@ -0,0 +1,67 @@
|
||||
{
|
||||
"name": "LennardJones",
|
||||
"summary": "The Lennard-Jones pair potential at distance R, with well depth Epsilon and zero-crossing distance Sigma.",
|
||||
"tags": [
|
||||
"molecular dynamics",
|
||||
"pair potential"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Jones, On the determination of molecular fields. II. From the equation of state of a gas, Proc. R. Soc. A 106 (1924)",
|
||||
"url": "https://doi.org/10.1098/rspa.1924.0082"
|
||||
},
|
||||
{
|
||||
"title": "Lennard-Jones, Cohesion, Proc. Phys. Soc. 43 (1931): the 12-6 form",
|
||||
"url": "https://doi.org/10.1088/0959-5309/43/5/301"
|
||||
},
|
||||
{
|
||||
"title": "Allen and Tildesley, Computer Simulation of Liquids, 2nd edition (Oxford, 2017), section 1.3.2, Atomic systems"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "LennardJones(1.0, 1.0, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "LennardJones(1.122462048309373, 1.0, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "LennardJones(2.5, 0.238, 3.4)"
|
||||
},
|
||||
{
|
||||
"call": "LennardJones(0.9, 1.0, 1.0)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "multiply",
|
||||
"file": "ref/python/multiply.py",
|
||||
"note": "The same multiplications."
|
||||
},
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "powers",
|
||||
"file": "ref/python/powers.py",
|
||||
"note": "The textbook formula with ** 12 and ** 6: the same function, rounded differently, held to agree to 12 digits on these cases. Near R = Sigma, where V is close to 0, the two roundings differ by far more relative to V (1.9e-8 at R = 1.000000001, Sigma = 1).",
|
||||
"rel": 1e-12
|
||||
},
|
||||
{
|
||||
"lang": "c",
|
||||
"level": "multiply",
|
||||
"file": "ref/c/multiply.c",
|
||||
"note": "The same multiplications in C."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "multiply",
|
||||
"file": "ref/mojo/multiply.mojo",
|
||||
"note": "The same multiplications in Mojo."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/lennard_jones.dfy",
|
||||
"note": "Over real numbers the multiplications compute the textbook formula exactly, and V(Sigma) = 0."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,11 @@
|
||||
// LennardJones: the Lennard-Jones pair potential at distance R,
|
||||
// V(R) = 4 Epsilon ((Sigma / R)^12 - (Sigma / R)^6). Epsilon is the depth of
|
||||
// the well, reached at R = 2^(1/6) Sigma, and V is 0 at R = Sigma. The powers
|
||||
// are built by multiplication from (Sigma / R)^2, as simulation codes do,
|
||||
// instead of ^, which rounds a little differently.
|
||||
FUNCTION LennardJones(R : FLOAT, Epsilon : FLOAT, Sigma : FLOAT) RETURNS FLOAT
|
||||
REQUIRE R > 0.0
|
||||
DECLARE S2 : FLOAT <- (Sigma / R) * (Sigma / R)
|
||||
DECLARE S6 : FLOAT <- S2 * S2 * S2
|
||||
RETURN 4.0 * Epsilon * (S6 * S6 - S6)
|
||||
ENDFUNCTION
|
||||
@@ -0,0 +1,12 @@
|
||||
{
|
||||
"tool": "dafny",
|
||||
"version": "4.11.0",
|
||||
"flags": [
|
||||
"verify",
|
||||
"--resource-limit",
|
||||
"20000000"
|
||||
],
|
||||
"source_sha256": "9881217a957b2d8700997063d9bda129337d7c266a287aeb76a0881a1b0b1b08",
|
||||
"verdict": "verified",
|
||||
"summary": "4 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"tool": "godbolt",
|
||||
"compiler": "mojo_1_2_0",
|
||||
"mojoVersion": "1.2.0",
|
||||
"source_sha256": "b4edcbbb2f76c79b75d2ac0a4516169fb6ea5ca14441a401b656f9291c2f5f7c",
|
||||
"stdin": "6 3 -2 1 0 -3 -2 1 0 2589569785738035 -50 1 0 1 -1 1 0 -3 2 5 1 3039929748475085 -51 3602879701896397 -55 end\n",
|
||||
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
|
||||
"asked": "2026-11-12",
|
||||
"result": {
|
||||
"compiled": true,
|
||||
"buildStderr": "",
|
||||
"executed": true,
|
||||
"exitCode": 0,
|
||||
"stdout": "-0.25\n0.25\n0.2999999999999998\n-0.5\n-2.0\n-0.050000000000000044",
|
||||
"stderr": "",
|
||||
"timedOut": false,
|
||||
"asm": null
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// MinimumImage, over real numbers: the image lies in [-box / 2, box / 2) and is a whole number of box lengths from dx.
|
||||
lemma ScaledBounds(g: real, box: real)
|
||||
requires box > 0.0
|
||||
requires -0.5 <= g < 0.5
|
||||
ensures -box / 2.0 <= g * box < box / 2.0
|
||||
{
|
||||
assert (g + 0.5) * box >= 0.0;
|
||||
assert (0.5 - g) * box > 0.0;
|
||||
}
|
||||
|
||||
method MinimumImage(dx: real, box: real) returns (r: real, k: int)
|
||||
requires box > 0.0
|
||||
ensures r == dx - box * (k as real)
|
||||
ensures -box / 2.0 <= r < box / 2.0
|
||||
{
|
||||
var q := dx / box + 0.5;
|
||||
k := q.Floor;
|
||||
assert (k as real) <= q < (k as real) + 1.0;
|
||||
var g := q - (k as real) - 0.5;
|
||||
assert -0.5 <= g < 0.5;
|
||||
assert dx == (q - 0.5) * box;
|
||||
r := dx - box * (k as real);
|
||||
assert r == g * box;
|
||||
ScaledBounds(g, box);
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
#include <math.h>
|
||||
|
||||
double minimum_image(double dx, double box) {
|
||||
return dx - box * floor(dx / box + 0.5);
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
from std.math import floor
|
||||
|
||||
|
||||
def minimum_image(dx: Float64, box: Float64) -> Float64:
|
||||
return dx - box * floor(dx / box + 0.5)
|
||||
@@ -0,0 +1,5 @@
|
||||
import math
|
||||
|
||||
|
||||
def minimum_image(dx, box):
|
||||
return dx - box * math.floor(dx / box + 0.5)
|
||||
@@ -0,0 +1,58 @@
|
||||
{
|
||||
"name": "MinimumImage",
|
||||
"summary": "A displacement brought to its nearest periodic image in a box of length Box: the minimum image convention. Over real numbers the result lies in [-Box / 2, Box / 2); in FLOAT arithmetic it can land a rounding error outside that range.",
|
||||
"tags": [
|
||||
"molecular dynamics",
|
||||
"periodic boundary conditions"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Allen and Tildesley, Computer Simulation of Liquids, 2nd edition (Oxford, 2017), sections 1.6.2, Periodic boundary conditions, and 1.6.3, Potential truncation: the minimum image convention"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "MinimumImage(0.75, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(-0.75, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(2.3, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(0.5, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(-12.0, 10.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(1.35, 0.1)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same formula with math.floor."
|
||||
},
|
||||
{
|
||||
"lang": "c",
|
||||
"level": "plain",
|
||||
"file": "ref/c/plain.c",
|
||||
"note": "The same formula with floor from math.h."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same formula in Mojo, with floor from std.math."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/minimum_image.dfy",
|
||||
"note": "Over real numbers the result lies in [-Box / 2, Box / 2) and differs from Dx by a whole number of box lengths."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,13 @@
|
||||
// MinimumImage: the displacement Dx brought to its nearest periodic image in
|
||||
// a box of length Box, the minimum image convention: Dx minus the whole
|
||||
// number of box lengths that brings it into [-Box / 2, Box / 2). FLOOR of
|
||||
// Dx / Box + 0.5 rounds halves upward, so exactly half a box maps to -Box / 2.
|
||||
// That range holds over exact numbers (the Dafny proof). In FLOAT arithmetic
|
||||
// Dx / Box and the product are rounded, so the result can land a rounding
|
||||
// error outside it (MinimumImage(1.35, 0.1) is -0.050000000000000044), and
|
||||
// within a rounding error of half a box it can give the farther of the two
|
||||
// closest images (MinimumImage(0.49999999999999994, 1.0) is -0.5).
|
||||
FUNCTION MinimumImage(Dx : FLOAT, Box : FLOAT) RETURNS FLOAT
|
||||
REQUIRE Box > 0.0
|
||||
RETURN Dx - Box * FLOOR(Dx / Box + 0.5)
|
||||
ENDFUNCTION
|
||||
@@ -0,0 +1,5 @@
|
||||
{
|
||||
"name": "md",
|
||||
"title": "Molecular simulation",
|
||||
"summary": "Pair potentials, forces and periodic boxes, the inner loop of molecular dynamics."
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"tool": "godbolt",
|
||||
"compiler": "mojo_1_2_0",
|
||||
"mojoVersion": "1.2.0",
|
||||
"source_sha256": "a5c8003d3ef4f2bb00c3ec5bc2ae11fe1965c991acfcfc9f4e4df759c3c3f7d6",
|
||||
"stdin": "3 3 3602879701896397 -55 3602879701896397 -55 3602879701896397 -55 3 8106479329266893 -53 8106479329266893 -53 8106479329266893 -53 1 0 3 0 0 0 0 0 0 3 3 0 1 2 0 0 5 2 3 1 0 1 1 3 0 3 1 0 1 1 3 0 5 0 end\n",
|
||||
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
|
||||
"asked": "2026-11-12",
|
||||
"result": {
|
||||
"compiled": true,
|
||||
"buildStderr": "",
|
||||
"executed": true,
|
||||
"exitCode": 0,
|
||||
"stdout": "0.34641016151377535\n5.0\n0.0",
|
||||
"stderr": "",
|
||||
"timedOut": false,
|
||||
"asm": null
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,10 @@
|
||||
from std.math import floor, sqrt
|
||||
|
||||
|
||||
def pair_distance(a: List[Float64], b: List[Float64], box: Float64) -> Float64:
|
||||
var total: Float64 = 0.0
|
||||
for i in range(3):
|
||||
var d = a[i] - b[i]
|
||||
d = d - box * floor(d / box + 0.5)
|
||||
total = total + d * d
|
||||
return sqrt(total)
|
||||
@@ -0,0 +1,7 @@
|
||||
import math
|
||||
|
||||
|
||||
def pair_distance(a, b, box):
|
||||
d = [x - y for x, y in zip(a, b)]
|
||||
d = [v - box * math.floor(v / box + 0.5) for v in d]
|
||||
return math.hypot(*d)
|
||||
@@ -0,0 +1,40 @@
|
||||
{
|
||||
"name": "PairDistance",
|
||||
"summary": "The distance between two points in a cubic periodic box, each coordinate difference taken by the minimum image convention.",
|
||||
"tags": [
|
||||
"molecular dynamics",
|
||||
"periodic boundary conditions"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Allen and Tildesley, Computer Simulation of Liquids, 2nd edition (Oxford, 2017), sections 1.6.2, Periodic boundary conditions, and 1.6.3, Potential truncation: the minimum image convention"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "PairDistance([0.1, 0.1, 0.1], [0.9, 0.9, 0.9], 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "PairDistance([0.0, 0.0, 0.0], [3.0, 4.0, 0.0], 20.0)"
|
||||
},
|
||||
{
|
||||
"call": "PairDistance([1.0, 2.0, 3.0], [1.0, 2.0, 3.0], 5.0)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same steps, with math.hypot of all three differences at once.",
|
||||
"rel": 1e-15
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same steps in Mojo, with the square root of the sum of squares.",
|
||||
"rel": 1e-15
|
||||
}
|
||||
]
|
||||
}
|
||||
@@ -0,0 +1,11 @@
|
||||
// PairDistance: the distance between two points in a cubic periodic box of
|
||||
// side Box, each coordinate difference taken by the minimum image
|
||||
// convention. HYPOT adds the squares without overflowing on the way.
|
||||
USE md.MinimumImage
|
||||
FUNCTION PairDistance(A : LIST OF FLOAT, B : LIST OF FLOAT, Box : FLOAT) RETURNS FLOAT
|
||||
REQUIRE LENGTH(A) == 3 AND LENGTH(B) == 3 AND Box > 0.0
|
||||
DECLARE Dx : FLOAT <- MinimumImage(A[0] - B[0], Box)
|
||||
DECLARE Dy : FLOAT <- MinimumImage(A[1] - B[1], Box)
|
||||
DECLARE Dz : FLOAT <- MinimumImage(A[2] - B[2], Box)
|
||||
RETURN HYPOT(HYPOT(Dx, Dy), Dz)
|
||||
ENDFUNCTION
|
||||
Reference in new issue
Block a user