Workshop tree and Field tree have become undocked

Hi All ,
I have 11.5 and have somehow undocked my Workshop tree
and Field tree in the Formula Editor. Now all my reports are that way !
Is there a reset button or something ?
I couldn't find anything in the Crystal environment
for something as simple as redocking a window.
Help
Thanks,
JImmy

Hi Jimmy,
There is a registry key that can reset the toolbars and dock them back.
Before you edit the registry, please back it up and make sure u2018Allow Dockingu2019 is selected for the particular tree that is not docked. Just right-click the blank area of the floating tree and check if u2018Allow Dockingu2019 is selected.
Go to start > run > regedit.
Browse through HKEY_CURRENT_USER > Software > Business Objects > Suite 11.5 > Crystal Reports > Formula Workshop.
Under this, the keys ToolBar-Bar1 to ToolBar-Bar3 are for each of the three trees. Depending on which one of them is undocked, click on the correct ToolBar-Bar1/2/3 keys. If you click on one of these keys, there should be a value on the right called u2018WindowNameu2019; this will show what tree the current key belongs to.
Once you select the right ToolBar key, on the right side look for u2018DockingStyleu2019 and set it to u2018f000u2019. Also look for u2018MRUFloatStyleu2019 and set it to u20180u2019.
Restart CR and open the Formula Workshop, the tree would still be undocked. To Dock it, just double-click the tree.
Hope this helps!
-Abhilash

Similar Messages

Binary tree and avl tree

hi iam not able to get the binary tree and avl tree in swings please any one help me
thanks in advance

Hi Rastabot.
If you look closely, it's not that different after all.
In each step of your recursion you need to do two things: decide whether to keep recursing, and decide what to return to the previous recursive call.
If you are trying to traverse your entire tree, then your logic to determine when to recurse and when not to is exactly the same as your example.
What you want to return each time is the number of operators in and below the node in the tree. One useful property of such an expression tree is that all the operands become leaves of the tree, and all other tree nodes are operators. Therefore, if the current node is a leaf node (your subTree == null case in your example), then that node is not an operator and has no operators below it in the tree, therefore you can return zero as the number of operators in or below that node. On the other hand, if the node is not a leaf node (your else case) then it must be an operator, and therefore you would return 1 (for that operator) plus the number of operators in each subtree below that node.
This is very similar to what you have already posted - mostly, where you have strings you need to replace with integer equivalents.
I can help with this if you need.
Mac.
Edited by: Mac.Coombe on Apr 30, 2009 11:00 PM - made explanation a little clearer

My address book and iPhone pics have become low resolution. Is there a way I can prevent this from happening when I start out with a higher resolution picture?

I guess I squeezed my entire issue into the subject line. lol When I sync my iphone to my laptop I notice that all my address book pics and iphone pics have become lower resolution, even though I started out with the resolution that I really needed to produce decenty address book printouts. I doubt I can correct the losses of resolution that have occurred but can anyone help me figure out how to prevent future losses? Thank you!

Plugins usually are installed externally to Firefox. However, you can disable them in Firefox so that Firefox does not use them.
SearchReset is supposed to automate the task of resetting certain preferences, but you still can edit them manually if necessary.
'''''Address Bar Search'''''
(1) In a new tab, type or paste '''about:config''' in the address bar and press Enter. Click the button promising to be careful.
(2) In the filter box, type or paste '''keyword''' and pause while the list is filtered
(3) Right-click '''keyword.URL''' and choose Reset. This should restore Google as the default for address bar search.
Does that work?
'''''Search Box'''''
Usually it works to choose your preferred search engine from the drop-down. To remove an unwanted search engine plugin, usually the Manage Search Engines... choice at the bottom of the drop-down takes care of it.
Do either of those work?
There might be another way to hijack that search box; I think some of the other frequent responders probably are more familiar with it than I am.

Macking button to expand the tree and collapse tree and another to add node

macking button to expand the tree and collapse tree and another to add node and saving the changes in the database ( this is problem)
and finally delete node from database
so what is proper code for those buttons
thanks my mail is :
[email protected]

Hello,
Use the ftree package's functions
code to expand all nodes:
PROCEDURE explose_tree IS
node    ftree.node;
htree   ITEM;
state   varchar2(30);
BEGIN
   -- search the tree ID --
   htree := Find_Item('BL_TREE.TREE_1');
    -- search the root --
     node := Ftree.Find_Tree_Node(htree, '');
    -- expand all nodes --
   WHILE NOT Ftree.ID_NULL(node) LOOP
      state := Ftree.Get_Tree_Node_Property(htree, node, Ftree.NODE_STATE);
      IF state = Ftree.COLLAPSED_NODE THEN
        Ftree.Set_Tree_Node_Property(htree, node, Ftree.NODE_STATE, Ftree.EXPANDED_NODE);
      END IF;
      node := Ftree.Find_Tree_Node(htree, '', ftree.find_NEXT,Ftree.NODE_LABEL,'', node);
   END LOOP;
