What data structure is better?

hello all!
i would like to ask you a suggestion.. i am implementing a project in JSP+java in mvc and i have still not understood what data structure would be better to do the following:
i have "Catalogs" of entities (e.g. payments) where each one is composed by several double data. the structure of the site is that the jsp talks to its Bean which in turn talks to the controller (normal java class- no servlet) which finally ask the data to the entitiy class. How could i pass these vectors of datas to the jsp page without let it talk directly to the entity? I think that bean+jsp are MVC's boundary classes and i don't want them to talk with entities (and then they cannot directly use entity methods as bill.getAmount())..
How could i do?
Thanks a lot! Bye

I use PNG as it is smaller than TIF and holds transparencym unlike JPG.

Similar Messages

Unsure what data structure will work best??

okay heres the scenario
i have 4 strings per element and i need to store these within a data structure, the number of elements is not to be fixed
is it possible to store an array within an arraylist or vector?
when i tried to implement the vector it seemed to work fine until i tried to display the element, heres my code
Vector vectorDetails = new Vector();
String[4] arrayDetails = new String(4);
details[0] = nameText.getText();
details[1] = nameText.getText();
details[2] = nameText.getText();
details[3] = nameText.getText();
String[] s1 = (String)details.lastElement();
String[] s2 = (String)details.firstElement();
whenever i print s1 or s2 i get the same information, regardless of the amount of elements i have
sorry i couldn't post more of the code, but its on the large size, but if anyone can help i would be much appreciated

okay, now i am really confused, how did i get from a vector to a hashtable??
to be honest i dont think that structure will work with my GUI
the way it stands i have five buttons across the top, standard buttons, i.e. new, add, search, edit, delete
at the bottom i have four buttons, firstElement, previousElement, nextElement, and lastElement
in the center of the screen i have my textfields were i enter the details and also view each individual persons details, as such i will need access to each individual string
at present i have two classes, EmailContactDatabase.java & Person.java so i will need to pass the persons details back and forth
any further help would be much appreciated
note this is a university assessment, so i am not looking for specific code, just some pointers to get me in the right direction
note note the structure as i pointed out in an earlier post does NOT have to be dynamic, i can set the maximum number of elements.

What is the best data structure for loading an enterprise Power BI site?

Hi folks, I'd sure appreciate some help here!
I'm a kinda old-fashioned gal and a bit of a traditionalist, building enterprise data warehouses out of Analysis Service hypercubes with a whole raft of MDX for analytics. Those puppies would sit up and beg when you asked them to deliver up goodies
to SSRS or PowerView.
But Power BI is a whole new game for me.
Should I be exposing each dimension and fact table in the relational data warehouse as a single Odata feed?
Should I be running Data Management Gateway and exposing each table in my RDW individually?
Should I be flattening my stars and snowflakes and creating a very wide First Normal Form dataset with everything relating to each fact?
I guess my real question, folks, is what's the optimum way of exposing data to the Power BI cloud?
And my subsidiary question is this: am I right in saying that all the data management, validation, cleansing, and regular ETTL processes are still required
before the data is suitable to expose to Power BI?
Or, to put it another way, is it not the case that you need to have a clean and properly structured data warehouse
before the data is ready to be massaged and presented by Power BI?
I'd sure value your thoughts and opinions,
Cheers, Donna
Donna Kelly

