Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

public SearchEngine(int mode) throws IOException { if(mode == 1){ this.mode = 1; this.nodeList = new ArrayList (); buildList(); }else if (mode == 2){ this.mode =

public SearchEngine(int mode) throws IOException { if(mode == 1){ this.mode = 1; this.nodeList = new ArrayList<>(); buildList(); }else if (mode == 2){ this.mode = 2; this.nodeList = new SortedArrayList<>(); buildList(); } else { System.out.println("mode can only be 1 or 2"); System.out.println("You entered: " + mode); throw new IOException(); } } public List getNodeList(){ return this.nodeList; } public void buildList() throws IOException { BufferedReader reader = new BufferedReader(new FileReader("dataset.txt")); String url; while((url = reader.readLine()) != null){ Document doc = Jsoup.connect(url).get(); String text = doc.body().text().toLowerCase(); String[] words = text.split("\\s+"); // splits by whitespace // logic here for (String j : words){ Node hold = new Node(j, this.mode); int index = nodeList.search(hold); if(index == -1){ hold.insertReference(url); nodeList.add(hold); } else { if (nodeList.get(index).getReferences().search(url) == -1){ nodeList.get(index).insertReference(url); } } } } reader.close(); System.out.println("Finished reading through all URLs"); }

How can I make JUnit tests for SearchEngine() and BuildList()?

Please test these two methods

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database And Expert Systems Applications 19th International Conference Dexa 2008 Turin Italy September 2008 Proceedings Lncs 5181

Authors: Sourav S. Bhowmick ,Josef Kung ,Roland Wagner

2008th Edition

3540856536, 978-3540856535

More Books

Students also viewed these Databases questions