Struct trust_dns_client::rr::LowerName
source · [−]pub struct LowerName(_);
Expand description
them should be through references. As a workaround the Strings are all Rc as well as the array
Implementations
sourceimpl LowerName
impl LowerName
sourcepub fn is_root(&self) -> bool
pub fn is_root(&self) -> bool
Returns true if there are no labels, i.e. it’s empty.
In DNS the root is represented by .
Examples
use trust_dns_client::rr::{LowerName, Name};
let root = LowerName::from(Name::root());
assert_eq!(&root.to_string(), ".");
sourcepub fn is_fqdn(&self) -> bool
pub fn is_fqdn(&self) -> bool
Returns true if the name is a fully qualified domain name.
If this is true, it has effects like only querying for this single name, as opposed to building up a search list in resolvers.
warning: this interface is unstable and may change in the future
Examples
use std::str::FromStr;
use trust_dns_client::rr::{LowerName, Name};
let name = LowerName::from(Name::from_str("www").unwrap());
assert!(!name.is_fqdn());
let name = LowerName::from(Name::from_str("www.example.com").unwrap());
assert!(!name.is_fqdn());
let name = LowerName::from(Name::from_str("www.example.com.").unwrap());
assert!(name.is_fqdn());
sourcepub fn base_name(&self) -> Self
pub fn base_name(&self) -> Self
Trims off the first part of the name, to help with searching for the domain piece
Examples
use std::str::FromStr;
use trust_dns_client::rr::{LowerName, Name};
let example_com = LowerName::from(Name::from_str("example.com").unwrap());
assert_eq!(example_com.base_name(), LowerName::from(Name::from_str("com.").unwrap()));
assert_eq!(LowerName::from(Name::from_str("com.").unwrap().base_name()), LowerName::from(Name::root()));
assert_eq!(LowerName::from(Name::root().base_name()), LowerName::from(Name::root()));
sourcepub fn zone_of(&self, name: &Self) -> bool
pub fn zone_of(&self, name: &Self) -> bool
returns true if the name components of self are all present at the end of name
Example
use std::str::FromStr;
use trust_dns_client::rr::{LowerName, Name};
let name = LowerName::from(Name::from_str("www.example.com").unwrap());
let zone = LowerName::from(Name::from_str("example.com").unwrap());
let another = LowerName::from(Name::from_str("example.net").unwrap());
assert!(zone.zone_of(&name));
assert!(!another.zone_of(&name));
sourcepub fn num_labels(&self) -> u8
pub fn num_labels(&self) -> u8
Returns the number of labels in the name, discounting *
.
Examples
use std::str::FromStr;
use trust_dns_client::rr::{LowerName, Name};
let root = LowerName::from(Name::root());
assert_eq!(root.num_labels(), 0);
let example_com = LowerName::from(Name::from_str("example.com").unwrap());
assert_eq!(example_com.num_labels(), 2);
let star_example_com = LowerName::from(Name::from_str("*.example.com").unwrap());
assert_eq!(star_example_com.num_labels(), 2);
sourcepub fn len(&self) -> usize
pub fn len(&self) -> usize
returns the length in bytes of the labels. ‘.’ counts as 1
This can be used as an estimate, when serializing labels, they will often be compressed and/or escaped causing the exact length to be different.
sourcepub fn emit_as_canonical(
&self,
encoder: &mut BinEncoder<'_>,
canonical: bool
) -> ProtoResult<()>
pub fn emit_as_canonical(
&self,
encoder: &mut BinEncoder<'_>,
canonical: bool
) -> ProtoResult<()>
Emits the canonical version of the name to the encoder.
In canonical form, there will be no pointers written to the encoder (i.e. no compression).
sourcepub fn is_wildcard(&self) -> bool
pub fn is_wildcard(&self) -> bool
Pass through for Name::is_wildcard
sourcepub fn into_wildcard(self) -> Self
pub fn into_wildcard(self) -> Self
Replaces the first label with the wildcard character, “*”
Trait Implementations
sourceimpl<'r> BinDecodable<'r> for LowerName
impl<'r> BinDecodable<'r> for LowerName
sourcefn read(decoder: &mut BinDecoder<'r>) -> ProtoResult<Self>
fn read(decoder: &mut BinDecoder<'r>) -> ProtoResult<Self>
parses the chain of labels this has a max of 255 octets, with each label being less than 63. all names will be stored lowercase internally. This will consume the portions of the Vec which it is reading…
sourcefn from_bytes(bytes: &'r [u8]) -> Result<Self, ProtoError>
fn from_bytes(bytes: &'r [u8]) -> Result<Self, ProtoError>
Returns the object in binary form
sourceimpl BinEncodable for LowerName
impl BinEncodable for LowerName
sourcefn emit(&self, encoder: &mut BinEncoder<'_>) -> ProtoResult<()>
fn emit(&self, encoder: &mut BinEncoder<'_>) -> ProtoResult<()>
Write the type to the stream
sourceimpl<'de> Deserialize<'de> for LowerName
impl<'de> Deserialize<'de> for LowerName
sourcefn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
D: Deserializer<'de>,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceimpl Ord for LowerName
impl Ord for LowerName
sourcefn cmp(&self, other: &Self) -> Ordering
fn cmp(&self, other: &Self) -> Ordering
Given two lower cased names, this performs a case sensitive comparison.
RFC 4034 DNSSEC Resource Records March 2005
6.1. Canonical DNS LowerName Order
For the purposes of DNS security, owner names are ordered by treating
individual labels as unsigned left-justified octet strings. The
absence of a octet sorts before a zero value octet, and uppercase
US-ASCII letters are treated as if they were lowercase US-ASCII
letters.
To compute the canonical ordering of a set of DNS names, start by
sorting the names according to their most significant (rightmost)
labels. For names in which the most significant label is identical,
continue sorting according to their next most significant label, and
so forth.
For example, the following names are sorted in canonical DNS name
order. The most significant label is "example". At this level,
"example" sorts first, followed by names ending in "a.example", then
by names ending "z.example". The names within each level are sorted
in the same way.
example
a.example
yljkjljk.a.example
Z.a.example
zABC.a.EXAMPLE
z.example
\001.z.example
*.z.example
\200.z.example
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
sourceimpl PartialOrd<LowerName> for LowerName
impl PartialOrd<LowerName> for LowerName
sourcefn partial_cmp(&self, other: &Self) -> Option<Ordering>
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl Eq for LowerName
impl StructuralEq for LowerName
Auto Trait Implementations
impl RefUnwindSafe for LowerName
impl Send for LowerName
impl Sync for LowerName
impl Unpin for LowerName
impl UnwindSafe for LowerName
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to key
and return true
if they are equal.
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> IntoName for T where
T: Into<Name>,
impl<T> IntoName for T where
T: Into<Name>,
sourcefn into_name(self) -> Result<Name, ProtoError>
fn into_name(self) -> Result<Name, ProtoError>
Convert this into Name
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
fn vzip(self) -> V
sourceimpl<T> WithSubscriber for T
impl<T> WithSubscriber for T
sourcefn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
sourcefn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more