Set inside a Set and powerset problem. Need help.

I've done other posts about this but I figured I'd start a new thread since I changed it so much. I understand the idea of power sets but not how it needs to be a Set inside a set and also how to get this thing to run. If anyone could show me a power set generator or help me fix my code I'd really appreciate it.
Thanks in advance
public static <E> Set<Set <E>> generatePowerSet(Set<E> S){
          Set<E> newSet = new HashSet<E>();
          Set<E> temp = new HashSet<E>();
          if (S.isEmpty() || S.equals("")) {
               Set<E> emptySet = new HashSet<E>(S);
               return (Set<Set<E>>) emptySet;
          else {
               Iterator<E> iter = S.iterator();
               temp = S;
               while (iter.hasNext()) {
                    E obj = iter.next();
                    temp.remove(obj);
                    Set<E> P = new HashSet<E>(temp);
                    P.addAll(temp);
                    newSet.addAll(P);
                    return newSet;
          }

I have no idea what a "power set" is.
But, this line:
if (S.isEmpty() || S.equals("")) {should just be:
if (S.isEmpty()) {S is the input parameter, and is a Set. Therefore, S can never equal an empty string.
Did you see my reply to your previous thread?
http://forum.java.sun.com/thread.jspa?threadID=677353
It seems that you didn't, because you didn't respond to it, and because your current code has the same problem.

Similar Messages

  • Stalled Scrolling and Other Problems- NEED HELP ASAP! HAS NOT BEEN ANSWERED/SOLVED, STILL NEED HELP.

    Hello,
    Ever since I downloaded Firefox 25, I have had an issue with scrolling. If there was some way to record this, I would, but at this time I cannot, so a description will have to do. If someone knows a way to record what is happening, I will gladly do it to make what I am saying easier to visualize.
    On some sites I visit, scrolling will be what can only be described as "choppy"- I will attempt to scroll down, but there will be a small delay before the page responds and scrolls down. Thus, the scrolling does not go smoothly. This mostly happens on sites (tumblr pages especially) with non-scrolling backgrounds (ie backgrounds that do not scroll with the page) on them.
    First off, I do not think this is a problem with any extensions, my computer, or the sites themselves. When I open the same pages in Chrome, the issue does not occur and the issue does not occur in all pages.
    I have tried clearing the cookies and cache, resetting my browser, disabling hardware acceleration, checking the plugins (problem still happened even when all plugins were disabled), updating my graphics card, and disabling website colors. The first few produced no lasting result/fix, and while disabling website colors did fix the issue, it made the rest of the site/other sites (ones that were working fine) difficult/impossible to use.
    One interesting fact of note is this: If I downgrade to Firefox 24, the issue not only disappears, but stays away, and does not occur.
    Another fact of note: I have written a previous thread on this issue, but ended up not getting an answer to a second question I had. In the first thread, I was given this possible solution, referring to a bookmarklet I could use/try: https://support.mozilla.org/en-US/questions/976244#answer-496960
    So my questions here are these:
    1) What is going on in Firefox 25 that makes scrolling choppy in that version, but not in version 24 or any other browser except version 25?
    2) How exactly do I use that bookmarklet I linked to? Where do I need to place it? How do I get to where I need to place it? How would it work? Is there a way to/Can someone make it into a Greasemonkey (I have Greasemonkey) userscript, if it does work?
    Also, is there a way to "bump" my thread without actually commenting on it?

    Bumping this. Are my questions showing up for anyone else? Because usually I get fairly prompt answers, but have gotten nothing on my last couple of threads.
    I'm sorry if I'm coming off as demanding, but I would like to have this answered, and it's frustrating to not have things at least replied to.

  • I have printers at home and work. i need help programing my macbook print utility so computer knows which printer to use depending on where i am. thanks

    i have printers at home and work. i need help programing my macbook print utility so computer knows which printer to use depending on where i am. thanks

    Look for cloud solutions such as DropBox, OneDrive, SugarSync or others. They are all cloud based services that sync documents between computers via the cloud. Of course another solution is simply a flash drive formatted in exFat so that Macs and Windows computers can read it.

  • Iphone 4s all apps are disappear including setting, contacts, call icon and etc. can someone help me?

    I am currently using iphone 4s , i didn't update the latest IOS 7.1 (I forgot i have updated which ios 7) . I can't go in to a particular apps, so i restart my phone. After I restart my phone, all apps are disappear including setting, contacts, and call icon and etc. can someone help me?  The phone now only remain two apps. I try to search using the phone serch engine but when i click on the result, there is a message pop out as: Unsupported URL 

    Swipe back (right to left) to the home screens that contain the rest of your apps.
    Failing that, reset the phone: hold down Sleep and Home buttons until the Apple logo is displayed.  No data is lost.

  • K9N Neo-F Freeze and restart problem. Help needed!

    Hi there,
    I recently bought a Mainboard (K9N Neo-F S/N: 601-7260-010K0605023133) that seems to shutdown every now and then. No blue screen... it just freezes for a while and then shuts down. My CPU temperature is very low, I've used a lot of coolingpaste and I have tried every possible way of mounting memorys... 1,2,4... and in different slots. I've run Memtest also. The BIOS-version is the newest according to the Liveupdate-function. The power supply should be enough but I have tested disconnecting everything else then one harddrive and the mobo... doesn't work.
    Sometimes it happens with three hours between the occations and sometimes five minutes. Not related to anything special that is done on the computer.
    Is this a problem that is common...? Related to hardware or bios...? I would be glad for any advice you could give.
    Thanks in advance. Really need help... this drives me mad...
    /Christian

    I started Orthos and then left the computer alone. Went and watched a film, when I got back after 1 hour and 38 minutes or something like that the computer freezed. I will try leaving it on all night without touching a thing... kind of strange that it happens right when I sit down and move the mouse.
    Thanks a lot for trying to help... it's appreciated.
    Here's the log:
    Type: Large, in-place FFTs - stress some RAM Min: 128 Max: 1024 InPlace: Yes Mem: 8 Time: 15
    CPU: 2211MHz FSB: 200MHz [201MHz x 11.0 est.]
    CPU: 2211MHz FSB: 0MHz [0MHz x 0.0 est.]
    2006-10-16 21:23
    Launching 2 threads...
    1:Using CPU #0
    2:Using CPU #1
    1:Beginning a continuous self-test to check your computer.
    2:Beginning a continuous self-test to check your computer.
    1:Press Stop to end this test.
    2:Press Stop to end this test.
    1:Test 1, 4000 Lucas-Lehmer iterations of M19922945 using 1024K FFT length.
    2:Test 1, 4000 Lucas-Lehmer iterations of M19922945 using 1024K FFT length.
    1:Test 2, 4000 Lucas-Lehmer iterations of M19922943 using 1024K FFT length.
    2:Test 2, 4000 Lucas-Lehmer iterations of M19922943 using 1024K FFT length.
    1:Test 3, 4000 Lucas-Lehmer iterations of M19374367 using 1024K FFT length.
    2:Test 3, 4000 Lucas-Lehmer iterations of M19374367 using 1024K FFT length.
    1:Test 4, 4000 Lucas-Lehmer iterations of M19174369 using 1024K FFT length.
    2:Test 4, 4000 Lucas-Lehmer iterations of M19174369 using 1024K FFT length.
    1:Test 5, 4000 Lucas-Lehmer iterations of M18874369 using 1024K FFT length.
    2:Test 5, 4000 Lucas-Lehmer iterations of M18874369 using 1024K FFT length.
    1:Self-test 1024K passed!
    1:Test 1, 4500 Lucas-Lehmer iterations of M17432577 using 896K FFT length.
    2:Self-test 1024K passed!
    2:Test 1, 4500 Lucas-Lehmer iterations of M17432577 using 896K FFT length.
    1:Test 2, 4500 Lucas-Lehmer iterations of M17432575 using 896K FFT length.
    2:Test 2, 4500 Lucas-Lehmer iterations of M17432575 using 896K FFT length.
    1:Test 3, 4500 Lucas-Lehmer iterations of M17115073 using 896K FFT length.
    2:Test 3, 4500 Lucas-Lehmer iterations of M17115073 using 896K FFT length.
    1:Test 4, 4500 Lucas-Lehmer iterations of M16815071 using 896K FFT length.
    2:Test 4, 4500 Lucas-Lehmer iterations of M16815071 using 896K FFT length.
    1:Self-test 896K passed!
    1:Test 1, 5300 Lucas-Lehmer iterations of M14942209 using 768K FFT length.
    2:Self-test 896K passed!
    2:Test 1, 5300 Lucas-Lehmer iterations of M14942209 using 768K FFT length.
    1:Test 2, 5300 Lucas-Lehmer iterations of M14942207 using 768K FFT length.
    2:Test 2, 5300 Lucas-Lehmer iterations of M14942207 using 768K FFT length.
    1:Test 3, 5300 Lucas-Lehmer iterations of M14155777 using 768K FFT length.
    2:Test 3, 5300 Lucas-Lehmer iterations of M14155777 using 768K FFT length.
    1:Test 4, 5300 Lucas-Lehmer iterations of M14155775 using 768K FFT length.
    2:Test 4, 5300 Lucas-Lehmer iterations of M14155775 using 768K FFT length.
    1:Self-test 768K passed!
    1:Test 1, 6500 Lucas-Lehmer iterations of M12451841 using 640K FFT length.
    2:Self-test 768K passed!
    2:Test 1, 6500 Lucas-Lehmer iterations of M12451841 using 640K FFT length.
    1:Test 2, 6500 Lucas-Lehmer iterations of M12451839 using 640K FFT length.
    2:Test 2, 6500 Lucas-Lehmer iterations of M12451839 using 640K FFT length.
    1:Test 3, 6500 Lucas-Lehmer iterations of M12196481 using 640K FFT length.
    2:Test 3, 6500 Lucas-Lehmer iterations of M12196481 using 640K FFT length.
    2:Test 4, 6500 Lucas-Lehmer iterations of M11796481 using 640K FFT length.
    1:Test 4, 6500 Lucas-Lehmer iterations of M11796481 using 640K FFT length.
    1:Test 5, 6500 Lucas-Lehmer iterations of M11796479 using 640K FFT length.
    2:Test 5, 6500 Lucas-Lehmer iterations of M11796479 using 640K FFT length.
    1:Self-test 640K passed!
    1:Test 1, 7800 Lucas-Lehmer iterations of M9961473 using 512K FFT length.
    2:Self-test 640K passed!
    2:Test 1, 7800 Lucas-Lehmer iterations of M9961473 using 512K FFT length.
    1:Test 2, 7800 Lucas-Lehmer iterations of M9961471 using 512K FFT length.
    2:Test 2, 7800 Lucas-Lehmer iterations of M9961471 using 512K FFT length.
    1:Test 3, 7800 Lucas-Lehmer iterations of M9837183 using 512K FFT length.
    2:Test 3, 7800 Lucas-Lehmer iterations of M9837183 using 512K FFT length.
    1:Test 4, 7800 Lucas-Lehmer iterations of M9737185 using 512K FFT length.
    2:Test 4, 7800 Lucas-Lehmer iterations of M9737185 using 512K FFT length.
    1:Test 5, 7800 Lucas-Lehmer iterations of M9537183 using 512K FFT length.
    2:Test 5, 7800 Lucas-Lehmer iterations of M9537183 using 512K FFT length.
    1:Self-test 512K passed!
    1:Test 1, 9000 Lucas-Lehmer iterations of M8716289 using 448K FFT length.
    2:Self-test 512K passed!
    2:Test 1, 9000 Lucas-Lehmer iterations of M8716289 using 448K FFT length.
    1:Test 2, 9000 Lucas-Lehmer iterations of M8716287 using 448K FFT length.
    2:Test 2, 9000 Lucas-Lehmer iterations of M8716287 using 448K FFT length.
    1:Test 3, 9000 Lucas-Lehmer iterations of M8516289 using 448K FFT length.
    2:Test 3, 9000 Lucas-Lehmer iterations of M8516289 using 448K FFT length.
    1:Test 4, 9000 Lucas-Lehmer iterations of M8316287 using 448K FFT length.
    2:Test 4, 9000 Lucas-Lehmer iterations of M8316287 using 448K FFT length.

  • Problems with IOS 7.0.4 and ipad 2 need help

    Need help with problems caused by downloading IOS 7.0.4 onto my ipad2

    To answer, we'll need to know what problems you're having.

  • Searching Problem, need help plz...

    Hi All,
    I have a problem. After created index my_doc_idx1, i’m searching a word on all document i stored but find nothing. Everytime i search there’s no rows selected.
    anybody help me please?
    I including my code.
    My documents are:
    1. doc1.html contain:
    “Oracle interMedia audio, document, image, and video is designed to manage Internet media content”
    2. doc2.html contain:
    “Oracle interMedia User’s Guide and Reference, Release 9.0.1”
    3. word1.doc contain:
    “Oracle application server.”
    4. oracletext.pdf contain:
    “Stages of Index Creation.”
    Oracle9i 9 realese 2, Windows XP
    Thanks,
    Robby
    set serveroutput on
    set echo on
    -- create table
    create table my_doc (
    id number,
    document ordsys.orddoc);
    INSERT INTO my_doc VALUES(1,ORDSYS.ORDDoc.init());
    INSERT INTO my_doc VALUES(2,ORDSYS.ORDDoc.init());
    INSERT INTO my_doc VALUES(3,ORDSYS.ORDDoc.init());
    INSERT INTO my_doc VALUES(4,ORDSYS.ORDDoc.init());
    COMMIT;
    -- create directory
    create or replace directory dir_doc as 'e:\projects'
    -- import data
    DECLARE
    obj ORDSYS.ORDDoc;
    ctx RAW(4000) := NULL;
    BEGIN
    SELECT document INTO obj FROM my_doc WHERE id = 1 FOR UPDATE;
    obj.setSource('file','DIR_DOC','doc1.html');
    obj.import(ctx,FALSE);
    UPDATE my_doc SET document = obj WHERE id = 1;
    COMMIT;
    SELECT document INTO obj FROM my_doc WHERE id = 2 FOR UPDATE;
    obj.setSource('file','DIR_DOC','doc2.html');
    obj.import(ctx,FALSE);
    UPDATE my_doc SET document = obj WHERE id = 2;
    COMMIT;
    SELECT document INTO obj FROM my_doc WHERE id = 3 FOR UPDATE;
    obj.setSource('file','DIR_DOC','word1.doc');
    obj.import(ctx,FALSE);
    UPDATE my_doc SET document = obj WHERE id = 3;
    COMMIT;
    SELECT document INTO obj FROM my_doc WHERE id = 4 FOR UPDATE;
    obj.setSource('file','DIR_DOC','oracletext.pdf');
    obj.import(ctx,FALSE);
    UPDATE my_doc SET document = obj WHERE id = 4;
    COMMIT;
    END;
    -- check properties
    DECLARE
    obj ORDSYS.ORDDoc;
    idnum INTEGER;
    ext VARCHAR2(5);
    dotpos INTEGER;
    mimetype VARCHAR2(50);
    fname VARCHAR2(50);
    ctx RAW(4000) := NULL;
    BEGIN
    fname:= '';
    DBMS_OUTPUT.PUT_LINE('----------------------------------------');
    FOR I IN 1..4 LOOP
    SELECT id, document INTO idnum, obj FROM my_doc
    WHERE id = I;
    fname := obj.getSourceName();
    dotpos := INSTR(fname, '.');
    IF dotpos != 0 THEN
    ext := LOWER(SUBSTR(fname, dotpos + 1));
    ext := LOWER(ext);
    mimetype := 'application/' || ext;
    IF ext = 'doc' THEN
    mimetype := 'application/msword';
    obj.setFormat('DOC');
    ELSIF ext = 'pdf' THEN
    mimetype := 'application/pdf';
    obj.setFormat('PDF');
    ELSIF ext = 'ppt' THEN
    mimetype := 'application/vnd.ms-powerpoint';
    obj.setFormat('PPT');
    ELSIF ext = 'txt' THEN
    obj.setFormat('TXT');
    END IF;
    obj.setMimetype(mimetype);
    END IF;
    DBMS_OUTPUT.PUT_LINE('Document ID: ' || idnum);
    IF TO_CHAR(DBMS_LOB.getLength (obj.getContent())) = 0 THEN
    DBMS_OUTPUT.PUT_LINE('Content is NULL.');
    DBMS_OUTPUT.PUT_LINE('No information available.');
    ELSIF TO_CHAR(DBMS_LOB.getLength (obj.getContent())) <> 0 THEN
    DBMS_OUTPUT.PUT_LINE('Document Source: ' || obj.getSource());
    DBMS_OUTPUT.PUT_LINE('Document Name: ' || obj.getSourceName());
    DBMS_OUTPUT.PUT_LINE('Document Type: ' || obj.getSourceType());
    DBMS_OUTPUT.PUT_LINE('Document Location: ' || obj.getSourceLocation());
    DBMS_OUTPUT.PUT_LINE('Document MIME Type: ' || obj.getMimeType());
    DBMS_OUTPUT.PUT_LINE('Document File Format: ' || obj.getFormat());
    DBMS_OUTPUT.PUT_LINE('BLOB Length: ' || TO_CHAR(DBMS_LOB.getLength (obj.getContent())));
    END IF;
    DBMS_OUTPUT.PUT_LINE('----------------------------------------');
    END LOOP;
    EXCEPTION
    END;
    -- create index
    create index my_doc_idx1
    on my_doc(document.comments)
    indextype is ctxsys.context;
    commit;
    alter index my_doc_idx1
    rebuild online
    parameters('sync memory 10m');
    -- searching
    select id from my_doc t
    where contains(t.document.comments,'oracle') > 0
    order by id;
    select id from my_doc t
    where contains(t.document.comments,'application server') > 0
    order by id;
    select id from my_doc t
    where contains(t.document.comments,'index creation') > 0
    order by id;

    Hi,
    Which is best depends on the type of application you are building and the nature of the docs. For simple use with pdf's and word docs I prefer to use bfile or blob which is why I mentioned it. No sense in overcomplicating it.
    My recommendation - look at the interMedia docs and determine if you need the advanced features it provides. I like the application a lot, but am a firm believer in not adding complexity if there is no benefit to be had. Unless you are just playing around with it to learn, I'd recommend matching your project requirements up with what best meets them and go whichever route that is.
    Thanks,
    Ron

  • Still stuck with the same old producer consumer weight problem need help

    Hello All,
    This is the problem I am stuck with right now.
    I have two array lists one producer array list and one consumer array list denoted by a and b
    P1 P2 P3 P4 P5
    5 6 7 8 9
    C1 C2 C3 C4 C5
    2 3 4 5 6
    Now we find all those producer consumer pairs which satisfy the criteria Pi>=Ci
    We have the following sets
    (5,2)(6,2)(7,2),(8,2),(9,2)
    (5,3)(6,3)(7,3),(8,3),(9,3)
    (5,4)(6,4)(7,4),(8,4),(9,4)
    (5,5)(6,5)(7,5),(8,5),(9,5)
    (6,6)(7,6)(8,6),(9,6)
    Let us done each of them with Si
    so we have S1,S2,S3,S4,S5
    we assign a third parameter called weight to each element in Si which has satisfied the condition Pi>=Ci;
    so we we will have
    (5,2,ai),(6,2,bi),(7,2,ci)....etc for S1
    similarly for S2 and so on.
    We need to find in each set Si the the pair which has the smallest weight.
    if we have (5,2,3) and (6,2,4) then 5,2,3 should be chosen.We should make sure that there is only one pair in every set which is finally chosen on the basis of weight.
    Suppose we get a pair (5,2,3) in S1 and (5,2,3) in S2 we should see that (5,2,3) is not used to compare to compare with any other elements in the same set S2,
    Finally we should arrive at the best element pair in each set.They should be non repeating in other sets.
    Given a problem
    P0 P1 P2 P3 P4
    9 5 2 2 8
    6 5 4 5 3
    C0 C1 C2 C3 C4
    we have So as (P0,C0) and (P4,C0)
    assuming that the one with the smaller index has lesser weight PO is selected.In the program I have used random weights.from set S1 we select the pair PO,CO
    S1 =(P0,C1),(P1,C1) and (P4,C1)
    since P0 and P4 are already used in previous set we dont use them for checking in S1 so we have (P1,C1) as best.
    S2=(P0,C2),(P1,C2) and (P4,C2) so we dont use P0,C2 and P1 and C2 because PO and P1 are already used in S1.
    So we choose P4,C2
    in S3 and S4 ae have (P0,C3),(P1,C3),(P4,C3) so we dont choose anything
    and same in S4 also.
    So answer is
    (P0,C0),(P1,C1) and (P4,C2).
    My program is trying to assign weights and I am trying to print the weights along with the sets.It doesnt work fine.I need help to write this program to do this.
    Thanks.
    Regards.
    NP
    What I have tried till now.
    I have one more question could you help me with this.
    I have an array list of this form.
    package mypackage1;
    import java.util.*;
    public class DD
    private  int P;
    private  int C;
    private int weight;
    public void set_p(int P1)
    P=P1;
    public void set_c(int C1)
    C=C1;
    public void set_weight(int W1)
    weight=W1;
    public int get_p()
    return P;
    public int get_c()
    return C;
    public int get_x()
    return weight;
    public static void main(String args[])
    ArrayList a=new ArrayList();
    ArrayList min_weights_int=new ArrayList();
    ArrayList rows=new ArrayList();
    ArrayList temp=new ArrayList();
    Hashtable h=new Hashtable();
    String v;
    int o=0;
    DD[] d=new DD[5];
    for(int i=0;i<4;i++)
    d=new DD();
    for(int i=0;i<4;i++)
    d[i].set_p(((int)(StrictMath.random()*10 + 1)));
    d[i].set_c((int)(StrictMath.random()*10 + 1));
    d[i].set_weight(0);
    System.out.println("Producers");
    for(int i=0;i<4;i++)
    System.out.println(d[i].get_p());
    System.out.println("Consumers");
    for(int i=0;i<4;i++)
    System.out.println(d[i].get_c());
    System.out.println("Weights");
    for(int i=0;i<4;i++)
    System.out.println(d[i].get_x());
    for(int i=0;i<4;i++ )
    int bi =d[i].get_c();
    ArrayList row=new ArrayList();
    for(int j=0;j<4;j++)
    if( d[j].get_p() >=bi)
    d[j].set_weight((int)(StrictMath.random()*10 + 1));
    row.add("(" + bi + "," + d[j].get_p() + "," +d[j].get_x() + ")");
    else
    d[j].set_weight(0);
    row.add("null");
    rows.add(row);
    System.out.println(rows);
    int f=0;
    for(Iterator p=rows.iterator();p.hasNext();)
    temp=(ArrayList)p.next();
    String S="S" +f;
    h.put(S,temp);
    String tt=new String();
    for(int j=0;j<4;j++)
    if(temp.get(j).toString() !="null")
    // System.out.println("In if loop");
    //System.out.println(temp.get(j).toString());
    String l=temp.get(j).toString();
    System.out.println(l);
    //System.out.println("Comma matches" + l.lastIndexOf(","));
    //System.out.println(min_weights);
    f++;
    for(Enumeration e=h.keys();e.hasMoreElements();)
    //System.out.println("I am here");
    int ii=0;
    int smallest=0;
    String key=(String)e.nextElement();
    System.out.println("key=" + key);
    temp=(ArrayList)h.get(key);
    System.out.println("Array List" + temp);
    for( int j=0;j<4;j++)
    String l=(temp.get(j).toString());
    if(l!="null")
    System.out.println("l=" +l);
    [\code]

    In your example you selected the pair with the greatest
    distance from the first set, and the pair with the least
    distance from the second. I don't see how the distance
    function was used.
    Also it's not clear to me that there is always a solution,
    and, if there is, whether consistently choosing the
    furthest or the closest pairs will always work.
    The most obvious approach is to systematically try
    all possibilities until the answer is reached, or there
    are no possibilities left. This means backtracking whenever
    a point is reached where you cannot continue. In this case
    backtrack one step and try another possibility at this
    step. After all possible choices of the previous step,
    backtrack one more step and so on.
    This seems rather involved, and it probably is.
    Interestingly, if you know Prolog, it is ridiculously
    easy because Prolog does all the backtracking for you.
    In Java, you can implement the algorithm in much the same
    way as Prolog implementations do it--keep a list of all the
    choice points and work through them until success or there
    are none left.
    If you do know Prolog, you could generate lots of random
    problems and see if there is always a solution.

  • Dynamic Forms and Flowing subforms -- Need help/Advice

    Hello All -
    I am creating a form for instructors at our college to complete. It has 3 pages, some static text, some required drop-down boxes, and three "comment" type areas which I would like to create so that they "flow" and display the entire contents when printed.
    I've read everything I could find so far, but I think I am missing something quite basic.
    I've created master pages, with a content subform on each one. I've placed all my content into subforms under that main content subform, named and ordered them the way they need to be. Most of it should appear as positioned. Only where there is one of the comment sections do I want/need the "flow content" option.
    I tried following the directions I found in another thread. If I set the subform with the comment area to flow, then I never get the page break option (and it is needed) - it's always grayed out. When I try to set the underlying subform on the page to 'flow content', ALL of the content from all three pages ends up on one page, everything on top of each other.
    What am I doing wrong?
    Can anyone give me some tips as to where at least to start looking for what I've not done or done wrong?
    Thanks in advance for any information -- it will be soooo appreciated!
    Lauren

    Hi Lauren,
    You only need one Master page, and there's no need to put anything on it unless you want a header/footer that repeats on each page.
    If you want to have things flow from page to page, create one body page object, and set its content type to Flowed (the body page is itself a subform). In it you put subforms with text, fields, and so on in them. Since your form will spill from page to page based on how much text the instructors type into the expandable comments fields, break up the forms content into sections (subforms) such that the layout can break between the subforms without taking away from the readability. These subforms should have a content type of Position. Even though there's only one body page object in your design, since you have three pages worth of stuff, it will spill onto three pages.
    Now for the comments fields, which you want to wrap and expand. Make sure that each of your comments fields is in its own subform. Set the field to allow multiple lines and, in the layout tab, click the box to Expand to Fit (height). For the subform that contains the comments field, set the height to auto-fit (layout tab). Also for the subforms that contain comments fields, experiment with the "Allow Page Breaks Within Content" checkbox on the Subform tab. If you expect an instructor to blab on for more than an entire page of text, you will have to select this box, but otherwise I suggest leaving it unselected so that the entire comment remains together.
    Jared Langdon
    www.jlangdon.ca

  • JTree Problem - Need help

    Hi,
    I am using a JTree to which I have set my own TreeModel and TreeSelectionListener (overidden all the methods for both). Wehn I add a new node to the tree, the node appears but the text for the node does not.
    (e.g if the text is "ABCD", what appears is "AB..."). I called a tree.repaint(). It does not solve my problem.
    A tree.updateUI() does solve my problem, but it throws a NullPointerException on every selection in the tree. I am trying to refresh the tree in the selSelection() method of the selection model.
    Is there any other way?
    Thanks in advance,
    Achyuth

    Try adding this when you add a node. Don't have time to check it so not quite sure its what you're looking for but I remember having this prob before and I think this is what I did:
    EventListener[] listeners = ((DefaultTreeModel)tree.getModel()).getListeners(TreeModelListener.class);
    for (int i = 0; i < listeners.length; i++) {
              ((TreeModelListener)listeners).treeNodesChanged(new TreeModelEvent(this, new TreePath(node.getPath())));
    Alex

  • The update and other problems PLEASE HELP!!!

    The ovi store on my phone asked me to download the newer version which I did, is there an update for ovistore on the computer because I haven't heard about it if there is one and it may solve the problems I have been having with it:
    1. I don't receive the messages when trying to get an app
    2. It wont let me down load apps when I connect my phone to the computer
    (also on the nokia website it told me to click the download and install button to get an app when plugged into the computer but I can't find it..Any ideas where it is???)
    please help i've had this problem since I first set up my account and its really bugging me now!!!!!!

    (Apologies for barging in Steve.)
    These ones are typically caused by underlying problems on the PC that also often cause Windows Updates to fail to install. If we can fix the Windows Update trouble, we can usually get the iTunes trouble cleaned up en passant.
    Go into your Windows update and try to check for new updates. If updates install, stock up on the ones you're behind on, restarting the PC if requested to do so. After the restart, try installing iTunes again. Does it go through this time for you?
    If windows updates fail to install, go into your Update History and doubleclick the failures. What alphanumeric codes appear for you? Are they also 80071A91, or some other number? (If they're another number, what number are you getting?)

  • Movies and Audio Problem - PLEASE HELP!!!!!

    Hi,
    If I am working on the music for a movie file i sometimes open a new project with no global tracks, so as i can focus on the music, when i then choose to open the movie and see what the music sounds like with the movie all is fine..... until i stop the movie. If the movie is not playing or doesnt have the volume slider raised high (on the movie window), no sound is heard when i press a key on my midi keyboard. This means i can only come up with ideas when the movie is playing. If i close the movie and/or the global tracks, the problem remains the same. I have to close logic an reopen it in order for me to hear any sounds (audio tracks and midi). Any advice or help would be great as this is really frustrating me. Thanks, Ben

    I use Logic Plug ins and Korg/Steinberg plug ins. I have a multi instrument set up in my environment for an external Korg Trinity Keyboard. It is no longer connected as it was too difficult to control program changes etc and recording in audio takes too long for me. This many be the problem??? Maybe i could remove the multi and see if this helps. I am thinking of re-connecting the Korg to my computer but am not sure if it will cause more problems. Any advice? Thanks... Ben

  • Zen Vision:M problem, NEED HELP!

    My zen vision:m is starting to run slowly. It started right after my player froze and i reset it.Now its really slow and barely even switches screens sometimes.Right now its just a black screen with the keypad lit up.Whats wrong with it'sI NEED HELP!

    johnnnyp wrote:
    hi, i have a problem with my creative vision m. i wanted to watch a movie and it froze. i tried to shut it down but it wouldnt respond, and now is frozen. please help me if you can!
    You know its kinda rude to derail XBenzinoFla thread with your own problems, make your own thread next time.
    But to the both of you especially XBenzinoFla, try putting your ZVM in rescue mode and run scan disk to see if it hel
    ps.

  • Zen Micro problem need help

    Today i was listening to music and my zen micro just froze while playing and no buttons could be pressed and the lock button wasnt on. So i took the battery out and rebooted the player but it froze at the creative screen. I went home and i went to recovery mode and tried to reload the firmware but it said erasing firmware for more than 2 hours. So then i tried a format but it said formating for the same amount of time. I need help please. Also, recently i've had problems witht the headphone jack. When ever i would stick it in it would sound distorted and i would have to move it around until i got it to a certain spot to hear it good again. If anyone else has this problem please tell me. One more thing i had returned my other micro zen in for hard dri've probems and this was my new one do u think if i have to return in (hopefully not) that they would accept it.

    If the functions in Rescue Mode aren't working properly then you need to contact Creative Support.

  • Reporting AGent problem need help immediately

    I have schedule a job everyday for reporting agent. Which includes 6 reports init with precalculated webtemplate. The reason to use this is that everyday morning the job will run before users use those reports and it will add that in cache so even if users run that reports first time it will be faster in performance.
    Once the job is done i can see those entries in cache memory. But when I run the report its not using cache. it takes forever to execute for the first time. after running the report on web i checked the cache entries and i saw strange thing that when i run the report for the first time its replaces the previous entry of that report from cache with the current one. (eg. Reporting Agent job was finished at 4:00am in the morning - i could see the queries in cache memory with my id and time stamp 4:00am. But when i run the report at 7:00am it takes longer time and after running the report if i check cache entry for that perticular report i dont see 4:00am entry instead of that i see 7:00am entry)
    Can some one tell me why its acting weird ??
    FYI: When i created reporting agent setting  there are 4 options (checkbox) under calculate section:
    1. Data
    2. HTML for Web Browser
    3. HTML for Pocket IE
    4. Excel
    in above options i just selected "Data" - will it might be the reason when i run the query on web its not using cache for the first time ??
    Message was edited by:
            Keral Smith

    Also check the SAP Note <a href="https://websmp110.sap-ag.de/form/handler?_APP=01100107900000000342&_EVENT=REDIR&_NNUM=0000751402&nlang=E">751402</a> and the SAP Note <a href="https://websmp110.sap-ag.de/form/handler?_APP=01100107900000000342&_EVENT=REDIR&_NNUM=962651&_NLANG=E">962651</a>.
    <b>Symptom</b>
    The reusability of the cache is poor when the "Not changeable during query navigation" variable setting is set. A preliminary calculation is not useful in this case.
    <b>Other terms</b>
    OLAP, cache, cache key, cache entries, reusability, reusage
    preliminary calculation, variable not changeable during query navigation
    <b>Reason and Prerequisites</b>
    The various entries for each variable setting have different keys for "Not changeable during query navigation".
    <b>Solution</b>
    The key for queries in the OLAP cache comprises the following: "query", "variables not changeable during navigation" and "selection hierarchies".
    To reuse cache entries, the cache always returns complete value sets that have already been precalculated and stored or subsets of these value sets. For reusage, the cache can only find subsets of value sets that have already been precalculated and stored if the key for the subset is a subset of the key for the value set that has already been calculated.
    If the setting for query variables is set to "Not changeable during query navigation", a separate cache entry is created at the "Variables/hierarchies" cache level for each query selection. To enable this reusage, you must select exactly the same variable selection, since this results in the relevant key. In this case, a similarity check was performed in the cache for a query at variable level. In practice, a preliminary calculation is executed with the "*" variable selection. Usually, a user will choose another variable selection to be output. When you set the variables to "Not changeable during query navigation", you cannot reuse the precalculated value since the key does not correspond.
    If the "Changeable during query navigation" variable setting is selected for a query, the variables are no longer part of the "Hierarchy/Variable" key, but rather the selection conditions (which are one cache hierarchy level lower). Therefore, the same "Hierarchy/variable" subtree for the query is selected for each variable selection (if the entry has already been calculated and stored) and checked to see whether the value set (or a subset) is considered to be a resulting set. If a value set with "*" was now selected with the preliminary calculation, this could be reused by selecting and returning the relevant value set for the subselection.
    For increased reusability, the variable setting should be set to "Changeable during query navigation" and the preliminary calculation should take place with "*".
    However, you should note that the preliminary calculation must have selected actual supersets. The OLAP processor only examines subset relationships in the cache. The system does not search and "merge" several different cache entries to determine the results of a query (therefore a multi-dimensional approach is not possible either).

Maybe you are looking for