/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/lib_rpl/rpl/ |
H A D | range.h | 15 inline auto single(Value &&value) { in single() function 19 consumer.put_next(std::move(value)); in single() 26 inline auto single() { in single() function 37 values = std::move(values) in vector() 40 consumer.put_next(std::move(value)); in vector() 50 values = std::move(values) in vector() 70 inline auto ints(int from, int till) { in ints() argument 71 Expects(from <= till); in ints() 72 return make_producer<int>([from, till](const auto &consumer) { in ints() 73 for (auto i = from; i != till; ++i) { in ints()
|
/dports/security/gopass/gopass-1.13.0/docs/commands/ |
H A D | move.md | 1 # `move` command 3 Note: The implementations for `copy` and `move` are exactly the same. The only difference is that `… 5 The `move` command works like the Unix `mv` or `rsync` binaries. It allows moving either single ent… 9 Please note that `move` will always decrypt the source and re-encrypt at the destination. 17 $ gopass move path/to/leaf new/leaf 19 $ gopass move path/to/somedirdir new/dir 21 $ gopass move entry entry 26 * Move a single secret from source to destination 27 * Move a folder of secrets, possibly with sub folders, from source to destination 37 * To simplify the implementation and support multiple backends a `copy` or `move` operation will al… [all …]
|
/dports/net/storj/storj-1.45.3/docs/blueprints/ |
H A D | server-side-rename.md | 1 # Server-side move 5 This blueprint describes a design to implement server-side move feature. 9 …ver-side move (rename) is a very useful feature as since people quite often move things around. Cu… 16 - decrypt all received encrypted keys and decrypt it with *new* key derived from *new* object key (… 18 - replace *old* object key and *old* encrypted keys with *new* received from uplink in atomic opera… 20 The above list cannot be executed in a single uplink->satellite request so we will need at least tw… 21 perform move. The first call will be used to get all necessary data needed for move from the satell… 27 …move should be searched with `project_id, bucket_name, object_key, version, stream_id`. This will … 35 … it should only increase/decrease change for auditing this object during single metainfo loop exec… 42 …n handle only objects with a number of segments that can be handled in a single request (e.g. 1000… [all …]
|
/dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/SourceFiles/boxes/ |
H A D | send_files_box.cpp | 102 int from, in Block() argument 107 , _from(from) in Block() 109 Expects(from >= 0); in Block() 161 return media->deleteRequests() | rpl::map([from] { return from; }); in itemDeleteRequest() 163 const auto single = static_cast<Ui::SingleFilePreview*>(preview); in itemDeleteRequest() local 164 return single->deleteRequests() | rpl::map([from] { return from; }); in itemDeleteRequest() 178 return media->editRequests() | rpl::map([from] { return from; }); in itemReplaceRequest() 180 const auto single = static_cast<Ui::SingleFilePreview*>(preview); in itemReplaceRequest() local 181 return single->editRequests() | rpl::map([from] { return from; }); in itemReplaceRequest() 542 from, in pushBlock() [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/learning/structureUtils/ |
H A D | graphChangesGenerator4DiGraph_tpl.h | 47 constraint_(from.constraint_), legal_changes_(from.legal_changes_), in GraphChangesGenerator4DiGraph() 56 graph_(std::move(from.graph_)), in GraphChangesGenerator4DiGraph() 57 constraint_(from.constraint_), legal_changes_(std::move(from.legal_changes_)), in GraphChangesGenerator4DiGraph() 88 graph_ = std::move(from.graph_); 89 constraint_ = std::move(from.constraint_); 90 legal_changes_ = std::move(from.legal_changes_); 107 # pragma omp single in createChanges_() 124 legal_changes[this_thread].insert(std::move(arc_add)); in createChanges_() 130 legal_changes[this_thread].insert(std::move(arc_del)); in createChanges_() 136 legal_changes[this_thread].insert(std::move(arc_rev)); in createChanges_() [all …]
|
H A D | graphChangesGenerator4UndiGraph_tpl.h | 47 constraint_(from.constraint_), legal_changes_(from.legal_changes_), in GraphChangesGenerator4UndiGraph() 56 graph_(std::move(from.graph_)), in GraphChangesGenerator4UndiGraph() 57 constraint_(from.constraint_), legal_changes_(std::move(from.legal_changes_)), in GraphChangesGenerator4UndiGraph() 73 if (this != &from) { 88 graph_ = std::move(from.graph_); 89 constraint_ = std::move(from.constraint_); 90 legal_changes_ = std::move(from.legal_changes_); 107 # pragma omp single in createChanges_() 124 legal_changes[this_thread].insert(std::move(edge_add)); in createChanges_() 130 legal_changes[this_thread].insert(std::move(edge_del)); in createChanges_() [all …]
|
H A D | graphChangesGenerator4K2_tpl.h | 47 constraint_(from.constraint_), order_(from.order_), legal_changes_(from.legal_changes_), in GraphChangesGenerator4K2() 56 graph_(std::move(from.graph_)), in GraphChangesGenerator4K2() 57 constraint_(from.constraint_), order_(std::move(from.order_)), in GraphChangesGenerator4K2() 58 legal_changes_(std::move(from.legal_changes_)), in GraphChangesGenerator4K2() 90 graph_ = std::move(from.graph_); 91 constraint_ = std::move(from.constraint_); 92 order_ = std::move(from.order_); 93 legal_changes_ = std::move(from.legal_changes_); 110 # pragma omp single in createChanges_() 125 legal_changes[this_thread].insert(std::move(arc_add)); in createChanges_() [all …]
|
/dports/biology/viennarna/ViennaRNA-2.4.18/doc/latex/ |
H A D | group__paths__walk.tex | 2 …__walk}\index{Folding Paths that start at a single Secondary Structure@{Folding Paths that start a… 5 Implementation of gradient-\/ and random walks starting from a single secondary structure. 11 Implementation of gradient-\/ and random walks starting from a single secondary structure. 31 …small\item\em Option flag to request defaults (steepest descent / default move set) \end{DoxyCompa… 62 \index{Folding Paths that start at a single Secondary Structure@{Folding Paths that start at a sing… 107 Option flag to request defaults (steepest descent / default move set) 116 \index{Folding Paths that start at a single Secondary Structure@{Folding Paths that start at a sing… 117 …@{vrna\_path}!Folding Paths that start at a single Secondary Structure@{Folding Paths that start a… 127 Compute a path, store the final structure, and return a list of transition moves from the start to … 171 …nt path, store the final structure, and return a list of transition moves from the start to the fi… [all …]
|
/dports/security/vault/vault-1.8.2/vendor/github.com/apple/foundationdb/documentation/sphinx/source/ |
H A D | subspace-indirection-java.rst | 15 Some large or long operations, such as bulk inserts, cannot be handled in a single FoundationDB tra… 20 …onally moved into place upon completion of the writes. We can perform the move quickly because the… 22 …is mapped to a prefix for a subspace. The indirection from paths to subspaces makes it fast to mov… 32 For a single client, we can use a simple Workspace class to handle creation of a new subspace and t… 37 …ctorySubspace> workingDir = DirectoryLayer.getDefault().createOrOpen(db, PathUtil.from("working")); 49 tr.set(newspace.pack(Tuple.from(3)),Tuple.from("c").pack()); 50 tr.set(newspace.pack(Tuple.from(4)), Tuple.from("d").pack()); 82 return dir.createOrOpen(this.db, PathUtil.from("current")); 85 return dir.createOrOpen(this.db, PathUtil.from("new")); 89 return dir.remove(tr, PathUtil.from("current")) // Clear the old current. [all …]
|
/dports/games/gnome-chess/gnome-chess-41.1/doc/ |
H A D | Portable Game Notation | 45 visible when a user attempts to move significant quantities of data from one 641 formed from the integer giving the fullmove number with a single period 677 square; a rank is a row of eight squares designated by a single digit from "1" 812 example, if the single move symbol "Qxa8?" appears in an import format PGN 1115 NAGs with values from 1 to 9 annotate the move just played. 1934 the single character symbol "-" is used. Otherwise, a combination of from one 2063 the single character symbol "-" is used. Otherwise, a combination of from one 2367 The "pm" opcode is used to provide a single predicted move for the indicated 2403 The "sm" opcode is used to provide a single supplied move for the indicated 2405 move is the move to be played from the position. [all …]
|
/dports/lang/fpc-utils/fpc-3.2.2/rtl/m68k/ |
H A D | lowmath.inc | 22 { single floating point routines taken from GCC 2.5.2 Atari compiler } 46 { Low-level routine to normalize single e } 152 { Low-level routine to add/subtract single } 156 { d0 = result -- from normalize routine } 164 { d1-d0 = single values to subtract. } 170 { d0, d1 = single values to add. } 336 { Low-level routine to multiply two single } 510 { Low-level routine to dividr two single } 676 { Low-level routine to compare single two } 677 { single point values.. } [all …]
|
/dports/lang/fpc-source/fpc-3.2.2/rtl/m68k/ |
H A D | lowmath.inc | 22 { single floating point routines taken from GCC 2.5.2 Atari compiler } 46 { Low-level routine to normalize single e } 152 { Low-level routine to add/subtract single } 156 { d0 = result -- from normalize routine } 164 { d1-d0 = single values to subtract. } 170 { d0, d1 = single values to add. } 336 { Low-level routine to multiply two single } 510 { Low-level routine to dividr two single } 676 { Low-level routine to compare single two } 677 { single point values.. } [all …]
|
/dports/lang/fpc/fpc-3.2.2/rtl/m68k/ |
H A D | lowmath.inc | 22 { single floating point routines taken from GCC 2.5.2 Atari compiler } 46 { Low-level routine to normalize single e } 152 { Low-level routine to add/subtract single } 156 { d0 = result -- from normalize routine } 164 { d1-d0 = single values to subtract. } 170 { d0, d1 = single values to add. } 336 { Low-level routine to multiply two single } 510 { Low-level routine to dividr two single } 676 { Low-level routine to compare single two } 677 { single point values.. } [all …]
|
/dports/editors/fpc-ide/fpc-3.2.2/rtl/m68k/ |
H A D | lowmath.inc | 22 { single floating point routines taken from GCC 2.5.2 Atari compiler } 46 { Low-level routine to normalize single e } 152 { Low-level routine to add/subtract single } 156 { d0 = result -- from normalize routine } 164 { d1-d0 = single values to subtract. } 170 { d0, d1 = single values to add. } 336 { Low-level routine to multiply two single } 510 { Low-level routine to dividr two single } 676 { Low-level routine to compare single two } 677 { single point values.. } [all …]
|
/dports/net-im/tkabber-plugins/tkabber-plugins-1.1.2/unixkeys/ |
H A D | README | 26 * M-a -- move cursor to the start of text. 27 * M-e -- move cursor to the end of text (but see below). 29 * M-f -- move cursor one word forward. 30 * M-b -- move cursor one word backward. 32 * C-u -- delete text from the cursor to the beginning of the 51 entry widgets (they're borrowed from single-line entry and 63 * C-f, C-b -- move cursor one character forward/backward. 65 * M-f, M-b -- move cursor one word forward/backward. 69 (in single-line entry widgets). 71 * M-a, M-e -- move cursor to the start/end of text. [all …]
|
/dports/net/pacemaker2/pacemaker-Pacemaker-2.1.1/doc/sphinx/Pacemaker_Explained/ |
H A D | advanced-options.rst | 88 disappear from the status display. This allows us to trigger a re-check of 116 from the original node after *N* failures there. 153 thus always cause the resource to move immediately. 162 single: resource; move 170 There are primarily two occasions when you would want to move a resource from 182 for every resource to prevent them from running on one node. While Pacemaker 246 To allow the resource to move back again, use: 264 Alternatively, if you only care that the resource should be moved from its 279 constraint will prevent the resource from running on that node until 502 from the old location and activating it. [all …]
|
/dports/games/hyperrogue/hyperrogue-12.0f/ |
H A D | bigstuff.cpp | 1440 if(!from) return true; in deep_ocean_at() 1441 else for(int i=0; i<from->type; i++) { in deep_ocean_at() 1442 cell *c2 = from->move(i); in deep_ocean_at() 1452 if(!from) return true; in deep_ocean_at() 1453 else for(int i=0; i<from->type; i++) { in deep_ocean_at() 1454 cell *c2 = from->move(i); in deep_ocean_at() 1525 if(ctof(c) && ls::single()) { in build_walls() 1564 else if(ls::single()) return; in build_walls() 1707 build_walls(c, from); in buildBigStuff() 1709 build_horocycles(c, from); in buildBigStuff() [all …]
|
/dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/github.com/alecthomas/chroma/lexers/s/ |
H A D | sparql.go | 19 …up\s+by|minus|distinct|reduced|from\s+named|from|order\s+by|desc|asc|limit|offset|bindings|load|cl… 34 {`"`, LiteralString, Push("single-double-quoted-string")}, 35 {`'''`, LiteralString, Push("triple-single-quoted-string")}, 36 {`'`, LiteralString, Push("single-single-quoted-string")},
|
/dports/devel/gh/cli-2.4.0/vendor/github.com/alecthomas/chroma/lexers/s/ |
H A D | sparql.go | 19 …up\s+by|minus|distinct|reduced|from\s+named|from|order\s+by|desc|asc|limit|offset|bindings|load|cl… 34 {`"`, LiteralString, Push("single-double-quoted-string")}, 35 {`'''`, LiteralString, Push("triple-single-quoted-string")}, 36 {`'`, LiteralString, Push("single-single-quoted-string")},
|
/dports/sysutils/glow/glow-0.2.0/vendor/github.com/alecthomas/chroma/lexers/s/ |
H A D | sparql.go | 19 …up\s+by|minus|distinct|reduced|from\s+named|from|order\s+by|desc|asc|limit|offset|bindings|load|cl… 34 {`"`, LiteralString, Push("single-double-quoted-string")}, 35 {`'''`, LiteralString, Push("triple-single-quoted-string")}, 36 {`'`, LiteralString, Push("single-single-quoted-string")},
|
/dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/alecthomas/chroma/lexers/s/ |
H A D | sparql.go | 19 …up\s+by|minus|distinct|reduced|from\s+named|from|order\s+by|desc|asc|limit|offset|bindings|load|cl… 34 {`"`, LiteralString, Push("single-double-quoted-string")}, 35 {`'''`, LiteralString, Push("triple-single-quoted-string")}, 36 {`'`, LiteralString, Push("single-single-quoted-string")},
|
/dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/alecthomas/chroma/chroma-0.6.3/lexers/s/ |
H A D | sparql.go | 19 …up\s+by|minus|distinct|reduced|from\s+named|from|order\s+by|desc|asc|limit|offset|bindings|load|cl… 34 {`"`, LiteralString, Push("single-double-quoted-string")}, 35 {`'''`, LiteralString, Push("triple-single-quoted-string")}, 36 {`'`, LiteralString, Push("single-single-quoted-string")},
|
/dports/games/ldmud/ldmud-3.3.720/doc/LPC/ |
H A D | ed5 | 22 <start>,<end>m<dest> : move block (lines from start to end) 24 <line>m<dest> : move single line 25 m<dest> : move current line 36 <start>,<end>t<dest> : copy block ( lines from start to end ) 38 <line>t<dest> : copy single line
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/torque/ |
H A D | type-oracle.h | 27 new AbstractType(parent, flags, std::move(name), std::move(generated), in GetAbstractType() 34 Get().nominal_types_.push_back(std::move(ptr)); in GetAbstractType() 135 if (base::Optional<const Type*> single = type.GetSingleMember()) { in GetUnionType() local 136 return *single; in GetUnionType() 146 return GetUnionType(std::move(result)); in GetUnionType() 324 const Type* to, const Type* from) { in ImplicitlyConvertableFrom() argument 325 while (from != nullptr) { in ImplicitlyConvertableFrom() 329 from_constexpr->GetSpecialization({to, from})) { in ImplicitlyConvertableFrom() 331 TypeVector{from}) { in ImplicitlyConvertableFrom() 332 return from; in ImplicitlyConvertableFrom() [all …]
|
/dports/lang/v8/v8-9.6.180.12/src/torque/ |
H A D | type-oracle.h | 27 new AbstractType(parent, flags, std::move(name), std::move(generated), in GetAbstractType() 34 Get().nominal_types_.push_back(std::move(ptr)); in GetAbstractType() 146 if (base::Optional<const Type*> single = type.GetSingleMember()) { in GetUnionType() local 147 return *single; in GetUnionType() 157 return GetUnionType(std::move(result)); in GetUnionType() 355 const Type* to, const Type* from) { in ImplicitlyConvertableFrom() argument 356 while (from != nullptr) { in ImplicitlyConvertableFrom() 360 from_constexpr->GetSpecialization({to, from})) { in ImplicitlyConvertableFrom() 362 TypeVector{from}) { in ImplicitlyConvertableFrom() 363 return from; in ImplicitlyConvertableFrom() [all …]
|