Home
last modified time | relevance | path

Searched refs:Chains (Results 1 – 25 of 1636) sorted by relevance

12345678910>>...66

/dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/util/stream/
H A Dmulti_stream.hh17 class Chains;
26 void Init(Chains &chains);
28 explicit ChainPositions(Chains &chains) { in ChainPositions()
33 class Chains : public util::FixedArray<util::stream::Chain> { class
36 typedef Chains type;
41 Chains() {} in Chains() function in util::stream::Chains
71 Chains(const Chains &);
72 void operator=(const Chains &);
75 inline void ChainPositions::Init(Chains &chains) { in Init()
83 inline Chains &operator>>(Chains &chains, ChainPositions &positions) { in operator >>()
[all …]
/dports/math/gap/gap-4.11.0/pkg/hap-1.25/lib/TorsionSubcomplexes/
H A Dbarycentriccount.gi105 Chains:=[];
108 Chains[1]:=[];
112 Add(Chains[1],[[i-1,j]]);
117 Chains[k+1]:=[];
123 Append(Chains[k+1],w);
127 NChains:=StructuralCopy(Chains[N+1]);
129 Chains:=[];
143 Chains[k-1]:=[];
146 Add(Chains[k-1],w);
154 return List([1..Length(Chains)],i->Length(Chains[i]));
[all …]
/dports/databases/p5-DBM-Deep/DBM-Deep-2.0016/t/
H A D97_dump_file.t17 Chains(B):
18 Chains(D):
19 Chains(I):
27 Chains(B):
28 Chains(D):
29 Chains(I):
41 Chains(B):
42 Chains(D):
43 Chains(I):
/dports/databases/couchdb3/apache-couchdb-3.2.1/src/couch/src/
H A Dcouch_emsort.erl217 Chains = init_chains(Ems, small, BB),
218 {ok, {Ems, Chains}};
225 next({Ems, Chains}) ->
226 {KV, RestChains} = choose_kv(small, Ems, Chains),
295 Chains = init_chains(Ems, Choose, BB),
296 merge_chains(Ems, Choose, Chains, {[], nil}, Reporter, 0).
303 {KV, RestChains} = choose_kv(Choose, Ems, Chains),
316 Chains = lists:map(fun(CPos) ->
320 order_chains(Choose, Chains).
323 order_chains(small, Chains) -> lists:sort(Chains);
[all …]
/dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/lm/interpolate/
H A Dnormalize.hh15 class Chains;
27 util::stream::Chains &merged_probabilities,
29 util::stream::Chains &probabilities_out,
31 util::stream::Chains &backoffs_out);
H A Dpipeline.cc23 …delBuffer> &models, bool exclude_highest, util::FixedArray<util::stream::Chains> &chains, util::Fi… in SetupInputs()
46 template <class Compare> void SinkSort(const util::stream::SortConfig &config, util::stream::Chains… in SinkSort()
52 template <class Compare> void SourceSort(util::stream::Chains &chains, util::stream::Sorts<Compare>… in SourceSort()
87 util::FixedArray<util::stream::Chains> input_chains(models.size()); in Pipeline()
91 util::stream::Chains merged_probs(max_order); in Pipeline()
100 for (util::stream::Chains *i = input_chains.begin(); i != input_chains.end(); ++i) { in Pipeline()
109 for (util::stream::Chains *i = input_chains.begin(); i != input_chains.end(); ++i) { in Pipeline()
117 util::stream::Chains probabilities(max_order), backoffs(max_order - 1); in Pipeline()
138 for (util::stream::Chains *i = input_chains.begin(); i != input_chains.end(); ++i) { in Pipeline()
148 for (util::stream::Chains *i = input_chains.begin(); i != input_chains.end(); ++i) { in Pipeline()
[all …]
H A Dnormalize_test.cc62 util::stream::Chains blank(0); in BOOST_AUTO_TEST_CASE()
67 util::stream::Chains merged_probabilities(1); in BOOST_AUTO_TEST_CASE()
68 util::stream::Chains probabilities_out(1); in BOOST_AUTO_TEST_CASE()
69 util::stream::Chains backoffs_out(0); in BOOST_AUTO_TEST_CASE()
/dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/lm/builder/
H A Doutput.hh11 namespace util { namespace stream { class Chains; class ChainPositions; } }
30 virtual void Sink(const HeaderInfo &info, int vocab_file, util::stream::Chains &chains) = 0;
57 void SinkProbs(util::stream::Chains &chains);
62 void Apply(HookType hook_type, util::stream::Chains &chains);
76 void Sink(const HeaderInfo &info, int vocab_file, util::stream::Chains &chains);
H A Dinitial_probabilities.hh10 namespace util { namespace stream { class Chains; } }
35 util::stream::Chains &primary,
36 util::stream::Chains &second_in,
37 util::stream::Chains &gamma_out,
H A Doutput.cc17 void Output::SinkProbs(util::stream::Chains &chains) { in SinkProbs()
36 void Output::Apply(HookType hook_type, util::stream::Chains &chains) { in Apply()
42 void PrintHook::Sink(const HeaderInfo &info, int vocab_file, util::stream::Chains &chains) { in Sink()
/dports/www/beehive/beehive-0.4.0/api/resources/chains/
H A Dchains_response.go36 Chains []chainInfoResponse `json:"chains,omitempty"` member
71 r.Chains = append(r.Chains, prepareChainResponse(r.Context, r.chains[k]))
81 Chains interface{} `json:"chains"`
83 out.Chains = []chainInfoResponse{}
/dports/games/bubble-chains/bubble-chains-0.2.0/
H A DREADME.md1 # Original Bubble Chains Game
3 Bubble Chains is a funny 2D game which runs on Linux, Windows and FreeBSD.
5 The aim of Bubble Chains is to remove all of the targets on each level, and to do this before the t…
11 This repository contains original source codes and resources of the Bubble Chains game created in t…
21 Since Bubble Chains is based on Qt5 framework, all the platforms supported by Qt should be able to …
30 Bubble Chains software is free and is distributed according to GPL-3 and compatible licenses.
43 Bubble Chains has been created using only free development software and free resources.
H A DREADME1 Bubble Chains: free crossplatform 2D arcade-puzzle game
9 Bubble Chains is a funny 2D game which runs on Linux, Windows and FreeBSD.
10 Bubble Chains was created using only free development software and free resources.
15 Bubble Chains originally created by:
31 Since Bubble Chains is based on Qt5 framework, all the platforms supported by
/dports/math/gap/gap-4.11.0/pkg/hap-1.25/lib/ArithmeticGroups/
H A Dbarycentric.gi10 Elts,Rep,mult,ListUnion, Chains, IsSameOrbit, AddReturn,
125 Chains:=[];
128 Chains[1]:=[];
132 Add(Chains[1],[[i-1,j]]);
137 Chains[k+1]:=[];
139 for i in [1..Length(Chains[k])] do
140 ck:=StructuralCopy(Chains[k][i]);
143 Append(Chains[k+1],w);
147 NChains:=StructuralCopy(Chains[N+1]);
248 Chains:=Chains,
/dports/biology/emboss/EMBOSS-6.6.0/ajax/core/
H A Dajpdb.c2707 AJCNEW0(pdb->Chains, n); in ajPdbNew()
3140 AJFREE(pdb->Chains); in ajPdbDel()
3698 (*Pto)->Chains[i]->Id = from->Chains[i]->Id; in ajPdbCopy()
3699 (*Pto)->Chains[i]->Nres = from->Chains[i]->Nres; in ajPdbCopy()
3700 (*Pto)->Chains[i]->Nlig = from->Chains[i]->Nlig; in ajPdbCopy()
3701 (*Pto)->Chains[i]->numHelices = from->Chains[i]->numHelices; in ajPdbCopy()
3702 (*Pto)->Chains[i]->numStrands = from->Chains[i]->numStrands; in ajPdbCopy()
3703 ajStrAssignS(&((*Pto)->Chains[i]->Seq), from->Chains[i]->Seq); in ajPdbCopy()
3705 (*Pto)->Chains[i]->Atoms = ajAtomListCopy(from->Chains[i]->Atoms); in ajPdbCopy()
3707 if (!ajAtomListCopy(&(*Pto)->Chains[i]->Atoms, from->Chains[i]->Atoms)) in ajPdbCopy()
[all …]
/dports/chinese/libime/libime-1.0.9/src/libime/core/kenlm/lm/common/
H A Dmodel_buffer.hh16 class Chains;
33 void Sink(util::stream::Chains &chains, const std::vector<uint64_t> &counts);
37 void Source(util::stream::Chains &chains);
/dports/devel/taskflow/taskflow-3.2.0/taskflow/dsl/
H A Dtask_dsl.hpp11 template <typename CONTEXT = EmptyContext, typename... Chains> class TaskDsl {
12 using Links = Unique_t<Flatten_t<TypeList<typename Chain<Chains>::type...>>>;
65 template <typename = void, typename... Chains, typename CONTEXT = EmptyContext>
66 constexpr TaskDsl<CONTEXT, Chains...> taskDsl(FlowBuilder &flow_builder, in taskDsl()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/devel/llvm10/llvm-10.0.1.src/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/devel/llvm11/llvm-11.0.1.src/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp247 if (Chains.count(Ra)) { in addInterChainConstraint()
251 Chains.remove(Ra); in addInterChainConstraint()
252 Chains.insert(Rd); in addInterChainConstraint()
257 Chains.insert(Rd); in addInterChainConstraint()
263 for (auto r : Chains) { in addInterChainConstraint()
334 Chains.clear(); // FIXME: really needed ? Could not work at MF level ? in apply()
339 for (auto r : Chains) { in apply()
348 Chains.remove(toDel.back()); in apply()

12345678910>>...66