xmltree methods
play

XMLTree Methods 7 January 2019 OSU CSE 1 Methods for XMLTree All - PowerPoint PPT Presentation

Mar 15, 2024 •470 likes •1.14k views

XMLTree Methods 7 January 2019 OSU CSE 1 Methods for XMLTree All the methods for XMLTree are instance methods , i.e., you call them as follows: t.methodName(arguments) where t is an initialized variable of type XMLTree 7 January 2019 OSU

  1. XMLTree Methods 7 January 2019 OSU CSE 1

  2. Methods for XMLTree • All the methods for XMLTree are instance methods , i.e., you call them as follows: t.methodName(arguments) where t is an initialized variable of type XMLTree 7 January 2019 OSU CSE 2

  3. Methods for XMLTree • All the methods for XMLTree are instance methods , i.e., you call them as follows: t.methodName(arguments) where t is an initialized variable of type t is called the receiver of the call; for all instance methods, the XMLTree corresponding distinguished formal parameter implicitly has the name this . 7 January 2019 OSU CSE 3

  4. Implementations of XMLTree • There are two different classes that implement the XMLTree interface contract, and you may use either one: XMLTree1 or XMLTree2 • This choice is made when you initialize a variable of type XMLTree , where you must use the name of one of these implementation classes as the name of the constructor 7 January 2019 OSU CSE 4

  5. Implementations of XMLTree • There are two different classes that implement the XMLTree interface contract, and you may use either one: XMLTree1 or XMLTree2 • This choice is made when you initialize a variable of type XMLTree , where you must The behavior of an XMLTree does not depend on which use the name of one of these implementation you choose; this is a implementation classes as the name of the key benefit of design-by-contract! constructor 7 January 2019 OSU CSE 5

  6. Interface and Implementing Classes XMLTree implements implements XMLTree1 XMLTree2 7 January 2019 OSU CSE 6

  7. Interface and Implementing Classes XMLTree implements implements The interface XMLTree has method XMLTree1 XMLTree2 signatures and contracts for methods. 7 January 2019 OSU CSE 7

  8. Interface and Implementing Classes XMLTree The class XMLTree1 has method bodies; similarly XMLTree2 . implements implements XMLTree1 XMLTree2 7 January 2019 OSU CSE 8

  9. Interface and Implementing Classes The method bodies in XMLTree XMLTree1 implement the method contracts in implements implements XMLTree . XMLTree1 XMLTree2 7 January 2019 OSU CSE 9

  10. Interface and Implementing Classes The method bodies in XMLTree XMLTree2 implement the method contracts in implements implements XMLTree . XMLTree1 XMLTree2 7 January 2019 OSU CSE 10

  11. Mathematical Model • The value of an XMLTree variable is modeled as a tree of nodes whose labels are explained in the previous set of slides • Note that this model is described informally, though it could be formalized into mathematical notation (which we will not do here) 7 January 2019 OSU CSE 11

  12. Constructors • There are two constructors for each implementation class • The name of the constructor is the name of the implementation class • Constructors differ only in their parameters • For XMLTree , we will use only the constructor that takes one String parameter, either: – The name of an XML file on your computer – The URL of an XML file or an XML source on the web 7 January 2019 OSU CSE 12

  13. Constructors • A constructor call has the keyword new before the constructor name and is an expression, e.g.: new XMLTree1("foo.xml") • The value of this expression is determined by the contract for the constructor – In this case, the contract says the value is an XMLTree corresponding to the XML document named by the String parameter 7 January 2019 OSU CSE 13

  14. Example Code State XMLTree t = new XMLTree1("foo.xml"); 7 January 2019 OSU CSE 14

  15. Example See the slides on the XMLTree model for a description of the tree Code State that arises from an XML document. XMLTree t = new XMLTree1("foo.xml"); t = [tree from file "foo.xml"] 7 January 2019 OSU CSE 15

  16. label String label ( ) • Returns the label of the root of this . • Ensures: label = [the label of the root of this (not including < > for tags)] 7 January 2019 OSU CSE 16

  17. Example: Label is a Tag Code State t = [tree for book XML example] String s = t.label(); 7 January 2019 OSU CSE 17

  18. Example: Label is a Tag Code State t = [tree for book XML example] String s = t.label(); 7 January 2019 OSU CSE 18

  19. Example: Label is a Tag Code State t = [tree for book XML example] String s = t.label(); t = [unchanged] s = "book" 7 January 2019 OSU CSE 19

  20. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] String s = t.label(); 7 January 2019 OSU CSE 20

  21. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] String s = t.label(); 7 January 2019 OSU CSE 21

  22. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] String s = t.label(); t = [unchanged] s = "Java for Everyone: Late Objects" 7 January 2019 OSU CSE 22

  23. isTag boolean isTag( ) • Returns whether the label of the root of this is a tag. • Ensures: isTag = [the label of the root of this is a tag] 7 January 2019 OSU CSE 23

  24. Example: Label is a Tag Code State t = [tree for book XML example] boolean b = t.isTag(); 7 January 2019 OSU CSE 24

  25. Example: Label is a Tag Code State t = [tree for book XML example] boolean b = t.isTag(); 7 January 2019 OSU CSE 25

  26. Example: Label is a Tag Code State t = [tree for book XML example] boolean b = t.isTag(); t = [unchanged] b = true 7 January 2019 OSU CSE 26

  27. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] boolean b = t.isTag(); 7 January 2019 OSU CSE 27

  28. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] boolean b = t.isTag(); 7 January 2019 OSU CSE 28

  29. Example: Label is Not a Tag Code State t = [tree rooted at title content in XML example] boolean b = t.isTag(); t = [unchanged] b = false 7 January 2019 OSU CSE 29

  30. hasAttribute boolean hasAttribute(String name) • Returns whether the root tag of this has an attribute called name . • Requires: [label of root of this is a tag] • Ensures: hasAttribute = [label of root of this has an attribute called name] 7 January 2019 OSU CSE 30

  31. Example: Has One Code State t = [tree for book XML example] boolean b = t.hasAttribute ("pubDate"); 7 January 2019 OSU CSE 31

  32. Example: Has One Code State t = [tree for book XML example] boolean b = t.hasAttribute ("pubDate"); 7 January 2019 OSU CSE 32

  33. Example: Has One Code State t = [tree for book XML example] boolean b = t.hasAttribute ("pubDate"); t = [unchanged] b = true 7 January 2019 OSU CSE 33

  34. Example: Has None Code State t = [tree for book XML example] boolean b = t.hasAttribute ("fooBar"); 7 January 2019 OSU CSE 34

  35. Example: Has None Code State t = [tree for book XML example] boolean b = t.hasAttribute ("fooBar"); 7 January 2019 OSU CSE 35

  36. Example: Has None Code State t = [tree for book XML example] boolean b = t.hasAttribute ("fooBar"); t = [unchanged] b = false 7 January 2019 OSU CSE 36

  37. attributeValue String attributeValue(String name) • Returns the value associated with the attribute of the root tag of this called name . • Requires: [label of root of this is a tag and it has an attribute called name] • Ensures: attributeValue = [value associated with attribute called name of root tag of this ] 7 January 2019 OSU CSE 37

  38. Example Code State t = [tree for book XML example] String v = t.attributeValue ("pubDate"); 7 January 2019 OSU CSE 38

  39. Example Code State t = [tree for book XML example] String v = t.attributeValue ("pubDate"); 7 January 2019 OSU CSE 39

  40. Example Code State t = [tree for book XML example] String v = t.attributeValue ("pubDate"); t = [unchanged] v = "Dec 20 2011" 7 January 2019 OSU CSE 40

  41. numberOfChildren int numberOfChildren() • Returns the number of subtrees of the root of this . • Requires: [label of root of this is a tag] • Ensures: numberOfChildren = [the number of subtrees of the root of this ] 7 January 2019 OSU CSE 41

  42. Example Code State t = [tree for book XML example] int n = t.numberOfChildren(); 7 January 2019 OSU CSE 42

  43. Example Code State t = [tree for book XML example] int n = t.numberOfChildren(); 7 January 2019 OSU CSE 43

  44. Example Code State t = [tree for book XML example] int n = t.numberOfChildren(); t = [unchanged] n = 3 7 January 2019 OSU CSE 44

  45. child XMLTree child( int k) • Returns the k -th subtree of the root of this . • Requires: [label of root of this is a tag and 0 <= k < number of subtrees of the root of this ] • Ensures: child = [the k-th subtree of the root of this ] 7 January 2019 OSU CSE 45

  46. Example Code State t = [tree for book XML example] XMLTree st = t.child(1); 7 January 2019 OSU CSE 46

  47. Example Code State t = [tree for book XML example] XMLTree st = t.child(1); 7 January 2019 OSU CSE 47

  48. Example Code State 0 2 t = [tree for book XML example] XMLTree st = t.child(1); t = [unchanged] st = [tree rooted at title tag] 7 January 2019 OSU CSE 48

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

