Struct glib::Regex

source ·
pub struct Regex { /* private fields */ }
Expand description

A GRegex is the “compiled” form of a regular expression pattern.

GRegex implements regular expression pattern matching using syntax and semantics similar to Perl regular expression. See the PCRE documentation for the syntax definition.

Some functions accept a @start_position argument, setting it differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion. For example, consider the pattern “\Biss\B” which finds occurrences of “iss” in the middle of words. (“\B” matches only if the current position in the subject is not a word boundary.) When applied to the string “Mississipi” from the fourth byte, namely “issipi”, it does not match, because “\B” is always false at the start of the subject, which is deemed to be a word boundary. However, if the entire string is passed , but with @start_position set to 4, it finds the second occurrence of “iss” because it is able to look behind the starting point to discover that it is preceded by a letter.

Note that, unless you set the RegexCompileFlags::RAW flag, all the strings passed to these functions must be encoded in UTF-8. The lengths and the positions inside the strings are in bytes and not in characters, so, for instance, “\xc3\xa0” (i.e. “à”) is two bytes long but it is treated as a single character. If you set RegexCompileFlags::RAW the strings can be non-valid UTF-8 strings and a byte is treated as a character, so “\xc3\xa0” is two bytes and two characters long.

When matching a pattern, “\n” matches only against a “\n” character in the string, and “\r” matches only a “\r” character. To match any newline sequence use “\R”. This particular group matches either the two-character sequence CR + LF (“\r\n”), or one of the single characters LF (linefeed, U+000A, “\n”), VT vertical tab, U+000B, “\v”), FF (formfeed, U+000C, “\f”), CR (carriage return, U+000D, “\r”), NEL (next line, U+0085), LS (line separator, U+2028), or PS (paragraph separator, U+2029).

The behaviour of the dot, circumflex, and dollar metacharacters are affected by newline characters, the default is to recognize any newline character (the same characters recognized by “\R”). This can be changed with G_REGEX_NEWLINE_CR, G_REGEX_NEWLINE_LF and G_REGEX_NEWLINE_CRLF compile options, and with G_REGEX_MATCH_NEWLINE_ANY, G_REGEX_MATCH_NEWLINE_CR, G_REGEX_MATCH_NEWLINE_LF and G_REGEX_MATCH_NEWLINE_CRLF match options. These settings are also relevant when compiling a pattern if G_REGEX_EXTENDED is set, and an unescaped “#” outside a character class is encountered. This indicates a comment that lasts until after the next newline.

Creating and manipulating the same GRegex structure from different threads is not a problem as GRegex does not modify its internal state between creation and destruction, on the other hand GMatchInfo is not threadsafe.

The regular expressions low-level functionalities are obtained through the excellent PCRE library written by Philip Hazel.

GLib type: Shared boxed type with reference counted clone semantics.

Implementations§

source§

impl Regex

source

pub fn as_ptr(&self) -> *mut GRegex

Return the inner pointer to the underlying C value.

source

pub unsafe fn from_glib_ptr_borrow<'a>(ptr: *const *const GRegex) -> &'a Self

Borrows the underlying C value.

source§

impl Regex

source

pub fn new( pattern: &str, compile_options: RegexCompileFlags, match_options: RegexMatchFlags, ) -> Result<Option<Regex>, Error>

Compiles the regular expression to an internal form, and does the initial setup of the #GRegex structure.

§pattern

the regular expression

§compile_options

compile options for the regular expression, or 0

§match_options

match options for the regular expression, or 0

§Returns

a #GRegex structure or None if an error occurred. Call g_regex_unref() when you are done with it

source

pub fn capture_count(&self) -> i32

Returns the number of capturing subpatterns in the pattern.

§Returns

the number of capturing subpatterns

source

pub fn compile_flags(&self) -> RegexCompileFlags

Returns the compile options that @self was created with.

Depending on the version of PCRE that is used, this may or may not include flags set by option expressions such as (?i) found at the top-level within the compiled pattern.

§Returns

flags from #GRegexCompileFlags

source

pub fn has_cr_or_lf(&self) -> bool

Checks whether the pattern contains explicit CR or LF references.

§Returns

true if the pattern contains explicit CR or LF references

source

pub fn match_flags(&self) -> RegexMatchFlags

Returns the match options that @self was created with.

§Returns

flags from #GRegexMatchFlags

source

pub fn max_backref(&self) -> i32

Returns the number of the highest back reference in the pattern, or 0 if the pattern does not contain back references.