Dear All,
My original question was:
what's the optimum way of exposing data to the Power BI cloud?
Having spent the last month faffing about with Power BI – and reading about many people’s experiences using it – I think I can offer a few preliminary conclusions.
Before I do that, though, let me summarise a few points:
Melissa said “My initial thoughts: I would expose each dim & fact as a separate OData feed” and went on to say “one of the hardest things . . . is
the data modeling piece . . . I think we should try to expose the data in a way that'll help usability . . . which wouldn't be a wide, flat table ”.
Greg said “data modeling is not a good thing to expose end users to . . . we've had better luck with is building out the data model, and teaching the users
how to combine pre-built elements”
I had commented “. . . end users and data modelling don't mix . . . self-service so
far has been mostly a bust”.
Here at Redwing, we give out a short White Paper on Business Intelligence Reporting. It goes to clients and anyone else who wants one. The heart
of the Paper is the Reporting Pyramid, which states: Business intelligence is all about the creation and delivery of actionable intelligence to the right audience at the right time
For most of the audience, that means Corporate BI: pre-built reports delivered on a schedule.
For most of the remaining audience, that means parameterised, drillable, and sliceable reporting available via the web, running the gamut from the dashboard to the details, available on
demand.
For the relatively few business analysts, that means the ability for business users to create their own semi-customised visual reports when required, to serve
their audiences.
For the very few high-power users, that means the ability to interrogate the data warehouse directly, extract the required data, and construct data mining models, spreadsheets and other
intricate analyses as needed.
On the subject of self-service, the Redwing view says: Although many vendors want tot sell self-service reporting tools to the enterprise, the facts of the matter are these:
v
80%+ of all enterprise reporting requirement is satisfied by corporate BI . . . if it’s done right.
v Very few staff members have the time, skills, or inclination to learn and employ self-service business intelligence in the course of their activities.
I cannot just expose raw data and tell everyone to get on with it. That way lies madness!
I think that clean and well-structured data is a prerequisite for delivering business intelligence.
Assuming that data is properly integrated, historically accurate and non-volatile as well, then I've just described
a data warehouse, which is the physical expression of the dimensional model.
Therefore, exposing the presentation layer of the data warehouse is – in my opinion – the appropriate interface for self-service business intelligence.
Of course, we can choose to expose perspectives as well, which is functionally identical to building and exposing subject data marts.
That way, all calculations, KPIs, definitions, and even field names, and all consistent because they all come from the single source of the truth, and not from spreadmart hell.
So my conclusion is that exposing the presentation layer of the properly modelled data warehouse is – in general - the way to expose data for self-service.
That’s fine for the general case, but what about Power BI? Well, it’s important to distinguish between new capabilities in Excel, and the ones in Office 365.
I think that to all intents and purposes, we’re talking about exposing data through the Data Management Gateway and reading it via Power Query.
The question boils down to what data structures should go down that pipe.
According to
Create a Data Source and Enable OData Feed in Power BI Admin Center, the possibilities are tables and views. I guess I could have repeating data in there, so it could be a flattened structure of the kind Melissa doesn’t like (and neither do I).
I could expose all the dims and all the facts . . . but that would mean essentially re-building the DW in the PowerPivot DM, and that would be just plain stoopid. I mean, not a toy system, but a real one with scores of facts and maybe hundreds of dimensions?
Fact is, I cannot for the life of me see what advantages DMG/PQ
has over just telling corporate users to go directly to the Cube Perspective they want, that has already all the right calcs, KPIs, security, analytics, field names . . . and most importantly, is already modelled correctly!
If I’m a real Power User, then I can use PQ on my desktop to pull mashup data from the world, along with all my on-prem data through my exposed Cube presentation layer, and PowerPivot the
heck out of that to produce all the reporting I’d ever want. It'd be a zillion times faster reading the data directly from the Cube instead of via the DMG, as well (I think Power BI performance sucks, actually).
Of course, your enterprise might not
have a DW, just a heterogeneous mass of dirty unstructured data. If that’s the case,
choosing Power BI data structures is the least of your problems! :-)
Cheers, Donna
Donna Kelly

Efficient data structure to implement simple text editor?