XMLTree Model 5 May 2016 OSU CSE 1 XMLTree The XMLTree component family allows you to

XMLTree Model 5 May 2016 OSU CSE 1 XMLTree The XMLTree component family allows you to

XMLTree Model 5 May 2016 OSU CSE 1 XMLTree The XMLTree component family allows you to create, and navigate through, a tree whose structure mirrors that of an XML file The file from which the tree is created may come from your

579 views • 26 slides
Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type

Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type

Generic Methods 36 What are Generic Methods? Generic methods = methods that introduce type parameters Similar to declaring a generic type but type parameter's scope is limited to method where it is declared The following are

584 views • 6 slides
Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is

Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is

Preview ! Introduction Lecture 10 ! Partitioning methods Clustering ! Hierarchical methods ! Model-based methods ! Density-based methods 1 2 What is Clustering? Examples of Clustering Applications ! Cluster: a collection of data objects !

301 views • 8 slides
DESIGN &amp; ANALYSIS METHODS DESIGN &amp; ANALYSIS METHODS FOR DESIGN &amp; ANALYSIS METHODS

DESIGN &amp; ANALYSIS METHODS DESIGN &amp; ANALYSIS METHODS FOR DESIGN &amp; ANALYSIS METHODS

SNAME Philadelphia Section Meeting May 2013 y USA (originally presented at MTU Naval Symposium, September 2011, GERMANY) DESIGN &amp; ANALYSIS METHODS DESIGN &amp; ANALYSIS METHODS FOR DESIGN &amp; ANALYSIS METHODS DESIGN &amp; ANALYSIS

