I can compile but not run ...

Exception in thread "main" java.lang.NoClassDefFoundError: VierOpEenRij
I can Compile my file VierOpEenRij.java , then it creates his .class but when I try to open it ( java VierOpEenRij ) then it says this error.
anyone has an Idea how come , cause I really need it for school !!
Thx

No it still doesn't work ..
If using -cp . does not work (don't forget the spaces), then either VierOpEenRij.class file does not exist in the current directory or the class inside the VierOpEenRij.class file is not named VierOpEenRij
I don't know how , It used to work but now it just
fails :(
is it possible that i Intalled something that
interrupte the proces ?Anything is possible.

Similar Messages

Can compile but cannot run.

Dear Java Guru,
Wish to find out why I can compile but cannot run. I encounter the following error: 'Exception in thread "main" java.lang.NoClassDefFoundError: javax/media/jai/JAI
at saveasone.<init>(saveasone.java:29)
at saveasone.main(saveasone.java:21)'
This does not happen on one PC but happened on another PC.
The one can compile is XP, the other which cannot compile is Win2k Professional. Is there any other possible cause ?
Please advise.

The problem probably lies in the Classpath. I think you are using different environments for compiling and running. If you are using an IDE for developing your code, you might have set the classpath correctly there but not in the executing environment. As about the OS's you mentioned, I think the problem is still with your Environment Settings than OS settings.

I can install, but not run, firefox 4 on windows 7 fire edition. can you help?

.....

I use XP not Windows 7, but the current user and the administrator may be subtly different. I do not use Windows 7 and can not advise but just be aware you may not necessarily see the top level administrator account easily (See for instance ---> [http://technet.microsoft.com/en-us/library/dd744293%28WS.10%29.aspx MS link] : <-- clickable link --- ''"Enable and Disable the Built-in Administrator Account"'' )
I am not certain I understand what a ''fire edition'' is, unless this is a reference to Firefox 4.
I would not expect that you would normally need a password run or use the browser Firefox 4, although you probably need a login name and a password to login to and start using your Operating System account in Windows 7. Obviously you can not start Firefox without using an Operating System - such as Windows 7. You may need a password and a login to make full use of this current forum, the Firefox Support messageboard.
Presumably at the moment you are using Internet Explorer 8, as your browser.
Have you tried reading the linked articles I mentioned in my first post, the light blue text are links, and should open ok with Internet Explorer.

CAN COMPILE BUT CANNOT RUN PROGRAM

I am finally able to compile my program, I have the extensions .class, when I try to run the program I get an error message "main"java.lang.noclassdef
after message appears after I type java Saluton or whatever program I am trying to run.
Any suggestions, someone justed I use textpad, but I don't think this has anything to do with not being able to run programs, I am using windows 98 second edition.

This is a CLASSPATH problem.
For example, if your .class file is in the directory C:\javaclasses then you would set the CLASSPATH environment variable to that using:
set CLASSPATH=C:\javaclasses
Add this to your autoexec.bat and reboot so you don't have to type this every time you open a DOS prompt.
You may want to add the current directory, ., to the list of directories (use ; to separate directories).
set CLASSPATH=.;C:\javaclasses
If your class is part of a package, you have to use the directory that is the parent of the packages' directories.

Can compile but can't run....

Last year I compiled and ran programs and applets with the Java SDK Version 1.4.0 on Windows XP. This year I am basically going thru the same motions, but now I can compile programs but not run them. The error that I get using the DOS prompt command is
C:\VMBwork>java HelloWorld
Exception in thread "main" java.lang.NoClassDefFoundError: HelloWorld
I moved to a new Computer Lab over the summer, so the technicians loaded j2sdk1.4.2_04 with NetBeans IDE. I have set the path in XP to c:\j2sdk1.4.2_04\bin and the classpath to c:\Program Files\Java\j2re1.4.2_04\lib\ext. This appears to be the same set up as last year...but no java programs run.
I even tried loading j2sdk1.4.2_05 new on my computer without Netbeans with the same path changes, but to no avail. Any suggestions? The students are really anxious to get into programming.

C:\VMBwork>java HelloWorld
Exception in thread "main"
java.lang.NoClassDefFoundError: HelloWorldIs HelloWorld.class in C:\VMBwork?
Is HelloWorld.java defined in a package?
If answers are yes and no (respectively), you should be able to run using
java -cp . HelloWorld>
I moved to a new Computer Lab over the summer, so the
technicians loaded j2sdk1.4.2_04 with NetBeans IDE. I
have set the path in XP to c:\j2sdk1.4.2_04\bin and
the classpath to c:\Program
Files\Java\j2re1.4.2_04\lib\ext. ^^^^^^^^^^^^ doesn't help for classpath (it's already set this way and you can't change that).
-Alexis
This appears to be
the same set up as last year...but no java programs
run.
I even tried loading j2sdk1.4.2_05 new on my computer
without Netbeans with the same path changes, but to no
avail. Any suggestions? The students are really
anxious to get into programming.

Compile correct but not run java programs

I have problem. Java program copile correctly but not run. I can't understand this one.
**this is the error**
Exception in thread "main" java.lang.NoClassDefFoundError: suminda
Caused by: java.lang.ClassNotFoundException: suminda
at java.net.URLClassLoader$1.run(Unknown Source)
at java.security.AccessController.doPrivileged(Native Method)
at java.net.URLClassLoader.findClass(Unknown Source)
at java.lang.ClassLoader.loadClass(Unknown Source)
at sun.misc.Launcher$AppClassLoader.loadClass(Unknown Source)
at java.lang.ClassLoader.loadClass(Unknown Source)
at java.lang.ClassLoader.loadClassInternal(Unknown Source)
Could not find the main class: suminda. Program will exit.

The error is telling you that the jvm could not find a class named suminda. Are you aware that class names are case sensitive? Suminda is not the same as suminda for example.
This error usually happens when you haven't specified the classpath correctly. A simple thing to try isjava -cp . sumindaHere's some links that may help.
[http://www.kevinboone.com/classpath.html]
[http://java.sun.com/javase/6/docs/technotes/tools/findingclasses.html]

My B+Tree can compile but have runtime error ... i can't tink why ...

Sorry to bother anyone ... i have spent almost 3 weeks trying to debug the problem...
My B+ Tree can compile but can't run as it throw invalid Null pointer Exception ..
I suspected the error is in the split (int order ) method in the BTreeNode class but i can't remedy for it
This my program code
public class BTree {
* The order of the B-Tree. All nodes of the B-Tree can store up to 2*order key values.
private int order;
* The number of key (with associated data values) stored in the B-Tree.
private int count;
* The root node of the B-Tree
private BTreeNode root;
* The first leaf node in the B-Tree. This field is used to give the starting point for sequential
* access to the keys and data stored in the leaf nodes.
private BTreeNode first;
* The last leaf node in the B-Tree. This field is used to give the starting point for reverse
* sequential access to the keys and data stored in the leaf nodes.
private BTreeNode last;
* A change count that can be used to invalidate iterators. This field is updated whenever a key plus data pair
* is added to the B-Tree (or the data associated with a key is changed), or when a key plus data pair are
* deleted from the B-Tree.
private int changeCount = 0;
// WHEN DOING ASSIGNMENT 5, DO NOT ADD ANY ADDITIONAL FIELDS TO THIS CLASS
// You will loose marks if you add additional fields to this class. The fields above are all that
// you need. If you need a variable in a method, use a local variable. I have seen too many
// assignments where students add fields rather than create local variables. Hopefull the threat
// of loosing (quite a few) marks will help reduce this habit.
* A general exception class for errors when constructing or manipulating a B-Tree. Use the string
* parameter to the constructor to say what the error really is.
public class BTreeError extends RuntimeException {
public BTreeError(String reason) {
super(reason);
* A constructor that creates an empty B-Tree of the given order.
* This is the only constructor provided at the moment for this BTree class. Could consider
* adding the equivalent of a 'copy constructor' that creates a new BTree object from an existing
* BTree object.Constructor
* creates the root of a btree
* A constructor that creates an empty B-Tree of the given order.
* This constructor need to copy the order parameter to the field of same name, and initialise the
* root, cound, first and last fields of the BTree object.
* @param order The order of the BTree.
public BTree(int order) {
count = 0;
this.order = order;
root = new BTreeNode(true, null, -1, null, null);
first = root;
last = root;
* A method to return a SequentialIterator object that is positioned just before the first key
* of the BTree object.
* Do not modify this method.
* @return A SequentialIterator object.
public SequentialIterator iterator() {
return new BTreeIterator();
* A mehtod to return a SequentialIterator object that is positioned at a key found through a call
* to the searchFor() method.
* Do not modify this method.
* @param position A SearchPosition() object that usually has been returne by a call to the searchFor() method.
* @return A SequentialIterator object initialised to start at particular key in the BTree.
public SequentialIterator iterator(SearchPosition position) {
return new BTreeIterator(position);
* A method to return a string representationo the BTree.
* The format of the string is:
* <pre>BTree: Order=<digits>, size=<digits>, root=<BTreeNode string></pre>
* Do not modify this method.
* @return A string to represent the BTree
public String toString() {
StringBuffer s = new StringBuffer("BTree: Order=");
s.append(order).append(", size=").append(size()).append(", root=").append(root.toString());
return s.toString();
* Method to determine the number of records stored in the B-Treee.
* Do not modify this method
* @return the number of records in the B-Tree.
public int size() {
return count;
* method to return the order of the B-Tree.
* 
* This is the smallest number of key values for all nodes
* except the root node. The maximum number of key values in a node is 2*order, and the maximum number
* of child nodes for a node is 2*order+1.
* Do not modify this method.
* @return The order of the B-tree.
public int order() {
return order;
* Insert a key plus data value into the BTree.
* This method needs to locate the leaf node in which the key + data value should be
* inserted, and then call the insertLeaf() method of BTreeNode to do the insertion.
* This method will always result in a change to the BTree, so it should increment
* the change count.
* The method may result in only the data associated with an existing ke being changed,
* so incrementing the count field should be done in the BTreeNode method (if needed).
* This is one of the method you need to complete for assignment 5.
* @param key The key associated with the data value to be added to the B-Tree
* @param data The data value to be added (with it's associated key) to the B-Tree.
public void add(Comparable key, Object data) {
// you need to add the code for this method
// i added
BTreeNode btNode = root;
while (!btNode.isLeaf) {
int i=0;
while(key.compareTo(btNode.keys) > 0) {
i++;
if (i == btNode.numberOfKeys) break;
btNode = btNode.childNodes[i];
btNode.insert(key,data);
if (root.numberOfKeys == order*2-1) root.split(order);
* insert a object with the given key into the tree
//KeyNode keyNode = new KeyNode(key, data);
// BTreeNode keyNode = new BTreeNode(key,data);
BTreeNode btNode = root;
while (!btNode.isLeaf) {
int i=0;
while(key.compareTo(btNode.key(i)) > 0) {
i++;
if (i == btNode.numberOfKeys())
break;
btNode = btNode.child(i); }
System.out.println("hmm1");
btNode.insert(key,data );
System.out.println("hmm2");
if (root.numberOfKeys == order*2-1)
System.out.println("hmm3");
root.split(order);
System.out.println("hmm4");
* This method searches the B-Tree for an occurence of the key in a leaf node and returns the result
* of the search in a SearchPosition object.
* Note that the key may occur in an interior node of the BTree without occuring in the leaf
* nodes. This can be the result of a deletion operation. This method need to search down to the
* leaf node that should contain the key if the key and associated data is in the B-Tree, and then
* scan through the keys in the leaf node for the search key.
* The result of the search is returned as a SearchPosition object, as this allow the return
* of the success or failure of the search, as well as the data belonging to the key. It also
* allows position information to be returned so that an interator can be initialised with the
* key as the starting position for subsequent sequential access to adjacent keys.
* This is one of the method you need to implement.
* Implementation nodes: 
* You need to find the leaf node that may contain the key (same code as for add()), then
* scan the leaf BTreeNode for the search tree. You can do this within this method, as you
* have total access to the fields and methods of BTreeNode (as BTreeNode is an inner class
* of BTree). If you find the key, construct and return a SearchPosition object with the appropriate
* details of the position, otherwise construct add return a SearchPosition object that indicates the
* search failed.
* @param key The key to search for in the BTree
* @return A SearchPosition object returning the data and position information for the search
public SearchPosition searchFor(Comparable key) {
// You need to add the code for this method. The code below simply creates a
// SearchPosition object which indicates an unsuccessful search.
return new SearchPosition(false, null, -1);
* A method to delete a node from the BTree.
* The method should return the data object that was deleted when the key plus data object pair
* are deleted from the B-tree.
* The method should throw a BTreeError exception (with an appropriate reason string) if the
* key is not found in the B-tree.
* This is a method you can implement for bonus marks in Assignment 5.
* Implementation notes: 
* The easiest way to proceed is to use searchFor() to determine if they key is in the BTree, and
* (if it is in the B-tree) to return position information about the key. Throw an exception if the
* key is not in the B-tree, otherwise keep a copy of the data assocaited with the key (to return),
* then for the leaf node containing the key (a BTreeNode object), call the deleteLeafNodeKey() method,
* passing across the leaf key index of the key (so you don't have to find it again in the leaf node).
* After this method deletes the key, return the data you saved as the method result.
* @param key The key to delete (along with it's associated data) from the B-tree.
* @return The data associated with the key that was deleted.
public Object delete(Comparable key){
// You need to add the code for this method.
return null;
* The inner class BTreeNode is used to represent the nodes in the B-Tree.
* The nodes in the BTree are of two types:
* <ol>
* <li>Leaf nodes that contain the keys and associated data values, stored in ascending key order. 
* These leaf nodes have next and previous pointers to adjacent leaf nodes to allow an easy
* implementation of an iterator class to provide bi-directional sequential access to the keys stored
* in the BTree nodes.
* <li>Interior nodes that contain keys and links to child nodes (that are either all internal nodes
* or all leaf nodes), organised as the node of a multi-way search tree. The interior nodes have
* one more child node link than keys. The child node link at index k is to a node with keys that
* are all less than the key at index k in this node. The link at index k+1 is to a child node
* with keys that are all greater than or equal to the key at index k.
* </ol>
* The BTreeNode class allows you to create these two 'types' of nodes, depending on the parameters
* passed to the constructor.
* There are methods that should only be called for leaf nodes and methods that should only be
* called for interior nodes. These methods should throw an exception if called by the wrong node
* type. This class should really be designed using inheritance to mimic the pascal/C++ variant
* record structure, but this design is relatively easy to understand and to implement.
* Note that this class is an inner class of BTree, and so all objects will have an implict
* reference to the BTree container object. This class has direct access to all the fields of the
* BTree contaner object. In particular, the order of the BTree is available, hence this class
* does not need to keep a copy of the order as a field.
* Skeleton class provided for Objects and Algorithms Assignment 5
* Only modify the methods where the JavaDoc indicates that you need to provide code.
* @author a.sobey
* @version 1.0
* Date: 16/05/2005
public class BTreeNode {
* The actual number of key values stored in the BTreeNode. Note that the BTree node has an implicit
* reference to the containing BTree object, and the maximum number of nodes that can be stored in a
* a BTreeNode (except temporarily during the split operation) is twice the order of the BTree. 
* This field is valid for both internal and leaf nodes.
private int numberOfKeys = 0;
* The array of pointers to child nodes of this node. Only (numberOfKeys+1) are valid if numberOfKeys
* is non-zero. 
* This array is only valid and created for internal nodes - this array is not created for leaf nodes. 
* There is space in the array created for one additional child node link - this makes the coding for
* splitting of an internal node easier to implement.
private BTreeNode[] childNodes;
* A reference to the parent node of this node. 
* This link is null if this node is the root node of the tree of BTreeNodes. 
* This node is valid for both internal and leaf nodes.
private BTreeNode parent;
* The index in the parent node's array of links (the childNodes array) for the link to this node. 
* This value should be set to -1 if this node is the root node (and so has no parent node). 
* This field is valid for both internal and leaf nodes.
private int parentIndex;
* A link to the next leaf node in the B-tree, provided to allow easy sequential access of the keys
* and values stored in the B-tree. 
* This field is only valid if the node is a leaf node. For non-leaf nodes set the value to null. 
* For leaf nodes, set the value to null if this node is the last leaf node in the B-tree.
private BTreeNode next;
* The link to the previous leaf node in the B-tree, provided ot allow easy reverse sequential access of the keys
* and values stored in the B-Tree. 
* This values should be set to null if this node is a leaf node but is the first leaf node in the B-Tree, or
* if this node is not a leaf node. 
* This field is only used in leaf nodes.
private BTreeNode previous;
* An array of comparable key objects that are stored in this node of the B-tree. 
* Only the first numberOfKey values in the array are valid. 
* The maximum number of keys in a node is 2*order, however there is space in this array
* for one additional value to make the coding of the node splitting operation easier to implement. 
* This field is valid for both internal and leaf nodes.
private Comparable[] keys;
* An array of data values associated with the keys stored in this leaf node of the B-tree. 
* Only the first numberOfKey values are valid. 
* The maximum number of data values in a node is 2*order, however there is space in this array
* for one additional value to make the codingof the leaf node splitting operation easier to implement. 
* This field is only valid for leaf nodes - for interior nodes this array is not created.
private Object[] data;
* A boolean value to indicate if the node is a leaf node or not. The structure of the remainder of the node
* depends on this value (would be nice to have variant records in Java ...). 
* This field is valid for both leaf and internal nodes.
private boolean isLeaf;
private int order;
* The constructor for a BTreeNode.
* The code for the constructor is provided - do not modify this constructor.
* @param isLeaf True if this node is a leaf node.
* @param parent A link to the parent node or null if this node is the root node of the B-Tree
* @param parentIndex The index of the link in the array of child node linkes in the parent node that points to this node.
* @param previous A link to the previous leaf node for sequentail access, or null if not a leaf node or no previous leaf nodes.
* @param next A link to the next leaf node for sequential access, or null if not a leaf node or the last leaf node.
public BTreeNode(boolean isLeaf, BTreeNode parent, int parentIndex, BTreeNode previous, BTreeNode next) {
this.parent = parent;
this.parentIndex = parentIndex;
this.previous = previous;
this.next = next;
this.isLeaf = isLeaf;
if (isLeaf)
data = new Object[2 * order + 1];
else
childNodes = new BTreeNode[2 * order + 2];
keys = new Comparable[2 * order + 1];
public BTreeNode( int order, BTreeNode parent)
this.order = order;
this.parent=parent;
this.keys = new Comparable[2*order-1];
this.data = new Object[2*order-1];
this.childNodes=new BTreeNode[2*order];
this.isLeaf=true;
* Returns the number of keys in this BTreeNode. Note that within the code in BTree you have access
* to all the fields of BTreeNode, so this method is not strictly necessary.
* @return The number of keys in this BTreeNode object.
public int numberOfKeys() {
return numberOfKeys;
* Returns the container BTree object for this BTreeNode object. You may like to check that container objects
* are the same when manipulating two BTreeNode objects.
* @return the containing BTree object.
public BTree container() {
return BTree.this;
* A private method to return a string representation of the array keys. This method is used in
* the toString() method for this class. 
* Do not modify the code provided for this method.
* @return A string representation of this nodes array of keys.
private String keyString() {
StringBuffer s = new StringBuffer("{");
for (int index = 0; index < numberOfKeys; index++)
s.append(index > 0 ? "," + keys[index] : keys[index]);
return s.append("}").toString();
* A private method to return a string representation of the array of data values stored in a leaf node. 
* This method is used in the toString() method of BTreeNode. The method does not check if this node is a
* leaf node, as it is not intended to be called directly from outside of this class, and the toString()
* method only calls this method if the node is a leaf node. 
* Do not modify the provided code for this method.
* @return a string representation of the data values array of a BTreeNode.
private String dataString() {
StringBuffer s = new StringBuffer("(");
for (int index = 0; index < numberOfKeys; index++)
s.append(index > 0 ? "," + data[index] : data[index]);
return s.append(")").toString();
* A private method to return a string prepresentation of the array of child node links in an interior node. 
* This method is used in the toString() method. This method does not check if this node is an interior
* node, so you must take care to only call this method for interior nodes. 
* Do not modify the provided code for this method.
* @return A string representation of the array of child nodes of this BTreeNode.
private String childString() {
StringBuffer s = new StringBuffer("<");
for (int index = 0; index < numberOfKeys + 1; index++)
s.append(childNodes[index] + (index == numberOfKeys ? "" : ","));
return s.append(">").toString();
* The toString method provides a string representation of a BTreeNode. This particular method does not
* include the details of all the fields of a BTreeNode. While debugging your code, you may like to include
* more information (such as the parentIndex value), but in your final submission you must have the code
* as provided in the skeleton BTreeNode class provided to you.
* @return A string representation of a BTreeNode.
public String toString() {
if (isLeaf)
return (new StringBuffer("[")).append(numberOfKeys)
// .append(',').append(parentIndex) // uncomment this line if need to check parentIndex values
.append(',').append(keyString()).append(',').append(dataString()).append(']').toString();
else
return (new StringBuffer("[")).append(numberOfKeys)
//.append(',').append(parentIndex) // uncomment this line if need to check parentIndex values
.append(',').append(keyString()).append(',').append(childString()).append(']').toString();
* Returns the key with the given index in this node. Throws a BTreeError exception if the index is not valid. 
* Do not modify this provided code.
* @param index The index of the key.
* @return The key value at the given index.
public Comparable key(int index) {
if (index < 0 || index >= numberOfKeys)
throw new BTreeError("Key index out of range - value = " + index);
return keys[index];
* Returns the child node at the provided index into the childNodes array. 
* A BTreeError exception is thrown if the node is not an internal
* node or if the index is not valid.
* Note that the child node returned will have keys that are all less than the key stored
* in the keys array of this node at the given index value (except the last childNode
* at index numberOfkeys, as this node has keys that are all greater than or equal to the last
* key value stored in this node). 
* Do not modify the provided code for this method.
* @param index The index into the array of child nodes for this internal BTreeNode object.
* @return The child node link.
public BTreeNode child(int index) {
if (isLeaf) throw new BTreeError("child() called for a leaf node");
if (index < 0 || index > numberOfKeys)
throw new BTreeError("Child node index out of range - value = " + index);
return childNodes[index];
* Returns the data value associated with the key at the given index. An BTreeError exception is thrown if the
* node is not a leaf node or if the index is invalid.
* Do not modify the provided code for this method.
* @param index The index of the key assocaited with the data value.
* @return The data value associated with the key with given index.
public Object data(int index) {
if (!isLeaf) throw new BTreeError("data() called for an internal node");
if (index < 0 || index >= numberOfKeys)
throw new BTreeError("Data index out of range - value = " + index);
return data[index];
* This method is used to determine if this node is a leaf node.
* @return True if this node is a leaf node.
public boolean isLeaf() {
return isLeaf;
* Inserts the (key, data) pair into this BTreeNode object.
* You must supply the code for this method.
* Implementation notes: 
* <ol>
* <li>Throw an exception if this node is not a leaf node.
* <li>Scan the keys array for index of the key greater than or equal to the insertion key.
* <li>If the key at the index is equal to the insertion key, update the data field and return - you are done.
* <li>Otherwise shuffle the keys values from the insertion index along to make a hole for the insertion key,
* and insert the insertion key into the keys array. Do the same for the data array values to insert the
* new data value into the data array at the insertion index.
* <li>increment the number of keys, and increment the container BTree object's count field.
* <li>If the number of keys in the node is now no more than 2*order, you are done, so simply return.
* <li>Otherwise the node has (2*order+1) key values, and need to split. The split operation leaves the first
* order keys and data values in this node (and so the node's numberOfKeys value will become
* order, and moves the remaining (order + 1) keys and data values to a new BTreeNode leaf node
* that you need to create. 
* You need to fix up the previous and next fields of this leaf node and the new leaf node you have created. 
* Two sub-cases:
* <ol>
* <li>If this node is the root node (i.e., it does not have a parent node), the split of this node will create
* a new root node, with a single key (the key at index (order+1)) and this node and the new BTreeNode as
* the child nodes. In my solution I used a call to the method newRootNode to do this. The newRootNode()
* method will also be used when a split of an interior node creates a new root node. See the JavaDoc for
* details of what the newRootNode() method should do. Once the new root node has been created, and all
* the fields updated due to the split, you are done.
* <li>Otherwise we need to insert in this node's parent node the middle key (at index (order+1) and the
* new node that we created. This is done by the method insertInterior(). The method is passed the
* key to insert (at location this.parentIndex in the keys array of the parent node), the index to
* to insert the key (this.parentIndex), and the new leaf node (that will be inserted at index
* (this.parentIndex+1) in the parent node's child links array).
* </ol>
* </ol>
* @param key The key to insert into the leaf node.
* @param data The key's corresponding data value.
public void insertLeaf(Comparable key, Object data) {
// You need to provide the code for this method.
// BTreeNode temp = new
int size = this.data.length;
int counter = 0;
this.keys[size] = key;
this.data[size] = data;
sort(size);
public int compareTo(Comparable o2) {
// Integer o1 = (Integer) o2;
return (((Integer)o2).compareTo(this));
*split()
*Splits a node into to nodes. This can only be done, if the node is full
*The midlest key go up into the parent, the left ones of them rest in
*this node, and the right ones go into a new node.
private BTreeNode split(int order) {
if (numberOfKeys == order*2-1) {
BTreeNode right = null;
if (parent == null) { // algo for the root-node
BTreeNode left = new BTreeNode(order, this);
right = new BTreeNode(order, this);
for (int i=0; i<order-1; i++) {
left.keys[i] = keys[i];
left.data[i] = data[i];
right.keys[i] = keys[order+i];
right.data[i] = data[order+i];
if (!isLeaf()) {
for (int i=0; i<order; i++) {
left.childNodes[i] = childNodes[i];
left.childNodes[i].parent = left;
right.childNodes[i] = childNodes[order+i];
right.childNodes[i].parent = right;
left.isLeaf = false;
right.isLeaf = false;
} else isLeaf = false;
keys[0] = keys[order-1];
numberOfKeys = 1;
left.numberOfKeys = order-1;
right.numberOfKeys = order-1;
for (int i=1; i<order*2-1; i++) {
keys[i] = null;
data[i] = null;
childNodes[i+1] = null;
childNodes[0] = left;
childNodes[1] = right;

* Don't post that much code. There should never be a reason to. You should be able to break your code down into small enough pieces that you can post a small example that demonstrates your problem.
* When you do post code, use [code] and [/code] tags to make it readable. You can use the code button on the message entry page.
* The stack trace will tell you which line the NPE occurred on, where it was called from, where that was called from, etc. You can use that to help you find your error. Look at the line it's complaining about. What references are on that line followed by a dot, and what arrays do you try to access the elements of. One of those must be null.
* Now that you know what[b] is null, put in a bunch of print statements to track [b]how it got to be null.

Can send but not retrieve emails using Thunderbird and Windows 8.1

Hi, I am not able to get Thunderbird to retrieve emails on a new laptop.
Last week I purchased a new laptop due to an imminent hard disk failure on my old laptop. I will call them "Old" and "New" laptops. (Old laptop is still working for the moment...)
The Old laptop is nearly 3 years old, and I have been using Thunderbird on it since new without any problems.
I have downloaded and installed Thunderbird on the New laptop, and can not get it to retrieve emails.
As the Old laptop is still working (at the moment), I am able to directly visually compare and check settings on both computers.
THE PROBLEM
Using Thunderbird on the New laptop, I am able to send emails, I can see all my old emails restored from the Old laptop using Mozbackup, but clicking Get Mail on the New laptop does not retrieve new
emails.
When I click Get Mail, the status message in the bottom left corner says "connected to .....<ISP>..." but does not actually get the emails. However, the Old laptop is still able to get emails as it always has.
My ISP is a large Australian telco that I have used for many years and I have not changed anything with my account. The ISP is POP3.
WHAT HAVE I TRIED
I deleted the email account created by restoring from Mozbackup, and attempted using the Thunderbird new account wizard, however Thunderbird did not recognise my ISP and would not create the account - even though it is working perfectly at the same time on the Old laptop.
All Firewalls I can find have been configured to allow Thunderbird, with the same configuration settings on both machines.
How do I know I can send but not Get emails from Thunderbird on the New laptop?
I have sent test emails to myself from the New laptop. Thunderbird sends successfully, I am able to preview the test emails via Mailwasher on the New laptop, and can read, reply, etc, to the emails if I log into my ISP webmail service. However I can NOT get Thunderbird to retrieve and download these emails on the New laptop. If I go to the Old laptop, Thunderbird works perfectly, retrieves and downloads all new emails, including these test emails.
I am now at the point where I do not know what else to try and would appreciate any suggestions.....
I have spent many hours over the last 3 days surfing the net, forums, Mozilla Support, etc, and tried everything suggested, without success. The only thing I have NOT tried is starting windows in Safe mode (as per some suggestions), as it is not a viable long term solution.
OTHER INFO
Computer Details;-
"Old" laptop;-
Windows 7 Home Premium - continuously updated with all Critical and Important updates. 64 bit version.
Antivirus = Bitdefender Total Security (subscription and licensed). Up to date.
MailwasherPro 2012 (subscription and licensed). Up to date.
Thunderbird 24.5.0 working perfectly. Up to date.
"New" laptop;-
Windows 8.1 - up to date with all Critical and Important updates. 64 bit version.
Antivirus = Bitdefender Total Security (subscription and licensed) - downloaded and installed. Up to date.
MailwasherPro 2012 (subscription and licensed) - downloaded and installed. Up to date.
Thunderbird 24.5.0 - downloaded and installed.
Note: I 'downloaded and installed' the Windows 8.1 version of these programs to avoid any potential compatibility problems restoring or copying from a Windows 7 backup version of the programs.
1) New laptop came with pre-installed with McAfee - which has been Uninstalled due to running Bitdefender (Windows searches for 'McAfee' return nothing found suggesting the Uninstall was successful).
2) Thunderbird has been added to both Bitdefender and Windows 8.1 firewalls on the New laptop.
3) Bitdefender and Windows security settings are identical on both laptops - as near as I can determine, I may be missing something - but have checked all settings 3 times by doing a side-by-side visual comparison.
4) Thunderbird settings are also identical and I am using the same email address and ISP that I have been using for many years.
5) I migrated Thunderbird settings, accounts and emails from the Old laptop to the New laptop using Mozbackup, then visually checked and compared all settings in Thunderbird between the two machines.
6) For info, I have used Mailwasher for many years as a simple way to preview and wash mail before running email programs such as Thunderbird - might be overkill, but I have also never had a virus or malware problem, so will keep doing this.
7) I have Uninstalled and re-installed Thunderbird on the New laptop twice, and done the same with Bitdefender once.
8) Any config changes I try on the New laptop, I either restart Thunderbird and / or restart the New laptop, or both.
9) I have not created a Windows 8.1 account and am not using SkyDrive.
10) Only other software I have installed on the New laptop is Google Chrome, Office Home 2013 and iTunes - all are working.
Thanks in advance....

Well there is not much left. If telnet works then the path is clear and there is no hardware firewall blocking ports.
All that is left is software, so try windows safe mode with networking. A very handy way to eliminate software. it also actually disables most anti virus resident features and is preferred here because anti virus/security programs do not always disable or turn off when they say they have.
You might also try the McAfee removal tool. https://community.mcafee.com/thread/52788 I notice the rep said yes to both, they did not say not required.
Finally you could try creating a new profile, and see if it works just to exclude corruption of your existing profile. ( I doubt it but I am at the anything goes point)
Just as an aside, I have never had an email borne nasty and I for many years never even had an email virus scanner. So yes I think your a bit over cautious with mailwasher, if that is what your using it for. Thunderbird does not support scripting languages or flash, or most plugins in the email sandbox. The result is getting a virus from a mail in Thunderbird is really only possible, for all practical purposes, if you open that password protected zip from the young Russian woman and that is what the anti virus should be blocking anyway when the temp file is written.

I can send but not receive email

Hello All. I know this is a highly posted topic but I cannot find a solution. Any help is greatly appreciated.
Basic Problem- I can send but not receive email.
My ISP is. Yahoo SBC Global
I have a 3rd party email provider: 1and1.com
I have set my preferences according to the specifications of 1and1.com
The error I get is this: The server error encountered was: The attempt to read data from the server "pop.1and.com" failed.
I have a Macbook Pro, running 10.4.9. My account with the 3rd party email provider is new and only has 1 or two emails in the account. I know this because I can log on via the internet and use their website to check the emails in the inbox. So the "email" address is working. I just can't get it to forward to my laptop.
I'm wondering if it has something to do with port 110 being blocked by my ISP. But I really don't think they are blocking that port. Due to the fact that my previous computer was a dell, and I used a similar 3rd party provider to email, the account used port 110 and things worked fine.
Thanks to all.

Ok. I've got it working.
All I did was delete my account information from the preferences. Before, I was editing it.
I entered a completely new POP account and it started working. I have a hard time believing that I entered information incorrectly prior to this because I checked it, rechecked it had a friend check it and it all looked OK. I was copy and pasting information anyway.
However, once I deleted and re- entered a brand new account, it worked fine.
Ernie, thanks for replying to my emails! I appreciate it.
-Fraky

Constant Error; Adobe Flash Player 11.4 r402 has stopped working. But NOT running Trusteer Rapport.

I am experiancing this unbelieveably annoying and constant Flash error; Adobe Flash Player 11.4 r402 has stopped working.
But NOT running Trusteer Rapport, I never have, and it's not even installed on my computer. So what's causing this?

There were a couple AntiVirus/AntiMalware products that keep coming up, but I haven't validated that in the lab and don't want to call anyone out publicly without reporting the issue to them first.  If you could tell me what antivirus/antimalware products and versions you have installed, that would be helpful.
So, third party stuff aside, I'd like to know more about the crashes your seeing:
1.) Please provide links to the Firefox crash reports. If you have multiples, the first few would be great.
     In Firefox, type about:crashes in the address bar
     If the link starts with "bp...", it's already been submitted -- just right-click on it and copy the link, and paste it into the reply here.
     If not, click it to submit it, and copy the subsequent link.
2.) In firefox, type about:support
     Just copy and paste the output into the reply.
3.) In Firefox, type about:plugins
     Please copy and paste the output into the reply
4.) Please provide the output of the DirectX Diagnostic Utility
     Click Start > type "dxdiag" [enter]
     Click Save All Information
     Copy the output of the file into the reply, or use Adobe SendNow/DropBox/PasteBin to share the file.
5.) If you can provide an exact URL and step-by-step instructions on repeating the crash (if it's consistent), that would be really helpful. My goal is to build out a configuration that matches yours as closely as possible, reproduce the problem and then debug it.
If you're not comfortable sharing that diagnostic information publicly, send me a private message. Just click my name and use the options on the right.
Thanks!

I was running Foxfire 3.6.9 and wanted to use FTP Program add-on and it did not appear to load but appeared but then would be installed but not run or appear under tools. So I deleted Foxfire 3.6.9 and down loaded to 3.5.9 so it could get FTP and it is do

I was running Foxfire 3.6.9 and wanted to use FTP Program add-on and it did not appear to load but appeared but then would be installed but not run or appear under tools. So I deleted Foxfire 3.6.9 and down loaded to 3.5.9 so it could get FTP and it is doing the same could not install. Even after I registered my copy. The last time I used this program it showed up under tools and worked great. any suggestions on whats going on and how I can get around this?.by ralphd3g

Delete the files extensions.* (extensions.rdf, extensions.cache, extensions.ini) and compatibility.ini in the Firefox [[Profiles|profile folder]] to reset the extensions registry.
See "Corrupt extension files": http://kb.mozillazine.org/Unable_to_install_themes_or_extensions
If you see disabled extensions that are not compatible on the next start in "Tools > Add-ons > Extensions" then click the "Find Updates" button to do a compatibility check.

TS1717 What do I have to do to keep the iTUNES program on my computer BUT NOT RUNNING on Start UP? It requires too much CPU usage on my old computer.

What do I have to do to keep the iTUNES loaded as a program on my computer BUT NOT RUNNING on Start UP? Just opening when I want to use it.
It requires too much CPU usage on my old computer.

You can check you Adobe account online to see if the serial number is registered under your account. If not then your only option will likely be to contact Adobe Support directly thru chat to see if they can provide you with a/the serial number. For them to do so will require you being able to prove ownership.
Serial number and activation chat support (non-CC)
http://helpx.adobe.com/x-productkb/global/service1.html ( http://adobe.ly/1aYjbSC )

How to programmatically load and show the front panel of a vi but NOT run it?

Is there a way to load and show the front panel of a vi but NOT run it? I am starting with the AsynchronousCallAndForget.vi from the example finder and inserted an invoke node with the FP Open method call prior to the Start Asynchronous Call node. The vi I am loading has the "Run when opened" unchecked and the menu bar IS visible so I can manually click the run arrow. Thanks!
Solved!
Go to Solution.

Why are you using the Async call? If you simply open the VI reference, then call the FP.Open method this works fine. You can then call the VI run method with Wait Until Done set to false if you wish to run it Asynchronously, this is how we did it in ye olde days before we had this new fangled "Start Asynchronous Call" stuff.
Charles Chickering
Architecture is art with rules.
...and the rules are more like guidelines

E71 Imap, can send but not receive

HI all
I received my E71 about a week ago and having major problems configuring it with my work email.
Its an IMAP mail. I can send fine but on most occasions cannot receive. Occasionally it downloads some mails but only twice in the last week. I think this shows the settings are correct.
Have tried to sign up with Nokia mail but get the following error message:
'Unable to connect with the information provided. Please try again.'
My colleagues in the UK use Blackberrys fine and have spoken with IT and they cannot think of any reason why this is happening. I have deleted the mailbox and set it up again many times but still can send but not receive...
Very grateful for any advice as really happy with the phone other than this which is the main reason why I bought it.
Shane

Hi Anne,
Is this IMAP or POP account?
Not certain, but this can fix myriad Mail problems...
Safe Boot from the HD, (holding Shift key down at bootup), it will try to repair your Disk Directory while the spinning radian is happening, so let it go, run Disk Utility in Applications>Utilities, then highlight your drive, click on Repair Permissions, then move these folder & file to the Desktop.
Move this Folder to the Desktop...
/Users/YourUserName/Library/Caches/Mail/
Move this file to the Desktop...
/Users/YourUserName/Library/Mail/Envelope Index
Reboot.

5th gen ipod can receive but not send emails

5th gen ipod can receive but not send emails. I have iPad with same settings and no issues. Yet, I keep getting "cannot send mail" the user name or password for "[email protected]" is incorrect. Please assist. I am not running both accounts simultaneously

See:
iOS: Unable to send or receive email
Did it work before?
I suspect a error in the settings for the outgoing mail server.

I can compile but not run ...

Similar Messages

Maybe you are looking for