CLEARDATA for brothers and sisters of a Member

Hi all.

There is a need to write a clear script, not the parent but using a child member existing and delete the data of that Member, including his brothers and sisters.

Is there an Essbase feature where you can choose 2 children and he will remove Child1 and Child3?

Parent

Child1

Child2

Child3

I think that you are looking for the function, @ISIBLINGS (membername). This allows you to select a member and his brothers and sisters (@SIBLINGS will return only the brothers and sisters).

You could do something like the following:

Fix (@ISIBLINGS (Member1));

clearblock all;

ENDFIX;

Or you can use cleardata if you do not want to clear all the blocks.

Tags: Business Intelligence

Similar Questions

Can I start a family plan of music with my brothers and sisters and have everyone pays for purchases separately?

I want to buy a family music iTunes subscription share with my brothers and sisters. I was wondering if we could so and yet they each be responsible for their own purchases. I want to share a music subscription, but I don't want to pay for their app, music purchases purchases or any apple purchases also. Is this possible or am I dreaming?

Hi TMill41,

Welcome to the communities of Apple Support! If it is possible for individual members of a group sharing of the family to pay for their purchases via gift cards or credits, all costs beyond that will be automatically charged to the organiser credit card by design, as shown in this article:

Make purchases

After you set up your family, anytime a family member throws a new purchase, that it will be charged directly to your account, unless the family member has gift or store credit. First of all, their store credit will be used to pay the invoice total or partial. The rest will be billed to the card of the family of the Organizer. The family Organizer, the revenue generated by the transaction will be sent to you. Learn more about how are charged purchases made on iTunes Store.

Purchases and payments - Apple Support families

Concerning

Is a part of the tree of his own brothers and sisters?

I have a routine that takes an item in the tree selected by a user and loop through all brothers and sisters of the element:
```
itemRelated = TRUE;treeItemToTest = 0;

while ((itemRelated) && (treeItemToTest < totalTreeItems) &&     (treeItemToTest >= 0))
{
    /* Check if file is related to the selected file */
    AreTreeItemsRelated(panelHandle, treeHandle,
        treeItemToTest, VAL_SIBLING, selectedTreeIndex,
        &itemRelated);

    if (itemRelated)
    {
        /* process the item */
        /* ... */

        ++treeItemToTest;
    }
}
```
Somewhere between the current version and CVI 2012, our program has stopped working properly. I traced the problem to the call of AreTreeItemsRelated in this routine. In the latest version of LabWindows, this call returns FALSE if treeItemToTest and selectedTreeIndex are from the same point. This is apparently a change in behavior of CVI, 2012, but it is not documented in the help of the function. This change was deliberate?

Yes. You are right. You have run into a scenario that can be very difficult to work around. We try very hard to never break compatibility with older versions of the execution, but sometimes it's inevitable, as in cases like this where a bug is fixed in a new version. Problems occur when there are existing programs which are assuming the existence of this bug and would actually break if it were not for the bug.

The best way to avoid this situation is to use a specific flavour to the version of the runtime of the CVI. It has its drawbacks, of course (for example not automatically benefit from bug fixes in the run-time), but he could sure complicated deployment.

Of course, who isn't really help you now, since your 'program #1' is already deployed using shared execution. Having said that, the best you can do is to replace it, what you can do without uninstalling all of its dependencies, by following these steps.

Luis

How to install brothers and sisters from the master cod

Hello

I am facing a problem,

At first I added the .cod as a resource file in my application, then I read that .cod in byte []. When I try to creteNewModule using CodeModuleManager it gives me the value NULL because of too large this .cod file size (I also tried with the example helloworld cod file and it works correctly).
Now, I used the brothers and sisters of .cod files and try to save, so it works correctly and it gives me my application on the emulator, but while I'm trying to run my application it gives me error - Module 'myApp' has verification errors. Error at startup 'myApp': Module "myApp" contains errors of verification for the emulator of 4.5.

Any help is appreciated.

Thank you
Kone

You're looking at the same problem as this user:

