diff --git a/futures_core/all.html b/futures_core/all.html index 5e044fbd62..66ee14f3ea 100644 --- a/futures_core/all.html +++ b/futures_core/all.html @@ -1 +1 @@ -List of all items in this crate

List of all items

Traits

Macros

Type Aliases

\ No newline at end of file +List of all items in this crate

List of all items

Traits

Macros

Type Aliases

\ No newline at end of file diff --git a/futures_core/future/index.html b/futures_core/future/index.html index bf077a7635..f7bf451985 100644 --- a/futures_core/future/index.html +++ b/futures_core/future/index.html @@ -1,4 +1,4 @@ -futures_core::future - Rust
futures_core

Module future

Source
Expand description

Futures.

+futures_core::future - Rust
futures_core

Module future

Source
Expand description

Futures.

Re-exports§

Traits§

  • FusedFuture
    A future which tracks whether or not the underlying future should no longer be polled.
  • TryFuture
    A convenience for futures that return Result values that includes a variety of adapters tailored to such futures.

Type Aliases§

1.77.0 · Source

pub fn chunk_by<F>(&self, pred: F) -> ChunkBy<'_, T, F>
where +

1.77.0 · Source

pub fn chunk_by<F>(&self, pred: F) -> ChunkBy<'_, T, F>
where F: FnMut(&T, &T) -> bool,

Returns an iterator over the slice producing non-overlapping runs of elements using the predicate to separate them.

The predicate is called for every pair of consecutive elements, @@ -616,7 +616,7 @@

§Examplesassert_eq!(iter.next(), Some(&[2, 3][..])); assert_eq!(iter.next(), Some(&[2, 3, 4][..])); assert_eq!(iter.next(), None);
-
1.0.0 · Source

pub fn split_at(&self, mid: usize) -> (&[T], &[T])

Divides one slice into two at an index.

+
1.0.0 · Source

pub fn split_at(&self, mid: usize) -> (&[T], &[T])

Divides one slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

@@ -643,7 +643,7 @@
§Examplesassert_eq!(left, [1, 2, 3, 4, 5, 6]); assert_eq!(right, []); }
-
1.79.0 · Source

pub unsafe fn split_at_unchecked(&self, mid: usize) -> (&[T], &[T])

Divides one slice into two at an index, without doing bounds checking.

+
1.79.0 · Source

pub unsafe fn split_at_unchecked(&self, mid: usize) -> (&[T], &[T])

Divides one slice into two at an index, without doing bounds checking.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

@@ -672,7 +672,7 @@
§Examplesassert_eq!(left, [1, 2, 3, 4, 5, 6]); assert_eq!(right, []); }
-
1.80.0 · Source

pub fn split_at_checked(&self, mid: usize) -> Option<(&[T], &[T])>

Divides one slice into two at an index, returning None if the slice is +

1.80.0 · Source

pub fn split_at_checked(&self, mid: usize) -> Option<(&[T], &[T])>

Divides one slice into two at an index, returning None if the slice is too short.

If mid ≤ len returns a pair of slices where the first will contain all indices from [0, mid) (excluding the index mid itself) and the @@ -701,7 +701,7 @@

§Examplesassert_eq!(None, v.split_at_checked(7));
-
1.0.0 · Source

pub fn split<F>(&self, pred: F) -> Split<'_, T, F>
where +

1.0.0 · Source

pub fn split<F>(&self, pred: F) -> Split<'_, T, F>
where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred. The matched element is not contained in the subslices.

§Examples
@@ -732,7 +732,7 @@
§Examplesassert_eq!(iter.next().unwrap(), &[]); assert_eq!(iter.next().unwrap(), &[20]); assert!(iter.next().is_none());
-
1.51.0 · Source

pub fn split_inclusive<F>(&self, pred: F) -> SplitInclusive<'_, T, F>
where +

1.51.0 · Source

pub fn split_inclusive<F>(&self, pred: F) -> SplitInclusive<'_, T, F>
where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred. The matched element is contained in the end of the previous subslice as a terminator.

@@ -753,7 +753,7 @@
§Examplesassert_eq!(iter.next().unwrap(), &[3]); assert_eq!(iter.next().unwrap(), &[10, 40, 33]); assert!(iter.next().is_none());
-
1.27.0 · Source

pub fn rsplit<F>(&self, pred: F) -> RSplit<'_, T, F>
where +

1.27.0 · Source

