Dynamic Data Structure

Hi all,
I have a UI which may change or i may add some specific properties to the UI.
I want to have a data structure class which would be created on the basis of the properites.
Suppose employee is a UI component,then again i have to have one more UI component called department.
The class which i am using for e.g. persistence should be generated differently.
I do see reflection as one of the solution for generating the class.
edit: to generate the fields or getter,setters to be precise, as i already have the class
But is reflection is the best way,.is there any better ways to do it?
Edited by: java_jamboree on May 28, 2008 10:30 PM

java.uitl.Map and its implementations.

Similar Messages

Create dynamic data type in structure

Hi Experts,
I am new to ABAP.
In my scenario data type is varying for the field. for that I need to create dynamic data type in structure, this structure I am using for internal table for OVS search input.
Please suggest the solution for this.
Advance thanks,
Regards,
BBC

Thanks for your quick reply,
I used your logic like this.
data:
ls_component type abap_componentdescr,
lt_component type abap_component_tab.
*... (1) define structure components :
clear ls_component.
ls_component-name = 'NVALUE'.
ls_component-type ?= cl_abap_typedescr=>describe_by_name( <fs_seg_v>-fieldname ).
insert ls_component into table lt_component.
*... (2) create structure
data lr_strucdescr type ref to cl_abap_structdescr.
data lr_data_struc type ref to data.
lr_strucdescr = cl_abap_structdescr=>create( lt_component ).
create data lr_data_struc type handle lr_strucdescr.
field-symbols <fs> TYPE any.
assign lr_data_struc->* to <fs>.
your logic is working fine.
here I am getting feild name (<fs_seg_v>-fieldname) from internal table.
But I need to assign same field name structure to query parameter.
FIELD-SYMBOLS: <ls_query_params> TYPE lty_stru_input.
Please can you suggest how I can refer the field name structure?
Regards,
BBC

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.

Dynamic subject based on data structure (JD Edwards)

In JD EDwards TR 8.98.3.0 it should be possible to create a dynamic email subject based on a data structure that is connected to a report definition. I have managed to create the data strucure with two elements (DOCO and DESC), this data structure is connected to a report definition in which I have stated that the subject must contain the first element (DOCO): Purchase order &1.
In the report definition I mapped the element DOCO from the data structure to the XML-element that contains the order number.
Unfortunately the e-mail does contain the statis text "purchase order" but it doesn't contain the order number (DOCO) from the XML-file.
Can anyone give me a hint for what I have done wrong?

In JD EDwards TR 8.98.3.0 it should be possible to create a dynamic email subject based on a data structure that is connected to a report definition. I have managed to create the data strucure with two elements (DOCO and DESC), this data structure is connected to a report definition in which I have stated that the subject must contain the first element (DOCO): Purchase order &1.
In the report definition I mapped the element DOCO from the data structure to the XML-element that contains the order number.
Unfortunately the e-mail does contain the statis text "purchase order" but it doesn't contain the order number (DOCO) from the XML-file.
Can anyone give me a hint for what I have done wrong?

Dynamic Data in Xcelsius Dashboard via ExcelXML Map?

Hello,
I am trying to create a dashboard with a grid with a variable number of rows and columns. The data is given to Xcelsius through an Excel XML map i.e. I have given an XML source to an Excel file and then have imported that excel file into Xcelsius.
I am able to see dynamic data changes within the pre-specified dimensions (i.e. from the first import). For example, if I have a 4X5 grid and change the text in the first row and first column, then Xcelsius will reflect this. However if I add an additional row with data in the xml file, I am not able to see this, even if I resize the the grid so that it has room at the bottom to be filled in.
Does anybody have any experience with this/can anyone point me to specific articles? I have followed the instructions given in the Tech Tips article, but this only applies to data within a specific structure, while I want to change the structure itself.
In short, is it possible to do dynamic structures in Xcelsius?
Thanks.
Regards,
Anjana Dasu

Hi,
Please go to Data>Connections>Excel XMl maps under usage tab please check if you have set the options "Refresh on load" or "refresh every".
If not, please select the refresh option and save the xlf file and then try to create a dashboard again.
Cheers,
Anshul

How to realign elements of an array? Working with old Dynamic Data consumers

Hello,
I've got some code which was written with DAQ assistants years ago. I'm trying to use tasks and arrays for my producer now for speed and efficiency, but I'm stumped on one thing.
The consumers were written to have the data in a certain order - there's even a VI in there that selects certain elements and sends them to specific outputs. I previously took care of this with a simple VI that split the dynamic data, wired them to different order terminals, and then set it back to dynamic; Screenshot attached.
Is there a structure like this for array where you can break out all the array elements, reorder them and insert constants, and then put them back into the array? What this ends up feeding is a subvi that's an array builder which converts the DD to array and then reroutes it. Seems almost like what I'm trying to do could be done there, but it's a bit confusing to me.
Thanks in advance.
Still confused after 8 years.
Attachments:
realign.jpg ‏166 KB