END;and to collapse all nodes:
PROCEDURE Implose_tree IS
   node   ftree.node;
   htree ITEM;
   state varchar2(30);
BEGIN
   -- search the root ID --
   htree := Find_Item('BL_TREE.TREE_1');
   -- search the root --
   node := Ftree.Find_Tree_Node(htree, '');
   -- Collapse all nodes --
   WHILE NOT ftree.ID_NULL(node) LOOP
     state := Ftree.Get_Tree_Node_Property(htree, node, Ftree.NODE_STATE);
     IF state = Ftree.EXPANDED_NODE THEN
      Ftree.Set_Tree_Node_Property(htree, node, Ftree.NODE_STATE, Ftree.COLLAPSED_NODE);
     END IF;
    node := Ftree.Find_Tree_Node(htree, '', Ftree.FIND_NEXT,Ftree.NODE_LABEL, '', node);
   END LOOP;
END; Francois

CooCox CoBuilder and CooCox DeBugger have become more perfect now.

CooCox CoBuilder and CooCox DeBugger have become more perfect now.
CooCox CoBuilder, which adds many adds many features. For example, you can upload the code that you think is very excellent for share just click one "add" button. You can also view the module's function and registers configuration inforamtion description such as GPIO, ADC, UART and so on in the corresponding window of the sortware. You don't need to search and find the information in the datasheets. This makes it very convenient to develop and improve efficiency.
CooCox DeBugger and CooCox CoBuilder, they have the same splash screen, the two complement each other can also be used separately.
from http://www.coocox.org/

1. iPhoto needs to have the Library sitting on disk formatted Mac OS Extended (Journaled). Users with the Library sitting on disks otherwise formatted regularly report issues including, but not limited to, importing, exporting, saving edits and sharing the photos.
See this article
http://support.apple.com/kb/TS5168
for more. Note also the comment:
“Additionally, storing the iPhoto library on a network rather than locally on your computer can also lead to poor performance or data loss.”
2. So you weren't merging libraries but you were exporting files from one and importing them to another.
3. Do you have a back up?

Safari and iTunes somehow have become very slow

I am not sure that it is because of my upgrade to 10.5.6 but it feels like it started at the same time. Safari has become very very slow on most of the pages, and don't finish loading some pages (after 2 minutes). It is so bad that exactly the same pages ( I have tested about 20 of them) are up to 10 times faster on Firefox. I have the same performance issues with navigating in iTunes. I have used the maintenance scripts from Onyx not later than today and it did not change anything. Does anybody has the same issue ? Found a solution ?
Thank you in davance.

Thank you very much iBod, you did point the finger to the correct problem. This is a DNS issue which is the result of two bugs, one of them appears to be Leopard 10.5.6 but it is only affected because of an issue in my DSL/WLAN Router. The latest FritzBox router which you will mainly see in Germany and Austria are affected by this issue. The issue has been made public, and there will be a fix in the next few days. If you set the DNS servers like described in iBod solution, you will definitely have a workaround that works.
Thank you again for your help.

Why are my photos on recently downloaded Photoshop Elements 13, shown as touching their neighbours both above, below and at sides, and in effect have become a wall of photos! What has gone wrong?

I have recently downloaded Photoshop Elements 13 as an upgrade to PSE 8 which I have run for a year or two. Whenever I add photos to PSE 13, they appear as normal except that there is no space around each individual entry and all photos are crammed together and appear as a wall of photos. Why is this? What has gone wrong?

Moving the discussion to Photoshop Elements forum.
Thanks,
Atul Saini

Since loading the newest version of firefox, internet activities such as games and ebay bidding have become very sluggish.

Games move in slow motion.
Ebay bidding software also moves slowly resulting in missed bids.
The computer's clock is running accurately.

Maybe:
*Multiple Tab Handler: https://addons.mozilla.org/firefox/addon/multiple-tab-handler/

My iphon 4S and iPad 2 screen have become less responsive since I've updated to IOS8

Hi,
Since updating my os to IOS8 I have found that the touch screen on both my iPhone 4S and my iPad2 have become less responsive to gestures. They have also become laggy when performing commands.
They are two distinct issues though. I have noticed the decreased sensitivity most when logging in with my pin code. I hardly ever had to enter my pincode more than once because i missed a digit but now im doing it all the time. Also when using the YouTube app the time slider is so unresponsive... and the slider when watching a fullscreen vid within safari is the same.
I expected the laggyness after upgrading as they are older models but I don't understand why the sensitivity would reduce.
Anyone else?

Try resetting the wireless router.
http://support.apple.com/kb/TS1398

How to get the disco model with all tables and fields ?

Hello !
I have to make a document showing all the tables and fields I have in my EUL ... This would be a good documentation for our company and our clients too !
I haven't find any ways to perform this directly from disco admin and I can't make a query using the EUL tables ...
Please Help ...

