Home
last modified time | relevance | path

Searched refs:edge_order (Results 1 – 25 of 99) sorted by relevance

1234

/dports/math/polymake/polymake-4.5/bundled/atint/apps/tropical/src/
H A Drational_curve.cc215 Vector<std::pair<Int, Int>> edge_order;
298 edge_order |= std::pair<Int, Int>(orig[p]-1,orig[x]-1);
299 edge_order |= std::pair<Int, Int>(orig[q]-1,orig[x]-1);
354 edge_order |= std::pair<Int, Int>(orig[t]-1,orig[p]-1);
358 edge_order |= std::pair<Int, Int>(orig[t]-1,orig[q]-1);
398 edge_order |= std::pair<Int, Int>(t,orig[vAsList[j]]-1);
473 for (Int oe = 0; oe < edge_order.dim(); ++oe) {
474 if (edge_order[oe].first < n || edge_order[oe].second < n)
477 edge_order = edge_order.slice(~leaf_edges);
487 for (Int oe = 0; oe < edge_order.dim(); ++oe) {
[all …]
/dports/graphics/blender/blender-2.91.0/source/blender/bmesh/intern/
H A Dbmesh_polygon_edgenet.c288 STACK_DECLARE(edge_order); in bm_face_split_edgenet_find_loop_walk()
298 STACK_INIT(edge_order, edge_order_len); in bm_face_split_edgenet_find_loop_walk()
325 BLI_assert(STACK_SIZE(edge_order) == 0); in bm_face_split_edgenet_find_loop_walk()
372 if (STACK_SIZE(edge_order) == 1) { in bm_face_split_edgenet_find_loop_walk()
373 eo = STACK_POP_PTR(edge_order); in bm_face_split_edgenet_find_loop_walk()
381 if (STACK_SIZE(edge_order) > 1) { in bm_face_split_edgenet_find_loop_walk()
389 qsort(edge_order, in bm_face_split_edgenet_find_loop_walk()
390 STACK_SIZE(edge_order), in bm_face_split_edgenet_find_loop_walk()
481 struct VertOrder *edge_order; in BM_face_split_edgenet() local
500 edge_order = MEM_mallocN(sizeof(*edge_order) * edge_order_len, __func__); in BM_face_split_edgenet()
[all …]
/dports/math/py-numpy/numpy-1.20.3/numpy/lib/tests/
H A Dtest_function_base.py1000 res1 = gradient(f, 1., axis=(0,1), edge_order=edge_order)
1002 axis=(0,1), edge_order=edge_order)
1004 axis=None, edge_order=edge_order)
1010 res1 = gradient(f, 1., axis=0, edge_order=edge_order)
1011 res2 = gradient(f, x_even, axis=0, edge_order=edge_order)
1015 res1 = gradient(f, 1., axis=1, edge_order=edge_order)
1016 res2 = gradient(f, x_even, axis=1, edge_order=edge_order)
1023 axis=(0,1), edge_order=edge_order)
1025 axis=None, edge_order=edge_order)
1030 res1 = gradient(f, x_uneven, axis=0, edge_order=edge_order)
[all …]
/dports/devel/py-xarray/xarray-0.20.1/xarray/core/
H A Dduck_array_ops.py140 def gradient(x, coord, axis, edge_order): argument
142 return dask_array.gradient(x, coord, axis=axis, edge_order=edge_order)
143 return np.gradient(x, coord, axis=axis, edge_order=edge_order)
/dports/databases/grass7/grass-7.8.6/lib/gis/
H A Dplot.c38 static int edge_order(const void *, const void *);
458 qsort(st->P, st->np, sizeof(POINT), edge_order); in G_plot_polygon()
594 qsort(st->P, st->np, sizeof(POINT), &edge_order); in G_plot_area()
702 static int edge_order(const void *aa, const void *bb) in edge_order() function
/dports/databases/grass7/grass-7.8.6/lib/imagery/
H A Diclass_local_proto.h100 int edge_order(const void *aa, const void *bb);
H A Diclass_perimeter.c315 sizeof(IClass_point), edge_order); in make_perimeter()
388 int edge_order(const void *aa, const void *bb) in edge_order() function
/dports/graphics/blender/blender-2.91.0/source/blender/modifiers/intern/
H A DMOD_solidify_extrude.c218 char *edge_order = NULL; in MOD_solidify_extrude_modifyMesh() local
287 edge_order = MEM_malloc_arrayN(numEdges, sizeof(*edge_order), "solid_mod order"); in MOD_solidify_extrude_modifyMesh()
312 edge_order[eidx] = j; in MOD_solidify_extrude_modifyMesh()
1113 k1 = mpoly[pidx].loopstart + (((edge_order[eidx] - 1) + mp->totloop) % mp->totloop); in MOD_solidify_extrude_modifyMesh()
1115 k2 = mpoly[pidx].loopstart + (edge_order[eidx]); in MOD_solidify_extrude_modifyMesh()
1223 MEM_freeN(edge_order); in MOD_solidify_extrude_modifyMesh()
/dports/devel/py-xarray/xarray-0.20.1/xarray/tests/
H A Dtest_duck_array_ops.py553 def test_dask_gradient(axis, edge_order): argument
560 expected = gradient(array, x, axis=axis, edge_order=edge_order)
561 actual = gradient(darray, x, axis=axis, edge_order=edge_order)
H A Dtest_dataset.py6137 def test_differentiate(dask, edge_order): argument
6152 actual = da.differentiate("x", edge_order)
6154 np.gradient(da, da["x"], axis=0, edge_order=edge_order),
6160 ds["var"].differentiate("x", edge_order=edge_order),
6161 ds.differentiate("x", edge_order=edge_order)["var"],
6167 actual = da.differentiate("y", edge_order)
6169 np.gradient(da, da["y"], axis=1, edge_order=edge_order),
6174 assert_equal(actual, ds.differentiate("y", edge_order=edge_order)["var"])
6176 ds["var"].differentiate("y", edge_order=edge_order),
6177 ds.differentiate("y", edge_order=edge_order)["var"],
[all …]
/dports/math/py-numpy/numpy-1.20.3/doc/source/release/
H A D1.9.1-notes.rst11 The second order behaviour is available via the `edge_order` keyword
/dports/math/py-numpy/numpy-1.20.3/numpy/lib/
H A Dfunction_base.py798 def _gradient_dispatcher(f, *varargs, axis=None, edge_order=None): argument
804 def gradient(f, *varargs, axis=None, edge_order=1): argument
1019 if edge_order > 2:
1052 if f.shape[axis] < edge_order + 1:
1084 if edge_order == 1:
/dports/science/code_saturne/code_saturne-7.1.0/src/mesh/
H A Dcs_join_intersect.c3252 cs_lnum_t *edge_order = NULL, *vtx_order = NULL; in cs_join_intersect_update_struct() local
3278 BFT_MALLOC(edge_order, n_edges, cs_lnum_t); in cs_join_intersect_update_struct()
3281 cs_order_gnum_allocated(NULL, edges->gnum, edge_order, n_edges); in cs_join_intersect_update_struct()
3284 edge_gnum[i] = edges->gnum[edge_order[i]]; in cs_join_intersect_update_struct()
3299 o_id = edge_order[e_id]; in cs_join_intersect_update_struct()
3320 o_id = edge_order[e_id]; in cs_join_intersect_update_struct()
3334 BFT_FREE(edge_order); in cs_join_intersect_update_struct()
/dports/devel/py-dask/dask-2021.11.2/dask/array/tests/
H A Dtest_routines.py608 def test_gradient(shape, varargs, axis, edge_order): argument
612 r_a = np.gradient(a, *varargs, axis=axis, edge_order=edge_order)
613 r_d_a = da.gradient(d_a, *varargs, axis=axis, edge_order=edge_order)
/dports/devel/boost-docs/boost_1_72_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/databases/percona57-server/boost_1_59_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/databases/percona57-client/boost_1_59_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/devel/boost-libs/boost_1_72_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/devel/hyperscan/boost_1_75_0/libs/graph/doc/
H A Disomorphism-impl.w588 std::size_t edge_order(const typename graph_traits<Graph>::edge_descriptor e,
600 return edge_order(e1, m_index_map, m_g) < edge_order(e2, m_index_map, m_g);
722 if (get(index_map1, k) != edge_order(*edge_iter, index_map1, g1))
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dblock.cpp1380 static int edge_order(CFGEdge **e0, CFGEdge **e1) { in edge_order() function
1512 edges->sort(edge_order); in grow_traces()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dblock.cpp1380 static int edge_order(CFGEdge **e0, CFGEdge **e1) { in edge_order() function
1512 edges->sort(edge_order); in grow_traces()

1234