Struct xpcom::interfaces::nsIAccessibleTraversalRule

#[repr(C)]
pub struct nsIAccessibleTraversalRule { /* fields omitted */ }

interface nsIAccessibleTraversalRule : nsISupports

Methods

impl nsIAccessibleTraversalRule

pub fn coerce<T: nsIAccessibleTraversalRuleCoerce>(&self) -> &T

Cast this nsIAccessibleTraversalRule to one of its base interfaces.

impl nsIAccessibleTraversalRule

pub const FILTER_IGNORE: i64

FILTER_IGNORE: i64 = 0

pub const FILTER_MATCH: i64

FILTER_MATCH: i64 = 1

pub const FILTER_IGNORE_SUBTREE: i64

FILTER_IGNORE_SUBTREE: i64 = 2

pub const PREFILTER_INVISIBLE: i64

PREFILTER_INVISIBLE: i64 = 1

pub const PREFILTER_OFFSCREEN: i64

PREFILTER_OFFSCREEN: i64 = 2

pub const PREFILTER_NOT_FOCUSABLE: i64

PREFILTER_NOT_FOCUSABLE: i64 = 4

pub const PREFILTER_ARIA_HIDDEN: i64

PREFILTER_ARIA_HIDDEN: i64 = 8

pub const PREFILTER_TRANSPARENT: i64

PREFILTER_TRANSPARENT: i64 = 16

pub unsafe fn GetPreFilter(&self, aPreFilter: *mut uint32_t) -> nsresult

/**
   * Pre-filter bitfield to filter out obviously ignorable nodes and lighten
   * the load on match().
   */

readonly attribute unsigned long preFilter;

pub unsafe fn GetMatchRoles(
    &self,
    aRoles: *mut *mut uint32_t,
    aCount: *mut uint32_t
) -> nsresult

/**
   * Retrieve a list of roles that the traversal rule should test for. Any node
   * with a role not in this list will automatically be ignored. An empty list
   * will match all roles. It should be assumed that this method is called once
   * at the start of a traversal, so changing the method's return result after
   * that would have no affect.
   *
   * @param aRoles [out] an array of the roles to match.
   * @param aCount [out] the length of the array.
   */

void getMatchRoles ([array, size_is (aCount)] out unsigned long aRoles, [retval] out unsigned long aCount);

pub unsafe fn Match(
    &self,
    aAccessible: *const nsIAccessible,
    _retval: *mut uint16_t
) -> nsresult

/**
   * Determines if a given accessible is to be accepted in our traversal rule
   *
   * @param aAccessible [in] accessible to examine.
   * @return a bitfield of FILTER_MATCH and FILTER_IGNORE_SUBTREE.
   */

unsigned short match (in nsIAccessible aAccessible);

Methods from Deref<Target = nsISupports>

pub fn coerce<T: nsISupportsCoerce>(&self) -> &T

Cast this nsISupports to one of its base interfaces.

pub unsafe fn QueryInterface(
    &self,
    uuid: &nsIID,
    result: *mut *mut c_void
) -> nsresult

void QueryInterface (in nsIIDRef uuid, [iid_is (uuid), retval] out nsQIResult result);

pub unsafe fn AddRef(&self) -> nsrefcnt

[noscript,notxpcom] nsrefcnt AddRef ();

pub unsafe fn Release(&self) -> nsrefcnt

[noscript,notxpcom] nsrefcnt Release ();

Trait Implementations

impl XpCom for nsIAccessibleTraversalRule

const IID: nsIID

IID: nsIID = nsID(3784787469, 7935, 16967, [180, 187, 164, 59, 225, 132, 13, 174])

fn query_interface<T: XpCom>(&self) -> Option<RefPtr<T>>

Perform a QueryInterface call on this object, attempting to dynamically cast it to the requested interface type. Returns Some(RefPtr) if the cast succeeded, and None otherwise.

impl RefCounted for nsIAccessibleTraversalRule

unsafe fn addref(&self)

Increment the reference count.

unsafe fn release(&self)

Decrement the reference count, potentially freeing backing memory.

impl Deref for nsIAccessibleTraversalRule

type Target = nsISupports

The resulting type after dereferencing.

fn deref(&self) -> &nsISupports

Dereferences the value.