Stuck with classpath problem

class HelloWorldApp {
       public static void main(String[] args)
                  System.out.println("Hello World!"); // Display the string.
                  JarClassLoader jcl=new  JarClassLoader("test-jcl.jar");
}i have above program code in HelloWorldApp.java file
this program is kept in directory /home/vipin/JCL/
in the same directory i have two jar file jcl.jar and test-jcl.jar
content of jcl.jar file is as
META-INF/
META-INF/MANIFEST.MF
jcl.properties
log4j.properties
xeus/
xeus/jcl/
xeus/jcl/AbstractClassLoader.class
xeus/jcl/ClasspathResources.class
xeus/jcl/Configuration.class
xeus/jcl/JarClassLoader.class
xeus/jcl/JarResources.class
xeus/jcl/JclObjectFactory.class
xeus/jcl/exception/
xeus/jcl/exception/JclException.class
and content of test-jcl.jar is as
META-INF/
META-INF/MANIFEST.MF
log4j.properties
xeus/
xeus/jcl/
xeus/jcl/test/
xeus/jcl/test/Test.class
and i am compiling my HelloWorldApp.java as
javac -classpath /home/vipin/JCL\ LIBRARY/jcl.jar HelloWorldApp.java
but it gives error as:
HelloWorldApp.java:7: cannot resolve symbol
symbol  : class JarClassLoader
location: class HelloWorldApp
                  JarClassLoader jcl=new  JarClassLoader("test-jcl.jar");
                  ^
HelloWorldApp.java:7: cannot resolve symbol
symbol  : class JarClassLoader
location: class HelloWorldApp
                  JarClassLoader jcl=new  JarClassLoader("test-jcl.jar");what goes wrong with me?

Vipin_Dahiya wrote:
but it gives error as:
HelloWorldApp.java:7: cannot resolve symbol
symbol  : class JarClassLoader
location: class HelloWorldApp
JarClassLoader jcl=new  JarClassLoader("test-jcl.jar");
^
HelloWorldApp.java:7: cannot resolve symbol
symbol  : class JarClassLoader
location: class HelloWorldApp
JarClassLoader jcl=new  JarClassLoader("test-jcl.jar");what goes wrong with me?"cannot resolve symbol" is the compiler's way of saying "I don't know what JarClassLoader is!" You need to import JarClassLoader so that you can use it in your program.
Remember to use the full name of the class in your import statement. And make sure whatever jar file it lives in is included as part of the classpath you use when compiling the program.

