Safari's iWeb pages much worse than Firefox!?

Why does Safari show a much worse (darker, pixilated) version of my iWeb pages than Firefox? Firefox is a true respresentation of my iWeb website - in colour and layout, Safari isn't. Any suggestions?

Hi..
If you are not awrare, iWeb will not longer be available starting June 30th, 2012.
Read here >  Apple - MobileMe - MobileMe transition and iCloud
For help with the site dissimilarity in browsers, post your topic in the iWeb forum here. That way you can receive feedback directly from iWeb users.
You can also ask about options for web hosting for your site after June 30th.

Similar Messages

  • Official Apple reseller says "iPhone 5s's camera is much worse than the other"

    Hi Apple support and fans,
    I am writing to ask you and maybe get Apple's attention to what happened to me. I bought an iPhone 5s 8 days ago. I bought it from official Apple reseller in Warsaw, the capital city of Poland. And then my adventures began.
    First, the plug is British, not Polish, because as the reseller said "we have some iPhone not from official distribution, but it will work". Because I needed to buy an iPhone5s fast, I accepted that. However, the question is still there - is it legal to sell British iPhones "from unofficial distribution channel" in Poland?
    Second, and more important, my iPhone 5s makes horrible blurred pictures. I mean they are really blurred... I read all the posts on this forum and I tried everything. Finally I decided to visit the reseller and here is what their representative said: "These pictures are totally fine. They are blurred, as this is not a professional camera". Wow! What a discovery. I know that this is not a professional camera, but I know how photos from an iPhone (4 and 4s) might look like. So I replied that something is strange and I wanted to give my iPhone back to check it (under warranty). The representative replied: "We will not take it, and I'm telling you the pictures are all fine. The camera in iPhone 5s is much worse than it was in iPhone 4s and hence the blurred photos. Just live with that". 
    And now my questions:
    1. Is it true that the pictures must be blurred in iPhone 5s, just because it works so? I can't bvelieve it.
    2. Isn't the fact that they sell iPhones from "unofficial channels" the reason why they don't want to take the iPhone under warranty?
    If anyone from Apple wants to take a closer look at this issue and maybe discover some "strange" actions from Polish official Apple reseller, I'm open to provide you much more details on the purchase, the store location, etc.
    Looking forward to hearing from you,
    Kuba

    iPhones are ONLY sold by Carriers and Apple an Apple reseller is unlikely to be authorised for iPhones and certainly would not sell an iphone with a foreign plug
    You have clearly purchased a grey import a genuine Polish sourced iPhone sold by a legitimate iPhone reseller would have the correct plug for the Country
    Big issue you have is warranty you need to take to an Apple authorised repairer
    https://locate.apple.com/pl/pl/
    luckily as long as iPhone came from UK you do have warranty ,EU is one "country" for Apple warranty purposes

  • USB XFI 5.1 sounds much worse than XFI Xtreme Music

    why does the XFI 5. Surround USB sound so much worse than the internal XFI cards like the Xtreme Music? The USB version sounds really cheap despite using the same settings. I don?t think its broken, I also tried it on 2 different pcs with the same bad result. it sounds like some cheap onboard sound.

    i use windows xp SP3
    thnx

  • Safari Rendering iWeb Pages Incorrectly

    I just observed today 7/10 that Safari is incorreclty displaying iWeb Pages. On mine, as well as my friends site, who uses the same theme, Safari is drawing a thin white border around the page and showing question marks. It's not showing up this way when I look at the pages with Firefox. I'm wondering if anyone else is experiencing the same issues. Could the move to MobileMe have anything to do with this? I found the timing of this very interesting.

    Nothing has changed? The website displays correctly now and the thin white line which was present yesterday as the MobileMe transition was underway is no longer visible. Again from Apple: +MobileMe is built to work seamlessly with iWeb. You simply create your site, click Publish, and it’s online. There are no settings or configurations to remember — *MobileMe does it all behind the scenes* and all you see are the beautiful results+
    *"MobileMe does it all behind the scenes"*. We see the results of all their work behind the scenes. Well, if things I saw yesterday were wrong, isn't there a good chance that there was something wrong with the work done by MobileMe? I guess Apple is lying here since according to you, MobileMe is a service and has nothing to do with web pages being displayed. They were attempting to do it all behind the scenes yesterday and as you are aware, things weren't running too smoothly. Today I managed to log into MobileMe just fine which I was able to do only once yesterday. And guess what? My website also displays correctly today! But as you say...one has nothing to do with the other. Whatever dude...
    A bit of advice... A less haughty and condescending tone in your responses towards users who post legitimate questions and concerns about Apple related issues, would be appreciated by all. That beind said...I'm done and have wasted enough time going back and forth with you.

  • None of any of the pictures on Facebook can be opened and seen on the website, I have absolutely no problem on Safari, but I would much rather use Firefox..What the heck is going on????

    About a week ago, I had no problem clicking on pictures to open them to bigger size.....As of about 4 days ago - If I try to open a picture on Facebook, it shows the comments but no picture..I don't know what is going on!!! It works fine on Safari, but I would much rather use Mozilla for my own selfish reasons, WHAT THE HECK IS GOING ON????? ( I'VE TRIED EVERYTHING!!!!!)
    == This happened ==
    Every time Firefox opened
    == About a week ago.....

    I agree the phones are supposed to come with the battery and battery door missing that is policy of every wireless company. The problem is that the rep that you spoke with wasn't being as thorough as they could have been to ensure that you got complete equipment, is was a processing error from the first representative. Most of the information for exchanging a phone is auto completed by the computers as well so when the rep processes the exchange they don't have any say so as to what is actually in the shipping box so being that you didn't activate the droid 3 on your account when you called in about the missing battery and complained the computer only recognized the droid x because that probably what you had activated on your account, so that's why the second replacement was droid x equipment and not droid 3

  • Performance of Standard much worse than Premium?

    After recently using up my 60 days of the premium trial, I decided I didn't need any of the additional features of premium and decided to purchase a license for standard instead.  Everything went smoothly and once I'd upgraded to the latest AIRSDK, I was able to point to my previous workspace and all my projects built and ran fine, straight away.
    Everything was good until I went to install one of the projects onto my Android phone (16GB Nexus 4).  With the premium trial, I'd gotten accustomed to this only taking a few seconds for simple debugging, and a little longer for a release build.  Since I've come to standard this is taking *much* longer, as in 2-4 minutes on average.
    I'm still within my cancellation period for this, so I *can* take the decision to get premium instead, but the financial hit is... unwanted.  If it is a case that the performance of standard is plain and simply just *worse* than premium, I may choose to go back to that, but I'd like to be 100% and get confirmation of that, before doing so.

    From here:
    http://www.adobe.com/products/flash-builder/faq.html
    "Why use Flash Builder Premium Edition over Flash Builder Standard Edition?
    Flash Builder 4.7 Premium adds professional testing tools, including profilers, network monitoring, an automated testing framework, integration with Flex unit testing, and command-line build support"
    The only thing I could think of would be the command-line support. If Premium builds with the command line and Standard version doesn't that might explain the speed differences - but that seems very odd for them to do. If you deactivate your key I think it restarts your trial and if you restart Flash Builder it should load in Premium mode so you could try that and see if it builds faster. (You can always reactivate your standard key later with no issues since you just deactivated it before this)

  • Premiere Pro CC and After Effects CC work slowly together - much worse than CS6

    Premiere Pro CS6 and After Effects CS6 worked together really well.  I could have both programs open and make a change in After Effects, then go back to Premiere Pro and see the changes pretty quickly.  Since upgrading both to CC, I can't jump back and forth and see the changes quickly.  I literally have to hit Enter and render the After Effect clip after every freakin' time I make a change to it in order to see it without any pauses or jumpiness in the playback.  CS6 worked great.  I can't express my disappointment in the Creative Cloud "upgrade".   So many things are SO MUCH WORSE!!!   Adobe you have to fix this stuff.

    The speed of the connection is dependent on your hardware and the type of comp you have in AE.
    I haven't noticed any significant performance difference between the two versions (I've also been heavily using dynamic link since CS6 ).
    Some comps will play fine in Premiere, some comps will need rendering. I generally render the clip in Premiere, as opposed to AE.
    If the same comp from CS6 is behaving significantly worse in CC, then you might be on to something, but it is most likely a bug isolated to your hardware config and not a general CC issue.

  • Finished iMovie picture quality much worse than when creating movie

    created a movie recently.  Mostly stills.  Some video.  Stills were from a mix of iPhone, Droid phone and from professional photographer.  I "finished" the movie, sent it to iDVD, and burned it to DVDs.  The quality looks horribly digital-y.  I thought maybe that's because I viewed it on my wide screen HDTV but when I play the DVD on my iMac the results are the same.  The finished product is almost unwatchable.
    The quality in the finished movie is WAY worse than in the original photos.  Can anybody help me?

    Cgulls
    Unfortunately iMovie will downgrade the quality of any HD home movie capture due to Apples codec, AIC.  I have spent a lot of time researching this and have come to the conclusion (like many others) that iMovie is rubbish.  The way I found to produce HD footage, either by saving to DVD or .mts files is to create a Windows 7 partition on your loveable Mac, using Boot Camp and a copy of Windows 7.  I then have just trialled Corel VideoStudio Pro X5 and I will say it is fantastic and does what you want iMovie to do....HD.
    Good luck

  • IWeb pages displayed correctly in Firefox but on in Safari/Chrome

    I made a personal web page with iWeb. Now some of the pages are not displayed correctly in Safari and/or Chrome.
    Check this page for example : http://maiklohse.de/Maik_Lohse/media.html
    There are 6 YouTube videos embedded in the page. They all will show up if you use Firefox - but not with Safari or Chrome. Anybody got any ideas?

    An alternative way to add so many Quicktime movie files to a page so it will load faster is to use the method in this demo page: Opening Item in a New, Precisely Sized Window. None of the movies will load until the play button is selected. That will let the page load very quickly. Right now it's glacially slow.
    OT

  • Firefox 4 is slow in loading web pages, much slower than previous version. WHY?

    I am having problems with slow loading of pages, slower than Explorer for the same page for example.
    What can be done?

    Have you tried (1) restarting your router, and (2) resetting the wifi on the iPad?  To do #2, go to Settings, General, Reset, Reset Network Settings. 

  • Firefox loads pages much slower than Chrome

    Recently switched back to using Firefox as I wasn't finding the extensions I like for Chrome only to discover that Firefox is running significantly slower by comparison. Tried uninstalling/reinstalling and it hasn't helped.

    A possible cause is security software (firewall,anti-virus) that blocks or restricts Firefox or the plugin-container process without informing you, possibly after detecting changes (update) to the Firefox program.
    Remove all rules for Firefox and the plugin-container from the permissions list in the firewall and let your firewall ask again for permission to get full unrestricted access to internet for Firefox and the plugin-container process and the updater process.
    See:
    *https://support.mozilla.org/kb/Server+not+found
    *https://support.mozilla.org/kb/Firewalls
    Create a new profile as a test to check if your current profile is causing the problems.
    See "Creating a profile":
    *https://support.mozilla.org/kb/profile-manager-create-and-remove-firefox-profiles
    *http://kb.mozillazine.org/Standard_diagnostic_-_Firefox#Profile_issues
    There may be extensions and plugins installed by default in a new profile, so check that in "Tools > Add-ons > Extensions & Plugins" in case there are still problems.
    If the new profile works then you can transfer some files from the old profile to that new profile, but be careful not to copy corrupted files.
    *http://kb.mozillazine.org/Transferring_data_to_a_new_profile_-_Firefox

  • I have been a user of Firefox for a long time but it seems to have gotten really slow. IE will open web sites much faster than firefox on all 3 of my computers. Is there something wrong, boged down or do I need to reinstall it?

    It seems that it is taking twice as long for firefox to open the same websites as ie. I run updates but seems to just be taking a long time for it to open sites and I can open with IE in much less time?
    == URL of affected sites ==
    http://

    These issues are usually a result of many extensions. Try [[Troubleshooting extensions and themes]]

  • Is analogue much worse than digita

    Can you actually hear the difference between an analogue signal and a digital signal ?
    What type of cable/output is optimal for perfect sound quality ? Optical ?

    pjc wrote:
    My hearing is just fine thank you very much jmperoo.
    Are you sure it's not just the placebo effect making your digital signals sound that much better?
    Nice to see you have a sense of humour.
    Perhaps you would like to explain how analogue can sound better when its influenced by even the tiniest bit of noise in the interconnects, seeing as a jack plugs very nature is unshielded digital will sound better most of the time, then again some people do prefer slightly muddier sound.
    Digital signals are far more resilient to noise by they're very nature. Seeing as the creative stuff doesn't allow you to put some decent quality interconnects on them (the jack plug sockets are to close together) then for creatives stuff having analogue interconnects is a bit of a bum deal.
    As to fiber optics yep your right having a three mile run of tos-link would probably be unfeasible if you were using standard plastic cored interconnects, but if you needed to go just 20 metres then the plastic core would make little if any difference to the sound. IIRC plastic cored tos-link cable has a huge drop-off in signal after 25 metres.
    It also doesn't contain any electrical signals or is in any way vulnerable to any emi that might be around, ok if your DAC's on your device are poor or you are trying to pump to much stuff down it, it will suffer more problems than a cable, but then you would be talking about 25 channels at 6khz and 6 bits before you start to run out of bandwidth with tos-link. So bandwidth isn't really that much of an issue.
    I suppose in the end its what sounds good to you, I could say that a system that is able to pick out the breathing of any nearby technicians in the recording studio is a nice system, but you could take a instant dislike to it, but then this is where a lot of people come to argue about different systems.

  • LV threading 8.5 much worse than 8.2??? (or is it VISA or NIDAQmxbase?)

    I have an application that is heavily threaded and has multiple (ie 6 or more) parallel loops.  I recently migrated this from LV 8.2.1 to LV 8.5.1.  With one exception (bad control that crashed LV) it upgraded fine.  However performance has degraded immensely!!!!  This program does multiple serial I/O, GPIB I/O, DAQ, Digital I/O etc. all in different loops.
    The DAQ used to loop at a 1 second time and keep up with 80 kHz on 32 channels (6033 board).  Now it doesn't keep up most of the time at 16 kHz and I am plagued by buffer overruns.  This is 5 times slower and still not keeping up.   This is a dual CPU system and has almost maxed out one of the CPUs now.
    I have also migrated from VISA 4.2 to 4.4 and NIDAQmx base from 3.0 to 3.2.  This is all under Mac OS X just so folks don't suggest using regular NIDAQmx.  The VISA updates are minor and should not affect this as are the NIDAQmx updates.
    Any ideas as to why the simple upgrade from 8.2.1 to 8.5.1 would result is such a terrible loss of performance?

    Actually the loops are all on an independent 1 second cycle.  There is very little data passed between loops.  Mostly written to a local array.  One slow loop (ie 15 minute cycle) writes to a data log file from that array.  Others do independent PID etc.  One checks and pages operators.
    The only synchronization is an occurance that I use to create an interruptible wait in the loops of 1 second.
    Ben,
    Yes, I open the DAQ reference and don't close it ever.  In fact this is one of the large problems with NIDAQmx base.  I have to have the data acquired continuously and then read it.  If I keep the reference but "restart" the DAQ every loop it re-initializes the hardware and is VERY slow.  So I actually start the DAQ outside the loop.  I then read continuously, when there is the inevitable buffer overrun, the DAQ stops and I detect this error and restart it in this case.  But that is a good point and was a BIG problem in moving from old DAQ to NIDAQmx base when I upgraded from LV 5.1 to LV 8.0!
    This app has exposed many weaknesses in LV since I wrote it as a massively parallel system back in 199X (Started in LV 3 and finished in LV 5.1).  Since then I have made minimal tweaks as it upgraded to newer hardware and newer LV.
    At the moment I am suspecting the Asynchronous VISA calls.  I have found that Asynchronous VISA calls actually chew up CPU more than Synchronous ones.  (Yes I did not reverse the terminology).  An asynchronous VISA call actually internally spins a poll on the I/O and uses a lot of CPU time.  A synchronous call just blocks that thread.  Since it is in maintenance mode there may be something that is unplugged and taking a long time to timeout and locking up the CPU.
    Today's project is to run the profiler and find the VISA calls (there should be only 4 of them) and mess with the async vs. Sync setting.  Also to crank up the number of threads allocated to the execution systems.  ASFAIK this system ran perfectly fine yesterday with LV 8.2 and is now having buffer overruns with LV 8.5.   This was supposed to be a simple upgrade.  Of course I have all the old stuff saved and can back out.

  • Performance of synchronized blocks on Linux much worse than on Windows

    Our application is a J2EE application currently deployed in WebLogic 6.1 which utilizes Oracle iFS as a content store. We access the iFS CMS through the api's provided in the cmdsk.jar. Our reference implementation has been Solaris and that's where most of our testing has been done so far. However, we recently began doing performance tests on Linux and ran into a strange problem. We found that we were not getting sufficient throughput and that this was coupled with underutilization of CPU resources on the Application Server (AS) node. With sufficient DB resources, which we had in this case, we expect to see full CPU utilization on the AS tier, so we knew something was wrong.
    A great deal of investigation revealed that all active threads were stuck at the same spot accessing an iFS cache. We found that this cache is implemented as a hashtable and accesses to hashtables are synchronized. However, we were not seeing the same problem on other platforms (Solaris and Windows) with dual CPU machines.
    In order to simplify things, we developed a test program to look at what we felt to be the root cause. This test program, which I will attach, essentially creates a hashtable then a number of threads (as specified by the user). These threads then use the hashtable.get method to access the hashtable concurrently and time how long it takes. The info is then returned at the end of the run.
    We ran a set of tests where we increased the number of threads from 1 to 100. This test was run once with Windows 2000 and once with Red Hat Linux 2.1 (kernel 2.4.9-e.12). The exact same hardware (dual 1.2 GHz PIII) was used in both cases. The results show that we were clearly able to reproduce the behaviour with this simple program. What these results show is that with one thread, access times are exactly the same for Windows and Linux. However, as we increase the number of threads, access times for Linux increase at a much greater rate than Windows. We also see underutilization of CPU resources on Linux while Windows uses all available.
    The first round of tests was run with Sun's JDK 1.3.1. We repeated the testing with 1.4.1 and found that there was no significant difference. I just tried it quickly with 1.4.2 and found the behaviour to be much the same. We also altered the program to use an unsynchronized hashmap instead of a hashtable and, as expected, performance on Linux was much better. CPU was fully utilized during the test.
    In order to determine if this was a problem "in the VM" or "in the kerenel", I tried repeating it with the JRocket VM provided by WebLogic. When running the same test with the JRocket VM, we saw performance roughly equivalent to what we saw with a hashmap and the Sun VM. That is, JRocket did not have the same problem as the Sun VM.
    So, it appears that there is something with the implementation of synchronized blocks in the Sun VM that is problematic, especially when compared to other platforms. It is likely that the problem lies in a combination of how the synchronization is implemention is based on the underlying operating system infrastructure. At this point, we don't really have a way to deal with the problem, aside from deploying multiple WebLogic nodes on the same 2 CPU physical AS node. Changes to the iFS infrastructure would help, but that's beyond our control. I've searched the bug database and have not seen mention of this problem. With the test program, it can be easily reproduced, but I wanted to run it by the folks on this list before submitting a bug.
    Thanks,
    Justin

    # File #1: Driver.java
    import java.io.*;
    import java.util.HashMap;
    import java.util.Hashtable;
    * Created on May 13, 2003
    * @author llai
    * Driver to test the access of hash table on various platforms.
    public class Driver
         public static void main(String[] args)
              * Obtain the following input values:
              * 1. Number of Elements
              *      - The number of elements in the hash table
              * 2. Size of Element
              * - The size of each element in the hash table
              * 3. Number of threads
              * - The number of concurrent threads in the test
              * 4. Focused Access
              * - Determines whether each thread access the same element or a random element
              * 5. Number of Accesses
              * - The number of accesses which each thread will complete before exiting
              * 6. Start offset
              * - The number of accesses at the beginning which will not be timed
              * 7. End offset
              * - The number of accesses at the end which will not be timed.
              * Initialize all input variables.
              * SET DEFAULT VALUES HERE...
              int numberOfElements = 10000;
              int sizeOfElement = 100;
              int numberOfThreads = 25;
              boolean focusedAccess = true;
              int numberOfAccesses = 1000000;
              int startOffset = 100000;
              int endOffset = 100000;
              boolean mapOrTable = false;
              * Input number of elements.
              try
                   BufferedReader in =
                        new BufferedReader(new InputStreamReader(System.in));
                   String tempInput;
                   boolean inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter a non-negative value for the number of elements to be in the hashtable: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfElements = Integer.parseInt(tempInput);
                                  if (numberOfElements >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of elements. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of elements. Try again.");
                   * Input size of elements.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter the size of each element in the hash table (ie. length of a string): ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  sizeOfElement = Integer.parseInt(tempInput);
                                  if (sizeOfElement >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the size of elements. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the size of elements. Try again.");
                   * Input number of threads.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter the number of concurrent threads in the test: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfThreads = Integer.parseInt(tempInput);
                                  if (numberOfThreads >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of threads. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of threads. Try again.");
                   * Input focused access option.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Focused access? Determines whether each thread access the same element or a random element (y/n or blank for default): ");
                        String tempFocusedAccess = in.readLine();
                        if (tempFocusedAccess.equals("y"))
                             focusedAccess = true;
                             inputInvalid = false;
                        else if (tempFocusedAccess.equals("n"))
                             focusedAccess = false;
                             inputInvalid = false;
                        else if (tempFocusedAccess.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             System.out.println(
                                  "You entered an invalid input for focused access. Try again.");
                   * Input number of accesses.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Enter a non-negative value for the number of accesses each thread will complete: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  numberOfAccesses = Integer.parseInt(tempInput);
                                  if (numberOfAccesses >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered a negative value for the number of accesses per thread. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the number of accesses per thread. Try again.");
                   * Input start offset.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print("Enter the start offset: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  startOffset = Integer.parseInt(tempInput);
                                  if (startOffset <= numberOfAccesses
                                       && startOffset >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered an invalid input for start offset. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the start offset. Try again.");
                   * Input end offset.
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print("Enter the end offset: ");
                        tempInput = in.readLine();
                        if (tempInput.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             try
                                  endOffset = Integer.parseInt(tempInput);
                                  if (endOffset <= numberOfAccesses && endOffset >= 0)
                                       inputInvalid = false;
                                  else
                                       System.out.println(
                                            "You entered an invalid input for end offset. Try again.");
                             catch (NumberFormatException nfe)
                                  System.out.println(
                                       "You entered an invalid value for the end offset. Try again.");
                   * Create a Hashtable, or a Hashmap?
                   inputInvalid = true;
                   while (inputInvalid)
                        System.out.print(
                             "Use HashMap or HashTable (enter m for HashMap, t for HashTable)? ");
                        String tempMapTable = in.readLine();
                        if (tempMapTable.equals("m"))
                             mapOrTable = true;
                             inputInvalid = false;
                        else if (tempMapTable.equals("t"))
                             mapOrTable = false;
                             inputInvalid = false;
                        else if (tempMapTable.equals(""))
                             System.out.println("default value used.\n");
                             inputInvalid = false;
                        else
                             System.out.println(
                                  "You entered an invalid input. Try again.");
              catch (IOException i)
                   System.out.println("IOException caught: " + i.getMessage());
              * End of obtaining input section. *****
              * Create a HashTable or HashMap of the size and distribution specified.
              Object hash;
              if (mapOrTable)
                   // create a HashMap
                   hash = new HashMap(numberOfElements);
              else
                   // create a HashTable
                   hash = new Hashtable(numberOfElements);
              char c[] = new char[sizeOfElement];
              for (int i = 0; i < numberOfElements; i++)
                   if (mapOrTable)
                        ((HashMap) hash).put(new Integer(i), new String(c));
                   else
                        ((Hashtable) hash).put(new Integer(i), new String(c));
              c = null; // Explicitly release c.
              * Create the specified number of threads.
              AccessorThread accessor[] = new AccessorThread[numberOfThreads];
              long seed;
              for (int i = 0; i < numberOfThreads; i++)
                   // Have a different seed for creating random number for each thread.
                   seed = System.currentTimeMillis() + 77 * i;
                   accessor[i] =
                        new AccessorThread(
                             hash,
                             numberOfElements,
                             focusedAccess,
                             numberOfAccesses,
                             startOffset,
                             endOffset,
                             seed);
                   // Start the thread.
                   accessor.start();
              * Make main wait for all threads to die before continuing.
              try
                   for (int i = 0; i < numberOfThreads; i++)
                        accessor[i].join();
              catch (InterruptedException ie)
                   System.out.println(
                        "InterruptedException caught: " + ie.getMessage());
              * Threads have now been run, so create a statistical report.
              System.out.println(
                   "The following settings were used for this test: \n"
                        + "Number of elements: "
                        + numberOfElements
                        + "\n"
                        + "Size of elements: "
                        + sizeOfElement
                        + "\n"
                        + "Number of threads: "
                        + numberOfThreads
                        + "\n"
                        + "Focused access: "
                        + focusedAccess
                        + "\n"
                        + "Number of accesses: "
                        + numberOfAccesses
                        + "\n"
                        + "Start offset: "
                        + startOffset
                        + "\n"
                        + "End offset: "
                        + endOffset);
              System.out.print("HashMap or HashTable: ");
              if (mapOrTable)
                   System.out.println("HashMap.\n");
              else
                   System.out.println("HashTable.\n");
              System.out.println("Statistic report: ");
              long avgTime;
              long avgTotalTime = 0;
              for (int i = 1; i <= numberOfThreads; i++)
                   avgTotalTime += accessor[i - 1].getAccessTime();
                   avgTime = accessor[i - 1].getAccessTime() / numberOfAccesses;
                   System.out.println(
                        "Thread "
                             + i
                             + "... "
                             + accessor[i
                             - 1].getStatus()
                             + " Total access time: "
                             + accessor[i
                             - 1].getAccessTime()
                             + " ms. Avg individual access time: "
                             + avgTime
                             + " ms.");
              avgTotalTime = avgTotalTime / numberOfThreads;
              // Make it an average over all threads.
              System.out.println(
                   "\nThe average total access time over all threads: "
                        + avgTotalTime
                        + " ms.");
    File#2: AccessorThread.java
    import java.util.Hashtable;
    import java.util.HashMap;
    import java.util.Random;
    * Created on May 13, 2003
    * @author llai
    * Threaded class that accesses a hashtable a certain number of times
    * and measures the access time for a certain number of accesses.
    public class AccessorThread extends Thread
         private Object hash;
         private int numberOfElements;
         private boolean focusedAccess;
         private int numberOfAccesses;
         private int startOffset;
         private int endOffset;
         private long seed;
         private long totalAccessTime;
         private String status;
         * Constructor
         * @param h the Hashtable or HashMap
         * @param keyToAccess the key to access for this thread
         * @param numberOfAccesses the number of access times
         * @param startOffset the start offset
         * @param endOffset the end offset
         public AccessorThread(
              Object h,
              int numberOfElements,
              boolean focusedAccess,
              int numberOfAccesses,
              int startOffset,
              int endOffset,
              long seed)
              this.hash = h;
              this.numberOfElements = numberOfElements;
              this.focusedAccess = focusedAccess;
              this.numberOfAccesses = numberOfAccesses;
              this.startOffset = startOffset;
              this.endOffset = endOffset;
              this.seed = seed;
              status = "Status: alive.";
         * @return the total access time.
         public long getAccessTime()
              return totalAccessTime;
         * @return the status of the thread.
         public String getStatus()
              return status;
         * @return the seed.
         public long getSeed()
              return seed;
         * Run method, accesses the hashtable at keyToAccess for
         * numberOfAccesses times, and measures the response time for
         * a certain number of those accesses.
         public void run()
              * Begin accessing the table, time only after startOffset accesses,
              * and only up to (numberOfAccesses - endOffset) accesses.
              * Access one value if focusedAccess on.
              * Access random values if focusedAccess off.
              Random numGenerator = new Random(seed);
              if (focusedAccess)
                   Object keyToAccess =
                        new Integer(numGenerator.nextInt(numberOfElements));
                   // Access without timing for the first startOffset accesses.
                   int i;
                   // Check if hash is a HashMap or Hashtable.
                   if (hash instanceof HashMap)
                        for (i = 0; i < startOffset; i++)
                             ((HashMap) hash).get(keyToAccess);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((HashMap) hash).get(keyToAccess);
                             i++;
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((HashMap) hash).get(keyToAccess);
                             i++;
                   else if (hash instanceof Hashtable)
                        for (i = 0; i < startOffset; i++)
                             ((Hashtable) hash).get(keyToAccess);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((Hashtable) hash).get(keyToAccess);
                             i++;
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((Hashtable) hash).get(keyToAccess);
                             i++;
              // Or else !focusedAccess, therefore access random values.
              else
                   * Get random keys to access and store in an array of Integer objects.
                   * Limit the array to 1000 integer objects.
                   int numberOfRandomInts = numberOfAccesses;
                   if (numberOfAccesses > 1000)
                        numberOfRandomInts = 1000;
                   Integer keysToAccess[] = new Integer[numberOfRandomInts];
                   for (int q = 0; q < numberOfRandomInts; q++)
                        keysToAccess[q] =
                             new Integer(numGenerator.nextInt(numberOfElements));
                   int i;
                   if (hash instanceof HashMap)
                        for (i = 0; i < startOffset; i++)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                        // Stop the timing.
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((HashMap) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                   else if (hash instanceof Hashtable)
                        for (i = 0; i < startOffset; i++)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                        // Now start timing for the accesses.
                        long startTime = System.currentTimeMillis();
                        while (i < numberOfAccesses - endOffset)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
                        // Stop the timing.
                        long stopTime = System.currentTimeMillis();
                        totalAccessTime = stopTime - startTime;
                        // Finish accessing the remainder of endOffset times if endOffset is not >= (numberOfAccesses - startOffset).
                        while (i < numberOfAccesses)
                             ((Hashtable) hash).get(keysToAccess[i % numberOfRandomInts]);
                             i++;
              status = "Status: dead.";
    # File #3: run.sh
    echo Compiling the program...
    javac Driver.java AccessorThread.java
    export CLASSPATH=.
    echo Running the program...
    java Driver

Maybe you are looking for

  • Ipod touch 1st gen wont turn on passed apple logo

    Ok so i have an ipod touch 1st generation that wont turn on passed the apple logo screen. Like a week ago it shut down cuz it ran outta battery cuz i didnt notice my charger wasnt plugged into the wall properly. So i plugged it in and had to spend li

  • SQL Server Plug-in

    I have installed the following software on windows 2000 server. Oracle Enterprise Manager 10g Grid Control Release 1 (10.1.0.3) for Windows Oracle Enterprise Manager 10g Grid Control Management Agent (10.2.0.1) for windows I am not able to configure

  • Where are the audio books in iTunes 11

    I downloaded iTunes 11, and now everything is "new". and I don't see any audio books (in german: Hörbücher) in the sidebar - and in the settings, there is no checkbox for this genre. Who can help?

  • Gap in Sequence

    Hi, I created a sequence and a trigger for autonumber, as a primary key in my CAND_PERSONAL_INFO table. Every time i insert a row in the table, i get long gaps between my autonumber. I don't understand why cant i get a series of numbers without any g

  • After upgrading iPad my apps won't open?  How can I fix this?

    My apps won"'t open on my I pad after I upgraded.  How can I fix this?