General overview of web service concepts and technologies supported by NetBeans IDE. This document is meant to help newcomers to understand web services before they use any tutorials.

A short guide to configuring code assistance for a C/C++ project created from existing code in NetBeans IDE 6.5/6.7/6.8.

The NetBeans Team is pleased to announce the return of its two community testing programs, NetCAT and NetFIX, for the NetBeans IDE 6.9 release cycle. NetBeans 6.9 feature highlights include in short: NetBeans Platform OSGi interoperability Many enhancements in Editor Improved Java FX tooling Java EE 6 improvements Better PHP, Ruby & C/C++ support and much more... To help test NetBeans 6.9 development builds, report bugs and RFEs, sign up for NetCAT, our popular beta testing program. As a NetCAT participant, you provide feedback to our development team and therefore influence the stability and performance of the NetBeans IDE. The requirement is simple: if you can spare a minimum of four hours a week for the next three months, then sign up! That's not all. Our NetFIX program is looking for experienced Java developers who enjoy contributing code. Participating in NetFIX is an opportunity to have your name included in the NetBeans source code repository. For former NetCAT participants, NetFIX is also an ideal next step in contributing to the NetBeans project since you learn about NetBeans APIs in the process. So sign up today and join fellow community developers to help grow a more robust NetBeans IDE! At the end of the NetBeans 6.9 cycle, top participants in both programs receive community recognition as well as gifts from the NetBeans team. If you have any questions about either of the two programs, please contact NetBeans Community Manager Jiri Kovalsky.

Netbiscuits is the mobile publishing platform that enables eBay and many other major brands for the mobile Web. As a cloud-based software service it allows you to take advantage of its advanced technology to set up your own mobile Web projects and services. To support mobile web developers using the NetBeans IDE, we created JAM, a plug-in that facilitates coding for Netbiscuits. If you want to learn more about JAM for Netbiscuits please register for our upcoming webinar. Netbiscuits provides a 30 day free trial. After this period you can upgrade to a free of charge Developer Edition that allows you to set up an unlimited number of mobile websites. The Netbiscuits platform enables you to create and deliver web content and services easily and efficiently for any mobile device. It allows you to exploit the rich internet capabilities of high-end mobile phones like the iPhone, Android or BlackBerry devices, and also guarantees optimized delivery to the less expensive but highly popular web-enabled mass market feature phones as well.

This document is a quick demonstration of how to create a simple NetBeans Platform application. You will use Maven archetypes to create the NetBeans Platform application and module. You will use the Swing UI toolkit and "Matisse" GUI Builder to create a window component in the module.

Every NetBeans user is an evangelist! Download a copy of our latest datasheet for NetBeans IDE 6.8 and use it to help spread awareness and encourage adoption of your favorite IDE. The NetBeans IDE Datasheet is a handy reference guide for giving others information about the tool. With its concise summary of product highlights, we highly recommend it for company or university presentations, user group meetings, conferences and more. Visit the NetBeans Evangelism Presentations page for additional resources. Download the NetBeans IDE 6.8 Datasheet

Get a preview of the new hints in the Java Editor for NetBeans IDE 6.9.

Patients receive the right medication, at the right dosage and at the right time with BBraun's Outlook Safety Infusion System, built on the NetBeans Platform

An interview with Lalit Pant, the creator of Kojo, a computer learning environment for children, based on Scala and built on the NetBeans Platform.

Read this article on how to develop Mobile Websites with NetBeans IDE and Netbiscuits.

Regular expressions are one of computer science's shining examples of the benefits of good computer science theory. They were originally developed by theorists as a way to describe infinite sets, but Ken Thompson introduced them to programmers as a way to describe text patterns in his implementation of the text editor QED for CTSS. Dennis Ritchie followed suit in his own implementation of QED, for GE-TSS. Thompson and Ritchie would go on to create Unix, and they brought regular expressions with them. By the late 1970s, regular expressions were a key feature of the Unix landscape, in tools such as ed, sed, grep, egrep, awk, and lex. They remain a key feature of the open source landscape today, in those venerable Unix tools and at the core of new languages like Perl, Python, and JavaScript.

