| /dports/games/trackballs/trackballs-1.3.3/src/ |
| H A D | smartTrigger.cc | 27 SmartTrigger::SmartTrigger(Game &g, Real x, Real y, Real radius, SCM entering, SCM leaving) in SmartTrigger() argument
34 leaving(leaving) { in SmartTrigger()
36 if (leaving) scm_gc_protect_object(leaving); in SmartTrigger()
42 if (leaving) scm_gc_unprotect_object(leaving); in releaseCallbacks()
44 leaving = NULL; in releaseCallbacks()
57 if (wasIn && leaving) game.queueCall(leaving); in tick()
|
| /dports/graphics/swftools/swftools-0.9.2/lib/as3/ |
| H A D | state.c | 54 state_t*leaving = state; in old_state() local
58 … if(as3_pass>1 && leaving->method && leaving->method != state->method && !leaving->method->inner) { in old_state()
59 methodstate_destroy(leaving->method);leaving->method=0; in old_state()
61 if(as3_pass>1 && leaving->cls && leaving->cls != state->cls) { in old_state()
62 free(leaving->cls); in old_state()
63 leaving->cls=0; in old_state()
66 state_destroy(leaving); in old_state()
|
| /dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/netflow/simplex/ |
| H A D | NetworkSimplex.java | 399 Arc leaving = this.blocking; in primalStep() local
409 if (leaving == null) { in primalStep()
478 if (leaving.tail().parent != leaving.head) { in updateTree()
479 leaving = leaving.sister; in updateTree()
518 if (leaving.capacity == 0) { in updateTree()
528 lower[index] = leaving; in updateTree()
530 leaving.index = index; in updateTree()
531 leaving.sister.index = index; in updateTree()
632 if (leaving.tail().parent == leaving.head) { in dualPivot()
633 tree = leaving.tail(); in dualPivot()
[all …]
|
| /dports/net/mpich/mpich-3.4.3/src/mpi/romio/adio/ad_xfs/ |
| H A D | ad_xfs_write.c | 30 goto leaving; in ADIOI_XFS_WriteContig()
44 goto leaving; in ADIOI_XFS_WriteContig()
55 goto leaving; in ADIOI_XFS_WriteContig()
67 goto leaving; in ADIOI_XFS_WriteContig()
76 goto leaving; in ADIOI_XFS_WriteContig()
85 goto leaving; in ADIOI_XFS_WriteContig()
90 goto leaving; in ADIOI_XFS_WriteContig()
109 goto leaving; in ADIOI_XFS_WriteContig()
117 leaving: in ADIOI_XFS_WriteContig()
|
| /dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
| H A D | lp_primal_core_solver.h | 460 if (j != leaving) in update_x_tableau_rows()
473 lp_assert(entering != leaving); in update_basis_and_x_tableau_rows()
474 update_x_tableau_rows(entering, leaving, tt); in update_basis_and_x_tableau_rows()
476 this->change_basis(entering, leaving); in update_basis_and_x_tableau_rows()
518 int leaving = find_smallest_inf_column(); in one_iteration_tableau_rows() local
519 if (leaving == -1) { in one_iteration_tableau_rows()
524 SASSERT(this->column_is_base(leaving)); in one_iteration_tableau_rows()
532 m_left_basis_tableau.insert(leaving); in one_iteration_tableau_rows()
543 this->m_x[leaving] = new_val_for_leaving; in one_iteration_tableau_rows()
544 this->remove_column_from_inf_set(leaving); in one_iteration_tableau_rows()
[all …]
|
| H A D | lp_core_solver_base.h | 113 m_trace_of_basis_change_vector.push_back(leaving); in trace_basis_change()
500 int place_in_basis = m_basis_heading[leaving]; in change_basis_unconditionally()
503 m_basis_heading[leaving] = -place_in_non_basis - 1; in change_basis_unconditionally()
504 m_nbasis[place_in_non_basis] = leaving; in change_basis_unconditionally()
506 trace_basis_change(entering, leaving); in change_basis_unconditionally()
513 lp_assert(m_basis_heading[leaving] >= 0); in change_basis()
515 int place_in_basis = m_basis_heading[leaving]; in change_basis()
520 m_basis_heading[leaving] = -place_in_non_basis - 1; in change_basis()
521 m_nbasis[place_in_non_basis] = leaving; in change_basis()
524 trace_basis_change(entering, leaving); in change_basis()
[all …]
|
| H A D | lp_primal_core_solver_tableau_def.h | 36 int leaving = find_leaving_and_t_tableau(entering, t); in advance_on_entering_tableau() local
37 if (leaving == -1) { in advance_on_entering_tableau()
42 advance_on_entering_and_leaving_tableau(entering, leaving, t); in advance_on_entering_tableau()
214 lp_assert(leaving >= 0 && entering >= 0); in advance_on_entering_and_leaving_tableau()
220 if (entering == leaving) { in advance_on_entering_and_leaving_tableau()
229 this->update_basis_and_x_tableau(entering, leaving, t); in advance_on_entering_and_leaving_tableau()
234 this->change_basis(entering, leaving); in advance_on_entering_and_leaving_tableau()
248 * it = static_cast<unsigned>(leaving); in advance_on_entering_and_leaving_tableau()
350 update_basis_and_x_tableau(int entering, int leaving, X const & tt) { in update_basis_and_x_tableau() argument
352 lp_assert(entering != leaving); in update_basis_and_x_tableau()
[all …]
|
| H A D | lar_core_solver.h | 377 unsigned leaving = trace_of_basis_change[i-2]; in catch_up_in_lu_in_reverse() local
407 bool good_l = basis_heading[leaving] < 0 && cs.m_basis_heading[leaving] >= 0; in catch_up_in_lu()
413 leaving = leav_q.front(); in catch_up_in_lu()
426 leav_q.push(leaving); in catch_up_in_lu()
431 lp_assert(cs.m_basis_heading[leaving] >= 0); in catch_up_in_lu()
505 unsigned leaving = trace_of_basis_change[i+1]; in catch_up_in_lu_tableau() local
507 bool good_l = basis_heading[leaving] < 0 && m_r_solver.m_basis_heading[leaving] >= 0; in catch_up_in_lu_tableau()
513 leaving = leav_q.front(); in catch_up_in_lu_tableau()
526 leav_q.push(leaving); in catch_up_in_lu_tableau()
539 m_r_solver.pivot_column_tableau(leaving, m_r_solver.m_basis_heading[leaving]); in catch_up_in_lu_tableau()
[all …]
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
| H A D | lp_primal_core_solver.h | 460 if (j != leaving) in update_x_tableau_rows()
473 lp_assert(entering != leaving); in update_basis_and_x_tableau_rows()
474 update_x_tableau_rows(entering, leaving, tt); in update_basis_and_x_tableau_rows()
476 this->change_basis(entering, leaving); in update_basis_and_x_tableau_rows()
518 int leaving = find_smallest_inf_column(); in one_iteration_tableau_rows() local
519 if (leaving == -1) { in one_iteration_tableau_rows()
524 SASSERT(this->column_is_base(leaving)); in one_iteration_tableau_rows()
532 m_left_basis_tableau.insert(leaving); in one_iteration_tableau_rows()
543 this->m_x[leaving] = new_val_for_leaving; in one_iteration_tableau_rows()
544 this->remove_column_from_inf_set(leaving); in one_iteration_tableau_rows()
[all …]
|
| H A D | lp_core_solver_base.h | 113 m_trace_of_basis_change_vector.push_back(leaving); in trace_basis_change()
500 int place_in_basis = m_basis_heading[leaving]; in change_basis_unconditionally()
503 m_basis_heading[leaving] = -place_in_non_basis - 1; in change_basis_unconditionally()
504 m_nbasis[place_in_non_basis] = leaving; in change_basis_unconditionally()
506 trace_basis_change(entering, leaving); in change_basis_unconditionally()
513 lp_assert(m_basis_heading[leaving] >= 0); in change_basis()
515 int place_in_basis = m_basis_heading[leaving]; in change_basis()
520 m_basis_heading[leaving] = -place_in_non_basis - 1; in change_basis()
521 m_nbasis[place_in_non_basis] = leaving; in change_basis()
524 trace_basis_change(entering, leaving); in change_basis()
[all …]
|
| H A D | lp_primal_core_solver_tableau_def.h | 36 int leaving = find_leaving_and_t_tableau(entering, t); in advance_on_entering_tableau() local
37 if (leaving == -1) { in advance_on_entering_tableau()
42 advance_on_entering_and_leaving_tableau(entering, leaving, t); in advance_on_entering_tableau()
215 lp_assert(leaving >= 0 && entering >= 0); in advance_on_entering_and_leaving_tableau()
221 if (entering == leaving) { in advance_on_entering_and_leaving_tableau()
230 this->update_basis_and_x_tableau(entering, leaving, t); in advance_on_entering_and_leaving_tableau()
235 this->change_basis(entering, leaving); in advance_on_entering_and_leaving_tableau()
249 * it = static_cast<unsigned>(leaving); in advance_on_entering_and_leaving_tableau()
351 update_basis_and_x_tableau(int entering, int leaving, X const & tt) { in update_basis_and_x_tableau() argument
353 lp_assert(entering != leaving); in update_basis_and_x_tableau()
[all …]
|
| H A D | lar_core_solver.h | 377 unsigned leaving = trace_of_basis_change[i-2]; in catch_up_in_lu_in_reverse() local
407 bool good_l = basis_heading[leaving] < 0 && cs.m_basis_heading[leaving] >= 0; in catch_up_in_lu()
413 leaving = leav_q.front(); in catch_up_in_lu()
426 leav_q.push(leaving); in catch_up_in_lu()
431 lp_assert(cs.m_basis_heading[leaving] >= 0); in catch_up_in_lu()
505 unsigned leaving = trace_of_basis_change[i+1]; in catch_up_in_lu_tableau() local
507 bool good_l = basis_heading[leaving] < 0 && m_r_solver.m_basis_heading[leaving] >= 0; in catch_up_in_lu_tableau()
513 leaving = leav_q.front(); in catch_up_in_lu_tableau()
526 leav_q.push(leaving); in catch_up_in_lu_tableau()
539 m_r_solver.pivot_column_tableau(leaving, m_r_solver.m_basis_heading[leaving]); in catch_up_in_lu_tableau()
[all …]
|
| /dports/net/mpich2/mpich2-1.5/src/mpi/romio/adio/ad_xfs/ |
| H A D | ad_xfs_write.c | 37 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
46 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
56 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
63 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
71 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
74 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
91 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
100 leaving: in ADIOI_XFS_WriteContig()
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/mca/io/romio314/romio/adio/ad_xfs/ |
| H A D | ad_xfs_write.c | 38 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
47 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
57 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
64 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
72 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
75 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
92 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
101 leaving: in ADIOI_XFS_WriteContig()
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/mca/io/romio321/romio/adio/ad_xfs/ |
| H A D | ad_xfs_write.c | 38 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
47 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
57 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
64 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
72 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
75 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
92 if (err < 0) {goto leaving;} in ADIOI_XFS_WriteContig()
101 leaving: in ADIOI_XFS_WriteContig()
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 30 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
39 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
44 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
54 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
70 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
83 for (leaving_it = leaving.begin(); leaving_it != leaving.end(); in clone()
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/databases/mysql57-client/mysql-5.7.36/rapid/plugin/group_replication/libmysqlgcs/src/interface/ |
| H A D | gcs_view.cc | 27 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
33 clone(members, view_id, leaving, joined, group_id, m_error_code); in Gcs_view()
38 const std::vector<Gcs_member_identifier> &leaving, in Gcs_view() argument
45 clone(members, view_id, leaving, joined, group_id, error_code); in Gcs_view()
64 const std::vector<Gcs_member_identifier> &leaving, in clone() argument
79 for (leaving_it= leaving.begin(); leaving_it != leaving.end(); ++leaving_it) in clone()
|
| /dports/science/siconos/siconos-4.4.0/numerics/src/LCP/ |
| H A D | lcp_pivot_lumod.c | 115 unsigned leaving = 0; in lcp_pivot_lumod_covering_vector() local
259 leaving = basis[block]; in lcp_pivot_lumod_covering_vector()
332 … if(leaving < dim + BASIS_OFFSET) /* the leaving variable is w_i -> the driving variable is z_i */ in lcp_pivot_lumod_covering_vector()
334 drive = leaving + dim + BASIS_OFFSET; in lcp_pivot_lumod_covering_vector()
335 cblas_dcopy(dim, &M[dim*(leaving-BASIS_OFFSET)], 1, driving_col, 1); in lcp_pivot_lumod_covering_vector()
339 drive = leaving - (dim + BASIS_OFFSET); in lcp_pivot_lumod_covering_vector()
360 drive = leaving + dim + BASIS_OFFSET; in lcp_pivot_lumod_covering_vector()
361 cblas_dcopy(dim, &M[dim*(leaving-BASIS_OFFSET)], 1, driving_col, 1); in lcp_pivot_lumod_covering_vector()
365 drive = leaving - (dim + BASIS_OFFSET); in lcp_pivot_lumod_covering_vector()
518 leaving = basis[block]; in lcp_pivot_lumod_covering_vector()
[all …]
|
| H A D | lcp_pivot.c | 78 unsigned leaving = 0; in lcp_pivot_covering_vector() local
297 leaving = basis[block]; in lcp_pivot_covering_vector()
339 if(leaving < dim + 1) in lcp_pivot_covering_vector()
341 drive = leaving + dim + 1; in lcp_pivot_covering_vector()
343 else if(leaving > dim + 1) in lcp_pivot_covering_vector()
345 drive = leaving - (dim + 1); in lcp_pivot_covering_vector()
356 if(leaving < dim + 1) in lcp_pivot_covering_vector()
358 drive = leaving + dim + 1; in lcp_pivot_covering_vector()
360 else if(leaving > dim + 1) in lcp_pivot_covering_vector()
469 leaving = basis[block]; in lcp_pivot_covering_vector()
[all …]
|
| /dports/misc/dartsim/dart-6.11.1/dart/lcpsolver/ |
| H A D | Lemke.cpp | 94 int leaving = 0; in Lemke() local
159 leaving = bas[lvindex]; in Lemke()
176 if (leaving == t) in Lemke()
180 else if (leaving < n) in Lemke()
182 entering = n + leaving; in Lemke()
184 Be[leaving] = -1; in Lemke()
188 entering = leaving - n; in Lemke()
273 leaving = bas[lvindex]; in Lemke()
296 if (iter >= maxiter && leaving != t) in Lemke()
|