§Returns

the number of the highest back reference

source

pub fn max_lookbehind(&self) -> i32

Gets the number of characters in the longest lookbehind assertion in the pattern. This information is useful when doing multi-segment matching using the partial matching facilities.

§Returns

the number of characters in the longest lookbehind assertion.

source

pub fn pattern(&self) -> GString

Gets the pattern string associated with @self, i.e. a copy of the string passed to g_regex_new().

§Returns

the pattern of @self

source§

impl Regex

source

pub fn string_number(&self, name: impl IntoGStr) -> i32

Retrieves the number of the subexpression named @name.

§name

name of the subexpression

§Returns

The number of the subexpression or -1 if @name does not exists

source

pub fn escape_nul(string: impl IntoGStr) -> GString

Escapes the nul characters in @string to “\x00”. It can be used to compile a regex with embedded nul characters.

For completeness, @length can be -1 for a nul-terminated string. In this case the output string will be of course equal to @string.

§string

the string to escape

§length

the length of @string

§Returns

a newly-allocated escaped string

source

pub fn escape_string(string: impl IntoGStr) -> GString

Escapes the special characters used for regular expressions in @string, for instance “a.b*c” becomes “a.b*c”. This function is useful to dynamically generate regular expressions.

@string can contain nul characters that are replaced with “\0”, in this case remember to specify the correct length of @string in @length.

§string

the string to escape

§length

the length of @string, in bytes, or -1 if @string is nul-terminated

§Returns

a newly-allocated escaped string

source

pub fn check_replacement(replacement: impl IntoGStr) -> Result<bool, Error>

Checks whether @replacement is a valid replacement string (see g_regex_replace()), i.e. that all escape sequences in it are valid.

If @has_references is not None then @replacement is checked for pattern references. For instance, replacement text ‘foo\n’ does not contain references and may be evaluated without information about actual match, but ‘\0\1’ (whole match followed by first subpattern) requires valid #GMatchInfo object.

§replacement

the replacement string

§Returns

whether @replacement is a valid replacement string

§has_references

location to store information about references in @replacement or None

source

pub fn match_simple( pattern: impl IntoGStr, string: impl IntoGStr, compile_options: RegexCompileFlags, match_options: RegexMatchFlags, ) -> bool

Scans for a match in @string for @pattern.

This function is equivalent to g_regex_match() but it does not require to compile the pattern with g_regex_new(), avoiding some lines of code when you need just to do a match without extracting substrings, capture counts, and so on.

If this function is to be called on the same @pattern more than once, it’s more efficient to compile the pattern once with g_regex_new() and then use g_regex_match().

§pattern

the regular expression

§string

the string to scan for matches

§compile_options

compile options for the regular expression, or 0

§match_options

match options, or 0

§Returns

true if the string matched, false otherwise

source

pub fn replace( &self, string: impl IntoGStr, start_position: i32, replacement: impl IntoGStr, match_options: RegexMatchFlags, ) -> Result<GString, Error>

Replaces all occurrences of the pattern in @self with the replacement text. Backreferences of the form ‘\number’ or ‘\g’ in the replacement text are interpolated by the number-th captured subexpression of the match, ‘\g’ refers to the captured subexpression with the given name. ‘\0’ refers to the complete match, but ‘\0’ followed by a number is the octal representation of a character. To include a literal ’' in the replacement, write ‘\\’.

There are also escapes that changes the case of the following text:

  • \l: Convert to lower case the next character
  • \u: Convert to upper case the next character
  • \L: Convert to lower case till \E
  • \U: Convert to upper case till \E
  • \E: End case modification

If you do not need to use backreferences use g_regex_replace_literal().

The @replacement string must be UTF-8 encoded even if RegexCompileFlags::RAW was passed to g_regex_new(). If you want to use not UTF-8 encoded strings you can use g_regex_replace_literal().

Setting @start_position differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion, such as “\b”.

§string

the string to perform matches against

§start_position

starting index of the string to match, in bytes

§replacement

text to replace each match with

§match_options

options for the match

§Returns

a newly allocated string containing the replacements

source

pub fn match_all<'input>( &self, string: &'input GStr, match_options: RegexMatchFlags, ) -> Option<MatchInfo<'input>>

Using the standard algorithm for regular expression matching only the longest match in the string is retrieved. This function uses a different algorithm so it can retrieve all the possible matches. For more documentation see g_regex_match_all_full().