Hi,
I am assuming you are using Discoverer 4.1/4i. In the Oracle Home\Discvr4 directory contains an EUL4.eex file. Import this in Admin edition, and it will create a business area on your EUL. Then you can get details on the Folders and Items and use it to create reports....
Cheers
Deepak

My Safari, Address Book and Mac Mail have stopped working.

Recently my Safari, Address book and Mac Mail have become unstable, I cannot edit or copy anything from my Address book, most of the time it'll stop responding before I can even view an address. My Safari keeps freezing and then crashing and I have to force quit, sometimes several times before it'll close. The Mac Mail won't do anything, it tries to download mail and then will sit there doing nothing, again sometimes I have to force quit several times before it'll actually quit.
I have run the extended hardware test and all is fine, I have reinstalled my OS and then restored my info from a backup and still it doesn't work. Can anyone shed any light on this?

Hi jen_bob,
My iMac is a trooper, so far this is the first time its played up - I have I pushed it too far?
I think you've just installed the wrong version of Safari, that's all. Safari 3.x is supposed to be for OS X 10.4 or 10.5 - according to your tag line you are using 10.3.9.
Assuming you are using 10.3.9, then the Safari install will have updated a few system frameworks that are used by other applications (such as Mail). In that case, the 'easiest' way to get things working again is to do an 'Archive & Install' and choose to preserve users and network settings.
http://support.apple.com/kb/HT1710

Need your assistance in mapping Structure and Field in DME Tree

Hello Friends - I need your help in "Mapping from structure field" in DME.
In the existing format tree, It is mapped Structure as "FPAYP" and Field name "BNAME" to populate Company Code name in the Payment file.
Now I am asked to change this to populate value either from OX02 or OX15.
When Company Code name was maintained, It was maintained in short and in the address tab, Full name is maintained.
Please let me know which Structue and Field I should assign to pull the value either from OX02 or OX15.
Thanks for your help.

Thanks a lot Henri/Lakshmi.
I have maintained mapping procedure Sturecture/field - FPAYHX/AUST1 to get the CoCd name in the file. In AUST1, Length of the CoCd is more than 18, and as per Bank format, It should be 18 characters in length.
User is not happy that complete CoCd name is not populated in the file. He has come up with an alternative and shortened the CoCd name that needs to be populated in the file and suggested us to get the value into the payment file. We should not replace CoCd name with the name he suggested in OX02/OX15,FBZP.
My doubt is that if there is any filed I can use to maintain the name he suggested and assign it in mapping procedure.
Thanks

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.

Hierarchical tree and interacting with data block

I have a hierarchical tree that is used to pick records that are shown in another data block. I have a list item in the data block that changes the arrangement of nodes in the hierarchy. My problem is that after the update, I select the node, but the wrong data shows up in the other data block (eg. node x is selected, x becomes a child of y, the data for y still appears in the data block even though node x is selected in the tree). There seems to be something wrong with my triggers, but I can't figure out what.
Here are the triggers that I am using.
In the tree block, tree item:
-WHEN-TREE-NODE-SELECTED
set_block_property(v_data_block, default_where, 'global_id = ' | | v_org);
go_block(v_data_block);
execute_query;
In the data block, list item
-WHEN-LIST-CHANGED:
-- find the tree node and select it
node := Ftree.Find_Tree_Node(...)
Ftree.set_tree_selection(v_tree,node,Ftree.SELECT_ON);
-- update the data block to show data from the selected node
set_block_property('GREENPAGES_DIR', default_where, 'global_id = ' | | :greenpages_dir.global_id);
go_block('GREENPAGES_DIR');
execute_query;
Thanks for your help.

hi
i didn't try doing it.. i assume the the reasons can be:
1.check the value of the variable 'v_org' because 'w-t-n-s' trigger fires twice..
2. 'w-t-n-s' trigger is not firing eventhough u select it through ur code in the list item trigger.. if not firing, use execute_trigger('w-t-n-s') and remove the last set of code (update section) from the list item trigger..(assuming 'GREENPAGES_DIR' = v_data_block)
hope this helps u
ajith

Missing Field Tree in Formula Editor

Post Author: dbennett
CA Forum: General
My field tree has dissapeared in teh formula editor.
It is not minimized but actually gone.
This happened once before and I found a fix that involved the registry but I cannot locate now.
Does anyone know where to locate this information?
Thanks

Between the two replies above, I think I figured it out.
I couldn't do "Allow Docking" because every time I selected Allow Docking... nothing happened. It didn't not put a check next to "Allow Docking" and it most definitely would not allow me to dock.
I have Crystal XI so the registry keys noted in the article weren't exactly right. So... I did something that was perhaps a little risky. I changed several of the toolbar docking style settings to "f000".
This didn't just automatically put them back on the tool bar. After doing that, it allowed me to "Allow Docking" and follow the first repliers instructions.
Not sure why Allow Docking isn't turned on by default. Thanks you both for your help.
--sam

Workshop tree and Field tree have become undocked

Similar Messages

Maybe you are looking for