Architecture that extends types using extension methods
Summary by NHIP
Extension Method Invocation
The method extends data models by treating static extension methods as instance methods during processing. It rewrites invocations with identifiers resolved via namespace declarations and method groups containing all accessible extension methods sharing that name.
Claim Score by NHIP
Abstract
Architecture that extends existing types including constructed and sealed types using extension methods. Extension methods are static methods that can be invoked using instance method syntax. Extension methods are declared by specifying the keyword “this” as a modifier on the first parameter of the methods. Extension methods have all the capabilities of regular static methods. In addition, once imported, extension methods can be invoked using instance method syntax. Also disclosed are rules for importing extension methods, and extension method invocations. Extension methods are imported through using-namespace-directives. In addition to importing the types contained in a namespace, a using-namespace-directive imports all extension methods in all static classes in the namespace. In effect, imported extension methods appear as additional methods on the types that are given by their first parameter and have lower precedence than regular instance methods.

Term
Term ended
Expired 17 July 2026, 0.2 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
20 claims: 3 independent, 17 dependent
- 1Broadest claimClaim Score 52, average(NHIP)A computer-implemented method of extending data model and operations without needing to modify existing codes, the method comprising:statically processing invocation of an extension method of a static type by treating the extension method as a normal instance method rather than as a method having declaration syntax;determining that static processing invocation of the extension method includes an instance method and, as a result, rewriting the instance method with at least one identifier followed by an expression;and processing the rewritten instance method as a static method invocation, except for resolving of the at least one identifier, which has special identifier processing, the special identifier processing including namespace processing that begins with a closest namespace declaration and uses a method group that includes all accessible extension methods having a name given by the at least one identifier.
- 14A computer-readable storage medium having stored thereon computer executable instructions that, when executed by one or more processors, cause a computing system to perform a method for extending data model and operations without needing to modify existing codes, the method comprising:statically processing invocation of an extension method of a static type by treating the extension method as a normal instance method rather than as a method having declaration syntax;determining that static processing invocation of the extension method includes an instance method and, as a result, rewriting the instance method with at least one identifier followed by an expression;and processing the rewritten instance method as a static method invocation, except for resolving of the at least one identifier, which has special identifier processing, the special identifier processing including namespace processing that begins with a closet closest namespace declaration and uses a method group that includes all accessible extension methods having a name given by the at least one identifier.
- 20A system for extending data model and operations without needing to modify existing codes, the system comprising:one or more processors;one or more computer-readable media having stored thereon computer-executable instructions that, when executed by the one or more processors, cause the system to: statically process invocation of an extension method of a static type by treating the extension method as a normal instance method rather than as a method having declaration syntax;determine that static processing invocation of the extension method includes an instance method and, as a result, rewriting the instance method with at least one identifier followed by an expression;and process the rewritten instance method as a static method invocation, except for resolving of the at least one identifier, which has special identifier processing, the special identifier processing including namespace processing that begins with a closest namespace declaration and uses a method group that includes all accessible extension methods having a name given by the at least one identifier.
Independent claims3
68 paragraphs in 5 sections, as filed
CROSS-REFERENCE TO RELATED APPLICATIONS
0001This application is a continuation of U.S. patent application Ser. No. 11/192,919, filed on Jul. 29, 2005, entitled “ARCHITECTURE THAT EXTENDS TYPES USING EXTENSION METHODS”, which issued on Mar. 23, 2010 as U.S. Pat. No. 7,685,567, and which application is hereby expressly incorporated by reference in its entirety.
BACKGROUND
0002When creating frameworks programmers want extensibility in several dimensions; they want to add new types and they want to add new functionality. Traditional imperative languages and modem functional languages make it easy to add new functions (since functions are defined independently from types), but make it hard to add new types (since this would require dealing with this new type in all existing functions).
0003Object-oriented languages on the other hand, make it easy to add new types, but make hard to add new functions (since this would require adding new methods to all existing types). For constructed types (such as IEnumerable<string>) it is even impossible to add new methods, since there is no class declaration for that particular type to add these new methods. A typical example that requires both forms of extensibility is in compiler construction.
0004This extensibility dilemma is what is called “the expression problem”. This fundamental dilemma of programming is the desire that an application can be structured in such a way that both the data model and the set of virtual operations over it be extended without the need to modify existing code, without the need for code repetition and without runtime type errors.
SUMMARY
0005The following presents a simplified summary in order to provide a basic understanding of some aspects of the disclosed innovation. This summary is not an extensive overview, and it is not intended to identify key/critical elements or to delineate the scope thereof. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.
0006The invention disclosed and claimed herein, in one aspect thereof, comprises architecture for extending existing types using extension methods.
0007In another aspect, a mechanism is provided for adding extensions to constructed types.
0008To the accomplishment of the foregoing and related ends, certain illustrative aspects of the disclosed innovation are described herein in connection with the following description and the annexed drawings. These aspects are indicative, however, of but a few of the various ways in which the principles disclosed herein can be employed and is intended to include all such aspects and their equivalents. Other advantages and novel features will become apparent from the following detailed description when considered in conjunction with the drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
0009<figref idref="DRAWINGS">FIG. 1</figref> illustrates a system that facilitates type extension in accordance with the subject innovation.
0010<figref idref="DRAWINGS">FIG. 2</figref> illustrates a methodology of extending types in accordance with an innovative aspect.
0011<figref idref="DRAWINGS">FIG. 3</figref> illustrates a methodology of importing an extension method.
0012<figref idref="DRAWINGS">FIG. 4</figref> illustrates a methodology of invoking an extension method.
0013<figref idref="DRAWINGS">FIG. 5</figref> illustrates a methodology of resolving the identifier.
0014<figref idref="DRAWINGS">FIG. 6</figref> illustrates a methodology of processing methods in accordance with an innovative aspect.
0015<figref idref="DRAWINGS">FIG. 7</figref> illustrates sample code for extending existing types with extension methods.
0016<figref idref="DRAWINGS">FIG. 8</figref> illustrates a system that employs a compiler to process extension methods in accordance with the disclosed innovation.
0017<figref idref="DRAWINGS">FIG. 9</figref> illustrates a block diagram of a computer operable to execute the disclosed architecture.
0018<figref idref="DRAWINGS">FIG. 10</figref> illustrates a schematic block diagram of an exemplary computing environment.
DETAILED DESCRIPTION
0019The innovation is now described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding thereof. It may be evident, however, that the innovation can be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate a description thereof.
0020As used in this application, the terms “component” and “system” are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to being, a process running on a processor, a processor, a hard disk drive, multiple storage drives (of optical and/or magnetic storage medium), an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and/or thread of execution, and a component can be localized on one computer and/or distributed between two or more computers.
0021Referring initially to the drawings, <figref idref="DRAWINGS">FIG. 1</figref> illustrates a system <b>100</b> that facilitates type extension in accordance with the subject innovation. The system <b>100</b> includes a type component <b>102</b> that provides a type (e.g., an existing type or a new type) and an extensibility component <b>104</b> that facilitates adding an extension methods to the type.
0022<figref idref="DRAWINGS">FIG. 2</figref> illustrates a methodology of extending types in accordance with an innovative aspect. While, for purposes of simplicity of explanation, the one or more methodologies shown herein, e.g., in the form of a flow chart or flow diagram, are shown and described as a series of acts, it is to be understood and appreciated that the subject innovation is not limited by the order of acts, as some acts may, in accordance therewith, occur in a different order and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all illustrated acts may be required to implement a methodology in accordance with the innovation.
0023At <b>200</b>, a type (e.g., static type) is received for extension processing. At <b>202</b>, an extension method is added to the type. At <b>204</b>, the extension method is declared using declaration syntax that gives the compiler sufficient information to statically process the invocation of extension members using declaration syntax that treats the extension methods as if they were normal instance members of the type the methods extend.
0024Extension methods are static methods that can be invoked using instance method syntax. In effect, extension methods make it possible to extend existing types, sealed types, and constructed types with additional methods. Extension methods can be declared by specifying the keyword “this” as a modifier on the first parameter of the methods. Other keywords can be employed as custom attributes to declare the extension method. Extension methods are declared in static classes. The following is an example of a static class that declares two extension methods:
0025<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><thead><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>namespace Acme.Utilities</entry></row><row><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>public static class Extensions</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>public static int ToInt32(this string s) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="42pt" align="left" /><colspec colname="1" colwidth="175pt" align="left" /><tbody valign="top"><row><entry /><entry>return Int32.Parse(s);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>public static T[ ] Slice<T>(this T[ ] source, int index, int count)</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><tbody valign="top"><row><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="42pt" align="left" /><colspec colname="1" colwidth="175pt" align="left" /><tbody valign="top"><row><entry /><entry>if (index < 0 ∥ count < 0 ∥ source.Length − index < count)</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="56pt" align="left" /><colspec colname="1" colwidth="161pt" align="left" /><tbody valign="top"><row><entry /><entry>throw new ArgumentException( );</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="42pt" align="left" /><colspec colname="1" colwidth="175pt" align="left" /><tbody valign="top"><row><entry /><entry>T[ ] result = new T[count];</entry></row><row><entry /><entry>Array.Copy(source, index, result, 0, count);</entry></row><row><entry /><entry>return result;</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><tbody valign="top"><row><entry>}</entry></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0026Note, however, that the subject invention is not limited to the above syntax. Additionally, extension methods can be added to any type, in particular, to constructed types. The above example added a new method to T[ ] for any type T, but an extension method can also be added to just IEnumerable<string>:
0027<tables id="TABLE-US-00002" num="00002"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><thead><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>public static class MoreExtensions</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>public static void Print(this IEnumerable<string> source) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="42pt" align="left" /><colspec colname="1" colwidth="175pt" align="left" /><tbody valign="top"><row><entry /><entry>foreach (string s in source) Console.WriteLine(s);</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0028Extension methods have all the capabilities of regular static methods. In addition, once imported, extension methods can be invoked using instance method syntax. Accordingly, <figref idref="DRAWINGS">FIG. 3</figref> illustrates a methodology of importing an extension method. At <b>300</b>, an extension method if received for processing. At <b>302</b>, the extension method is imported. Extension methods can be imported through a using-namespace-directive. In addition to importing the types contained in a namespace, a using-namespace-directive imports all extension methods in all static classes in the namespace. At <b>304</b>, the imported extension method can be invoked using instance method syntax. Note that this is just one example for importing an extension method. Other general mechanisms for importing extension methods are also within contemplation of the subject invention.
0029In effect, imported extension methods appear as additional methods on the types that are given by their first parameter and have lower precedence than regular instance methods. For example, when the Acme.Utilities namespace from the example above is imported with the using-namespace-directive using Acme.Utilties; it becomes possible to invoke the extension methods in the static class Extensions using instance method syntax:
0030<tables id="TABLE-US-00003" num="00003"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="left" /><thead><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry>string s = “1234”;</entry></row><row><entry>int i = s.ToInt32( );</entry></row><row><entry>int I = Extensions.ToInt32(s)</entry></row><row><entry>string[ ] text = { “the”, “quick”, “brown”, “fox”, “jumped”, “over”, “the”,</entry></row><row><entry>“lazy”, “dog” };</entry></row><row><entry>string[ ] fragment = text.Slice(2, 4) // {“brown”, “fox”, “jumped”,</entry></row><row><entry>“over” }</entry></row><row><entry>string[ ] fragment = Extensions.Slice(text, 2, 4) // {“brown”, “fox”,</entry></row><row><entry>“jumped”, “over” }</entry></row><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0031<figref idref="DRAWINGS">FIG. 4</figref> illustrates a methodology of invoking an extension method. At <b>400</b>, an extension method is received for processing. At <b>402</b>, extension method invocation is initiated in one of the following forms:
0000expr.identifier( )
0000expr.identifier(args)
0000expr.identifier<typeargs>( )
0000expr.identifier<typeargs>(args)
0032At <b>404</b>, the system checks if the normal processing of the invocation finds no applicable instance methods (specifically, if the set of candidate methods for the invocation is empty). If yes, flow is to <b>406</b> for normal processing. Alternatively, if no, flow progresses to <b>408</b>, to initiate processing of the construct as an extension method invocation. At <b>410</b>, the method invocation is first rewritten to one of the following, respectively:
0000identifier(expr)
0000identifier(expr, args)
0000identifier<typeargs>(expr)
0000identifier<typeargs>(expr, args)
0033At <b>412</b>, the rewritten form is then processed as a static method invocation, except for the way in which identifier is resolved. <figref idref="DRAWINGS">FIG. 5</figref> illustrates a methodology of resolving the identifier. At <b>500</b>, a rewritten method invocation is received for processing. At <b>502</b>, the rewritten method invocation is processed as a static method invocation with special identifier processing. At <b>504</b>, starting with the closest enclosing namespace declaration, continuing with each enclosing namespace declaration, and ending with the containing compilation unit, successive attempts are made to process the rewritten method invocation with a method group consisting of all accessible extension methods with the name given by identifier imported by the namespace declaration's using-namespace-directives. At <b>506</b>, the first method group that yields a non-empty set of candidate methods is the one chosen for the rewritten method invocation. If all attempts yield empty sets of candidate methods, a compile-time error occurs.
0034Not that the above process is one example of how a compiler can statically determine which extension method needs to be invoked given a normal method invocation. It is a special case of a general mechanism to statically determine which extension method to invoke given any form of ordinary member access.
0035<figref idref="DRAWINGS">FIG. 6</figref> illustrates a methodology of processing methods in accordance with an innovative aspect. At <b>600</b>, instance and extension methods are received for processing. At <b>602</b>, the instance method takes processing precedence over extension methods. At <b>604</b>, extension methods imported in inner namespace declarations take precedence over extension methods imported in outer namespace declarations. For example:
0036<tables id="TABLE-US-00004" num="00004"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><thead><row><entry /><entry namest="offset" nameend="1" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /><entry>using N1;</entry></row><row><entry /><entry>namespace N1</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>public static class E</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="42pt" align="left" /><colspec colname="1" colwidth="175pt" align="left" /><tbody valign="top"><row><entry /><entry>public static void F(this object obj, int i) { }</entry></row><row><entry /><entry>public static void F(this object obj, string s) { }</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>class A { }</entry></row><row><entry /><entry>class B</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>public void F(int i) { }</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>class C</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>public void F(object obj) { }</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="14pt" align="left" /><colspec colname="1" colwidth="203pt" align="left" /><tbody valign="top"><row><entry /><entry>}</entry></row><row><entry /><entry>class X</entry></row><row><entry /><entry>{</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="189pt" align="left" /><tbody valign="top"><row><entry /><entry>static void Test(A a, B b, C c) {</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="3"><colspec colname="offset" colwidth="56pt" align="left" /><colspec colname="1" colwidth="70pt" align="left" /><colspec colname="2" colwidth="91pt" align="left" /><tbody valign="top"><row><entry /><entry>a.F(1);</entry><entry>// E.F(object, int)</entry></row><row><entry /><entry>a.F(“hello”);</entry><entry>// E.F(object, string)</entry></row><row><entry /><entry>b.F(1);</entry><entry>// B.F(int)</entry></row><row><entry /><entry>b.F(“hello”);</entry><entry>// E.F(object, string)</entry></row><row><entry /><entry>c.F(1);</entry><entry>// C.F(object)</entry></row><row><entry /><entry>c.F(“hello”);</entry><entry>// C.F(object) } }</entry></row><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0037In the above example, B's method takes precedence over the first extension method, and C's method takes precedence over both extension methods.
0038<figref idref="DRAWINGS">FIG. 7</figref> illustrates sample code for extending existing types with extension methods.
0039<figref idref="DRAWINGS">FIG. 8</figref> illustrates a system <b>800</b> that employs a compiler <b>802</b> to process extension methods in accordance with the disclosed innovation. The system <b>800</b> employs the type component <b>102</b> and extensibility component <b>104</b> of <figref idref="DRAWINGS">FIG. 1</figref>. In this implementation, the compiler <b>802</b> interfaces to the extensibility component <b>104</b> to receive the type and one or more extension methods for processing. It is to be appreciated that the compiler <b>802</b> can interface directly to the type component <b>102</b> rather than the extensibility component <b>104</b> to receive the extended type for processing.
0040Referring now to <figref idref="DRAWINGS">FIG. 9</figref>, there is illustrated a block diagram of a computer operable to execute the disclosed architecture. In order to provide additional context for various aspects thereof, <figref idref="DRAWINGS">FIG. 9</figref> and the following discussion are intended to provide a brief, general description of a suitable computing environment <b>900</b> in which the various aspects of the innovation can be implemented. While the description above is in the general context of computer-executable instructions that may run on one or more computers, those skilled in the art will recognize that the innovation also can be implemented in combination with other program modules and/or as a combination of hardware and software.
0041Generally, program modules include routines, programs, components, data structures, etc., that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods can be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, minicomputers, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like, each of which can be operatively coupled to one or more associated devices.
0042The illustrated aspects of the innovation may also be practiced in distributed computing environments where certain tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules can be located in both local and remote memory storage devices.
0043A computer typically includes a variety of computer-readable media. Computer-readable media can be any available media that can be accessed by the computer and includes both volatile and non-volatile media, removable and non-removable media. By way of example, and not limitation, computer-readable media can comprise computer storage media and communication media. Computer storage media includes both volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital video disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer.
0044Communication media typically embodies computer-readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer-readable media.
0045With reference again to <figref idref="DRAWINGS">FIG. 9</figref>, the exemplary environment <b>900</b> for implementing various aspects includes a computer <b>902</b>, the computer <b>902</b> including a processing unit <b>904</b>, a system memory <b>906</b> and a system bus <b>908</b>. The system bus <b>908</b> couples system components including, but not limited to, the system memory <b>906</b> to the processing unit <b>904</b>. The processing unit <b>904</b> can be any of various commercially available processors. Dual microprocessors and other multi-processor architectures may also be employed as the processing unit <b>904</b>.
0046The system bus <b>908</b> can be any of several types of bus structure that may further interconnect to a memory bus (with or without a memory controller), a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. The system memory <b>906</b> includes read-only memory (ROM) <b>910</b> and random access memory (RAM) <b>912</b>. A basic input/output system (BIOS) is stored in a non-volatile memory <b>910</b> such as ROM, EPROM, EEPROM, which BIOS contains the basic routines that help to transfer information between elements within the computer <b>902</b>, such as during start-up. The RAM <b>912</b> can also include a high-speed RAM such as static RAM for caching data.
0047The computer <b>902</b> further includes an internal hard disk drive (HDD) <b>914</b> (e.g., EIDE, SATA), which internal hard disk drive <b>914</b> may also be configured for external use in a suitable chassis (not shown), a magnetic floppy disk drive (FDD) <b>916</b>, (e.g., to read from or write to a removable diskette <b>918</b>) and an optical disk drive <b>920</b>, (e.g., reading a CD-ROM disk <b>922</b> or, to read from or write to other high capacity optical media such as the DVD). The hard disk drive <b>914</b>, magnetic disk drive <b>916</b> and optical disk drive <b>920</b> can be connected to the system bus <b>908</b> by a hard disk drive interface <b>924</b>, a magnetic disk drive interface <b>926</b> and an optical drive interface <b>928</b>, respectively. The interface <b>924</b> for external drive implementations includes at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies. Other external drive connection technologies are within contemplation of the subject innovation.
0048The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions, and so forth. For the computer <b>902</b>, the drives and media accommodate the storage of any data in a suitable digital format. Although the description of computer-readable media above refers to a HDD, a removable magnetic diskette, and a removable optical media such as a CD or DVD, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as zip drives, magnetic cassettes, flash memory cards, cartridges, and the like, may also be used in the exemplary operating environment, and further, that any such media may contain computer-executable instructions for performing the methods of the disclosed innovation.
0049A number of program modules can be stored in the drives and RAM <b>912</b>, including an operating system <b>930</b>, one or more application programs <b>932</b>, other program modules <b>934</b> and program data <b>936</b>. All or portions of the operating system, applications, modules, and/or data can also be cached in the RAM <b>912</b>. It is to be appreciated that the innovation can be implemented with various commercially available operating systems or combinations of operating systems.
0050A user can enter commands and information into the computer <b>902</b> through one or more wired/wireless input devices, e.g., a keyboard <b>938</b> and a pointing device, such as a mouse <b>940</b>. Other input devices (not shown) may include a microphone, an IR remote control, a joystick, a game pad, a stylus pen, touch screen, or the like. These and other input devices are often connected to the processing unit <b>904</b> through an input device interface <b>942</b> that is coupled to the system bus <b>908</b>, but can be connected by other interfaces, such as a parallel port, an IEEE 1394 serial port, a game port, a USB port, an IR interface, etc.
0051A monitor <b>944</b> or other type of display device is also connected to the system bus <b>908</b> via an interface, such as a video adapter <b>946</b>. In addition to the monitor <b>944</b>, a computer typically includes other peripheral output devices (not shown), such as speakers, printers, etc.
0052The computer <b>902</b> may operate in a networked environment using logical connections via wired and/or wireless communications to one or more remote computers, such as a remote computer(s) <b>948</b>. The remote computer(s) <b>948</b> can be a workstation, a server computer, a router, a personal computer, portable computer, microprocessor-based entertainment appliance, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer <b>902</b>, although, for purposes of brevity, only a memory/storage device <b>950</b> is illustrated. The logical connections depicted include wired/wireless connectivity to a local area network (LAN) <b>952</b> and/or larger networks, e.g., a wide area network (WAN) <b>954</b>. Such LAN and WAN networking environments are commonplace in offices and companies, and facilitate enterprise-wide computer networks, such as intranets, all of which may connect to a global communications network, e.g., the Internet.
0053When used in a LAN networking environment, the computer <b>902</b> is connected to the local network <b>952</b> through a wired and/or wireless communication network interface or adapter <b>956</b>. The adaptor <b>956</b> may facilitate wired or wireless communication to the LAN <b>952</b>, which may also include a wireless access point disposed thereon for communicating with the wireless adaptor <b>956</b>.
0054When used in a WAN networking environment, the computer <b>902</b> can include a modem <b>958</b>, or is connected to a communications server on the WAN <b>954</b>, or has other means for establishing communications over the WAN <b>954</b>, such as by way of the Internet. The modem <b>958</b>, which can be internal or external and a wired or wireless device, is connected to the system bus <b>908</b> via the serial port interface <b>942</b>. In a networked environment, program modules depicted relative to the computer <b>902</b>, or portions thereof, can be stored in the remote memory/storage device <b>950</b>. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used.
0055The computer <b>902</b> is operable to communicate with any wireless devices or entities operatively disposed in wireless communication, e.g., a printer, scanner, desktop and/or portable computer, portable data assistant, communications satellite, any piece of equipment or location associated with a wirelessly detectable tag (e.g., a kiosk, news stand, restroom), and telephone. This includes at least Wi-Fi and Bluetooth™ wireless technologies. Thus, the communication can be a predefined structure as with a conventional network or simply an ad hoc communication between at least two devices.
0056Wi-Fi, or Wireless Fidelity, allows connection to the Internet from a couch at home, a bed in a hotel room, or a conference room at work, without wires. Wi-Fi is a wireless technology similar to that used in a cell phone that enables such devices, e.g., computers, to send and receive data indoors and out; anywhere within the range of a base station. Wi-Fi networks use radio technologies called IEEE 802.11 (a, b, g, etc.) to provide secure, reliable, fast wireless connectivity. A Wi-Fi network can be used to connect computers to each other, to the Internet, and to wired networks (which use IEEE 802.3 or Ethernet). Wi-Fi networks operate in the unlicensed 2.4 and 5 GHz radio bands, at an 11 Mbps (802.11a) or 54 Mbps (802.11b) data rate, for example, or with products that contain both bands (dual band), so the networks can provide real-world performance similar to the basic 10 BaseT wired Ethernet networks used in many offices.
0057Referring now to <figref idref="DRAWINGS">FIG. 10</figref>, there is illustrated a schematic block diagram of an exemplary computing environment <b>1000</b> in accordance with another aspect. The system <b>1000</b> includes one or more client(s) <b>1002</b>. The client(s) <b>1002</b> can be hardware and/or software (e.g., threads, processes, computing devices). The client(s) <b>1002</b> can house cookie(s) and/or associated contextual information by employing the subject innovation, for example.
0058The system <b>1000</b> also includes one or more server(s) <b>1004</b>. The server(s) <b>1004</b> can also be hardware and/or software (e.g., threads, processes, computing devices). The servers <b>1004</b> can house threads to perform transformations by employing the invention, for example. One possible communication between a client <b>1002</b> and a server <b>1004</b> can be in the form of a data packet adapted to be transmitted between two or more computer processes. The data packet may include a cookie and/or associated contextual information, for example. The system <b>1000</b> includes a communication framework <b>1006</b> (e.g., a global communication network such as the Internet) that can be employed to facilitate communications between the client(s) <b>1002</b> and the server(s) <b>1004</b>.
0059Communications can be facilitated via a wired (including optical fiber) and/or wireless technology. The client(s) <b>1002</b> are operatively connected to one or more client data store(s) <b>1008</b> that can be employed to store information local to the client(s) <b>1002</b> (e.g., cookie(s) and/or associated contextual information). Similarly, the server(s) <b>1004</b> are operatively connected to one or more server data store(s) <b>1010</b> that can be employed to store information local to the servers <b>1004</b>.
0060What has been described above includes examples of the disclosed innovation. It is, of course, not possible to describe every conceivable combination of components and/or methodologies, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the innovation is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.
Contents5
12 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2002194155A1 | Cites | United States of America | Applicant |
| US2003061244A1 | Cites | United States of America | Applicant |
| US2003208505A1 | Cites | United States of America | Applicant |
| US2004098384A1 | Cites | United States of America | Applicant |
| US2004158549A1 | Cites | United States of America | Applicant |
| US2004194057A1 | Cites | United States of America | Applicant |
| US2004210828A1 | Cites | United States of America | Applicant |
| US2004230584A1 | Cites | United States of America | Applicant |
| US2004243921A1 | Cites | United States of America | Applicant |
| US2004260691A1 | Cites | United States of America | Applicant |
| US2004268328A1 | Cites | United States of America | Applicant |
| US2005027681A1 | Cites | United States of America | Applicant |
| US2005055336A1 | Cites | United States of America | Applicant |
| US2005138073A1 | Cites | United States of America | Applicant |
| US2005166183A1 | Cites | United States of America | Applicant |
| US2006048114A1 | Cites | United States of America | Search report |
| US2006136358A1 | Cites | United States of America | Applicant |
| US2006179068A1 | Cites | United States of America | Applicant |
| US2006195476A1 | Cites | United States of America | Applicant |
| US2006200438A1 | Cites | United States of America | Applicant |
| US2006294059A1 | Cites | United States of America | Applicant |
| US2007027849A1 | Cites | United States of America | Applicant |
| US2007027905A1 | Cites | United States of America | Applicant |
| US2007028222A1 | Cites | United States of America | Applicant |
| US2007044083A1 | Cites | United States of America | Applicant |
| US2007067716A1 | Cites | United States of America | Applicant |
| US5193171A | Cites | United States of America | Applicant |
| US5500881A | Cites | United States of America | Applicant |
| US5504885A | Cites | United States of America | Applicant |
| US5615362A | Cites | United States of America | Applicant |
| US5664180A | Cites | United States of America | Applicant |
| US5748961A | Cites | United States of America | Applicant |
| US5748966A | Cites | United States of America | Applicant |
| US5761493A | Cites | United States of America | Applicant |
| US5857180A | Cites | United States of America | Applicant |
| US5897622A | Cites | United States of America | Applicant |
| US5907846A | Cites | United States of America | Applicant |
| US5937402A | Cites | United States of America | Applicant |
| US5937409A | Cites | United States of America | Applicant |
| US6016497A | Cites | United States of America | Applicant |
| US6029002A | Cites | United States of America | Applicant |
| US6101502A | Cites | United States of America | Applicant |
| US6134540A | Cites | United States of America | Applicant |
| US6148296A | Cites | United States of America | Applicant |
| US6163776A | Cites | United States of America | Applicant |
| US6243709B1 | Cites | United States of America | Applicant |
| US6339775B1 | Cites | United States of America | Applicant |
| US6378126B2 | Cites | United States of America | Applicant |
| US6425119B1 | Cites | United States of America | Applicant |
| US6442515B1 | Cites | United States of America | Applicant |
| US6470354B1 | Cites | United States of America | Applicant |
| US6567819B1 | Cites | United States of America | Applicant |
| US6574673B1 | Cites | United States of America | Applicant |
| US6615323B1 | Cites | United States of America | Applicant |
| US6625620B1 | Cites | United States of America | Applicant |
| US6690981B1 | Cites | United States of America | Applicant |
| US6857118B2 | Cites | United States of America | Applicant |
| US6968355B2 | Cites | United States of America | Applicant |
| US6971085B1 | Cites | United States of America | Applicant |
| US6985912B2 | Cites | United States of America | Applicant |
| US6993529B1 | Cites | United States of America | Applicant |
| US7043720B2 | Cites | United States of America | Applicant |
| US7093231B2 | Cites | United States of America | Applicant |
| US7096231B2 | Cites | United States of America | Applicant |
| US7103590B1 | Cites | United States of America | Applicant |
| US7137100B2 | Cites | United States of America | Applicant |
| US7171657B2 | Cites | United States of America | Search report |
| US7185016B1 | Cites | United States of America | Applicant |
| US7197747B2 | Cites | United States of America | Applicant |
| US7284242B2 | Cites | United States of America | Applicant |
| US7289997B1 | Cites | United States of America | Applicant |
| US7290018B2 | Cites | United States of America | Applicant |
| US7310638B1 | Cites | United States of America | Applicant |
| US7631011B2 | Cites | United States of America | Applicant |
| US7702686B2 | Cites | United States of America | Applicant |
| US7992140B2 | Cites | United States of America | Applicant |
| US8060868B2 | Cites | United States of America | Applicant |
| US20020194155A1 | Cites | United States of America | Applicant |
| US20030061244A1 | Cites | United States of America | Applicant |
| US20030208505A1 | Cites | United States of America | Applicant |
| US20040098384A1 | Cites | United States of America | Applicant |
| US20040158549A1 | Cites | United States of America | Applicant |
| US20040194057A1 | Cites | United States of America | Applicant |
| US20040210828A1 | Cites | United States of America | Applicant |
| US20040230584A1 | Cites | United States of America | Applicant |
| US20040243921A1 | Cites | United States of America | Applicant |
| US20040260691A1 | Cites | United States of America | Applicant |
| US20040268328A1 | Cites | United States of America | Applicant |
| US20050027681A1 | Cites | United States of America | Applicant |
| US20050055336A1 | Cites | United States of America | Applicant |
| US20050138073A1 | Cites | United States of America | Applicant |
| US20050166183A1 | Cites | United States of America | Applicant |
| US20060048114A1 | Cites | United States of America | Search report |
| US20060136358A1 | Cites | United States of America | Applicant |
| US20060179068A1 | Cites | United States of America | Applicant |
| US20060195476A1 | Cites | United States of America | Applicant |
| US20060200438A1 | Cites | United States of America | Applicant |
| US20060294059A1 | Cites | United States of America | Applicant |
| US20070027849A1 | Cites | United States of America | Applicant |
| US20070027905A1 | Cites | United States of America | Applicant |
4 members in 1 office
Priority claims1
| Document | Office | Kind | Date |
|---|---|---|---|
| 19291905 | United States of America | A |
Members4
| Document | Office | Kind | |
|---|---|---|---|
| US2007028209A1 | United States of America | A1 | |
| US7685567B2 | United States of America | B2 | |
| US2010175048A1 | United States of America | A1 | |
| US8370801B2This record | United States of America | B2 |
42 transactions on the USPTO file
Allowed after 1 non-final rejection.
- Non-final rejections
- 1
- Final rejections
- 0
- RCEs
- 0
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Email NotificationEML_NTR | EML_NTR | |
| Change in Power of Attorney (May Include Associate POA)PA.. | PA.. | |
| Paralegal or electronic terminal disclaimer approvedP574 | P574 | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Terminal Disclaimer FiledDIST | DIST | |
| Response after Non-Final ActionA... | A... | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
10 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| Maintenance fee paymentMAFP | MAFP | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS |
Numbers
- Publication
- 8370801
- Application
- 12728939
Titles
- English
- Architecture that extends types using extension methods
Patent term adjustment
- A delay
- +353 daysthe office missed an examination deadline
- Net adjustment
- 353 days
Classification
- CPC, 1
- G06F8/315
- IPC, 1
- G06F9 44