Link node

Is there a way we can load a hierarchy which has duplicate nodes through a flat file?
It gives error message saying " Node already exists".
While creating manually, we can enable the option "Copy duplicate nodes". Is there anything similar that we can enable while loading through a flat file?

yes there is, we did it at a project (couple of years ago)... however I cannot recall how anymore

Similar Messages

Calculation in BEx on Hierarchy Link Nodes

Hello everyone. I am working on a BEx query that involves a hierarchy based on Controlling Area, Cost Center, and Cost Element. There is a case where I have 5 Cost Elements that belong to 2 Cost Centers. I can successfully create the duplicate nodes at the different Cost Center levels and activate the hierarchy. Where I am having difficulty is assigning a percentage factor to the key-figure at the parent-node (80%) and the link-node (20%). The high-level node at CO_AREA is correct. However, the COST_CENTER nodes show the total original value. I would like to apply these factors dynamically in the BEx query. I have tried structures and cell definitions and was able to apply the 80% and 20% factors correctly to the corresponding hierarchy nodes. Unfortunately, the amounts are not broken down as I would like to see them.
I have looked at the documentation on "Link Nodes" and "Modeling Nodes and Leaves: at help.sap.com.
http://help.sap.com/saphelp_nw04/helpdata/en/b3/fa3d3806136268e10000009b38f8cf/content.htm
http://help.sap.com/saphelp_nw04/helpdata/en/80/1a6743e07211d2acb80000e829fbfe/content.htm
This is from one of the above links:
"For both duplicate leaves and leaves in subtrees under link nodes, the values of the duplicate leaves are only considered once by the system internally. When aggregating, the system automatically calculates what are called correction leaves for the superordinate node.
If a leaf Lo lies three times amongst the descendants of a node No, the value is added three times internally and then subtracted twice by the correction node."
I'm wondering if it is even possible to do what I would like to accomplish.
I would appreciate any feedback and suggestions on how to solve this issue if you have done something similar.
Best Regards,
Albert Pecoraro
Sr.SAP BW Specialist
Ferro Corporation
Example:
CO_AREA_1000 = Total = $1000 (AAAA = $800, BBBB = $200)
-->COST_CENTER_AAAA = $1000 @ 80% = $800
>COST_ELEMENT_100 = 100 @ 80% = $80
>COST_ELEMENT_101 = 200 @ 80% = $160
>COST_ELEMENT_102 = 300 @ 80% = $240
>COST_ELEMENT_103 = 150 @ 80% = $120
>COST_ELEMENT_104 = 250 @ 80% = $200
-->COST_CENTER_BBBB = $1000 @ 20% = $200
>COST_ELEMENT_100 = 100 @ 20% = $20
>COST_ELEMENT_101 = 200 @ 20% = $40
>COST_ELEMENT_102 = 300 @ 20% = $60
>COST_ELEMENT_103 = 150 @ 20% = $30
>COST_ELEMENT_104 = 250 @ 20% = $50

Hi Alberto,
Would you please post the resolution of the issue with the hierarchy node calculation? I too have a simillar requirement. It would be helpful if you share the solution for tha issue that you had.
Saravana

Server Side Links (Node Link): caught exception

HI ,
Following error is showing up in System Audit Trace Logs:
Server Side Links (Node Link): caught exception
I am not able to figure is out why this error is coming.
Can any please explain the reason of this error..
thanks

Hi
Thanks for the link, it is indeed a good example. However, whilst it has some interesting points, it seems to narrowly skirt around the issue i am having (as do most examples in fact).
Perhaps i should have been more clear that the problem i am having relates specifically to entities that have already been persisted, and all i am trying to do is edit them. In the example you sent, if bean-validation fails then the entity is not persisted, so no problems. However, when editing an already persisted entity, form submissions trigger an automatic database update via the EntityManager (provided JSF validations are passed), so my real problem is avoiding this.
Any input appreciated.
-Rich

Maintain the link node in a hierarchy