pub fn rsplit<F>(&self, pred: F) -> RSplit<'_, T, F>
where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred, starting at the end of the slice and working backwards. The matched element is not contained in the subslices.

@@ -774,7 +774,7 @@
§Examplesassert_eq!(it.next().unwrap(), &[1, 1]); assert_eq!(it.next().unwrap(), &[]); assert_eq!(it.next(), None);
-
1.0.0 · Source

pub fn splitn<F>(&self, n: usize, pred: F) -> SplitN<'_, T, F>
where +

1.0.0 · Source

pub fn splitn<F>(&self, n: usize, pred: F) -> SplitN<'_, T, F>
where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred, limited to returning at most n items. The matched element is not contained in the subslices.

@@ -789,7 +789,7 @@
§Examplesfor group in v.splitn(2, |num| *num % 3 == 0) { println!("{group:?}"); }
-
1.0.0 · Source

pub fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<'_, T, F>
where +

1.0.0 · Source

pub fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<'_, T, F>
where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred limited to returning at most n items. This starts at the end of the slice and works backwards. The matched element is not contained in @@ -805,7 +805,7 @@

§Examplesfor group in v.rsplitn(2, |num| *num % 3 == 0) { println!("{group:?}"); }
-
Source

pub fn split_once<F>(&self, pred: F) -> Option<(&[T], &[T])>
where +

Source

pub fn split_once<F>(&self, pred: F) -> Option<(&[T], &[T])>
where F: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (slice_split_once)

Splits the slice on the first element that matches the specified predicate.

If any matching elements are present in the slice, returns the prefix @@ -819,7 +819,7 @@

§Examples&[3, 2, 4][..] ))); assert_eq!(s.split_once(|&x| x == 0), None);
-
Source

pub fn rsplit_once<F>(&self, pred: F) -> Option<(&[T], &[T])>
where +

Source

pub fn rsplit_once<F>(&self, pred: F) -> Option<(&[T], &[T])>
where F: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (slice_split_once)

Splits the slice on the last element that matches the specified predicate.

If any matching elements are present in the slice, returns the prefix @@ -833,7 +833,7 @@

§Examples&[4][..] ))); assert_eq!(s.rsplit_once(|&x| x == 0), None);
-
1.0.0 · Source

pub fn contains(&self, x: &T) -> bool
where +

1.0.0 · Source

pub fn contains(&self, x: &T) -> bool
where T: PartialEq,

Returns true if the slice contains an element with the given value.

This operation is O(n).

Note that if you have a sorted slice, binary_search may be faster.

@@ -848,7 +848,7 @@
§Examples
let v = [String::from("hello"), String::from("world")]; // slice of `String`
 assert!(v.iter().any(|e| e == "hello")); // search with `&str`
 assert!(!v.iter().any(|e| e == "hi"));
-
1.0.0 · Source

pub fn starts_with(&self, needle: &[T]) -> bool
where +

1.0.0 · Source

pub fn starts_with(&self, needle: &[T]) -> bool
where T: PartialEq,

Returns true if needle is a prefix of the slice or equal to the slice.

§Examples
let v = [10, 40, 30];
@@ -863,7 +863,7 @@ 
§Examplesassert!(v.starts_with(&[]));
 let v: &[u8] = &[];
 assert!(v.starts_with(&[]));
-
1.0.0 · Source

pub fn ends_with(&self, needle: &[T]) -> bool
where +

1.0.0 · Source

pub fn ends_with(&self, needle: &[T]) -> bool
where T: PartialEq,

Returns true if needle is a suffix of the slice or equal to the slice.

§Examples
let v = [10, 40, 30];
@@ -878,7 +878,7 @@ 
§Examplesassert!(v.ends_with(&[]));
 let v: &[u8] = &[];
 assert!(v.ends_with(&[]));
-
1.51.0 · Source

pub fn strip_prefix<P>(&self, prefix: &P) -> Option<&[T]>
where +

1.51.0 · Source

pub fn strip_prefix<P>(&self, prefix: &P) -> Option<&[T]>
where P: SlicePattern<Item = T> + ?Sized, T: PartialEq,

Returns a subslice with the prefix removed.

If the slice starts with prefix, returns the subslice after the prefix, wrapped in Some. @@ -896,7 +896,7 @@

§Exampleslet prefix : &str = "he"; assert_eq!(b"hello".strip_prefix(prefix.as_bytes()), Some(b"llo".as_ref()));
-
1.51.0 · Source

