Class CheckDirty

  • All Implemented Interfaces:
    java.awt.event.ActionListener , java.util.EventListener , org.apache.jmeter.gui.action.Command , org.apache.jorphan.collections.HashTreeTraverser

    @AutoService(value = Command.class) 
    public class CheckDirty
    extends AbstractAction implements HashTreeTraverser, ActionListener
                        

    Check if the TestPlan has been changed since it was last saved

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description
    • Field Summary

      Fields 
      Modifier and Type Field Description
    • Constructor Summary

      Constructors 
      Constructor Description
      CheckDirty()
    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description
    • Method Summary

      Modifier and Type Method Description
      void actionPerformed(ActionEvent e)
      void doAction(ActionEvent e)
      void addNode(Object node, HashTree subTree) The tree traverses itself depth-first, calling addNode for each object it encounters as it goes.
      void subtractNode() Indicates traversal has moved up a step, and the visitor should remove the top node from it's stack structure.
      void processPath() Process path is called when a leaf is reached.
      Set<String> getActionNames()
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • CheckDirty

        CheckDirty()
    • Method Detail

      • addNode

         void addNode(Object node, HashTree subTree)

        The tree traverses itself depth-first, calling addNode for each object it encounters as it goes.

      • subtractNode

         void subtractNode()

        Indicates traversal has moved up a step, and the visitor should remove the top node from it's stack structure.

      • processPath

         void processPath()

        Process path is called when a leaf is reached. If a visitor wishes to generate Lists of path elements to each leaf, it should keep a Stack data structure of nodes passed to it with addNode, and removing top items for every subtractNode() call.