1.11k views • 80 slides
Why mixed methods? Methods should be mixed in a way that has complementary strengths and

Why mixed methods? Methods should be mixed in a way that has complementary strengths and

Mixed, mixing and mul.plying methods Dr Gemma Derrick Centre for Higher Educa.on Research &amp; Evalua.on Why mixed methods? Methods should be mixed in a way that has complementary strengths and non-overlapping weaknesses. It involves the

239 views • 11 slides
Meshless Meshless Methods Meshless Meshless Methods Methods Methods Contents

Meshless Meshless Methods Meshless Meshless Methods Methods Methods Contents

Meshless Meshless Methods Meshless Meshless Methods Methods Methods Contents Introduction Mess Free Methods Element Free Galerkin Method Element Free Galerkin Method Moving Particle Semi-Implicit Method Conclusion C l i

562 views • 38 slides
Monte Carlo Methods An introduction to Monte Carlo (MC) methods How to use MC methods

Monte Carlo Methods An introduction to Monte Carlo (MC) methods How to use MC methods

Numerical and Scientific Computing with Applications David F . Gleich CS 314, Purdue September 12, 2016 In this class: Monte Carlo Methods An introduction to Monte Carlo (MC) methods How to use MC methods Next class to estimate

826 views • 17 slides
Direct Search Methods (nongradient methods) 1. Random search methods 2. Univariate method (one

Direct Search Methods (nongradient methods) 1. Random search methods 2. Univariate method (one

Unconstrained Minimization in R n Direct Search Methods (nongradient methods) 1. Random search methods 2. Univariate method (one variable at a time) 3. Pattern search methods a) Hooke and Jeeves method b) Powells conjugate direction method

154 views • 12 slides
Methods Constructors Instance methods Class methods 30 Constructors have the same

Methods Constructors Instance methods Class methods 30 Constructors have the same

