Home
last modified time | relevance | path

Searched +refs:merge +refs:lists +refs:no +refs:key (Results 1 – 25 of 11089) sorted by relevance

12345678910>>...444

/dports/lang/erlang-wx/otp-OTP-24.1.7/lib/stdlib/test/
H A Dmaps_SUITE.erl518 ?badmap([a|b],merge,[[a|b],[a|b]]) = (catch maps:merge(List, List)),
805 {get, [key, #{}]},
806 {get, [key, {no,map}]},
807 {get, [key, {no,map}, default]},
820 {iterator,[{no,map}]},
822 {keys, [{no,map}]},
838 {put, [key, value, {no,map}]},
840 {remove,[key, {no,map}]},
850 {update_with, [key, fun(_) -> ok end, {no,map}]},
853 {update_with, [key, fun(_) -> ok end, init, {no,map}]},
[all …]
H A Dlists_SUITE.erl83 {group, key},
406 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
408 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
409 false = lists:keytake(key, 2, [{a}]),
410 false = lists:keytake(key, 1, [a]),
424 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
591 no.
803 no.
2329 [a,b,c,[no,flatten]] = lists:flatten([[a,[b,c]]], [[no,flatten]]),
[all …]
/dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/stdlib/test/
H A Dmaps_SUITE.erl518 ?badmap([a|b],merge,[[a|b],[a|b]]) = (catch maps:merge(List, List)),
805 {get, [key, #{}]},
806 {get, [key, {no,map}]},
807 {get, [key, {no,map}, default]},
820 {iterator,[{no,map}]},
822 {keys, [{no,map}]},
838 {put, [key, value, {no,map}]},
840 {remove,[key, {no,map}]},
850 {update_with, [key, fun(_) -> ok end, {no,map}]},
853 {update_with, [key, fun(_) -> ok end, init, {no,map}]},
[all …]
H A Dlists_SUITE.erl83 {group, key},
406 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
408 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
409 false = lists:keytake(key, 2, [{a}]),
410 false = lists:keytake(key, 1, [a]),
424 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
591 no.
803 no.
2329 [a,b,c,[no,flatten]] = lists:flatten([[a,[b,c]]], [[no,flatten]]),
[all …]
/dports/lang/erlang/otp-OTP-24.1.7/lib/stdlib/test/
H A Dmaps_SUITE.erl518 ?badmap([a|b],merge,[[a|b],[a|b]]) = (catch maps:merge(List, List)),
805 {get, [key, #{}]},
806 {get, [key, {no,map}]},
807 {get, [key, {no,map}, default]},
820 {iterator,[{no,map}]},
822 {keys, [{no,map}]},
838 {put, [key, value, {no,map}]},
840 {remove,[key, {no,map}]},
850 {update_with, [key, fun(_) -> ok end, {no,map}]},
853 {update_with, [key, fun(_) -> ok end, init, {no,map}]},
[all …]
H A Dlists_SUITE.erl83 {group, key},
406 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
408 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
409 false = lists:keytake(key, 2, [{a}]),
410 false = lists:keytake(key, 1, [a]),
424 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
591 no.
803 no.
2329 [a,b,c,[no,flatten]] = lists:flatten([[a,[b,c]]], [[no,flatten]]),
[all …]
/dports/lang/erlang-java/otp-OTP-24.1.7/lib/stdlib/test/
H A Dmaps_SUITE.erl518 ?badmap([a|b],merge,[[a|b],[a|b]]) = (catch maps:merge(List, List)),
805 {get, [key, #{}]},
806 {get, [key, {no,map}]},
807 {get, [key, {no,map}, default]},
820 {iterator,[{no,map}]},
822 {keys, [{no,map}]},
838 {put, [key, value, {no,map}]},
840 {remove,[key, {no,map}]},
850 {update_with, [key, fun(_) -> ok end, {no,map}]},
853 {update_with, [key, fun(_) -> ok end, init, {no,map}]},
[all …]
H A Dlists_SUITE.erl83 {group, key},
406 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
408 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
409 false = lists:keytake(key, 2, [{a}]),
410 false = lists:keytake(key, 1, [a]),
424 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
591 no.
803 no.
2329 [a,b,c,[no,flatten]] = lists:flatten([[a,[b,c]]], [[no,flatten]]),
[all …]
/dports/lang/elixir/elixir-1.12.3/lib/elixir/lib/
H A Dkeyword.ex52 `Keyword.put(opts, new_key, new_value)`, there is no guarantee to
193 (`nil` if no default value).
326 Gets the value from `key` and updates it. Raises if there is no `key`.
753 There are no guarantees about the order of keys in the returned keyword.
763 iex> Keyword.merge([a: 1], [2, 3])
767 @spec merge(t, t) :: t
768 def merge(keywords1, keywords2) function
800 There are no guarantees about the order of keys in the returned keyword.
825 @spec merge(t, t, (key, value, value -> value)) :: t
826 def merge(keywords1, keywords2, fun) function
[all …]
/dports/audio/beets/beets-1.4.9/docs/plugins/
H A Dduplicates.rst5 and lists duplicate tracks or albums in your collection.
32 -M, --merge merge duplicate items
45 Default: ``no``.
59 Default: ``no``.
61 Default: ``no``
69 Default: ``no``
82 Default: ``no``.
85 Default: ``no``
86 - **tag**: A ``key=value`` pair. The plugin will add a new ``key`` attribute
88 Default: ``no``.
[all …]
/dports/lang/elixir-devel/elixir-1.13.1/lib/elixir/lib/
H A Dkeyword.ex51 `Keyword.put(opts, new_key, new_value)`, there is no guarantee for
327 (`nil` if no default value is provided).
465 Gets the value under `key` and updates it. Raises if there is no `key`.
889 There are no guarantees about the order of the keys in the returned keyword.
899 iex> Keyword.merge([a: 1], [2, 3])
903 @spec merge(t, t) :: t
904 def merge(keywords1, keywords2) function
936 There are no guarantees about the order of the keys in the returned keyword.
961 @spec merge(t, t, (key, value, value -> value)) :: t
962 def merge(keywords1, keywords2, fun) function
[all …]
/dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/stdlib/test/
H A Dlists_SUITE.erl82 {group, key},
390 {'EXIT',_} = (catch lists:keystore(key, 1, {}, {})),
405 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
406 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
408 false = lists:keytake(key, 2, [{a}]),
409 false = lists:keytake(key, 1, [a]),
423 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
590 no.
802 no.
[all …]
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/stdlib/test/
H A Dlists_SUITE.erl82 {group, key},
390 {'EXIT',_} = (catch lists:keystore(key, 1, {}, {})),
405 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
406 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
407 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
408 false = lists:keytake(key, 2, [{a}]),
409 false = lists:keytake(key, 1, [a]),
423 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
590 no.
802 no.
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/stdlib/test/
H A Dlists_SUITE.erl82 {group, key},
376 {'EXIT',_} = (catch lists:keystore(key, 1, {}, {})),
391 {'EXIT',_} = (catch lists:keytake(key, 0, [])),
392 {'EXIT',_} = (catch lists:keytake(key, 1, {})),
393 {'EXIT',_} = (catch lists:keytake(key, 1, {a,b})),
394 false = lists:keytake(key, 2, [{a}]),
395 false = lists:keytake(key, 1, [a]),
409 [a,{x,y,z}] = lists:keyreplace(a, 5, [a,{x,y,z}], {no,use}),
576 no.
788 no.
[all …]
/dports/lang/elixir-devel/elixir-1.13.1/lib/mix/lib/mix/
H A Dconfig.ex45 config :my_app, :key, "value"
66 Keyword lists are always deep merged.
92 Configures the given `key` for the given `root_key`.
94 Keyword lists are always deep merged.
98 The given `opts` are merged into the existing values for `key`
112 key in the `:ecto` application of:
118 defdelegate config(root_key, key, opts), to: Config
124 matching that wildcard will be imported; if no file matches
125 the wildcard, no errors are raised. If `path_or_wildcard` is
212 lists, it deep merges them.
[all …]
/dports/lang/elixir/elixir-1.12.3/lib/mix/lib/mix/
H A Dconfig.ex45 config :my_app, :key, "value"
65 Keyword lists are always deep merged.
91 Configures the given `key` for the given `root_key`.
93 Keyword lists are always deep merged.
97 The given `opts` are merged into the existing values for `key`
111 key in the `:ecto` application of:
117 defdelegate config(root_key, key, opts), to: Config
123 matching that wildcard will be imported; if no file matches
124 the wildcard, no errors are raised. If `path_or_wildcard` is
211 lists, it deep merges them.
[all …]
/dports/devel/p5-Algorithm-Merge/Algorithm-Merge-0.08/
H A DREADME55 The optional key generation arguments are the same as in
59 Given references to three lists of items, "diff3" performs a three-way
63 right lists differ from the original list. In scalar context, this
68 Given the following three lists,
91 c - conflict (no two are the same)
97 The next three elements are the lists from the original, left, and right
101 merge
102 Given references to three lists of items, "merge" performs a three-way
141 If two arguments, then there is no element in the first sequence
158 If two arguments, then there is no element in the second sequence
[all …]
/dports/net/libyang/libyang-1.0.240/models/
H A Dyang@2017-02-20.yang18 "This is a kind of fake model with no data, typedefs or anything
25 lists and leaf-lists.";
50 leaf-list entry, or during \"merge\" or \"replace\" operations to insert
53 If the value is \"before\" or \"after\", the \"value\"/\"key\" attribute
56 If no \"insert\" attribute is present in the \"create\" operation, it
69 md:annotation key {
/dports/math/curv/curv-0.5/ideas/
H A DRecord.md7 There is no reference count or type code.
25 * Hash table. Fast lookup, expensive merge unless unique.
26 * Radix tree. Faster merge than hash table, otherwise comparable.
29 Records could be implemented as Lisp-style **association lists**.
30 That makes lookup O(N), but merge(R,{a=1}) would have constant time.
35 Skip lists?
40 `merge` is O(N) of the final result.
53 hashed to ensure even key distribution and constant key length. Typical
64 Lookup and merge would both be O(ln N); but with large constants due to
66 A functional implementation with merge is available from Adams:
[all …]
/dports/devel/lua-stdlib/lua-stdlib-release-v41.2.2/specs/
H A Dtree_spec.yaml346 - it generates path key-lists that are valid __index arguments: |
363 expect (tr["no such key"]).to_be (nil)
364 - it returns nil for missing single element key lists:
365 expect (tr[{"no such key"}]).to_be (nil)
366 - it returns nil for missing multi-element key lists:
368 expect (tr[{"no", "such", "key"}]).to_be (nil)
374 - it returns values for single element key lists:
377 - it returns values for multi-element key lists:
388 - it stores values for single element key lists:
391 - it stores values for multi-element key lists:
[all …]
/dports/devel/glib20/glib-2.70.4/
H A DSECURITY.md11 current development release series. Any older stable release series are no
24 their personal GPG key; there is currently not necessarily a formal chain of
35 the GitLab issue tracker, a merge request, or any other public venue.
43 **Do not** provide a merge request to fix the issue, as there is currently no
44 way to make confidential merge requests on gitlab.gnome.org. If you have patches
72 [oss-security@lists.openwall.com](https://www.openwall.com/lists/oss-security/).
/dports/sysutils/ansible/ansible-4.7.0/ansible_collections/cisco/ios/docs/
H A Dcisco.ios.ios_prefix_lists_module.rst86 <div>List of Prefix-lists.</div>
355 # "no ip prefix-list 10",
386 - name: Delete provided Prefix lists config by AFI
396 # "no ip prefix-list test",
397 # "no ip prefix-list 10",
426 - name: Delete all Prefix lists config
434 # "no ip prefix-list test",
435 # "no ip prefix-list 10",
454 - name: Merge provided Prefix lists configuration
483 - name: Merge provided Prefix lists configuration
[all …]
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/plugins/alertingDashboards/node_modules/react-motion/lib/
H A DmergeDiff.js.flow11 // this reduces to merging two partially ordered lists (e.g. lists where not
19 // meaning), which is huge when two lists have many common elements
27 // to loop through and find a key's index each time), but I no longer care
30 prevKeyIndex[prev[i].key] = i;
34 nextKeyIndex[next[i].key] = i;
47 // merge in keys that the user desires to kill
64 return nextKeyIndex[a.key] - nextKeyIndex[b.key];
67 return prevKeyIndex[a.key] - prevKeyIndex[b.key];
69 // key a in next, key b in prev
76 const pivot = next[i].key;
[all …]
/dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/debugger/test/
H A Dmap_SUITE.erl971 BadMap = id([no,map]),
1547 0 = erlang:map_size(maps:merge(#{},#{})),
1568 {'EXIT',{{badmap,BigNum},[{maps,merge,_,_}|_]}} = (catch maps:merge(BigNum, <<>>)),
1569 {'EXIT',{{badmap,<<>>},[{maps,merge,_,_}|_]}} = (catch maps:merge(<<>>, id(#{ a => 1}))),
1570 {'EXIT',{{badmap,<<>>},[{maps,merge,_,_}|_]}} = (catch maps:merge(id(#{ a => 2}), <<>> )),
1946 [3,4] = lists:sort(
1952 [30,50] = lists:sort(
2143 {1,"a"} = map_guard_sequence_var_1(a,#{seq=>1,a=>id("a"),b=>no}),
2144 {2,"b"} = map_guard_sequence_var_1(b,#{seq=>2,b=>id("b"),a=>no}),
2145 {3,"c"} = map_guard_sequence_var_1(a,#{seq=>3,a=>id("c"),b=>no}),
[all …]
/dports/lang/erlang-runtime21/otp-OTP-21.3.8.24/lib/debugger/test/
H A Dmap_SUITE.erl971 BadMap = id([no,map]),
1547 0 = erlang:map_size(maps:merge(#{},#{})),
1568 {'EXIT',{{badmap,BigNum},[{maps,merge,_,_}|_]}} = (catch maps:merge(BigNum, <<>>)),
1569 {'EXIT',{{badmap,<<>>},[{maps,merge,_,_}|_]}} = (catch maps:merge(<<>>, id(#{ a => 1}))),
1570 {'EXIT',{{badmap,<<>>},[{maps,merge,_,_}|_]}} = (catch maps:merge(id(#{ a => 2}), <<>> )),
1946 [3,4] = lists:sort(
1952 [30,50] = lists:sort(
2143 {1,"a"} = map_guard_sequence_var_1(a,#{seq=>1,a=>id("a"),b=>no}),
2144 {2,"b"} = map_guard_sequence_var_1(b,#{seq=>2,b=>id("b"),a=>no}),
2145 {3,"c"} = map_guard_sequence_var_1(a,#{seq=>3,a=>id("c"),b=>no}),
[all …]

12345678910>>...444