CCAC: Category defines the limitation

Hi guys,.

Is there that a limit on the number of category sets which can be used by the CCAC for reports?

In my opinion, the category sets presents itself as a standard filter in the reports of the APCC.

We were told that we can have a maximum of 3 category games.

I just want to confirm.

Thank you.

Hello

Your information is correct.

You can only view the information of 3 sets of category to the CCAC.

In addition to this, you can only view the data in a single defined both class.

Hope that helps!

Kind regards

Mohan Balaji

Tags: Oracle Applications

Similar Questions

  • How do you define the limits on an automatic vertical scrolling?

    Hello Adobe community.

    I am building a vertical timeline from 1978 to 2009.  It's obviously long enough, so instead of having the entire timeline to the screen, I've set up a window that displays the dates of 5 and 6 and has nothing to do to scroll when the mouse passes over the up and down arrows.  There will be more in bulk and information to the timeline in the future, but this is where I am currently.

    My understanding of the programming of the script/code/is very VERY Basic.  What I have so far is a combination of a few tutorials, and it works perfectly other than to have no limits on this subject (so he continues to scroll upwards or downwards beyond the content into white nothingness).  In an earlier version, the limits have been set for ' window ' and 'follow' move clips (which worked) but does not apply for the rest of my current script (from a different source).  I'm sure that there is something missing, but I don't know what it is.

    Here is my file:

    http://www.sendspace.com/file/gs3zzg

    Any help anyone could give me would be much appreciated!

    -Emily

    normally something like this would be displayed using a mask.  If the mask and the movieclip scrolls both have reg points up, you can set limits by:

    scrolled_mc.y = Math.min(scrolled_mc.y,mask_mc.y+scrolled_mc.height-mask_mc.height);

    scrolled_mc.y = Math.max (scrolled_mc.y, mask_mc.y)

  • Defining the limits of maximum and minimum of a result set

    I'm putting the upper and the lower limit of a result set values. Which means, I want to limit the values in my game to be not below/above a certain number of results, BUT I want that in my result set which is bottom/top/down bound that I have designated to be decoded in the lower/upper bound number which I have appointed. Here is an example to help clarify:
    WITH temp_table AS
    (
     SELECT 1231.12 AS col FROM dual UNION ALL
     SELECT 1001.00 FROM dual UNION ALL
     SELECT -32.0 FROM dual UNION ALL
     SELECT -3.0 FROM dual UNION ALL
     SELECT 332.0 FROM dual UNION ALL
     SELECT 211.0 FROM dual 
     )
    SELECT CASE WHEN col < 0 -- 0 is the lower bound
                THEN
                     0
                WHEN col > 1000 -- 1000 is the upper bound
                THEN
                     1000
                ELSE
                     col
           END as desired_result 
    FROM   temp_table
    desired results set:
            DESIRED_RESULT
         1000
         1000     
            0
         0
         332
         211
    I was wondering if there was another function or method to achieve my goal without having to use a CASE statement? I must do this to multiple columns and it seems not very effective to launch a CASE statement around each of them.

    LESS and more GRAND that will also:

    SQL> WITH temp_table AS
      2  (
      3   SELECT 1231.12 AS col FROM dual UNION ALL
      4   SELECT 1001.00 FROM dual UNION ALL
      5   SELECT -32.0 FROM dual UNION ALL
      6   SELECT -3.0 FROM dual UNION ALL
      7   SELECT 332.0 FROM dual UNION ALL
      8   SELECT 211.0 FROM dual
      9   )
     10  SELECT least(greatest(col, 0), 1000)
     11  FROM temp_table
     12  ;
    
    LEAST(GREATEST(COL,0),1000)
    ---------------------------
                           1000
                           1000
                              0
                              0
                            332
                            211
    
    6 rows selected
     
    

    I must do this to multiple columns and it seems not very effective to launch a CASE statement around each of them.

    No matter what test case showing the case as not effective?

    Published by: odie_63 on 25 July. 2012 23:20

  • Beyond the limits of voltage on USB 6008?

    I use a USB-6008 to measure analog differential in the range of 3 to 5.3 V. I chose this range, because outside this range, I'm not interested in what the tension is, knowing that his "on the rail", but to aid resolution of the ADC in this range.

    So for a signal of ~0.05 supply V, I expected to read 3V, telling me that the voltage is lower than 3V, but again it returns 0.05v?

    As it was unexpected for me, could someone please explain what can / should I expect of my USB6008 of the responsed to the signals that are the limits? Is there an effect of "rollover"? Should you return the value to the limit? Depends on how far the limit is?

    Thanks for your help!

    Entry level do not think that way. You specify the range is that you wait for the signal and the DAQmx driver will set the most appropriate range that the device supports. The actual ranges are indicated in the guide. In your case, because you specify a max of 5.3, the device would be defined the +/-10 volts range.

  • How to define the range of data to a strict typdef through the control reference

    Hello world

    I'm trying to define the range of data to a strict typdef through the reference of the order, when I do, I get an 'error of property node.

    Is it possible to set the range of the strict typdef.

    Thank you

    Vignesh

    Vignesh1987 wrote:

    I'm trying to define the range of data to a strict typdef through the reference of the order, when I do, I get an 'error of property node.

    Is it possible to set the range of the strict typdef.

    Try to set the original control (type-def) and not its instances... to open the reference of the original type-def command, use 'Open VI reference'.

    Published:

    These properties are not available with STRICT TYPE DEF.

    a. data entry limits: increment property

    b. data entry property of limits: Maximum

    c. property limits: Minimum for the data entry

  • Dreamweaver beginner 2015 CC [how you define the page of the document with the same dimensions?]

    Maybe this is a stupid question.  How do you define the page of the document to exactly what you design.  I need to create an ad by e-mail to the 800px 650px.

    There are no stupid questions, answers all simply stupid. I hope that this will not be one of these responses.

    The short answer is that you don't set limits to a document, such as e-mails, Web sites or other. An email to read on an iPhone will have completely different dimensions for a reading on a computer screen. Mesaages read in Outlook will behave different to those read in a text format.

    Unless you know your audience and the device they are using, you must keep the liquid paper. For more information, see here http://webdesign.tutsplus.com/articles/creating-a-simple-responsive-html-email--webdesign-12978

  • Fill out the "limits" for nodes in a hierarchical query

    Hello

    I have a table called V that is organized hierarchically. You can have a "hierarchical" view by issuing the following query (PARENT_ID NULL is the root):

    SELECT rn, 
           LPAD ('_ ', 2 * (LEVEL - 1), '_ ') || id tree,
           id, 
           parent_id, 
           lvl, 
           cbi, 
           tree_lft, 
           tree_rgt, 
           tl, 
           tr 
    FROM v
    START WITH parent_id IS NULL 
    CONNECT BY PRIOR id = parent_id
    ORDER SIBLINGS BY rn;
    

    Now, my task is to fill in the TL and TR "limits" that define the beginning and end of each group under all nodes.

    For a better understanding, I've already placed the expected results in the TREE_LFT and TREE_RGT columns. The hierarchy follows the order of the columns, RN.

    TREE_LFT begins with the root (RN = 1) line 1 and lights up gradually until it reaches the leaves (CBI = 1). If a sheet is found, TREE_RGT is set to + 1 TREE_LFT.

    Then, if another sheet follows (online RN = 4), it takes the next increment TREE_LFT + 1. And so on. When all the leaves under the node assigned a value for TREE_LFT and TREE_RGT,

    the TREE_RGT value for the node takes the last value assigned to its + 1 children. For example, you can see that the children of the node id = 14 come from RN = RN = 30 3. The value of TREE_RGT

    for the last child (RN = 30) is 58, so the TREE_RGT value for the node id = 14 will be 58 + 1 = 59.

    Then the numbering continues gradually for the rest of the hierarchy. There is a new node to RN = 31, so TREE_LFT starts from TREE_RGT of the previous node + 1, that is, 60.

    This logic continues until the end of the hierarchy following RN.

    Using a STANDARD clause, I've managed to fill TL (you can see TL = TREE_LFT) and TR for the leaves.

    I also managed to complete the TR for nonleaf with a second MODEL clause, but it runs very bad when the array is much more filled than that.

    This is the STANDARD clause that allows you to calculate the TR:

    select *
    from v
    model 
    dimension by (id, parent_id, cbi)
    measures (rn, tree_lft, tree_rgt, lvl, tl, tr)
    rules (
           tr[ANY, ANY, 0] order by lvl desc, id, parent_id = max(tr)[ANY, CV(id), ANY] + 1
          )
          ;
    

    It does the job as expected, but the generic as well as ordered rule is a killer when it is applied to a larger painting.

    So my question is, is there a way I can write a query that would do the same as this one, but with better performance (functions analytical pattern)?

    I know that I can not really clear that it is not easy to explain.

    I use a database with 11.2.0.3 Enterprise Edition.

    Thank you

    Here are the scripts to test:

    create table v (RN NUMBER, NUMBER identification, PARENT_ID NUMBER, TREE_LFT NUMBER, TREE_RGT NUMBER, CBI NUMBER, NUMBER of LVL, TL NUMBER, NUMBER of TR);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (1, 3, null, 1, 100, 0, 1, 1, null);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (2, 14, 3, 2, 59, 0, 2, 2, null);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (3, 224, 14, 3, 4, 1, 3, 3, 4);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (4, 221, 14, 5, 6, 1, 3, 5, 6);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (5, 236, 14, 7, 8, 1, 3, 7, 8);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (6, 218, 14, 9, 10, 1, 3, 9, 10);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (7, 230, 14, 11, 12, 1, 3, 11, 12);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (8, 234, 14, 13, 14, 1, 3, 13, 14);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (9, 235, 14, 15, 16, 1, 3, 15, 16);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (10, 253, 14, 17, 18, 1, 3, 17, 18);

    insert into v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) values (11, 245, 14, 19, 20, 1, 3, 19, 20);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (12, 231, 14, 21, 22, 1, 3, 21, 22);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (13, 228, 14, 23, 24, 1, 3, 23, 24);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (14, 243, 14, 25, 26, 1, 3, 25, 26);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (15, 219, 14, 27, 28, 1, 3, 27, 28);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (16, 220, 14, 29, 30, 1, 3, 29, 30);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (17, 229, 14, 31, 32, 1, 3, 31, 32);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (18, 248, 14, 33, 34, 1, 3, 33, 34);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (19, 244, 14, 35, 36, 1, 3, 35, 36);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (20, 254, 14, 37, 38, 1, 3, 37, 38).

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (21, 247, 14, 39, 40, 1, 3, 39, 40);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (22, 225, 14, 41, 42, 1, 3, 41, 42);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (23, 226, 14, 43, 44, 1, 3, 43, 44).

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (24, 249, 14, 45, 46, 1, 3, 45, 46);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (25, 250, 14, 47, 48, 1, 3, 47, 48);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (26, 252, 14, 49, 50, 1, 3, 49, 50);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (27, 251, 14, 51, 52, 1, 3, 51, 52);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (28, 246, 14, 53, 54, 1, 3, 53, 54);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (29, 256, 14, 55, 56, 1, 3, 55, 56);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (30, 255, 14, 57, 58, 1, 3, 57, 58);

    insert into v values (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (31, 15, 3, 60, 75, 0, 2, 60, null);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (32, 222, 15, 61, 62, 1, 3, 61, 62);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (33, 223, 15, 63, 64, 1, 3, 63, 64);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (34, 241, 15, 65, 66, 1, 3, 65, 66);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (35, 242, 15, 67, 68, 1, 3, 67, 68);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (36, 227, 15, 69, 70, 1, 3, 69, 70);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (37, 213, 15, 71, 72, 1, 3, 71, 72);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (38, 214, 15, 73, 74, 1, 3, 73, 74);

    insert into v values (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (39, 16, 3, 76, 81, 0, 2, 76, null);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (40, 238, 16, 77, 78, 1, 3, 77, 78);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (41 237, 16, 79, 80, 1, 3, 79, 80);

    insert into v values (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (42, 17, 3, 82, 85, 0, 2, 82, null);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (43, 239, 17, 83, 84, 1, 3, 83, 84);

    insert into v values (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (44, 18, 3, 86, 99, 0, 2, 86, null);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (45, 232, 18, 87, 88, 1, 3, 87, 88);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (46, 233, 18, 89, 90, 1, 3, 89, 90);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (47, 215, 18, 91, 92, 1, 3, 91, 92);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (48, 216, 18, 93, 94, 1, 3, 93, 94);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (49, 217, 18, 95, 96, 1, 3, 95, 96);

    insert into values of v (RN, ID, PARENT_ID, TREE_LFT, TREE_RGT, CBI, LVL, TL, TR) (50, 240, 18, 97, 98, 1, 3, 97, 98);

    Hi Greg,.

    It looks like you use the defined nested data model.

    See solutions mentioned above:

    https://community.Oracle.com/thread/2603314 (last post)

    https://community.Oracle.com/message/12468999#12468999

  • Why im getting this error: "ORA-22813: value of the operand exceeds the limits of the system.

    HI EXPERTS...

    Please helpme to fix this...

    I have a database of oracle 11g, runnint on a Windows Server 2008:

    Oracle Database 11g Enterprise Edition Release 11.1.0.6.0 - Production

    I have two tables:

    CREATE TABLE UTILS. SEG_ROLES

    (

    VARCHAR2 (12-BYTE) APPLICATION,

    ROL VARCHAR2 (12-BYTE),

    USERS VARCHAR2 (255 BYTE)

    )

    TOGETHER TO DEFINE

    Insert into SEG_ROLES (APPLICATION, ROL, USERS) Values ('MULTIPLAN', 'ADMIN', 'ADMIN');

    Insert into SEG_ROLES (APPLICATION, ROL, USERS) Values ("MULTICLIP", 'CAR01', 'PATY');

    Insert into SEG_ROLES (APPLICATION, ROL, USERS) Values ("MULTICLIP", "CAR02", "FABIOLA, ERIKA");

    Insert into SEG_ROLES (APPLICATION, ROL, USERS) Values ("MULTICLIP", "CON01', 'LUCY, PATY');

    Insert into SEG_ROLES (APPLICATION, ROL, USERS) Values ("MULTICLIP", 'CON02', 'VALERIA');

    COMMIT;

    CREATE TABLE UTILS. SEG_ACCESOS

    (

    VARCHAR2 (12-BYTE) APPLICATION,

    ADMROL VARCHAR2 (12-BYTE),

    VARCHAR2 (20 BYTE) MENU,

    OPCION VARCHAR2 (20 BYTE),

    TYPE VARCHAR2 (5 BYTE),

    OBJETO_MENU VARCHAR2 (40 BYTE),

    ACCESO VARCHAR2 (2 BYTE),

    ROLES_ACCESOS VARCHAR2 (255 BYTE)

    )

    TOGETHER TO DEFINE

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "ROOMMA", NULL, am', 'm_coloca', the of ', 'CAR01, CAR02');

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "PUT", "PREVALIDA", "SM", "sm_prevalida", the from ', 'CAR01, CAR02');

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "PUT", "PRECOLOCA", "SM", "sm_preColocacion", the from ', 'CAR01, CAR02');

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", 'ADMIN', 'LOVE', "COLOCACIÓN", "SM", "sm_colocacion", the from ', "CAR01");

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "PUT", "REGCOLOCA", "SM", "sm_regcoloca", the from ', "CAR01");

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "LDP", NULL, am', 'm_PLD', the of ', "CAR01, CAR02, CON01 CON02");

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "LDP", "LN_CONSULTA", "SM", "sm_PLD_LNConsulta", the from ', 'CAR01, CAR02');

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "LDP", "LN_BARRIDOMASIVO", "SM", "sm_PLD_LNBarridoMasivo", the from ', "CAR01");

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "LDP", "REP_INICICLO", "SM", "sm_PLD_ReporIniciclo", the from ', 'CON01, CON02');

    Insert into SEG_ACCESOS (APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS)

    Values ("MULTICLIP", "ADMIN", "LDP", "LN_BITACORA", "SM", "sm_PLD_LNBitacora", the from ', "CON01");

    COMMIT;

    - And this point of view:


    CREATE VIEW UTILS. VW_ROL_USER AS

    Select distinct APPLICATION, ROL, trim (column_value) USUARIO

    from (SELECT APPLICATION, ROL, USERS USER

    FROM UTILS. SEG_ROLES

    WHERE IT IS NOT NULL TO USERS

    ORDER BY APPLICATION, ROL

    ) t,.

    XMLTable ((' «' ||)) Replace (USER, ",", "",""). '"'))

    order by APPLICATION, ROL, trim (column_value)

    CREATE VIEW UTILS. VW_ACC_ROL AS

    Select distinct APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, trim (column_value) ROL

    (SELECT APPLICATION, ADMROL, MENU, OPTION, TIPO, OBJETO_MENU, ACCESO, ROLES_ACCESOS ROL

    FROM UTILS. SEG_ACCESOS

    WHERE ROLES_ACCESOS IS NOT NULL

    ORDER BY APPLICATION, ADMROL, MENU, OPTION

    ) t,.

    XMLTable ((' «' ||)) Replace (ROL, ",", "",""). '"'))

    MENU, TYPE, OPTION, APPLICATION control, trim (column_value)

    CREATE VIEW UTILS. VW_SEG_ACCESOS AS

    SELECT VACR. APPLICATION, VACR. MENU, VACR. TIPO, VACR. OPCION, VACR. OBJETO_MENU, VACR. ACCESO, VACR. ROL, VUSR. USUARIO

    FROM UTILS. VW_ACC_ROL VACR,

    UTILS. VW_ROL_USER VUSR

    WHERE VACR. ROL = VUSR. ROL

    ORDER OF VACR. APPLICATION, VACR. ROL, VACR. MENU, VUSR. USUARIO, VACR. TIPO, VACR. OPCION

    When I ask the last posting, it works fine:

    SELECT VSEG.* IN UTILS. VW_SEG_ACCESOS VSEG

    But when I add conditions:

    SELECT VSEG.* IN UTILS. VW_SEG_ACCESOS VSEG

    WHERE VSEG. APPLICATION = "MULTIPLAN.

    AND VSEG. USER = 'PATY '.

    It generates this error:

    ORA-22813: value of the operand is greater than the limits of the system

    Cause: The value of the object or the Collection was too big. The size of the value might have exceeded 30 k in a context of TYPE, or size may be too large for the available memory.

    Action: Choose a different value, and try the operation again.

    Why?

    Thanks in advance...

    Finally found a SOLUTION at: http://stackoverflow.com/questions/14328621/oracle-10g-splitting-string-into-multiple-rows

    just change the way we create the view using the regexp_substr.

    CREATE VIEW UTILS. VW_ROL_USER AS

    SELECT distinct trim APPLICATION, ROL, (regexp_substr (USERS, ' [^,] +', 1, level)) USER

    FROM UTILS. SEG_ROLES t

    WHERE IT IS NOT NULL TO USERS

    CONNECTION BY instr (USERS, ',', 1, level - 1) > 0

    order by APPLICATION, ROL

    Thank you all

  • How to define the rules of navigation in faces - config.xml dynamically?

    In jdev 12.1.2 I am studying and performing the adf faces demo (12.1.2 version).

    I am trying to implement the function of navigation like this:

    1. in the navigation tree in the left panel of the accordion will show the features of an application which is read from database tables;

    2. When you click on a node in the navigation tree, a corresponding function/page will be launched in the Panel to the right of the home page;

    3. the navigation tree nodes display names and information pages target will be resident in the database tables and will be read in my case, the control of data bindings.

    and now I know, the click action was executed in this file in the demo: componentGallerySideBarTree.jsff:

    ->action = "#{stamp.actionOutcome}"

    < af:tree id = "tree" value = "#{attrs.menuModel}" var = "stamp" = "single" rowSelection fetchSize = "200" "

    Summary = "#{uploading." Summary}"disclosedRowKeys =" #{attrs.menuModel.foldersTreeState} "autoHeightRows = '0'"

    displayRow selectedRowKeys = "#{attrs.menuModel.selectionState}" = "selected" "

    contentDelivery = 'immediate' emptyText = "there are no demos for this category.

    styleClass = "AFStretchWidth" >

    < f: facet name = "nodeStamp" >

    < af:panelGroupLayout id = "nodePgl" >

    < af:image source = "#{stamp.ico}" styleClass = "GalleryIcon" shortDesc = "Image of a tree node" "

    ID = "nodeImg" / >

    < af:switcher facetName = "#{stamp.children == null?' leaves ': 'notLeaf'}" id = "nodeSw" > "

    < f: facet = "journal batch name" >

    < af:link id = text = "#{stamp.label"leafLink"} '"

    shortDesc = "#{stamp.label} #{stamp.deprecated eq 'real'?" (not recommended) " :"} »

    action = "#{stamp.actionOutcome}"

    inlineStyle = "#{stamp.deprecated eq 'true'?-style: italic; color: gray':"} ' "

    selected = "true" >

    < af:target execute="@this"/ >

    < / af:link >

    < / f: facet >

    < f: facet name = "notLeaf" >

    < af:outputText id = value = "#{stamp.label"notLeafText"} ' shortDesc =" #{stamp.label} "/ >"

    < / f: facet >

    < / af:switcher >

    < / af:panelGroupLayout >

    < / f: facet >

    < / af:tree >

    and the value of actionOutcome was entered in this file DemoConfusedComponentsMenuModel.java:

    (for the case of the confused component navagation tree folder)

    private TreeModel _initConfusedComponents()

    {

    Confused components

    The list < DemoItemNode > confusedComponentsNodes = new ArrayList < DemoItemNode >)

    {

    {

    ..

    Add (new DemoItemNode ("Tabs", "/ confusedComponents/tabs.jspx","/adfdt/panelTabbed.png","confused.tabs"));

    Add (new DemoItemNode ("iterators","/ confusedComponents/iterators.jspx","/adfdt/iterator.png","confused.iterators" ""));

    }

    };

    DemoItemNode confusedComponentsGroup = new DemoItemNode ("Often confused", "/ images/folder.png", confusedComponentsNodes);

    List ConfusedComponentsList = new ArrayList();
    confusedComponentsList.add (confusedComponentsGroup);

    TreeModel confusedComponents = new ChildPropertyTreeModel (confusedComponentsList, _CHILDREN);
    Return confusedComponents;
    }

    In addition, there are elements in faces-config .xml to define the rules of navigation for the actions 'by clicking on the tree node.

    <>navigation-case

    < from outcome >confused.iterators< / de-results >

    < to view - id > /confusedComponents/iterators.jspx< / to-view-id >

    <!-< redirect / >->

    < / navigation-case >

    So, I can add a new entry in the navigation tree, like this:

    1. in DemoConfusedComponentsMenuModel.javaof the file: Add

    Add (new DemoItemNode ("Iterators", "/confusedComponents/cms.jspx","/ adfdt/iterator.png","confused.cms" ""));

    2. in the file faces - config.xml, add:

    <>navigation-case

    < from outcome >confused.cms< / de-results >

    < to view - id > /confusedComponents/cms.jspx< / to-view-id >

    <!-< redirect / >->

    < / navigation-case >

    and it works!- I have successfully added a new node in the navigation tree, called a new page created by myself cms.jspx.

    If I implement them using database tables (links datacontrols EO/VO),.

    I think I can put action = "#{stamp.actionOutcome}" by links.

    But how can I pay the entry in the faces-config file. XML? -That is to say:

    How to define the rules of navigation in faces - config.xml dynamically?

    Thanks in advance!

    ADF 12 c comes with support for JSF 2.0, you can use the implicit navigation feature.

    In short: you don't need to add case action property, any set of navigation in the name of the page (and include the path if necessary).

    In your case, the name of the action will be: ' / confusedComponents/cms.jspx ' and of course, you can link the action property of method that returns this string.

    If you want to add by the case of navigation program, try ConfigurableNavigationHandler.

    For example:

    Manager of ConfigurableNavigationHandler = (ConfigurableNavigationHandler) FacesContext.getCurrentInstance () .getApplication () .getNavigationHandler ();

    handler.getNavigationCases () .put (...);

    Dario

  • How to use the Precendence_rules.csv file to define the rules of priority in integration ATG-short

    Hello

    I'm integrating ATG 10.1.2 Catalogue of products with short. I am successfully able to publish data from ATG to store short CASE file and run the update of the base.

    I used the model of integration of catalog:

    http://docs.Oracle.com/CD/E35827_01/ToolsAndFrameworks.310/PDF/ProductCatalogDTGuide.PDF

    The problem I am facing is, I have a dimension created from the structure of the ATG catalogue. I also have dimensions that I created in developer studio.

    I want to apply priority rules on the dimension, which I created in dev studio. using the Sun. by coming to the dimval CASE record store. Because I'm not able to view the dimensions to the CASE record store I can't define the rules of priority in dev studio.

    Page no. 12 of the guide above, they suggested that I use this precedence_rules.csv file in < app >/config/api - entry directory. I tried all the possible permutations and combinations to add priority rules by using this file, but they still do not work (I checked in JSP REF). All other prules I created in the studio of dev (between dims created in dev.studio) are being created.

    Another doubt, I must settle prules on a Sun. Val a dimension named product.category (coming from the record store Sun). Is this format I used below correct (I used the Windows format of folklore as suggested in the guide)?

    Precedence.source_dimension_name, Precedence.source_dimval_spec, Precedence.target_dimension_name, Precedence.type

    response of Product.Category/Accessories, 102016, Accessories 1, sheet

    Ideas/pointers would be greatly appreciated.

    I have no way of knowing that my FCM/ConfigurationGeneratorForge is actuall read this file because it didn't we no log being generated.

    Thank you

    Arjun

    I think I understood the problem I had. FCM correctly reads the precedence_rules.csv file, but it supports the priority rules for the dimensions of the root level. I could create a prule for "product.category" (it is NOT a dimension of autogen) which is a dimension created by the components of indexing of the ATG.

    It supports mapping prules for dims created in dev.studio and those created from on the side of the ATG and vice versa.

    When I tried to add the "product.category/accessories" as the size of the CBC in the priority rule, it does not work. "Accessories" are a dimval under "product.category" and it doesn't have an entry in the record of the CASE of the application schema store. I guess that's the problem that prevents me to add prules to the dimval.

    If someone managed to create the rule of priority for a dimval, let me know.

    Any help would be greatly appreciated.

    Kind regards

    Arjun

  • With the help of "Category of the item" flexfield for point information on request

    Hi friends,

    We use the flex 'Category of the item' field of collecting information on requisition.

    Please let me know how Item category flex field can be used when catalogs using external /punch out.

    Also, I need to know how to associate the segments of field flex with the supplier UNSPSC codes.

    Thank you

    responsibility for e-commerce gateway > installation > code conversion > define the conversion of code values
    Map of your category with the category of suppliers.

    Hope this helps
    Sandeep Gandhi

  • How to move the ends of the lines slanted towards the limits of the purge

    Hi all

    I developed a script that deletes the page elements to the purge. To achieve this, that I collect all the elements of the page (with the exception of text blocks) located partially on the editing table, create a temporary mask and 'trim' with subtraction of Pathfinder function. However, this approach does not work with graphic lines so I'm trying to move the ends of the lines to the limits of the substantive area lost. (I guess these are simple straight lines consisting of two end points).

    screengrab.png

    I knew how to deal with orthogonal lines - it's pretty easy:

    if (theItem.constructor.name == "GraphicLine" && theItem.paths.length === 1) {
         path = theItem.paths[0];
         if (path.pathPoints.length === 2) {
              ep = path.entirePath;
              w = ep[1][0]-ep[0][0];
              h = ep[1][1]-ep[0 ][1];
              
              if (w > h) {
                   newEp = [ [ spreadWithBleedBounds[1], ep[0][1] ], [ spreadWithBleedBounds[3], ep[1][1] ] ];
                   path.entirePath = newEp;
              }
              else if (h > w) {
                   newEp = [ [ ep[0][0], spreadWithBleedBounds[0] ], [ ep[1][0], spreadWithBleedBounds[2] ] ];
                   path.entirePath = newEp;
              }
         }
    }
    

    This moves A1 - A2, B1 , B2, C1 , C2, D1 to D2.

    But how to treat skewed lines? How to calculate the coordinates of the point E2 and F2? Y at - it a magic formula? Or can someone point me to the right direction: for example a book to read?

    I assume this has something to do with geometry/trigonometry, but I haven't studied this kind of things at school. (I graduated from an art school - designed to draw naked models instead).

    If someone will answer my question, please do it on basic level since I'm a total noob in the present.

    Here's the script:

    if (Number(String(app.version).split(".")[0]) == 7) ErrorExit("This script can't work with InDesign CS5 so far.", true);
    
    var doc = app.activeDocument;
    var spreadBounds, spreadWithBleedBounds, gPartiallyOutOfSpreadItems;
    var ungroupErrors = 0;
    
    var originalHorUnits =  doc.viewPreferences.horizontalMeasurementUnits;
    var originalVerUnits =  doc.viewPreferences.verticalMeasurementUnits;
    doc.viewPreferences.horizontalMeasurementUnits = doc.viewPreferences.verticalMeasurementUnits = MeasurementUnits.INCHES;
    doc.viewPreferences.rulerOrigin = RulerOrigin.spreadOrigin;
    doc.zeroPoint = [0, 0];
    
    if (doc.layers.itemByName("Temporary Layer") == null ) {
         var tempLayer = doc.layers.add({name:"Temporary Layer"});
    }
    else {
         var tempLayer = doc.layers.itemByName("Temporary Layer");
    }
    
    UngroupAllGroups(doc.groups);
    
    DeleteObjectsOnPasteboard();
    ProcessSpreads(doc.spreads);
    ProcessSpreads(doc.masterSpreads);
    
    tempLayer.remove();
    
    doc.viewPreferences.horizontalMeasurementUnits = originalHorUnits;
    doc.viewPreferences.verticalMeasurementUnits = originalVerUnits;
    
    var msg = (ungroupErrors > 0) ? " Failed to ungroup " + ungroupErrors + " groups since they are too large." : "";
    alert("Done." + msg, "Trim Pages Script");
    
    //================================== FUNCTONS ===========================================
    function ProcessSpreads(spreads) {
         var spread, path, ep, w, h;
         for (var s = 0; s < spreads.length; s++) {
              spread = spreads[s];
              spreadBounds = GetSpreadBound(spread, false);
              spreadWithBleedBounds = GetSpreadBound(spread, true);
              
              gPartiallyOutOfSpreadItems = GetPartiallyOutOfSpreadItems(spread);
              
              var theItem, theMask, newItem;
              for (var i = gPartiallyOutOfSpreadItems.length-1; i >= 0; i--) {
                   theItem = gPartiallyOutOfSpreadItems[i];
                   if (theItem.constructor.name == "GraphicLine" && theItem.paths.length === 1) {
                        path = theItem.paths[0];
                        if (path.pathPoints.length === 2) {
                             ep = path.entirePath;
                             w = ep[1][0]-ep[0][0];
                             h = ep[1][1]-ep[0 ][1];
                             
                             if (w > h) {
                                  newEp = [ [ spreadWithBleedBounds[1], ep[0][1] ], [ spreadWithBleedBounds[3], ep[1][1] ] ];
                                  path.entirePath = newEp;
                             }
                             else if (h > w) {
                                  newEp = [ [ ep[0][0], spreadWithBleedBounds[0] ], [ ep[1][0], spreadWithBleedBounds[2] ] ];
                                  path.entirePath = newEp;
                             }
                        }
                   }
                   else {
                        theMask = CreateMask(spread);
                        try {
                             newItem = theMask.subtractPath(theItem);
                        }
                        catch (err) {
                             $.writeln("2 - " + err);
                             theMask.remove();
                        }
                   }
              }
         }
    }
    //--------------------------------------------------------------------------------------------------------------
    function IsPartiallyOutOfSpread(pageItem) {
         var result = false;
         if (pageItem.constructor.name == "TextFrame" ||
              pageItem.constructor.name == "Group" ||
              pageItem.parent.constructor.name == "Group")
         {
              return result;
         }
    
         var visBounds = pageItem.visibleBounds;
         if (visBounds[0] < spreadBounds[0] && visBounds[2] > spreadBounds[0] ||
              visBounds[1] < spreadBounds[1] && visBounds[3] > spreadBounds[1] ||
              visBounds[2] > spreadBounds[2] && visBounds[0] < spreadBounds[2] ||
              visBounds[3] > spreadBounds[3] && visBounds[1] < spreadBounds[3]  ) {
              result = true;
         }
         return result;
    }
    //--------------------------------------------------------------------------------------------------------------
    function GetSpreadBound(spread, bleed) { // including bleed -boolean
         if (bleed == undefined) bleed = false;
         
         with (doc.documentPreferences) {
              var topBleed = documentBleedTopOffset
              var leftBleed = documentBleedInsideOrLeftOffset;
              var bottomBleed = documentBleedBottomOffset;
              var rightBleed = documentBleedOutsideOrRightOffset;
         }
    
         var bFirst = spread.pages.item(0).bounds; // bounds of the first page
         var bLast = spread.pages.item(-1).bounds; // bounds of the last page
         return [     ((bleed) ? bFirst[0]-topBleed : bFirst[0]), 
                        ((bleed) ? bFirst[1]-leftBleed : bFirst[1]), 
                        ((bleed) ? bLast[2]+bottomBleed : bFirst[2]), 
                        ((bleed) ? bLast[3]+rightBleed : bLast[3])
                        ];
    }
    //--------------------------------------------------------------------------------------------------------------
    function CreateMask(spread) {
         var unitValue = new UnitValue (app.pasteboardPreferences.minimumSpaceAboveAndBelow, "mm");
         var unitValueAsInch = unitValue.as("in");
         var outerRectangleBounds = [spreadWithBleedBounds[0]-unitValueAsInch, 
                                                                spreadWithBleedBounds[1]-8.07, 
                                                                spreadWithBleedBounds[2]+unitValueAsInch, 
                                                                spreadWithBleedBounds[3]+8.07
                                                                ]; 
    
         var outerRectangle = spread.rectangles.add(tempLayer, undefined, undefined, {geometricBounds:outerRectangleBounds});
         var innerRectangle = spread.rectangles.add(tempLayer, undefined, undefined, {geometricBounds:spreadWithBleedBounds, fillColor:doc.swatches.item("Black"), fillTint:30});
         var mask = outerRectangle.excludeOverlapPath(innerRectangle);
         return mask;
    }
    //--------------------------------------------------------------------------------------------------------------
    function GetPartiallyOutOfSpreadItems(spread) {
         var allPageItems = spread.allPageItems;
         var partiallyOutOfSpreadItems = [];
         var currentItem;
         
         for (var i = 0; i < allPageItems.length; i++) {
              currentItem = allPageItems[i];
              if (IsPartiallyOutOfSpread(currentItem)) partiallyOutOfSpreadItems.push(currentItem);
         }
         
         return partiallyOutOfSpreadItems;
    }
    //--------------------------------------------------------------------------------------------------------------
    function DeleteObjectsOnPasteboard() {
         var objs = app.documents[0].pageItems.everyItem().getElements();
         while (obj=objs.pop()) {
              try {
                   if(obj.parent instanceof Spread || obj.parent instanceof MasterSpread){ obj.remove() }
              }
              catch(err) {
                   //$.writeln("2 - " + err);
              }
         }
    }
    //--------------------------------------------------------------------------------------------------------------
    function ErrorExit(myMessage, myIcon) {
         alert(myMessage, "Trim Pages Script", myIcon);
         exit();
    }
    //--------------------------------------------------------------------------------------------------------------
    function UngroupAllGroups(groups) {
         for (var i = groups.length-1; i >= 0; i--) {
              var gr = groups[i];
              if (gr.groups.length > 0) {
                   var subGroups = [];
                   for (var j = gr.groups.length-1; j >= 0; j--) {
                        subGroups.push(gr.groups[j].id);
                   }                    
                   try {
                        gr.ungroup();
                   }
                   catch(err) {
                        //$.writeln("1 - " + err);
                        ungroupErrors++;
                   }
              
                   for (var k = subGroups.length-1; k >= 0; k--) {
                        try {
                             doc.groups.itemByID(subGroups[k]).ungroup();
                        }
                        catch(err) {
                             //$.writeln("2 - " + err);
                             ungroupErrors++;
                        }
                   }
              }
              else {
                   try {
                        gr.ungroup();
                   }
                   catch(err) {
                        //$.writeln("1 - " + err);
                        ungroupErrors++;
                   }
              }
         }     
    }
    //--------------------------------------------------------------------------------------------------------------

    Thanks in advance.

    Kasyan

    Hi Kasyan!

    I was not trying to integrate this into your script, so you may need to adjust a little. The trick is to define a function that detects the point of intersection of two lines - and, of course, you must call it for lines that will not fail to cross the border of the page! (Otherwise, it would simply expand * any * the line upward and on the border.)

    I think it would be wise to predict a small mistake for lines that seem to run "up to" the edge of the page - I tested a line for 'x '.<= 0"="" on="" a="" line="" that="" appeared="" to="" start="" on="" 0;="" the="" control="" panel="" told="" me="" so.="" however,="" i="" didn't="" type="" that="" 0="" in;="" i="" dragged="" the="" line="" to="" the="" edge.="" apparently,="" it="" was="" *not*="" at="" precisely="" "0mm",="" but="" something="" like="" "0.001mm",="" because="" the="" script="" simply="" didn't="" "see"="" the="">

    My function comes from this page: http://local.wasp.uwa.edu.au/~pbourke/geometry/lineline2d/ and I did not test it does of orthogonal lines

    (but of course, you could add this in exceptional cases), and it's my script extending the line, with a small wrapper to configure things.

    The function tests * any * tail against * any * other line, so if we meet the page bounding box, I get the intersection with the purge of the side area where it crosses the bbox page.

    line = app.selection[0];
    // pg size in "regular" [y1,x1, y2,x2] format
    pagebbox = [0,0, app.activeDocument.documentPreferences.pageHeight,app.activeDocument.documentPreferences.pageWidth ];
    bleedDist = 5; //
    bleedbbox = [ pagebbox[0] - bleedDist, pagebbox[1] - bleedDist, pagebbox[2] + bleedDist, pagebbox[3] + bleedDist ];
    pt1 = line.paths[0].pathPoints[0].anchor;
    pt2 = line.paths[0].pathPoints.lastItem().anchor;
    // Start point:
    if (pt1[0] <= pagebbox[1] || pt1[0] >= pagebbox[3] ||
     pt1[1] <= pagebbox[0] || pt1[1] >= pagebbox[2])
    {
     if (pt1[0] <= pagebbox[1])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[0]], [bleedbbox[1], bleedbbox[2] ] ] );
    
     if (pt1[0] >= pagebbox[3])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[3], bleedbbox[0]], [bleedbbox[3], bleedbbox[2] ] ] );
    
     if (pt1[1] <= pagebbox[0])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[0]], [bleedbbox[3], bleedbbox[0] ] ] );
     if (pt1[1] >= pagebbox[2])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[2]], [bleedbbox[3], bleedbbox[2] ] ] );
     line.paths[0].pathPoints[0].anchor = intersectPt;
    }
    // End point:
    if (pt2[0] <= pagebbox[1] || pt2[0] >= pagebbox[3] ||
     pt2[1] <= pagebbox[0] || pt2[1] >= pagebbox[2])
    {
     if (pt2[0] <= pagebbox[1])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[0]], [bleedbbox[1], bleedbbox[2] ] ] );
    
     if (pt2[0] >= pagebbox[3])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[3], bleedbbox[0]], [bleedbbox[3], bleedbbox[2] ] ] );
    
     if (pt2[1] <= pagebbox[0])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[0]], [bleedbbox[3], bleedbbox[0] ] ] );
     if (pt2[1] >= pagebbox[2])
      intersectPt = IntersectionPt ( [pt1, pt2], [ [ bleedbbox[1], bleedbbox[2]], [bleedbbox[3], bleedbbox[2] ] ] );
     line.paths[0].pathPoints.lastItem().anchor = intersectPt;
    }
    
    function IntersectionPt (ln1, ln2)
    {
     var ua;
     var x1 = ln1[0][0], x2 = ln1[1][0], x3 = ln2[0][0], x4 = ln2[1][0];
     var y1 = ln1[0][1], y2 = ln1[1][1], y3 = ln2[0][1], y4 = ln2[1][1];
     ua = ((x4 - x3)*(y1 - y3) - (y4 - y3)*(x1 - x3))/((y4 - y3)*(x2 - x1) - (x4 - x3)*(y2 - y1));
    
     return [ x1 + ua*(x2-x1), y1 + ua*(y2-y1) ];
    }
    
  • Creation of category defined without valueset

    Hello

    I created a custom category defined without value. I was wondering if it's a good idea to create whole category worthless and just enter these independent values directly in the category code. It contains only the category 4 codes.

    Create the Structure-> Add segment (no value)
    The category codes-> enter category codes 4
    Create whole category

    Please advise!

    Thank you

    User will be forced to choose LOV when attached a category to an item.
    But when your superuser creates a new category, there will be no LOV and do you have people making mistakes or by creating a new category when a similar one exists. Or creating data in different cases when you prefer to have capital letters only.

    It's a good idea to add some validation.

    Sandeep Gandhi

  • How to overcome the limits of mail?

    I want to send a mass email to more than 100 people. How can I exceed the limits of sending mail?

    You can use a Gmail account with the e-mail. Their limit is 500 recipients for a single e-mail.

  • How can I get a new category in the list?

    I have included a number of events of the churches, using the calendar in Thunderbird, but whenever I have to add 'Church' as a new category, even if I already added. How can I get a new category in the list? It might also be useful to be able to get rid of the categories that I'm probably not want. Is this possible?

    When you add the new category?
    If added to the event entry so it is an addition of time.
    You go to Options-calendar-categories and add is there to be a permanent choice. There is also a button to delete it.

Maybe you are looking for