Initial commit
This commit is contained in:
3
.gitignore
vendored
Normal file
3
.gitignore
vendored
Normal file
@@ -0,0 +1,3 @@
|
||||
/target
|
||||
*.rdb
|
||||
/Cargo.lock
|
||||
1495
Cargo.lock
generated
Normal file
1495
Cargo.lock
generated
Normal file
File diff suppressed because it is too large
Load Diff
198
Cargo.toml
Normal file
198
Cargo.toml
Normal file
@@ -0,0 +1,198 @@
|
||||
[package]
|
||||
name = "aws"
|
||||
version.workspace = true
|
||||
edition.workspace = true
|
||||
rust-version.workspace = true
|
||||
|
||||
authors.workspace = true
|
||||
description.workspace = true
|
||||
license.workspace = true
|
||||
repository.workspace = true
|
||||
keywords.workspace = true
|
||||
categories.workspace = true
|
||||
readme.workspace = true
|
||||
|
||||
[workspace.package]
|
||||
version = "0.1.0"
|
||||
edition = "2021"
|
||||
rust-version = "1.81"
|
||||
|
||||
authors = ["Hannes Körber <hannes@hkoerber>"]
|
||||
description = "Helper functions and types for AWS operations"
|
||||
license = "GPL-3.0-only"
|
||||
repository = "https://github.com/hakoerber/aws-rs"
|
||||
keywords = ["aws"]
|
||||
categories = ["api-bindings"]
|
||||
readme = "README.md"
|
||||
|
||||
[dependencies]
|
||||
aws-macros = { path = "./aws_macros" }
|
||||
aws-config = { version = "1.*", default-features = false }
|
||||
aws-sdk-ec2 = { version = "1.*", default-features = false, features = [
|
||||
"rustls",
|
||||
"rt-tokio",
|
||||
] }
|
||||
aws-sdk-cloudfront = { version = "1.*", default-features = false, features = [
|
||||
"rustls",
|
||||
"rt-tokio",
|
||||
] }
|
||||
aws-sdk-efs = { version = "1.*", default-features = false, features = [
|
||||
"rustls",
|
||||
"rt-tokio",
|
||||
] }
|
||||
aws-sdk-route53 = { version = "1.*", default-features = false, features = [
|
||||
"rustls",
|
||||
"rt-tokio",
|
||||
] }
|
||||
aws-sdk-cloudformation = { version = "1.*", default-features = false, features = [
|
||||
"rustls",
|
||||
"rt-tokio",
|
||||
] }
|
||||
chrono = { version = "0.4.*", default-features = false, features = [
|
||||
"std",
|
||||
"now",
|
||||
"serde",
|
||||
] }
|
||||
serde = { version = "1.*", default-features = false, features = [
|
||||
"std",
|
||||
"derive",
|
||||
] }
|
||||
serde_json = { version = "1.*", default-features = false, features = ["std"] }
|
||||
|
||||
[workspace]
|
||||
resolver = "2"
|
||||
members = ["aws_macros"]
|
||||
|
||||
[lints]
|
||||
workspace = true
|
||||
|
||||
[profile.release]
|
||||
opt-level = 3
|
||||
debug = false
|
||||
strip = "symbols"
|
||||
debug-assertions = false
|
||||
overflow-checks = false
|
||||
lto = "fat"
|
||||
panic = "abort"
|
||||
codegen-units = 1
|
||||
rpath = false
|
||||
|
||||
[workspace.lints.rust]
|
||||
absolute_paths_not_starting_with_crate = "deny"
|
||||
elided_lifetimes_in_paths = "deny"
|
||||
explicit_outlives_requirements = "deny"
|
||||
keyword_idents = "deny"
|
||||
let_underscore_drop = "deny"
|
||||
non_ascii_idents = "deny"
|
||||
non_local_definitions = "deny"
|
||||
single_use_lifetimes = "deny"
|
||||
unit_bindings = "deny"
|
||||
unreachable_pub = "deny"
|
||||
unsafe_code = { level = "forbid", priority = -1 }
|
||||
unsafe_op_in_unsafe_fn = "deny"
|
||||
unstable_features = { level = "forbid", priority = -1 }
|
||||
unused_crate_dependencies = "deny"
|
||||
unused_import_braces = "deny"
|
||||
unused_lifetimes = "deny"
|
||||
unused_macro_rules = "deny"
|
||||
unused_qualifications = "deny"
|
||||
unused_results = "deny"
|
||||
variant_size_differences = "deny"
|
||||
|
||||
[workspace.lints.clippy]
|
||||
missing_errors_doc = "allow"
|
||||
redundant_pub_crate = "allow"
|
||||
must_use_candidate = "allow"
|
||||
missing_const_for_fn = "warn"
|
||||
too_many_lines = "allow"
|
||||
too_many_arguments = "allow"
|
||||
option_if_let_else = "allow"
|
||||
match_bool = "allow"
|
||||
new_without_default = "allow"
|
||||
missing_panics_doc = "warn"
|
||||
multiple_crate_versions = "allow"
|
||||
|
||||
pedantic = { level = "deny", priority = -1 }
|
||||
nursery = { level = "deny", priority = -1 }
|
||||
cargo = { level = "deny", priority = -1 }
|
||||
|
||||
# restrictions
|
||||
renamed_function_params = "deny"
|
||||
allow_attributes = "deny"
|
||||
allow_attributes_without_reason = "deny"
|
||||
dbg_macro = "deny"
|
||||
arithmetic_side_effects = "deny"
|
||||
as_conversions = "deny"
|
||||
assertions_on_result_states = "deny"
|
||||
clone_on_ref_ptr = "deny"
|
||||
create_dir = "deny"
|
||||
decimal_literal_representation = "deny"
|
||||
default_numeric_fallback = "deny"
|
||||
deref_by_slicing = "deny"
|
||||
disallowed_script_idents = "deny"
|
||||
else_if_without_else = "deny"
|
||||
empty_drop = "deny"
|
||||
empty_enum_variants_with_brackets = "deny"
|
||||
empty_structs_with_brackets = "deny"
|
||||
exit = "deny"
|
||||
expect_used = "allow"
|
||||
filetype_is_file = "deny"
|
||||
float_arithmetic = "deny"
|
||||
float_cmp_const = "deny"
|
||||
fn_to_numeric_cast_any = "deny"
|
||||
format_push_string = "deny"
|
||||
get_unwrap = "deny"
|
||||
if_then_some_else_none = "deny"
|
||||
impl_trait_in_params = "allow"
|
||||
indexing_slicing = "deny"
|
||||
infinite_loop = "deny"
|
||||
inline_asm_x86_att_syntax = "deny"
|
||||
inline_asm_x86_intel_syntax = "deny"
|
||||
integer_division = "deny"
|
||||
iter_over_hash_type = "deny"
|
||||
large_include_file = "deny"
|
||||
let_underscore_must_use = "deny"
|
||||
let_underscore_untyped = "deny"
|
||||
little_endian_bytes = "deny"
|
||||
lossy_float_literal = "deny"
|
||||
map_err_ignore = "deny"
|
||||
mem_forget = "deny"
|
||||
missing_assert_message = "deny"
|
||||
missing_asserts_for_indexing = "deny"
|
||||
mixed_read_write_in_expression = "deny"
|
||||
mod_module_files = "allow"
|
||||
modulo_arithmetic = "deny"
|
||||
multiple_inherent_impl = "deny"
|
||||
multiple_unsafe_ops_per_block = "deny"
|
||||
mutex_atomic = "deny"
|
||||
panic = "deny"
|
||||
panic_in_result_fn = "deny"
|
||||
partial_pub_fields = "deny"
|
||||
pattern_type_mismatch = "deny"
|
||||
pub_without_shorthand = "deny"
|
||||
rc_buffer = "deny"
|
||||
rc_mutex = "deny"
|
||||
redundant_type_annotations = "deny"
|
||||
rest_pat_in_fully_bound_structs = "deny"
|
||||
same_name_method = "deny"
|
||||
self_named_module_files = "deny"
|
||||
semicolon_outside_block = "deny"
|
||||
single_char_lifetime_names = "allow"
|
||||
str_to_string = "deny"
|
||||
string_add = "deny"
|
||||
string_lit_chars_any = "deny"
|
||||
string_slice = "deny"
|
||||
string_to_string = "deny"
|
||||
suspicious_xor_used_as_pow = "deny"
|
||||
tests_outside_test_module = "deny"
|
||||
try_err = "deny"
|
||||
undocumented_unsafe_blocks = "deny"
|
||||
unimplemented = "deny"
|
||||
unnecessary_safety_comment = "deny"
|
||||
unnecessary_safety_doc = "deny"
|
||||
unnecessary_self_imports = "deny"
|
||||
unneeded_field_pattern = "deny"
|
||||
unseparated_literal_suffix = "deny"
|
||||
unwrap_used = "deny"
|
||||
use_debug = "deny"
|
||||
verbose_file_reads = "deny"
|
||||
674
LICENSE
Normal file
674
LICENSE
Normal file
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU General Public License is a free, copyleft license for
|
||||
software and other kinds of works.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
the GNU General Public License is intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users. We, the Free Software Foundation, use the
|
||||
GNU General Public License for most of our software; it applies also to
|
||||
any other work released this way by its authors. You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to prevent others from denying you
|
||||
these rights or asking you to surrender the rights. Therefore, you have
|
||||
certain responsibilities if you distribute copies of the software, or if
|
||||
you modify it: responsibilities to respect the freedom of others.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must pass on to the recipients the same
|
||||
freedoms that you received. You must make sure that they, too, receive
|
||||
or can get the source code. And you must show them these terms so they
|
||||
know their rights.
|
||||
|
||||
Developers that use the GNU GPL protect your rights with two steps:
|
||||
(1) assert copyright on the software, and (2) offer you this License
|
||||
giving you legal permission to copy, distribute and/or modify it.
|
||||
|
||||
For the developers' and authors' protection, the GPL clearly explains
|
||||
that there is no warranty for this free software. For both users' and
|
||||
authors' sake, the GPL requires that modified versions be marked as
|
||||
changed, so that their problems will not be attributed erroneously to
|
||||
authors of previous versions.
|
||||
|
||||
Some devices are designed to deny users access to install or run
|
||||
modified versions of the software inside them, although the manufacturer
|
||||
can do so. This is fundamentally incompatible with the aim of
|
||||
protecting users' freedom to change the software. The systematic
|
||||
pattern of such abuse occurs in the area of products for individuals to
|
||||
use, which is precisely where it is most unacceptable. Therefore, we
|
||||
have designed this version of the GPL to prohibit the practice for those
|
||||
products. If such problems arise substantially in other domains, we
|
||||
stand ready to extend this provision to those domains in future versions
|
||||
of the GPL, as needed to protect the freedom of users.
|
||||
|
||||
Finally, every program is threatened constantly by software patents.
|
||||
States should not allow patents to restrict development and use of
|
||||
software on general-purpose computers, but in those that do, we wish to
|
||||
avoid the special danger that patents applied to a free program could
|
||||
make it effectively proprietary. To prevent this, the GPL assures that
|
||||
patents cannot be used to render the program non-free.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Use with the GNU Affero General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU Affero General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the special requirements of the GNU Affero General Public License,
|
||||
section 13, concerning interaction through a network will apply to the
|
||||
combination as such.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program does terminal interaction, make it output a short
|
||||
notice like this when it starts in an interactive mode:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, your program's commands
|
||||
might be different; for a GUI interface, you would use an "about box".
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU GPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
||||
|
||||
The GNU General Public License does not permit incorporating your program
|
||||
into proprietary programs. If your program is a subroutine library, you
|
||||
may consider it more useful to permit linking proprietary applications with
|
||||
the library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License. But first, please read
|
||||
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
||||
21
Makefile
Normal file
21
Makefile
Normal file
@@ -0,0 +1,21 @@
|
||||
.PHONY: docs
|
||||
docs:
|
||||
cargo watch -- cargo doc
|
||||
|
||||
.PHONY: test
|
||||
test:
|
||||
@cargo test --workspace --color=always
|
||||
|
||||
.PHONY: lint
|
||||
lint:
|
||||
@cargo clippy --workspace --tests --color=always
|
||||
|
||||
.PHONY: fmt
|
||||
fmt:
|
||||
cargo fmt
|
||||
find -name '*.md' | xargs prettier --print-width 80 --prose-wrap always --write
|
||||
find -name '*.toml' | xargs taplo format
|
||||
|
||||
.PHONY: build-static
|
||||
build-static:
|
||||
cargo build --target x86_64-unknown-linux-musl --no-default-features --release --workspace
|
||||
35
aws_macros/Cargo.toml
Normal file
35
aws_macros/Cargo.toml
Normal file
@@ -0,0 +1,35 @@
|
||||
[package]
|
||||
name = "aws-macros"
|
||||
version.workspace = true
|
||||
edition.workspace = true
|
||||
rust-version.workspace = true
|
||||
|
||||
authors.workspace = true
|
||||
description.workspace = true
|
||||
license.workspace = true
|
||||
repository.workspace = true
|
||||
keywords.workspace = true
|
||||
categories.workspace = true
|
||||
readme.workspace = true
|
||||
|
||||
[lib]
|
||||
name = "aws_macros"
|
||||
path = "src/lib.rs"
|
||||
proc-macro = true
|
||||
|
||||
[dependencies]
|
||||
proc-macro2 = { version = "1.*", default-features = false, features = [
|
||||
"proc-macro",
|
||||
] }
|
||||
quote = { version = "1.*", default-features = false }
|
||||
syn = { version = "2.*", default-features = false, features = [
|
||||
"full",
|
||||
"extra-traits",
|
||||
"proc-macro",
|
||||
"parsing",
|
||||
"printing",
|
||||
"clone-impls",
|
||||
] }
|
||||
|
||||
[lints]
|
||||
workspace = true
|
||||
22
aws_macros/src/lib.rs
Normal file
22
aws_macros/src/lib.rs
Normal file
@@ -0,0 +1,22 @@
|
||||
#![expect(
|
||||
clippy::expect_used,
|
||||
clippy::panic,
|
||||
reason = "panics and expects are fine for proc macros"
|
||||
)]
|
||||
|
||||
use proc_macro::TokenStream;
|
||||
|
||||
mod tag;
|
||||
mod tags;
|
||||
|
||||
#[proc_macro_attribute]
|
||||
#[expect(non_snake_case, reason = "attribute proc macros should be capitalized")]
|
||||
pub fn Tags(attr: TokenStream, item: TokenStream) -> TokenStream {
|
||||
tags::transform(attr, item)
|
||||
}
|
||||
|
||||
#[proc_macro_attribute]
|
||||
#[expect(non_snake_case, reason = "attribute proc macros should be capitalized")]
|
||||
pub fn Tag(attr: TokenStream, item: TokenStream) -> TokenStream {
|
||||
tag::transform(attr, item)
|
||||
}
|
||||
79
aws_macros/src/tag.rs
Normal file
79
aws_macros/src/tag.rs
Normal file
@@ -0,0 +1,79 @@
|
||||
use proc_macro::TokenStream;
|
||||
use quote::quote;
|
||||
|
||||
#[derive(Debug)]
|
||||
enum Translator {
|
||||
Serde,
|
||||
Manual,
|
||||
}
|
||||
|
||||
pub(crate) fn transform(attr: TokenStream, item: TokenStream) -> TokenStream {
|
||||
let root = quote! {::aws};
|
||||
|
||||
let expr: syn::Expr = syn::parse(attr).expect("expected expr in macro attribute");
|
||||
|
||||
let syn::Expr::Assign(assign) = expr else {
|
||||
panic!("invalid expression in macro attribute")
|
||||
};
|
||||
|
||||
match *assign.left {
|
||||
syn::Expr::Path(ref exprpath) => {
|
||||
let segments = &exprpath.path.segments;
|
||||
let (Some(segment), 1) = (segments.first(), segments.len()) else {
|
||||
panic!("invalid attribute key")
|
||||
};
|
||||
|
||||
assert!(segment.ident == "translate", "invalid attribute key");
|
||||
}
|
||||
_ => panic!("invalid expression in tag field attribute, left side"),
|
||||
}
|
||||
|
||||
let translator = match *assign.right {
|
||||
syn::Expr::Path(ref exprpath) => {
|
||||
let segments = &exprpath.path.segments;
|
||||
let (Some(segment), 1) = (segments.first(), segments.len()) else {
|
||||
panic!("invalid attribute key")
|
||||
};
|
||||
|
||||
match segment.ident.to_string().as_str() {
|
||||
"serde" => Translator::Serde,
|
||||
"manual" => Translator::Manual,
|
||||
t => panic!("invalid translator {t}"),
|
||||
}
|
||||
}
|
||||
_ => panic!("invalid expression in tag field attribute, left side"),
|
||||
};
|
||||
|
||||
let elem = syn::parse_macro_input!(item as syn::Item);
|
||||
|
||||
let name = match elem {
|
||||
syn::Item::Struct(ref s) => &s.ident,
|
||||
syn::Item::Enum(ref e) => &e.ident,
|
||||
_ => panic!("only applicable to structs/enums"),
|
||||
};
|
||||
|
||||
let translator = match translator {
|
||||
Translator::Serde => quote! {
|
||||
impl #root::tags::TranslatableSerde for #name {}
|
||||
|
||||
impl #root::tags::TagValue<#name> for #name {
|
||||
type Error = #root::tags::ParseTagValueError;
|
||||
type Translator = #root::tags::TranslateSerde;
|
||||
}
|
||||
},
|
||||
Translator::Manual => quote! {
|
||||
impl #root::tags::TranslatableManual for #name {}
|
||||
|
||||
impl #root::tags::TagValue<#name> for #name {
|
||||
type Error = #root::tags::ParseTagValueError;
|
||||
type Translator = #root::tags::TranslateManual;
|
||||
}
|
||||
},
|
||||
};
|
||||
|
||||
quote! {
|
||||
#elem
|
||||
#translator
|
||||
}
|
||||
.into()
|
||||
}
|
||||
369
aws_macros/src/tags.rs
Normal file
369
aws_macros/src/tags.rs
Normal file
@@ -0,0 +1,369 @@
|
||||
use proc_macro::TokenStream;
|
||||
use quote::quote;
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Input {
|
||||
ident: syn::Ident,
|
||||
vis: syn::Visibility,
|
||||
elements: Vec<Element>,
|
||||
}
|
||||
|
||||
#[derive(Debug)]
|
||||
enum ElementKind {
|
||||
Required,
|
||||
Optional,
|
||||
}
|
||||
|
||||
#[derive(Debug)]
|
||||
struct Element {
|
||||
ident: syn::Ident,
|
||||
vis: syn::Visibility,
|
||||
ty: syn::Path,
|
||||
kind: ElementKind,
|
||||
name: String,
|
||||
}
|
||||
|
||||
fn parse_type(input: syn::Type) -> (syn::Path, ElementKind) {
|
||||
match input {
|
||||
syn::Type::Path(ty) => {
|
||||
let segments = ty.path.segments.clone();
|
||||
let first = segments.first().expect("segments is empty");
|
||||
|
||||
let (ident, optional) = match first.ident.to_string().as_str() {
|
||||
"Option" => match first.arguments {
|
||||
// It may not be required to parse this, we could just
|
||||
// extract the inner type and let the compiler beat the
|
||||
// caller up if there is some bullshit happening.
|
||||
syn::PathArguments::AngleBracketed(ref genargs) => {
|
||||
let mut args = genargs.args.clone();
|
||||
match genargs.args.len() {
|
||||
1 => {
|
||||
let ty = args.pop().expect("genargs are empty");
|
||||
let ty = match ty {
|
||||
syn::punctuated::Pair::Punctuated(node, _punct) => node,
|
||||
syn::punctuated::Pair::End(node) => node,
|
||||
};
|
||||
match ty {
|
||||
syn::GenericArgument::Type(ty) => match ty {
|
||||
syn::Type::Path(ty) => (ty, ElementKind::Optional),
|
||||
_ => panic!("invalid generic type for Option"),
|
||||
},
|
||||
|
||||
_ => panic!("need simple owned Option generic"),
|
||||
}
|
||||
}
|
||||
_ => panic!("wrong number of Option generic arguments"),
|
||||
}
|
||||
}
|
||||
_ => panic!("invalid Option usage"),
|
||||
},
|
||||
_ => (ty, ElementKind::Required),
|
||||
};
|
||||
|
||||
(ident.path, optional)
|
||||
}
|
||||
_ => panic!("invalid field type"),
|
||||
}
|
||||
}
|
||||
|
||||
fn parse_field_attrs(attrs: &[syn::Attribute]) -> Option<String> {
|
||||
match (attrs.first(), attrs.len()) {
|
||||
(Some(attr), 1) => {
|
||||
assert!(
|
||||
attr.style == syn::AttrStyle::Outer,
|
||||
"field attribute style needs to be an outer attribute"
|
||||
);
|
||||
match attr.meta {
|
||||
syn::Meta::List(ref meta_list) => {
|
||||
let tag = &meta_list.path;
|
||||
let tag_name = match (tag.segments.first(), tag.segments.len()) {
|
||||
(Some(segment), 1) => segment.ident.to_string(),
|
||||
(_, 0) => return None,
|
||||
_ => panic!("invalid field attribute path"),
|
||||
};
|
||||
assert!(tag_name == "tag", "invalid field attribute path {tag_name}");
|
||||
|
||||
let expr: syn::Expr = match meta_list.parse_args() {
|
||||
Ok(expr) => expr,
|
||||
Err(e) => panic!("failed parsing tag field attribute: {e}"),
|
||||
};
|
||||
|
||||
let syn::Expr::Assign(assign) = expr else {
|
||||
panic!("invalid expression in tag field attribute")
|
||||
};
|
||||
|
||||
match *assign.left {
|
||||
syn::Expr::Path(ref exprpath) => {
|
||||
let segments = &exprpath.path.segments;
|
||||
let (Some(segment), 1) = (segments.first(), segments.len()) else {
|
||||
panic!("invalid tag field attribute key")
|
||||
};
|
||||
|
||||
assert!(segment.ident == "key", "invalid tag field attribute key");
|
||||
}
|
||||
_ => panic!("invalid expression in tag field attribute, left side"),
|
||||
}
|
||||
|
||||
match *assign.right {
|
||||
syn::Expr::Lit(ref expr_lit) => match expr_lit.lit {
|
||||
syn::Lit::Str(ref lit_str) => Some(lit_str.value()),
|
||||
_ => panic!("right side of tag field not a string literal"),
|
||||
},
|
||||
_ => panic!("right side of tag field attribute not a literal"),
|
||||
}
|
||||
}
|
||||
_ => panic!("invalid field attribute"),
|
||||
}
|
||||
}
|
||||
(_, 0) => None,
|
||||
_ => panic!("invalid field attributes"),
|
||||
}
|
||||
}
|
||||
|
||||
fn parse_fields(input: impl IntoIterator<Item = syn::Field>) -> Vec<Element> {
|
||||
let mut elements = Vec::new();
|
||||
for field in input {
|
||||
let ident = field.ident.expect("tuple structs not supported");
|
||||
let vis = field.vis;
|
||||
let (ty, kind) = parse_type(field.ty);
|
||||
|
||||
let name = parse_field_attrs(&field.attrs);
|
||||
|
||||
elements.push(Element {
|
||||
ident: ident.clone(),
|
||||
vis,
|
||||
ty,
|
||||
kind,
|
||||
name: name.unwrap_or_else(|| ident.to_string()),
|
||||
});
|
||||
}
|
||||
elements
|
||||
}
|
||||
|
||||
fn parse_struct(input: syn::ItemStruct) -> Input {
|
||||
Input {
|
||||
ident: input.ident,
|
||||
vis: input.vis,
|
||||
elements: match input.fields {
|
||||
syn::Fields::Named(fields) => parse_fields(fields.named),
|
||||
_ => panic!("invalid fields"),
|
||||
},
|
||||
}
|
||||
}
|
||||
|
||||
fn build_output(input: Input) -> TokenStream {
|
||||
let root = quote! { ::aws };
|
||||
|
||||
let ident = input.ident;
|
||||
let vis = input.vis;
|
||||
|
||||
let type_definition = {
|
||||
let elements: Vec<proc_macro2::TokenStream> = input
|
||||
.elements
|
||||
.iter()
|
||||
.map(|element| {
|
||||
let ident = &element.ident;
|
||||
let vis = &element.vis;
|
||||
let ty = &element.ty;
|
||||
match element.kind {
|
||||
ElementKind::Required => {
|
||||
quote!(
|
||||
#vis #ident: #ty
|
||||
)
|
||||
}
|
||||
ElementKind::Optional => {
|
||||
quote!(
|
||||
#vis #ident: ::std::option::Option<#ty>
|
||||
)
|
||||
}
|
||||
}
|
||||
})
|
||||
.collect();
|
||||
|
||||
quote! {
|
||||
#vis struct #ident {
|
||||
#(#elements),*
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
let impls = {
|
||||
let params = input.elements.iter().map(|element| {
|
||||
let ident = &element.ident;
|
||||
let ty = &element.ty;
|
||||
match element.kind {
|
||||
ElementKind::Required => quote!(#ident: #ty),
|
||||
ElementKind::Optional => quote!(#ident: ::std::option::Option<#ty>),
|
||||
}
|
||||
});
|
||||
|
||||
let from_fields: Vec<proc_macro2::TokenStream> = input
|
||||
.elements
|
||||
.iter()
|
||||
.map(|element| {
|
||||
let ident = &element.ident;
|
||||
quote! {#ident: #ident}
|
||||
})
|
||||
.collect();
|
||||
|
||||
let from_tags_fields: Vec<proc_macro2::TokenStream>= input.elements.iter().map(|element| {
|
||||
let ident = &element.ident;
|
||||
let ty = &element.ty;
|
||||
let tag_name = &element.name;
|
||||
|
||||
let try_convert = quote!{
|
||||
let value: ::std::result::Result<#ty, #root::tags::ParseTagsError> = <#ty as #root::tags::TagValue<#ty>>::from_raw_tag(value)
|
||||
.map_err(
|
||||
|e| #root::tags::ParseTagsError::ParseTag(#root::tags::ParseTagError::InvalidTagValue {
|
||||
key,
|
||||
inner: <<#ty as #root::tags::TagValue<#ty>>::Error as Into<#root::tags::ParseTagValueError>>::into(e),
|
||||
}
|
||||
)
|
||||
);
|
||||
|
||||
let value = match value {
|
||||
::std::result::Result::Ok(v) => v,
|
||||
::std::result::Result::Err(e) => {
|
||||
return Err(e);
|
||||
}
|
||||
};
|
||||
|
||||
value
|
||||
};
|
||||
|
||||
let transformer = match element.kind {
|
||||
ElementKind::Required => {
|
||||
quote! {
|
||||
let value: #root::tags::RawTagValue = value.ok_or_else(|| #root::tags::ParseTagsError::TagNotFound {
|
||||
key: key.clone()
|
||||
})?
|
||||
.clone();
|
||||
|
||||
let value = {
|
||||
#try_convert
|
||||
};
|
||||
|
||||
value
|
||||
|
||||
}
|
||||
}
|
||||
ElementKind::Optional => {
|
||||
quote! {
|
||||
let value: ::std::option::Option<#ty> = value.map(|value: #root::tags::RawTagValue| {
|
||||
let value = {
|
||||
#try_convert
|
||||
};
|
||||
Ok(value)
|
||||
}).transpose()?;
|
||||
value
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
quote! {
|
||||
#ident: {
|
||||
let key: #root::tags::TagKey = #root::tags::TagKey::new(#tag_name.to_owned());
|
||||
|
||||
let value: ::std::option::Option<#root::tags::RawTagValue> = tags
|
||||
.as_slice()
|
||||
.iter()
|
||||
.find(|tag| tag.key() == #tag_name)
|
||||
.map(|tag| tag.value()).cloned();
|
||||
|
||||
let value = {
|
||||
#transformer
|
||||
};
|
||||
|
||||
value
|
||||
}
|
||||
}
|
||||
}).collect();
|
||||
|
||||
let fields_to_tags: Vec<proc_macro2::TokenStream> = input
|
||||
.elements
|
||||
.iter()
|
||||
.map(|element| {
|
||||
let ident = &element.ident;
|
||||
let ty= &element.ty;
|
||||
let tag_name = &element.name;
|
||||
match element.kind {
|
||||
ElementKind::Required => {
|
||||
quote! {
|
||||
{
|
||||
let key = #root::tags::TagKey::new(#tag_name.to_owned());
|
||||
let value: #root::tags::RawTagValue = <#ty as #root::tags::TagValue<#ty>>::into_raw_tag(self.#ident);
|
||||
v.push(#root::tags::RawTag::new(key, value));
|
||||
}
|
||||
}
|
||||
}
|
||||
ElementKind::Optional => {
|
||||
quote! {
|
||||
{
|
||||
match self.#ident {
|
||||
::std::option::Option::Some(value) => {
|
||||
let key = #root::tags::TagKey::new(#tag_name.to_owned());
|
||||
let value: #root::tags::RawTagValue = <#ty as #root::tags::TagValue<#ty>>::into_raw_tag(value);
|
||||
v.push(#root::tags::RawTag::new(key, value));
|
||||
},
|
||||
::std::option::Option::None => {
|
||||
// do not serialize none values
|
||||
},
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
})
|
||||
.collect();
|
||||
|
||||
quote! {
|
||||
impl #ident {
|
||||
#vis fn from_values(#(#params),*) -> Self {
|
||||
Self {
|
||||
#(#from_fields),*
|
||||
}
|
||||
}
|
||||
|
||||
#vis fn from_tags(tags: #root::tags::TagList) -> Result<Self, #root::tags::ParseTagsError> {
|
||||
Ok(Self {
|
||||
#(#from_tags_fields),*
|
||||
})
|
||||
}
|
||||
|
||||
#vis fn into_tags(self) -> #root::tags::TagList {
|
||||
let mut v = ::std::vec::Vec::new();
|
||||
{
|
||||
#(#fields_to_tags);*;
|
||||
}
|
||||
#root::tags::TagList::from_vec(v)
|
||||
}
|
||||
}
|
||||
}
|
||||
};
|
||||
|
||||
quote! {
|
||||
#type_definition
|
||||
#impls
|
||||
}
|
||||
.into()
|
||||
}
|
||||
|
||||
#[expect(
|
||||
clippy::needless_pass_by_value,
|
||||
reason = "this is the usual signature for proc macros, and the inner function should have the same signature"
|
||||
)]
|
||||
pub(crate) fn transform(attr: TokenStream, item: TokenStream) -> TokenStream {
|
||||
assert!(
|
||||
attr.is_empty(),
|
||||
"cannot take any attribute macro attributes"
|
||||
);
|
||||
|
||||
let input = syn::parse_macro_input!(item as syn::Item);
|
||||
|
||||
let input = match input {
|
||||
syn::Item::Struct(s) => parse_struct(s),
|
||||
_ => panic!("only applicable to structs"),
|
||||
};
|
||||
|
||||
build_output(input)
|
||||
}
|
||||
1
clippy.toml
Normal file
1
clippy.toml
Normal file
@@ -0,0 +1 @@
|
||||
allow-unwrap-in-tests = true
|
||||
110
src/error.rs
Normal file
110
src/error.rs
Normal file
@@ -0,0 +1,110 @@
|
||||
use std::{fmt, net, time::Duration};
|
||||
|
||||
use crate::tags::{ParseTagError, ParseTagsError};
|
||||
|
||||
#[derive(Debug)]
|
||||
pub enum Error {
|
||||
UnexpectedNoneValue {
|
||||
entity: String,
|
||||
},
|
||||
SdkError(Box<dyn std::error::Error + Send>),
|
||||
InvalidResponseError {
|
||||
message: String,
|
||||
},
|
||||
MultipleMatches {
|
||||
entity: String,
|
||||
},
|
||||
InvalidTag(ParseTagError),
|
||||
InvalidTags(ParseTagsError),
|
||||
RunInstancesEmptyResponse,
|
||||
InstanceStopExceededMaxWait {
|
||||
max_wait: Duration,
|
||||
instance: super::InstanceId,
|
||||
},
|
||||
WaitError(Box<dyn std::error::Error + Send>),
|
||||
RunInstanceNoCapacity,
|
||||
InvalidTimestampError {
|
||||
value: String,
|
||||
message: String,
|
||||
},
|
||||
}
|
||||
|
||||
impl fmt::Display for Error {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match *self {
|
||||
Self::InvalidTag(ref inner) => {
|
||||
write!(f, "{inner}")
|
||||
}
|
||||
Self::InvalidTags(ref inner) => {
|
||||
write!(f, "{inner}")
|
||||
}
|
||||
Self::UnexpectedNoneValue { ref entity } => {
|
||||
write!(f, "entity \"{entity}\" was empty")
|
||||
}
|
||||
Self::SdkError(ref e) => write!(f, "sdk error: {e}"),
|
||||
Self::InvalidResponseError { ref message } => {
|
||||
write!(f, "invalid api response: {message}")
|
||||
}
|
||||
Self::MultipleMatches { ref entity } => {
|
||||
write!(f, "multiple matches for {entity} found")
|
||||
}
|
||||
Self::RunInstancesEmptyResponse => {
|
||||
write!(f, "empty instance response of RunInstances")
|
||||
}
|
||||
Self::InstanceStopExceededMaxWait {
|
||||
ref max_wait,
|
||||
ref instance,
|
||||
} => {
|
||||
write!(
|
||||
f,
|
||||
"instance {instance} did not wait in {} seconds",
|
||||
max_wait.as_secs()
|
||||
)
|
||||
}
|
||||
Self::WaitError(ref e) => write!(f, "waiter error: {e}"),
|
||||
Self::RunInstanceNoCapacity => {
|
||||
write!(f, "no capacity for rnu instance operation")
|
||||
}
|
||||
Self::InvalidTimestampError {
|
||||
ref value,
|
||||
ref message,
|
||||
} => {
|
||||
write!(f, "failed parsing \"{value}\" as timestamp: {message}")
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl std::error::Error for Error {}
|
||||
|
||||
impl<T: std::error::Error + Send + 'static> From<aws_sdk_ec2::error::SdkError<T>> for Error {
|
||||
fn from(value: aws_sdk_ec2::error::SdkError<T>) -> Self {
|
||||
Self::SdkError(Box::new(value))
|
||||
}
|
||||
}
|
||||
|
||||
impl From<aws_sdk_ec2::waiters::instance_stopped::WaitUntilInstanceStoppedError> for Error {
|
||||
fn from(value: aws_sdk_ec2::waiters::instance_stopped::WaitUntilInstanceStoppedError) -> Self {
|
||||
Self::WaitError(Box::new(value))
|
||||
}
|
||||
}
|
||||
|
||||
impl From<net::AddrParseError> for Error {
|
||||
fn from(value: net::AddrParseError) -> Self {
|
||||
Self::InvalidResponseError {
|
||||
message: value.to_string(),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<ParseTagError> for Error {
|
||||
fn from(value: ParseTagError) -> Self {
|
||||
Self::InvalidTag(value)
|
||||
}
|
||||
}
|
||||
|
||||
impl From<ParseTagsError> for Error {
|
||||
fn from(value: ParseTagsError) -> Self {
|
||||
Self::InvalidTags(value)
|
||||
}
|
||||
}
|
||||
9
src/export.rs
Normal file
9
src/export.rs
Normal file
@@ -0,0 +1,9 @@
|
||||
//! Re-exports selected elements of the EC2 SDK
|
||||
|
||||
pub mod ec2 {
|
||||
#![expect(clippy::module_name_repetitions, reason = "error prefix is necessary")]
|
||||
pub mod error {
|
||||
pub use aws_sdk_ec2::error::SdkError;
|
||||
}
|
||||
pub use aws_sdk_ec2::types::{Filter, InstanceStateName, InstanceType, Tag};
|
||||
}
|
||||
1046
src/lib.rs
Normal file
1046
src/lib.rs
Normal file
File diff suppressed because it is too large
Load Diff
72
src/tags/README.md
Normal file
72
src/tags/README.md
Normal file
@@ -0,0 +1,72 @@
|
||||
Type-safe operations on AWS tags.
|
||||
|
||||
# Overview
|
||||
|
||||
This basic data structure of this module is the [`TagList`] struct. It contains
|
||||
a list of untyped AWS tags. It implements `TryFrom` and `Into` for the relevant
|
||||
`Tag` types in the `aws_sdk_*` crates. In itself, that is not too interesting,
|
||||
as the tag values are still just `String`.
|
||||
|
||||
To get typed tags, there is a [`macro@Tags`] macro. Applied to a struct, it adds
|
||||
methods to create a struct instance for an instance [`TagList`], and turn a
|
||||
struct instance back into a [`TagList`]:
|
||||
|
||||
```rust
|
||||
use aws::tags::{Tags, TagList, RawTag};
|
||||
|
||||
#[Tags]
|
||||
struct MyTags {
|
||||
tag1: String,
|
||||
tag2: bool,
|
||||
tag3: Option<bool>,
|
||||
}
|
||||
|
||||
let tags = TagList::from_vec(vec![
|
||||
RawTag::new("tag1".to_owned(), "foo".to_owned()),
|
||||
RawTag::new("tag2".to_owned(), "true".to_owned()),
|
||||
]);
|
||||
|
||||
let parsed = MyTags::from_tags(tags).unwrap();
|
||||
|
||||
assert!(parsed.tag1 == "foo");
|
||||
assert!(parsed.tag2);
|
||||
assert!(parsed.tag3.is_none());
|
||||
```
|
||||
|
||||
## Using custom tag types
|
||||
|
||||
By default, encoding and decoding of tags is supported for `String` and `bool`
|
||||
values.
|
||||
|
||||
- `String` is encoded as-is
|
||||
- `bool` is encoded as `true` and `false`
|
||||
|
||||
In case you have your own type `T` you want to encode in a tag, there are two
|
||||
strategies:
|
||||
|
||||
- `serde`, which requires `T` to implement `Serialize` and `Deserialize`.
|
||||
- `manual`, which requires `T` to impelemnt two traits:
|
||||
- `impl TryFrom<RawTagValue> for T`: How to (fallibly) create a `T` from the
|
||||
value of an tag
|
||||
- `impl From<T> for RawTagValue`: How to turn `T` back into the value of a
|
||||
tag. This cannot fail.
|
||||
|
||||
There is a [`macro@Tag`] macro that selects the strategy, which can then be used
|
||||
in a struct that is using `#[Tags]`:
|
||||
|
||||
```rust
|
||||
use aws::tags::{Tag, Tags};
|
||||
use serde::{Serialize, Deserialize};
|
||||
|
||||
#[Tag(translate = serde)]
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
|
||||
struct MyTag {
|
||||
foo: String,
|
||||
bar: bool,
|
||||
}
|
||||
|
||||
#[Tags]
|
||||
struct MyTags {
|
||||
foo: MyTag,
|
||||
}
|
||||
```
|
||||
127
src/tags/error.rs
Normal file
127
src/tags/error.rs
Normal file
@@ -0,0 +1,127 @@
|
||||
#![expect(clippy::module_name_repetitions, reason = "error prefix is necessary")]
|
||||
|
||||
use std::{convert::Infallible, fmt};
|
||||
|
||||
use super::{RawTagValue, TagKey};
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
pub enum ParseTagAwsError {
|
||||
AwsKeyNone,
|
||||
AwsValueNone { key: TagKey },
|
||||
}
|
||||
|
||||
impl std::error::Error for ParseTagAwsError {}
|
||||
|
||||
impl fmt::Display for ParseTagAwsError {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match *self {
|
||||
Self::AwsKeyNone => write!(f, "aws responded with `None` value for tag key"),
|
||||
Self::AwsValueNone { ref key } => write!(
|
||||
f,
|
||||
"aws responded with `None` value for tag value of tag \"{key}\""
|
||||
),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
pub enum ParseTagValueError {
|
||||
/// A generic error for type conversions of a tag value to some type `T`
|
||||
InvalidValue {
|
||||
value: RawTagValue,
|
||||
message: String,
|
||||
},
|
||||
/// like `InvalidValue`, but specific for `bool`
|
||||
InvalidBoolValue {
|
||||
value: RawTagValue,
|
||||
},
|
||||
Aws(ParseTagAwsError),
|
||||
}
|
||||
|
||||
impl std::error::Error for ParseTagValueError {}
|
||||
|
||||
impl fmt::Display for ParseTagValueError {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match *self {
|
||||
Self::InvalidBoolValue { ref value } => {
|
||||
write!(f, "invalid tag bool value \"{value}\"")
|
||||
}
|
||||
Self::InvalidValue {
|
||||
ref value,
|
||||
ref message,
|
||||
} => write!(f, "invalid tag value \"{value}\": {message}"),
|
||||
Self::Aws(ref inner) => write!(f, "aws error: {inner}"),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<Infallible> for ParseTagValueError {
|
||||
fn from(_value: Infallible) -> Self {
|
||||
unreachable!()
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
/// Like [`ParseTagValueError`], but contains potential additional information about the
|
||||
/// tag *key*.
|
||||
pub enum ParseTagError {
|
||||
InvalidTagValue {
|
||||
key: TagKey,
|
||||
inner: ParseTagValueError,
|
||||
},
|
||||
Aws(ParseTagAwsError),
|
||||
}
|
||||
|
||||
impl std::error::Error for ParseTagError {}
|
||||
|
||||
impl fmt::Display for ParseTagError {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match *self {
|
||||
Self::Aws(ref inner) => write!(f, "aws error: {inner}"),
|
||||
Self::InvalidTagValue { ref key, ref inner } => {
|
||||
write!(f, "failed parsing tag \"{key}\": {inner}")
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// this is required because `String` can be the inner value of a `Tag`, but is also the input
|
||||
/// to the `parse()` function. `try_into()` from `String` to `String` returns `Infallible` as
|
||||
/// the `Err` type.
|
||||
impl From<Infallible> for ParseTagError {
|
||||
fn from(_value: Infallible) -> Self {
|
||||
unreachable!()
|
||||
}
|
||||
}
|
||||
|
||||
impl From<ParseTagAwsError> for ParseTagError {
|
||||
fn from(value: ParseTagAwsError) -> Self {
|
||||
Self::Aws(value)
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone)]
|
||||
/// Errors that can happen when parsing a set of tags.
|
||||
pub enum ParseTagsError {
|
||||
/// A required tag was not found
|
||||
TagNotFound { key: TagKey },
|
||||
/// A single tag failed to parse
|
||||
ParseTag(ParseTagError),
|
||||
}
|
||||
|
||||
impl std::error::Error for ParseTagsError {}
|
||||
|
||||
impl fmt::Display for ParseTagsError {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match *self {
|
||||
Self::TagNotFound { ref key } => write!(f, "tag {key} not found in input"),
|
||||
Self::ParseTag(ref err) => write!(f, "failed parsing tag: {err}"),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<ParseTagError> for ParseTagsError {
|
||||
fn from(value: ParseTagError) -> Self {
|
||||
Self::ParseTag(value)
|
||||
}
|
||||
}
|
||||
49
src/tags/helpers.rs
Normal file
49
src/tags/helpers.rs
Normal file
@@ -0,0 +1,49 @@
|
||||
macro_rules! impl_string_wrapper {
|
||||
($name:ident) => {
|
||||
impl $name {
|
||||
pub const fn new(value: String) -> Self {
|
||||
Self(value)
|
||||
}
|
||||
|
||||
pub fn as_str(&self) -> &str {
|
||||
&self.0
|
||||
}
|
||||
|
||||
pub fn into_string(self) -> String {
|
||||
self.0
|
||||
}
|
||||
}
|
||||
|
||||
impl From<String> for $name {
|
||||
fn from(value: String) -> Self {
|
||||
Self::new(value)
|
||||
}
|
||||
}
|
||||
|
||||
impl From<$name> for String {
|
||||
fn from(value: $name) -> Self {
|
||||
value.into_string()
|
||||
}
|
||||
}
|
||||
|
||||
impl fmt::Display for $name {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
write!(f, "{}", self.0)
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<str> for $name {
|
||||
fn eq(&self, other: &str) -> bool {
|
||||
self.as_str() == other
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<String> for $name {
|
||||
fn eq(&self, other: &String) -> bool {
|
||||
self.as_str() == other
|
||||
}
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
pub(crate) use impl_string_wrapper;
|
||||
407
src/tags/mod.rs
Normal file
407
src/tags/mod.rs
Normal file
@@ -0,0 +1,407 @@
|
||||
#![doc = include_str!("README.md")]
|
||||
use std::fmt::{self, Debug};
|
||||
|
||||
use serde::{de::DeserializeOwned, Deserialize, Serialize};
|
||||
|
||||
mod error;
|
||||
mod helpers;
|
||||
mod predefined_types;
|
||||
mod svc;
|
||||
|
||||
pub use aws_macros::{Tag, Tags};
|
||||
pub use error::{ParseTagAwsError, ParseTagError, ParseTagValueError, ParseTagsError};
|
||||
|
||||
#[derive(Debug, PartialEq, Eq)]
|
||||
struct InnerTagValue<T>(T)
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send;
|
||||
|
||||
impl<T> From<T> for InnerTagValue<T>
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send,
|
||||
{
|
||||
fn from(value: T) -> Self {
|
||||
Self(value)
|
||||
}
|
||||
}
|
||||
|
||||
impl<T> From<InnerTagValue<T>> for String
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Into<RawTagValue> + Send,
|
||||
{
|
||||
fn from(value: InnerTagValue<T>) -> Self {
|
||||
value.0.into().0
|
||||
}
|
||||
}
|
||||
|
||||
impl<T> PartialEq<T> for InnerTagValue<T>
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Into<RawTagValue> + Send,
|
||||
{
|
||||
fn eq(&self, other: &T) -> bool {
|
||||
&self.0 == other
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, Clone, Deserialize, Serialize, PartialEq, Eq)]
|
||||
pub struct RawTagValue(String);
|
||||
helpers::impl_string_wrapper!(RawTagValue);
|
||||
|
||||
pub struct TranslateSerde;
|
||||
pub struct TranslateManual;
|
||||
|
||||
pub trait Translator<S: ?Sized, T> {
|
||||
type Error;
|
||||
|
||||
fn from_raw_tag(value: RawTagValue) -> Result<T, Self::Error>;
|
||||
fn into_raw_tag(value: T) -> RawTagValue;
|
||||
}
|
||||
|
||||
pub trait TranslatableSerde: Serialize + DeserializeOwned {}
|
||||
pub trait TranslatableManual:
|
||||
TryFrom<RawTagValue, Error: Into<ParseTagValueError>> + Into<RawTagValue>
|
||||
{
|
||||
}
|
||||
|
||||
pub trait TagValue<V> {
|
||||
type Error;
|
||||
type Translator: Translator<Self, V, Error = Self::Error>;
|
||||
|
||||
fn from_raw_tag(value: RawTagValue) -> Result<V, Self::Error> {
|
||||
Self::Translator::from_raw_tag(value)
|
||||
}
|
||||
|
||||
fn into_raw_tag(value: V) -> RawTagValue {
|
||||
Self::Translator::into_raw_tag(value)
|
||||
}
|
||||
}
|
||||
|
||||
impl<S, T> Translator<S, T> for TranslateSerde
|
||||
where
|
||||
T: TranslatableSerde,
|
||||
{
|
||||
type Error = ParseTagValueError;
|
||||
|
||||
fn from_raw_tag(value: RawTagValue) -> Result<T, Self::Error> {
|
||||
serde_json::from_str::<T>(value.as_str()).map_err(|e| ParseTagValueError::InvalidValue {
|
||||
value,
|
||||
message: e.to_string(),
|
||||
})
|
||||
}
|
||||
|
||||
fn into_raw_tag(value: T) -> RawTagValue {
|
||||
RawTagValue(serde_json::to_string(&value).expect("serialization always succeeds"))
|
||||
}
|
||||
}
|
||||
|
||||
impl<S, T> Translator<S, T> for TranslateManual
|
||||
where
|
||||
T: TranslatableManual,
|
||||
{
|
||||
type Error = ParseTagValueError;
|
||||
|
||||
fn from_raw_tag(value: RawTagValue) -> Result<T, Self::Error> {
|
||||
match value.clone().try_into() {
|
||||
Ok(r) => Ok(r),
|
||||
Err(e) => Err(ParseTagValueError::InvalidValue {
|
||||
value,
|
||||
message: {
|
||||
let e: ParseTagValueError = e.into();
|
||||
e.to_string()
|
||||
},
|
||||
}),
|
||||
}
|
||||
}
|
||||
|
||||
fn into_raw_tag(value: T) -> RawTagValue {
|
||||
value.into()
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Clone, Debug, Deserialize, Serialize, PartialEq, Eq)]
|
||||
pub struct RawTag {
|
||||
key: TagKey,
|
||||
value: RawTagValue,
|
||||
}
|
||||
|
||||
impl RawTag {
|
||||
pub fn new(key: impl Into<TagKey>, value: impl Into<RawTagValue>) -> Self {
|
||||
Self {
|
||||
key: key.into(),
|
||||
value: value.into(),
|
||||
}
|
||||
}
|
||||
|
||||
pub const fn key(&self) -> &TagKey {
|
||||
&self.key
|
||||
}
|
||||
|
||||
pub const fn value(&self) -> &RawTagValue {
|
||||
&self.value
|
||||
}
|
||||
}
|
||||
|
||||
impl<T> From<Tag<T>> for RawTag
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send,
|
||||
T: TagValue<T>,
|
||||
InnerTagValue<T>: fmt::Display + Into<RawTagValue>,
|
||||
{
|
||||
fn from(tag: Tag<T>) -> Self {
|
||||
Self {
|
||||
key: tag.key,
|
||||
value: tag.value.into(),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Debug, PartialEq, Eq, Clone, Deserialize, Serialize)]
|
||||
pub struct TagKey(String);
|
||||
helpers::impl_string_wrapper!(TagKey);
|
||||
|
||||
/// A tag generic over it's containing value type.
|
||||
///
|
||||
/// There are two ways to construct a `Tag`:
|
||||
///
|
||||
/// * You already have a `T`: Just use [`new()`](Self::new())
|
||||
/// ```rust
|
||||
/// use aws::tags::Tag;
|
||||
///
|
||||
/// let tag = Tag::<bool>::new("foo".to_owned(), true);
|
||||
/// ```
|
||||
///
|
||||
/// * You have something that may be able to be turned into a [`TagValue<T>`]. In that
|
||||
/// case, either use [`parse()`](Self::parse()) or the `TryInto` implementation.
|
||||
/// [`parse()`](Self::parse()) accepts an `impl Into<RawTagValue>`, which is implemented
|
||||
/// for `String`:
|
||||
///
|
||||
/// ```rust
|
||||
/// use aws::tags::Tag;
|
||||
///
|
||||
/// let tag = Tag::<bool>::parse("foo".to_owned(), "true".to_owned()).unwrap();
|
||||
/// ```
|
||||
///
|
||||
/// Both the `TryInto` implementation and [`parse()`](Self::parse()) may return a
|
||||
/// [`ParseTagValueError`] that contains more information about the parse failure.
|
||||
#[derive(Debug, PartialEq, Eq)]
|
||||
pub struct Tag<T>
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
key: TagKey,
|
||||
value: InnerTagValue<T>,
|
||||
}
|
||||
|
||||
impl<T> TryFrom<RawTag> for Tag<T>
|
||||
where
|
||||
T: Clone + PartialEq + Eq + Debug + Send,
|
||||
T: TagValue<T, Error = ParseTagValueError>,
|
||||
{
|
||||
type Error = ParseTagValueError;
|
||||
|
||||
fn try_from(tag: RawTag) -> Result<Self, Self::Error> {
|
||||
Self::parse(tag.key, tag.value)
|
||||
}
|
||||
}
|
||||
|
||||
impl<T> Tag<T>
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
pub fn new(key: impl Into<TagKey>, value: T) -> Self {
|
||||
Self {
|
||||
key: key.into(),
|
||||
value: InnerTagValue(value),
|
||||
}
|
||||
}
|
||||
|
||||
pub fn parse(
|
||||
key: impl Into<TagKey>,
|
||||
value: impl Into<String>,
|
||||
) -> Result<Self, ParseTagValueError>
|
||||
where
|
||||
T: TagValue<T, Error = ParseTagValueError>,
|
||||
{
|
||||
Ok(Self {
|
||||
key: key.into(),
|
||||
value: {
|
||||
InnerTagValue(<T as TagValue<T>>::from_raw_tag(RawTagValue::new(
|
||||
value.into(),
|
||||
))?)
|
||||
},
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
impl<T> Tag<T>
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
fn into_parts(self) -> (TagKey, InnerTagValue<T>) {
|
||||
(self.key, self.value)
|
||||
}
|
||||
|
||||
pub const fn key(&self) -> &TagKey {
|
||||
&self.key
|
||||
}
|
||||
|
||||
pub const fn value(&self) -> &T {
|
||||
&self.value.0
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(Clone, Debug, Serialize, Deserialize, Eq, PartialEq)]
|
||||
pub struct TagList(Vec<RawTag>);
|
||||
|
||||
impl TagList {
|
||||
pub const fn new() -> Self {
|
||||
Self(Vec::new())
|
||||
}
|
||||
|
||||
pub fn push(&mut self, tag: RawTag) {
|
||||
self.0.push(tag);
|
||||
}
|
||||
|
||||
pub fn extend(&mut self, tags: Vec<RawTag>) {
|
||||
self.0.extend(tags);
|
||||
}
|
||||
|
||||
pub fn join(&mut self, other: Self) {
|
||||
self.0.extend(other.0);
|
||||
}
|
||||
|
||||
pub const fn from_vec(value: Vec<RawTag>) -> Self {
|
||||
Self(value)
|
||||
}
|
||||
|
||||
pub fn get(&self, key: impl Into<TagKey>) -> Option<&RawTag> {
|
||||
let key: TagKey = key.into();
|
||||
self.0.iter().find(|tag| tag.key == key)
|
||||
}
|
||||
|
||||
pub fn into_vec(self) -> Vec<RawTag> {
|
||||
self.0
|
||||
}
|
||||
|
||||
pub fn as_slice(&self) -> &[RawTag] {
|
||||
&self.0
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use serde::{Deserialize, Serialize};
|
||||
|
||||
use super::*;
|
||||
|
||||
#[Tag(translate = manual)]
|
||||
#[derive(Debug, Clone, PartialEq, Eq)]
|
||||
enum MyTag {
|
||||
A,
|
||||
B,
|
||||
}
|
||||
|
||||
#[Tag(translate = serde)]
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Serialize, Deserialize)]
|
||||
struct MyStructTag {
|
||||
foo: String,
|
||||
bar: bool,
|
||||
}
|
||||
|
||||
impl TryFrom<RawTagValue> for MyTag {
|
||||
type Error = ParseTagValueError;
|
||||
|
||||
fn try_from(value: RawTagValue) -> Result<Self, Self::Error> {
|
||||
match value.as_str() {
|
||||
"A" => Ok(Self::A),
|
||||
"B" => Ok(Self::B),
|
||||
_ => Err(ParseTagValueError::InvalidValue {
|
||||
value,
|
||||
message: "could not match to MyTag enum".to_owned(),
|
||||
}),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl From<MyTag> for RawTagValue {
|
||||
fn from(value: MyTag) -> Self {
|
||||
match value {
|
||||
MyTag::A => Self("A".to_owned()),
|
||||
MyTag::B => Self("B".to_owned()),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn use_tag_directly() {
|
||||
let key = "Name";
|
||||
|
||||
let tag1 = Tag::<bool>::new(key.to_owned(), true);
|
||||
assert!(*tag1.value());
|
||||
|
||||
let tag2 = Tag::<bool>::parse(key.to_owned(), "true".to_owned()).unwrap();
|
||||
assert!(*tag2.value());
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn use_attribute_macro() {
|
||||
#[Tags]
|
||||
struct MyWrappedTags {
|
||||
tag1: String,
|
||||
tag2: bool,
|
||||
tag3: Option<bool>,
|
||||
tag4: Option<bool>,
|
||||
#[tag(key = "myname")]
|
||||
tag5: MyTag,
|
||||
#[tag(key = "anothername")]
|
||||
tag6: Option<MyTag>,
|
||||
tag7: Option<MyTag>,
|
||||
tag8: MyStructTag,
|
||||
tag9: Option<MyStructTag>,
|
||||
}
|
||||
|
||||
let tags = TagList::from_vec(vec![
|
||||
RawTag::new("tag1".to_owned(), "false".to_owned()),
|
||||
RawTag::new("tag2".to_owned(), "true".to_owned()),
|
||||
RawTag::new("tag3".to_owned(), "false".to_owned()),
|
||||
RawTag::new("myname".to_owned(), "A".to_owned()),
|
||||
RawTag::new("anothername".to_owned(), "B".to_owned()),
|
||||
RawTag::new("tag8".to_owned(), r#"{"foo":"hi","bar":false}"#.to_owned()),
|
||||
]);
|
||||
|
||||
let tags = MyWrappedTags::from_tags(tags).unwrap();
|
||||
|
||||
assert!(tags.tag1 == "false");
|
||||
assert!(tags.tag2);
|
||||
assert!(tags.tag3 == Some(false));
|
||||
assert!(tags.tag4.is_none());
|
||||
assert!(tags.tag5 == MyTag::A);
|
||||
assert!(tags.tag6 == Some(MyTag::B));
|
||||
assert!(tags.tag7.is_none());
|
||||
assert!(
|
||||
tags.tag8
|
||||
== MyStructTag {
|
||||
foo: "hi".to_owned(),
|
||||
bar: false
|
||||
}
|
||||
);
|
||||
assert!(tags.tag9.is_none());
|
||||
|
||||
let into_tags = tags.into_tags();
|
||||
|
||||
assert_eq!(
|
||||
into_tags,
|
||||
TagList::from_vec(vec![
|
||||
RawTag::new("tag1".to_owned(), "false".to_owned()),
|
||||
RawTag::new("tag2".to_owned(), "true".to_owned()),
|
||||
RawTag::new("tag3".to_owned(), "false".to_owned()),
|
||||
RawTag::new("myname".to_owned(), "A".to_owned()),
|
||||
RawTag::new("anothername".to_owned(), "B".to_owned()),
|
||||
RawTag::new("tag8".to_owned(), r#"{"foo":"hi","bar":false}"#.to_owned(),),
|
||||
])
|
||||
);
|
||||
}
|
||||
}
|
||||
23
src/tags/predefined_types.rs
Normal file
23
src/tags/predefined_types.rs
Normal file
@@ -0,0 +1,23 @@
|
||||
use super::{
|
||||
ParseTagValueError, TagValue, TranslatableManual, TranslatableSerde, TranslateManual,
|
||||
TranslateSerde,
|
||||
};
|
||||
|
||||
// Bools can just be handled by serde.
|
||||
impl TranslatableSerde for bool {}
|
||||
|
||||
impl TagValue<Self> for bool {
|
||||
type Error = ParseTagValueError;
|
||||
type Translator = TranslateSerde;
|
||||
}
|
||||
|
||||
// Due to quoting, we cannot use serde here. It would produce quoted
|
||||
// strings. Instead, we just serialize/deserialize strings as-is.
|
||||
// Note that we get the `String` conversion functions for free via the
|
||||
// `impl_string_wrapper` macro application on `RawTagValue`.
|
||||
impl TranslatableManual for String {}
|
||||
|
||||
impl TagValue<Self> for String {
|
||||
type Error = ParseTagValueError;
|
||||
type Translator = TranslateManual;
|
||||
}
|
||||
233
src/tags/svc.rs
Normal file
233
src/tags/svc.rs
Normal file
@@ -0,0 +1,233 @@
|
||||
mod ec2 {
|
||||
use std::fmt::Debug;
|
||||
|
||||
use super::super::{
|
||||
error::ParseTagAwsError, ParseTagError, ParseTagsError, RawTag, RawTagValue, Tag, TagKey,
|
||||
TagList, TagValue,
|
||||
};
|
||||
|
||||
impl<T> From<Tag<T>> for aws_sdk_ec2::types::Tag
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Into<String> + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
fn from(tag: Tag<T>) -> Self {
|
||||
let (key, value) = tag.into_parts();
|
||||
Self::builder().key(key).value(value.0).build()
|
||||
}
|
||||
}
|
||||
|
||||
impl From<RawTag> for aws_sdk_ec2::types::Tag {
|
||||
fn from(tag: RawTag) -> Self {
|
||||
Self::builder().key(tag.key).value(tag.value.0).build()
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<Vec<aws_sdk_ec2::types::Tag>> for TagList {
|
||||
type Error = ParseTagsError;
|
||||
|
||||
fn try_from(list: Vec<aws_sdk_ec2::types::Tag>) -> Result<Self, Self::Error> {
|
||||
Ok(Self(
|
||||
list.into_iter()
|
||||
.map(TryInto::try_into)
|
||||
.collect::<Result<Vec<_>, ParseTagError>>()?,
|
||||
))
|
||||
}
|
||||
}
|
||||
|
||||
impl From<TagList> for Vec<aws_sdk_ec2::types::Tag> {
|
||||
fn from(tags: TagList) -> Self {
|
||||
tags.0.into_iter().map(Into::into).collect()
|
||||
}
|
||||
}
|
||||
|
||||
impl From<TagList> for Vec<aws_sdk_ec2::types::Filter> {
|
||||
fn from(tags: TagList) -> Self {
|
||||
tags.0
|
||||
.into_iter()
|
||||
.map(|tag| {
|
||||
aws_sdk_ec2::types::Filter::builder()
|
||||
.name(format!("tag:{}", tag.key))
|
||||
.values(tag.value)
|
||||
.build()
|
||||
})
|
||||
.collect()
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<aws_sdk_ec2::types::Tag> for RawTag {
|
||||
type Error = ParseTagError;
|
||||
|
||||
fn try_from(tag: aws_sdk_ec2::types::Tag) -> Result<Self, Self::Error> {
|
||||
let key = TagKey(tag.key.ok_or(ParseTagAwsError::AwsKeyNone)?);
|
||||
let value = RawTagValue(
|
||||
tag.value
|
||||
.ok_or_else(|| ParseTagAwsError::AwsValueNone { key: key.clone() })?,
|
||||
);
|
||||
Ok(Self { key, value })
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<aws_sdk_ec2::types::Tag> for RawTag {
|
||||
fn eq(&self, other: &aws_sdk_ec2::types::Tag) -> bool {
|
||||
Some(&self.key.0) == other.key.as_ref() && Some(&self.value.0) == other.value.as_ref()
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<RawTag> for aws_sdk_ec2::types::Tag {
|
||||
fn eq(&self, other: &RawTag) -> bool {
|
||||
other.eq(self)
|
||||
}
|
||||
}
|
||||
|
||||
impl From<TagList> for aws_sdk_ec2::types::TagSpecification {
|
||||
fn from(value: TagList) -> Self {
|
||||
Self::builder()
|
||||
.resource_type(aws_sdk_ec2::types::ResourceType::Instance)
|
||||
.set_tags(Some(value.into()))
|
||||
.build()
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
mod cloudformation {
|
||||
use std::fmt::Debug;
|
||||
|
||||
use super::super::{
|
||||
error::ParseTagAwsError, ParseTagError, ParseTagsError, RawTag, RawTagValue, Tag, TagKey,
|
||||
TagList, TagValue,
|
||||
};
|
||||
|
||||
impl<T> From<Tag<T>> for aws_sdk_cloudformation::types::Tag
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Into<String> + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
fn from(tag: Tag<T>) -> Self {
|
||||
let (key, value) = tag.into_parts();
|
||||
Self::builder().key(key).value(value.0).build()
|
||||
}
|
||||
}
|
||||
|
||||
impl From<RawTag> for aws_sdk_cloudformation::types::Tag {
|
||||
fn from(tag: RawTag) -> Self {
|
||||
Self::builder().key(tag.key).value(tag.value.0).build()
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<Vec<aws_sdk_cloudformation::types::Tag>> for TagList {
|
||||
type Error = ParseTagsError;
|
||||
|
||||
fn try_from(list: Vec<aws_sdk_cloudformation::types::Tag>) -> Result<Self, Self::Error> {
|
||||
Ok(Self(
|
||||
list.into_iter()
|
||||
.map(TryInto::try_into)
|
||||
.collect::<Result<Vec<_>, ParseTagError>>()?,
|
||||
))
|
||||
}
|
||||
}
|
||||
|
||||
impl From<TagList> for Vec<aws_sdk_cloudformation::types::Tag> {
|
||||
fn from(tags: TagList) -> Self {
|
||||
tags.0.into_iter().map(Into::into).collect()
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<aws_sdk_cloudformation::types::Tag> for RawTag {
|
||||
type Error = ParseTagError;
|
||||
|
||||
fn try_from(tag: aws_sdk_cloudformation::types::Tag) -> Result<Self, Self::Error> {
|
||||
let key = TagKey(tag.key.ok_or(ParseTagAwsError::AwsKeyNone)?);
|
||||
let value = RawTagValue(
|
||||
tag.value
|
||||
.ok_or_else(|| ParseTagAwsError::AwsValueNone { key: key.clone() })?,
|
||||
);
|
||||
Ok(Self { key, value })
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<aws_sdk_cloudformation::types::Tag> for RawTag {
|
||||
fn eq(&self, other: &aws_sdk_cloudformation::types::Tag) -> bool {
|
||||
Some(&self.key.0) == other.key.as_ref() && Some(&self.value.0) == other.value.as_ref()
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<RawTag> for aws_sdk_cloudformation::types::Tag {
|
||||
fn eq(&self, other: &RawTag) -> bool {
|
||||
other.eq(self)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
mod efs {
|
||||
use std::fmt::Debug;
|
||||
|
||||
use super::super::{
|
||||
ParseTagError, ParseTagsError, RawTag, RawTagValue, Tag, TagKey, TagList, TagValue,
|
||||
};
|
||||
|
||||
impl<T> From<Tag<T>> for aws_sdk_efs::types::Tag
|
||||
where
|
||||
T: Debug + Clone + PartialEq + Eq + Into<String> + Send,
|
||||
T: TagValue<T>,
|
||||
{
|
||||
fn from(tag: Tag<T>) -> Self {
|
||||
let (key, value) = tag.into_parts();
|
||||
Self::builder()
|
||||
.key(key)
|
||||
.value(value.0)
|
||||
.build()
|
||||
.expect("builder misused")
|
||||
}
|
||||
}
|
||||
|
||||
impl From<RawTag> for aws_sdk_efs::types::Tag {
|
||||
fn from(tag: RawTag) -> Self {
|
||||
Self::builder()
|
||||
.key(tag.key)
|
||||
.value(tag.value.0)
|
||||
.build()
|
||||
.expect("builder misused")
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<Vec<aws_sdk_efs::types::Tag>> for TagList {
|
||||
type Error = ParseTagsError;
|
||||
|
||||
fn try_from(list: Vec<aws_sdk_efs::types::Tag>) -> Result<Self, Self::Error> {
|
||||
Ok(Self(
|
||||
list.into_iter()
|
||||
.map(TryInto::try_into)
|
||||
.collect::<Result<Vec<_>, ParseTagError>>()?,
|
||||
))
|
||||
}
|
||||
}
|
||||
|
||||
impl From<TagList> for Vec<aws_sdk_efs::types::Tag> {
|
||||
fn from(tags: TagList) -> Self {
|
||||
tags.0.into_iter().map(Into::into).collect()
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<aws_sdk_efs::types::Tag> for RawTag {
|
||||
type Error = ParseTagError;
|
||||
|
||||
fn try_from(tag: aws_sdk_efs::types::Tag) -> Result<Self, Self::Error> {
|
||||
let key = TagKey(tag.key);
|
||||
let value = RawTagValue(tag.value);
|
||||
Ok(Self { key, value })
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<aws_sdk_efs::types::Tag> for RawTag {
|
||||
fn eq(&self, other: &aws_sdk_efs::types::Tag) -> bool {
|
||||
self.key.0 == other.key && self.value.0 == other.value
|
||||
}
|
||||
}
|
||||
|
||||
impl PartialEq<RawTag> for aws_sdk_efs::types::Tag {
|
||||
fn eq(&self, other: &RawTag) -> bool {
|
||||
other.eq(self)
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user