A #GMatchInfo structure, used to get information on the match, is stored in @match_info if not None. Note that if @match_info is not None then it is created even if the function returns false, i.e. you must free it regardless if regular expression actually matched.

@string is not copied and is used in #GMatchInfo internally. If you use any #GMatchInfo method (except g_match_info_free()) after freeing or modifying @string then the behaviour is undefined.

§string

the string to scan for matches

§match_options

match options

§Returns

true is the string matched, false otherwise

§match_info

pointer to location where to store the #GMatchInfo, or None if you do not need it

source

pub fn match_all_full<'input>( &self, string: &'input GStr, start_position: i32, match_options: RegexMatchFlags, ) -> Result<MatchInfo<'input>, Error>

Using the standard algorithm for regular expression matching only the longest match in the @string is retrieved, it is not possible to obtain all the available matches. For instance matching “ ” against the pattern “<.*>” you get “ ”.

This function uses a different algorithm (called DFA, i.e. deterministic finite automaton), so it can retrieve all the possible matches, all starting at the same point in the string. For instance matching “ ” against the pattern “<.*>;” you would obtain three matches: “ ”, “ ” and “”.

The number of matched strings is retrieved using g_match_info_get_match_count(). To obtain the matched strings and their position you can use, respectively, g_match_info_fetch() and g_match_info_fetch_pos(). Note that the strings are returned in reverse order of length; that is, the longest matching string is given first.

Note that the DFA algorithm is slower than the standard one and it is not able to capture substrings, so backreferences do not work.

Setting @start_position differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion, such as “\b”.

Unless RegexCompileFlags::RAW is specified in the options, @string must be valid UTF-8.

A #GMatchInfo structure, used to get information on the match, is stored in @match_info if not None. Note that if @match_info is not None then it is created even if the function returns false, i.e. you must free it regardless if regular expression actually matched.

@string is not copied and is used in #GMatchInfo internally. If you use any #GMatchInfo method (except g_match_info_free()) after freeing or modifying @string then the behaviour is undefined.

§string

the string to scan for matches

§start_position

starting index of the string to match, in bytes

§match_options

match options

§Returns

true is the string matched, false otherwise

§match_info

pointer to location where to store the #GMatchInfo, or None if you do not need it

source

pub fn match_<'input>( &self, string: &'input GStr, match_options: RegexMatchFlags, ) -> Option<MatchInfo<'input>>

source

pub fn match_full<'input>( &self, string: &'input GStr, start_position: i32, match_options: RegexMatchFlags, ) -> Result<MatchInfo<'input>, Error>

Scans for a match in @string for the pattern in @self. The @match_options are combined with the match options specified when the @self structure was created, letting you have more flexibility in reusing #GRegex structures.

Setting @start_position differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion, such as “\b”.

Unless RegexCompileFlags::RAW is specified in the options, @string must be valid UTF-8.

A #GMatchInfo structure, used to get information on the match, is stored in @match_info if not None. Note that if @match_info is not None then it is created even if the function returns false, i.e. you must free it regardless if regular expression actually matched.

@string is not copied and is used in #GMatchInfo internally. If you use any #GMatchInfo method (except g_match_info_free()) after freeing or modifying @string then the behaviour is undefined.

To retrieve all the non-overlapping matches of the pattern in string you can use g_match_info_next().

⚠️ The following code is in C ⚠️

static void
print_uppercase_words (const gchar *string)
{
  // Print all uppercase-only words.
  GRegex *regex;
  GMatchInfo *match_info;
  GError *error = NULL;

  regex = g_regex_new ("[A-Z]+", G_REGEX_DEFAULT, G_REGEX_MATCH_DEFAULT, NULL);
  g_regex_match_full (regex, string, -1, 0, 0, &match_info, &error);
  while (g_match_info_matches (match_info))
    {
      gchar *word = g_match_info_fetch (match_info, 0);
      g_print ("Found: %s\n", word);
      g_free (word);
      g_match_info_next (match_info, &error);
    }
  g_match_info_free (match_info);
  g_regex_unref (regex);
  if (error != NULL)
    {
      g_printerr ("Error while matching: %s\n", error->message);
      g_error_free (error);
    }
}
§string

the string to scan for matches

§start_position

starting index of the string to match, in bytes

§match_options

match options

§Returns

true is the string matched, false otherwise

§match_info

pointer to location where to store the #GMatchInfo, or None if you do not need it

source