Hi Ralph@NES,
One thing I have done before for this is create a mapping array and a for loop to reorder the elements in your data array. Take a look at the example VI I've attached. If you know exactly where you want everything, you just need to go into the mapping array and set the index destination for the corresponding data. Hope this helps.
Paul C
Paul C
Applications Engineer
National Instruments
Attachments:
Reorder Array.vi ‏9 KB

Regarding creation of dynamic deep structure

Hi all,
I have to construct the dynamic deep structure.
for example,
With the help of information about address and t_table, i have to create the deep structure on runtime.
In one case i need to create the deep strcuture with address alone and in another case i need to create the deep structure with address and t_table.
DATA : begin of address ,
    address type string ,
    end of address.
data : begin of t_tab ,
name(10) type c,
age type i,
address like address,
end of t_tab,
t_table like Table of t_tab.
data: BEGIN OF wa_vig,
   details1 like address,
   details2 like t_table,
   END OF wa_vig.
data: BEGIN OF wa_vig,
   details1 like address,
   END OF wa_vig.
Please guide me, how should i acheive this with the help of dynamic declarion .
regards
Vignesh

Hi All,
I will be happy if i can acheive this using RTTS concept.
Regards
Vignesh

Dynamic File Structure - Urgent

Hi,
We have a requirement to use ODI to develop a POC that will do the following.
1. Create a Job to Load target from different file sources having different layouts or data structures.
2. The structure of the file needs to be fed to the job dynamically so the job can do a dynamic transformation and load to the target
3. An important requirement is to not change the job every time the input changes. The target will remain the same
The challenge is how to pass the schema of the file dynamically to the job.
This can be achieved in Datastage is our understanding but the POC is to showcase that Oracle Data Integrator also has this capability.
Any information docs or prior poc will be of great help
Appreciate your response!!!
-Basheer

I will leave the choice completely to Basir for going with implementation , but here i am sharing what i have thought about.
ODI Procedure -
Step 1 - To read the above File and creating the CTL file for SQLLDR
Technology- Jython
import re,os,string
# Reading the File
file_read=open('<%=odiRef.getOption("FILE_PATH")%>/Dynamic_struc.txt','r')
line=file_read.readline()
collect=[]
#Looping through each Line
while line:
    # Reading Delimiter
    if re.search("delim",line):
        delimiter= line[-5:-2]
    # reading Columns
    if ((string.find(line,';')> 0) & (string.find(line,')')> 0)):
        value=line[0:string.find(line,';')]
        collect.append(string.strip(value))
    line=file_read.readline()
column=','.join(map(string.strip,collect))
output= ' The delimiter of this file is '+delimiter +' The columns are '+column
file_read.close()
# Creating a CTL File for Loading into Temporary Table
file_write=open('<%=odiRef.getOption("FILE_PATH")%>/temp_file.ctl','w')
print >> file_write , 'OPTIONS (SKIP=1,ERRORS=0,DIRECT=FALSE ) LOAD DATA '
print >> file_write , 'INFILE "<%=odiRef.getOption("FILE_PATH")%>/temp_file.txt" '
print >> file_write , 'BADFILE "<%=odiRef.getOption("FILE_PATH")%>/temp_file.bad"'
print >> file_write , 'DISCARDFILE "<%=odiRef.getOption("FILE_PATH")%>/temp_file.dsc" '
print >> file_write , 'DISCARDMAX 1'
print >> file_write , 'INTO TABLE ODI_TEMP_10G."file_temp" '
print >> file_write , 'FIELDS TERMINATED BY '+delimiter
print >> file_write , 'TRAILING NULLCOLS'
print >> file_write ,'('+column+')'
file_write.close() ODI Option - FILE_PATH i.e path of the directory where the file Dynamic_struc.txt resides
Second Step in Procedure - Truncating Temporary Table Technology- Oracle and Schema - Respective schema where the Temporary table resides
TRUNCATE TABLE TEMPORARY TABLE Third Step in ODI Procedure - Calling SQLLDRCommand on Target - Technology- Sunopsis API
Command on Source- Technology Oracle and Schema - Respective schema where the Temporary table resides [ Reason so that i can fetch the userid and password for SQLLDR from ODI itself ]
OdiOSCommand "-OUT_FILE=<%=odiRef.getOption("FILE_PATH")%>/TEMP_FILE.out" "-ERR_FILE=<%=odiRef.getOption("FILE_PATH")%>/TEMP_FILE.err"
sqlldr "control='<%=odiRef.getOption("FILE_PATH")%>/TEMP_FILE.ctl'" "log='<%=odiRef.getOption("FILE_PATH")%>/TEMP_FILE.log'" userid=<%=odiRef.getInfo("SRC_USER_NAME")%>/<%=odiRef.getInfo("SRC_PASS")%>@<%=odiRef.getInfo("SRC_DSERV_NAME")%>
Sample Output Process.
Dynamic_struc.txt - The Metadata File
record
{final_delim=end, delim=';'}
AGE_MIN;VARCHAR2(10),
AGE_MAX;VARCHAR2(10),
AGE_RANGE;VARCHAR2(10),
)Source Data
AGE_MIN;AGE_MAX;AGE_RANGE
0;19;Less than 20 years
20;29;20-29 years
30;39;30-39 years
40;49;40-49 years
50;59;50-59 years
60;110;60 years or moreCTL File Generated
OPTIONS (SKIP=1,ERRORS=0,DIRECT=FALSE ) LOAD DATA
INFILE "C:/temp_file.txt"
BADFILE "C:/temp_file.bad"
DISCARDFILE "C:/temp_file.dsc"
DISCARDMAX 1
INTO TABLE ODI_TEMP_10G."file_temp"
FIELDS TERMINATED BY ';'
TRAILING NULLCOLS
(AGE_MIN,AGE_MAX,AGE_RANGE)I have tested the process by reducing columns too and random too and it seems to be working although not all condition :)
I have uploaded the procedure and here is the link where you can download.
http://cid-d7195c8badc40d0b.office.live.com/embedicon.aspx/odiexperts.com/TRT^_LOADING^_DYNAMIC^_DATA.xml
Please let me know if you need any help. You would need to tweak lots of things according to your environment .
Hope this helps