I was given this problem in an interview:
What data structure would you use to implement a simple text editor that does these 4 functions:
a) goto(line number)
b) insert(char input,location)
c) delete(location)
d) printAll() //print entire file
Given that i'm such a newb, i was stumped. I came up with making a 2d array that would allow for o(1) time for goto, but o(n) for everything else (shifting everything in the array). there were other downfalls too dealing with space issues and such, but he wanted me to optimize this data structure. I then came up with a linked list of arrays, but that had similar problems.
But thinking about it further is driving me a little crazy so I'm wondering if you guys have any suggestions on how to answer this question...
one thing that came to mind after is to implement the data structure as a binary tree, where each node contains
class Node
char theChar
int position; // ie 0 = first character in the file, and 81 could be the first character in the 2nd line
node left,right,parent;
}so how it works is the cursor would know where the location was so i would know where to delete and insert within the tree.
insert {
     //search for location to insert after (log n)
       //create new character node and append to current node
     //increment position for all subsequent children
delete(x) {
     search for x position
     if found, remove node and decrement position value for all children
goto(line #) {
     return line # * 80 (or whatever max length for a single line)
}the major problem i see here is balancing the tree after every insert/delete
Thanks in advance.

One of many great things emacs has given us is the gap buffer:
http://en.wikipedia.org/wiki/Gap_buffer
To see a Java implementation of this you can look in the Java SDK source. The document model (I forget exactly what its called), used in Swing uses a gap buffer.

Which data structure to use in this scenario? queue, stack, list, ...

Hi,
I'm hesitant about what data structure to use (best efficient one) in the following scenario
At a given moment I have an ordered set of data such as:
(1,3,6,9,10)
and a current value (by instance, 11)
Then I need to access the LAST one (10) and
If my value is greater I will add it to the list. In this example I will add 11 so the list will be (1,3,6,9,10,11)
On the other hand, as a second step, I will iterate on the list as follows: I will get the first element, do something, then remove it, and go to next one until the list is empty. Therefore, basically I will access always the first element on the list.
I don't really care about the elements in the middle.
Which data structure do you suggest me to use?
I was thinking on Queue (easy to access the head, and extract one by one in order), but I don't know how to get the tail element (10 in this case), as it is the one that tells me if I have to add another element...
Thank you.

>
At a given moment I have an ordered set of data such as:
(1,3,6,9,10)
and a current value (by instance, 11)
Then I need to access the LAST one (10) and
If my value is greater I will add it to the list. In this example I will add 11 so the list will be (1,3,6,9,10,11)Any data structure will do, I would suggest a LinkedList.
On the other hand, as a second step, I will iterate on the list as follows: I will get the first element, do something, then remove it, and go to next one until the list is empty. Therefore, basically I will access always the first element on the list.Use an iterator and the corresponding remove methods.
Mel

What's the easiest way to move app data and data structures to a server?

Hi guys,
I've been developing my app locally with Apex 4.2 and Oracle 11g XE on Windows 7. It's getting close to the time to move the app to an Oracle Apex server. I imagine Export/Import is the way to move the app. But what about the app tables and data (those tables/data like "customer" and "account" created specifically for the app)? I've been using a data modeling tool, so I can run a DDL script to create the data structures on the server. What is the easiest way to move the app data to the server? Is there a way to move both structures and data in one process?
Thanks,
Kim

There's probably another way to get here, but, in SQL Developer, on the tree navigation, expand the objects down to your table, right click, then click EXPORT.. there you will see all the options. This is a tedious process and it sucks IMO, but yeah, it works. It sucks mostly because 1) it's one table at a time, 2) if your data model is robust and has constraints, and sequences and triggers, then you'll have to disable them all for the insert, and hope that you can re-enable constraints, etc without a glitch (good luck, unless you have only a handful of tables)
I prefer using the oracle command line EXP to export an entire schema, then on the target server I use IMP to import the schema. That way, it's near exact. This makes life messy if you develop more than one application in a single schema, and I've felt that pain -- however -- it's a whole lot easier to drop tables and other objects than it is to create them! (thus, even if the process of EXP/IMP moved more than you wanted to "move".. just blow away what you don't want on the target after the fact..)
You could use oracle's datapump method too.
Alternatively, what can be done, IF you have access to both servers from your SQL developer instance (or if you can tnsping them both already from the command line, you can use SQL*PLUS), is run a script that will identify your apex apps' objects (usually by prefix to object names, like EBA_PROJ_%, etc) and do all the manual work for you. I've created a script that does exactly this so that I can move data from dev to prod servers over a dblink. It's tricky because of the order that must be executed to disable constraints and then re-enable them, and of course, trickier if you don't consistently prefix ALL of your "application objects"... (tables, views, triggers, sequences, functions, procs, indexes, etc)

What is the smallest data structure record in a .TXT file record to be recognized as an Apple Address Book "Data Card"?

Hello! This is my first time in this discussion group. The question posed is the subject line itself:
What is the smallest data structure record in a .TXT file record to be recognized as an Apple Address Book "Data Card"?
I'm lazy! As a math instructor with 40+ students per class per semester (pCpS), I would rather not have to create 40 data cards pCpS by hand, only to expunge that info at semester's end. My college's IS department can easily supply me with First name, Last name, and eMail address info, along with a myriad of other fields. I can manipulate those data on my end to create the necessary .TXT file, but I don't know the essential structure of that file.
Can you help me?
Thank you in advance.
Bill