Methods Constructors Instance methods Class methods 30 Constructors have the same name as the class do not return anything they begin with a call to the constructor from the parent class (super(...)) public class MyClass{

561 views • 24 slides
CSE CSE 460 460 Evolutionary Evolutionary Methods Methods In this section we will look at

CSE CSE 460 460 Evolutionary Evolutionary Methods Methods In this section we will look at

CSE CSE 460 460 Evolutionary Evolutionary Methods Methods In this section we will look at evolutionary methods Genetic Algorithms Evolution Strategies Genetic Programming Constraints in Evolutionary Methods References

871 views • 57 slides
Benefits of Methods Chapter 5 Methods Write a method once and reuse it anywhere.

Benefits of Methods Chapter 5 Methods Write a method once and reuse it anywhere.

Benefits of Methods Chapter 5 Methods Write a method once and reuse it anywhere. Information hiding: hide the implementation from the user Reduce complexity 1 4 Motivating Example Defining and Using Methods Often we need to

232 views • 12 slides
Roadmap SE process management Waterfall model Incremental methods Agile/XP methods,

Roadmap SE process management Waterfall model Incremental methods Agile/XP methods,

Roadmap SE process management Waterfall model Incremental methods Agile/XP methods, SCRUM Iterative / spiral methods (eg, RUP) Evolutionary methods V -Model CMMI 320312 Software Engineering (P. Baumann) 1 The

339 views • 19 slides
Stochastic Simulation Methods: Variance reduction methods Antithetic variables Bo Friis

Stochastic Simulation Methods: Variance reduction methods Antithetic variables Bo Friis

Variance reduction methods Variance reduction methods To obtain better estimates with the same ressources Exploit analytical knowledge and/or correlation Stochastic Simulation Methods: Variance reduction methods Antithetic

276 views • 4 slides
Methods Mysteries Revealed Wri2ng monolithic programs in the

Methods Mysteries Revealed Wri2ng monolithic programs in the

Methods A method (a.k.a. func2on, procedure, subrou2ne) is a piece of code that performs Methods and Data a useful ac2on. (Savitch, Chapter 5) Up to this

144 views • 10 slides
Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods

Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods

Introduction to Monte Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods 2 Overview Integration by random numbers Why? How? Uncertainty, Sharply peaked distributions Importance

785 views • 37 slides
Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods

Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods

Introduction to Monte Carlo (MC) methods Introduction to MC methods Why Scientists like to gamble Monte Carlo Methods 2 Overview Integration by random numbers Why? How? Uncertainty, Sharply peaked distributions Importance

1.22k views • 36 slides
Classes in What is a class ? C++98 and C++11 Constructors &amp; . . . What if I dont write .

Classes in What is a class ? C++98 and C++11 Constructors &amp; . . . What if I dont write .

Overview Classes in What is a class ? C++98 and C++11 Constructors &amp; . . . What if I dont write . . . January 10, 2018 Why Prefer Init? Brian A. Malloy Static Class Variabless Principle of Least . . . Interface vs . . . Makefiles

641 views • 38 slides
Strings &amp; StringBuffer String: Java library provides String class stores

Strings &amp; StringBuffer String: Java library provides String class stores

Strings &amp; StringBuffer String: Java library provides String class stores sequence of character data Example: public static void main(String[] args) { String s; s = Comp182&quot;; ... s = Comp282&quot;; } Strings

460 views • 19 slides
Minimum Edit Distance Definition of Minimum Edit Distance How

Minimum Edit Distance Definition of Minimum Edit Distance How

Minimum Edit Distance Definition of Minimum Edit Distance How similar are two strings? Spell correction Computational Biology The user typed graffe Align two

651 views • 52 slides
Simplifying the Penicillin Code Exercise private Window window; } To do: Take the full code }

Simplifying the Penicillin Code Exercise private Window window; } To do: Take the full code }

Great Days in History: 28 September 1928 } 92 years ago? } Sir Alexander Fleming finds mould growing in his lab, leading to? } the discovery of penicillin } In honor of the occasion, the penicillium mold is rendered by computer: Class

166 views • 4 slides
For Monday Read Savitch, chapter 10 C++ Practice 3 due Program Quality Vector Class

For Monday Read Savitch, chapter 10 C++ Practice 3 due Program Quality Vector Class

For Monday Read Savitch, chapter 10 C++ Practice 3 due Program Quality Vector Class Rather similar to the ArrayList class in Java Basically a resizable array class C-Strings Arrays ending in the null character Can be

435 views • 29 slides
Turing Machines Most General computer? DFAs are simple model of computation. Accept

Turing Machines Most General computer? DFAs are simple model of computation. Accept

Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall counting argument: {

764 views • 48 slides
CS 378: Autonomous Intelligent Robotics (FRI) Dr. Todd Hester Are there any questions?

CS 378: Autonomous Intelligent Robotics (FRI) Dr. Todd Hester Are there any questions?

CS 378: Autonomous Intelligent Robotics (FRI) Dr. Todd Hester Are there any questions? Logistics Readings Monday Pick your own paper from the wiki Post for teammates on Piazza Project topics, skills Talks Tomorrow Dr.

567 views • 24 slides
Math 4997-1 Lecture 1: Introduction and Getting started Patrick Diehl

Math 4997-1 Lecture 1: Introduction and Getting started Patrick Diehl

Math 4997-1 Lecture 1: Introduction and Getting started Patrick Diehl https://www.cct.lsu.edu/~pdiehl/teaching/2020/4997/ This work is licensed under a Creative Commons Attribution-NonCommercial- NoDerivatives 4.0 International

665 views • 30 slides

More recommend