Packages

  • package root
    Definition Classes
    root
  • package org
    Definition Classes
    root
  • package opalj

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode.

    OPAL is a Scala-based framework for the static analysis, manipulation and creation of Java bytecode. OPAL is designed with performance, scalability and adaptability in mind.

    Its main components are:

    • a library (Common) which provides generally useful data-structures and algorithms for static analyses.
    • a framework for implementing lattice based static analyses (Static Analysis Infrastructure)
    • a framework for parsing Java bytecode (Bytecode Infrastructure - org.opalj.bi) that can be used to create arbitrary representations.
    • a library to create a one-to-one in-memory representation of Java bytecode (Bytecode Disassembler - org.opalj.da).
    • a library to convert this representation to Java class files (Bytecode Creator - org.opalj.bc).
    • a library to create a representation of Java bytecode that facilitates writing simple static analyses (Bytecode Representation - org.opalj.br).
    • a library to create a stackless, three-address code representation of Java bytecode that facilitates writing complex static analyses (Three Address Code - org.opalj.tac).
    • a scalable, easily customizable framework for the abstract interpretation of Java bytecode (Abstract Interpretation Framework - org.opalj.ai).
    • a library to extract dependencies between code elements (Dependencies Extraction - org.opalj.de) and to facilitate checking architecture definitions (Architecture Validation - org.opalj.av).
    • a library for the lightweight manipulation and creation of Java bytecode (Bytecode Assembler - org.opalj.ba).
    • a library for parsing Android packages (APK - org.opalj.apk).
    • libraries for writing static analyses using the interprocedural finite distributive subset (IFDS - org.opalj.ifds) and interprocedural distributive environment (IDE - org.opal.ide) algorithms.

    General Design Decisions

    Thread Safety

    Unless explicitly noted, OPAL is thread safe. I.e., the classes defined by OPAL can be considered to be thread safe unless otherwise stated. (For example, it is possible to read and process class files concurrently without explicit synchronization on the client side.)

    No null Values

    Unless explicitly noted, OPAL does not null values I.e., fields that are accessible will never contain null values and methods will never return null. If a method accepts null as a value for a parameter or returns a null value it is always explicitly documented. In general, the behavior of methods that are passed null values is undefined unless explicitly documented.

    No Typecasts for Collections

    For efficiency reasons, OPAL sometimes uses mutable data-structures internally. After construction time, these data-structures are generally represented using their generic interfaces (e.g., scala.collection.{Set,Map}). However, a downcast (e.g., to add/remove elements) is always forbidden as it would effectively prevent thread-safety.

    Assertions

    OPAL makes heavy use of Scala's Assertion Facility to facilitate writing correct code. Hence, for production builds (after thorough testing(!)) it is highly recommend to build OPAL again using -Xdisable-assertions.

    Definition Classes
    org
  • package br

    In this representation of Java bytecode references to a Java class file's constant pool and to attributes are replaced by direct references to the corresponding constant pool entries.

    In this representation of Java bytecode references to a Java class file's constant pool and to attributes are replaced by direct references to the corresponding constant pool entries. This facilitates developing analyses and fosters comprehension.

    Based on the fact that indirect references to constant pool entries are resolved and replaced by direct references this representation is called the resolved representation.

    This representation of Java bytecode is considered as OPAL's standard representation for writing simple Scala based analyses. This representation is engineered such that it facilitates writing analyses that use pattern matching.

    Definition Classes
    opalj
  • package fpcf
    Definition Classes
    br
  • package properties
    Definition Classes
    fpcf
  • package string
    Definition Classes
    properties
  • CachedHashCode
  • CachedSimplifyNode
  • SeqBasedStringTreeOr
  • SetBasedStringTreeOr
  • SimpleStringTreeNode
  • StringConstancyLevel
  • StringConstancyProperty
  • StringConstancyPropertyMetaInformation
  • StringTreeConcat
  • StringTreeConst
  • StringTreeDynamicFloat
  • StringTreeDynamicInt
  • StringTreeDynamicString
  • StringTreeEmptyConst
  • StringTreeInvalidElement
  • StringTreeNode
  • StringTreeNull
  • StringTreeOr
  • StringTreeParameter
