Faces from a mesh: Difference between revisions

{{trans|Python}}

 

I p1.len != p2.len | Set(p1) != Set(p2)

R 0B

‘H’ = [(1, 3), (9, 11), (3, 11), (1, 11)]]

L(name, edges) edge_d

 

{{out}}

 

=={{header|Go}}==

 

import (

}

}

 

{{out}}

 

=={{header|Haskell}}==

import Control.Applicative ((<|>))

 

p <- find ((x ==) . fst) rs <|> find ((x ==) . snd) rs

let next = if fst p == x then snd p else fst p

 

First task.

</pre>

Secondly:

edge_to_node=: 3 :0

assert. 2 = #/.~ , y [ 'expect each node to appear twice'

~. , oel

)

 

<pre>

 

=={{header|Julia}}==

 

function toface(evec)

println(toface(face))

end

<pre>

Faces are equivalent.

 

=={{header|Lua}}==

function T(t) return setmetatable(t, {__index=table}) end

table.eql = function(t,u) if #t~=#u then return false end for i=1,#t do if t[i]~=u[i] then return false end end return true end

print("ef2pf(F): ", ef2pf(F):concat(","))

print("ef2pf(G): ", ef2pf(G):concat(","))

{{out}}

<pre>pfeq(Q,R): true

 

=={{header|Nim}}==

 

type

for (faceName, edges) in FE:

let perimeter = edges.toPerimeter()

 

{{out}}

=={{header|Perl}}==

{{trans|Raku}}

use warnings;

use feature 'say';

[[1, 3], [9, 11], [3, 11], [1, 11]]) {

say show($_) . ' ==> (' . (join ' ', edge_to_periphery(@$_) or 'Invalid edge format') . ')'

{{out}}

<pre>Perimeter format equality checks:

 

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">function</span> <span style="color: #000000;">perequiv</span><span style="color: #0000FF;">(</span><span style="color: #004080;">sequence</span> <span style="color: #000000;">a</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">b</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%v\n"</span><span style="color: #0000FF;">,{</span><span style="color: #000000;">edge2peri</span><span style="color: #0000FF;">(</span><span style="color: #000000;">etests</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">])})</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

(second part matches Julia/Perl: un-comment that sort above to match Go/Python/zkl)

 

=={{header|Python}}==

# Cheap tests first

if len(p1) != len(p2) or set(p1) != set(p2):

}

for name, edges in edge_d.items():

 

{{out}}

{{works with|Rakudo|2019.11}}

 

 

sub edge-to-periphery (@a is copy) {

.gist.print;

say " ==> ({.&edge-to-periphery || 'Invalid edge format'})";

{{out}}

<pre>Perimeter format equality checks:

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "./seq" for Lst

import "./fmt" for Fmt

Fmt.print(" $c => $n", i + 69, perim)

}

 

{{out}}

=={{header|zkl}}==

{{trans|Python}}

if(p1.len() != p2.len()) return(False);

False == p1.filter1('wrap(p){ (not p2.holds(p)) })

}

p[0,-1] // last element not part of result

ps:=T( T( T(8,1,3), T(1,3,8) ),

T( T(18, 8, 14, 10, 12, 17, 19), T(8, 14, 10, 12, 17, 19, 18) ) );

 

fcn pp(a){ a.concat(", ","(",")") }

{{out}}

<pre>