The feature-rich regular expression implementations of today are based on a backtracking search with a potential for exponential run time and unbounded stack usage. At Google, we use regular expressions as part of the interface to many external and internal systems, including Code Search, Sawzall, and Bigtable. Those systems process large amounts of data; exponential run time would be a serious problem. On a more practical note, these are multithreaded C++ programs with fixed-size stacks: the unbounded stack usage in typical regular expression implementations leads to stack overflows and server crashes. To solve both problems, we've built a new regular expression engine, called RE2, which is based on automata theory and guarantees that searches complete in linear time with respect to the size of the input and in a fixed amount of stack space.

Today, we released RE2 as an open source project. It's a mostly drop-in replacement for PCRE's C++ bindings
and is available under a BSD-style license. See the RE2 project page for details.

By Russ Cox, Software Engineering Team

The new Get Tree from Page example demonstrates how the Uize.Node.Tree.getTreeFromPage static method of the Uize.Node.Tree module can be used to build a tree data object respresenting the structure of the document, by analyzing the occurrence of different CSS classes for section headings at different depths of the document (in this case, the CSS classes level1Header, level2Header, and level3Header). A tree data object like this can be supplied to a tree menu widget, or can otherwise be used to build UI for navigating to different sections of the document (a contents tree, for example).

The new Get Tree from List example demonstrates how the Uize.Node.Tree.getTreeFromList static method of the Uize.Node.Tree module can be used to build a tree data object by analyzing the structure of a nested list defined by an HTML ul tag. A tree data object like this can be supplied to a tree menu widget, or can otherwise be used to build UI for navigating to different sections of the document (a contents tree, for example).

The new Uize.Node.Tree module provides convenience methods for generating a tree data object by analyzing HTML on a page. A tree data object is an array, where each element of the array is a Tree Item. Because a Tree Item may itself contain a child Tree Data Object, specified by its items property, a Tree Data Object can be used to represent an arbitrarily complex, hierarchical structure for information. A Tree Data Object can be used in any number of ways, but is commonly used for building tree-based user interface elements such as contents lists, structured dropdown menus, etc. A number of widget class support data in the Tree Data Object format, such as the Uize.Widget.Tree.List, Uize.Widget.Tree.Menu, and Uize.Widget.Tree.Select classes. Outside of widgets, tree data objects can be used to drive the generation of HTML, in build scripts or Web applications, using JavaScript Templates.

A number of instance and static methods of the Uize.Widget.Tree module have been deprecated and migrated into the new Uize.Node.Tree module. The getTreeFromList and getTreeFromPage instance methods, along with the Uize.Widget.Tree.getTreeFromList and Uize.Widget.Tree.getTreeFromPage static methods, have been deprecated and migrated into the Uize.Node.Tree module as Uize.Node.Tree.getTreeFromList and Uize.Node.Tree.getTreeFromPage. For backwards compatibility, the deprecated instance and static methods of the Uize.Widget.Tree class are all still supported, and will be supported for some time. All existing code using the deprecated methods should continue to work as normal. It would be wise to progressively migrate code over to using the static methods in the new Uize.Node.Tree module. In order to achieve backwards compatibility, the Uize.Widget.Tree base class now requires the new Uize.Node.Tree module. Other than that, the static methods in the new Uize.Node.Tree module have the same signature and behavior as the deprecated methods of the Uize.Node.Tree module.

The Uize.Population module has been migrated to under the Uize.Widget namespace as Uize.Widget.Population. For the most part, the interface is entirely the same and compatible with the old interface, with some very minor differences. As a widget class now, instances of the Uize.Widget.Population class must be wired (by calling the wireUi instance method) before changing the value of the items set-get property will result in an update of the contents of the instance's DOM node. Also, as a true widget class, instances of the Uize.Widget.Population class can be added as child widgets of other widget instances. Finally, the DOM node into which generated HTML is injeted can now be specified with either of the idPrefix, node, or container set-get properties. This change, which is not backwards compatible, has the benefit of further cleaning up the Uize root namespace. The two examples that were previously using the now defunct Uize.Population class, Populating Photo Details and Structured Record Population, have been updated to use the new Uize.Widget.Population class. If you were previously using the Uize.Population class, then you can use these two example pages as a reference when updating your own code.