IBM is putting its corporate heft behind a popular open-source Web development technology called PHP, in a move meant to reach out to a broader set of developers.
Maand: februari 2005
IBM and Zend come together on PHP
IBM is putting its corporate heft behind a popular open-source Web development technology called PHP, in a move meant to reach out to a broader set of developers.
Mozilla Firefox 1.0.1 Released
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
Mozilla Firefox 1.0.1 has just been released. A minor update, this version fixes a few security holes and some other bugs. If you’re using Firefox 1.0, you want this release. The Firefox Release Notes have also been updated and The Burning Edge has an unofficial Firefox 1.0.1 changelog. Download links can be found on the official Firefox product page. You can also check the full article for some BitTorrent links.
Update: We’ve been asked to point you towards bittorrent.mozilla.org for the BitTorrent links.
Another Update: At the demand of the Mozilla Foundation, we’ve removed the direct links to the Firefox 1.0.1 FTP directory. Go to www.mozilla.org/products/firefox/all.html to see all the builds. We understand using the download links on the mozilla.org site places less strain on the servers due to the mirroring configuration.
Mozilla Firefox 1.0.1 Released
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
Mozilla Firefox 1.0.1 has just been released. A minor update, this version fixes a few security holes and some other bugs. If you’re using Firefox 1.0, you want this release. The Firefox Release Notes have also been updated and The Burning Edge has an unofficial Firefox 1.0.1 changelog. Download links can be found on the official Firefox product page. You can also check the full article for some BitTorrent links.
Update: We’ve been asked to point you towards bittorrent.mozilla.org for the BitTorrent links.
Another Update: At the demand of the Mozilla Foundation, we’ve removed the direct links to the Firefox 1.0.1 FTP directory. Go to www.mozilla.org/products/firefox/all.html to see all the builds. We understand using the download links on the mozilla.org site places less strain on the servers due to the mirroring configuration.
Mozilla Foundation reaches an agreement with AOL on DevEdge content
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
The Mozilla Foundation has reached an agreement with America Online that allows them to host and improve the former Netscape DevEdge content.
Mitchell Baker has posted a blog entry stating that Deb Richardson will join Mozilla Foundation as a technical editor and project manager of DevMo. DevMo is the new community-based project focussed on developer documentation and resources.”
Mozilla Foundation reaches an agreement with AOL on DevEdge content
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
The Mozilla Foundation has reached an agreement with America Online that allows them to host and improve the former Netscape DevEdge content.
Mitchell Baker has posted a blog entry stating that Deb Richardson will join Mozilla Foundation as a technical editor and project manager of DevMo. DevMo is the new community-based project focussed on developer documentation and resources.”
Summary of Upcoming Mozilla Releases
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
Several new Mozilla versions are scheduled for release soon, including updates to Mozilla Firefox, Mozilla Thunderbird and the Mozilla Application Suite. Yesterday, Asa Dotzler summarised the release plans in a newsgroup posting to netscape.public.seamonkey.
First off the blocks is likely to be Mozilla Firefox 1.0.1, which will come from the 1.7 branch. It will contain a variety of bug fixes and security updates but no new features. However, due to the nature of the fixes included, Firefox 1.0.1 will be an essential upgrade for all users of 1.0. We’re expecting the release within hours but if you just can’t wait, Firefox 1.0.1 release candidate builds are available.
Next up is likely to be Mozilla 1.8 Beta 1, coming straight from the trunk. A more cutting-edge release, 1.8b1 will be the first non-alpha version to feature the major internal changes that have been completed since 1.7 branched, including many substantial improvements to Gecko.
Mozilla Thunderbird 1.0.1 is set for the middle of next week. Like Firefox 1.0.1, this is a minor update but recommended for all 1.0 users.
Mozilla 1.7.6 is also due for release next week too but it’s below Firefox 1.0.1 and Thunderbird 1.0.1 on the priority list. Another maintenance upgrade, 1.7.6 will contain many of the same fixes that will be in Firefox 1.0.1 and Thunderbird 1.0.1.
In around three weeks, the trunk will freeze for Mozilla 1.8 Beta 2, which is expected to be the final beta release of the 1.8 cycle. The Firefox 1.1 Developer Preview will be released off the trunk around this time. Following the release of 1.8b2, the trunk will stay frozen until the 1.8 branch is cut. This branch will be the basis of the final Firefox 1.1 and Thunderbird 1.1 versions, which are expected around the middle of this year. See our previous 1.8 release scheduling article for more details.
As always, anybody who sees an critical problem in an in an imminent release should contact drivers@mozilla.org.
Summary of Upcoming Mozilla Releases
mozillaZine – Your Source for Daily Mozilla News and Advocacy:
Several new Mozilla versions are scheduled for release soon, including updates to Mozilla Firefox, Mozilla Thunderbird and the Mozilla Application Suite. Yesterday, Asa Dotzler summarised the release plans in a newsgroup posting to netscape.public.seamonkey.
First off the blocks is likely to be Mozilla Firefox 1.0.1, which will come from the 1.7 branch. It will contain a variety of bug fixes and security updates but no new features. However, due to the nature of the fixes included, Firefox 1.0.1 will be an essential upgrade for all users of 1.0. We’re expecting the release within hours but if you just can’t wait, Firefox 1.0.1 release candidate builds are available.
Next up is likely to be Mozilla 1.8 Beta 1, coming straight from the trunk. A more cutting-edge release, 1.8b1 will be the first non-alpha version to feature the major internal changes that have been completed since 1.7 branched, including many substantial improvements to Gecko.
Mozilla Thunderbird 1.0.1 is set for the middle of next week. Like Firefox 1.0.1, this is a minor update but recommended for all 1.0 users.
Mozilla 1.7.6 is also due for release next week too but it’s below Firefox 1.0.1 and Thunderbird 1.0.1 on the priority list. Another maintenance upgrade, 1.7.6 will contain many of the same fixes that will be in Firefox 1.0.1 and Thunderbird 1.0.1.
In around three weeks, the trunk will freeze for Mozilla 1.8 Beta 2, which is expected to be the final beta release of the 1.8 cycle. The Firefox 1.1 Developer Preview will be released off the trunk around this time. Following the release of 1.8b2, the trunk will stay frozen until the 1.8 branch is cut. This branch will be the basis of the final Firefox 1.1 and Thunderbird 1.1 versions, which are expected around the middle of this year. See our previous 1.8 release scheduling article for more details.
As always, anybody who sees an critical problem in an in an imminent release should contact drivers@mozilla.org.
An Introduction to Code Access Security
Introduces a .NET Framework security system called Code Access Security (CAS), which helps centralize trust decisions.
An Introduction to Code Access Security
Introduces a .NET Framework security system called Code Access Security (CAS), which helps centralize trust decisions.
An Extensive Examination of Data Structures Using C# 2.0
This is a six-part article series that focuses on important data structures and their use in application development. Scott Mitchell examines both built-in data structures present in the .NET Framework, as well as essential data structures we’ll build ourselves.
Editor’s Note: This six-part article series originally appeared on MSDN Online starting in November 2003. In January 2005 it was updated to take advantage of the new data structures and features available with the .NET Framework version 2.0, and C# 2.0. The original articles are still available at http://msdn.microsoft.com/vcsharp/default.aspx?pull=/library/en-us/dv_vstechart/html/datastructures_guide.asp.
An Extensive Examination of Data Structures Using C# 2.0, Part 1
Scott Mitchell examines two of the most commonly used data structures present in the .NET Framework: the Array and List.
Scott Mitchell examines two of the most commonly used data structures present in the .NET Framework: the Array and List.
An Extensive Examination of Data Structures Using C# 2.0, Part 2
Scott Mitchell delves into three of the most commonly studied data structures: the Queue, the Stack, and the Hashtable. He goes on to explain the pros and cons of each individual data structure.
Scott Mitchell delves into three of the most commonly studied data structures: the Queue, the Stack, and the Hashtable. He goes on to explain the pros and cons of each individual data structure.
An Extensive Examination of Data Structures Using C# 2.0, Part 3
Scott Mitchell looks at a common data structure that is not included in the .NET Framework Base Class Library, binary trees. A binary search tree, or BST, allows for a much more optimized search time than with unsorted arrays.
Scott Mitchell looks at a common data structure that is not included in the .NET Framework Base Class Library, binary trees. A binary search tree, or BST, allows for a much more optimized search time than with unsorted arrays.
An Extensive Examination of Data Structures Using C# 2.0, Part 4
Scott Mitchell provides a quick examination of AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
Scott Mitchell provides a quick examination of AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
An Extensive Examination of Data Structures Using C# 2.0, Part 5
Scott Mitchell espouses on graphs, a collection of nodes and edges with no rules dictating the connection among the nodes, and one of the most versatile data structures.
Scott Mitchell espouses on graphs, a collection of nodes and edges with no rules dictating the connection among the nodes, and one of the most versatile data structures.
An Extensive Examination of Data Structures Using C# 2.0, Part 6
Scott Mitchell examines how to implement a common mathematical construct, the set, which is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.
Scott Mitchell examines how to implement a common mathematical construct, the set, which is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.
An Extensive Examination of Data Structures Using C# 2.0
This is a six-part article series that focuses on important data structures and their use in application development. Scott Mitchell examines both built-in data structures present in the .NET Framework, as well as essential data structures we’ll build ourselves.
Editor’s Note: This six-part article series originally appeared on MSDN Online starting in November 2003. In January 2005 it was updated to take advantage of the new data structures and features available with the .NET Framework version 2.0, and C# 2.0. The original articles are still available at http://msdn.microsoft.com/vcsharp/default.aspx?pull=/library/en-us/dv_vstechart/html/datastructures_guide.asp.
An Extensive Examination of Data Structures Using C# 2.0, Part 1
Scott Mitchell examines two of the most commonly used data structures present in the .NET Framework: the Array and List.
Scott Mitchell examines two of the most commonly used data structures present in the .NET Framework: the Array and List.
An Extensive Examination of Data Structures Using C# 2.0, Part 2
Scott Mitchell delves into three of the most commonly studied data structures: the Queue, the Stack, and the Hashtable. He goes on to explain the pros and cons of each individual data structure.
Scott Mitchell delves into three of the most commonly studied data structures: the Queue, the Stack, and the Hashtable. He goes on to explain the pros and cons of each individual data structure.
An Extensive Examination of Data Structures Using C# 2.0, Part 3
Scott Mitchell looks at a common data structure that is not included in the .NET Framework Base Class Library, binary trees. A binary search tree, or BST, allows for a much more optimized search time than with unsorted arrays.
Scott Mitchell looks at a common data structure that is not included in the .NET Framework Base Class Library, binary trees. A binary search tree, or BST, allows for a much more optimized search time than with unsorted arrays.
An Extensive Examination of Data Structures Using C# 2.0, Part 4
Scott Mitchell provides a quick examination of AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
Scott Mitchell provides a quick examination of AVL trees and red-black trees, which are two different self-balancing binary search tree data structures. He also covers skip lists, an ingenious data structure that turns a linked list into a data structure that offers the same running time as the more complex self-balancing tree data structures.
An Extensive Examination of Data Structures Using C# 2.0, Part 5
Scott Mitchell espouses on graphs, a collection of nodes and edges with no rules dictating the connection among the nodes, and one of the most versatile data structures.
Scott Mitchell espouses on graphs, a collection of nodes and edges with no rules dictating the connection among the nodes, and one of the most versatile data structures.
An Extensive Examination of Data Structures Using C# 2.0, Part 6
Scott Mitchell examines how to implement a common mathematical construct, the set, which is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.
Scott Mitchell examines how to implement a common mathematical construct, the set, which is an unordered collection of unique items that can be enumerated and compared to other sets in a variety of ways.