Hello Bill, & welcome aboard!
No idea what pCpS is, sorry.
To import a text file into Address Book, it needs to be a comma delimited .csv file, like...
Customer Name,Company,Address1,Address2,City,State,Zip
Customer 1,Company 1,2233 W Seventh Street,Unit 543,Seattle,WA,99099
Customer 2,Company 2,1 Park Avenue,,New York,NY,10001
Customer 3,Company 3,65 Loma Linda Parkway,,San Jose,CA,94321
Customer 4,Company 4,89988 E 23rd Street,B720,Oakland,CA,99899
Customer 5,Company 5,432 1st Avenue,,Seattle,WA,99876
Customer 6,Company 6,76765 NE 92nd Street,,Seattle,WA,98009
Customer 7,Company 7,8976 Poplar Street,,Coupeville,WA,98976
Customer 8,Company 8,7677 4th Ave North,,Seattle,WA ,89876
Customer 9,Company 9,4556 Fauntleroy Avenue,,West Seattle,WA,98987
Customer 10,Company 10,4 Bell Street,,Cincinnati,OH,89987
Customer 11,Company 11,4001 Beacon Ave North,,Seattle,WA,90887
Customer 12,Company 12,63 Dehli Street,,Noida,India,898877-8879
Customer 13,Company 13,63 Dehli Street,,Noida,India,898877-8879
Customer 14,Company 14,63 Dehli Street,,Noida,India,898877-8879
Customer 15,Company 15,4847 Spirit Lake Drive,,Bellevue,WA,98006
Customer 16,Company 16,444 Clark Avenue,,West Seattle,WA,88989
Customer 17,Company 17,6601 E Stallion,,Scottsdale,AZ,85254
Customer 18,Company 18,801 N 34th Street,,Seattle,WA,98103
Customer 19,Company 19,15925 SE 92nd,,Newcastle,WA,99898
Customer 20,Company 20,3335 NW 220th,2nd Floor,Edmonds,WA,99890
Customer 21,Company 21,444 E Greenway,,Scottsdale,AZ,85654
Customer 22,Company 22,4 Railroad Drive,,Moclips,WA,98988
Customer 23,Company 23,89887 E 64th,,Scottsdale,AZ,87877
Customer 24,Company 24,15620 SE 43rd Street,,Bellevue,WA,98006
Customer 25,Company 25,123 Smalltown,,Redmond,WA,98998
Try Address Book Importer...
http://www.sillybit.com/abee/

What is the new data structure for .RTM files in LV8?