http://supportforums.BlackBerry.com/T5/Java-development/cod-file-is-not-getting-installed-properly-p...

Calc script to copy the data members to his brothers and sisters

Hi experts,
I'm not planning Application, where the form I am Inputing "rates" on each month. Once again the rates that I enter must be copied to its years.
Outline looks like:
Account: Fx_rate
Scenario: current
Version: work
currency: Local
year: FY 13
Time: Jan: Dec
Company_code
+ E1000
E1001
E1002
E.....
E....
E1000_rate
+ E2000
E2001
E2002
E2000_Rate
Here in the form of data to go rates on E1000_rate-> Jan-Dec
E2000_rate-> Jan-Dec
That should be copied in its years. As I said above, we have hundreds sibiling of fo for each rate.
Could you please help me by writing the scenario of calc:
Thank you
Alex

Hello

In addition to Celvin post on the use of @SIBLINGS. When I had similar requirements, I realized the underside. Looks like a lot of code, but works well.

/ * First clearly rates against the entities before re them, filling with @REMOVE, remove the features of entry rate because you do not want to delete the. You will need to create a UDA called RATE_INPUT and assign it to all entities of entry rate * /.

DIFFICULTY (current, work, Local FY13, @RELATIVE (YearTotal, 0), @REMOVE (@RELATIVE (Company_code, 0), @UDA (Company_code, "RATE_INPUT")))

'Fx_rate' = #missing;

ENDFIX

/ * Second aggregate up to level 1 entity values FX_Rate account, so that each parent rates holds the NOTE rate: the rate will have + for the aggregation.

DIFFICULTY ("FX_Rate", current, work, Local, FY13, @RELATIVE(YearTotal,0))

@RELATIVE (Company_code,-1);

ENDFIX

/ * Difficulty third on Lev 0 company code and make the exchange of currency equal to their parents for the currency exchange value (which you gathered earlier) * /.

DIFFICULTY (current, working, Local, FY13, @RELATIVE(YearTotal,0), @RELATIVE(Company_code,0))

'FX_rate' = @PARENTVAL (Company_code, "FX_Rate");

ENDFIX

Try this

Thank you

Anthony

NewElementInHierarchy() - adding new items, gradually takes more time when adding several brothers and sisters

With my script ESTK, users select the model numbers in the list and then the script inserts an element with a model number is entered in an attribute, an element for each selected model.
When you add a large number of elements, each element of extra brother takes a little more then the previous item adds. Adding 250 items may take longer than 3-1/2 minutes or more. During the addition of 20, 50 or 75 items happens quickly, without any noticeable length. It is somewhere in the top 110, this is where that starts to get noticed.
I even used $.hiresTimer and writes the value to the console for each time a model has been added. Because the timer is reset to zero (0) whenever it is called, it was easier to notice than the amount that it incremented from one element to the other got progressively bigger.
Any ideas as to why it takes so long or reflections on what I could do to speed it up?
The structure looks like this:
< PartModels >
Text < NoteText > < / NoteText >
< model ModelNumber = "ABC01" / >
< model ModelNumber = "ABC02" / >
< model ModelNumber = "DEF03" / >
< model ModelNumber = "DEF04" / >
…
…
< model ModelNumber = 'XYZ01-A' / >
< model ModelNumber = "XYZ * B" / >
< model ModelNumber = "XYZ500" / >
< / PartModels >
The script is quite simple: scroll a selected model numbers table, add a new item for each model number and value of the attribute, the value of the model number. It's the short version:
Function InsertModelElements (modelsToIns, insElemLoc, GVdoc) {}
var newEleId;
var newElemLoc = insElemLoc;
var elemDef is GVdoc.GetNamedElementDef ("Model");.
for (var i = 0; i < modelsToIns.length; i ++) { / / modelsToIns is the selected model range }
newEleId = elemDef.NewElementInHierarchy (newElemLoc); //ElementLoc based on NoteText first, last, or absent
SetAttribute (newEleId, "ModelNumber", null, modelsToIns [i]); //More feature robust to set the attribute
/ * Which also works for the layout attribute * /.
var vattributes = newEleId.GetAttributes ();
vattributes values [0] [0] = modelsToIns [i];
newEleId.Attributes = vattributes;