pub fn replace_literal( &self, string: impl IntoGStr, start_position: i32, replacement: impl IntoGStr, match_options: RegexMatchFlags, ) -> Result<GString, Error>

Replaces all occurrences of the pattern in @self with the replacement text. @replacement is replaced literally, to include backreferences use g_regex_replace().

Setting @start_position differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion, such as “\b”.

§string

the string to perform matches against

§start_position

starting index of the string to match, in bytes

§replacement

text to replace each match with

§match_options

options for the match

§Returns

a newly allocated string containing the replacements

source

pub fn split( &self, string: impl IntoGStr, match_options: RegexMatchFlags, ) -> PtrSlice<GStringPtr>

Breaks the string on the pattern, and returns an array of the tokens. If the pattern contains capturing parentheses, then the text for each of the substrings will also be returned. If the pattern does not match anywhere in the string, then the whole string is returned as the first token.

As a special case, the result of splitting the empty string “” is an empty vector, not a vector containing a single string. The reason for this special case is that being able to represent an empty vector is typically more useful than consistent handling of empty elements. If you do need to represent empty elements, you’ll need to check for the empty string before calling this function.

A pattern that can match empty strings splits @string into separate characters wherever it matches the empty string between characters. For example splitting “ab c” using as a separator “\s*”, you will get “a”, “b” and “c”.

§string

the string to split with the pattern

§match_options

match time option flags

§Returns

a None-terminated gchar ** array. Free it using g_strfreev()

source

pub fn split_full( &self, string: impl IntoGStr, start_position: i32, match_options: RegexMatchFlags, max_tokens: i32, ) -> Result<PtrSlice<GStringPtr>, Error>

Breaks the string on the pattern, and returns an array of the tokens. If the pattern contains capturing parentheses, then the text for each of the substrings will also be returned. If the pattern does not match anywhere in the string, then the whole string is returned as the first token.

As a special case, the result of splitting the empty string “” is an empty vector, not a vector containing a single string. The reason for this special case is that being able to represent an empty vector is typically more useful than consistent handling of empty elements. If you do need to represent empty elements, you’ll need to check for the empty string before calling this function.

A pattern that can match empty strings splits @string into separate characters wherever it matches the empty string between characters. For example splitting “ab c” using as a separator “\s*”, you will get “a”, “b” and “c”.

Setting @start_position differs from just passing over a shortened string and setting RegexMatchFlags::NOTBOL in the case of a pattern that begins with any kind of lookbehind assertion, such as “\b”.

§string

the string to split with the pattern

§start_position

starting index of the string to match, in bytes

§match_options

match time option flags

§max_tokens

the maximum number of tokens to split @string into. If this is less than 1, the string is split completely

§Returns

a None-terminated gchar ** array. Free it using g_strfreev()

source

pub fn split_simple( pattern: impl IntoGStr, string: impl IntoGStr, compile_options: RegexCompileFlags, match_options: RegexMatchFlags, ) -> PtrSlice<GStringPtr>

Breaks the string on the pattern, and returns an array of the tokens. If the pattern contains capturing parentheses, then the text for each of the substrings will also be returned. If the pattern does not match anywhere in the string, then the whole string is returned as the first token.

This function is equivalent to g_regex_split() but it does not require to compile the pattern with g_regex_new(), avoiding some lines of code when you need just to do a split without extracting substrings, capture counts, and so on.

If this function is to be called on the same @pattern more than once, it’s more efficient to compile the pattern once with g_regex_new() and then use g_regex_split().

As a special case, the result of splitting the empty string “” is an empty vector, not a vector containing a single string. The reason for this special case is that being able to represent an empty vector is typically more useful than consistent handling of empty elements. If you do need to represent empty elements, you’ll need to check for the empty string before calling this function.

A pattern that can match empty strings splits @string into separate characters wherever it matches the empty string between characters. For example splitting “ab c” using as a separator “\s*”, you will get “a”, “b” and “c”.

§pattern

the regular expression

§string

the string to scan for matches

§compile_options

compile options for the regular expression, or 0

§match_options

match options, or 0

§Returns

a None-terminated array of strings. Free it using g_strfreev()

Trait Implementations§

source§

impl Clone for Regex

source§

fn clone(&self) -> Self

Makes a clone of this shared reference.

This increments the strong reference count of the reference. Dropping the reference will decrement it again.

1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for Regex

source§

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

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

impl From<Regex> for Value

source§

fn from(s: Regex) -> Self

Converts to this type from the input type.
source§