Hello,
I have loaded 2 hierarchies H1 and H2 from ERP system and maintained a hierarchy Z in BW consists of H1 and H2. The node names are exactly the same of the 2 loaded hierarchies. Now I want to maintain the “link node flag” for the 2 nodes H1, H2.
When I maintain the hierarchy this field is only displayed (and it is blank).
How can I change this field to ‘X’.
Thanks!

Hi
Did you solve this? Im facing the same problem
Thanks!

Create a link node in tree

I created a web dynpro project which implement a KM file repository constructs by recursion child node. If the node is collection (folder) there is no problem to open it,But if it is not (for example if it is a *.pdf or *.doc or *.txt), I dont know how can I open it. May be I should somehow cause the node to be a link.
Thanks a head for your help
Message was edited by: Armin Reichert

Hi,
1.Bind the ValueAttribute to the NodeItem and store all the URLs in the ValueAttribute.
2.Bind the same ValueAttribute to the IFrame control also.
3.On Click of TreeItem it will open the URL in the IFrame
Regards, VIP

How to specify AND/OR relationships while linking nodes in uCMDB Java API

Hi,
I am trying to build a TQL via the uCMDB Java API. The structure that I am trying to build is of this type:
|- Server
   |- Disk
   |- FileSystem
   |- NIC(Interface)
        |-IPAddress
In the TQL I want to specify the relationship between server and nic (interface) as composition or containment. So if either relationship matches, it should return me data.
To build this, I used the following code:
//server node
QueryNode serverNode = queryDefinition.addNode("ServerNode").ofType("node");
//nic (interface) node, uses containment link
QueryNode nicNode = queryDefinition.addNode("NICNode").ofType("interface");
//nic (interface) node, uses composition link
QueryNode nicNode1 = queryDefinition.addNode("NICNode1").ofType("interface");
// now add relationships
serverNode.linkedTo(nicNode).withLinkOfType("containment").atLeast(0);
serverNode.linkedTo(nicNode1).withLinkOfType("composition").atLeast(0);
My guess is that when I am adding relationships using "withLinkOfType()", it directly ANDs the conditions. Is there a way I could OR conditions which says:
                    Give me NIC Interfaces which either have a composition or containment relation with my server.
Thanks in advance!

Hi,
You need to create a ejb-jar.xml and jboss.xml files to deploy the application on the servers.
Also, put these lines of codes after getting System Properties.
prop.put(Context.PROVIDER_URL, "iiop://localhost:[port_no]");Thanks,
Srikant

Want Linked Node to return self in getNext(0)