/ * At one point, I tried to use a new location of the item to the last inserted element, no change * /.
var newElemRange = setElementSelection (GV_doc, EleId); function that returns the range
newElemLoc = newNewElemRange.end;
}
}
Any help is appreciated.
Sincerely,
Trent

Thanks Russ,

I seriously considered trying to copy/paste and started to change the code to do it. But I could not let pass, the answer should be right there in front of me, it's all too long that I worked with this stuff, I am not able to see. Then it dawned on me what's happening.

In a previous test, I put a timer on each action that is closed. For example, I start with a container element that has 200 children of elements, each with a specific/unique model number attribute. All the 200 existing items are deleted and then replaced with 250 new items with a different value for the attribute of model number. The timer was placed after the Element.Delete () and ElementDef.NewElementInHierarchy () methods. What I've noticed with the timer, it's that each deleted item has been removed as fast as the previous item (so it took progressively less and less time to remove an item). And of course the opposite was noted for insert items, each inserted item has taken longer than the previous inserted item.

These elements can be inserted in two areas of the structure, one of the neighborhoods within format rules that affect the formatting and is actually a bit faster. This led me to the cause being ESD format rules. The area that takes more time has quite a few rules of extensible format that apply. Whenever an element is inserted or deleted, FrameMaker through these rules for formatting the content of elements. Given that the rules apply to the parent, first, last, next, previous, etc., FrameMaker must apply the rules of the format to all elements of the structure that the rules (which are extremely complex due to various elements, attribute values, and combinations that can be inserted).

Removal or thinning of the FormatRules in ESD, she becomes faster. But each of the FormatRules are needed. So using app. ApplyFormatRules = false; just before that the elements are deleted and inserted works very well. But the key is to implement ApplyFormatRules return to true before remove the last element should be removed and before inserting the last element to be inserted, so it allows to scroll all the rules of format of ESD for all elements in the hierarchy of these format rules apply to. ApplyFormatRules true and assign the ElementDef until the last item works also [EleId.ElementDef = GV_doc. GetNamedElementDef (insElemType);], but only before all the other functions are performed or different items are added.

doc. Reformat() will not reformat the content correctly after the fact, because the element has been created without the format rules, so it reformats all the contents of the elements without the format rules.

The FDK version which was created 10 years ago had the same problem of slow operation when a large number of items have been inserted, but was still an improvement over having manually insert each item, and then type the value of the attribute, if she had lived with.

He now works surprisingly fast. I hope that my explanation of what I think is happening, including the cause/solution, is understandable.

Sincerely,

Trent Schwartz

Hierarchical Oracle query help needed - path between the crux of two brothers and sisters
I want to find the path between two nodes of oracle hierarchical Table.

Consider the following case-
NodeId - ParentId
=============
1 > > > > > > 0
2 > > > > > > 1
3 > > > > > > 2
4 > > > > > > 3
5 > > > > > > 0
6 > > > > > > 5
Here I want to query the database table that if there is a path between nodes 3 and 5?
The previous query you provided work upwards to the root node.

Here is my expected result, 3-> 2-> 1-> 0-> 5

Yet once if I have a query in the table to get the path between 1 and 3, I want to get out of the way - next
1-> 2-> 3

Therefore, the query works in both cases. Where ADI root can act as an intermediate or no node.

Can you please guide me how I can get it?

Thank you.
Hello

user13276471 wrote:
I want to find the path between two nodes of oracle hierarchical Table.

Consider the following case-
NodeId - ParentId
=============
1 >>>>>> 0
2 >>>>>> 1
3 >>>>>> 2
4 >>>>>> 3
5 >>>>>> 0
6 >>>>>> 5
Here I want to query the database table that if there is a path between nodes 3 and 5?
The previous query

What application is this? If you're referering to another thread, then post a link, such as {message identifier: = 10769125}