impl HasParamSpec for Regex

§

type ParamSpec = ParamSpecBoxed

§

type SetValue = Regex

Preferred value to be used as setter for the associated ParamSpec.
§

type BuilderFn = fn(_: &str) -> ParamSpecBoxedBuilder<'_, Regex>

source§

fn param_spec_builder() -> Self::BuilderFn

source§

impl Hash for Regex

source§

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

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, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
source§

impl Ord for Regex

source§

fn cmp(&self, other: &Regex) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where Self: Sized,

Compares and returns the maximum of two values. Read more
1.21.0 · source§

fn min(self, other: Self) -> Self
where Self: Sized,

Compares and returns the minimum of two values. Read more
1.50.0 · source§

fn clamp(self, min: Self, max: Self) -> Self
where Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more
source§

impl PartialEq for Regex

source§

fn eq(&self, other: &Regex) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl PartialOrd for Regex

source§

fn partial_cmp(&self, other: &Regex) -> Option<Ordering>

This method returns an ordering between self and other values if one exists. Read more
1.0.0 · source§

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 · source§

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
1.0.0 · source§

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more
1.0.0 · source§

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more
source§

impl StaticType for Regex

source§

fn static_type() -> Type

Returns the type identifier of Self.
source§

impl Eq for Regex

source§

impl StructuralPartialEq for Regex

Auto Trait Implementations§

§

impl Freeze for Regex

§

impl RefUnwindSafe for Regex

§

impl !Send for Regex

§

impl !Sync for Regex

§

impl Unpin for Regex

§

impl UnwindSafe for Regex

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GList> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *const GList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec(_: *const GList, _: usize) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(_: *const GList, _: usize) -> Vec<T>

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GPtrArray> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *const GPtrArray, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec( _: *const GPtrArray, _: usize, ) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(_: *const GPtrArray, _: usize) -> Vec<T>

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GSList> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *const GSList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec(_: *const GSList, _: usize) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(_: *const GSList, _: usize) -> Vec<T>

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GList> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *mut GList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec(ptr: *mut GList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(ptr: *mut GList, num: usize) -> Vec<T>

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GPtrArray> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *mut GPtrArray, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec( ptr: *mut GPtrArray, num: usize, ) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(ptr: *mut GPtrArray, num: usize) -> Vec<T>

source§

impl<T> FromGlibContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GSList> for T

source§

unsafe fn from_glib_none_num_as_vec(ptr: *mut GSList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_container_num_as_vec(ptr: *mut GSList, num: usize) -> Vec<T>

source§

unsafe fn from_glib_full_num_as_vec(ptr: *mut GSList, num: usize) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GList> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *const GList) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(_: *const GList) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(_: *const GList) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GPtrArray> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *const GPtrArray) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(_: *const GPtrArray) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(_: *const GPtrArray) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *const GSList> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *const GSList) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(_: *const GSList) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(_: *const GSList) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GList> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *mut GList) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(ptr: *mut GList) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(ptr: *mut GList) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GPtrArray> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *mut GPtrArray) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(ptr: *mut GPtrArray) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(ptr: *mut GPtrArray) -> Vec<T>

source§

impl<T> FromGlibPtrArrayContainerAsVec<<T as GlibPtrDefault>::GlibType, *mut GSList> for T

source§

unsafe fn from_glib_none_as_vec(ptr: *mut GSList) -> Vec<T>

source§

unsafe fn from_glib_container_as_vec(ptr: *mut GSList) -> Vec<T>

source§

unsafe fn from_glib_full_as_vec(ptr: *mut GSList) -> Vec<T>

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoClosureReturnValue for T
where T: Into<Value>,

source§

impl<T> Property for T
where T: HasParamSpec,

§

type Value = T

source§

impl<T> PropertyGet for T
where T: HasParamSpec,

§

type Value = T

source§

fn get<R, F>(&self, f: F) -> R
where F: Fn(&<T as PropertyGet>::Value) -> R,

source§

impl<T> StaticTypeExt for T
where T: StaticType,

source§

fn ensure_type()

Ensures that the type has been registered with the type system.
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T> TransparentType for T

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T> TryFromClosureReturnValue for T
where T: for<'a> FromValue<'a> + StaticType + 'static,

source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<'a, T, C, E> FromValueOptional<'a> for T
where T: FromValue<'a, Checker = C>, C: ValueTypeChecker<Error = ValueTypeMismatchOrNoneError<E>>, E: Error + Send + 'static,