pub fn strip_suffix<P>(&self, suffix: &P) -> Option<&[T]>
where +

1.51.0 · Source

pub fn strip_suffix<P>(&self, suffix: &P) -> Option<&[T]>
where P: SlicePattern<Item = T> + ?Sized, T: PartialEq,

Returns a subslice with the suffix removed.

If the slice ends with suffix, returns the subslice before the suffix, wrapped in Some. @@ -910,7 +910,7 @@

§Examplesassert_eq!(v.strip_suffix(&[10, 40, 30]), Some(&[][..])); assert_eq!(v.strip_suffix(&[50]), None); assert_eq!(v.strip_suffix(&[50, 30]), None);
-

Binary searches this slice for a given element. If the slice is not sorted, the returned result is unspecified and meaningless.

@@ -965,7 +965,7 @@
§Exampless.insert(idx, num); assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
-
1.0.0 · Source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where +

1.0.0 · Source

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>
where F: FnMut(&'a T) -> Ordering,

Binary searches this slice with a comparator function.

The comparator function should return an order code that indicates whether its argument is Less, Equal or Greater the desired @@ -997,7 +997,7 @@

§Exampleslet seek = 1; let r = s.binary_search_by(|probe| probe.cmp(&seek)); assert!(match r { Ok(1..=4) => true, _ => false, });
-
1.10.0 · Source

pub fn binary_search_by_key<'a, B, F>( +

1.10.0 · Source

pub fn binary_search_by_key<'a, B, F>( &'a self, b: &B, f: F, @@ -1031,7 +1031,7 @@

§Examplesassert_eq!(s.binary_search_by_key(&100, |&(a, b)| b), Err(13)); let r = s.binary_search_by_key(&1, |&(a, b)| b); assert!(match r { Ok(1..=4) => true, _ => false, }); -
1.30.0 · Source

pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

Transmutes the slice to a slice of another type, ensuring alignment of the types is +

1.30.0 · Source

pub unsafe fn align_to<U>(&self) -> (&[T], &[U], &[T])

Transmutes the slice to a slice of another type, ensuring alignment of the types is maintained.

This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle part will be as big as possible under @@ -1051,7 +1051,7 @@

§Examples}
-
Source

pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
where +

Source

pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])
where Simd<T, LANES>: AsRef<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

🔬This is a nightly-only experimental API. (portable_simd)

Splits a slice into a prefix, a middle of aligned SIMD types, and a suffix.

@@ -1092,7 +1092,7 @@
§Exampleslet numbers: Vec<f32> = (1..101).map(|x| x as _).collect(); assert_eq!(basic_simd_sum(&numbers[1..99]), 4949.0);
-
1.82.0 · Source

pub fn is_sorted(&self) -> bool
where +

1.82.0 · Source

pub fn is_sorted(&self) -> bool
where T: PartialOrd,

Checks if the elements of this slice are sorted.

That is, for each element a and its following element b, a <= b must hold. If the slice yields exactly zero or one element, true is returned.

@@ -1107,7 +1107,7 @@
§Examplesassert!([0].is_sorted()); assert!(empty.is_sorted()); assert!(![0.0, 1.0, f32::NAN].is_sorted());
-
1.82.0 · Source

pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
where +

1.82.0 · Source

pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool
where F: FnMut(&'a T, &'a T) -> bool,

Checks if the elements of this slice are sorted using the given comparator function.

Instead of using PartialOrd::partial_cmp, this function uses the given compare function to determine whether two elements are to be considered in sorted order.

@@ -1121,7 +1121,7 @@
§Exampleslet empty: [i32; 0] = []; assert!(empty.is_sorted_by(|a, b| false)); assert!(empty.is_sorted_by(|a, b| true));
-
1.82.0 · Source

pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
where +

1.82.0 · Source

pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool
where F: FnMut(&'a T) -> K, K: PartialOrd,

Checks if the elements of this slice are sorted using the given key extraction function.

Instead of comparing the slice’s elements directly, this function compares the keys of the @@ -1130,7 +1130,7 @@

§Examples§Examples
assert!(["c", "bb", "aaa"].is_sorted_by_key(|s| s.len()));
 assert!(![-2i32, -1, 0, 3].is_sorted_by_key(|n| n.abs()));
-
1.52.0 · Source

pub fn partition_point<P>(&self, pred: P) -> usize
where +

1.52.0 · Source

pub fn partition_point<P>(&self, pred: P) -> usize
where P: FnMut(&T) -> bool,

Returns the index of the partition point according to the given predicate (the index of the first element of the second partition).

The slice is assumed to be partitioned according to the given predicate. @@ -1163,7 +1163,7 @@

§Exampleslet idx = s.partition_point(|&x| x <= num); s.insert(idx, num); assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);
-
Source