you provided work upwards to the root node.

Here is my expected result, 3--> 2--> 1--> 0--> 5

Yet once if I have a query in the table to get the path between 1 and 3, I want to get out of the way - next
1--> 2--> 3

Therefore, the query works in both cases. Where ADI root can act as an intermediate or no node.

Can you please guide me how I can get it?

I think you want something like this:
```
WITH     bottom_up_from_src    AS
(
     SELECT     nodeid
     ,     parentid
     FROM     table_x
     START WITH     nodeid      = :src_nodeid
     CONNECT BY     nodeid   = PRIOR parentid
)
,     bottom_up_from_dst     AS
(
     SELECT     *
     FROM     bottom_up_from_src
    UNION ALL
     SELECT     parentid     AS nodeid
     ,     nodeid          AS parentid
     FROM     table_x
     WHERE     nodeid     NOT IN (
                                      SELECT  nodeid
                               FROM    bottom_up_from_src
                                  )
     START WITH     nodeid        = :dst_nodeid
     CONNECT BY     nodeid        = PRIOR parentid
)
SELECT      :src_nodeid || SYS_CONNECT_BY_PATH (parentid, '-->')     AS display_path
FROM       bottom_up_from_dst
WHERE       parentid     = :dst_nodeid
START WITH  nodeid     = :src_nodeid
CONNECT BY  nodeid     = PRIOR parentid
;
```
This will show how you can get it from: src_nodeid at dst_nodeid, moving to the top or to the bottom of a hierarchy at a time step. This will work regardless of the fact that
- : src_nodeid is the ancestor of the: dst_nodeid, or
- : src_nodeid is a descendant of: dst_nodeid, or
- both: src_nodeid and: dst_nodeid are the descendants of another node (e.g. 0).
I hope that answers your question.
If not, post a small example data (CREATE TABLE and only relevant columns, INSERT statements) and also publish outcomes from these data.
Explain, using specific examples, how you get these results from these data.
Always say what version of Oracle you are using (for example, 11.2.0.2.0). It is always important, but particularly so with CONNECT BY queries, because each version since Oracle 7 had significant improvements in this area.
See the FAQ forum {message identifier: = 9360002}

to find brothers and sisters to other tree trunk
Hello

I have a Table with objects [T (identification number, the field number)].
I have another table that links these objects in a structure tree [L (up_id number, down_id number)]. ~ (I need the child of beeing objects in more than one parent) ~.

Get the ID of a certain object (not the root, but it guaranteed not to have only one path to the root).

I have to find all the objects in the entire tree with the same value in the name attribute.

Usully I would go for connect prior down_id = up_id start with up_id is null but in my case there is no entry in L have up_id NULL. : () o

How can I select all nodes in a tree?
Is this possible with a single statement?

Good bye
DPT
Hello

T.PD wrote:
... I was wondering if the name that (...), select help here...

Subqueries certainly help. They do not have to be in a WITH clause. views online would work in this case.

I have to respect the tree structure, because the table contains several separate trees...

In a tree, each node has only one parent (if any). In my_tree_links, id = 26 has two parents (10 and 20), so this isn't a tree. You not helping yourself or someone else if you say it is.
```
INSERT INTO my_objects
SELECT LEVEL
, mod (LEVEL,7)
FROM DUAL
CONNECT BY LEVEL < 27;
/
```
When end you a statement with a semicolon followed immediately by a slash, then the statement is executed twice. I suppose that this isn't what you wanted. If my_objects.id is not unique, the solution below will have some minor changes.