Open ended data structure for retrieving SQL data

I have a flex project that reads data from a database and
sends it to my flex app to display in a chart. I need to do this in
Actionscript since I have to dynamically create different charts
based on the database definitions. Up til now, I have inserted the
data for each series into a separate
ArrayList(java)/ArrayCollection(flex) in this way:
BindingUtils.bindProperty(lineSeries, "dataProvider", series,
"pointList");
lineSeries.xField="point1";
lineSeries.yField="point2";
The series variable is a custom Actionscript/Java object
which contains an ArrayCollection called pointList. And the array
is made up of custom DataObjects with two fields, point1 &
point2.
But in the new paradigm, I'd basically like to create a big
array of arrays similar to a database table and then just point the
xField to one column, and the yField to another column. Anyway, it
seems like the problem is that my point1 and point2 in the current
implementation are variable names, but with this new dynamic
structure, I won't be able to create variables on the fly. So how
do I let flex know to look at column 3, for example for the yField?
The attached code is from the Flex documentation and is an example
of what I'd like to emulate (except I need to do it in
actionscript). I'd like to be able to select "month" or "amount",
etc. But coming from the Java side, there is no way for me to name
the array contained in each column.

I guess I wasn't clear enough. I am actually serializing a
java object and mapping it to an actionscript object via blazeDS. I
know about how the objects translate, for example for
ArrayCollections in flex, I use ArrayLists in java. The problem is
that I'm not sure how to get the associative aspects of the arrays
in flex into my java data structures in a way that will translate
to the way flex can define arrays, such as Month:"January".
It seems that in flex, you can create an Array and assign it
an element like {month:"January", amount:"450"} and it will create
an Object with variables for month and amount. But I don't know how
to do this on the fly in Java (or in Actionscript for that matter)
when I have no way of knowing beforehand how many variables my
object will need. Each series will need an x and y, though usually
the x will be dates which are the same for each series. So if I had
10 series sharing an axis, I'd need 11 variables in my object-
date, series1, series 2...series 10.

Dynamic data declaration refering to local data defined in another program

Here is the situation:
The standard program SAPICP__ , SAPICF__ and several other of same series have a form routine REPOSITORY_DEVCLASS_ADD. this subroutine in all SAPI* programs has parameter REPOSITORY of type REPOSITORY (declared as internal table with header lines) and type REPOSITORY is declared with different component in each program.
Now the problem is that i need to call subroutine REPOSITORY_DEVCLASS_ADD dynamically from my program and so i want to dynamically declare the table REPOSITORY in my program to pass to this subroutine and as program is not yet loaded into memory i have no way to achieve this.
Can some one help in achieve this?
Edited by: Gaurav B. on Jan 30, 2012 4:02 PM

Hello Fred,
That's a big task, even if it looks "easy". My first idea is, your request can not be covered by dynamic programming. a) every node has a different structure (I guess), b) the code itself has to be adjusted to the nodes in use as well. I.e. when a dynamic data declaration would be possible, the coding has to adhere the used number of nodes.
My recommendation:
- declare as many standard tables (nodes) as possible
- the code for each node has to be implemented
- define the number of used nodes by a parameter or an interface
Have success,
Heinz