pub fn elem_offset(&self, element: &T) -> Option<usize>

🔬This is a nightly-only experimental API. (substr_range)

Returns the index that an element reference points to.

+
Source

pub fn elem_offset(&self, element: &T) -> Option<usize>

🔬This is a nightly-only experimental API. (substr_range)

Returns the index that an element reference points to.

Returns None if element does not point within the slice or if it points between elements.

This method is useful for extending slice iterators like slice::split.

Note that this uses pointer arithmetic and does not compare elements. @@ -1196,7 +1196,7 @@

§Examplesassert_eq!(arr.elem_offset(ok_elm), Some(0)); // Points to element 0 assert_eq!(arr.elem_offset(weird_elm), None); // Points between element 0 and 1
-
Source

pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

🔬This is a nightly-only experimental API. (substr_range)

Returns the range of indices that a subslice points to.

+
Source

pub fn subslice_range(&self, subslice: &[T]) -> Option<Range<usize>>

🔬This is a nightly-only experimental API. (substr_range)

Returns the range of indices that a subslice points to.

Returns None if subslice does not point within the slice or if it points between elements.

This method does not compare elements. Instead, this method finds the location in the slice that subslice was obtained from. To find the index of a subslice via comparison, instead use @@ -1221,7 +1221,7 @@

§Examplesassert_eq!(iter.next(), Some(1..3)); assert_eq!(iter.next(), Some(4..4)); assert_eq!(iter.next(), Some(5..6));
-
1.80.0 · Source

pub fn as_flattened(&self) -> &[T]

Takes a &[[T; N]], and flattens it to a &[T].

+
1.80.0 · Source

pub fn as_flattened(&self) -> &[T]

Takes a &[[T; N]], and flattens it to a &[T].

§Panics

This panics if the length of the resulting slice would overflow a usize.

This is only possible when flattening a slice of arrays of zero-sized diff --git a/iced/advanced/image/struct.Id.html b/iced/advanced/image/struct.Id.html index dd39b1f924..37844bc571 100644 --- a/iced/advanced/image/struct.Id.html +++ b/iced/advanced/image/struct.Id.html @@ -1,4 +1,4 @@ -Id in iced::advanced::image - Rust

iced::advanced::image

Struct Id

Source 
pub struct Id(/* private fields */);
Available on crate feature advanced only.
Expand description

The unique identifier of some Handle data.

+Id in iced::advanced::image - Rust
iced::advanced::image

Struct Id

Source 
pub struct Id(/* private fields */);
Available on crate feature advanced only.
Expand description

The unique identifier of some Handle data.

Trait Implementations§

Source§

impl Clone for Id

Source§

fn clone(&self) -> Id

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Id

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter. Read more
Source§

impl Hash for Id

Source§

fn hash<__H>(&self, state: &mut __H)
where __H: Hasher,

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, diff --git a/iced/advanced/image/struct.Image.html b/iced/advanced/image/struct.Image.html index 9763f2b917..b85e531bd7 100644 --- a/iced/advanced/image/struct.Image.html +++ b/iced/advanced/image/struct.Image.html @@ -1,4 +1,4 @@ -Image in iced::advanced::image - Rust
iced::advanced::image

Struct Image

Source 
pub struct Image<H = Handle> {
+Image in iced::advanced::image - Rust
iced::advanced::image
Struct Image
Source 
pub struct Image<H = Handle> {
     pub handle: H,
     pub filter_method: FilterMethod,
     pub rotation: Radians,
diff --git a/iced/advanced/image/trait.Renderer.html b/iced/advanced/image/trait.Renderer.html
index 99a7707757..9e7a0c7360 100644
--- a/iced/advanced/image/trait.Renderer.html
+++ b/iced/advanced/image/trait.Renderer.html
@@ -1,4 +1,4 @@
-Renderer in iced::advanced::image - Rust
iced::advanced::image
Trait Renderer
Source 
pub trait Renderer: Renderer {
+Renderer in iced::advanced::image - Rust
iced::advanced::image
Trait Renderer
Source 
pub trait Renderer: Renderer {
     type Handle: Clone;
 
