Follow up Tree Question
Hey,
Using the arrows, when I open one tree node, I want other
tree nodes to close. I saw a sample that sepiroth had done, but I
don't want to click on the whole bar. I just want to use the arrows
to expand and contract. Any help would be great. I have attached
the code
If you just wish to make a duplicate of one hard drive to another hard drive in the same G5, then do this:
Clone using Restore Option of Disk Utility
Open Disk Utility from the Utilities folder.
Select the destination volume from the left side list.
Click on the Restore tab in the DU main window.
Check the box labeled Erase destination.
Select the destination volume from the left side list and drag it to the Destination entry field.
Select the source volume from the left side list and drag it to the Source entry field.
Double-check you got it right, then click on the Restore button.
Destination means the second internal drive. Source means the internal startup drive.
Similar Messages
-
I have the following Ultiboard/Multisim questions:
I have the following Ultiboard/Multisim questions:
1. I am trying to create a part footprint and need to place rectangular shaped pins, the only thing I can find are round pins with different shape solder pads. I see where you can place a rectangular hole but this does not have the solder pad around the hole on the top and bottom layers as does the place pin command.
2. Is it possible to import a DFX file containing pin placement drawing and use it in the creation of a new part footprint?
3. How can you change the layer of a particular object? For example let's say you have drawn a trace or solder pad on the top solder layer and it really needed to be on the bottom layer. I would think there is a way to simply select the object and changes its layer designation/color to a different one.
4. I have downloaded Multisim symbol files and Ultiboard footprint files from Analog Devices web site. Where should I place the files? Be nice!!!
5. The microcontroller MSP 430 simulation model or part in Multisim is a very old model is there a way to obtain the footprint and simulation model/symbol for the newer variant.Hi there,
Here are the answers to your questions.
I. Placing a rectangular pin (with a rectangular drillhole):
To change the hole shape that is used for the pin, you must first place the pin. While creating/editing the footprint,
From the menu, select Place > Pins
Click OK (you can customize dimensions later)
Double-click on the pin and select the Pad tab in the Through Hole Pin Properties dialog
Under Hole, select Advanced hole
Select the Hole tab and choose Square/Rectangle. Click OK.
Customize the Pad Size
II. Importing DXF file
It is certainly possible to import DXF files in Ultiboard (depending on the type of DXF file), but it depends on the program/version that generated the dxf file.
III. Changing the layer of an object
Double-click on the object and select the Position tab and you can select the layer to move the object to.
IV. Importing Analog Devices files
The symbols are in .prz format. To import these files, please see this Knowledge Zone article:
How to Import and Export Components in Multisim
To import the footprints, please see this forum thread:
http://forums.ni.com/ni/board/message?board.id=370&message.id=3536&query.id=139276#M3536
V. Microcontroller
The MSP430 in Multisim is still active, but perhaps is a different version that the one you want. The one is in the database in the one found here: http://focus.ti.com/docs/prod/folders/print/msp430p325.html. I suggest you post the one you are looking for in the NI Circuit Design Community. Someone may have the symbol/footprint you are looking for, or may be able to locate it.
Message Edited by NatashaB on 11-05-2009 10:39 AM
Natasha Baker
R&D Engineer
National Instruments
Join the NI Circuit Design Community
Follow Multisim on Twitter! -
JDev 11g ADF Tree question on programmatically expand and select node
I have two questions:
1. I'm trying to automatically expand the first level tree nodes upon display of the tree. I tried to initialize a RowKeySetImpl object, and added ArrayList of first level nodes, and used setDisclosedRowKeys method. The tree nodes are not rendered properly. If I take the following code out, then the tree content is rendered properly. Here is my code. I have three nodes that I want to expand.
ArrayList node1 = new ArrayList();
node1.add(new Integer(0));
ArrayList node2 = new ArrayList();
node2.add(new Integer(1));
ArrayList node3 = new ArrayList();
node3.add(new Integer(2));
RowKeySetImpl expand = new RowKeySetImpl();
expand.add(node1);
expand.add(node2);
expand.add(node3);
this.mainTree.setDisclosedRowKeys(expand);
2. I have a Panel Splitter, on the first facet, it contains a tree, on the second facet it will be either 'task list', or 'edit task'. When user selects a task in the 'task list', I would like to display 'edit task', while highlight the selected 'task' node on the tree.
In respond to the ActionListener of the command link (each command link corresponds to task):
1. How do I determine the properly node in the tree?
2. I constructed a RowKeySetImpl object and called setSelectedRowKeys. But I get messagebox saying "To display the webpage again, Internet Explorer needs to resend the information you've previously submitted." If I clicked Retry button, the message box just gets displayed again. If I cancel, the node I hardcoded does get selected properly.
Please help me!
Thanks,I believe this has already been fixed in our main code branch. I will enter a boxer bug and make sure that the fix gets backported to boxer so that it is available in the next boxer patch. If I remember correctly, the issue had to do with trees with a large display area (with default fetchSize of 25). The issue is that the tree has to make multiple round trips to the server in order fill the visible area (view port) on the page.
Do either of the following workarounds work:
1) Set a fetchSize attribute on the af:tree tag larger than 25 (<af:tree fetchSize="75">). You may want to increase the rangeSize in your pageDef file as well so that the model rangeSize matches the view fetchSize.
2) Shrink the size of the tree on the page so that it does not have to make multiple round trips to the server to fill it's view port. -
hi all
please when i navigate in tree by mouse i want to get the node value and assign it to an item in the form( i get it by use when-tree-node-selected )
ftree.get_tree_node_property and get the value use system.trigger_node
but the question is :-
i want to get the node value when i navigate on tree nodes by keyboard not by mouse
which trigger i use and which code
if i use key-up, key-down triggers how can i specify the current node
urgent please
thanksHi!
You can use the same, the when-tree-node-selected trigger.
While the trigger fires, you can get via the :SYSTEM.TRIGGER_NODE_SELECTED variable,
if the fireing node either is selected or not because the trigger fires two times.
Onetime for deselect the left node and again for select the actual node.
You can use the following code to test the when-tree-node-selected trigger.
It fires on mouseclick and on keyboard navigation:
declare
htree item := find_item ( 'block.tree' );
begin
if
:SYSTEM.TRIGGER_NODE_SELECTED = 'TRUE'
then
clear_message;
message ( ftree.get_tree_node_property ( htree, to_number ( :system.trigger_node ), ftree.node_value ) );
end if;
end;Regards -
All,
I have a question about Rapid Spanning Tree reconfiguration. I have to following situation:
As you can see 3 switches with RSTP, and 2 switches without RSTP (or any other spanning tree, just unmanaged).
The 2 switch will form a loop in my network. Switch 1 will block one of the ports and the other port will forward the traffic.
If I break the link "Just Forwarding", my second switch won't be able to cumminucate for around 40 seconds. It will take some time before the backup link will be up again.
Cisco has the Fastforwarding mechanism. Will this help in this situation? I would like to shorten the 40 seconds time.
Thans in advance.I'd guess the unmanaged devices run legacy spanning tree, and rapid
pvst switches will run rapid according the "heard" protocol. So if it hears
the legacy bpdu, it will run regular spanning tree, hence the 40 second delay.
chris -
Ok, I am making a binary tree. I have a question for my insert method. Firstly, I can't find out why the root node is inserted more than once in the tree. Also, I am having trouble with connecting the nodes that I insert to the tree. I can attach modes to root just fine, but I can't find out how to attach nodes to the existing nodes that are already attached to the tree. When I insert a node that meets the criteria of an already existing node, it replaces the node instead of getting attached to it. The answer is probably trivial, but I can't find it. Here is my insert method.
public void insert(T obj) {
int _result1;
int _result2;
//TODO: Implement Q1 here
if(isEmpty() == true){
_root = createNode(obj, null, null, null);
System.out.println("The root inserted is " + _root.element());
insert(obj);
_node = createNode(obj, _root, null, null);
_result1 = _node.element().compareTo(_root.element());
if(_result1 < 0){
if(_node.isInternal() == true){
_current = (BTreeNode<T>) _node2.element();
_result2 = _current.element().compareTo(_current.getParent().element());
//System.out.println("The current element is " + _current.element());
if(_result2 < 0){
_node1.getLeft();
_current = _node1.getLeft();
else{
_node1.getRight();
_current = _node1.getRight();
if(_node1.hasLeft() == true){
_node1.getLeft();
_current = _node1.getLeft();
else{
_current.setLeft(_node1);
_current = _node2;
else{
_node1 = createNode(obj, _node, null, null);
_node.setLeft(_node1);
_node1.setParent(_node);
System.out.println("The parent of the left node " + _node.element() + " is " + _node.getParent().element());
_root.setLeft(_node1);
_current = _node1;
//System.out.println("The current element is " + _node.element());
else{
if(_node.isInternal() == true){
_current = (BTreeNode<T>) _current.element();
_result2 = _current.element().compareTo(_current.getParent().element());
//System.out.println("The current element is " +_current.element());
if(_result2 < 0){
_node1.getLeft();
_current = _node1.getLeft();
else{
_node1.getRight();
_current = _node1.getRight();
if(_node1.hasRight() == true){
_node1.getRight();
_current = _node1.getRight();
else{
_current.setLeft(_node1);
_current = _node1;
else{
_node1 = createNode(obj, _node, null, null);
_node.setRight(_node1);
_node1.setParent(_node);
//_current = _node1;
System.out.println("The parent of the right node " + _node.element() + " is " + _node.getParent().element());
_root.setRight(_node1);
_current = _node1;
//System.out.println("The current element is " + _current.element());
}The output I get is:
The root inserted is 6
The parent of the right node 6 is 6
The parent of the right node 6 is 6 ** I can't figure out why the root is inserted two extra times**
The parent of the left node 3 is 6
The parent of the right node 11 is 6
The parent of the right node 12 is 6 ** this node should be attaching to 11 instead of replacing it **
The parent of the right node 8 is 6
The parent of the right node 9 is 6
The parent of the right node 10 is 6
The parent of the right node 7 is 6
preorder :(6 (3 )(7 ))
postorder:(( 3) ( 7) 6)IMO, your insert method is way too complicated.
Have a look at this pseudo code: that's all it takes to insert nodes in a BT:
class Tree<T extends Comparable<T>> {
private Node root;
public void insert(T obj) {
'newNode' <- a new Node('obj') instance
IF 'root' equals null
let 'root' be the 'newNode'
ELSE
insert('root', 'newNode')
END IF
public void insert(Node parent, Node newNode) {
IF 'parent' is less than 'newNode'
IF the left child of 'parent' is null
let 'newNode' be the left child of 'parent'
ELSE
make a recursive call here: insert('???', 'newNode')
END IF
ELSE
IF the right child of 'parent' is null
let 'newNode' be the right child of 'parent'
ELSE
make a recursive call here: insert('???', 'newNode')
END IF
END IF
} -
I am writing my own implementation of a binary search tree and one of the methods I am having issues with writing is a getRootNode() method.
I am wondering A if there is any API doc on Binary search trees and B What the method would look like for a getRootNode()
I wrote the following two methods
//getEntry
public E getEntry(E entry)
return findEntry(getRootNode(), entry);
//findEntry
private E findEntry(BinarySearchTreeNode<E> rootNode, E entry)
E resualt = null;
if (rootNode == null)
E rootEntry = rootNode.getElement();
if (entry.equals(rootEntry))
resualt = rootEntry;
else if(entry.compareTo(rootEntry) < 0)
resualt = findEntry(rootNode.getLeft(), entry);
else
resualt = findEntry(rootNode.getRight(), entry);
return resualt;
//getRootNode -- this is where I am lost
private BinarySearchTreeNode<E> getRootNode() {
// TODO Auto-generated method stub
return null;
}Any Ideas?user8974754 wrote:
initialized root
private BinarySearchTreeNode<E> root;
That doesn't initialize it. That just declares a member variable named root. To initialize it, you have to do root = something, either on the line where you declare it or elsewhere. Until then, it will have its default value of null.
>
So then I am assuming then the code would be
//Going based on some other code
private BinarySearchTreeNode<E> getRootNode() {
if (root != null)
return root;
else
return null;
That's the same as just return root; If it's not null, you return it, and if it is null, you return null, which is the same as returning root, since, as we just established, root is null.
Edited by: jverd on Dec 13, 2010 5:02 PM -
Hi,
I run BCALV_TREE_SIMPLE_DEMO in order to know how it is working but I have one question: if I want to download the list to excel, how do I add a button and the functionality to do this?
Thanks in advance,
CristianHi Cristian,
or, more specific (still missing some details),
add Dropdown Button to toolbar (for Download)
CALL METHOD lr_toolbar->add_button
EXPORTING
fcode = 'DOWNLOAD'
icon = icon_export
butn_type = cntb_btype_button
text = ''
quickinfo = 'Download file(s)'. "#EC NOTEXT
and somewhere else
CLASS lcl_toolbar_event_receiver IMPLEMENTATION
CLASS lcl_toolbar_event_receiver IMPLEMENTATION.
METHOD on_function_selected.
CASE fcode.
WHEN 'DOWNLOAD'. "#EC NOTEXT
CALL METHOD cl_gui_frontend_services=>gui_download
EXPORTING
BIN_FILESIZE =
filename = l_pcfile
FILETYPE = 'ASC'
APPEND = SPACE
WRITE_FIELD_SEPARATOR = SPACE
HEADER = '00'
TRUNC_TRAILING_BLANKS = SPACE
WRITE_LF = con_true
COL_SELECT = SPACE
COL_SELECT_MASK = SPACE
DAT_MODE = SPACE
confirm_overwrite = con_true
NO_AUTH_CHECK = SPACE
CODEPAGE = SPACE
IGNORE_CERR = ABAP_TRUE
REPLACEMENT = '#'
WRITE_BOM = SPACE
TRUNC_TRAILING_BLANKS_EOL = con_true
IMPORTING
filelength = l_tsize
CHANGING
data_tab = lt_string
EXCEPTIONS
file_write_error = 1
no_batch = 2
gui_refuse_filetransfer = 3
invalid_type = 4
no_authority = 5
unknown_error = 6
header_not_allowed = 7
separator_not_allowed = 8
filesize_not_allowed = 9
header_too_long = 10
dp_error_create = 11
dp_error_send = 12
dp_error_write = 13
unknown_dp_error = 14
access_denied = 15
dp_out_of_memory = 16
disk_full = 17
dp_timeout = 18
file_not_found = 19
dataprovider_exception = 20
control_flush_error = 21
not_supported_by_gui = 22
error_no_gui = 23
OTHERS = 24
I think it's no use to post my full source here because it was very specific for my project. But I think at least you might get an idea from this and the tree example programs mentioned in this tread.
Happy coding!
Best regards,
Clemens Li
> Hi,
>
> I run BCALV_TREE_SIMPLE_DEMO in order to know how it
> is working but I have one question: if I want to
> download the list to excel, how do I add a button and
> the functionality to do this?
>
> Thanks in advance,
> Cristian -
Hello,
I have a tree control which currently stays expanded all the time by using the following code:
on the updateComplete event of the tree (tree) I call this:
private function expandAllNodes(e:Event)
if (tree != null){
if (tree.dataProvider.length > 0){
tree.expandChildrenOf(tree.dataProvider[0]);
it works exactly the way I want it to and it keeps the tree open all the time. So far so good.
But I'd like to do this instead:
When an item is added to the tree (the dataProvider actually), expand all nodes (like it does now). But I'd also like to be able to collapse nodes if the list gets really long (which it might).
However whenever I collapse a node, the updateComplete fires and opens it back up. Is there another event I should use instead of the updateComplete that wouldn't cause the expand all to get called again ?
Thanks in advance,
JeffA simple solution could be to set a flag:
private var enableExpand:Boolean = true;
In your expand handler add:
if (tree != null && enableExpand){
if (tree.dataProvider.length > 0){
tree.expandChildrenOf(tree.dataProvider[0]);
enableExpand = true;
then, in your addItemToTree function or wherever you want, you can set the enableExpand property to false.
It will then prevent the expand handler to execute one time.
Dany -
I want to change the spanning tree root on several vlans on my network. My question is, will this cause STP to recalculate for the entire network, which can cause the network to slow down or will it only affect the vlans that I am changing? I want to make sure I am not going to impact anything on the network.
When executed properly, this will only affect the vlans that you wish to change. Use the folllowing command to change spanning tree prio on a vlan:
spanning-tree vlan xx priority 4096 (or a multiple of 4096 for less priority)
Be aware that there is always a risk of unexpected disruptions when you do this. The vlans that you change may still carry user traffic altough there are no users on it. If your topology and traffic flow are not exactly as you assume they are, more vlans may be affected. It is therefore not advisable to alter this setting during peak-hours.
Regards,
Leo -
Please bare with me because there are times when I find building the node tree complex and somewhat confusing, but I think I'm close.
I am using the keylight node and have made this tree configuration:
Foreground into Color Space Node 1 and changing the RGB to output of YUV, to Blur Node, (did this to try to get rid of the jagged spill around the foreground figure), to Color Space 2 Node, changing the YUV back to output of RGB, then imput to Keylight Node, then to Color Match Node as Stuckfootage suggested yesterday, and then to Over Node. My Background Layer is connected to the Over node.
I still have an edge of color around the foreground figure and I've tried to get rid of it and wonder if there's another way to do so? This is my question.
Hope you all have an answer! I thought I had gotten rid of it, but after doing all of the above it seemed to return. I've made a green screen in keylight by the way.Patrick, when you say "fill" do you mean something like this?
Background = Checker(1920, 1080, 1, 32, xSize/GetDefaultAspect());
Color1 = Color(1920, 1080, 1, 0, 1, red, 1, 0);
Color2 = Color(1920, 1080, 1, 0.505, 0.467430055, 0.28644523,
1, 0);
RotoShape1 = RotoShape(1920, 1080, 1, "v4.10", 0, 0, 0, 1, 1,
xScale, width/2, height/2, 0, 0.5, 0, 384, "[email protected]7C3uDtY8WgH13 0Am04DKJHqhpqqR83G@YohJ@#ota77pDe1@UoFvqSQA8KZyoLS11qpK1qKGJmYy4abq0JKnqHeq3cMw5 xYkLTOcJruq1Ae6KlJk8eJ6kyqotXVj9j6xIIp8xMHeRC3TWpWClCdK2lCX02lCZ0@DWX025aO610YFu flDJu26DOV10Du83C3SIW6GFi8j00ZpgG8mG3CKFVX0WQv233AOi1vuB3BfS0sPv1dW@GnwYTm3MW97x nR6S06vuEGmNO1uubpCKK0HoiKhPuqmV8tOdyZb1176m8vE0W300G3H00000000002:",
"[email protected]c1SQQLKGXeWH0 Qe0Y6AK9wbPWw9aXcdHvbffVvRI#YvMK#LEvtSEEDLa#HQfgfM1wPgfQAef2GU2I2AWDwOX9Gg1eAzYT frgESpDROg0TK3gtdj4q93KVQfxTkoaMSK9fP43h8qDsXEmPsNN6HgPNMIff5aQWXg94QeNp8eCeDAr2 I2DAGC0YHE2P6il00X6Si16E9G38rMgs0GPMKm1OeX31BjKWGIciuW26SGU#ODGYN0D8Fmb4p56FtjCS Q31WUi3v3cSikmG1UubZR32NvEWxMDK50S86XChA3N7LX5xaVB098umKUgz00000f03",
"100W@0E000VDhsuH9RYbMXJCo8QUPcJkW66fOihMQZ5aCgWLQYvcdSP0#26ob1chH25QW60WPMQeGD A9Nb9cWG6QgYNbgcUOlBvNKRIvNNVovuOgKI#NJbfgcJdfgQaMWcAeW98D0ceWDsaQf5WcOBsjk2mE@K IKf3ujgeSJg6dCK1rDblxb1JQnbdcH8ShnGtOtIWcTtAZBpDGwGNZDoo03ipoUZCbmqGZCa6Pq1s19cH mJMXICg2EGiWGn0N6Q03ytWX20sW0aEm1TPkuW3pjmW33a0J30k4G12mnAGAlpxj06TTk11HE3SDnR74 fGU17OWPxxHBVaNm1fMblR3nlU#WWDrxeugpe@mBx9PgNOW1SXopj11SYn2D@6ZuVa@wFwHDV1tu4ytN 0aFa1Vmcy3bW03smZSR2GW50uPj#0000005");
Original_Footage = KeyMix(Color1, Color2, RotoShape1, 1, "A",
100, 0);
ColorSpace1 = ColorSpace(Original_Footage, "rgb", "yuv", 0.3,
0.59, 0.11);
Blur1 = Blur(ColorSpace1, 4, 0, 0, "default", "default", "gb");
ColorSpace2 = ColorSpace(Blur1, "yuv", "rgb", 0.3, 0.59, 0.11);
Keylight1 = Keylight(ColorSpace2, 0, 0, 0, "1.4", "unpremultiplied",
0, 1, 0, 0.058631923, 0.9, 0.9, 0.9, (bScreen > gScreen) ? 0.9 : 0.5,
(bScreen > gScreen) ? 0.9 : 0.5, (bScreen > gScreen) ? 0.9 : 0.5,
0, 0, 0, 0.5, 0.5, 0.5, 0.5, 1, rExposure, rExposure, 1,
rGamma, rGamma, 1, "linear", 1, "A", 1, "A", 0, 0);
SpillSuppress1 = SpillSuppress(ColorSpace2, 1, 1, 0, 1);
ColorMatch1 = ColorMatch(SpillSuppress1, 0, 0, 0, 0, rLowS, gLowS,
bLowS, aLowS, 0.5, 0.5, 0.5, 0.5, rMidS, gMidS, bMidS, aMidS,
1, 1, 1, 1, rHighS, gHighS, bHighS, aHighS, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1);
KeyMix1 = KeyMix(Background, ColorMatch1, Keylight1, 1, "A",
100, 0);
// User Interface settings
SetKey(
"nodeView.Background.t", "1",
"nodeView.Background.tnChannel", "0",
"nodeView.Background.tnTime", "1",
"nodeView.Background.tnVisible", "1",
"nodeView.Background.x", "170.380127",
"nodeView.Background.y", "-46.8631",
"nodeView.Blur1.t", "0",
"nodeView.Blur1.x", "511.630127",
"nodeView.Blur1.y", "154.8869",
"nodeView.Color1.t", "1",
"nodeView.Color1.tnChannel", "0",
"nodeView.Color1.tnTime", "1",
"nodeView.Color1.tnVisible", "1",
"nodeView.Color1.x", "390.296875",
"nodeView.Color1.y", "367.8869",
"nodeView.Color2.t", "1",
"nodeView.Color2.tnChannel", "0",
"nodeView.Color2.tnTime", "1",
"nodeView.Color2.tnVisible", "1",
"nodeView.Color2.x", "505.296875",
"nodeView.Color2.y", "367.8869",
"nodeView.ColorMatch1.t", "0",
"nodeView.ColorMatch1.x", "349.630127",
"nodeView.ColorMatch1.y", "-41.8631",
"nodeView.ColorSpace1.t", "0",
"nodeView.ColorSpace1.x", "471.630127",
"nodeView.ColorSpace1.y", "225.8869",
"nodeView.ColorSpace2.t", "0",
"nodeView.ColorSpace2.x", "471.630127",
"nodeView.ColorSpace2.y", "83.8869",
"nodeView.KeyMix1.t", "0",
"nodeView.KeyMix1.x", "356.880127",
"nodeView.KeyMix1.y", "-164.1131",
"nodeView.Keylight1.t", "0",
"nodeView.Keylight1.x", "574.1301",
"nodeView.Keylight1.y", "-34.3631",
"nodeView.Original_Footage.t", "0",
"nodeView.Original_Footage.x", "474.630127",
"nodeView.Original_Footage.y", "296.8869",
"nodeView.RotoShape1.t", "1",
"nodeView.RotoShape1.tnChannel", "0",
"nodeView.RotoShape1.tnTime", "1",
"nodeView.RotoShape1.tnVisible", "1",
"nodeView.RotoShape1.x", "620.2969",
"nodeView.RotoShape1.y", "367.8869",
"nodeView.SpillSuppress1.t", "0",
"nodeView.SpillSuppress1.x", "348.25",
"nodeView.SpillSuppress1.y", "3.25"
); -
In a follow-up to a previous inquiry, I'm curious about:
1) Is iChat videoconferencing stable with a DSL connection (i.e. using a phone line as opposed to a cable connection, such as Brighthouse Cable)?
2) Will I be straining my G3 if I try to videoconference with a broadband connection, an iSight camera and OS 10.2.8?
-- Thanks for any input, folks.Hi Steven,
Yes a good DSL connection is in fact better than most cable services in the stableness of the Connection Speed.
(Good is a uplink speed of at 256K 128K should be OK but can be marginal)
A G3 need to be at least 500Mghz. It will not be able to Multichat in Tiger.
The Jaguar version of iChat AV is no longer available for download. You will need at least PAnther (10.3.x)
Ralph -
Follow-up on question about copying 10.4
I only got one reply to my question about how to copy OS 10.4 from one internal drive to another and unfortunately, the response was cut short. Something about if I had another computer with Firewire, using it and that's as far as the response went. Yes, I have a laptop and have Firewire, but still don't know how to use it to help.
If you just wish to make a duplicate of one hard drive to another hard drive in the same G5, then do this:
Clone using Restore Option of Disk Utility
Open Disk Utility from the Utilities folder.
Select the destination volume from the left side list.
Click on the Restore tab in the DU main window.
Check the box labeled Erase destination.
Select the destination volume from the left side list and drag it to the Destination entry field.
Select the source volume from the left side list and drag it to the Source entry field.
Double-check you got it right, then click on the Restore button.
Destination means the second internal drive. Source means the internal startup drive. -
Hash Table/Binary Search Tree question
I'm creating a hash table that uses a Binary Search Tree in each element to handle collisions. I isolated the problem to where and how it occurs to two lines of code; here is the relevant code(There is a working method "insert(String s)" in the BinarySearchTree class):
x = new BinarySearchTree[size];
x[0].insert("pppppp");When I try to insert ANY String into ANY array element of x (not just 0), I get a NullPointerException. Keep in mind that BinarySearchTree works perfectly when it's not an array.
Message was edited by:
rpelepx = new BinarySearchTree[size];
x[0].insert("pppppp");You should know that when you allocate an array of objects, each entry is initialized to null.
Instead, you must do this:
x = new BinarySearchTree[size];
for(int i=0; i<size; i++) {
x[i] = new BinarySearchTree();
}After that, you can then do
x[0].insert("pppppp"); -
Basic binary search tree question
Hi,
I was just wondering, if there's a binary search tree that holds objects can the binary search tree be based on any of the attributes in those objects.
So for example say we have a Person object and it has the attributes name, age, and height. Can we make a binary search tree based on the age or a search tree based on just the height.
And lastly how would that be done in the comparable method.
Thanks.Of course it depends on what (and whether) the Person class implements for Comparable. If you want to base the tree on the default comparison (i.e., the one that compareTo does) then you don't need a separate Comparator.
When you write your binary tree implementation, it's wise to make it smart enough to either take a Comparator, or to use the default comparison (if the objects being tracked implement Comparable).
Note that Comparators and Comparable have nothing to do with trees per se. It's not like a tree necessarily needs one or the other. It's simply very smart to use the existing Java framework to determine an order among objects.
Maybe you are looking for
-
I just installed LION and no Power PC Apps work. HP says there are updates for Lion from MAC APP store for the HP 3210 PhotoSmart All in Printer and provided instructions. I followed these but no updates were visible or installed. Any idea why? Is
-
Not receiving email sometimes...help
Hi, I have recently noticed my iPhone sometimes doesn't get new email even if I have one on the server. For instance, today I was checking my iPhone inbox several times during the day - nothing was there. When I came back home and opened my Mail - vo
-
I need to know how to set up my wife own account instead of under mind account?
-
Can I buy applecare on a product for more than 3 years?
Apple Care is expiring on product in August. Would like to know if I can purchase another Apple Care to extend coverage or is there a limit on coverage?
-
Hi All, Can anybody please guide me abt Skip lots and automatic usage decion. According to what I have understood,if i activate Skip lots and automatic UD tick in QM view of Materail Master and keep the characterstics in Inspection plan as optional c