pub enum AdobeCompatRuleId {
SuppressEmptyPagesOnlyWhenRealDataBound,
IgnoreInvisibleServerMetadataBindingsForDataBoundSignal,
ExcludeNonDataWidgetsFromPageSuppression,
CapSuppressionByFormDomPageAreaCount,
TrimStaticXfafExcessPagesWhenLayoutIsSinglePageAndFormDomAllows,
ExcludeBindNoneFieldsFromPageDataSuppression,
RepeatingSubformInstanceCountClampedToOccurRange,
BindNoneSubformDoesNotAutoExpand,
FormDomDrivenRepeatInstanceReplication,
}Expand description
Stable identifier for a documented compatibility rule.
Variants§
SuppressEmptyPagesOnlyWhenRealDataBound
Suppress data-empty pages only after real visible data binding occurred.
IgnoreInvisibleServerMetadataBindingsForDataBoundSignal
Hidden metadata bindings do not prove user data is present.
ExcludeNonDataWidgetsFromPageSuppression
Non-data widgets are structural and should not drive empty-page drops.
CapSuppressionByFormDomPageAreaCount
Saved form DOM page counts cap page suppression.
TrimStaticXfafExcessPagesWhenLayoutIsSinglePageAndFormDomAllows
Static XFAF surplus host pages can be trimmed under conservative guards.
ExcludeBindNoneFieldsFromPageDataSuppression
Fields with <bind match="none"> are template-only and never carry
dataset values; they are excluded from the per-page “has data field”
signal used by page suppression.
RepeatingSubformInstanceCountClampedToOccurRange
Repeating subform instance count is the matched dataset record
count clamped to [occur.min, occur.max] (XFA §4.4.3, p186-192).
When data exceeds occur.max the count is capped; when data is
below occur.min the count is lifted. Acrobat enforces this
clamp on every repeating-subform expansion.
BindNoneSubformDoesNotAutoExpand
Subforms marked <bind match="none"> are not auto-expanded
from datasets even when their <occur> would otherwise allow
repetition. They remain as a single template instance; only
the scriptable InstanceManager may add more (XFA §4.4.3).
FormDomDrivenRepeatInstanceReplication
When the saved form DOM records more repeating-subform
instances than the template’s initial expansion produced,
the engine clones the template instance to match the form
DOM’s count. The form DOM is authoritative because it
captures the runtime’s InstanceManager decisions after
scripts executed (XFA §4.4.3 + §6.4.3).
Implementations§
Trait Implementations§
Source§impl Clone for AdobeCompatRuleId
impl Clone for AdobeCompatRuleId
Source§fn clone(&self) -> AdobeCompatRuleId
fn clone(&self) -> AdobeCompatRuleId
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for AdobeCompatRuleId
impl Debug for AdobeCompatRuleId
Source§impl Hash for AdobeCompatRuleId
impl Hash for AdobeCompatRuleId
Source§impl Ord for AdobeCompatRuleId
impl Ord for AdobeCompatRuleId
Source§fn cmp(&self, other: &AdobeCompatRuleId) -> Ordering
fn cmp(&self, other: &AdobeCompatRuleId) -> Ordering
1.21.0 (const: unstable) · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for AdobeCompatRuleId
impl PartialEq for AdobeCompatRuleId
Source§fn eq(&self, other: &AdobeCompatRuleId) -> bool
fn eq(&self, other: &AdobeCompatRuleId) -> bool
self and other values to be equal, and is used by ==.Source§impl PartialOrd for AdobeCompatRuleId
impl PartialOrd for AdobeCompatRuleId
impl Copy for AdobeCompatRuleId
impl Eq for AdobeCompatRuleId
impl StructuralPartialEq for AdobeCompatRuleId
Auto Trait Implementations§
impl Freeze for AdobeCompatRuleId
impl RefUnwindSafe for AdobeCompatRuleId
impl Send for AdobeCompatRuleId
impl Sync for AdobeCompatRuleId
impl Unpin for AdobeCompatRuleId
impl UnsafeUnpin for AdobeCompatRuleId
impl UnwindSafe for AdobeCompatRuleId
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more