I'm trying to make a getNext for my linked list that can return anywhere from several nodes ahead to itself.
How do I make a method that can return itself? I don't want to pass the calling object in with the parameters, that seems rather messy. I can't do previous.next or next.previous because sometimes those values will be empty.
Sample code follows, with highlighting for attempted legibility:
I included the whole class at once since I didn't want it to be spread about if more was asked for.
Session is an enormous user-defined class that stores a lot of data of widely varying types.
class NodeSession
private Session value;
private NodeSession next;
private NodeSession prev;
*{color:#0000ff}//constructors{color}*
{color:#008000}public NodeSession()
Session defaultSession = new Session();
value = defaultSession;
public NodeSession(Session q, NodeSession r)
value = q;
prev = r;
public NodeSession(Session q, NodeSession p, NodeSession r)
setValue(q);
setNext(r);
setPrev(p);
{color}*{color:#0000ff}//gets{color}*
{color:#999999}public Session getValue()
return value;
public NodeSession getNext()
return next;
public NodeSession getPrev()
return prev;
{color}*{color:#0000ff}//sets{color}*
{color:#999999}public void setValue(Session q{color}{color:#999999})
{color}{color:#999999}{
value = q;
{color}{color:#999999}}
public void setNext(NodeSession r{color}{color:#999999}*)*
{color}{color:#999999}*{*
next = r;
{color}{color:#999999}*}*
public void setPrev(NodeSession p{color}{color:#999999})
{color}{color:#999999}{
prev = p;
{color}{color:#999999}}{color}
{color:#0000ff}*//attempted jumps*{color}
public NodeSession getNext(int i)
NodeSession newNext = next.getPrev();
+{color:#0000ff}//newNext = current nodeSession, but only if next exists+
+{color}{color:#0000ff}//need some way to refer to the object I'm trying to manipulate so I can return it.+
+{color}+for(int j = 0; j < i; j++)
newNext = newNext.getNext();
return newNext;
{color:#0000ff}//more of the same
{color}{color:#999999}public NodeSession getPrev(int i)
NodeSession newPrev = prev.getNext();
for(int j = 0; j < i; j++)
newPrev = newPrev.getPrev();
return newPrev;
{color}*}*
Comments on legibility are also welcome. How are indents done in this forum?
Edited by: SothaSil on Mar 22, 2008 4:30 PM

Comments on legibility are also welcome. How are indents done in this forum?To post code, use the code tags -- [code]Your Code[/code]will display
asYour CodeOr use the code button above the editing area and paste your code
between the {code}{code} tags it generates.
db

View for a network node or link table

Can a view be used for a nework node or link table? The process sdo_net.validate_network hangs when I try to validate a network based on views for the node and link tables.

I am using a logical model. The sql statement (checking link/node relationship) that hangs is:
select count(a.link_id) from vlinks a
where not exists
select * from vnodes b
where b.node_id = a.start_node_id or b.node_id = a.end_node_id
I gather there is a concurrency issue with my links view because it joins a table with itself. I have a link table that has the start and end nodes defined on two records. Here is my view script:
create or replace view vlinks
(link_id, link_name, start_node_id, end_node_id, link_type, active, link_level, cost, parent_link_id)
as
select a.id, 'Link '||a.id, a.nodeid, b.nodeid, 'simple', 'Y',1,0,''
from vnodes a, vnodes b
where a.seq=1 and b.seq>1 and a.id = b.id
I can create tables from my views and validate them successfully through sdo_net.validate_nodes_schema, sdo_net.validate_links_schema, and sdo_net.validate_network.
I can analyze the network model through the Java API using the reachable nodes, shortest path, and spanning tree methods without any problems.
I guess I'll validate my view links by counting the total number of links and subtracting the number of links joined successfully at the start and end nodes - if 0 then all links are valid. E.g.:
select count(link_id) from
select link_id from vlinks
minus
select a.link_id from vlinks a, vnodes b, vnodes c
where a.start_node_id = b.node_id
and a.end_node_id = c.node_id

Linked List - nodes

Hi,
In a lecture a couple of weeks ago, we began the topic of reference-based lists. I copied the attached
code off the board. I'm now trying to utilize the code by creating a public class Node. However, the constructors don't seem to make much sense. I was too busy writing down the information to pay much attention at the time. My book doesn't seem to address this...
1) in the first constructor: item = null; I'm declaring item initially as an integer, but the constructor is trying to attach a null to item. I think the intent is to create a node that initially has both info and link as nulls.
2) in the third constructor: link = Node; Is this possible? I'm not what this will do.
And finally, the second and third constructors are using the same name and parameter, so there is a conflict. I don't know how to resolve this.
Thanks in advance for any help...
aiki
public class Node {
          public int info;
          public Node link;
          public Node(){
               info = null;
               link = null;
          public Node (int data){
               info = data;
               link = null;
          public Node (int data){
               info = data;
               link = Node;

public class Node {
    public int info;
    public Node link;
    public Node(){
        // default constructor does nothing.
        // Therefore info and link will get default values.
        // For Objects this will be null
    public Node (int data){
        info = data;
        // don't initialise link. See above
    public Node (int data, Node node){
        // I think you missed the second parameter
        info = data;
        link = node;
}

How to print the contents of doubly-Linked List

Hi
I have a DLList consists of header , trailer and 10 linked nodes in between
Is there a simple way to print the contents ie "the elements"
of the list
thanks

In general you should write an iterator for every linked data structure for fast traversal. I'm guessing you're writing your own DLL for an assignment because one normally uses the LinkedList structure that is included in the api. Anyway, here is an example of how the iterator is implemented for a double linked list:
http://www.theparticle.com/_javadata2.html#Doubly_Linked_Lists_with_Enumeration

Putting a class of objects in a Linked List?

Hi,
I copied a program from a book and I want to edit it and put studentRecord class in the Linked List. I've tried to play about with datum, but everything I try doesn't work. Can someone help me out? How could I put studentRecord in the LinkedList?
import java.io.*;
class IO
     static BufferedReader keyboard = new
          BufferedReader(new InputStreamReader(System.in));
     static PrintWriter screen = new PrintWriter(System.out, true);
class studentRecord
     private String name;
     private int IDNumber;
class LinkedList
     class Node
          protected Object datum;
          protected Node link;
          public Node() {}
          public Node(Object item, Node pointer)
               datum = item;
               link = pointer;
     private Node head;
     private Node tail;
     private Node temporary;
     private int nodeCount = 0;
     //constructor
     public LinkedList()
          head = null;
          tail = null;
          temporary = null;
     //method to insert an object into the linked list
     public void insert(Object datum)
          if (head == null) // list empty
               head = new Node(datum, head);
               tail = head;
          else
               temporary = new Node(datum, temporary);
               tail.link = temporary;
               tail = temporary;
               temporary = null;
          nodeCount++;
Full program can be found: http://dil3mma.tripod.com/LinkedList.txt
Thanks in advance.

Hi jverd,
Thanks for replying. I've tried to change the program liked you said but there is 1 error I can't seem to fix(Im sure there are more tho). The error is "cannot resolve symbol" I typed in caps the line it happens on so it's easy to see. Any idea what it could be? Is it cause I'm comparing a String with Object?
import java.io.*;
class IO
     static BufferedReader keyboard = new
          BufferedReader(new InputStreamReader(System.in));
     static PrintWriter screen = new PrintWriter(System.out, true);
class sRecord
     private String name;
     private int IDNumber;
class LinkedList
     class Node
          protected sRecord datum;
          protected Node link;
          public Node() {}
          public Node(sRecord item, Node pointer)
               datum = item;
               link = pointer;
     private Node head;
     private Node tail;
     private Node temporary;
     private int nodeCount = 0;
     //constructor
     public LinkedList()
          head = null;
          tail = null;
          temporary = null;
     //method to insert an object into the linked list
     public void insert(sRecord datum)
          if (head == null) // list empty
               head = new Node(datum, head);
               tail = head;
          else
               temporary = new Node(datum, temporary);
               tail.link = temporary;
               tail = temporary;
               temporary = null;
          nodeCount++;
     //method to delete an object from the linked list
     public boolean delete(Object scrap)
          Node previous = head;
          //for every node in the linked list
          for (Node current = head; current != null; current = current.link)
               //node to be deleted is at the head of the list
               if (current.datum.equals(scrap) && previous == current)
                    head = current.link;
                    if (head == null) tail = null;
                    nodeCount--;
                    return true;
               //node to be deleted is after the first node and before the last
               else if (current.datum.equals(scrap) && (current.link != null))
                    previous.link = current.link;
                    nodeCount--;
                    return true;
               //node to be deleted is at the ned of list
               else if (current.datum.equals(scrap) && (current.link == null))
                    tail = previous;
                    previous.link = null;
                    nodeCount--;
                    return true;
               previous = current;
          return false;
     //method to display the contents of a linked list
     public void displayList()
          Node temporary = head;
          if (head == null)
               IO.screen.println("linked list is empty");
               return;
          while (temporary != null)
               IO.screen.println(temporary.datum);
               temporary = temporary.link;
     //method to return true if the linked list is empty
     public boolean isEmpty()
          return (nodeCount == 0);
     //method to return the number of nodes in the linked list
     public int nodes()
          return nodeCount;
     //method to display a menu to insert data into the linked list
     static private char menu()
          char response = '\u0000';
          IO.screen.println("Do you want to ");
          IO.screen.print("nsert, [D]elete, [L]ist, [E]xit? ");
          IO.screen.flush();
          boolean done=false;
          do
               try
                    String data = IO.keyboard.readLine();
                    response = Character.toUpperCase(data.charAt(0));
                    done = true;
               catch (Exception e)
                    IO.screen.println("Please input a single character I, D, L or E");
          } while (! done);
          return response;
     static public void main(String[] args) throws IOException
          LinkedList list = new LinkedList();
          String datum;
          char choice;
          //get information from menu
          choice = menu();
          for (;;)
               //Menu
               switch (choice)
                    case 'I' :
                         IO.screen.println("type quit to finish input");
                         IO.screen.print("Enter a word ");
                         IO.screen.flush();
                         datum = IO.keyboard.readLine();
                         while (! datum.equals("quit"))
THE ERROR HAPPENS HERE ON THIS LINE          list.insert(datum.name);
                              IO.screen.print("Enter another word");
                              IO.screen.flush();
                              datum = IO.keyboard.readLine();
                         break;
               case 'D' :
                    //if list is empty deletion not possible
                    if (list.isEmpty())
                         IO.screen.println("linked list is empty");
                         break;
                    IO.screen.println("type quit to finish input");
                    IO.screen.print("Delete? ");
                    IO.screen.flush();
                    datum = IO.keyboard.readLine();
                    while (! datum.equals("quit"))
                         if (list.delete(datum))
                              IO.screen.println(datum+" was scrapped!");
                         //if list is empty deletion is not possible
                         if (list.isEmpty())
                              IO.screen.println("linked list is empty");
                              break;
                         IO.screen.print("Delete? ");
                         IO.screen.flush();
                         datum = IO.keyboard.readLine();
                    break;
               case 'L' :
                    list.displayList();
                    IO.screen.println("number of nodes " + list.nodes());
                    break;
               case 'E' : System.exit(0);
          //get information from menu
          choice = menu();

View Link Bug! - JDEV Developers please read.

This has to be a bug. When I am done with my project for the day I check in the files into PVCS. After check in the files are deleted off my local drive. When I recheck out my project and do a rebuild on the project, I get several View link XML files that say that they are not correct. However when I pull them up in the editor and relink them, there is NO CHANGE to the XML file that stores the DEF. Below is a sample of one of the files. If I go into this view link with the visual editor and reselect the linking nodes, all is fine in JDEV.
Is this a bug that is being worked on for the next version?
SAMPLE
<?xml version='1.0' encoding='windows-1252' ?>
<!DOCTYPE ViewLink SYSTEM "jbo_03_01.dtd">
<ViewLink Name="RequestCauseLookupVL">
<DesignTime>
<Attr Name="_isCodegen" Value="true"/>
<Attr Name="_version" Value="10.1.3.36.73"/>
</DesignTime>
<ViewLinkDefEnd Name="RequestVO" Cardinality="1"
Owner="dataAccess.Request.RequestView" Source="true">
<AttrArray Name="Attributes">
<Item Value="dataAccess.Request.RequestView.CauseCd"/>
</AttrArray>
<DesignTime>
<Attr Name="_finderName" Value="RequestVO"/>
<Attr Name="_accessor" Value="true"/>
<Attr Name="_minCardinality" Value="1"/>
<Attr Name="_isUpdateable" Value="true"/>
<Attr Name="_entityAccessor" Value="true"/>
</DesignTime>
</ViewLinkDefEnd>
<ViewLinkDefEnd Name="ReqCause_LOV" Cardinality="1"
Owner="dataAccess.lov.ReqCause_LOV">
<AttrArray Name="Attributes">
<Item Value="dataAccess.lov.ReqCause_LOV.LookupId"/>
</AttrArray>
<DesignTime>
<Attr Name="_finderName" Value="ReqCause_LOV"/>
<Attr Name="_accessor" Value="true"/>
<Attr Name="_isUpdateable" Value="true"/>
<Attr Name="_entityAccessor" Value="true"/>
</DesignTime>
</ViewLinkDefEnd>
</ViewLink>

Hi Steve,
JDev appears to be updating the viewlink files. I have not edited any of them and they all have the timestamp of when i closed JDev last Friday:
-rw-rw-rw- 1 user group 1236 Sep 1 16:45 ApprovalDetailsFkLink.xml
-rw-rw-rw- 1 user group 1224 Sep 1 16:45 InvestigatorsFkLink.xml
-rw-rw-rw- 1 user group 1260 Sep 1 16:45 MulticentreProjectsFkLink.xml
-rw-rw-rw- 1 user group 1258 Sep 1 16:45 PrjWorklistItemsFkLink.xml
-rw-rw-rw- 1 user group 1200 Sep 1 16:45 FieldBasedFKLink.xml
-rw-rw-rw- 1 user group 1195 Sep 1 16:45 GmAnimalsFKLink.xml
-rw-rw-rw- 1 user group 1225 Sep 1 16:45 HarmfulFKLink.xml
-rw-rw-rw- 1 user group 1032 Sep 1 16:45 ObservationFKLink.xml
-rw-rw-rw- 1 user group 1226 Sep 1 16:45 OtherInvestigatorsFKLink.xml
-rw-rw-rw- 1 user group 1196 Sep 1 16:45 OtherPartiesFKLink.xml
-rw-rw-rw- 1 user group 1028 Sep 1 16:45 PermitsFKLink.xml
-rw-rw-rw- 1 user group 1206 Sep 1 16:45 ProjectPartiesFKLink.xml
-rw-rw-rw- 1 user group 1042 Sep 1 16:45 RespInvestigatorsFkLink.xml
-rw-rw-rw- 1 user group 1012 Sep 1 16:45 SurgeryFKLink.xml
-rw-rw-rw- 1 user group 1190 Sep 1 16:45 TeachingFKLink.xmlthe CVS looks like this (August 24 was when i deleted them all from CVS and re-added them):
-r--r--r-- 1 banstey dba 1347 Aug 24 09:51 ProjectPartiesFKLink.xml,v
-r--r--r-- 1 banstey dba 1172 Aug 24 09:51 PermitsFKLink.xml,v
-r--r--r-- 1 banstey dba 1337 Aug 24 09:51 OtherPartiesFKLink.xml,v
-r--r--r-- 1 banstey dba 1367 Aug 24 09:51 OtherInvestigatorsFKLink.xml,v
-r--r--r-- 1 banstey dba 1176 Aug 24 09:51 ObservationFKLink.xml,v
-r--r--r-- 1 banstey dba 1399 Aug 24 09:51 PrjWorklistItemsFkLink.xml,v
-r--r--r-- 1 banstey dba 1401 Aug 24 09:51 MulticentreProjectsFkLink.xml,v
-r--r--r-- 1 banstey dba 1365 Aug 24 09:51 InvestigatorsFkLink.xml,v
-r--r--r-- 1 banstey dba 1377 Aug 24 09:51 ApprovalDetailsFkLink.xml,v
-r--r--r-- 1 banstey dba 1325 Aug 24 09:51 AnimalFKLink.xml,v
-r--r--r-- 1 banstey dba 1331 Aug 24 09:51 TeachingFKLink.xml,v
-r--r--r-- 1 banstey dba 1186 Aug 24 09:51 RespInvestigatorsFkLink.xml,v
-r--r--r-- 1 banstey dba 1341 Aug 30 11:37 AnimalCareFKLink.xml,v
-r--r--r-- 1 banstey dba 1341 Aug 30 11:38 FieldBasedFKLink.xml,vTimestamps of my associations are all over the place, which is consistent with the creation process.
Will do an unchanged commit and post the results.
regards,
Brenden

View link in ADF

Hi,
I have created a view link. It works fine when I test it through application module, but when I select the view link node under related view object and look at the different options available in the dropdown list "Drop As:", I can't see anything. It is supposed to be something like Master Detail (Many to Many), but what I see is all blank in the dropdown list and I can't use it in the jsp page to create a master detail functionality.
Thanks,
Setare

yes that's the view object for the master.
Suppose you create a default business component on the Dept and Emp tables from the Scott schema.
In the Data Controller Palette you'll see a DeptView1 and if you expand it after the fieilds from the dept table you'll see the Empview table.
check out this image to see how it looks like:
http://otn.oracle.com/products/jdev/collateral/tutorials/9050/images/datacontrol.jpg
(that's from the UIX tutorial).

List Component Links

I have created AS3 script for loading and parsing an RSS
feed. I have successfully displayed the "title" node on the stage
in a List Component with the instance name "blogList". Now I wish
to use the corresponding "Link" node so that each item in the list
will open a web page to the link for that story. I have been able
to get each title to link to the last URL link in the RSS feed. I
am stumped. Help :)

Answer from the boys at actionscript.org.
Works like a charm. The function for click is outside of the
function blogLoaded and most importantly used the data property on
the object in order to pass the correct reference.
var blogLoader:URLLoader = new URLLoader();
var blogURL:URLRequest = new URLRequest("
http://www.canada.com/calgaryherald/topstories.rss");
blogLoader.addEventListener(Event.COMPLETE, blogLoaded);
blogLoader.load(blogURL);
var blogXML:XML = new XML();
blogXML.ignoreWhitespace = true;
function blogLoaded(evt:Event):void {
blogXML = XML(blogLoader.data);
//trace(blogXML);
for(var item:String in blogXML.channel.item) {
blogList.addItem({label:blogXML.channel.item[item].title,data:blogXML.channel.item[item]} );
blogList.addEventListener(MouseEvent.CLICK, blogClick);
function blogClick(e:MouseEvent):void {
navigateToURL(new
URLRequest(e.currentTarget.selectedItem.data.link));

Incementing 'pointer' in linked list

Hi,
Im trying to create a linked list in java having just been coding in C so im all mixed up. i have created a simple linked list and now hope to use inheritance to develope this list into something more practical and adding insert, removes and existence checks. i am using a system whereby i have defined a link within the list which i am also using as a 'pointer' so i can do things like the functions mentioned above.
i thought that in order to increment my pointer onto the next link in the list i would type node.next (where node is the name of the link). this is not working at all and i havent a clue how to fix it.
here is the code i am using:
public class link
 public int value;
 public link next;
 public link(int data, link nxt)
 value = data;
 next = nxt;
public class LinkedList {
 public link head;
 public link tail;
 public int length;
 public LinkedList()
 create();
 public void create()
 this.length = 0;
 this.head = null;
 this.tail = null;
 public void cons(int data)
 if(head == null)
 head = new link(data, head);
 tail = head;
 length++;
 } else {
 head = new link(data, head);
 length++;
 public int head()
 return head.value;
 public int tail()
 return tail.value;
 public boolean isEmpty()
 if(head == null)
 return true;
 } else {
 return false;
public class Ordered extends LinkedList {
 public link node;
 public void insert(int data, int pos)
 //insert code to go here
 public int remove(int pos)
 int counter = 0;
 int data = null;
 node = head;
 if(pos < length){
 while(counter < pos){
 node.next; //increment node here
 counter++;
 data = node.value;
 return data;
 public boolean isIn(int data)
 int counter = 0;
 boolean flag = false;
 node = tail;
 while(counter < length){
 if(node.value == data){
 flag = true;
 counter++;
 //increment node here
 return flag;
}Many thanks in advance,
Nick

Hey,
i have an update on this problem. i used the node = node.next suggestion but that will not actually allow me to edit the object at all, it just copies it.
is there anyway of iterating through the links (objects) in order to edit their variables? im trying to implement the remove code now but if i want to change the next value on the selected link it will only change it in the copy that is being stored under node, not that actual object.
heres the code:
 public int remove(int pos)
 int counter = 1;
 int data = 0;
 node = head;
 if(pos <= length){
 while(counter < (length - pos)){ //this loop will set node to the link that needs to be
 node = node.next; //removed from the linked list
 counter++;
 counter = 0;
 node2 = head;
 while(counter < (pos - 1)){ //this loop sets node2 to the link before the link that
 node2 = node2.next; //needs to be removed
 counter++;
 data = node.value; //stores the value of the link to be removed
 node = node.next; //increments node to the next link
 node2.next = node; //the next value at node2 is then changed so that it bypasses
 length--; //the link i want removed
 return data;
 }i have annotated my intentions of each line, but they do not actually do what i want.
if anyone knows how to change the variables in a object could you help me out please,
cheers, Nick

Link node

Similar Messages

Maybe you are looking for