how to put search bar in my program.i am just new to java programming so i dont really master all the codes.i dont have much time
import java.io.*;
import java.util.Scanner;
public class myjavProject{
public static void main(String[] args)throws IOException{
PrintWriter output = null;
String ID;
String firstname;
String lastname;
String ans = "y";
String userinput;
[code]....
Im trying to write a java program to search nearby bluetooth devices.. Im using Bluecove-glp-2.1.0 and bluecove 2.1.0..Im working on Ubuntu 13.04 LTS.I typend a code to get the local Device name..
public class BluetoothSearch {
public static void main(String[] args) {
LocalDevice ld= null ;
String name = ld.getBluetoothAddress();
System.out.print(name);
}
}
this is my code.. It returns me null. doesn't return me the local Device.
I have a java program where there are bacteria that have to eat the food spread for a map, I have to find a way to optimize the search for food, I put random at the beginning I have to try a better way...
protected void Move(){
int dx = (int)(Math.random()*3) - 1;
int dy = (int)(Math.random()*3) - 1;
if (x+dx >= 0 && x+dx<food.getWidth())
x += dx;
if (y+dy >= 0 && y+dy<food.getHeight())
y += dy;
Java Code:
public class Search
{
public static final int NOT_FOUND = -1;
public static int binarySearch( int [ ] a, int x )
{
int low = 0;
int high = a.length - 1;
int mid;
while ( low <= high )
[Code] ....
I keep getting illegal start of expression at ={-3,10,5,24,45.3,10.5}
It says I have 12 errors and I have tried so many things to fix it and I just don't know what to change to make it work.
I'm (failing at) writing a program that searches an array using binary search, but I can't get it to work.
My code so far is this:
Java Code:
package sorting;
import java.lang.*;
import java.util.*;
public class sorteh {
public static void main(String [] args){
int[] array=new int [20]; //creates new array
for (int x=0;x<array.length;x++){ //populates array
array[x]=x*3+1;
[code]...
I copied what a website did for the sorting part, but if I have low=0 and high=19, wouldn't mid not be an int?
The goal was to add a few buttons an add delete modify search and save. I feel like I have the entire need satisfied. I'm having a few symbol problems which I'm not quite sure how to fix.
My full code is:
import javax.swing.*;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.awt.event.*;
import java.awt.Color;
import java.awt.Dimension;
import java.awt.Graphics;
[Code] ....
which is directing me towards Prodname on the far right of the if statement. I'm not sure what the problem is. I've double checked my spellings several time for each spot and I cant quite get it.
Everyone has told me but I am aware that I made some bad decisions with the variables being capitalized this was my first go at a program and my instructor didn't let me know that thats the normal way to do it.
I am writing a java program which searchs data from a database on a website , my problem is that the url does not works on IE but works fine in other browsers..
private URL getURL(String selection) {
URL exampleURL = null;
String url = "http://www.example.com/list?keyphrase=";
if (selection.equals("mfcCode")) {
url += getURLcriteria(EditList.get(CurrentListIndex)
[Code] .....
I'm trying to build a method that can search a binary search tree for a specific target and then return the number of probes it took to get there. It seems to me that the best way to do this would be a recursive search method and a counter that tracks the number of calls. But I'm struggling with how to implement this. Here's the code I have so far. what works/doesn't work with the method.
// Method to search the tree for a specific name and
// return the number of probes
public T search(BTNode<T> btNode) {
[Code]....
I want to create a search method that returns the frequency of a word in the search method.
public class IndexTree {
private class TreeNode {
TreeNode left;
String word;
int frequency;
TreeNode right;
[Code] .....
I'm trying to create a booklist in java using swings but I'm facing a problem. I don't know how to add a search function to my list. I need a search box with the book names.
View Replies View RelatedI'm Trying to write a method that search for two String from node class and return the value but when i run it
Exception in thread "main" java.lang.NullPointerException
This is the code :
public Node findName(String firstName, String lastName) {
return findName(root, firstName,lastName);
}
private Node findName(Node p, String first,String last) {
if (p == null) {
[Code] .....
Knowing that a hashmap does not sort the keys, I am thinking of using/converting to treemap which by nature does sort out the keys. I now need to find out if it is possible to search a treemap using partial keys such that for example I would like to search for all entries that have a key starting with "78BOX" whilst the available keys are:
75SQUARE3
76DIAMOND2
78BOX26
78BOX99
78BOX300
79TRIANGLE4
The above list is probably how treemap would sort out the keys however need to extract only those keys that start with "78BOX" - does treemap has this functionality ?
// 1 ***** student writes this method
/** Searches for key in integer array named arr
// arr is an instance variable of the class and has been instantiated and filled with random values.
// @param key value to search for
// @return if key is found, the index of the first element
// in array whose value is key; if key is not found,
// the method returns -1
*/
public int sequentialSearch( int key ) {
// Note: To animate the algorithm, put this method call as the first statement in your for loop
// animate( i, 0 );
// where i is the index of the current array element
return 0; // replace this statement with your return statement
} // end of sequentialSearch
[Code] ....
I have problem in searching for the words from my text file.. im using binary search technique
private boolean doSearchQuery(String searchQuery) throws IOException {
Log.i(TAG, "in doSearchQuery, query string: " + searchQuery);
boolean result = false;
toSort = new ArrayList<String>();
myTv = (TextView) findViewById(R.id.myFile);
[Code] .....
Okay, so the assignment was creating a word search for the given array. I've created all the code necessary, but I've ran into trouble. This problem occurs with the Up-Forward, Up-Backward, Down-Forward, and Down-Backward sections. If I only set one of these to run, it works. But if I have all 4 set at the same time, it errors out on the first one that runs.
public class P_WordSearch {
public static void main(String[] args) {
char[][] puzzle = {
{'B','O','O','G','S','R','O','W','I','N','G'},
{'E','B','L','G','N','I','M','M','I','W','S'},
{'L','C','E','A','T','I','P','U','P','I','S'},
{'C','M','I','N','C','A','X','Y','O','S','N'},
[Code] ....
We have this piece of code and we must make a search for a key. if the key exist it returns true if not false. Plus we must insert a key in the class. If it is already in there we say hey its already in and we don t put it again...
package askisi2;
import java.util.*;
public class mtree {
protected class tnode {
public int k1;
public int k2;
public int k3;
[Code] ....
I am pretty new to Java and I am working on a sample Search code from my textbook. I can't figure out why I am getting the following error because I copied the sample exactly as it is in the book. The error is illegal start of expression on the second to last line.
public class Search {
public static final int NOT_FOUND = -1;
public static int binarySearch( int [] a, int x )
{
int low = 0;
int high = a.length - 1;
int mid;
[code]....
I am trying to make a program that compares the 3 different search algorithms(sequential/binary/hashing). I have already made the sequential search algorithm, binary and hashing part of the code.My program OPENS a data file, and then OPENS a key data file. and then searches through them using both. How to go about the binary and hashing search algorithm (in the driver program).
*I have included a zip file with:
-base program
-driver program
-data file
-key data file
I have always wanted to program A*, Breath First Search and Depth First Search ever since I took AI. I will only post BFS at the moment but it is only searching the row.
Java Code:
//Breath First Search. The first node passed to it is the start button
void bfs(Mybuttons button){
Queue<Mybuttons> q = new LinkedList<Mybuttons>();
q.add(button);
button.setIcon(button.setButtonToBlueWhileSearched());
button.model.visted=true;
[Code] ....
Output:
Java Code: In while loop
In get Child Node
In get Child Node
In get Child Node
In get Child Node
In while loop
In get Child Node
In get Child Node
In get Child Node
In while loop
In get Child Node
In get Child Node
In while loop
In get Child Node mh_sh_highlight_all('java');
I am having some trouble with linear search of a customers last name. I can't seem to get it to work. I have looked up examples but cant find many with Array Lists. Here is my code.
import java.util.ArrayList;
import java.util.Scanner;
public class AccountDriver {
public static void main(String[] args) {
ArrayList<Account> al = new ArrayList<Account>();
ArrayList<Customer> cust = new ArrayList<Customer>();
Scanner scan = new Scanner(System.in);
[code]....
I am inputting a file that has the system output when pinging an ip address. i have gotten it to read the file into an arraylist with readLine. Is there a way to have it input to list using spaces instead of lines?
BufferedReader bf = new BufferedReader(new FileReader(file));
int linecount = 0;
int numberTimes = 0;
String line;
//loop thru file and add contents to an arraylist
while ((line = bf.readLine()) != null) {
inLine.add(line);
}
bf.close();
System.out.println(inLine);
get the arraylist to hold it like this:
(0)Pinging
(1)192.168.1.6
(2)with
(3)32
(4)bytes
(5)of
(6)data
package bisecsearchsmccr;
import java.util.Random;
public class BisecSearchSMcCr
{
public static void main(String[] args) {
String[] names =
[Code] ....
I get this error:
run:
Johann
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 41
at bisecsearchsmccr.BisecSearchSMcCr.bisect(BisecSearchSMcCr.java:72)
at bisecsearchsmccr.BisecSearchSMcCr.main(BisecSearchSMcCr.java:42)
Java Result: 1
BUILD SUCCESSFUL (total time: 0 seconds)
I'm trying to make a update page where you search for person info by their number then have the ability to change any info and save it back to the binary field. I have the search working but i don't know how to do the update,.here my code:
Java Code: import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import java.io.EOFException;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.RandomAccessFile;
[code]....
I try to create a jsf project within ejb which is add new car with entering attributes listing attributes and search by make.
Add and list methods working well , but have problem of list method. I tryed many combinations (using enhanced loop, iterative loop) but i cant provide working well. Always outputText returns nothing ,when i enter attributes.
Here is ejb code for adding ,getting and listing car items :
@Stateful
public class CarsBusiness implements CarsBusinessLocal {
List<Car> cars;
public CarsBusiness() {
cars = new ArrayList<Car>();
[Code] .....
I have created a binary search with 3 subsets, some aslo call it a ternary search and have come up with a minor problem. If you run the code as posted below it just runs until you quit it. If anyother value in the array is searched it is found.
/*
public class BinarySearchDemo {
public static void main(String[] args) {
String[] songs = {"Ace Of Spades", "Beyond the Realms Of Death", "Breaking The Law",
[Code].....
How do I make it so I am able to enter any number rather then just the numbers in the arrays? I want it to be able to find the position of any number between 0-100.
import javax.swing.*;
public class BinarySearch {
public static void main(String[] args) {
int array[] = new int[11];
array[0] = 10;
array[1] = 20;
array[2] = 30;
array[3] = 40;
array[4] = 50;
array[5] = 60;
[code]...