Triple state checkbox

Hi,
I have scoured this forum but I can't seem to find out how to make a triple state check box bound to a database column.
The checkbox should return the following values, and also pick up whatever is in the database table when the record is loaded onto the form:
Ticked = -1
Unticked = 0
Unticked and grayed out = null
It also needs to be a single checkbox. I tried using the STATIC:Yes;-1,No;0 type syntax but two checkboxes are created on the form.
Cheers,
Rich.

You can set something similar using the boolean's color properties node. It still only returns a T/F value for the control's VALUE, but you can read the color property to gain a third state.
2006 Ultimate LabVIEW G-eek.
Attachments:
BooColor.vi ‏39 KB

Similar Messages

Tri - State Checkbox in pdf form

Hi all,
I'm using Adobe Acrobat 9 Standard to create forms. I want to include a tri state checkbox (Checked / Un-Unchecked / Crossed) in my form. There is an option to add checkboxes but they are only bi state ( Checked & Un Checked). Do you have any idea how to solve this?
Best Regards,
Sameer

I don't think it can be done, but why not ask in the Acrobat forum. This is the Reader forum. Acrobat users are more likely to come up with a method that might work than Reader users that do not use Acrobat.

Tri - State Checkbox in a pdf form

Hi all,
I'm using Adobe Acrobat 9 Standard to create forms. I want to include a tri state checkbox (Checked / Un-Unchecked / Crossed) in my form. There is an option to add checkboxes but they are only bi state ( Checked & Un Checked). Do you have any idea how to solve this?
Best Regards,
Sameer

It doesn't meet your 'design spec' Sameer, but I think many of us would just include two (Y,N) or three (Y,N,N/a) checkboxes against each question and assign them all the same name (eg 'Q1'), but ticks to the Y and N/a, and a cross to the 'N', and different export values so that only one of them can be checked.
I usually include the boxes in the original file and add a slightly bigger 'no border' checkbox in Acrobat, as I think they look better if the 'tick' is bigger than the box rather than just filling it (much like it would if done in pen and ink), but that's just a personal preference.

Tri-State checkbox in ADF

Something similar to this
http://shamsmi.blogspot.com/2008/12/tri-state-checkbox-using-javascript.html
values: true, false, null
Jdev 11.1.2.3
Thanks

Any plans?
It is part of javafx, available on OpenFaces http://openfaces.org/demo/selectbooleancheckbox/SelectBooleanCheckbox_general.jsf
and primafaces http://code.google.com/p/primefaces-extensions/source/browse/primefaces-extensions/trunk/src/main/java/org/primefaces/extensions/component/tristatemanycheckbox/TriStateManyCheckboxRenderer.java?r=1355

3 State CheckBox Tree

I just downloaded the 3 State CheckBox Tree custom control
from the Flex dev exchange a few moments ago. I put the code into a
Flex prject, compiled it and ran it pretty much unchanged. When I
click on any of the tree controls I get the error message:
ArgumentError: Error #2025: The supplied DisplayObject must
be a child of the caller.
at flash.display::DisplayObjectContainer/getChildIndex()
at mx.managers::SystemManager/getChildIndex()
at mx.managers::SystemManager/::mouseDownHandler()
Anybody else download this tag and have a problem like
this???
Have an Ordinary Day...
KomputerMan ~|:-)

O.K. I pulled the downloaded component inside an existing
application and ran it from there. The problem was that the
downloaded component had a <mx:Application...> tag in it
which gave me two templates with the <mx:Application ...>
tag. Flex didn't like this too much. After I renamed the
<mx:Application...> tag in the downloaded component to
<mx:Canvas...> life was good. One of those duh moments...
DUH!!! :)
Have an Ordinary Day...
KomputerMan ~|:-)

TRI/ 3-State Checkbox

hi all,
is there any attribute IN <af:Select BooleanCheckbox> for setting tri state to a checkbox based on input supplied to it..