How to bind dynamic data to JNet

Develop tools: NWDS 7.1
Server: Windows2000
Does anyone have experiences with using JNET within Webdynpro Project ?
In our case, we use JNet to generate a hierachical network diagram in the Webdypro's GUI. The data source is from the tables in a DB. However, till now, we only know how to let JNet generate the network diagram from a static XML file.
Since the data in the DB changes all the time, how to let the network diagram reflect the newest data status automatically? That is, how to bind JNet to a dynamic data source then?

Hi,
Network UI element is related with Jnet. What you need to start up working with this is you need to create a context structure mentioned below.
Node:Source
Element--- xml -> this should be of type binary.
Place the following code in the init.
ISimpleTypeModifiable mod = wdContext.nodeSource().getNodeInfo().getAttribute("xml").getModifiableSimpleType();
IWDModifiableBinaryType bin = (IWDModifiableBinaryType)mod;
bin.setMimeType(new WDWebResourceType("xml", "application/octet-stream", false));
ISourceElement element =wdContext.nodeSource().createSourceElement();
wdContext.nodeSource().addElement(element);
try
fileName = WDURLGenerator.getResourcePath(wdComponentAPI.getDeployableObjectPart(), "jnettest.xml");
element.setXml(readFile(fileName));
catch (WDAliasResolvingException e)
You have to place the Jnet test.xml under the mimes folder of your application.
Place the network element in the view and in the data source specify the context attribute source.xml
if your xml file complies with the jnet schema your application will render it.
Pl go through this
Using the "Network" UI Element
Regards
Ayyapparaj

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.

Build field catalog for dynamic data objects

Hi
Could you please tell me how to build a field catalog (ooops alv) for an internal table which is a dynamic data object.
TYPES: BEGIN OF t_addsubty,
         subty TYPE subty,
         pernr TYPE persno,
         END OF t_addsubty.
TYPES: ty_addsubty type t_addsubty occurs 1.
i have data object using these
        CREATE DATA dref3 TYPE (g_type1).
        ASSIGN dref3->* TO <fs_dp>.
where g_type1 refers a data type which i defined in the program. g_type1 = ty_addsubty.
now <fs_dp> refers to an internal table.
now i want to build a field catalog for this internal table.
In my program <fs_dp> structure is not always the same. i.e now it is ty_addsubty but for some other conditions the structure is different.
please help me out.
regards
badri

Here some piece of code, which shows how it works:
<SNIP>
type-pools:
     abap.
DATA:
lr_tabledescr          TYPE REF TO cl_abap_tabledescr,
lr_structdescr     TYPE REF TO cl_abap_structdescr.
field-symbols:
<lw_component>     type abap_compdescr_tab.
TYPES:
     BEGIN OF t_addsubty,
          subty TYPE subty,
          pernr TYPE persno,
     END OF t_addsubty.
TYPES:
     ty_addsubty type t_addsubty occurs 1.
CREATE DATA dref3 TYPE (g_type1).
ASSIGN dref3->* TO <fs_dp>.
lr_tabledescr ?= cl_abap_tabledescr=>describe_by_data( <fs_dp> ).
assert condition lr_tabledescr is bound.
lr_structdescr ?= lr_tabledescr->get_table_line_type( ).
loop at lr_structdescr->components assigning <lw_component>.
*     do whatever you want with the information about
*     the components of the structure
endloop.
</SNIP>
Do not forget to reward points...

Connect 1 D array of cluster of 2 elements with dynamic data

Hello
The type of source is 1D array of cluster of 2 elements and the type of sink is dyanamic data. Can any one guide me how to connect these 2 elements together. Any response would be highly appreciated.
Thanks

First, this question would more appropriately be posted to the LabVIEW Board. It is not a signal conditioning issue.
The dynamic data type (DDT), sometimes referred to as the "evil dynamic data type," completely obscures the internal data structure. The only way someone could help is if you tell us what the source is expecting the internal data structure to be. The only objects which want DDT inputs are Express VIs, which are also good at obscuring thier contents. Implementing the sampe funcitonality with standard VIs might be a better approach.
You also have not completely specified the source. What are the data types of the cluster elements?
Lynn

Data structure - tokenization

Hi,
I want to do the tokenization of several documents, saving the tokens (as strings) into a data structure. Obviously, I don't know the number of the tokens (it depends of the lenght of the documents). What is the data structure that you advice me?
Thanx
MP

it seems you want the kinda of data structure that grows dynamically..however other factors can play a role too
- want fast iteration --> use ArrayList
- want synchronization --> use Vector
- no duplicates --> use HashSet
- want order --> use TreeSet
- etc..many other i can't remember now..
so it's really ur choice
hope this helps

Dynamic Data Structure

Similar Messages

Maybe you are looking for