Home
last modified time | relevance | path

Searched refs:neighbours (Results 1 – 25 of 1400) sorted by relevance

12345678910>>...56

/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/ml/neuralnet/twod/
H A DNeuronSquareMesh2DTest.java93 Collection<Neuron> neighbours; in test2x2Network() local
131 Collection<Neuron> neighbours; in test2x2Network2() local
159 Collection<Neuron> neighbours; in test3x2CylinderNetwork() local
225 Collection<Neuron> neighbours; in test3x2CylinderNetwork2() local
257 Collection<Neuron> neighbours; in test3x3TorusNetwork() local
350 Collection<Neuron> neighbours; in test3x3TorusNetwork2() local
382 Collection<Neuron> neighbours; in test3x3CylinderNetwork() local
589 exclude.addAll(neighbours); in testConcentricNeighbourhood()
591 neighbours = net.getNeighbours(neighbours, exclude); in testConcentricNeighbourhood()
638 exclude.addAll(neighbours); in testConcentricNeighbourhood2()
[all …]
/dports/math/openturns/openturns-1.18/python/test/
H A Dt_RegularGridNearestNeighbour_std.expout23 4 nearest neighbours of [-1.26617] (indices= [0,1,2,3]
24 4 nearest neighbours of [-0.438266] (indices= [6,5,7,4]
25 4 nearest neighbours of [1.20548] (indices= [20,19,18,17]
26 4 nearest neighbours of [-2.18139] (indices= [0,1,2,3]
28 4 nearest neighbours of [-0.355007] (indices= [6,7,5,8]
32 4 nearest neighbours of [-0.470526] (indices= [5,6,4,7]
34 4 nearest neighbours of [-2.29006] (indices= [0,1,2,3]
35 4 nearest neighbours of [-1.28289] (indices= [0,1,2,3]
36 4 nearest neighbours of [-1.31178] (indices= [0,1,2,3]
39 4 nearest neighbours of [-0.139453] (indices= [9,8,10,7]
[all …]
/dports/math/apache-commons-math/commons-math3-3.6.1-src/src/test/java/org/apache/commons/math3/ml/neuralnet/oned/
H A DNeuronStringTest.java52 Collection<Neuron> neighbours; in testSegmentNetwork() local
60 Assert.assertEquals(1, neighbours.size()); in testSegmentNetwork()
68 Assert.assertEquals(2, neighbours.size()); in testSegmentNetwork()
76 Assert.assertEquals(2, neighbours.size()); in testSegmentNetwork()
84 Assert.assertEquals(1, neighbours.size()); in testSegmentNetwork()
97 Collection<Neuron> neighbours; in testCircleNetwork() local
105 Assert.assertEquals(2, neighbours.size()); in testCircleNetwork()
113 Assert.assertEquals(2, neighbours.size()); in testCircleNetwork()
121 Assert.assertEquals(2, neighbours.size()); in testCircleNetwork()
129 Assert.assertEquals(2, neighbours.size()); in testCircleNetwork()
[all …]
/dports/www/moodle39/moodle/mod/forum/tests/
H A Dlib_test.php835 $this->assertEmpty($neighbours['prev']);
852 $this->assertEmpty($neighbours['next']);
865 $this->assertEmpty($neighbours['prev']);
870 $this->assertEmpty($neighbours['next']);
877 $this->assertEmpty($neighbours['next']);
883 $this->assertEmpty($neighbours['next']);
952 $this->assertEmpty($neighbours['next']);
978 $this->assertEmpty($neighbours['next']);
992 $this->assertEmpty($neighbours['next']);
1008 $this->assertEmpty($neighbours['next']);
[all …]
/dports/www/moodle310/moodle/mod/forum/tests/
H A Dlib_test.php1199 $this->assertEmpty($neighbours['prev']);
1216 $this->assertEmpty($neighbours['next']);
1229 $this->assertEmpty($neighbours['prev']);
1234 $this->assertEmpty($neighbours['next']);
1241 $this->assertEmpty($neighbours['next']);
1247 $this->assertEmpty($neighbours['next']);
1316 $this->assertEmpty($neighbours['next']);
1342 $this->assertEmpty($neighbours['next']);
1356 $this->assertEmpty($neighbours['next']);
1372 $this->assertEmpty($neighbours['next']);
[all …]
/dports/www/moodle311/moodle/mod/forum/tests/
H A Dlib_test.php1199 $this->assertEmpty($neighbours['prev']);
1216 $this->assertEmpty($neighbours['next']);
1229 $this->assertEmpty($neighbours['prev']);
1234 $this->assertEmpty($neighbours['next']);
1241 $this->assertEmpty($neighbours['next']);
1247 $this->assertEmpty($neighbours['next']);
1316 $this->assertEmpty($neighbours['next']);
1342 $this->assertEmpty($neighbours['next']);
1356 $this->assertEmpty($neighbours['next']);
1372 $this->assertEmpty($neighbours['next']);
[all …]
/dports/games/openra/OpenRA-release-20200503/OpenRA.Mods.Common/Traits/Buildings/
H A DBridge.cs131 if (neighbours[d] != null) in Do()
132 action(neighbours[d], d); in Do()
157 if (neighbours[d] != null) in LinkNeighbouringBridges()
165 if (neighbours[d] != null) in LinkNeighbouringBridges()
166 neighbours[d].neighbours[1 - d] = this; // Save reverse lookup in LinkNeighbouringBridges()
181 for (var b = neighbours[d]; b != null; b = b.Hut == null ? b.neighbours[d] : null) in AddHut()
262 if (NeighbourIsDeadShore(neighbours[0]) || NeighbourIsDeadShore(neighbours[1])) in LongBridgeSegmentIsDead()
274 var nextIsDead = neighbours[1] != null && neighbours[1].LongBridgeSegmentIsDead(); in ChooseTemplate()
330 …if (direction < 0 ? neighbours[0] == null && neighbours[1] == null : Hut != null || neighbours[dir… in Repair()
353 if (neighbours[d] != null && neighbours[d].neighbours[d] != null) in INotifyDamageStateChanged.DamageStateChanged()
[all …]
/dports/math/R-cran-spdep/spdep/R/
H A Dnb2mat.R19 n <- length(listw$neighbours)
21 cardnb <- card(listw$neighbours)
42 n <- length(x$neighbours)
166 neighbours <- res$neighbours functionVar
174 neighbours[[i]] <- nbs
177 neighbours[[i]] <- 0L
182 class(neighbours) <- "nb"
183 attr(neighbours, "region.id") <- row.names
184 attr(neighbours, "call") <- NA
185 attr(neighbours, "sym") <- is.symmetric.nb(neighbours,
[all …]
H A Dnb2listw.R12 n <- length(neighbours)
14 cardnb <- card(neighbours)
97 res <- list(style=style, neighbours=neighbours, weights=vlist) nameattr
102 res <- list(style=style, neighbours=neighbours, weights=vlist) globalVar
141 nbsym <- attr(listw$neighbours, "sym")
148 n <- length(listw$neighbours)
150 cardnb <- card(listw$neighbours)
157 inb <- listw$neighbours[[i]]
183 inb <- listw$neighbours[[i]]
231 num <- card(listw$neighbours)
[all …]
/dports/science/grib_api/grib_api-1.28.0-Source/src/
H A Dgrib_nearest_class_lambert_conformal.c154 PointStore* neighbours = NULL; in find() local
175 neighbours[i].m_lat=0; in find()
176 neighbours[i].m_lon=0; in find()
177 neighbours[i].m_value=0; in find()
178 neighbours[i].m_index=0; in find()
248 neighbours[i].m_lat = lat; in find()
249 neighbours[i].m_lon = lon; in find()
266 Assert( neighbours[i].m_dist <= neighbours[i+1].m_dist); in find()
282 outlats[i] = neighbours[i].m_lat; in find()
283 outlons[i] = neighbours[i].m_lon; in find()
[all …]
/dports/games/tanks-of-freedom/Tanks-of-Freedom-0.7.0-beta/scripts/
H A Dterrain.gd62 neighbours += 2
64 neighbours += 4
66 neighbours += 8
68 neighbours += 16
76 if neighbours in [10]:
79 if neighbours in [12]:
82 if neighbours in [20]:
85 if neighbours in [18]:
88 if neighbours in [26]:
91 if neighbours in [14]:
[all …]
/dports/games/ksirk/ksirk-21.12.3/ksirk/skins/legacy/Data/
H A Dworld.desktop14 neighbours=Alberta,Ontario,Siberia
34 neighbours=France,Niger,Egypt
44 neighbours=Egypt,Middle East
83 neighbours=Paraguay
153 neighbours=Egypt,Niger,Zair
183 neighbours=Vietnam,Papouasie
218 neighbours=China
258 neighbours=Iran,Arabia
288 neighbours=New South Wales
398 neighbours=Benelux,Prussia
[all …]
/dports/games/ksirk/ksirk-21.12.3/ksirk/skins/static/Data/
H A Dworld.desktop14 neighbours=Alberta,Ontario,Siberia
34 neighbours=France,Niger,Egypt
44 neighbours=Egypt,Middle East
83 neighbours=Paraguay
153 neighbours=Egypt,Niger,Zair
183 neighbours=Vietnam,Papouasie
218 neighbours=China
258 neighbours=Iran,Arabia
288 neighbours=New South Wales
398 neighbours=Benelux,Prussia
[all …]
/dports/math/py-apgl/apgl-0.8.1/apgl/graph/
H A DDictTree.py120 neighbours = self.neighbours(vertexId)
122 for neighbour in neighbours:
145 neighbours = self.neighbours(vertexId)
150 for neighbour in neighbours:
172 neighbours = self.neighbours(vertexId)
174 if len(neighbours) != 0:
199 neighbours = self.neighbours(vertexId)
201 if len(neighbours) == 0:
215 neighbours = self.neighbours(vertexId)
217 for neighbour in neighbours:
[all …]
/dports/games/ksirk/ksirk-21.12.3/ksirk/skins/default/Data/
H A Dworld.desktop14 neighbours=Alberta,Ontario,Siberia
34 neighbours=France,Niger,Egypt
44 neighbours=Iran,Egypt
83 neighbours=Paraguay
103 neighbours=Mexico,Brazil
150 neighbours=Egypt,Niger,Zair
180 neighbours=Vietnam,Papouasie
216 neighbours=China
276 neighbours=New South Wales
346 neighbours=Chile,Brazil
[all …]
/dports/math/openturns/openturns-1.18/lib/test/
H A Dt_RegularGridNearestNeighbour_std.expout24 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.26617]= (indices=[0,1,2,3])
25 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-0.438266]= (indices=[6,5,7,4])
26 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[1.20548]= (indices=[20,19,18,1…
27 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-2.18139]= (indices=[0,1,2,3])
29 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-0.355007]= (indices=[6,7,5,8])
33 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-0.470526]= (indices=[5,6,4,7])
35 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-2.29006]= (indices=[0,1,2,3])
36 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.28289]= (indices=[0,1,2,3])
37 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.31178]= (indices=[0,1,2,3])
40 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-0.139453]= (indices=[9,8,10,7…
[all …]
H A Dt_KDTree_std.expout23 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.40136,1.36783,1.00434]= (ind…
25 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.29995,0.407717,-0.485112]= (…
27 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.96876,-0.671291,1.85579]= (i…
28 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.0521593,0.790446,0.716353]= …
29 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[-0.743622,0.184356,-1.53073]= …
30 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.655027,0.538071,1.73821]= (i…
32 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.67297,-1.03896,-0.353552]= (…
33 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.21381,-0.777033,-1.36853]= (…
34 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.103474,-0.89182,0.905602]= (…
36 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.70938,1.07062,-0.506925]= (i…
[all …]
H A Dt_NaiveNearestNeighbour_std.expout23 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.40136,1.36783,1.00434]= (ind…
25 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.29995,0.407717,-0.485112]= (…
27 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.96876,-0.671291,1.85579]= (i…
28 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.0521593,0.790446,0.716353]= …
29 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[-0.743622,0.184356,-1.53073]= …
30 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.655027,0.538071,1.73821]= (i…
32 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.67297,-1.03896,-0.353552]= (…
33 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.21381,-0.777033,-1.36853]= (…
34 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[0.103474,-0.89182,0.905602]= (…
36 4 nearest neighbours of class=Point name=Unnamed dimension=3 values=[1.70938,1.07062,-0.506925]= (i…
[all …]
H A Dt_NearestNeighbour1D_std.expout22 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-0.470526]= (indices=[2,6,1,5])
23 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[0.261018]= (indices=[5,0,9,8])
24 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-2.29006]= (indices=[4,1,2,6])
25 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.28289]= (indices=[1,2,4,6])
26 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.31178]= (indices=[1,4,2,6])
28 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[0.995793]= (indices=[8,9,3,0])
31 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[0.44549]= (indices=[5,0,9,8])
32 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[0.322925]= (indices=[5,0,9,8])
33 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[0.445785]= (indices=[5,0,9,8])
34 4 nearest neighbours of class=Point name=Unnamed dimension=1 values=[-1.03808]= (indices=[1,2,6,4])
[all …]
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cpp-ethereum/test/unittests/libp2p/
H A Deip-8.cpp92 auto neighbours = in TEST() local
94 EXPECT_EQ(neighbours.neighbours.size(), 4); in TEST()
95 EXPECT_EQ(neighbours.neighbours[0].endpoint, in TEST()
97 EXPECT_EQ(neighbours.neighbours[0].node, in TEST()
100 EXPECT_EQ(neighbours.neighbours[1].endpoint, NodeIPEndpoint(bi::make_address("1.2.3.4"), 1, 1)); in TEST()
101 EXPECT_EQ(neighbours.neighbours[1].node, in TEST()
104 EXPECT_EQ(neighbours.neighbours[2].endpoint, in TEST()
106 EXPECT_EQ(neighbours.neighbours[2].node, in TEST()
109 EXPECT_EQ(neighbours.neighbours[3].endpoint, in TEST()
111 EXPECT_EQ(neighbours.neighbours[3].node, in TEST()
[all …]
/dports/math/igraph/igraph-0.9.5/src/community/spinglass/
H A DNetDataTypes.cpp53 neighbours = new DLList<NNode*>(); in NNode()
74 delete neighbours; in ~NNode()
77 neighbours = NULL; in ~NNode()
100 neighbours->Push(neighbour); // nachbar hier eintragen in Connect_To()
135 if (!neighbours) { in Disconnect_From()
138 neighbours->fDelete(neighbour); in Disconnect_From()
141 neighbour->neighbours->fDelete(this); in Disconnect_From()
147 while (neighbours->Size()) { in Disconnect_From_All()
148 Disconnect_From(neighbours->Pop()); in Disconnect_From_All()
174 step1 = iter1.First(neighbours); in Get_Links_Among_Neigbours()
[all …]
/dports/math/R-cran-igraph/igraph/src/
H A DNetDataTypes.cpp56 neighbours = new DLList<NNode*>(); in NNode()
77 delete neighbours; in ~NNode()
80 neighbours = NULL; in ~NNode()
103 neighbours->Push(neighbour); // nachbar hier eintragen in Connect_To()
138 if (!neighbours) { in Disconnect_From()
141 neighbours->fDelete(neighbour); in Disconnect_From()
144 neighbour->neighbours->fDelete(this); in Disconnect_From()
150 while (neighbours->Size()) { in Disconnect_From_All()
151 Disconnect_From(neighbours->Pop()); in Disconnect_From_All()
177 step1 = iter1.First(neighbours); in Get_Links_Among_Neigbours()
[all …]
/dports/science/eccodes/eccodes-2.23.0-Source/src/
H A Dgrib_nearest.c286 PointStore* neighbours = NULL; in grib_nearest_find_generic() local
313 neighbours[i].m_lat = 0; in grib_nearest_find_generic()
314 neighbours[i].m_lon = 0; in grib_nearest_find_generic()
315 neighbours[i].m_value = 0; in grib_nearest_find_generic()
316 neighbours[i].m_index = 0; in grib_nearest_find_generic()
389 neighbours[i].m_lat = lat; in grib_nearest_find_generic()
390 neighbours[i].m_lon = lon; in grib_nearest_find_generic()
408 Assert(neighbours[i].m_dist <= neighbours[i + 1].m_dist); in grib_nearest_find_generic()
423 outlats[i] = neighbours[i].m_lat; in grib_nearest_find_generic()
424 outlons[i] = neighbours[i].m_lon; in grib_nearest_find_generic()
[all …]
/dports/multimedia/handbrake/ffmpeg-4.4/libavcodec/
H A Dmss12.c217 neighbours[TOP_LEFT] = neighbours[LEFT] = neighbours[TOP]; in decode_pixel_in_context()
225 neighbours[TOP_RIGHT] = neighbours[TOP]; in decode_pixel_in_context()
249 if (neighbours[TOP] == neighbours[TOP_LEFT]) { in decode_pixel_in_context()
250 if (neighbours[TOP_RIGHT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
252 else if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
257 if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
261 } else if (neighbours[LEFT] == neighbours[TOP_LEFT]) { in decode_pixel_in_context()
268 if (neighbours[TOP] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
272 else if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
274 else if (neighbours[TOP_RIGHT] == neighbours[TOP]) in decode_pixel_in_context()
[all …]
/dports/emulators/vice/vice-3.5/src/lib/libffmpeg/libavcodec/
H A Dmss12.c215 neighbours[TOP_LEFT] = neighbours[LEFT] = neighbours[TOP]; in decode_pixel_in_context()
223 neighbours[TOP_RIGHT] = neighbours[TOP]; in decode_pixel_in_context()
247 if (neighbours[TOP] == neighbours[TOP_LEFT]) { in decode_pixel_in_context()
248 if (neighbours[TOP_RIGHT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
250 else if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
255 if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
259 } else if (neighbours[LEFT] == neighbours[TOP_LEFT]) { in decode_pixel_in_context()
266 if (neighbours[TOP] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
270 else if (neighbours[LEFT] == neighbours[TOP_LEFT]) in decode_pixel_in_context()
272 else if (neighbours[TOP_RIGHT] == neighbours[TOP]) in decode_pixel_in_context()
[all …]

12345678910>>...56