Home
last modified time | relevance | path

Searched refs:branches_ (Results 1 – 23 of 23) sorted by relevance

/dports/cad/iverilog/verilog-11.0/vvp/
H A Dvvp_island.cc53 branches_ = 0; in vvp_island()
64 while (branches_) { in ~vvp_island()
65 vvp_island_branch *next = branches_->next_branch; in ~vvp_island()
66 delete branches_; in ~vvp_island()
67 branches_ = next; in ~vvp_island()
140 branch->next_branch = branches_; in add_branch()
141 branches_ = branch; in add_branch()
H A Disland_tran.cc89 for (vvp_island_branch*cur = branches_ ; cur ; cur = cur->next_branch) { in run_island()
96 for (vvp_island_branch*cur = branches_ ; cur ; cur = cur->next_branch) { in run_island()
103 for (vvp_island_branch*cur = branches_ ; cur ; cur = cur->next_branch) { in run_island()
167 vvp_island_branch*branch = branches_; in count_drivers()
H A Dvvp_island.h85 vvp_island_branch*branches_;
/dports/devel/RStudio/rstudio-2021.09.1-372/src/gwt/src/org/rstudio/studio/client/workbench/views/vcs/git/model/
H A DGitState.java47 return branches_; in getBranchInfo()
63 return branches_ != null; in isInitialized()
91 branches_ = response.getBranches(); in refresh()
109 private BranchesInfo branches_; field in GitState
/dports/science/bagel/bagel-1.2.2/src/asd/
H A Dgamma_tree.h39 std::array<std::shared_ptr<GammaBranch<VecType>>, 4> branches_;
58 std::shared_ptr<GammaBranch<VecType>>& branch(const int i) { return branches_[i]; } in branch()
59 const std::shared_ptr<GammaBranch<VecType>>& branch(const int i) const { return branches_[i]; } in branch()
H A Dgamma_tree.cc37 shared_ptr<GammaBranch<VecType>> target = branches_[static_cast<int>(first)]; in insert()
/dports/games/stuntrally/stuntrally-2.6.1/source/vdrift/
H A Djoeserialize.h442 std::map <std::string, TreeMap> branches_; variable
446 if (branches_.empty()) //leaf in Print()
452 …ypename std::map <std::string, TreeMap>::const_iterator i = branches_.begin(); i != branches_.end(… in Print()
465 …ypename std::map <std::string, TreeMap>::const_iterator i = branches_.begin(); i != branches_.end(… in GetBranches()
474 branches_.clear(); in clear()
488 unsigned int NumberOfBranches() const {return branches_.size();} in NumberOfBranches()
494 if ( i == branches_.end() ) in branch()
503 if ( i == branches_.end() ) in branch()
589 return branches_[name]; in AddBranch()
619 i != othertree.branches_.end(); ++i) in Merge()
[all …]
/dports/devel/RStudio/rstudio-2021.09.1-372/src/gwt/src/org/rstudio/studio/client/workbench/views/vcs/
H A DBranchToolbarButton.java187 if (branches.length() != branches_.length()) in onVcsRefresh()
189 branches_ = branches.slice().cast(); in onVcsRefresh()
196 if (!StringUtil.equals(branches.get(i), branches_.get(i))) in onVcsRefresh()
198 branches_ = branches.slice(); in onVcsRefresh()
492 private JsVectorString branches_ = JsVectorString.createVector(); field in BranchToolbarButton
/dports/emulators/yuzu/yuzu-0b47f7a46/src/video_core/shader/
H A Dcontrol_flow.h75 explicit MultiBranch(u32 gpr_, std::vector<CaseBranch>&& branches_) in MultiBranch() argument
76 : gpr{gpr_}, branches{std::move(branches_)} {} in MultiBranch()
/dports/sysutils/dtpstree/dtpstree-1.0.3/
H A Ddtpstree.cpp224 std::vector<Branch> branches_; member in Tree
333 size_t last(branches_.size() - 1); in print()
335 _foreach (std::vector<Branch>, branch, branches_) in print()
357 else if (branches_.size()) in print()
363 branches_.back().done_ = true; in print()
389 branches_.push_back(Branch(!(flags_ & Arguments) ? size + string.size() + 1 : 2)); in print()
434 branches_.pop_back(); in pop()
/dports/cad/iverilog/verilog-11.0/tgt-vhdl/
H A Dvhdl_syntax.cc1033 for (case_branch_list_t::const_iterator it = branches_.begin(); in find_vars()
1034 it != branches_.end(); ++it) { in find_vars()
1048 int n = branches_.size(); in emit()
1049 for (it = branches_.begin(); it != branches_.end(); ++it) { in emit()
H A Dvhdl_syntax.hh533 void add_branch(vhdl_case_branch *b) { branches_.push_back(b); } in add_branch()
538 case_branch_list_t branches_; member in vhdl_case_stmt
/dports/cad/iverilog/verilog-11.0/
H A Dnet_design.cc43 branches_ = 0; in Design()
972 bra->next_ = branches_; in add_branch()
973 branches_ = bra; in add_branch()
H A Demit.cc537 for (NetBranch*cur = branches_ ; cur ; cur = cur->next_) { in emit()
H A Ddesign_dump.cc1994 if (branches_) { in dump()
1995 for (NetBranch*cur = branches_ ; cur ; cur = cur->next_) in dump()
H A Dnetlist.h5104 NetBranch*branches_; variable
/dports/mail/spamassassin-devel/spamassassin-1ea352210/build/mkupdates/
H A Dmkupdate-with-scores291 …svn info https://svn.apache.org/repos/asf/spamassassin/branches_${MAJOR_VERS}.${MINOR_VERS}.${UPDA…
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Dsearch.cc4042 branches_(branches), in RegularLimit()
4056 branches_ = regular->branches_; in Copy()
4067 return s->MakeLimit(wall_time(), branches_, failures_, solutions_, in MakeIdenticalClone()
4074 return s->branches() - branches_offset_ >= branches_ || in Check()
4081 int64_t progress = GetPercent(s->branches(), branches_offset_, branches_); in ProgressPercent()
4107 branches_ -= s->branches() - branches_offset_; in ExitSearch()
4117 branches_ = branches; in UpdateLimits()
4132 crossed(), absl::FormatDuration(duration_limit()), branches_, failures_, in DebugString()
4140 branches_); in Accept()
H A Dconstraint_solver.cc1437 branches_ = 0; in Init()
1517 branches_, fails_, decisions_, demon_runs_[DELAYED_PRIORITY], in DebugString()
2161 branches_++; in NextSolution()
2192 branches_++; in NextSolution()
H A Dconstraint_solver.h982 int64_t branches() const { return branches_; } in branches()
3109 int64_t branches_; variable
4344 int64_t branches() const { return branches_; } in branches()
4371 int64_t branches_; variable
/dports/www/writefreely/writefreely-0.13.1/
H A DCONTRIBUTING.md31 While developing, we primarily work from the `develop` branch, creating _feature branches_ off of i…
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/doc/user/project/merge_requests/
H A Dgetting_started.md19 branches, also called _feature branches_, to propose changes to
/dports/math/fricas/fricas-1.3.7/src/interp/
H A Dbr-con.boot996 …em a} and {\em b} are called _"tags_" and are used to identify the two _"branches_" of the union. "