john,
forum is for jdev and adf.
so I straightly hits the answer "no"
here i cant speak in general, ;) so i wrote like this previous post,
AFAIK, my answer is no for 3rd state.
john wrotes : Some ui frameworks support 3 states for a checkbox (usually it's for native, not web apps) but adf has only 2yes i agree with this statement. as earlier i learnt about that.
after read this post i will rewritten as post as
AFAIK in adf, my answer is no for 3rd state.

3 state checkbox: check OR cross OR off

Is it possible to add a script to the click event to set the check style? I would like an On value (1) to show a check, an Off value (0) to show a cross and a Neutral value (2) to set the checkbox to blank. When I'm in the code window (language set to formcalc) and I type the field name and hit the . key I don't see anything that looks like it would be the check style to set. In another post I found the following:
style.ch    checkmark
style.cr    cross
style.di    diamond
style.ci    circle
style.st    star
style.sq    square
but I don't see how I'm supposed to set the value

Hi,
It is possible, but involves a bit of script. Here is an example: https://acrobat.com/#d=4gSLmyfhH6ejuEXweY9bKA
I don't think you will be able to achieve all that you want, as the default behaviour is that if the checkbox is off there is no mark in the box. I don't think you can influence/change that behaviour.
You could change the specified values to mimic off/neutral.
Hope that helps,
Niall
Assure Dynamics

Checkboxes with Intermediate Values ("Three State")

Is it possible to create a checkbox in APEX, that has three values? Normally, a checkbox is either checked or unchecked, but you sometimes see them with an intermediate value (sort of looks grayed out), which indicates that the user hasn't chosen a value yet. MSDN refers to this as a three state checkbox...
Thanks.
Edited by: Chris10263447 on May 19, 2009 5:20 PM

Hi Chris,
You can definitely disable your checkboxes in Apex, using the attributes parameter of APEX_ITEM.CHECKBOX, e.g.
APEX_ITEM.CHECKBOX( 50, id, 'disabled="true"' )or
APEX_ITEM.CHECKBOX( 50, id, 'disabled="true" checked="true"' )or just
APEX_ITEM.CHECKBOX( 50, id, 'disabled checked' )I don't believe you can have some "third value" on the checkbox, though. It's either checked or it isn't, regardless of whether it's disabled.
--Jennifer

ADG Tree - Linked Checkbox Item Renderers

Hi Everyone,
I've put together an AdvancedDataGrid that displays nodes from an XML (generated from a MySQL DB) in a tree format with two columns.
The first column is the actual tree and the second column utilizes a checkbox item renderer.
What I need to do, however, is to have it so that when a user clicks on the checkbox of a parent node, it selects all child nodes as well. If the parent node is deselected, all child nodes should also be deselected. Furthermore, if a child node is checked off, the parent node should also be checked automatically.
I did find a sample that utilizes a 3-state checkbox for ADG's, but my issues is that the checkbox's are in a different column and not beside the tree nodes.
Any assistance in this would be really appreciated.
Thanks!
Dan

I think you could simulate column-like display using itemRenderers in Tree component.
I wanted to use ADG so much and was happy to finally work it out in my app, I thought.
Then I noticed the issue with responsiveness and what a struggle it was to get the items to always render, that's a whole other topic.
But I found the Runtime Error that basically crashed my app when my client data required the use of scrollbars to view
the end of the list. Basically it has trouble with the itemRenderer getMeasurement () method I believe.
I don't remember the exact error message - once I found out it was RTE I abandoned it completely
in favor of Tree - nice and stable and does the job for me....
There is a bug report in bugs.adobe.com/jira about this, others have reported it too.

FileSystemTree and TreeItemRenderer random selected Checkboxes

When implementing
Three
State Checkbox Tree solution on a FileSystemTree, the
checkboxes will randomly change states while scrolling. This
happens when the checkbox leaves the viewable area.
The state of the check box is being held within a
ModelLocator from the Cairngorm project (obviously using the
framework). Is there any work around for this? I have changed very
little of the code given in the cookbook example. Of course I am
passing in the FileSystem.File object and checking the nativePath
against the data inside the ModelLocator. There is a hash map
implementation storing the state.
Any help would be most welcome. I think I am far more bald
now then when I started coding this.
- Blake

Hi Blake,
I have been looking at it for the past couple of days.
Couldn't figure it out yet.. With the FileSystemTree the File
object is being passed in. How do you store state in it? Tried
hacking by storing it in File properties like url but doesn't work.
You mention about a "hash map implementation storing the state".
Any info about it would be great.
Thanks.

How to check whether a checkbox is checked

This code:
if (checkBoxCSharpShown.IsChecked)
checkBoxCSharpShown.IsChecked = false;
elicits:
"Cannot implicitly convert type 'bool?' to 'bool'. An explicit conversion exists (are you missing a cast?)"
How can I check whether the checkBox is checked?
Delphi ancient/C# newbie

So why is this so complicated? Why doesn't a check box have a true/false value? The answer is that a checkbox can (optionally and not by default) be a three-state control.
When ThreeState is true, the checkbox has three states:
Checked
Not Checked
Indeterminate
They correspond to these tests:
bool checked = IsChecked.HasValue && IsChecked.Value == true
bool unchecked = IsChecked.HasValue && IsChecked.Value == false
bool indeterminate = IsChecked.HasValue == false
One of the ways a three-state checkbox is used is in a property dialog. If the user selects multiple items (all having some boolean property called 'Active'--for instance), what should the proprety dialog show for that selection if the value of Active is different among the selected items? Should it show True? That wouldn't work, they are not all True, same for False. So instead the property dialog would show Indeterminate, indicating that the collection of Active values is neither True, nor False.
Now having said all of that I'll refer you to:
CheckBox.Checked
This is true or false. If the ThreeState property is True, Checked returns True for True or Indeterminate.

Challenge... Deselect a "CheckAll" checkbox without impacting a previous javascript....

Hello:
I am a Newbie at JavaScript. I am currently creating a form using Adobe LiveCycle Designer 8.1.12
On my form I have a table of 50 states each having its own checkbox assigned to it. Then I placed on the table a checkbox which I called "CheckAllStates". With the help of friends on this forum, I placed the following code to my "CheckAllStates" element so that if it was checked, all the state checkboxes would be checked and if it was unchecked then all the state checkboxes would uncheck. Below is the code that does that with a sample of the Array:
//First create an array for the State check box names
var stateArray = new Array("AL", "AK", "TN", "TX", "UT", "VA", "VT", "WA", "WI", "WV", "WY");
//Then apply the code to check or uncheck the state checkboxes depending on the status
//of the checkall checkbox
for ( var state in stateArray )
if (this.rawValue==1)
var oField = xfa.resolveNode("xfa.form.PROPAC_APP.PROPAC_Page2.Subform2.tblStatesUSA.Row[*].CSKK_" + stateArray[state]);
oField.rawValue = 1;
} else {
var oField = xfa.resolveNode("xfa.form.PROPAC_APP.PROPAC_Page2.Subform2.tblStatesUSA.Row[*].CSKK_" + stateArray[state]);
oField.rawValue = 0;
It works great and I thought my problem was resolved. Then I noticed that, if all states were checked, and I uncheck any of the state checkboxes individually, my "checkallstates" remains with a check. This does make sense to me, so I thought that I would simply apply the following code to each state checkboxs onclick event to uncheck my "checkallstates"
xfa.form.PROPAC_Page2.Subform2.tblStatesUSA.Row[4].CheckALLStates.rawValue = 0;
Unfortunately nothing happens. To test my new script, I created a new form and applied three checkboxes and applied the same concept to my checkbox called CK1:
CK2.rawValue = "0";
This does work, so my question is what am I doing wrong? I am thinking that my "If" and "Else" statement in my "checkallstates" onclick event is involved with this not working.
Any ideas??
Thanks,
Keith.

I think Rocky meant the LiveCycle Designer forums. Your form is an XFA form, created in LiveCycle Designer. It uses a different set of JS APIs that Acrobat JavaScript in some cases, which it why it has its own forum.

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Sub query with order by

Hi ,
I have created a sub query with order by on a column.( i have cutomized the IKM control append to put order by).I can see the order by condition.If i use this subquery(yellow interface) in main query(is also yellow interface) i can't see the order by condition
Subquery(Q-yellow interface):
select
PID,
     START_TIME,
     ACTION_TYPE_CODE
FROM
select      DISTINCT
     SERVICE_TRACKING_S.PID PID,
     TO_TIMESTAMP(TO_CHAR(SERVICE_TRACKING_S.ACTION_TIME,'DD-MON-YY HH24:MI:SS'),'DD-MON-YY HH24:MI:SS') START_TIME,
     SERVICE_TRACKING_S.ACTION_TYPE_CODE ACTION_TYPE_CODE
from     KSTGDB.SERVICE_TRACKING_S SERVICE_TRACKING_S
where          (1=1)
ORDER BY-----------------------------------------------
PID
,START_TIME ASC
ODI_GET_FROM
Main query(Q1--yellow interface):
select
PID,
     START_TIME,
     ACTION_TYPE_CODE,
     RN,
     RN_MAX
FROM (
select
     Q.PID PID,
     Q.START_TIME START_TIME,
     CASE WHEN Q.START_TIME-LAG(Q.START_TIME,1,Q.START_TIME) OVER (PARTITION BY Q. PID ORDER BY Q.START_TIME)> numtodsinterval(75,'minute')
or Q.PID!=LAG(Q.PID,1,0) OVER (PARTITION BY Q.PID ORDER BY Q.START_TIME) THEN 1 ELSE Q.ACTION_TYPE_CODE END ACTION_TYPE_CODE,
     ROW_NUMBER() OVER(PARTITION BY Q.PID ORDER BY Q.START_TIME) RN,
     count(*) over (PARTITION BY Q.PID ORDER BY Q.START_TIME ROWS BETWEEN UNBOUNDED PRECEDING AND UNBOUNDED FOLLOWING )
RN_MAX
from     (
select      DISTINCT
     SERVICE_TRACKING_S.PID PID,     TO_TIMESTAMP(TO_CHAR(SERVICE_TRACKING_S.ACTION_TIME,'DD-MON-YY HH24:MI:SS'),'DD-MON-YY HH24:MI:SS') START_TIME,     SERVICE_TRACKING_S.ACTION_TYPE_CODE ACTION_TYPE_CODE
from     KSTGDB.SERVICE_TRACKING_S SERVICE_TRACKING_S
where     (1=1)
----------------- i don't see order by here--------------------------------
) Q
where          (1=1)
) ODI_GET_FROM
thanks in advance
K

Hi,
Add a new KM step with the SQL you want to use for the sub query and select the +"Use Current Command for Derived-Table sub-select statement"+ checkbox. This new step can be the last one of your IKM.
Basically, you can copy the select statement of the "Insert new rows" step.
Regards,
JeromeFr

To subtract it out automatically - Pricing

Hello all,
I have a question with regards to MM pricing.
Question 1 - What is the "Stat" checkbox in the calculation schema means? It is a condition issue for statistic and what does it means?
Question 2 -currently one of my schema setup looks like the second table below, and I would like to keep the condition types ZIPR and ZB15 to remain as it is, however, in the meantime, I also want to make these two values to automatically subtracted out with similar value (see following AAAA and BBBB value correspond to ZIPR and ZB15 respectively because of costing purpose. Thus, I plan to create two condition types correspond to these two conditions. I am wondering is this the right way? and if so, during config of condition type , what should i do, and insert of these two new configuration, what should I watch out and perform to accomplish this objective
For example:
P101---Val.Price Supply.Pln----300
ZB24---Freight - mat cost--
10
FRB1---Freight (Value)--
25
ZB29----Freight/Quantity ---(25)
Delivery Costs----
310
GRWR--Statistical Value--
300
ZIPR-----HSIL MRP Price--
10
AAAA----HSIL MRP Price ---(10)
ZICP-----HSIL Cost Price--
6
Total----
16
ZB15-----MRP % Calculation----1.6
BBBB-----MRP % Calculation(-)(1.6)
My existing schema setup:
Step     Cntr     Ctyp     Desp     Fro     To     Man     Mdt     Stat     P     SubTo     Reqt     AltCTy     AltCBV     ActKy     Accrls
50     0     P101     Val.Price Supply.Pln                                    X     9
80     0     ZB24     Freight - mat cost                                                             FRE     FR1
100     10     FRB1     Freight (Value)                                                             FRE     FR1
100     20     ZB14     Freight/Quantity                                    X                         FRE     FR1
150     0     ZB29     Freight/Quantity (-)     100     100                                   963     28     FRE     ZI6
200     0          Delivery Costs     80     101
400     0     GRWR     Statistical Value     50                                 C     8
500     0     ZIPR     HSIL MRP Price                                    X
510     0     ZICP     HSIL Cost Price                                    X
515     0          Total     500     510                    X
520     0     ZB15     MRP % Calculation     515                            X
600     0     ZB22     Excise Duty STO     520                            X     D          951          ZZ4     ZZ4
650     0     ZB30     Edu cess STO     600                                 D          963          ZZ4     ZZ4
651     0     ZB42     Sec Edu cess STO     600                                 D          963          ZZ4     ZZ4
thanks
mm_user

Hi guys,
Does anyone of you know this question?
thanks
User

Triple state checkbox

Similar Messages

Maybe you are looking for