Skip to main content

Getting Deer Park Alpha 1 extensions

I've finally decided to test Mozilla Deer Park Alpha 1 (Firefox 1.1a1). The browser is really cool. They've changed the icon/logo--this is sometimes confusing. Apart from that, the major problem is incompatibility with existing extensions--which can mostly be solved by bumping targetApplication's maxVersion.

I did bumping for few extensions, but finally decided to search for a bit. Interestingly I found few wonderful resources; the best among is 'Unarmed' of mozillaZine forum's PHP script and his online service. The online bumping service is really great; it gets the URL of the extension and the version to be applied in the GET and gives you the bumped/hacked extension. Many extensions worked well--including the popular Web Developer / Webdeveloper extension ; sadly the HTML Validator extension didn't work even after bumping.

Having heavily inspired by the online bumping service, I have written a bookmarklet to access the service. I think the PHP script can be improved especially to handle redirect with CURLOPT_FOLLOWLOCATION. Anyway, it's a nice idea that PHP is used for repackaging XPI; that is to unpack/unzip the XPI files using PEAR Archive_Zip, fix the maxVersion in install.rdf and then packing/zipping it.

Bookmarklet

Links

Comments

Anonymous said…
I believe the icon is just for nightly, alpha and beta builds. So expect the icon to revert to its former self in the final 1.5 version.
Jul 28, 2005, 2:56:00 AM
R. Rajesh Jeba Anbiah said…
Joel Kitching:

Thanks for the info. Anyway, now I'm used up with Deer Park Alpha icons:)
Jul 28, 2005, 10:14:00 AM
Anonymous said…
Those people at google sure are nasty when it comes to version checks. I've tried every possible way I could find, but still haven't been able to get the new google toolbar working under Deer Park...
Oct 6, 2005, 3:06:00 PM
Post a Comment

Popular posts from this blog

"A to Z of C" in the book Cimple (ISBN 0070260982)

I was just searching "A to Z of C" in Google Books and found that the book Cimple written by Sasant K Rout has used our code. The irony is that the book was published by Tata McGraw-Hill , who rejected us in final stage stating that it wants us to get endorsement from any IIT professor, which we couldn't. (For the sake of record... IIT Bangalore was linking & supporting "A to Z of C" for long time once it's published over the net; see old IIT page from web.archives.org ) It's just another incident to prove that success isn't a measurable unit; even failed attempts can be appreciated in any other forms.
5 comments
Read more

Interview question #1

Since I have been asked to interview experienced PHP programmers, I was preparing few interview questions. I came to know, most of the people ask questions found in the Internet; most of them are like "What is the function used to connect MySQL DB in PHP". Personally, I don't like these types of questions; I'd thought the person must apply ideas what he was taught in colleges--finally I came out with one question: A product vendor has Quantity Vs. Price data like 1 -> Rs. 50 2 -> Rs. 95 3 -> Rs. 140 .... like upto 1 million data. He wants a system, which gives the price when the quantity is provided. For example, if you provide the quantity value as 2, then it should provide Rs. 95. How this system can be designed? As expected, all the people said about using database tables and quering on quantity. I have asked them to find out a system which doesn't use databases--provided the accuracy of the system may not be 100%--it may give at least 90% ac...
7 comments
Read more

Interview question #2

This is related to PHP's array . An array has number of elements. All elements are integers and unique, which means there is no repetitive integers. (e.g.) $foo = array(7, 5, 9, 13, 2, 8); You have to sort the array, provided: You should scan the elements only once. You're not allowed to compare the elements when sorting. (i.e., you're not supposed to use any comparison operators) Sorted resultant array may not be the source array. How will you do that?
6 comments
Read more