To limit the results to the nodes that have an ancestor with the target node, you can do a Query of Yo-Yo , where you do a query of bottom-up first, to find all the ancestors without parents of the target node, then do a query from top to bottom, to find all their descendants, like this:
```
VARIABLE     target_id     NUMBER
EXEC  :target_id := 26;

WITH     got_roots     AS
(
     SELECT     id_up
     FROM     my_tree_links
     WHERE     CONNECT_BY_ISLEAF     = 1
     START WITH     id_down     = :target_id
     CONNECT BY     id_down     = PRIOR id_up
)
,     got_descendants     AS
(
     SELECT     id_down
     FROM     my_tree_links
     START WITH     id_up     IN (
                         SELECT     id_up
                         FROM     got_roots
                       )
     CONNECT BY     id_up     = PRIOR id_down
)
SELECT DISTINCT
     mo.*
FROM     my_objects     mo
JOIN     got_descendants     gd  ON     mo.id     = gd.id_down
WHERE     mo.value     = (
                    SELECT     value
                    FROM     my_objects
                    WHERE     id     = :target_id
                 )
AND     mo.id          != :target_id     -- If wanted
;
```
Output (where: target_id = 26):
```
`       ID      VALUE
---------- ----------
        12          5
        19          5
         5          5
```
Always tell what version of Oracle you are using. The query above works in Oracle 10 (and), but could be adapted to run on Oracle 9.

Whevever you need to do a CONNECT BY query as a join, it is faster if you can CONNECT BY first, in a separate subquery and join the results for the other tables. This is what the second auxiliary request, got_descendants, is for.

What results would you if: target_id = 8?
The query above, as written, would not include id = 1. If you want, you will need to somehow enter the root ID for example 1, which are never id_down, in the same column with all the id_downs. You can do it with a UNION in the query, but you can change permanently my_tree_links so that these roots have some parent (themselves or some dummy, like NULL).

hierarchical queries - error: ORA-30929: clause ORDERBY brothers and SŒURS unauthorized
Hello

I have a hierarchical query in which, I automatically generate unordered list. I needed to get the children in the same level, so I used the brothers and sisters of the order by clause, but the procedure did not compile and threw an error Ora-30929 - brothers and sisters Order By Clause not allowed here.

This is the query.

SELECT CASE WHEN LAG(LEVEL,1,0) (ORDER OF ROWNUM) > = LEVEL THEN "< li >".
(Level) lead CASE of OTHER COURSES (ORDER OF ROWNUM) WHEN LEVEL THEN
CASE WHEN ROWNUM = 1 THEN ' < ul id = "sidebarmenu1" 'ELSE' < ul' END | ' > < li > '
On the OTHER CASE WHEN ROWNUM = 1 THEN ' < ul id = "sidebarmenu1" 'ELSE' < ul ' END: ' > < li > ' END END |
"< span >' | daevmt.short_menu_item |' </span >' |
LEVEL of CASE - LEAD(LEVEL,1,1) (ROWNUM ORDINANCE) WHEN - 1 THEN NULL WHEN 0 THEN "< /li >".
ELSE REPLACE (LPAD ('* ', LEVEL-LEAD(LEVEL,1,1) (ORDER OF ROWNUM),'* '), ' * ',' < /li > < /ul > < /li > ')
END | CASE WHEN AHEAD (LEVEL, 1, 0) (ORDER OF ROWNUM) = 0 THEN '< /ul >"END of another null unordered_list, daevmt.menu_item, daevmt.link_url, daevmt.menu_id,.
daevmt.above_menu_id
OF dae_vs_my_tasks daevmt
START WITH daevmt.above_menu_id = "TOPMENU".
CONNECT BY PRIOR = daevmt.above_menu_id Daevmt.menu_id
Brothers and SŒURS of ORDER BY daevmt.display_order;

Can someone please help what is wrong in my query?

Thanks in advance,

Natarajan

Published by: Nikita on March 7, 2011 23:26

Published by: Nikita on March 7, 2011 23:28

Published by: Nikita on March 7, 2011 23:28
According to the Oracle documentation, this error is caused by 'ORDER brothers' and SŒURS clause of having in a query that is not a "CONNECT BY" clause that is clearly not the case here. I suspect it's because you use analytical functions 'LEAD' and 'LAG '. I took your statement, replaced the names of table and column with some in a table, I also has a structure of hierarchical and got the same error. After removing all the functions of 'LEAD' and 'LAG' it run OK.
I don't think that helps you all.
You may create another table with the contents of this table by adding 4 columns for rownum, level (level) lead and lag (level). Then use this table to generate your unsorted list html code.

What is the member limit for BSO and asked ASO to 11.1.2.2?
Hi gurus,

I need to know what is the maximum member limit requests for BSO and output 11.1.2.2 ASO (which means that the maximum number of members can we have in the outline for BSO/ASO). Also, I need to know what is the maximum limit membership to a Hyperion Planning application?

We are planning on creating a hyperion, planning an application that could be partitioned with ASO (target). Could you gurus please tell me is it possible? I know that oracle does not support and recommend this right now.

Thank you
Hello

Please see the documentation from the link below:

Topic:
Database of global storage limits
Block storage of database limits

http://docs.Oracle.com/CD/E17236_01/EPM.1112/esb_dbag.PDF

ASO: Please see: Page 1048.
For the BSO: Please see: Page 1050.

I hope this helps!

Kind regards
Priya

I want to make a Tassel factory but I think that my job is to be consulted and hacked by family member in the home

I want to make a Tassel factory but I think that my job is to be consulted and hacked by family member in the House, how can I do this without them interfering and changing my index files hkey ect.

How can I do this without them interfering and changing my index files hkey ect.

You can not. A factory restore, as the name suggests, will render you your machine for the condition, that it is in when it left the factory. It will be like new.

I pay £8,57 per month for Lightroom and Photoshop on my Mac desktop. Can I also download the software and use it on my laptop as well?

I pay £8,57 per month for Lightroom and Photoshop on my Mac desktop. Can I also download the software and use it on my laptop as well?

Hi Speedking2010,

Yes, you can download and install Applications on 2 computers that you are a member of creative cloud.

Kind regards

Tanuj

Best price for illustrator and indesign?

Hello
I am a member of a nonprofit organization called missing you. I was wondering if that counts as a business?
First, I need the programs to design a logo, maps and photos for projects for this organization.
I am also a student via tuttering House. It's an official teaching via cva (centrum voor contact). It's 18 months of training. Is this a valid education so I can download the program as a student?
I wonder what's the best price for illustrator and Indesign programs?
Sincerely, Sandra

Request student/teacher discount

http://www.Adobe.com/go/edu_verify_ecomm_us

For more information about the provisions of the student/teacher, you can refer to the following information page:

http://helpx.Adobe.com/x-productkb/policy-pricing/Education-FAQ.html#main_submit_poe

Another good resource for information is the student and teacher edition information forum:

http://forums.Adobe.com/community/download_install_setup/student_and_teacher_edition_infor mation_? view = discussions

Here are some links about the Adobe student discount:
http://www.Adobe.com/education/students.edu.html?showEduReq=Yes

http://www.Adobe.com/education/student-eligibility-Guide.edu.html

http://www.Adobe.com/education/students/how-to-buy-eligibility.edu.html

Info from Adobe for not-for-profit organizations - http://www.adobe.com/mena_en/education/nonprofit-eligibility-guide.html

Creative cloud plans

https://creative.Adobe.com/plans

I am a student and I register for students and teachers-cloud, but I am in charge $29 every month how can I change this

I am a student and I register for students and teachers-cloud, but I am in charge $29 every month how can I change this

Hello

We see that you have your subscription creative cloud under the same Email that you use with the forums. $19.99 / month is valid for the first year after purchase, then it changes to $29.99.

We see that you have been a member since 2013, that is why we charge you $29.99.

Please refer to conditions:-Creative Cloud price and membership plans | Adobe Creative Cloud

Students & teachers > Complete-special offer > see terms.

Digital Edition for iPhone and Android tablets

I am an Adobe CC member and could successfully publish an Apple iPad App on the App Store. Now, I would like to publish for iPhone and Android tablets. I think that's not possible alone with the CC from Adobe. Need me for the professional edition?
Ueli Mattenberger, VMA Media AG (Switzerland)

Yes. To do this, you need pro or Premium.

CLEARDATA for brothers and sisters of a Member

Similar Questions

Make purchases

Maybe you are looking for