     // Required methods
diff --git a/iced/advanced/index.html b/iced/advanced/index.html
index cbccc7d16b..2754572152 100644
--- a/iced/advanced/index.html
+++ b/iced/advanced/index.html
@@ -1,3 +1,3 @@
-iced::advanced - Rust
iced
Module advanced
Source 
Available on crate feature advanced only.
Expand description
Leverage advanced concepts like custom widgets.

+iced::advanced - Rust
iced
Module advanced
Source 
Available on crate feature advanced only.
Expand description
Leverage advanced concepts like custom widgets.

 
Re-exports§
Modules§
  • clipboard
    Access the clipboard.
  • image
    Load and draw raster graphics.
  • layout
    Position your widgets properly.
  • mouse
    Handle mouse events.
  • overlay
    Display interactive elements on top of other widgets.
  • renderer
    Write your own renderer.
  • subscription
    Write your own subscriptions.
  • svg
    Load and draw vector graphics.
  • text
    Draw and interact with text.
  • widget
    Create custom widgets and operate on them.
Structs§
  • Layout
    The bounds of a Node and its children, using absolute coordinates.
  • Shell
    A connection to the state of a shell.
  • Text
    A paragraph.
Traits§
  • Clipboard
    A buffer for short-term storage and transfer within and between
 applications.
  • Overlay
    An interactive component that can be displayed on top of other widgets.
  • Renderer
    A component that can be used by widgets to draw themselves on a screen.
  • Widget
    A component that displays information and allows interaction.

\ No newline at end of file
diff --git a/iced/advanced/layout/flex/enum.Axis.html b/iced/advanced/layout/flex/enum.Axis.html
index 1b89010387..10cc75d31f 100644
--- a/iced/advanced/layout/flex/enum.Axis.html
+++ b/iced/advanced/layout/flex/enum.Axis.html
@@ -1,4 +1,4 @@
-Axis in iced::advanced::layout::flex - Rust
iced::advanced::layout::flex
Enum Axis
Source 
pub enum Axis {
+Axis in iced::advanced::layout::flex - Rust
iced::advanced::layout::flex
Enum Axis
Source 
pub enum Axis {
     Horizontal,
     Vertical,
 }
Available on crate feature advanced only.
Expand description
The main axis of a flex layout.

diff --git a/iced/advanced/layout/flex/fn.resolve.html b/iced/advanced/layout/flex/fn.resolve.html
index a12314538d..21cf27d18b 100644
--- a/iced/advanced/layout/flex/fn.resolve.html
+++ b/iced/advanced/layout/flex/fn.resolve.html
@@ -1,4 +1,4 @@
-resolve in iced::advanced::layout::flex - Rust
iced::advanced::layout::flex
Function resolve
Source 
pub fn resolve<Message, Theme, Renderer>(
+resolve in iced::advanced::layout::flex - Rust
iced::advanced::layout::flex
Function resolve
Source 
pub fn resolve<Message, Theme, Renderer>(
     axis: Axis,
     renderer: &Renderer,
     limits: &Limits,
diff --git a/iced/advanced/layout/flex/index.html b/iced/advanced/layout/flex/index.html
index aee37deaa4..0cc1213e58 100644
--- a/iced/advanced/layout/flex/index.html
+++ b/iced/advanced/layout/flex/index.html
@@ -1,3 +1,3 @@
-iced::advanced::layout::flex - Rust
iced::advanced::layout
Module flex
Source 
Available on crate feature advanced only.
Expand description
Distribute elements using a flex-based layout.

+iced::advanced::layout::flex - Rust
iced::advanced::layout
Module flex
Source 
Available on crate feature advanced only.
Expand description
Distribute elements using a flex-based layout.

 
Enums§
  • Axis
    The main axis of a flex layout.
Functions§
  • resolve
    Computes the flex layout with the given axis and limits, applying spacing,
 padding and alignment to the items as needed.

\ No newline at end of file
diff --git a/iced/advanced/layout/fn.atomic.html b/iced/advanced/layout/fn.atomic.html
index f8b19b63ad..79a953142e 100644
--- a/iced/advanced/layout/fn.atomic.html
+++ b/iced/advanced/layout/fn.atomic.html
@@ -1,4 +1,4 @@
-atomic in iced::advanced::layout - Rust
iced::advanced::layout
Function atomic
Source 
pub fn atomic(
+atomic in iced::advanced::layout - Rust
iced::advanced::layout
Function atomic
Source 
pub fn atomic(
     limits: &Limits,
     width: impl Into<Length>,
     height: impl Into<Length>,
diff --git a/iced/advanced/layout/fn.contained.html b/iced/advanced/layout/fn.contained.html
index 03009b6f17..878f8f09c8 100644
--- a/iced/advanced/layout/fn.contained.html
+++ b/iced/advanced/layout/fn.contained.html
@@ -1,4 +1,4 @@
-contained in iced::advanced::layout - Rust
iced::advanced::layout
Function contained
Source 
pub fn contained(
+contained in iced::advanced::layout - Rust
iced::advanced::layout
Function contained
Source 
pub fn contained(
     limits: &Limits,
     width: impl Into<Length>,
     height: impl Into<Length>,
diff --git a/iced/advanced/layout/fn.next_to_each_other.html b/iced/advanced/layout/fn.next_to_each_other.html
index 5787e32993..67824945c7 100644
--- a/iced/advanced/layout/fn.next_to_each_other.html
+++ b/iced/advanced/layout/fn.next_to_each_other.html
@@ -1,4 +1,4 @@
-next_to_each_other in iced::advanced::layout - Rust
iced::advanced::layout
Function next_to_each_other
Source 
pub fn next_to_each_other(
+next_to_each_other in iced::advanced::layout - Rust
iced::advanced::layout
Function next_to_each_other
Source 
pub fn next_to_each_other(
     limits: &Limits,
     spacing: f32,
     left: impl FnOnce(&Limits) -> Node,
diff --git a/iced/advanced/layout/fn.padded.html b/iced/advanced/layout/fn.padded.html
index 5176ee90e0..4ff6bab22e 100644
--- a/iced/advanced/layout/fn.padded.html
+++ b/iced/advanced/layout/fn.padded.html
@@ -1,4 +1,4 @@
-padded in iced::advanced::layout - Rust
iced::advanced::layout
Function padded
Source 
pub fn padded(
+padded in iced::advanced::layout - Rust
iced::advanced::layout
Function padded
Source 
pub fn padded(
     limits: &Limits,
     width: impl Into<Length>,
     height: impl Into<Length>,
diff --git a/iced/advanced/layout/fn.positioned.html b/iced/advanced/layout/fn.positioned.html
index c7e5f45216..db7d63bd4d 100644
--- a/iced/advanced/layout/fn.positioned.html
+++ b/iced/advanced/layout/fn.positioned.html
@@ -1,4 +1,4 @@
-positioned in iced::advanced::layout - Rust
iced::advanced::layout
Function positioned
Source 
pub fn positioned(
+positioned in iced::advanced::layout - Rust
iced::advanced::layout
Function positioned
Source 
pub fn positioned(
     limits: &Limits,
     width: impl Into<Length>,
     height: impl Into<Length>,
diff --git a/iced/advanced/layout/fn.sized.html b/iced/advanced/layout/fn.sized.html
index 3a4b61dd21..37d8824ad1 100644
--- a/iced/advanced/layout/fn.sized.html
+++ b/iced/advanced/layout/fn.sized.html
@@ -1,4 +1,4 @@
-sized in iced::advanced::layout - Rust
iced::advanced::layout
Function sized
Source 
pub fn sized(
+sized in iced::advanced::layout - Rust
iced::advanced::layout
Function sized
Source 
pub fn sized(
     limits: &Limits,
     width: impl Into<Length>,
     height: impl Into<Length>,
diff --git a/iced/advanced/layout/index.html b/iced/advanced/layout/index.html
index 950b04f5b1..530848c1b0 100644
--- a/iced/advanced/layout/index.html
+++ b/iced/advanced/layout/index.html
@@ -1,4 +1,4 @@
-iced::advanced::layout - Rust
iced::advanced
Module layout
Source 
Available on crate feature advanced only.
Expand description
Position your widgets properly.

+iced::advanced::layout - Rust
iced::advanced
Module layout
Source 
Available on crate feature advanced only.
Expand description
Position your widgets properly.

 
Modules§
  • flex
    Distribute elements using a flex-based layout.
Structs§
  • Layout
    The bounds of a Node and its children, using absolute coordinates.
  • Limits
    A set of size constraints for layouting.
  • Node
    The bounds of an element and its children.
Functions§