o

org.opalj.br.fpcf.properties.string

StringTreeDynamicFloat

object StringTreeDynamicFloat extends SimpleStringTreeNode

Source
StringTreeNode.scala
Linear Supertypes
SimpleStringTreeNode, StringTreeNode, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StringTreeDynamicFloat
  2. SimpleStringTreeNode
  3. StringTreeNode
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. final val children: Iterable[StringTreeNode]
    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
  7. def constancyLevel: StringConstancyLevel

    returns

    The constancy level of the string tree.

    Definition Classes
    StringTreeDynamicFloat → StringTreeNode
    See also

    StringConstancyLevel

  8. def createNew(children: Iterable[StringTreeNode]): StringTreeNode

    returns

    A new StringTreeNode (of the same type if applicable) with the given children

    Attributes
    protected
    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  9. final lazy val depth: Int

    The depth of the string tree measured by the count of nodes on the longest path from the root to a leaf.

    The depth of the string tree measured by the count of nodes on the longest path from the root to a leaf.

    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  12. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  14. def isEmpty: Boolean

    returns

    True if this string tree node represents an empty string, false otherwise.

    Definition Classes
    StringTreeNode
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. def isInvalid: Boolean

    returns

    True if this string tree node represents no string, false otherwise.

    Definition Classes
    StringTreeNode
  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  20. lazy val parameterIndices: Set[Int]

    The indices of any method parameter references using StringTreeParameter within the string tree.

    The indices of any method parameter references using StringTreeParameter within the string tree.

    Definition Classes
    StringTreeNode
  21. final lazy val regex: String

    returns

    The canonical reduction of the string tree, i.e. a regex representing the same set of string values as the tree itself.

    Definition Classes
    StringTreeNode
  22. final def replaceAtDepth(targetDepth: Int, replacement: StringTreeNode): StringTreeNode

    Replaces string tree nodes at the target depth if they have children.

    Replaces string tree nodes at the target depth if they have children. In case a SimpleStringTreeNode is given as a second parameter, this effectively limits the string tree to the given target depth.

    targetDepth

    The depth at which nodes should be replaced if they have children.

    replacement

    The replacement to set for nodes at the target depth if they have children.

    returns

    The modified tree if the target depth is smaller than the current depth or the same instance if it is not.

    Definition Classes
    StringTreeNode
  23. def replaceInChildren(targetDepth: Int, replacement: StringTreeNode): StringTreeNode
    Attributes
    protected
    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  24. final def replaceParameters(parameters: Map[Int, StringTreeNode]): StringTreeNode

    Replaces all StringTreeParameter instances in the string tree that represent a parameter index defined in the given map with the replacement value for that index.

    Replaces all StringTreeParameter instances in the string tree that represent a parameter index defined in the given map with the replacement value for that index. Keeps StringTreeParameter instances whose their index is not defined in the map.

    parameters

    A map from parameter indices to replacement values

    returns

    The modified string tree if something could be replaced or the same instance otherwise.

    Definition Classes
    StringTreeNode
  25. def replaceParametersInChildren(parameters: Map[Int, StringTreeNode]): StringTreeNode
    Attributes
    protected
    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  26. final def simplified: StringTreeNode

    Simplifies the string tree by e.g.

    Simplifies the string tree by e.g. flattening nested StringTreeOr instances.

    returns

    The simplified string tree or the same instance if nothing could be simplified.

    Definition Classes
    SimpleStringTreeNode → StringTreeNode
    See also

    CachedSimplifyNode

  27. final def sorted: StringTreeNode

    returns

    The string tree sorted with a stable ordering over its canonical reduction.

    Definition Classes
    SimpleStringTreeNode → StringTreeNode
  28. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  29. def toRegex: String
    Attributes
    protected
    Definition Classes
    StringTreeDynamicFloat → StringTreeNode
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated @Deprecated
    Deprecated

Inherited from SimpleStringTreeNode

Inherited from StringTreeNode

Inherited from AnyRef

Inherited from Any

Ungrouped