We have software that translates our LV
program to another language. Part of that software package reads RTM
files, decodes them, replaces text, and resaves them. That code is
broken for menus that are saved in LV8+, however. What is the new data
structure?
The simple attached zip file has vi's which
are not ours but serve to illustrate the point. If it's run on an
older RTM file, it correctly outputs and XML version of it, on newer
RTM files it just throws an error.
-- This is the second time I posted this. I was curious what the Solution? icon did on somebody elses post and I apparently marked the whole thread as solved (there should really be an undo on that feature btw --
Attachments:
RunTime_Menu_to_XML.zip ‏33 KB

Hi Thomas,
What error are you getting when running the program? I was actually able to run it without errors in LV 8.6.
There are ways to programmatically read and customize RTM files in LabVIEW. I hope that the following links will help:
http://zone.ni.com/reference/en-XX/help/371361B-01/lvhowto/customizing_shortcut_menus_programm/
http://digital.ni.com/public.nsf/allkb/17803AA31C8C07C986256CFD0080D609?OpenDocument
Cheers,
Marti C
Applications Engineer
National Instruments
NI Medical

What kind of data structure should I use?

I have a user input dialog basically like following which need user input the sample number to specifiy each file belongs to which sample:
user input the sample number in the following dialog:
file name             sample
test 1                  1
test2                   2
test3                   1
test4                   2In another words, each sample could include multiple files, each file has a column of data. I tried to get
a data structure which specifies the sample and file relationship, to get an idea of what kind of files are in
one sample. I tried to use hashmap or hashtable, but they ask the key must be unique. What I need is to get the sample data structure for the later data processing.
thanks in advance!

You could make a Sample object, which creates a List of file names. Then put SampleNumber and SampleObject into a Map...
class Sample {
    java.util.List fileNames;
    Sample()
    { fileNames = java.util.ArrayList(5); }
    addFile(String fName)
    { fileNames.add(fName); }
    String[] getFileNames()
      String[] names = new String[fileNames.size()];
      for (int a = 0; a < names.length; a++)
      { names[a] = fileNames.get(a).toString(); }
      return names;
Map samples = new HashMap();
Sample samp1 = new Sample();
samp1.addFile("Test1"); samp1.addFile("Test3");
Sample samp2 = new Sample();
samp2.addFile("Test2"); samp2.addFile("Test4");
samples.add("1", samp1);
samples.add("2", samp2);
String selected = //String user selects...
Sample sampNeeded = (Sample)samples.get(selected);
String[] files = sampNeeded.getFileNames();

What Tree Data Structures does Java Include?

Hello,
I have been reading about several tree data structures like a binary search tree, self-balancing bst, minimum spanning tree, red-black tree, AVL tree, etc... Are there data structures in Java represent the various trees, or is implementation of the ds left to user?
Eric

"Java" can be termed the "Java Language". The language does not have trees.
In more general usage "Java" can refer to a standard, desktop, delivered VM which includes the standard Java API. The types that you are asking about would be found in the following package.
[http://java.sun.com/javase/6/docs/api/java/util/package-summary.html]
"Java" could also refer to any other commonly available implementations. In that case probably anything that can be implemented has been implemented somewhere. Googling works.

Relationship between Dynamic Memory Heap and Heap Data Structure

This question is not strictly related to Java, but rather to programming in general, and I tend to get better answers from this community than any where else.
Somehow, my school and industry experience have somehow not given me the opportunity to explore and understand heaps (the data structure), so I'm investigating them now, and in particular, I've been looking at applications. I know they can be used for priority queues, heap sorts, and shortest path searches. However, I would have thought that, obviously, there must be some sort of relationship between the heap data structure, and the dynamic memory heap. Otherwise, I can think of no good reason why the dynamic memory heap would be named "heap". Surprisingly, after searching the web for 90 minutes or so, I've seen vague references, but nothing conclusive (trouble seems to be that it's hard to get Google to understand that I'm using the word "heap" in two different contexts, and similarly, it would not likely understand that web authors would use the word in two different contexts).
The Java Virtual Machine Spec is silent on the subject, as "The Java virtual machine assumes no particular type of automatic storage management system, and the storage management technique may be chosen according to the implementor's system requirements."
I've seen things like:
[of dynamic memory] "All the blocks of a particular size are kept in a sorted linked list or tree (I extrapolate that sorted tree could imply heap)"
[of dynamic memory] "The free and reserved areas of memory are maintained in a data structure similar to binary trees called a heap"
[of dynamic memory] "This is not related to the heap data structure"
[of dynamic memory] "Not to be confused with the data structure known as a "heap"
[of data structure] "Not to be confused with the dynamic memory pool, often known as TheHeap"
At this point, I've come to surmise that some (but not all) memory management algorithms use heaps to track which (pages? blocks? bytes?) of memory are used, and which are not. However, the point of a heap is to store data so that the max (or min) key is at the root of the heap. But we might want to allocate memory of different sizes at different times, so it wouldn't make sense to key on the amount of available memory in a particular region of the free store.
I must assume then that there would be a different heap maintained for each size of memory block that can be allocated, and the key must have something to do with the attractiveness of the particular memory block in the heap (perhaps the lowest address, resulting, hopefully, in growing the free store space less often, leaving more space for the stack to grow, or perhaps keyed based on the fragmentation, to hopefully result in less fragmentation, and therefore more efficient use of the memory space, or perhaps based on page boundaries, keeping as much data in the same page as possible, etc).
So at this point, I have a few questions I've been unable to resolve completely:
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?
2. If so, would it be correct that there would be a heap per standard block size?
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?
Any insight would be awesome!
Thanks,
A.

jschell wrote:
I think you are not only mixing terms but domains.
For starters the OS allocs memory. Applications, regardless of language, request memory from the OS and use it in various ways.
There are many variations of the term "heap" like the following.
[http://en.wikipedia.org/wiki/Heap_(data_structure)]
[http://en.wikipedia.org/wiki/Dynamic_memory_allocation]
A java VM will request memory from the OS (from a 'heap') and use it in its application 'heap' (C/C++) and then create the Java 'heap'. There can be variations of that along the way that can and likely will include variations of how each heap is used, potentially code that creates its own heap, and potentially other allocators which use something which is not a heap.This last part, I find a bit confusing. By "use something which is not a heap", do you mean the heap data structure, or the dynamic memory pool meaning of heap? If the former, then you would be implying that it would be common for a heap data structure to be used to manage the heap dynamic memory pool. If the latter, what would this "something which is not a heap" be? The best definition of "heap" I've found simply states that it is a pool of memory that can be dynamically allocated. If there is some other way of allocating dynamic memory, then it would suggest that the previous definition of "heap" is incomplete.
>
So to terms.
1. Am I correct that the heap was so named because (perhaps at one point in time), a heap is/was commonly used to track the available memory in the free store?Which 'heap'? The VM one? It is probably named that because the implementors of the Sun VM were familar with how C++ and Smalltalk allocated memory.Okay, but that begs the question, was the heap in C++ and/or Smalltalk so named for the above queried reason?
>
2. If so, would it be correct that there would be a heap per standard block size?Not sure what you are referring to but probably a detail of the implementation. And since there are different levels the question doesn't mean much.
However OS allocations are always by block if that helps. After that it requires making the question much, much more specific.
3. Also, at what level of granularity would a heap typically be used (memory page, memory blocks, individual words (4-bytes))?Again not specific enough. A typical standard implementation of heap could not be at the word level. And it is unlikely, but not impossible, that variations would support word size allocations.
The VM heap might use word boundaries (but not size), where the application heap certainly does (word boundary.)My understanding of it is that the application would request blocks from the OS, and then something like malloc would manage the memory within the allocated blocks. malloc (or whatever equivalent Java uses) would have to keep track of the memory it has allocated somehow, and I would think it would have to do this at the word level, since it's most commonly going to allocate memory at the word level to be references to other objects, etc.
So I guess my question here would really be, if the dynamic memory heap is so named because there has been a memory management strategy that relied upon a heap data structure (which I've found no proof, but have found some suggestive literature), then would that probably have applied at the OS Page Fault level, tracking allocated blocks, or would that have applied at the malloc level, allocating individual words as necessary?
>
4. What would be the most likely property one would use as a key. That is, what makes the root item on the heap ideal?"Key" is not a term that will apply in this discussion.
You appear to be referring to strategies for effective allocation of memory such as allocations from different regions by size comparison.
It is possible that all levels might use such an allocator. General purpose applications do not sort allocations though (as per your one reference that mentions 'key'.) Sorry, I got the term "key" from an article I read regarding heaps, that indicates that a "key" is used to sort the elements, which I guess would be a more generalized way to make a heap than assuming a natural ordering on the elements in the heap. I'm not sure if the terminology is standard.
>
5. Would a industrial strength system like the jvm use a (perhaps modified or tuned) heap for this sort of task, or would this typically be too naive for an real world solution today?Again too indefinite. The Sun VM uses a rather complicated allocator, the model for which originated after years of proceeding research certainly in Smalltalk and in Lisp as well, both commercially and academically.
I am sure the default is rules driven either explicitly or implicitly as well. So it is self tuning.
There are command line options that allow you to change how it works as well.I guess perhaps I could attempt to clarify my initial question a bit.
There is a 1:1 correspondence between the runtime stack, and a stack data structure. That is, when you call a function, it pushes a stack frame onto the runtime stack. When you return from a function, it pops a stack frame from the runtime stack. This is almost certainly the reasons the runtime stack is named as it is.
The question is, is there or has there ever been a 1:1 correspondence between some aspect of the dynamic memory heap or how it is managed, and a heap data structure? If so, it would explain the name, but I'm a bit puzzled as to how a heap data structure would be of assistance in creating or managing the dynamic memory heap. If not, on the other hand, then does anybody know where the name "heap" came from, as it applies to the dynamic memory pool?
A.

About data structure

hi all,
here i do have another data structure related question where is concerning the JTree i have asked before this. how do i define/design the data structure that will suite my JTree application?
my JTree will take many information as the data that it has at most 4 level including the root. the data may pass from the server, and it may be not in order, how do i do that?
thanks a lot

hmm... i have modify a bit of the data structure class as describe below:
i have done all of the JTree part of my applet, except now only headache problem is that how do i gonna define my JTree data structure efficiently? i mean that there are many possible of data that will pass through the applet to create my JTree, there may be not in order though, so how can i define a suitable data structure to handle the data that coming in to the JTree?
what i have done so far is that i have created a class (consider the data object) to handle the data, whereby the server will pass the data according to the class structure, which then i get the data from there and create my JTree node. in the data object, for sure i put a parameter that will detect the level of the tree node, where i can successfully put it in the JTree, but is there any other better way?
thank you

Using a single data structure in a desktop application

Hello,
I am programming an application that needs to constantly access a data structure, for instance to add / edit / update / search data. Several graphical user interfaces need to modify this data structure. I was wondering of easy ways to use the data structure throught the whole application. One solution I found was to use the singleton pattern for my data structure, though lots of people have recommended me to avoid using that pattern. What are better ways of accessing that single data structure from all of those GUIs ?
Thank you,
Alfredo

Not that there is anything wrong with a Singleton pattern, but I don't see how it would help you in this case.
Just create the DataStructure and let every GUI that need to use it have a reference to it.

Data Structure Needed

*** PLEASE DO NOT REPLY TO THIS POSTING UNLESS
*** YOU KNOW EXACTLY WHAT I AM TALKING ABOUT
*** AND HAVE SOLUTION AT THE READY.
*** NO SWING TREE FYIs PLEASE...doesn't apply.
*** NO UI JAVASCRIPTS .. I HAVE THOSE.
I need a properly constructed multiway
(m-way, general, n-ary, etc.) data structure
implementation that uses non-ui
dependent/associated classes. This is know as the
first child/next sibling data structure used in
Filesystems (similiar to a BTree).
I am using many delimited strings, similiar to a
directory/file structure path but the string is a
software project hierarchy.
[a string is structured like this]
root|branch|...|branch|leaf
[Process]
1) the strings are fetched from DB by servlet.
2) servlet feeds strings into data structure
to eliminate duplicates and place in proper location.
3) servlet uses contents of data structure to
construct links that are coupled with the infamous
ui-tree script.
If you know your data structures and have an implementation
that won't take me 6 days to modify for it to work I would
appreciate your assistance. I am creating on my own as we
speak but one from a more experienced java programmer would
be better.
Thank You,
Kevin

Sounds like one hell of a frustrated programmer over there - all those capitals an'all..
If I understand you correctly, I don't think you'd take six days to implement this; just split your string by the separator;
String[] split(String path, char sep, char esc) {
String[] result = new String[0];
int o = 0;
int i; for (i=0; i<path.length(); ++i) {
    char c = path.charAt(i);
    if (c == esc) {
      ++i;
      continue;
    if (c == sep) {
      String substring = path.substring(o, i);
      String[] newresult = new String[result.length+1];
      System.arraycopy(result, 0, newresult, 0, result.length);
      newresult[result.length] = substring;
      result = newresult;
      o = i+1;
}Then have a java.util.Hashtable as root, with all names in it pointers to either more Hashtables (nodes), or Strings (leaves). If it really does not get anymore complex than that (data associated with leaves, for example), you don't really have to use anything more complex than 'instanceof' here.
Then start looping over all your String[] split paths, retrieve all nodes, if it's a String and you have a child for it, then convert it to a Hashtable, it it's a Hashtable trod along, if it isn't there create a String (unless you know you have an extra child, in which case you create a Hashtable).
When you're ready to retrieve, just enumerate your root Hashtable, casting to String all the keys, examining all the values; if they are Hashtable, then recurse. If they're Strings, do your Thing (TM).

What is the diff bet CCM catalog and MDM catalog?

Hi Friends
What is the diff bet CCM catalog and MDM catalog?
Thanks & Regards
Kanni

Hello,
CCM & SRM-MDM are SAP Catalog Content Management solutions.
In basic terms, MDM is latest solution & will be replacing CCM. All new features like service hierarchies are included in MDM 3.0.
CCM: upload, manage, and search in procurement catalogs.
http://help.sap.com/saphelp_ccm20/helpdata/en/index.htm
MDM: Search, compare, and procure products from suppliers.
It provides:
Catalog content management functions, such as the import of catalog structures or data, the transfer of catalog items to a procurement application, and search functions
Procurement catalogs
Supplier catalogs in a Web-based environment
The SRM-MDM Catalog is based on functions provided by SAP NetWeaver Master Data Management (SAP NetWeaver MDM) and bundles together in one specific application those SAP NetWeaver MDM functions required for catalog content management.
http://help.sap.com/saphelp_srm70/helpdata/en/45/ddd04f8c6e2e97e10000000a155369/frameset.htm
Hope this helps.
Thanks
Ashutosh

What data structure is better?

Similar Messages

Maybe you are looking for