I am just not sure of some theory in collections, ArrayList and LinkedList maximum capacity depends on the memory allocated to the JVM. But according to few people those list has a maximum capacity of Integer.MAX_VALUE.
According to my experiment, those list has a maximum capacity of Integer.MAX_VALUE since the get method of List accept a parameter of int primitive type (index of element), therefore we can conclude that the maximum capacity of List is equal to Integer.MAX_VALUE.
But what about the Map? get() method of map accepts object(the key of the map). So does it mean that the maximum capacity of Map depends on the memory allocated to our JVM? Or its maximum size is Integer.MAX_VALUE also just like Lists and Arrays? Is there a way to prove it? Is Map designed to hold infinite number of data (disregarding the heap memory space exception)?
And also about Stack, Deque? is it also the same as Map (in terms of maximum capacity)?
I am new in Collection, as per my knowledge I have already override the hashCode() and Equals() method in Data class, but when I trying to search the element it is giving "not found". find the bug.
import java.util.*; public class WordCounter { public static void main(String args[]) { HashSet<Data> set=new HashSet<Data>(); set.add(new Data("this",2));
Today I installed jdk1.8.0_20 on my computer and typed a simple example code in MyEclipse 6.0 IDE, the code listed below:
import java.util.List; public class Test5 { public static void main(String[] args) { List<String> features = Arrays.asList("Lambdas", "Default Method", "Stream API", "Date and Time API"); features.forEach(n -> System.out.println(n)); } }
the MyEclipse Editor shows some errors like "Arrays can not be resolved" and "n can not be resolved".
I did use jdk 8 in the build path, but it seems like the jdk 8 did not function properly.
The Iteratior provides the functionality of traversing and removal which we can achieve through normal for loop and remove() of the data structure.Then, why do we need Iterator explicitly and as an inner class?
I am using this image as a reference to learn the Collection interface better and it seems I must be getting confused with the 'ordered/unordered' types. I thought ordered would mean ordering the objects automatically like a TreeSet using the comparable interface so it could be numerically or alphabetically ordered etc..
Java Code:
public static void main(String[] args) { Set hashSet = new HashSet(); hashSet.add(1); hashSet.add(3); hashSet.add(2); for (Object o : hashSet){ System.out.print(o + " "); // Prints: 1,2,3 (Unordered but puts the numbers in order....)
I imported the collections utility and everything. Tell me if you need to see more of the code. The exact error is binsearch is undefined for the type Collections.
I have a method that draws a polygon on the screen:
public void poly(List<Point> points) { //code }
For the usage of the method, it makes no difference whether points is an array or a List. In fact, switching doesn't even change any of the code in the method since I use a for-each loop. So, my question is, is it a better practice to use a List as an argument, or an array when the method itself doesn't care about which to use?
I am trying to create a java program to sort an array in ascending and descending order. Here is the program I created :
import java.util.Arrays; import java.util.Collections; public class ArraySort { public static void main(String [] args) { int [] num = {5,9,1,65,7,8,9}; Arrays.sort(num);
[Code]...
BUT I GET THE FOLLOWING EROOR ON COMPILATION
ArraySort.java:12: error: no suitable method found for reverseOrder(int[]) Arrays.sort(num,Collections.reverseOrder(num)); ^ method Collections.<T#1>reverseOrder(Comparator<T#1>) is not applicable
I'm doubted regarding the implementation of Collections.binarySearch() method on an ArrayList of objects of a custom class Movie.
Here is the movie class :
public class Movie implements Comparable<Movie> { String movieName; String rating; String director; String theme;
[Code] .....
The sort/binarySearch in searchByMovieName function is done with natural sorting (and Comparable Interface in Movie class). I mean no comparators involved here. And the comparator that I used for sorting/binarySearching on Movies Director attribute in searchByMovieDirector function is :
public class MovieDirectorComparator implements Comparator<Movie> { public int compare(Movie movie1, Movie movie2) { return movie1.getDirector().compareToIgnoreCase(movie2.getDirector()); } }
But I was not able to implement binarySearch ?? How to implement the binarySearch here. I have google to see only binarySearch working on Arrays or probably ArrayList of String only, but not on ArrayList of custom objects.
My friends and me are trying to make online Test taking system. We got a very basic doubt.
We have developed classes and relationship between classes for example : Online Test Taking system will have admin and student class. And Admin will have list of students.. etc.
But question troubled me was: if we use database to store all data for example student details then I can perform all sorts of operations writing sql query and store result in some other database then what is the need of "ArrayList<Student> field in Admin".??
Question is: We can put everything in database and manipulate using database(sql) functions to manipulate it.Then what is the need of Arraylist of anything which is just used to store object details for example student details....??
i need to calculate the minimum and the maximum, actually it seems to be easy but, the minimum should be the smallest number but 0..this is my code
Java Code:
Scanner s = new Scanner (System.in); int max = 0 ; int min = 0 ; System.out.println(" Please enter 3-5 numbers"); int a = s.nextInt(); int b = s.nextInt(); int c = s.nextInt(); int d = s.nextInt(); int e = s.nextInt();
I am doing a homework assignment for a class I'm taking and writing a java program that finds the smallest and largest number in an array entered by the user. For some reason no matter what I enter as the smallest number it returns 0 as the smallest. I'm not sure what I have done wrong. Here is my code:
import javax.swing.JOptionPane; public class MinimumAndMaximumJamesBulow { public static void main(String[] args) { int minimum = 0; int maximum = 0;
I have a set of enum values (let's call then ONE, TWO, THREE.....). I want to find the larger of two of them. But max(ONE,THREE) gives a compile error as MAX isn't defined for type-safe enums. Fair enough.
I also agree that one shouldn't be able to use arithmetic functions on enums.
But as Enum implements Comparable, one can write a function which implements max and min, rather inefficiently I assume.
Is there a better way of getting the max/min of an enum? And if not, can the Java team be persuaded to implement it?
I am using a static initialization block to register the driver and a static synchronized method to get a connection. The problem is I need to run 15 threads but always only two threads get the connection. I want to know if there is a default maximum number of concurrent connections a DriverManager can provide or is it my threading logic that may be faulty.
import java.io.IOException; public class Largestcolumn { public static void main ( String[] args ) throws IOException { int largest = 0; int newnumber = 0; int[][] data = { {3, 2, 5},
[Code] ....
When I run this code, I get this following output: The largest element in column 0 is: 9. Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 4 at largestcolumn.Largestcolumn.main(Largestcolumn.java:27) Java Result: 1
It outputs the first column's maximum element but then throws an out of bounds error. I'm new to Java and I can't figure out how to fix my code so that it will work for this multidimensional array and output the maximum elements in all of the columns.
I am trying to write a TreeMap that can hold a max of 20 colors and a minimum of 8. I have a while loop using pollLastEntry to limit the max but I can't figure out how to set the minimum. The hex number is the map's key and the color name is the value. I tried to use entrySet() and iterator to just double the size of the map but map can't have multiple keys with the same value. It also seems that to set a minimum would require some kind of further input(which I'm trying to avoid) of colors and their hex numbers.
//Method to hard code the colors into the map public TreeMap<String, String> cm() { //Color Map <Hex number, Color name> //Uses a TreeMap to keep all the colors organized by key TreeMap<String, String> cMap = new TreeMap<String, String>(); cMap.put("FFFF00", " Yellow");
depth is a variable for the row in the triangle. My problem is that i need the solution to be recursive and i am having trouble doing this. So far i have
public static int findMax(int[][] array,int depth) { if (depth==0) return array[0][0]; else if }
We are running a set of unit tests using the latest ojdbc 7 driver and the highest open cursor keeps going up, until it hits our 300 limit, then throws the cursor limit exception. If we run these tests using ojdbc 12.0.1.1, the highest open cursor stays at 17 and doesn't cause this exception.
The query used to monitor these cursors is below:
SELECT max(a.value) as highest_open_cur, p.value as max_open_cur FROM v$sesstat a, v$statname b, v$parameter p WHERE a.statistic# = b.statistic# and b.name = 'opened cursors current' and p.name= 'open_cursors' group by p.value
Oracle Database 11g Enterprise Edition Release 11.2.0.3.0 - 64bit Production Java 8 version 31
a. Write a Java program to input 10 integer numbers into an array named fmax and determine the maximum value entered. Your program should contain only one loop, and the maximum should be determined as array element values are being input. (Hint: Set the maximum equal to the first array element, which should be input before the loop used to input the remaining array values.)
b. Repeat 1a, keeping track of both the maximum element in the array and the index number for the maximum. After displaying the numbers, display these two messages:
The maximum value is: _________ This is element number __________ in the list of numbers
Have your program display the correct values in place of the underlines in the messages.
c. Repeat 1b, but have your program locate the minimum value of the data entered.
I did parts a and b but for part see i just want to know if i did it correctly or not
import java.util.Scanner; public class MinimumValueArray { public static void main(String[] args) { //Variable Declaration Scanner keyboard = new Scanner(System.in); int size = 10;
[Code] ,.....
When I run it i get this The minimum value is 0.0
The element that holds the value is 0 right away. is this right for the minimum or am i supposed to enter values and it will display the minimum value like in parts a and b wit the maximum? will the minimum just always be 0 or ?
So I'm learning java from a website and I was tasked with creating a simple program which allows the user to enter a series of integers, then finally when they decide to input a non-integer the program will print the maximum and minimum values of the integers they entered. So for example if they entered 5, 4, 3 and 2 then enter a non-integer the program would output 5 (maximum value), then 2 on a new line (minimum value).
Here is my code:
import java.util.Scanner; public class MaxMinPrinter { public static void main(String[] args) { Scanner in = new Scanner(System.in); int max = Integer.MIN_VALUE; int min = Integer.MAX_VALUE;
[Code] ....
And this is what the output looks like:
Actual output ------------------------------------------- Enter an integer: 5 - 10 - - Enter an integer: -4 - 8 - -6 - - Enter an integer: 11 - -1 - - Enter an integer: q - -1 - -6
When it's supposed to look like this:
Expected output ------------------------------------------- Enter an integer: 5 Enter an integer: 10 Enter an integer: -4 Enter an integer: 8 Enter an integer: -6 Enter an integer: 11 Enter an integer: -1 Enter an integer: q 11 -6
So lets say I got maximum of 20 deposit, I want to create a method/function (idk what proper name for it is) so that you cannot deposit more than 20 nor withdraw more than you have in your account, so this function checks your account, if your total is for example 18 and you're trying to deposit 10, it rejects it and doesn't add to your total and pops up with a message, vice versa for withdraw.
This is what I have so far
Not I already have the maximum limit + total feature created just not displayed here
public void depositMoney (int dMoney) { if(DMoney > 0 ) { totalMoney = totalMoney + dMoney; } else { System.out.println("Please insert money more than 0");
