Home
last modified time | relevance | path

Searched refs:s_edge (Results 1 – 15 of 15) sorted by relevance

/dports/cad/magic/magic-8.3.245/plow/
H A DPlowSearch.c230 s.s_edge.e_flags = 0;
308 s->s_edge.e_x = left;
316 s->s_edge.e_ytop = s->s_edge.e_ybot;
383 s.s_edge.e_flags = 0;
464 s->s_edge.e_x = left;
472 s->s_edge.e_ytop = s->s_edge.e_ybot;
538 s.s_edge.e_flags = 0;
618 s->s_edge.e_x = right;
620 s->s_edge.e_ytop = top;
626 s->s_edge.e_ybot = s->s_edge.e_ytop;
[all …]
/dports/net/wireshark/wireshark-3.6.1/epan/dissectors/
H A Dpacket-xip.c142 } s_edge; member
185 return row->s_edge.i & XIA_CHOSEN_EDGES; in is_any_edge_chosen()
215 edge = row->s_edge.a; in xia_are_edges_valid()
216 all_edges = g_ntohl(row->s_edge.i); in xia_are_edges_valid()
277 all_edges = addr->s_row[n - 1].s_edge.i; in xia_test_addr()
375 add_edges_to_buf(valid, buf, row->s_edge.a); in xia_ntop()
436 tvb_memcpy(tvb, row->s_edge.a, offset, XIA_EDGES_SIZE); in construct_dag()
/dports/net/wireshark-lite/wireshark-3.6.1/epan/dissectors/
H A Dpacket-xip.c142 } s_edge; member
185 return row->s_edge.i & XIA_CHOSEN_EDGES; in is_any_edge_chosen()
215 edge = row->s_edge.a; in xia_are_edges_valid()
216 all_edges = g_ntohl(row->s_edge.i); in xia_are_edges_valid()
277 all_edges = addr->s_row[n - 1].s_edge.i; in xia_test_addr()
375 add_edges_to_buf(valid, buf, row->s_edge.a); in xia_ntop()
436 tvb_memcpy(tvb, row->s_edge.a, offset, XIA_EDGES_SIZE); in construct_dag()
/dports/net/tshark-lite/wireshark-3.6.1/epan/dissectors/
H A Dpacket-xip.c142 } s_edge; member
185 return row->s_edge.i & XIA_CHOSEN_EDGES; in is_any_edge_chosen()
215 edge = row->s_edge.a; in xia_are_edges_valid()
216 all_edges = g_ntohl(row->s_edge.i); in xia_are_edges_valid()
277 all_edges = addr->s_row[n - 1].s_edge.i; in xia_test_addr()
375 add_edges_to_buf(valid, buf, row->s_edge.a); in xia_ntop()
436 tvb_memcpy(tvb, row->s_edge.a, offset, XIA_EDGES_SIZE); in construct_dag()
/dports/net/tshark/wireshark-3.6.1/epan/dissectors/
H A Dpacket-xip.c142 } s_edge; member
185 return row->s_edge.i & XIA_CHOSEN_EDGES; in is_any_edge_chosen()
215 edge = row->s_edge.a; in xia_are_edges_valid()
216 all_edges = g_ntohl(row->s_edge.i); in xia_are_edges_valid()
277 all_edges = addr->s_row[n - 1].s_edge.i; in xia_test_addr()
375 add_edges_to_buf(valid, buf, row->s_edge.a); in xia_ntop()
436 tvb_memcpy(tvb, row->s_edge.a, offset, XIA_EDGES_SIZE); in construct_dag()
/dports/math/spot/spot-2.10.2/doc/org/
H A Dtut40.org198 for s_edge in aut.out(s_src):
199 edge_idx = aut.edge_number(s_edge)
208 if (buddy.bdd_implies(d_edge.cond, s_edge.cond) \
209 and d_edge.acc.subset(s_edge.acc)):
210 st3 = get_game_state(False, s_edge.dst, d_edge.dst)
314 for (const auto& s_edge : aut->out(s_src))
316 unsigned edge_idx = aut->edge_number(s_edge);
320 if (bdd_implies(d_edge.cond, s_edge.cond)
321 && d_edge.acc.subset(s_edge.acc))
323 unsigned st3 = new_state(false, s_edge.dst, d_edge.dst);
/dports/math/py-spot/spot-2.10.2/doc/org/
H A Dtut40.org198 for s_edge in aut.out(s_src):
199 edge_idx = aut.edge_number(s_edge)
208 if (buddy.bdd_implies(d_edge.cond, s_edge.cond) \
209 and d_edge.acc.subset(s_edge.acc)):
210 st3 = get_game_state(False, s_edge.dst, d_edge.dst)
314 for (const auto& s_edge : aut->out(s_src))
316 unsigned edge_idx = aut->edge_number(s_edge);
320 if (bdd_implies(d_edge.cond, s_edge.cond)
321 && d_edge.acc.subset(s_edge.acc))
323 unsigned st3 = new_state(false, s_edge.dst, d_edge.dst);
/dports/math/spot/spot-2.10.2/spot/twaalgos/
H A Dsimulation.cc1147 [&](const auto& s_edge) -> bool in compute_simulation()
1149 size_t i = static_cast<size_t>(s_edge.dst) * n; in compute_simulation()
1161 if (!(acc_[d_edge.src]).subset(acc_[s_edge.src])) in compute_simulation()
1166 if (!(d_edge.acc).subset(s_edge.acc)) in compute_simulation()
1172 if (s_edge.dst == init && d_edge.dst != init) in compute_simulation()
1176 return bdd_implies(s_edge.cond, d_edge.cond); in compute_simulation()
1397 [&](const auto& s_edge) -> bool in run()
1399 size_t idx = static_cast<size_t>(old[s_edge.dst]) * n; in run()
1407 return bdd_implies(s_edge.cond, d_edge.cond); in run()
/dports/math/py-spot/spot-2.10.2/spot/twaalgos/
H A Dsimulation.cc1147 [&](const auto& s_edge) -> bool in compute_simulation()
1149 size_t i = static_cast<size_t>(s_edge.dst) * n; in compute_simulation()
1161 if (!(acc_[d_edge.src]).subset(acc_[s_edge.src])) in compute_simulation()
1166 if (!(d_edge.acc).subset(s_edge.acc)) in compute_simulation()
1172 if (s_edge.dst == init && d_edge.dst != init) in compute_simulation()
1176 return bdd_implies(s_edge.cond, d_edge.cond); in compute_simulation()
1397 [&](const auto& s_edge) -> bool in run()
1399 size_t idx = static_cast<size_t>(old[s_edge.dst]) * n; in run()
1407 return bdd_implies(s_edge.cond, d_edge.cond); in run()
/dports/math/alberta/alberta3-920315ae1bbfd1b1fb6672d916619ac37a411e95/alberta/src/2d/
H A Dparametric_2d.c1566 int s_edge, m_edge, s_dof, m_dof, s_dof_loc, m_dof_loc; in slave_refine_interpolY_2d() local
1625 s_edge = 1-i_child; in slave_refine_interpolY_2d()
1627 s_dof_loc = N_VERTICES_2D + s_edge*n_e + i; in slave_refine_interpolY_2d()
1634 s_dof = s_child->dof[node_e + s_edge][n0_edge_pr]; in slave_refine_interpolY_2d()
1644 s_edge = i_child; in slave_refine_interpolY_2d()
1646 s_dof_loc = N_VERTICES_2D + s_edge*n_e + i; in slave_refine_interpolY_2d()
1653 s_dof = s_child->dof[node_e + s_edge][n0_edge_pr]; in slave_refine_interpolY_2d()
1698 int s_edge, m_edge, s_dof, m_dof, s_dof_loc, m_dof_loc, i; in slave_fill_coordsY_2d() local
1727 for (s_edge = 0; s_edge < N_EDGES_2D; s_edge++) { in slave_fill_coordsY_2d()
1729 s_dof_loc = N_VERTICES_2D + s_edge*n_e; in slave_fill_coordsY_2d()
[all …]
/dports/games/sgt-puzzles/puzzles-20220128.c43a34f/
H A Dgalaxies.c109 enum { s_tile, s_edge, s_vertex }; enumerator
466 case s_edge: in game_text_format()
803 case s_edge: in dot_is_possible()
882 sp->type = s_edge; in blank_game()
1301 if (sp->type == s_edge) { in generate_pass()
1421 if (state->grid[i].type == s_edge) in new_game_desc()
1808 assert(edge->type == s_edge); in solver_lines_opposite_cb()
1877 assert(edgeadj[n]->type == s_edge); in solver_spaces_oneposs_cb()
2019 } else if (dot->type == s_edge) { in solver_expand_fromdot()
2528 if (sp->type != s_edge) in edge_placement_legal()
[all …]
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglZeroHalf/
H A DCgl012cut.cpp774 edge *s_edge; in define_aux_graph() local
822 s_edge = s_graph->even_adj_list[indjk]; in define_aux_graph()
823 if ( s_edge != NULL ) { in define_aux_graph()
827 (int) (s_edge->weight * ISCALE); in define_aux_graph()
832 static_cast<int> (s_edge->weight * ISCALE); in define_aux_graph()
838 s_edge = s_graph->odd_adj_list[indjk]; in define_aux_graph()
839 if ( s_edge != NULL ) { in define_aux_graph()
843 (int) (s_edge->weight * ISCALE); in define_aux_graph()
848 static_cast<int> (s_edge->weight * ISCALE); in define_aux_graph()
/dports/graphics/graphviz/graphviz-2.44.1/lib/gvc/
H A Dgvevent.c40 static char *s_edge = "edge"; variable
126 gv_argvlist_set_item(nlist, j++, s_edge); in gv_edge_state()
/dports/math/py-pandas/pandas-1.2.5/pandas/plotting/_matplotlib/
H A Dcore.py1494 s_edge = self.ax_pos[0] - 0.25 + self.lim_offset
1497 self._decorate_ticks(ax, name, str_index, s_edge, e_edge)
/dports/cad/opencascade/opencascade-7.6.0/src/BRepBuilderAPI/
H A DBRepBuilderAPI_Sewing.cxx915 TopoDS_Edge s_edge = SameParameterEdge(edgeFirst,edgeLast,listFacesFirst,listFacesLast, in SameParameterEdge() local
917 if( !s_edge.IsNull()) in SameParameterEdge()
919 Standard_Real tolReached_2 = BRep_Tool::Tolerance(s_edge); in SameParameterEdge()
920 second_ok = ( BRep_Tool::SameParameter(s_edge) && tolReached_2 < tolReached ); in SameParameterEdge()
923 edge = s_edge; in SameParameterEdge()