Similar Messages

  • Still stuck with report problem

    Hi guys,
    As you said i downloaded crystal report and ireport.I tried to connect my database to ireport.i got it.i can view my report .but now i dont know how to call the jxrml file from jsp.i googled alot but couldnot find anything suitable for a jsp beginner.Please help me to solve this.I am in a dead end.

    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.

  • Stuck with grub problem (SOLVED)

    Today i tried to upgrade my Arch Linux, it downloaded everything that should be downloaded, it was installing upgrades but at the installing grub it stucks as like this
    "Copying /boot/grub/grub.cfg.pacsave to /boot/grub/grub.cfg"
    I've waited it for about 15 minutes, it didn't move on. So i did ctrl+z to break. Then i tried to update again. But it gives an error which is:
    error: failed to commit transaction (conflicting files)
    python: /usr/bin/2to3 exists in filesystem
    Error occured, no packages were upgraded.
    Please help me guys!
    Last edited by bilgee0629 (2011-03-21 10:36:28)

    Problem solved by moving 2to3 to other directory.

  • In and not in - stuck with exclusion problem

    From the following data
    ID REF_NUM FLAG
    L000304T 117930 M
    L001538N 126199 R
    L001538N 126191 M
    L006339H 150427 N
    L008519X 139085 R
    L008519X 139075 M
    L008579J 402452 R
    L008579J 144668 M
    L008579J 402429 R
    L043884W 447519 R
    L043885H 303383 C
    L043886X 303383 R
    The valid records are those with R
    We want to delete only those records with the IDs are in valid record but REF_NUM is not corresponding to that valid id.
    e.g in the above case
    L001538N 126199 R --- is valid hence
    L001538N 126191 M -- is invalid, to be deleted
    similarly the other invalid records to be deleted are
    L008519X 139075 M
    L008579J 144668 M
    We tried the query below, it is doesnt work.
    select *
    from FLAG_LKP del
    Where del.REF_NUM not in
    (select sel.REF_NUM -- selects all records with FLAG as R
    from FLAG_LKP sel
    where sel. FLAG = 'R'
    and sel.ID = del.ID)
    The catch is that in the outer query you should not use del.FLAG<> R because it is arrived through join with multiple tables, so if we include del.FLAG<> R, then it is repeating the logic in the inner sub-query in a reserve fashion.

    The catch is that in the outer query you should not use del.FLAG<> R because it is arrived through join with multiple tables,
    Clarification - I have put FLAG = R so as to present the problem simply. Actually the selection criteria (which will replace FLAG = R) results from a multiple table join.
    To put FLAG <> R in outer query would be to replicate the multi table join which I don't want

  • Stuck with array problem

    Hi, I am new to programming with C # and wondering if
    anyone can help me with one thing.
    The only thing I got is this array of letters, but need to sort them
    int[] letters = { "c", "s", "a", "k", "x", "l", "j" };
    and then print and save the array in alphabetical order.
    But the thing is that I never have converted the letters to INT wich I
    would need to do in order to sort them with bubble sorting and
    then convert back to letters to print and save in the right
    order.
    How will this code / program look like? The whole thing.
    Thanks and much appreciated for help!
    If you want more information, ill answer as quick is possible!

    Almost the same code works even for bubble sorting strings. Just use the string.Compare method instead of the > operator:
    string[] letters = { "c", "s", "a", "k", "x", "l", "j" };
    string temp;
    for (int write = 0; write < letters.Length; write++)
    for (int sort = 0; sort < letters.Length - 1; sort++)
    if (string.Compare(letters[sort],letters[sort + 1]) == 1)
    temp = letters[sort + 1];
    letters[sort + 1] = letters[sort];
    letters[sort] = temp;
    And for chars:
    char[] letters = { 'c', 's', 'a', 'k', 'x', 'l', 'j' };
    char temp;
    for (int write = 0; write < letters.Length; write++)
    for (int sort = 0; sort < letters.Length - 1; sort++)
    if (letters[sort] > letters[sort + 1])
    temp = letters[sort + 1];
    letters[sort + 1] = letters[sort];
    letters[sort] = temp;
    Once again, please remember to mark helpful posts as answer to close the thread once you original question has been answered and start a new thread if you have a new question.
    Thank you, and i got a few more questions about this before ill mark this thread as answered.
    That codes u just sent me, whats the different between them, the string and char? They almost
    look the same except the string and char part.
    And then im wondering, how will i write down so i can see the results when im debugging it?
    Is it with Console.Write or WriteLine? I can't remember.

  • Please Help Me - I am stuck with this problem for days

    O.k I have posted couple of problems here. But the latest one is as follows
    I trying to pass a Stiring Array from Java function to my native method. the native function in turn invokkes another function that takes a char [][] as its parameter. My native function basically converts teh jobjectarray into char [][] and then invoke the other function.
    JNIEXPORT jboolean JNICALL
    Java_copilotplus_DataTransferTab_GetStatus
    (JNIEnv *env, jobject o, jobjectArray fn, jlongArray size)
    char szStr[8][33];
    int len = env->GetArrayLength( fn );
    int i=0;
    for( i=0; i < len; i++ )
    jobject obj = env->GetObjectArrayElement(fn, i);
    jstring str = (jstring)obj;
    szStr[33] = (char)env->GetStringUTFChars( str, 0 );
         //*file = szStr[i];
    BOOL status = Upload(szStr);
    return status;
    BOOL Upload(char pFileName [][33])
         return TRUE;
    Now this compiles fine and makes a dll
    But when I run my java program it gives me this error
    HotSpot Virtual Machine Error, EXCEPTION_ACCESS_VIOLATION
    # Please report this error at
    # http://java.sun.com/cgi-bin/bugreport.cgi
    # Error ID: 4F533F57494E13120E43505002D4
    What am I doing wrong
    Please Help
    Vaishali

    The problem was that I did not ahve any actual values in the String Array. I was doing like this initially
    String []file = new String[8]
    and then when i pass file to the dll it was trying to read something which was not there. That's why it was crashing.
    But now I put some values in it and then it works fine.

  • Stuck with a problem while inserting a record into infotype

    Hi Gurus,
    I have to insert all active record into 378 infotype. At particular pernr hr_operation_infotype is throughing with an error stating 'E00                  058Entry    does not exist - check your entry' . How to rectify it.
    Ravi

    error message is 'E00                  058Entry    does not exist - check your entry            '
    My code is as follows
      INFOTYPES : 0378.
      DATA: BEGIN OF abc1 OCCURS 0,
                  pernr   TYPE pa0000-pernr,
                  stat2   TYPE pa0000-stat2,
                  begda   TYPE pa0000-begda,
            END OF abc1.
      DATA lt_pernr_pa0000 LIKE TABLE OF abc1.
      DATA ls_pernr_pa0000 LIKE  abc1.
      DATA l_subrc LIKE sy-subrc.
      DATA l_return LIKE bapireturn1 VALUE ' '.
    DATA begda LIKE sy-datum.
      DATA endda LIKE sy-datum.
      CLEAR: ls_pernr_pa0000, lt_pernr_pa0000.
      SELECT  pernr stat2 begda
        INTO  CORRESPONDING FIELDS OF TABLE lt_pernr_pa0000
        FROM pa0000
        WHERE  stat2 = '3' AND endda = '99991231'  and pernr = 198.
      LOOP AT lt_pernr_pa0000 INTO ls_pernr_pa0000.
        REFRESH p0378.
        CALL FUNCTION 'HR_READ_INFOTYPE'
             EXPORTING
                  pernr           = ls_pernr_pa0000-pernr
                  infty           = '0378'
                  endda           = '99991231'
             IMPORTING
                  subrc           = l_subrc
             TABLES
                  infty_tab       = p0378
             EXCEPTIONS
                  infty_not_found = 1
                  OTHERS          = 2.
        IF l_subrc = 0.
          IF p0378-event = 'open' AND p0378-subty = 'open' AND
                        p0378-pernr = ls_pernr_pa0000-pernr.
            EXIT.
          ENDIF.
        ELSE.
    locking the pernr ********************
          CALL FUNCTION 'BAPI_EMPLOYEET_ENQUEUE'
               EXPORTING
                    number        = ls_pernr_pa0000-pernr
                    validitybegin = ls_pernr_pa0000-begda
               IMPORTING
                    return        = l_return.
    change the end date to 12/31/2007*************
          IF l_return-number IS INITIAL.
            p0378-pernr = ls_pernr_pa0000-pernr.
            p0378-endda = '99991231'.
            p0378-begda = '20070909'.
            p0378-subty = 'OPEN'.
            p0378-event = 'OPEN'.
            p0378-barea = 'US'.
            MODIFY p0378 INDEX 1  TRANSPORTING pernr endda begda subty event
                barea.
            CALL FUNCTION 'HR_INFOTYPE_OPERATION'
                 EXPORTING
                      infty         = '0378'
                      number        = ls_pernr_pa0000-pernr
                      record        = p0378
                      operation     = 'INS'
                 IMPORTING
                      return        = l_return.
          ENDIF.
    unlocking the pernr ********************
          IF l_return-number IS INITIAL.
            COMMIT WORK AND WAIT.
          ELSE.
            ROLLBACK WORK.
            EXIT.
          ENDIF.
          CALL FUNCTION 'BAPI_EMPLOYEET_DEQUEUE'
               EXPORTING
                    number        = ls_pernr_pa0000-pernr
                    validitybegin = ls_pernr_pa0000-begda
               IMPORTING
                    return        = l_return.
        ENDIF.
      ENDLOOP.
    ENDFUNCTION.

  • Im stuck with this problem. I have lots of strings each linked with

    another string value. I want to store all of them somehow and then sort them out alphabetically while retaining the link between them and the second string value.
    basically I have a set of string values called displayname which i want to sort alphabetically and then display. Each display name is linked to another string called featureobjectcode. When i sort and display them i want that link between the two string to be there so that i can display the string name and the corresponding featureobjectcode.

    can u demonstrate its implementation by showing me an example of how the code would look like?

  • Stuck with intersecting paths and shaped gradients - instructions requested

    Hi guys,
    I'm new to this forum as this is my first post here, but I'm stuck with a problem in Illustrator and haven't been able to find the specific solution in other places on the net so far.
    Please have a look at the following design (can't seem to get the image up on this forum):
    http://www.mediafire.com/?pq7mjm4yx65r5cv
    This design has been first created in GIMP and now I want to redo it in Illustrator. I'm using CS6. I haven't been using Illustrator for very long, and I can't seem to get this part right.
    The areas highlighted in red (the shadows) are the major issue. To be able to get a 'folded' effect, I would like to apply subtle shadows on the visible areas of the lower ribbons, where they intersect with the ones on top, as the sample illustrates.
    I don't know how to achieve this effect. This is what I have tried so far:
    - Simple drop shadows, but of course they run outside of the visible areas of the ribbons.
    - I have also tried rectangular selections with a gradient from black to transparent, but for some reason those look right on the silver part of the design, but turn out brown-ish on the blue part. Besides, this is a lot harder to do on the curved sections you can see in the middle.
    Is there a simple way to do this in Illustrator? I have a gut feeling the solution lies somewhere in the pathfinder tool and/or clipping masks, but I'm not really confident as to how to make those work for me.
    As a secondary issue, I would like to get the same 1px bevel/emboss effect as the sample image shows. I have tried the 3D effect in Illustrator, but I can't get the right result that way. What would be the best way to do this?
    I would really appreciate it if someone could write me some short step-by-step instructions for this.
    Below is the sample file for Illustrator. It only has the main shapes and the general colors applied and nothing else.
    CS6 version: http://www.mediafire.com/?skpgfsmy2hxqi6s
    CS5 version: http://www.mediafire.com/?gxxix6el5wcnaad
    My infinite thanks in advance for any help given.
    ~ ID Graphics.

    Start with your simple drop shadows, and then use a clipping mask. Group your letters, and make a copy of the group. Femove shadows from the copy andhange the copy to a black fill. Apply the mask like this: All the unwanted parts of the shadow will be hidden.

  • Help with sales problem

    i need help finding the minimum and maximum sale, and print it saying "Salesperson 3 (or whoever) had the highest sale with 3560 (some amount)" and do the same for the minimum. i thought i had the right code to find it but i cant get it to work. can anyone tell me what i did wrong?
    import java.util.Scanner;
    public class Sales
         public static void main(String[] args)
              final int SALESPEOPLE = 5;
              int[] sales = new int[SALESPEOPLE];
              int sum;
              Scanner scan = new Scanner(System.in);
              for (int i=0; i<sales.length; i++){
              System.out.print("Enter sales for salesperson " + i + ": ");
              sales[i] = scan.nextInt();}
              int salesTotal = sales.length;
              int salesAverage = salesTotal / 5;
              System.out.println(salesAverage);
              System.out.println("\nSalesperson Sales");
              System.out.println("--------------------");
              sum = 0;
              int maxSale = sales[0];
              int minSale = sales[0];
              int maxNum = 0;
              int minNum = 0;
         for (int i=0; i < sales.length; i++)
              System.out.println(" " + (i) + "           $" + sales);
              sum += sales[i];
              if(sales[i] > maxSale);{
              maxSale = sales[i];
              maxNum = i;}
              if(sales[i] < minSale);
              minSale = sales[i];
              minNum = i;
              System.out.println("\nTotal sales: $" + sum);
              int average = sum / 5;
              System.out.println("\nThe average sale was: $" + average);
              System.out.println("Salesperson " + maxNum + " had the highest sale with " + maxSale);
              System.out.println("Salesperson " + minNum + " had the lowest sale with " + minSale);

    im now stuck with this problem:
    "After the list, sum, average, max and min have been
    printed, ask the user to enter a value. Then print
    the id of each
    salesperson who exceeded that amount, and the amount
    of their sales. Also print the total number of
    salespeople whose
    sales exceeded the value entered."
         if(sales[i] > value){
                        int personExceed = sales;
                        int exceedNum = i;
    System.out.println("Salesperson " +
    personExceed + " exceeded $" + exceedNum);
    is my code for printing out whats in bold right?
    Not quite. sales[i ] represents the $ amount of sales for salesperson number i. You want to loop over each salesperson's sales amount, and if it was higher than the given value, print out that person's:
    - salesperson id  (i)
    - amount of sales (sales[ i])
    Each time a person's sales exceed the given value, increment a counter. After you finish looping through the sales figures, print out that counter to show how many people exceeded the value.                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                       

  • Stuck with problems and no help

    hi,
    We are stuck with the following set of problems. Repeated entries to this forum have not fetced any response. If anybody can help us on any of these issues, please reply -
    1. We are not able to define any custom validator. We made our own validator that extends CompareValidor, but when we try to apply this rule to an attribute in the validation tab, we get the error - "no properties defined". Do i need to do something else besides creating a new class that extends CompareValidator and then writing my own code in the vlaidate method.
    2. While deploying our jspApplication on java web server, we are getting the message "error - null". The details are as mentioned in the Topic 'can anyone help!!!' that has been posted by Prabhdeep ().
    3. I have two tables, Customer and address. There is no FK between them (there cannot be because address is shared between many entities). In the address, i have 2 fields, BpType and BpId. BpType will contain 'C' to identity that this address is for a customer and id will have the customer id. In jdev 3.1, i have created entity and view objects for the 2 tables. also, i have made a view link. i need to put the condition Address.bpid = customer.customeid and address.bptype = 'c'. but it is not letting me put the second part of the condition. the chk on id works fine. as soon as i add a chk on type and test the application module, then while insertion of address i get the following error - "set method for BpType cannot be resolved".
    4. I have made a jsp appl based on bc4j. now, i need to put a check on any entity in such a manner that if the check fails, my jsp should ask the user that an exception is occuring and does he want to save even with the exceptional data. if he says yes, i want that the same entity should now save the data without giving an exception. How do i achieve this interaction between my entity and my jsp.
    Thanks a lot for any help,
    Aparna.

    I will answer Question #3:
    I'm not sure if I understand exactly what is
    happening. At first I thought you meant that you couldn't even add the second part of the association clause. But, later it sounds like you were able to add the second part of the clause (namely "address.bptype =
    'c'") and that you are experiencing some runtime error.
    Assuming the latter (that it is a RT problem), I take it this
    "...cannot be resolved" error is the error with code 27020.
    Under normal error conditions, you shouldn't get this error. Something "unusual" (or unforeseen by us) is happening if you are getting this error. Anyway, if you wrote your own client code, you should wrap a try/catch block around it, pick out the detail exception, and see what's going
    on. See the example code below:
    try
    ... make call that causes the exception ...
    catch(oracle.jbo.AttrSetValException ex)
    // Print stack trace for the outer ex
    ex.printStackTrace();
    // Get the inner exception
    Object[] details = ex.getDetails();
    if (details.length > 0)
    Exception innerEx = (Exception) details[0];
    // Now, print the inner exception's
    // stack.
    innerEx.printStackTrace();
    This will help shed some light on the exception and the cause of it.
    John - JDeveloper Team

  • Could apple send me an iPad air. All my friends are making fun of me because I'm stuck with the old device and no phone. I've had app problems with apple before so I think that it would only be fair to get a newer device. Thank You Apple

    Could apple send me an iPad air. All my friends are making fun of me because I'm stuck with the old device and no phone. I've had app problems with apple before so I think that it would only be fair to get a newer device. Thank You Apple

    First we aren't Apple just normal users just like you.
    Second provide Apple a feedback or send them a mail.
    Third they will never send you a free iPad Air.
    If you want one you have to buy it. (go for refurbished if the device is too expensive) or look for special prices.
    Contact iTunes support if you have a problem with an App.

  • 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.

  • HT1933 Tried iTunes Store directive for reporting a problem. Got an ERROR message every time. Stuck with a NY Times app that won't recognize my subscription.

    Tried iTunes Store directive for reporting a problem. Got an ERROR message every time. Stuck with a NY Times app that won't recognize my subscription.called Apple and was told by an automated message to...use the ITunes Store directive.
    Can someone point me in the right direction.

    Hello atransient,
    Thanks for the question, that definitely sounds frustrating to encounter errors at the most important times.
    Let's see if the online Report a Problem works any better for you:
    http://reportaproblem.apple.com
    Thanks,
    Matt M.

  • My "fn" button is stuck on only revealing mission control in Lion. With this problem none of my "f" keys will work nor can I hold "fn" and delete to delete text in opposite direction. Can someone please help with this?

    My "fn" button is stuck on only revealing mission control in Lion. With this problem none of my "f" keys will work nor can I hold "fn" and delete to delete text in opposite direction. Can someone please help with this?

    Following the fix here worked for me:
    https://discussions.apple.com/message/15680566#15680566
    except my plist file was in ~/Library instead of /Library.
    -Scott

Maybe you are looking for