CheckBox node tree with two diferent kind of nodes
Hai ,
I need to build a check box tree with two different kind of nodes , Child and Parent nodes .
CheckBox node tree with two diferent kind of nodes.
HOw will i write the renderer and editor for this ?
Study the method getTreeCellRendererComponent() of the class DefaultTreeCellRenderer.
Similar Messages
-
Current node tree with tooltip_text
Hello,
How can i display a tooltip_text for the current node from a tree ?
I tried with
:Ctrl.Node_Selected := Ftree.Get_Tree_Node_Property('BL_TREE.MENU',
:SYSTEM.TRIGGER_NODE,
Ftree.NODE_VALUE);
set_item_property('BL_TREE.MENU',
tooltip_text,
:Ctrl.Node_Selected);
I didn't find something with the build_in set_Tree_Node_Property
There is a possibility to display an icon for each node ? I build the tree with a record group. How can I do it ?
Thanks
Byehi,
you can set the tooltip-text of the whole treebean according to the currently selected "active" node.
Try to use the code you already used in a WHEN-TREE-NODE-SELECTED-Trigger.
It's not possible to have a tooltip-text for each node separately.
Yes, you can assign an icon to each node. Whn you use a recordgroup to fill the tree, one of the columns of the recordgroup has to be the name of the icon
If i remember correctly the columns are
NODE_STATE
NODE_DEPTH
NODE_LABEL
NODE_ICON
NODE_VALUE -
Can i use single node manager with two weblogic domain?
I am very new to weblogic and node manager.
i had created two domains in weblogic. (single node manger).
Can i connect both domains with same nodemanger?
How to do this?The node manager uses a nodemanager.domains file to determine which domains it manages, for example,
domain_name=/path_to_domain/domain_name
other_domain_name=/path_to_other_domain/other_domain_name
This file can be found in the NODEMANAGER_HOME, that you specified when starting the node manager (startNodeManager - NODEMGR_HOME="${WL_HOME}/../oracle_common/common/nodemanager")
When you are running the domain on multiple machines you have to enroll the node manager into the domain (http://docs.oracle.com/cd/E23943_01/web.1111/e13813/reference.htm#i1065827)
A scripted example can be found here: Middleware Snippets: Automate WebLogic Installation and Configuration. The Node Manager administration guide can be found here: Oracle® Fusion Middleware Node Manager Administrator's Guide for Oracle WebLogic Server 11g Release 1 (10.3.6) -…. -
Populating Tree with External XML File
I want to use external files for populating Flex 3
components. I have been successful using code very similar to that
below for a data grid & for a combo box, but it won't work for
a tree. Can you determine wh?
<?xml version="1.0" encoding="utf-8"?>
<mx:WindowedApplication xmlns:mx="
http://www.adobe.com/2006/mxml"
layout="absolute">
<mx:HTTPService id="dp_Tree1" url="Tree1.xml" />
<mx:Tree dataProvider="{dp_Tree1.lastResult.root.node}"
creationComplete="dp_Tree1.send()" width="333"/>
</mx:WindowedApplication>
It's not working & I can't determine why. Attached is my
xml file that I tested it with.Thanks a bunch folks, but my intent is to have as little code
as possible. I want to help people who are not coders create
designs using external xml files to populate controls. I was able
to create very simple code with just two lines to populate a
DataGrid from an external xml file:
<mx:HTTPService id="dp_DataGrid1" url="DataGrid1.xml"
/>
<mx:DataGrid
dataProvider="{dp_DataGrid1.lastResult.component.rows}"
creationComplete="dp_DataGrid1.send()" />
And just two lines for a ComboBox:
<mx:HTTPService id="dp_ComboBox1" url="ComboBox1.xml"
/>
<mx:ComboBox
dataProvider="{dp_ComboBox1.lastResult.component.rows}"
creationComplete="dp_ComboBox1.send()" />
Isn't it possible to populate a tree with two lines like as
it is with a DataGrid & ComboBox? -
JSF tree with radiobuttons support
Hi everybody,
I need to create JSF tree with possibility to select both nodes and leaves with radio button.
The only idea I have now is to create my own component, which will generate [BlueShoes JavaScript tree|http://www.blueshoes.org/_bsJavascript/components/tree/examples/example8.html]
Perhaps anyone has better idea? Maybe anyone has already met JSF trees with radiob uttons support?
Thanks beforehandunfortunately, the browser usually uses right click to bring up a browser's menu for copy/paste, etc. I don't think javascript can intercept that though I could be wrong.
-
I have create a node tree with CREATE OBJECT G_TREE and i have show it in the screen, but now i have to print it and i don´t have the standard functionality and i can´t see any method in the class CL_GUI_LIST_TREE that is the principal class that i have used for creating the nodes, is there any way of doing it or is there any transaction in Sap where i can see how to do it?.
Thank you very much in advanceHi Carl,
I dont think you can print a tree. It might be worthwhile to look at ALV Tree. I have used this and you can print this tree. The class is cl_gui_alv_tree. You can build hierarchical tree using this. Check the example BCALV_TREE_01.
Regards,
Vani -
HI All
I am working with alv tree (CL_GUI_ALV_TREE)and i want to rename a node name (via ON_NODE_CONTEXT_MENU_SELECT i provide the option to rename node)
in the tree and i found the method set_name but i dont have there
a place when can i put the key of node
there is diffrent way to update the node tree name ?
fior instance change node name from node_x to node_y on the node view , i have node_x key
Best regards
Alex
Edited by: Alex Dean on Sep 6, 2010 9:56 PMHello,
Please check this code.
DATA: k_node_layout TYPE lvc_s_lacn.
CONSTANTS: c_checked VALUE 'X'.
FIELD-SYMBOLS: <leaves> TYPE table,
<leaf> TYPE ANY.
Set the icon based on the parameter.
k_node_layout-u_n_image = c_checked.
k_node_layout-u_exp_imag = c_checked.
Set the icon value based on the parameter.
k_node_layout-n_image = new_icon.
k_node_layout-exp_image = new_icon.
Build the dynamic values for table and line.
ASSIGN leaves->* TO <leaves>.
CREATE DATA leaf LIKE LINE OF <leaves>.
ASSIGN leaf->* TO <leaf>.
Get the associated line item for the selected node.
tree->get_outtab_line( EXPORTING i_node_key = node_key
IMPORTING e_outtab_line = <leaf>
EXCEPTIONS node_not_found = 1
OTHERS = 2 ).
Update the icon of the node.
tree->change_node( EXPORTING i_node_key = node_key
i_outtab_line = <leaf>
is_node_layout = k_node_layout
EXCEPTIONS node_not_found = 1
OTHERS = 2 ).
Thanks.
Ramya. -
Using checkboxes as tree nodes
Hi friends,
can I add checkboxes as tree nodes? if yes, how this can be done?
Thanks in advances.Hi,
sorry, but this question is not really easy to parse ( I tried two times and gave up ), can you reword it. What is it that you want to synchronize with a tree selection ?
Frank -
Show two trees with same context structure
Hi,
I'm having problems showing two trees using the same context structure but different data simultaneously.
Here is my context structure:
tree (value node)
- expanded (boolean)
- label (string)
- leaf (boolean)
- recursion (recursion node with ref on tree)
I fill the first two layers of this tree in wdDoInit, the rest is loaded dynamically triggered by the onLoadChildren event.
This setting works fine for one tree. But I have the requirement to set up a second tree using the context structure of the first tree with different data. The problem is both should be shown simultaneously.
What I expected to work is:
1. to wrap the above mentioned structure into a container
2. make the tree a prototype (singleton=false) and
3. instantiate two tree nodes
4. fill both nodes with data
5. bind each with its corresponding ui elements manually
So the "shared" context structure would be:
treeContainer (value node)
- tree (value node, singleton=false)
-- expanded (boolean)
-- label (string)
-- leaf (boolean)
-- recursion (recursion node with ref on tree)
My data mapping code begins with these lines
ITreeContainerElement treeContainerElement =
treeContainerNode.createTreeContainerElement();
treeContainerNode.addElement(treeContainerElement);
ITreeNode treeFactory = wdContext.nodeTree();
which is then called one time for each tree. What happens is that both trees show the aggregated data, so each tree shows the data for both trees. When I use the factory of the element instead
ITreeContainerElement treeContainerElement =
treeContainerNode.createTreeContainerElement();
treeContainerNode.addElement(treeContainerElement);
ITreeNode treeFactory = treeContainerElement.nodeTree();
both trees show the data for the first tree.
I am aware that when I copy the context tree to a different location and rename every value node, e.h. tree2, recursion2 that this will work. But the problem is that the two trees will interact together, e.g. copy branches, and I want to use the typed API since the tree will get quite complex and they have absolutely the same structure.
I guess I'm getting sth. terribly wrong here with my understanding of the context, so any help is appreciated.
Best regards,
FabianHi,
It seems to be that my understanding of the context was terribly wrong. After I traced the behaviour in the debugger I realized that I made one important fault. The datasource of the UI elements should have been bound to the first and second instance of the recursion node container. Therefore the parent node should not be singleton since I access two instances simultaneously.
However, I now separated both trees in the context for the sake of maintainability. I work now with the generic API In order to reuse the functionality.
To determine the correct container I introduced the convention that the tree value node should only contain the recursion node. Then I use the following code to determine the right container:
private IWDNode getContainer(IWDNodeElement parentElement) {
IWDNode parentContainer = parentElement.node();
IWDNodeInfo parentContainerInfo = parentContainer.getNodeInfo();
boolean isRecursive = parentContainerInfo.isRecursive();
String childName = null;
if (isRecursive)
childName = parentContainerInfo.getName();
else {
IWDNodeInfo recursiveNodeInfo =
(IWDNodeInfo) parentContainer
.getNodeInfo()
.iterateChildren()
.next();
childName = recursiveNodeInfo.getName();
return parentContainer.getChildNode(childName, parentElement.index());
I'm sorry if my question was somehow imprecise and lead into the wrong direction. With the code now working I reckon the question as answered and give you both points for good answers!
Best regards,
Fabian -
ALV Tree with editable checkbox
Hi all,
I have a ALV Tree with editable checkbox (for all the parent & leaf nodes) , as one of the column.On clicking of a button in toolbar , i should get the nodes which are checked in checkbox.
But the problem is i am not able to get the nodes which are checked through checkbox in the PAI of the screen,when the button is clicked.
I tried using
CALL METHOD wf_tree->get_checked_items
IMPORTING
et_checked_items = lint_selected_node.
but the return table is not containing any entries , even if check boxes are checked in ALV tree.I tried the GET_CHECKED_ITEMS method in event handler method of AFTER_USER_COMMAND and also CHECKBOX_CHANGE , but no success.
lfs_item_layout-fieldname = 'CHECK'.
lfs_item_layout-class = cl_gui_column_tree=>item_class_checkbox.
lfs_item_layout-editable = 'X'.
lfs_item_layout-CHOSEN = 'X'.
APPEND lfs_item_layout TO lint_item_layout.
CALL METHOD wf_tree->add_node
EXPORTING
i_relat_node_key = p_lfs_final_key
i_relationship = cl_gui_column_tree=>relat_last_child
i_node_text = l_node_text
is_outtab_line = p_gfs_final
is_node_layout = lfs_node
it_item_layout = lint_item_layout
IMPORTING
e_new_node_key = p_loc_qmnum_key.
Friends ,if you can suggest something.
Thanks
Abhijeethi ,
i have written below code for registering the CHECKBOX_CHANGE event of CL_GUI_ALV_TREE.
APPEND lfs_event TO lint_events.
lfs_event-eventid = cl_gui_column_tree=>eventid_CHECKBOX_CHANGE.
APPEND lfs_event TO lint_events.
CALL METHOD wf_tree->set_registered_events
EXPORTING
events = lint_events
EXCEPTIONS
cntl_error = 1
cntl_system_error = 2
illegal_event_combination = 3.
IF sy-subrc EQ 0.
* MESSAGE X208(00) WITH 'ERROR'. "#EC NOTEXT
ENDIF.
SET HANDLER lo_event_receiver->handle_checkbox_change FOR wf_tree.
* SET HANDLER lo_event_receiver->handle_button_click FOR wf_tree.
ENDIF.
Also according to below code , i have put a break point in the event handler method of CHECKBOX_CHANGE event , so that control shall come here when check box is checked on ALV tree ...
CLASS lcl_event_receiver DEFINITION.
PUBLIC SECTION.
METHODS:
* handle_checkbox_change FOR EVENT checkbox_change OF cl_gui_alv_tree,
* importing fcode.
* handle_button_click FOR EVENT AFTER_USER_COMMAND OF cl_gui_alv_tree
* IMPORTING ucomm,
handle_CHECKBOX_CHANGE for event checkbox_change of cl_gui_alv_tree
importing CHECKED
FIELDNAME
NODE_KEY.
ENDCLASS. "lcl_event_receiver DEFINITION
* CLASS lcl_event_receiver IMPLEMENTATION
CLASS lcl_event_receiver IMPLEMENTATION.
METHOD handle_checkbox_change.
data : lint_selected_node TYPE LVC_T_CHIT.
BREAK abhijeetg.
* CHECKED
* FIELDNAME
* NODE_KEY
* case fcode.
* when 'SELALL'.
* perform select_all.
* CALL METHOD WF_TREE->GET_OUTTAB_LINE
* EXPORTING
* I_NODE_KEY =
** IMPORTING
** e_outtab_line =
** e_node_text =
** et_item_layout =
** es_node_layout =
** EXCEPTIONS
** node_not_found = 1
** others = 2
* IF SY-SUBRC <> 0.
** MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
** WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
* ENDIF.
* call method cl_gui_cfw=>dispatch.
CALL METHOD wf_tree->get_checked_items
IMPORTING
et_checked_items = lint_selected_node.
break abhijeetg.
ENDMETHOD.
ENDCLASS.
So according to you , I should get the control in the break point , but its not happening with this .. any thing missing ???
Edited by: abhijeet_7013 on Jun 21, 2011 10:31 PM -
Election problem after repeated split-brains with two nodes
Hi
I'm using a customized source based on BDB-5.1.19 (excxx_repquote)
with two site one - MASTER and the other SLAVE...
nsite=2
ack=quorum
- the master is writing to quotedb at a rate of 10 txn per sec
- the test consist to isolate the client from the master (split brain) and reconnect it after a random time include from 1sec to 10sec
the test run well about 10 times but at a moment the process slave receive DB_EVENT_REP_ELECTION_FAILED
and the master enter in election mode and never exit from the CLIENT mode. I must say that to freeze the client I decide to kill me (kill -9 my pid) when I receive such event...
here is the verbose log on the master...
[1307872770:871621][6510/47655809107168] MASTER: rep_send_function returned: 110
[1307872770:973655][6510/47655809107168] MASTER: bulk_msg: Send buffer after copy due to PERM
[1307872770:973667][6510/47655809107168] MASTER: send_bulk: Send 266 (0x10a) bulk buffer bytes
[1307872770:973672][6510/47655809107168] MASTER: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 68 eid -1, type bulk_log, LSN [21][986648] perm
[1307872770:973693][6510/47655809107168] MASTER: will await acknowledgement: need 1
[1307872771:26623][6510/47655809107168] MASTER: rep_send_function returned: 110
[1307872771:126380][6510/1162996032] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type log, LSN [21][946345]
[1307872771:126407][6510/1162996032] MASTER: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 68 eid -1, type dupmaster, LSN [0][0] nobuf
[1307872771:126695][6510/1162996032] MASTER: rep_start: Found old version log 17
[1307872771:126753][6510/1162996032] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 68 eid -1, type newclient, LSN [0][0] nobuf
[1307872771:126833][6510/1183975744] CLIENT: starting election thread
[1307872771:126876][6510/1183975744] CLIENT: Start election nsites 2, ack 1, priority 100
[1307872771:126890][6510/1183975744] CLIENT: Election thread owns egen 69
[1307872771:127423][6510/1173485888] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type newclient, LSN [0][0]
[1307872771:130079][6510/1183975744] CLIENT: Tallying VOTE1[0] (2147483647, 69)
[1307872771:130113][6510/1183975744] CLIENT: Beginning an election
[1307872771:130134][6510/1183975744] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 68 eid -1, type vote1, LSN [21][986728] nobuf
[1307872771:130147][6510/1173485888] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 68 eid -1, type master_req, LSN [0][0] nobuf
[1307872771:130438][6510/1152506176] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type vote1, LSN [21][946437]
[1307872771:130460][6510/1162996032] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type alive, LSN [21][986728]
[1307872771:130467][6510/1152506176] CLIENT: Updating gen from 68 to 70
[1307872771:130482][6510/1162996032] CLIENT: Received ALIVE egen of 71, mine 69
[1307872771:130503][6510/1162996032] CLIENT: Election finished in 0.003602000 sec
[1307872771:130515][6510/1162996032] CLIENT: Election done; egen 70
[1307872771:130534][6510/1152506176] CLIENT: Received vote1 egen 71, egen 71
[1307872771:130581][6510/1152506176] CLIENT: Tallying VOTE1[0] (0, 71)
[1307872771:130593][6510/1089075520] CLIENT: starting election thread
[1307872771:130619][6510/1152506176] CLIENT: Incoming vote: (eid)0 (pri)100 ELECTABLE (gen)70 (egen)71 [21,946437]
[1307872771:130642][6510/1152506176] CLIENT: Not in election, but received vote1 0x282c 0x8
[1307872771:130674][6510/1089075520] CLIENT: Start election nsites 2, ack 1, priority 100
[1307872771:130692][6510/1089075520] CLIENT: Election thread owns egen 71
[1307872771:130704][6510/1194465600] CLIENT: starting election thread
[1307872771:130733][6510/1194465600] CLIENT: Start election nsites 2, ack 1, priority 100
[1307872771:132922][6510/1089075520] CLIENT: Tallying VOTE1[1] (2147483647, 71)
[1307872771:132949][6510/1089075520] CLIENT: Accepting new vote
[1307872771:132958][6510/1089075520] CLIENT: Beginning an election
[1307872771:132973][6510/1089075520] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid -1, type vote1, LSN [21][986728] nobuf
[1307872771:132985][6510/1194465600] CLIENT: election thread is exiting
[1307872771:133012][6510/1089075520] CLIENT: Tallying VOTE2[0] (2147483647, 71)
[1307872771:133037][6510/1089075520] CLIENT: Counted my vote 1
[1307872771:133048][6510/1089075520] CLIENT: Skipping phase2 wait: already got 1 votes
[1307872771:133060][6510/1089075520] CLIENT: Got enough votes to win; election done; (prev) gen 70
[1307872771:133071][6510/1089075520] CLIENT: Election finished in 0.002367000 sec
[1307872771:133084][6510/1089075520] CLIENT: Election done; egen 72
[1307872771:133111][6510/1089075520] CLIENT: Ended election with 0, e_th 1, egen 72, flag 0x2a2c, e_fl 0x0, lo_fl 0x6
[1307872771:133170][6510/1173485888] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type alive, LSN [0][0]
[1307872771:133187][6510/1173485888] CLIENT: Racing replication msg lockout, ignore message.
[1307872771:173744][6510/1162996032] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type vote2, LSN [0][0]
[1307872771:173769][6510/1162996032] CLIENT: Racing replication msg lockout, ignore message.
[1307872771:231593][6510/1183975744] CLIENT: Ended election with 0, e_th 0, egen 72, flag 0x2a2c, e_fl 0x0, lo_fl 0x1c
[1307872771:231629][6510/1183975744] CLIENT: election thread is exiting
[1307872777:443794][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307872971:644194][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307873165:844583][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307873360:44955][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307873554:245347][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307873748:445736][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307873942:646117][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
[1307874136:846509][6510/1131526464] CLIENT: init connection to site 2.0.0.210:12345 with result 115
.... and infinite stay to this situation
My question is why the Master is suddenly transformed into CLIENT and why it's never returning to the MASTER
Thanks in advance ...
here is the log for the client
[1307872315:455113][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type log, LSN [21][984396]
[1307872315:455134][1282/1160603968] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type log, LSN [21][984483] perm
[1307872315:609962][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][984733] perm
[1307872315:764958][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][984986] perm
[1307872315:919962][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][985238] perm
[1307872316:75018][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][985491] perm
[1307872316:229959][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][985741] perm
[1307872316:384949][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][985993] perm
[1307872316:499899][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][986141] perm
[1307872316:539895][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type log, LSN [21][986221]
[1307872316:540078][1282/1171093824] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type log, LSN [21][986307]
[1307872316:540100][1282/1160603968] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type log, LSN [21][986394] perm
[1307872316:694950][1282/1171093824] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type bulk_log, LSN [21][986648] perm
[1307872316:847349][1282/1129134400] MASTER: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid -1, type log, LSN [21][946345]
[1307872316:847698][1282/1171093824] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type dupmaster, LSN [0][0]
[1307872316:847999][1282/1181583680] MASTER: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type newclient, LSN [0][0]
[1307872316:848168][1282/1171093824] MASTER: rep_start: Found old version log 17
[1307872316:848222][1282/1181583680] CLIENT: Racing replication msg lockout, ignore message.
[1307872316:848398][1282/1171093824] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid -1, type newclient, LSN [0][0] nobuf
[1307872316:848504][1282/1192073536] CLIENT: starting election thread
[1307872316:848542][1282/1192073536] CLIENT: Start election nsites 2, ack 1, priority 100
[1307872316:848566][1282/1192073536] CLIENT: Election thread owns egen 71
[1307872316:849634][1282/1192073536] CLIENT: Tallying VOTE1[0] (2147483647, 71)
[1307872316:849654][1282/1192073536] CLIENT: Beginning an election
[1307872316:849680][1282/1192073536] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid -1, type vote1, LSN [21][946437] nobuf
[1307872316:851403][1282/1160603968] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type vote1, LSN [21][986728]
[1307872316:851448][1282/1160603968] CLIENT: Received vote1 egen 69, egen 71
[1307872316:851470][1282/1160603968] CLIENT: Received old vote 69, egen 71, ignoring vote1
[1307872316:851481][1282/1160603968] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid 0, type alive, LSN [21][986728] nobuf
[1307872316:851538][1282/1171093824] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 68 eid 0, type master_req, LSN [0][0]
[1307872316:851558][1282/1171093824] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid 0, type alive, LSN [0][0] nobuf
[1307872316:854254][1282/1160603968] CLIENT: /opt/bdb/ rep_process_message: msgv = 5 logv 17 gen = 70 eid 0, type vote1, LSN [21][986728]
[1307872316:854275][1282/1160603968] CLIENT: Received vote1 egen 71, egen 71
[1307872316:854317][1282/1160603968] CLIENT: Tallying VOTE1[1] (0, 71)
[1307872316:854339][1282/1160603968] CLIENT: Incoming vote: (eid)0 (pri)100 ELECTABLE (gen)70 (egen)71 [21,986728]
[1307872316:854353][1282/1160603968] CLIENT: Existing vote: (eid)2147483647 (pri)100 (gen)70 (sites)2 [21,946437]
[1307872316:854369][1282/1160603968] CLIENT: Accepting new vote
[1307872316:854379][1282/1160603968] CLIENT: Phase1 election done
[1307872316:854395][1282/1160603968] CLIENT: Voting for 0
[1307872316:854407][1282/1160603968] CLIENT: /opt/bdb/ rep_send_message: msgv = 5 logv 17 gen = 70 eid 0, type vote2, LSN [0][0] nobuf
[1307872317:960344][1282/1192073536] CLIENT: After phase 2: votes 0, nvotes 1, nsites 2
[1307872317:960389][1282/1192073536] CLIENT: Election finished in 1.111809000 sec
[1307872317:960401][1282/1192073536] CLIENT: Election done; egen 72
[1307872317:960412][1282/1192073536] CLIENT: Ended election with -30974, e_th 0, egen 72, flag 0x282c, e_fl 0x0, lo_fl 0x0
Kill me !!
--- my source
on the master I run manually :
txn_rate 1
loop_rate 10
loop 1 20000
* See the file LICENSE for redistribution information.
* Copyright (c) 2001, 2010 Oracle and/or its affiliates. All rights reserved.
* $Id$
* In this application, we specify all communication via the command line. In
* a real application, we would expect that information about the other sites
* in the system would be maintained in some sort of configuration file. The
* critical part of this interface is that we assume at startup that we can
* find out
* 1) what our Berkeley DB home environment is,
* 2) what host/port we wish to listen on for connections; and
* 3) an optional list of other sites we should attempt to connect to.
* These pieces of information are expressed by the following flags.
* -h home (required; h stands for home directory)
* -l host:port (required; l stands for local)
* -C or -M (optional; start up as client or master)
* -r host:port (optional; r stands for remote; any number of these may be
* specified)
* -R host:port (optional; R stands for remote peer; only one of these may
* be specified)
* -a all|quorum (optional; a stands for ack policy)
* -b (optional; b stands for bulk)
* -n nsites (optional; number of sites in replication group; defaults to 0
* to try to dynamically compute nsites)
* -p priority (optional; defaults to 100)
* -v (optional; v stands for verbose)
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <sys/types.h>
#include <signal.h>
#include <db_cxx.h>
#include "RepConfigInfo.h"
#include "dbc_auto.h"
using std::cout;
using std::cin;
using std::cerr;
using std::endl;
using std::ends;
using std::flush;
using std::istream;
using std::istringstream;
using std::ostringstream;
using std::string;
using std::getline;
#include <stdio.h>
#include <readline/readline.h>
#include <readline/history.h>
#define CACHESIZE (10 * 1024 * 1024)
#define DATABASE "quote.db"
#define DATABASE2 "quote2.db"
const char *progname = "excxx_repquote";
#include <errno.h>
#ifdef _WIN32
#define WIN32_LEAN_AND_MEAN
#include <windows.h>
#define snprintf _snprintf
#define sleep(s) Sleep(1000 * (s))
extern "C" {
extern int getopt(int, char * const *, const char *);
extern char *optarg;
typedef HANDLE thread_t;
typedef DWORD thread_exit_status_t;
#define thread_create(thrp, attr, func, arg) \
(((*(thrp) = CreateThread(NULL, 0, \
(LPTHREAD_START_ROUTINE)(func), (arg), 0, NULL)) == NULL) ? -1 : 0)
#define thread_join(thr, statusp) \
((WaitForSingleObject((thr), INFINITE) == WAIT_OBJECT_0) && \
GetExitCodeThread((thr), (LPDWORD)(statusp)) ? 0 : -1)
#else /* !_WIN32 */
#include <pthread.h>
typedef pthread_t thread_t;
typedef void* thread_exit_status_t;
#define thread_create(thrp, attr, func, arg) \
pthread_create((thrp), (attr), (func), (arg))
#define thread_join(thr, statusp) pthread_join((thr), (statusp))
#endif
// Struct used to store information in Db app_private field.
typedef struct {
bool app_finished;
bool in_client_sync;
bool is_master;
bool no_dummy_wr;
} APP_DATA;
static void log(const char *);
void checkpoint_thread (void );
void log_archive_thread (void );
void dummy_write_thread (void );
class RepQuoteExample {
public:
RepQuoteExample();
void init(RepConfigInfo* config);
void doloop();
int terminate();
static void event_callback(DbEnv* dbenv, u_int32_t which, void *info);
void print_stocks_size(Db *dbp);
private:
// disable copy constructor.
RepQuoteExample(const RepQuoteExample &);
void operator = (const RepQuoteExample &);
// internal data members.
APP_DATA app_data;
RepConfigInfo *app_config;
DbEnv cur_env;
thread_t ckp_thr;
thread_t lga_thr;
thread_t dmy_thr;
// private methods.
void print_stocks(Db *dbp);
void print_env(DbEnv *dbenv);
void prompt();
RepQuoteExample *g_runner=NULL;
RepConfigInfo *g_config=NULL;
class DbHolder {
public:
DbHolder(DbEnv env, const char _dbname) : env(env)
dbp = 0;
if (_dbname) dbname=_dbname;
else dbname=DATABASE;
~DbHolder() {
try {
close();
} catch (...) {
// Ignore: this may mean another exception is pending
bool ensure_open(bool creating) {
if (dbp)
return (true);
dbp = new Db(env, 0);
u_int32_t flags = DB_AUTO_COMMIT;
if (creating)
flags |= DB_CREATE;
try {
//dbp->open(NULL, DATABASE, NULL, DB_BTREE, flags, 0);
//dbp->open(NULL, dbname, NULL, DB_BTREE, flags, 0);
dbp->open(NULL, NULL, dbname, DB_BTREE, flags, 0);
return (true);
} catch (DbDeadlockException e) {
} catch (DbRepHandleDeadException e) {
} catch (DbException e) {
if (e.get_errno() == DB_REP_LOCKOUT) {
// Just fall through.
} else if (e.get_errno() == ENOENT && !creating) {
// Provide a bit of extra explanation.
log("Stock DB does not yet exist");
} else
throw;
// (All retryable errors fall through to here.)
log("please retry the operation");
close();
return (false);
void close() {
if (dbp) {
try {
dbp->close(0);
delete dbp;
dbp = 0;
} catch (...) {
delete dbp;
dbp = 0;
throw;
operator Db *() {
return dbp;
Db *operator->() {
return dbp;
private:
Db *dbp;
DbEnv *env;
const char *dbname;
class StringDbt : public Dbt {
public:
#define GET_STRING_OK 0
#define GET_STRING_INVALID_PARAM 1
#define GET_STRING_SMALL_BUFFER 2
#define GET_STRING_EMPTY_DATA 3
int get_string(char **buf, size_t buf_len)
size_t copy_len;
int ret = GET_STRING_OK;
if (buf == NULL) {
cerr << "Invalid input buffer to get_string" << endl;
return GET_STRING_INVALID_PARAM;
// make sure the string is null terminated.
memset(*buf, 0, buf_len);
// if there is no string, just return.
if (get_data() == NULL || get_size() == 0)
return GET_STRING_OK;
if (get_size() >= buf_len) {
ret = GET_STRING_SMALL_BUFFER;
copy_len = buf_len - 1; // save room for a terminator.
} else
copy_len = get_size();
memcpy(*buf, get_data(), copy_len);
return ret;
size_t get_string_length()
if (get_size() == 0)
return 0;
return strlen((char *)get_data());
void set_string(char *string)
set_data(string);
set_size((u_int32_t)strlen(string));
StringDbt(char *string) :
Dbt(string, (u_int32_t)strlen(string)) {};
StringDbt() : Dbt() {};
~StringDbt() {};
// Don't add extra data to this sub-class since we want it to remain
// compatible with Dbt objects created internally by Berkeley DB.
Db *g_repquote=NULL;
RepQuoteExample::RepQuoteExample() : app_config(0), cur_env(0) {
app_data.app_finished = 0;
app_data.in_client_sync = 0;
app_data.is_master = 0; // assume I start out as client
app_data.no_dummy_wr = 0 ; //prevent to run dummy write
int (*old_rep_process_message)
__P((DB_ENV *, DBT *, DBT *, int, DB_LSN *));
int my_rep_process_message __P((DB_ENV arg1, DBT arg2, DBT arg3, int arg4, DB_LSN arg5))
printf("EZ->>> my_rep_process_message:%p\n",arg5);
old_rep_process_message(arg1,arg2,arg3,arg4,arg5);
void RepQuoteExample::init(RepConfigInfo *config) {
app_config = config;
cur_env.set_app_private(&app_data);
cur_env.set_errfile(stderr);
app_data.no_dummy_wr=config->no_dummy_wr;
if (app_data.no_dummy_wr)
printf("No dummy !!!\n");
//EZ->cur_env.set_errpfx(progname);
cur_env.set_event_notify(event_callback);
// Configure bulk transfer to send groups of records to clients
// in a single network transfer. This is useful for master sites
// and clients participating in client-to-client synchronization.
if (app_config->bulk)
cur_env.rep_set_config(DB_REP_CONF_BULK, 1);
// Set the total number of sites in the replication group.
// This is used by repmgr internal election processing.
if (app_config->totalsites > 0)
cur_env.rep_set_nsites(app_config->totalsites);
// Turn on debugging and informational output if requested.
if (app_config->verbose)
cur_env.set_verbose(DB_VERB_REPLICATION, 1);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 1);
cur_env.set_verbose(DB_VERB_RECOVERY, 1);
cur_env.set_verbose(DB_VERB_REPLICATION, 1);
cur_env.set_verbose(DB_VERB_REP_ELECT, 1);
cur_env.set_verbose(DB_VERB_REP_LEASE, 1);
cur_env.set_verbose(DB_VERB_REP_SYNC, 1);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 1);
// Set replication group election priority for this environment.
// An election first selects the site with the most recent log
// records as the new master. If multiple sites have the most
// recent log records, the site with the highest priority value
// is selected as master.
cur_env.rep_set_priority(app_config->priority);
// Set the policy that determines how master and client sites
// handle acknowledgement of replication messages needed for
// permanent records. The default policy of "quorum" requires only
// a quorum of electable peers sufficient to ensure a permanent
// record remains durable if an election is held. The "all" option
// requires all clients to acknowledge a permanent replication
// message instead.
cur_env.repmgr_set_ack_policy(app_config->ack_policy);
// Set the threshold for the minimum and maximum time the client
// waits before requesting retransmission of a missing message.
// Base these values on the performance and load characteristics
// of the master and client host platforms as well as the round
// trip message time.
cur_env.rep_set_request(20000, 500000);
// Configure deadlock detection to ensure that any deadlocks
// are broken by having one of the conflicting lock requests
// rejected. DB_LOCK_DEFAULT uses the lock policy specified
// at environment creation time or DB_LOCK_RANDOM if none was
// specified.
cur_env.set_lk_detect(DB_LOCK_DEFAULT);
// The following base replication features may also be useful to your
// application. See Berkeley DB documentation for more details.
// - Master leases: Provide stricter consistency for data reads
// on a master site.
// - Timeouts: Customize the amount of time Berkeley DB waits
// for such things as an election to be concluded or a master
// lease to be granted.
// - Delayed client synchronization: Manage the master site's
// resources by spreading out resource-intensive client
// synchronizations.
// - Blocked client operations: Return immediately with an error
// instead of waiting indefinitely if a client operation is
// blocked by an ongoing client synchronization.
cur_env.repmgr_set_local_site(app_config->this_host.host,
app_config->this_host.port, 0);
for ( REP_HOST_INFO *cur = app_config->other_hosts; cur != NULL;
cur = cur->next) {
cur_env.repmgr_add_remote_site(cur->host, cur->port,
NULL, cur->peer ? DB_REPMGR_PEER : 0);
// Configure heartbeat timeouts so that repmgr monitors the
// health of the TCP connection. Master sites broadcast a heartbeat
// at the frequency specified by the DB_REP_HEARTBEAT_SEND timeout.
// Client sites wait for message activity the length of the
// DB_REP_HEARTBEAT_MONITOR timeout before concluding that the
// connection to the master is lost. The DB_REP_HEARTBEAT_MONITOR
// timeout should be longer than the DB_REP_HEARTBEAT_SEND timeout.
cur_env.rep_set_timeout(DB_REP_HEARTBEAT_SEND, 5000000);
cur_env.rep_set_timeout(DB_REP_HEARTBEAT_MONITOR, 10000000);
// The following repmgr features may also be useful to your
// application. See Berkeley DB documentation for more details.
// - Two-site strict majority rule - In a two-site replication
// group, require both sites to be available to elect a new
// master.
// - Timeouts - Customize the amount of time repmgr waits
// for such things as waiting for acknowledgements or attempting
// to reconnect to other sites.
// - Site list - return a list of sites currently known to repmgr.
// We can now open our environment, although we're not ready to
// begin replicating. However, we want to have a dbenv around
// so that we can send it into any of our message handlers.
cur_env.set_cachesize(0, CACHESIZE, 0);
cur_env.set_flags(DB_REP_PERMANENT, 1);
//cur_env.set_flags(DB_TXN_WRITE_NOSYNC, 1);
/* u_int32_t maxlocks=300000;
if (maxlocks != 0)
cur_env.set_lk_max_locks(maxlocks);
u_int32_t maxlocks_o=300000;
if (maxlocks_o != 0)
cur_env.set_lk_max_objects(maxlocks_o);
u_int32_t maxmutex=300000;
if (maxmutex != 0)
cur_env.mutex_set_max(maxmutex);
DbEnv *m_env=&cur_env;
m_env->set_flags(DB_TXN_NOSYNC, 1);
m_env->set_lk_max_lockers(60000);
m_env->set_lk_max_objects(60000);
m_env->set_lk_max_locks(60000);
m_env->set_tx_max(60000);
//m_env->repmgr_set_ack_policy(DB_REPMGR_ACKS_NONE);
m_env->rep_set_timeout(DB_REP_ACK_TIMEOUT, 50 * 1000); //50ms
m_env->rep_set_timeout(DB_REP_CHECKPOINT_DELAY, 0);
//m_env->rep_set_timeout(DB_REP_CONNECTION_RETRY, 30 * 1000 * 1000); // 30 seconds
m_env->rep_set_timeout(DB_REP_ELECTION_TIMEOUT, 1 * 1000 * 1000); // 5 seconds
m_env->rep_set_timeout(DB_REP_FULL_ELECTION_TIMEOUT, 5 * 1000 * 1000); // 5 seconds
m_env->rep_set_timeout(DB_REP_CONNECTION_RETRY, 5 * 1000 * 1000);
//m_env->rep_set_timeout(DB_REP_ELECTION_RETRY, 10 * 1000 * 1000); //10 seconds
//m_env->rep_set_timeout(DB_REP_HEARTBEAT_MONITOR, 80 * 1000 * 1000); //80 seconds
//m_env->rep_set_timeout(DB_REP_HEARTBEAT_SEND, 500 * 1000); //500 milli seconds
//The minimum number of microseconds a client waits before requesting retransmission
u_int32_t rep_req_min = 40000; //40 000 microsec = 40 mili
//The maximum number of microseconds a client waits before requesting retransmission
u_int32_t rep_req_max = 1280000;// 1 280 000 microsec = 1.28 sec
u_int32_t rep_limit_gbytes = 0;
u_int32_t rep_limit_bytes = 100 * 1024 * 1024; // 100MB
m_env->rep_set_request(rep_req_min, rep_req_max);
m_env->rep_set_limit(rep_limit_gbytes, rep_limit_bytes);
cur_env.open(app_config->home, DB_CREATE | DB_RECOVER |
DB_THREAD | DB_INIT_REP | DB_INIT_LOCK | DB_INIT_LOG |
DB_INIT_MPOOL | DB_INIT_TXN , 0);
//keep old function for chain
//old_rep_process_message=cur_env.get_DB_ENV()->rep_process_message;
//derouting
//cur_env.get_DB_ENV()->rep_process_message=my_rep_process_message;
/*int _i;
cur_env.log_get_config(DB_LOG_DIRECT, &_i);printf ("DB_LOG_DIRECT = %d\n",_i);
cur_env.log_get_config(DB_LOG_DSYNC, &_i);printf ("DB_LOG_DSYNC = %d\n",_i);
cur_env.log_get_config(DB_LOG_AUTO_REMOVE, &_i);printf ("DB_LOG_AUTO_REMOVE = %d\n",_i);
cur_env.log_get_config(DB_LOG_IN_MEMORY, &_i);printf ("DB_LOG_IN_MEMORY = %d\n",_i);
cur_env.log_get_config(DB_LOG_ZERO,&_i);printf ("DB_LOG_ZERO = %d\n",_i);
// Start checkpoint and log archive support threads.
(void)thread_create(&ckp_thr, NULL, checkpoint_thread, &cur_env);
(void)thread_create(&lga_thr, NULL, log_archive_thread, &cur_env);
(void)thread_create(&dmy_thr, NULL, dummy_write_thread, &cur_env);
cur_env.repmgr_start(3, app_config->start_policy);
}int RepQuoteExample::terminate() {
try {
// Wait for checkpoint and log archive threads to finish.
// Windows does not allow NULL pointer for exit code variable.
thread_exit_status_t exstat;
(void)thread_join(lga_thr, &exstat);
(void)thread_join(ckp_thr, &exstat);
(void)thread_join(dmy_thr, &exstat);
// We have used the DB_TXN_NOSYNC environment flag for
// improved performance without the usual sacrifice of
// transactional durability, as discussed in the
// "Transactional guarantees" page of the Reference
// Guide: if one replication site crashes, we can
// expect the data to exist at another site. However,
// in case we shut down all sites gracefully, we push
// out the end of the log here so that the most
// recent transactions don't mysteriously disappear.
cur_env.log_flush(NULL);
cur_env.close(0);
} catch (DbException dbe) {
cout << "error closing environment: " << dbe.what() << endl;
return 0;
void RepQuoteExample::prompt() {
cout << "QUOTESERVER";
if (!app_data.is_master)
cout << "(read-only)";
cout << "> " << flush;
void log(const char *msg) {
time_t currentTime;
// get and print the current time
time (¤tTime); // fill now with the current time
char buff[255];
strncpy(buff,ctime(¤tTime),sizeof(buff));
char *p;
for(p =buff ; *p != '\n'; p++);
*p = '\0';
cerr << buff << " - " << msg << endl;
// Simple command-line user interface:
// - enter "<stock symbol> <price>" to insert or update a record in the
// database;
// - just press Return (i.e., blank input line) to print out the contents of
// the database;
// - enter "quit" or "exit" to quit.
void RepQuoteExample::doloop() {
DbHolder dbh1(&cur_env,DATABASE);
DbHolder dbh2(&cur_env,DATABASE2);
DbHolder *dbh=&dbh1;
DbTxn *txn;
string input;
bool truncate = false;
char *c;
using_history();
g_repquote=*dbh;
int loop_rate = 0;
int txn_rate = 500;
while (prompt(), /*getline(cin, input)*/c=readline(NULL)) {
input=std::string(c);
add_history(c);
free(c);
int start_loop = 0;
int end_loop = 0;
int start_loop_d = 0;
int end_loop_d = 0;
istringstream is(input);
string token1, token2, token3;
truncate = false;
start_loop = 0;
end_loop = 0;
// Read 0, 1 or 2 tokens from the input.
int count = 0;
if (is >> token1) {
count++;
if (is >> token2)
count++;
if (is >> token3)
count++;
if (count == 1) {
if (token1 == "truncate" ) {
truncate = true;
else if (token1 == "env" ){
print_env(&cur_env);
continue;
else if (token1 == "verbose" ) {
app_config->verbose = !app_config->verbose;
if (app_config->verbose)
cur_env.set_verbose(DB_VERB_REPLICATION, 1);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 1);
cur_env.set_verbose(DB_VERB_RECOVERY, 1);
cur_env.set_verbose(DB_VERB_REP_ELECT, 1);
cur_env.set_verbose(DB_VERB_REP_LEASE, 1);
cur_env.set_verbose(DB_VERB_REP_SYNC, 1);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 1);
log("verbose is on");
else
cur_env.set_verbose(DB_VERB_REPLICATION, 0);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 0);
cur_env.set_verbose(DB_VERB_RECOVERY, 0);
cur_env.set_verbose(DB_VERB_REP_ELECT, 0);
cur_env.set_verbose(DB_VERB_REP_LEASE, 0);
cur_env.set_verbose(DB_VERB_REP_SYNC, 0);
cur_env.set_verbose(DB_VERB_REPMGR_MISC, 0);
log("verbose is off");
continue;
else if (token1 == "print" ) {
print_stocks(*dbh);
count = 0;
else if (token1 == "db1" ) {
dbh=&dbh1;
g_repquote=*dbh;
log( "switch to Db1");
count = 0;
else if (token1 == "db2" ) {
dbh=&dbh2;
g_repquote=*dbh;
log( "switch to Db2");
count = 0;
else if (token1 == "exit" || token1 == "quit") {
app_data.app_finished = 1;
break;
} else {
log("Format: <stock> <price>");
continue;
else if (count == 2)
if (token1 == "loop_rate" ){
loop_rate = atoi(token2.c_str());
continue;
if (token1 == "txn_rate" ){
txn_rate = atoi(token2.c_str());
continue;
else if (count == 3)
if (token1 == "loop" ) {
start_loop = atoi(token2.c_str());
end_loop = start_loop + atoi(token3.c_str());
if (token1 == "delete" ) {
start_loop_d = atoi(token2.c_str());
end_loop_d = start_loop_d + atoi(token3.c_str());
// Here we know count is either 0 or 2, so we're about to try a
// DB operation.
// Open database with DB_CREATE only if this is a master
// database. A client database uses polling to attempt
// to open the database without DB_CREATE until it is
// successful.
// This DB_CREATE polling logic can be simplified under
// some circumstances. For example, if the application can
// be sure a database is already there, it would never need
// to open it with DB_CREATE.
if (!dbh->ensure_open(app_data.is_master))
continue;
try {
if (count == 0)
if (app_data.in_client_sync)
log( "Cannot read data during client initialization - please try again.");
else
print_stocks_size(*dbh);
else if (!app_data.is_master)
log("Can't update at client");
else {
if (truncate)
u_int32_t no_remove;
txn = NULL;
cur_env.txn_begin(NULL, &txn, DB_TXN_NOWAIT);
try
(*dbh)->truncate(txn, &no_remove, 0);
// commit
txn->commit(0);
txn = NULL;
} catch (DbException &e) {
std::cout << "Error on txn commit: " << e.what() << std::endl;
// } catch (DbDeadlockException &) {
if (txn != NULL)
(void)txn->abort();
// std::cout << "Error on txn commit: " << std::endl;
else if (start_loop)
int j=0;
for (int i=start_loop; i<=end_loop; i=i+txn_rate)
//transaction begin
txn = NULL;
cur_env.txn_begin(NULL, &txn, 0);
for (j=i; j<=end_loop && j<=(i+txn_rate); j++)
Dbt key, value;
std::string key1, value1;
std::stringstream sstrm;
sstrm << "key" << j << ends;
key1 = sstrm.str();
key.set_data((void *)key1.c_str());
key.set_size((u_int32_t)strlen(key1.c_str()));
sstrm.str("");
int payload = rand() + j;
sstrm << "price" << payload << ends;
value1 = sstrm.str();
value.set_data((void *)value1.c_str());
value.set_size((u_int32_t)strlen(value1.c_str()));
// Perform the database put
(*dbh)->put(txn, &key, &value, 0);
printf("Kill me !!\n");
kill(getpid(),-9);
exit(0);
try
// commit
txn->commit(0);
txn = NULL;
} catch (DbException &e) {
std::cout << "Error on txn commit: " << e.what() << std::endl;
if (loop_rate>0)
usleep(txn_rate * 1000 * 1000 / loop_rate);
else if (start_loop_d)
int j=0;
for (int i=start_loop_d; i<=end_loop_d; i=i+100)
//transaction begin
txn = NULL;
cur_env.txn_begin(NULL, &txn, 0);
for (j=i; j<=end_loop_d && j<=(i+100); j++)
Dbt key, value;
std::string key1, value1;
std::stringstream sstrm;
sstrm << "key" << j << ends;
key1 = sstrm.str();
key.set_data((void *)key1.c_str());
key.set_size((u_int32_t)strlen(key1.c_str()));
// Perform the database put
(*dbh)->del(txn, &key, 0);
try
// commit
txn->commit(0);
txn = NULL;
} catch (DbException &e) {
std::cout << "Error on txn commit: " << e.what() << std::endl;
else
const char *symbol = token1.c_str();
StringDbt key(const_cast<char*>(symbol));
const char *price = token2.c_str();
StringDbt data(const_cast<char*>(price));
(*dbh)->put(NULL, &key, &data, 0);
} catch (DbDeadlockException e) {
log("please retry the operation");
dbh->close();
} catch (DbRepHandleDeadException e) {
log("please retry the operation");
dbh->close();
} catch (DbException e) {
if (e.get_errno() == DB_REP_LOCKOUT) {
log("please retry the operation");
dbh->close();
} else
throw;
dbh->close();
void RepQuoteExample::event_callback(DbEnv* dbenv, u_int32_t which, void *info)
static char buf[256];
APP_DATA app = (APP_DATA)dbenv->get_app_private();
info = NULL; /* Currently unused. */
switch (which) {
case DB_EVENT_REP_CLIENT:
app->is_master = 0;
app->in_client_sync = 1;
sprintf(buf,"%s - %s",progname,"CLIENT");
//EZ->dbenv->set_errpfx(buf);
log("DB_EVENT_REP_CLIENT.");
break;
case DB_EVENT_REP_MASTER:
app->is_master = 1;
app->in_client_sync = 0;
sprintf(buf,"%s - %s",progname,"MASTER");
//EZ->dbenv->set_errpfx(buf);
log("DB_EVENT_REP_MASTER.");
break;
case DB_EVENT_REP_NEWMASTER:
log("DB_EVENT_REP_NEWMASTER.");
app->in_client_sync = 1;
break;
case DB_EVENT_REP_PERM_FAILED:
// Did not get enough acks to guarantee transaction
// durability based on the configured ack policy. This
// transaction will be flushed to the master site's
// local disk storage for durability.
log("DB_EVENT_REP_PERM_FAILED.");
log("Insufficient acknowledgements to guarantee transaction durability.");
break;
case DB_EVENT_REP_STARTUPDONE:
app->in_client_sync = 0;
log("DB_EVENT_REP_STARTUPDONE.");
break;
case DB_EVENT_REP_ELECTION_FAILED:
log("DB_EVENT_REP_ELECTION_FAILED.");
//g_runner->init(g_config);
printf("Kill me !!\n");
kill(getpid(),-9);
exit(0);
break;
case DB_EVENT_REP_DUPMASTER:
log("DB_EVENT_REP_DUPMASTER.");
break;
default:
dbenv->errx("ignoring event %d", which);
void RepQuoteExample::print_stocks_size(Db *dbp) {
DB_BTREE_STAT *statp;
dbp->stat(NULL, &statp, 0);
log("db_stat");
cout << "***************************************** >>>>>>>>>>> : database contains " << (u_long)statp->bt_ndata << " records\n";
void RepQuoteExample::print_env(DbEnv *dbenv) {
dbenv->stat_print(DB_STAT_ALL);
void RepQuoteExample::print_stocks(Db *dbp) {
StringDbt key, data;
#define MAXKEYSIZE 10
#define MAXDATASIZE 20
char keybuf[MAXKEYSIZE + 1], databuf[MAXDATASIZE + 1];
char kbuf, dbuf;
memset(&key, 0, sizeof(key));
memset(&data, 0, sizeof(data));
kbuf = keybuf;
dbuf = databuf;
DbcAuto dbc(dbp, 0, 0);
cout << "\tSymbol\tPrice" << endl
<< "\t======\t=====" << endl;
int no_records =0;
for (int ret = dbc->get(&key, &data, DB_FIRST);
ret == 0;
ret = dbc->get(&key, &data, DB_NEXT)) {
key.get_string(&kbuf, MAXKEYSIZE);
data.get_string(&dbuf, MAXDATASIZE);
no_records++;
cout << "\t" << keybuf << "\t" << databuf << endl;
cout << "********************** NO Records " << no_records << endl;
cout << endl << flush;
dbc.close();
static void usage() {
cerr << "usage: " << progname << " -h home -l host:port [-CM]"
<< "[-r host:port][-R host:port]" << endl
<< " [-a all|quorum][-b][-n nsites][-p priority][-v]" << endl;
cerr << "\t -h home (required; h stands for home directory)" << endl
<< "\t -l host:port (required; l stands for local)" << endl
<< "\t -C or -M (optional; start up as client or master)" << endl
<< "\t -r host:port (optional; r stands for remote; any "
<< "number of these" << endl
<< "\t may be specified)" << endl
<< "\t -R host:port (optional; R stands for remote peer; only "
<< "one of" << endl
<< "\t these may be specified)" << endl
<< "\t -a all|quorum (optional; a stands for ack policy)" << endl
<< "\t -b (optional; b stands for bulk)" << endl
<< "\t -n nsites (optional; number of sites in replication "
<< "group; defaults " << endl
<< "\t to 0 to try to dynamically compute nsites)" << endl
<< "\t -p priority (optional; defaults to 100)" << endl
<< "\t -v (optional; v stands for verbose)" << endl;
exit(EXIT_FAILURE);
int main(int argc, char **argv) {
RepConfigInfo config;
char ch, portstr, tmphost;
int tmpport;
bool tmppeer;
config.no_dummy_wr = false;
// Extract the command line parameters
while ((ch = getopt(argc, argv, "E:a:bCh:l:Mn:p:R:r:vw")) != EOF) {
tmppeer = false;
switch (ch) {
case 'a':
if (strncmp(optarg, "all", 3) == 0)
config.ack_policy = DB_REPMGR_ACKS_ALL;
else if (strncmp(optarg, "quorum", 6) != 0)
usage();
break;
case 'b':
config.bulk = true;
break;
case 'C':
config.start_policy = DB_REP_CLIENT;
break;
case 'E':
config.start_policy = DB_REP_ELECTION;
break;
case 'h':
config.home = optarg;
break;
case 'l':
config.this_host.host = strtok(optarg, ":");
if ((portstr = strtok(NULL, ":")) == NULL) {
cerr << "Bad host specification." << endl;
usage();
config.this_host.port = (unsigned short)atoi(portstr);
config.got_listen_address = true;
break;
case 'M':
config.start_policy = DB_REP_MASTER;
break;
case 'n':
config.totalsites = atoi(optarg);
break;
case 'p':
config.priority = atoi(optarg);
break;
case 'R':
tmppeer = true; // FALLTHROUGH
case 'r':
tmphost = strtok(optarg, ":");
if ((portstr = strtok(NULL, ":")) == NULL) {
cerr << "Bad host specification." << endl;
usage();
tmpport = (unsigned short)atoi(portstr);
config.addOtherHost(tmphost, tmpport, tmppeer);
break;
case 'v':
config.verbose = true;
break;
case 'w':
config.no_dummy_wr = true;
//config.priority = 2;
break;
case '?':
default:
usage();
// Error check command line.
if ((!config.got_listen_address) || config.home == NULL)
usage();
RepQuoteExample runner;
g_runner=&runner;
g_config=&config;
try {
runner.init(&config);
runner.doloop();
} catch (DbException dbe) {
cerr << "Caught an exception during initialization or"
<< " processing: " << dbe.what() << endl;
runner.terminate();
return 0;
// This is a very simple thread that performs checkpoints at a fixed
// time interval. For a master site, the time interval is one minute
// plus the duration of the checkpoint_delay timeout (30 seconds by
// default.) For a client site, the time interval is one minute.
void checkpoint_thread(void args)
DbEnv *env;
APP_DATA *app;
int i, ret;
env = (DbEnv *)args;
app = (APP_DATA *)env->get_app_private();
for (;;) {
// Wait for one minute, polling once per second to see if
// application has finished. When application has finished,
// terminate this thread.
for (i = 0; i < 60; i++) {
sleep(1);
if (app->app_finished == 1)
return ((void *)EXIT_SUCCESS);
// Perform a checkpoint.
// original line
if ((ret = env->txn_checkpoint(0, 0, 0)) != 0) {
//if ((ret = env->txn_checkpoint(0, 0, DB_FORCE)) != 0) {
env->err(ret, "Could not perform checkpoint.\n");
return ((void *)EXIT_FAILURE);
// This is a simple log archive thread. Once per minute, it removes all but
// the most recent 3 logs that are safe to remove according to a call to
// DBENV->log_archive().
// Log cleanup is needed to conserve disk space, but aggressive log cleanup
// can cause more frequent client initializations if a client lags too far
// behind the current master. This can happen in the event of a slow client,
// a network partition, or a new master that has not kept as many logs as the
// previous master.
// The approach in this routine balances the need to mitigate against a
// lagging client by keeping a few more of the most recent unneeded logs
// with the need to conserve disk space by regularly cleaning up log files.
// Use of automatic log removal (DBENV->log_set_config() DB_LOG_AUTO_REMOVE
// flag) is not recommended for replication due to the risk of frequent
// client initializations.
void log_archive_thread(void args)
DbEnv *env;
APP_DATA *app;
char **begin, **list;
int i, listlen, logs_to_keep, minlog, ret;
env = (DbEnv *)args;
app = (APP_DATA *)env->get_app_private();
logs_to_keep = 3;
for (;;) {
// Wait for one minute, polling once per second to see if
// application has finished. When application has finished,
// terminate this thread.
for (i = 0; i < 60; i++) {
sleep(1);
if (app->app_finished == 1)
return ((void *)EXIT_SUCCESS);
// Get the list of unneeded log files.
if ((ret = env->log_archive(&list, DB_ARCH_ABS)) != 0) {
env->err(ret, "Could not get log archive list.");
return ((void *)EXIT_FAILURE);
if (list != NULL) {
listlen = 0;
// Get the number of logs in the list.
for (begin = list; *begin != NULL; begin++, listlen++);
// Remove all but the logs_to_keep most recent
// unneeded log files.
minlog = listlen - logs_to_keep;
for (begin = list, i= 0; i < minlog; list++, i++) {
if ((ret = unlink(*list)) != 0) {
env->err(ret,
"logclean: remove %s", *list);
env->errx(
"logclean: Error remove %s", *list);
free(begin);
return ((void *)EXIT_FAILURE);
free(begin);
#define DATABASE_DUMMY "dummy.db"
void create_dummy_db(DB_ENV env, DB *dbp)
DB_ENV *dbenv=env;
int ret;
u_int32_t db_flags;
if ((ret = db_create(dbp, dbenv, 0)) != 0)
dbenv->err(dbenv, ret, "create_dummy_db: db_create");
db_flags = DB_AUTO_COMMIT | DB_CREATE;
//if ((ret = (*dbp)->open(*dbp,NULL, DATABASE, NULL, DB_BTREE, db_flags, 0)) != 0)
if ((ret = (*dbp)->open(*dbp,NULL, NULL, DATABASE_DUMMY, DB_BTREE, db_flags, 0)) != 0)
dbenv->err(dbenv, ret, "create_dummy_db: DB->open");
void reopen_dummy_db(DB_ENV env, DB *dbp)
DB_ENV *dbenv=env;
int ret;
u_int32_t db_flags;
if ((ret = db_create(dbp, dbenv, 0)) != 0)
dbenv->err(dbenv, ret, "create_dummy_db: db_create");
db_flags = DB_AUTO_COMMIT | DB_CREATE;
//if ((ret = (*dbp)->open(*dbp,NULL, DATABASE, NULL, DB_BTREE, db_flags, 0)) != 0)
if ((ret = (*dbp)->open(*dbp,NULL, NULL, DATABASE_DUMMY, DB_BTREE, db_flags, 0)) != 0)
dbenv->err(dbenv, ret, "reopen_dummy_db: DB->open");
void perform_db_operation(DB_ENV env, DB *dbp, bool bRead)
//main loop
//DB *dbp=NULL;
DB_ENV *dbenv=env;
int ret;
u_int32_t db_flags;
DBT key, data;
char buf[20]="dummy", *rbuf;
rbuf=buf;
if (*dbp == NULL)
create_dummy_db(dbenv, dbp);
if (! bRead)
memset(&key, 0, sizeof(key));
memset(&data, 0, sizeof(data));
key.data = buf;
key.size = (u_int32_t)strlen(buf);
data.data = rbuf;
data.size = (u_int32_t)strlen(rbuf);
if ((ret = (*dbp)->put(*dbp, NULL, &key, &data, 0)) != 0)
if (ret == DB_REP_HANDLE_DEAD)
//create_dummy_db(dbenv, dbp);
reopen_dummy_db(dbenv, dbp);
(*dbp)->err(*dbp, ret, "DB->put :");
else
if (ret != DB_KEYEXIST)
(*dbp)->err(*dbp, ret, "perform_db_operation: DB->put");
else
DB_BTREE_STAT *statp;
(*dbp)->stat(*dbp,NULL, &statp, 0);
std::cout<<"dbp read stats: key#"<< statp->bt_nkeys <<std::endl;
void dummy_write_thread(void args)
DbEnv *env;
APP_DATA *app;
char **begin, **list;
int i, listlen, logs_to_keep, minlog, ret;
DB *m_dbp; // a pointer
env = (DbEnv *)args;
app = (APP_DATA *)env->get_app_private();
logs_to_keep = 3;
for (;;) {
if (! app->no_dummy_wr)
if (app->is_master)
perform_db_operation(env->get_DB_ENV(),&m_dbp,false);
//env->txn_checkpoint(0, 0, DB_FORCE);
usleep(1 * 1000 * 1000);
else
if (app->is_master)
//DB *db_quote=g_repquote->get_DB();
//perform_db_operation(env->get_DB_ENV(),&db_quote,true);
//if (g_repquote)
// g_runner->print_stocks_size(g_repquote);
//env->txn_checkpoint(0, 0, DB_FORCE);
//perform_db_operation(env->get_DB_ENV(),&m_dbp,false);
env->rep_flush();
usleep(4 * 1000 * 1000);
my script to simulate the split brain
#!/bin/sh
[ -z "$node1" ] && node1=10.10.32.121
[ -z "$node2" ] && node2=10.10.32.91
trap myend 0 1 2 3 6 9 14 15
myend()
echo "Receive signal to stop test..."
un_split_brain
echo "done"
exit 1
split_brain()
echo -n "Split-Brain at node $node..."
snmpset -m ALL -v 2c -c svil 10.10.0.100 ifAdminStatus.41 i 2 >/dev/null 2>&1
echo "done"
un_split_brain()
echo -n "Undo Split-Brain at node $node..."
snmpset -m ALL -v 2c -c svil 10.10.0.100 ifAdminStatus.41 i 1 >/dev/null 2>&1
echo "done"
is_slave()
local r=$(ssh root@$1 "tail -2 /tmp/BDB.log" | grep -c CLIENT)
[ $r -gt 1 ] && ret=1 || ret=0
return $ret
is_master()
local r=$(ssh root@$1 "tail -2 /tmp/BDB.log" | grep -c MASTER)
[ $r -gt 1 ] && ret=1 || ret=0
return $ret
wait_for_master()
echo -n "Waiting for MASTER at node $node ... "
is_master $node
r=$?
while ( [ ! $r -eq 1 ] )
do
usleep 500000
is_master $node
r=$?
echo -n "."
done
echo "done"
wait_for_slave()
local r
local tm
tm=0
echo -n "Waiting for SLAVE at node $node ... "
is_slave $node
r=$?
while ( [ ! $r -eq 1 ] )
do
usleep 500000
is_slave $node
r=$?
echo -n "."
tm=$((tm+1))
[ $tm -gt 120 ] && break
done
[ $tm -gt 120 ] && ret=0 || ret=1
echo "done"
return $ret
run_test_split_brain()
local nt
nt=1
nfails=0
x=4
[ -z "$1" ] && node=$node2
while ((1))
do
printf "*************** TEST [%02d] ********************\n" $nt
split_brain
wait_for_master
x=$((RANDOM%9))
echo -n " waiting $x sec ..."
sleep $x
echo "done"
un_split_brain
wait_for_slave
r=$?
[ ! $r -eq 1 ] && echo "`date` - test [$nt] - fails ..." || echo "`date` - test [$nt] - OK ."
[ ! $r -eq 1 ] && nfails=$((nfails+1))
perc_failure=$(echo "100.0 - $nfails / $nt * 100.0" | bc -l)
echo "************************************************ [% Success test $perc_failure % ]"
nt=$((nt+1))
x=$((RANDOM%9))
echo -n " waiting $x sec ..."
sleep $x
done
run_test_split_brain
here is the makefile to run to two environments
i run:
- make run
and in another window sh test_split_brain.sh
node1?=10.10.32.121
node2?=10.10.32.91
nsite?=2
debug?=0
all: RepQuoteExampleEric install
RepConfigInfo.o: RepConfigInfo.cpp RepConfigInfo.h
g++ -I/usr/local/BerkeleyDB.5.1/include/ -g -O0 -c RepConfigInfo.cpp -o RepConfigInfo.o
RepQuoteExampleEric: RepQuoteExampleEric.cpp RepConfigInfo.o
g++ -I/usr/local/BerkeleyDB.5.1/include/ -g -O0 RepQuoteExampleEric.cpp RepConfigInfo.o -o RepQuoteExampleEric -L /usr/local/BerkeleyDB.5.1/lib/ -lreadline -lcurses -ldb_cxx
kill:
-ssh -X root@$(node1) "killall -9 /root/RepQuoteExampleEric"
-ssh -X root@$(node2) "killall -9 /root/RepQuoteExampleEric"
run: RepQuoteExampleEric kill install clean_env
ssh -X root@$(node1) "xterm -geom 100x20+100+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.110:12345 -r 2.0.0.210:12345 -a quorum -b -n $(nsite) -v | tee /tmp/BDB.log\"" &
ssh -X root@$(node2) "xterm -geom 100x20+800+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.210:12345 -r 2.0.0.110:12345 -a quorum -b -n $(nsite) -v -w | tee /tmp/BDB.log\"" &
run_node2: clean_env2
ssh -X root@$(node2) "xterm -geom 100x20+800+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.210:12345 -r 2.0.0.110:12345 -a quorum -b -n $(nsite) -v -w | tee /tmp/BDB.log\"" &
debug_node2: clean_env2
ssh -X root@$(node2) "xterm -geom 100x20+800+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.210:12345 -r 2.0.0.110:12345 -a quorum -b -n $(nsite) -v -w | tee /tmp/BDB.log\"" &
sleep 3
ssh -X root@$(node2) /sbin/pidof RepQuoteExampleEric >/tmp/pid
ssh -X root@$(node2) ~/kdbg /root/db-5.1.19/examples/cxx/excxx_repquote/RepQuoteExampleEric -p `cat /tmp/pid`
run_debug_node1: RepQuoteExampleEric kill install clean_env
ssh -X root@$(node1) "xterm -geom 100x20+100+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/kdbg /root/RepQuoteExampleEric\" " &
ssh -X root@$(node2) "xterm -geom 100x20+800+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.210:12345 -r 2.0.0.110:12345 -a quorum -b -n $(nsite) -v\"" &
run_debug_node2: RepQuoteExampleEric kill install clean_env
ssh -X root@$(node1) "xterm -geom 100x20+100+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/RepQuoteExampleEric -h /opt/bdb/ -l 2.0.0.110:12345 -r 2.0.0.210:12345 -a quorum -b -n $(nsite) -v\" " &
ssh -X root@$(node2) "xterm -geom 100x20+800+100 -e \"LD_LIBRARY_PATH=/usr/local/BerkeleyDB.5.1/lib/ /root/kdbg /root/RepQuoteExampleEric\"" &
install: RepQuoteExampleEric
scp RepQuoteExampleEric root@$(node1):~
scp RepQuoteExampleEric root@$(node2):~
clean_env: clean_env1 clean_env2
clean_env1:
ssh -X root@$(node1) rm -rf /opt/bdb/*
clean_env2:
ssh -X root@$(node2) rm -rf /opt/bdb/* -
Using depth first traversal to add a new node to a tree with labels
Hello,
I'm currently trying to work my way through Java and need some advice on using and traversing trees. I've written a basic JTree program, which allows the user to add and delete nodes. Each new node is labelled in a sequential order and not dependent upon where they are added to the tree.
Basically, what is the best way to add and delete these new nodes with labels that reflect their position in the tree in a depth-first traversal?
ie: the new node's label will correctly reflect its position in the tree and the other labels will change to reflect this addition of a new node.
I've searched Google and can't seem to find any appropriate examples for this case.
My current code is as follows,
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.event.*;
import javax.swing.tree.*;
public class BasicTreeAddDelete extends JFrame implements ActionListener
private JTree tree;
private DefaultTreeModel treeModel;
private JButton addButton;
private JButton deleteButton;
private int newNodeSuffix = 1;
public BasicTreeAddDelete()
setTitle("Basic Tree with Add and Delete Buttons");
DefaultMutableTreeNode rootNode = new DefaultMutableTreeNode("Root");
treeModel = new DefaultTreeModel(rootNode);
tree = new JTree(treeModel);
JScrollPane scrollPane = new JScrollPane(tree);
getContentPane().add(scrollPane, BorderLayout.CENTER);
JPanel panel = new JPanel();
addButton = new JButton("Add Node");
addButton.addActionListener(this);
panel.add(addButton);
getContentPane().add(panel, BorderLayout.SOUTH);
deleteButton = new JButton("Delete Node");
deleteButton.addActionListener(this);
panel.add(deleteButton);
getContentPane().add(panel, BorderLayout.SOUTH);
setDefaultCloseOperation(EXIT_ON_CLOSE);
setSize(400, 300);
setVisible(true);
public void actionPerformed(ActionEvent event)
DefaultMutableTreeNode selectedNode = (DefaultMutableTreeNode)tree.getLastSelectedPathComponent();
if(event.getSource().equals(addButton))
if (selectedNode != null)
// add the new node as a child of a selected node at the end
DefaultMutableTreeNode newNode = new DefaultMutableTreeNode("New Node" + newNodeSuffix++);
treeModel.insertNodeInto(newNode, selectedNode, selectedNode.getChildCount());
//make the node visible by scrolling to it
TreeNode[] totalNodes = treeModel.getPathToRoot(newNode);
TreePath path = new TreePath(totalNodes);
tree.scrollPathToVisible(path);
else if(event.getSource().equals(deleteButton))
//remove the selected node, except the parent node
removeSelectedNode();
public void removeSelectedNode()
DefaultMutableTreeNode selectedNode = (DefaultMutableTreeNode)tree.getLastSelectedPathComponent();
if (selectedNode != null)
//get the parent of the selected node
MutableTreeNode parent = (MutableTreeNode)(selectedNode.getParent());
// if the parent is not null
if (parent != null)
//remove the node from the parent
treeModel.removeNodeFromParent(selectedNode);
public static void main(String[] arg)
BasicTreeAddDelete basicTree = new BasicTreeAddDelete();
} Thank you for any help.> Has anybody got any advice, help or know of any
examples for this sort of problem.
Thank you.
Check this site: http://www.apl.jhu.edu/~hall/java/Swing-Tutorial/Swing-Tutorial-JTree.html -
hi guys here's the problem i'm having:
I have a class called Node that I am building a tree out of. Node is a very simple structure, has three parts: element, left and right, with element being the top. Then I have a class called converterTree. This class will take in a postfix (polish notation) string and convert it into a tree through tokenizing etc. for an ultimate calculator class. The code I will post below uses a stack implementation to do so. It should: add all operands to the stack until it hits an operator, then make a new node with the operator as the element, and the left and right are the top and second stack objects respectively. then it pushes this entire tree back onto the stack and keeps going, at each step creating a new tree and linking it to the old one. The problem is that for some reason when I get the top node back in the return, it comes back as only that node, as if all the things it referenced are gone. You wont be able to run the code below since it needs some other classes, but in my main method where all those printlns are know that the return comes back as -, null, null, null, null, null, null with - being the thing on the stack that is SUPPOSED to link to the rest of them, yet for some reason they all come back null? any suggestions? heres the code:
import java.util.StringTokenizer;
public class ConverterTree
String stringToConvert;
static QueueLi returnQueue = new QueueLi();
public ConverterTree (String toConvert)
stringToConvert = toConvert;
public static boolean isOperator(String op)
char c = op.charAt(0);
return (c == '*'|| c =='/' || c == '+' || c =='-');
public static boolean isLParen (String op )
char c = op.charAt(0);
return c== '(';
public static boolean isRParen (String op)
char c = op.charAt(0);
return c == ')';
public static boolean isSpace(String op)
char c = op.charAt(0);
return c == ' ';
public static boolean isOperand (String op)
return (!( isOperator(op) || isLParen(op) || isRParen(op) || isSpace(op)));
public Node toTree (String toConvert)
String delims = new String("+-/* ");
StringTokenizer tokenizer = new StringTokenizer(stringToConvert, delims, true);
String token = new String();
StackLi stack = new StackLi();
while (tokenizer.hasMoreTokens())
token = tokenizer.nextToken();
System.out.println("token: " + token);
if (isOperand(token))
ListNode node1 = new ListNode(token);
System.out.println("This operand is being pushed: " + token);
stack.push(token);
else if (isOperator(token))
Node op2 = new Node(stack.topAndPop());
Node op1 = new Node(stack.topAndPop());
Node opTree = new Node(token, op1, op2);
System.out.println("node and left and right: " + opTree.element + opTree.left + opTree.right);
stack.push(opTree);
System.out.println("node and left and right: " + opTree.element + opTree.left + opTree.right);
Node returnNode = new Node(stack.topAndPop());
return returnNode;
public static void main (String [] args)
String toConvert1 = "2 5 + 6 8 + -";
ConverterTree treeTest = new ConverterTree(toConvert1);
Node testNode = treeTest.toTree(toConvert1);
Node right = new Node(testNode.right);
Node left = new Node(testNode.left);
System.out.println(testNode);
System.out.println(left);
System.out.println(right);
System.out.println(left.left);
System.out.println(left.right);
System.out.println(right.left);
System.out.println(right.right);
}hi guys here's the problem i'm having:
I have a class called Node that I am building a tree out of. Node is a very simple structure, has three parts: element, left and right, with element being the top. Then I have a class called converterTree. This class will take in a postfix (polish notation) string and convert it into a tree through tokenizing etc. for an ultimate calculator class. The code I will post below uses a stack implementation to do so. It should: add all operands to the stack until it hits an operator, then make a new node with the operator as the element, and the left and right are the top and second stack objects respectively. then it pushes this entire tree back onto the stack and keeps going, at each step creating a new tree and linking it to the old one. The problem is that for some reason when I get the top node back in the return, it comes back as only that node, as if all the things it referenced are gone. You wont be able to run the code below since it needs some other classes, but in my main method where all those printlns are know that the return comes back as -, null, null, null, null, null, null with - being the thing on the stack that is SUPPOSED to link to the rest of them, yet for some reason they all come back null? any suggestions? heres the code:
import java.util.StringTokenizer;
public class ConverterTree
String stringToConvert;
static QueueLi returnQueue = new QueueLi();
public ConverterTree (String toConvert)
stringToConvert = toConvert;
public static boolean isOperator(String op)
char c = op.charAt(0);
return (c == '*'|| c =='/' || c == '+' || c =='-');
public static boolean isLParen (String op )
char c = op.charAt(0);
return c== '(';
public static boolean isRParen (String op)
char c = op.charAt(0);
return c == ')';
public static boolean isSpace(String op)
char c = op.charAt(0);
return c == ' ';
public static boolean isOperand (String op)
return (!( isOperator(op) || isLParen(op) || isRParen(op) || isSpace(op)));
public Node toTree (String toConvert)
String delims = new String("+-/* ");
StringTokenizer tokenizer = new StringTokenizer(stringToConvert, delims, true);
String token = new String();
StackLi stack = new StackLi();
while (tokenizer.hasMoreTokens())
token = tokenizer.nextToken();
System.out.println("token: " + token);
if (isOperand(token))
ListNode node1 = new ListNode(token);
System.out.println("This operand is being pushed: " + token);
stack.push(token);
else if (isOperator(token))
Node op2 = new Node(stack.topAndPop());
Node op1 = new Node(stack.topAndPop());
Node opTree = new Node(token, op1, op2);
System.out.println("node and left and right: " + opTree.element + opTree.left + opTree.right);
stack.push(opTree);
System.out.println("node and left and right: " + opTree.element + opTree.left + opTree.right);
Node returnNode = new Node(stack.topAndPop());
return returnNode;
public static void main (String [] args)
String toConvert1 = "2 5 + 6 8 + -";
ConverterTree treeTest = new ConverterTree(toConvert1);
Node testNode = treeTest.toTree(toConvert1);
Node right = new Node(testNode.right);
Node left = new Node(testNode.left);
System.out.println(testNode);
System.out.println(left);
System.out.println(right);
System.out.println(left.left);
System.out.println(left.right);
System.out.println(right.left);
System.out.println(right.right);
} -
Hello all,
Yesterday, we faced an issue early in the day that our cluster removed all active nodes (exchange 2010 DAG). and the root cause was because we lost contact with the alternate cluster node (over a WAN link), and concurrently lost connectivity to the file
witness share (event id 1564 was recorded).
The odd thing is that the cluster should be tolerant to having the second node be unreachable, as long as the file witness share is reachable by the node. Being that the file witness share is located at the same physical site (possibly inside the same
hypervisor host), the idea that the share is ever unreachable is very interesting!
The system engineering team has adjusted the CrossSubnetDelay and CrossSubnetThreshold values, but I do not think this will solve the problem of the file witness server being inaccessible by the node.
[PS] C:\>cluster /prop | Select-String "Subnet"
D CONTOSO-DAG CrossSubnetDelay 4000 (0xfa0) # not default
D CONTOSO-DAG CrossSubnetThreshold 10 (0xa) # not default
D CONTOSO-DAG PlumbAllCrossSubnetRoutes 0 (0x0)
D CONTOSO-DAG SameSubnetDelay 1000 (0x3e8) # default
D CONTOSO-DAG SameSubnetThreshold 5 (0x5) # default
What can I further investigate in relation to the file witness share being inaccessible? Are there any settings that we can adjust to make sure the node is more tolerant to file witness share availability? There may be a variety of things occurring
on the file witness share server, like VSS snapshots, etc. But none of these things are expected to be interferring with the operations of (1) the OS, or (2) the availability and accessibility of any share.
Thanks,
MattHi mbrownnyc,
The quorum configuration in a failover cluster determines the number of failures that the cluster can sustain while still remaining online.
If an additional failure occurs beyond this threshold, the cluster will stop running.
A common perception is that the reason why the cluster will stop running if too many failures occur is to prevent the remaining nodes from taking on too many workloads and having the hosts be overcommitted.
Generally multi-site clusters have two sites with an equal number of nodes at each site, giving an even number of nodes.
By adding this additional vote at a 3rd site, there is an odd number of votes in the cluster, at very little expense compared to deploying a 3rd site with an active cluster node and writable DC. Therefore when your cluster node can connect the witness
and got the higher vote, that node will keep running when others node fail.
Please offer use more information about your environment, such as your server edition and your network nic advanced configuration. You can install all the recommend update
or following the following steps to narrow the issue first.
1.Configure Heartbeat according your network delay and DNS Settings in a Multi-Site Failover Cluster
http://technet.microsoft.com/en-us/library/dd197562(WS.10).aspx
a) If issue still persist check wet Windows
Cluster is healthy or not.
b) Check wet nodes are communicating properly with FSM.
c) Increase the heart beat interval by running the commands:
cluster /prop SameSubnetDelay=2000
cluster /prop SameSubnetThreshold=10
Follow this article
http://technet.microsoft.com/en-us/library/dd197562(WS.10).aspx
d) Confirm your cluster CNO have full permissions on the FSW.
2. Check if AV scanning is set properly on C:\Windows\Cluster folder and FSW folder
3. Uninstall Symantec Endpoint Protection for troubleshooting purpose
4. Break the teaming if you are using it.
5.
TCP Chimney \ RSS \ NetDMA issue
Information about the TCP Chimney Offload, Receive Side Scaling, and Network Direct Memory Access features in Windows Server 2008
http://support.microsoft.com/kb/951037
More information:
Understanding Quorum in a Failover Cluster
http://blogs.msdn.com/b/clustering/archive/2011/05/27/10169261.aspx
Clustering: What exactly is a File Share Witness and when should I use one?
http://blogs.technet.com/b/askpfeplat/archive/2012/06/27/clustering-what-exactly-is-a-file-share-witness-and-when-should-i-use-one.aspx
Example, Clustered Service or Application in a Multi-Site Failover Cluster
http://technet.microsoft.com/zh-cn/library/dd197519(v=ws.10).aspx
I’m glad to be of help to you!
We
are trying to better understand customer views on social support experience, so your participation in this
interview project would be greatly appreciated if you have time.
Thanks for helping make community forums a great place. -
How to make a prog. Tree with Checkbox in JSF?
I am facing prob. to how to dev. prog. which contain Tree with Checkbox .
I want to use checkbox because whatever comes under any directory in Tree is selected if I select perticular folder from Tree?
Can you guide me guys ?
Ur help is needed to me.
Thanks,
Harshal JoshiI have worked whith JSF-s CheckBox components , It has a problem, when I used it with tables and Trees, so I think this components needs to develop.
enyone has other ideas about it, and knows how to do it?
Maybe you are looking for
-
How can I use the same session for different components acroos application ?
I am trying to include the components(chat, filesharing, whitboard) in different parts of my application. User should be able to access any of the component. We would like to have a single "ConnectSessionContainer" so that we don't see same user crea
-
Webutil error while generate excel form
Hi In my forms appl. I use webutil in order to generate excel reports I have to midtier instances both running on a separate host. End users connect through a WLB frontend. At one of the midtiers, when generating a excel report using webutil "error w
-
How can i encrypt a zfs partition
I have the need to encrypt a zfs file system in solaris 11. and solaris 11 disk. any ideas? Solaris 11 is installed in a laptop.
-
Hp dvd-ram uj8b1 has a driver problem
HP Pavilion dv6 Notebook PC Windows 7 home premium We were able to play Cds and Dvds, and now they are not playing. I did download i-tunes recently, but don't recall if the problem emerged immediately after that. We don't use discs very often. Whe
-
How to transfer outlook cantact to iphone 4s
how to transfer outlook cantact to iphone 4s