Matthew H Austern

US Patent:

8423982, Apr 16, 2013

Filed:

Jan 24, 2011

Appl. No.:

13/012652

Inventors:

Theodore C. Goldstein - Los Altos CA, US
Stephen Naroff - San Jose CA, US
Matthew Austern - Alameda CA, US
Fariborz Jahanian - Los Gatos CA, US
Stan Jirman - Santa Clara CA, US
P. Anders I. Bertelrud - San Mateo CA, US

Assignee:

Apple Inc. - Cupertino CA

International Classification:

G06F 9/44

US Classification:

717140

Abstract:

The invention is a method and apparatus for use in developing a program. More particularly, a method and apparatus for compiling a source code program during editing of the same is disclosed, where editing can be initial entry or modification subsequent to initial entry. The method comprises compiling at least a portion of a source code program defined by a waypoint during the editing of the source code program. In other aspects, the invention includes a program storage medium encoded with instructions that, when executed, perform this method and a computer programmed to perform this method. The apparatus includes a computing apparatus, comprising a text editor through which a source code program may be entered; and a compiler that may compile the source code program. The control block is capable of determining at least one waypoint in the source code program and invoking the compiler to compile the source code program up to the waypoint.

US Patent:

8645429, Feb 4, 2014

Filed:

Mar 28, 2012

Appl. No.:

13/432806

Inventors:

Aart J. C. Bik - Union City CA, US
Matthew H. Austern - Palo Alto CA, US
James C. Dehnert - Palo Alto CA, US
Grzegorz Czajkowski - Redwood City CA, US
Grzegorz Malewicz - Tokyo, JP
Naty Leiser - Haifa, IL

Assignee:

Google Inc. - Mountain View CA

International Classification:

G06F 7/00
G06F 17/30
G06F 11/20

US Classification:

707798, 707797, 707805, 707808, 717144

Abstract:

Resolving conflicting graph mutations in a distributed computing system. Graph data for at least a partition of a graph is stored in a worker system of a distributed computing system. The graph represents relationships among a set of tangible items that model a real-world condition having an associated problem. A plurality of conflicting mutation requests are received to mutate the graph. A conflict between the mutation requests is resolved with a conflict resolution function that lacks direct access to the graph data. The graph data is updated responsive to a result generated by resolving the conflict using the conflict resolution function.

US Patent:

20040261064, Dec 23, 2004

Filed:

Mar 24, 2004

Appl. No.:

10/807833

Inventors:

Theodore Goldstein - Los Altos CA, US
Stephen Naroff - San Jose CA, US
Matthew Austern - Alameda CA, US
Fariborz Jahanian - Los Gatos CA, US
Stan Jirman - Santa Clara CA, US
P. I. Bertelrud - San Mateo CA, US

International Classification:

G06F009/45
G06F009/44

US Classification:

717/140000, 717/110000

Abstract:

The invention is a method and apparatus for use in developing a program. More particularly, a method and apparatus for compiling a source code program during editing of the same is disclosed, where editing can be initial entry or modification subsequent to initial entry. The method comprises compiling at least a portion of a source code program defined by a waypoint during the editing of the source code program. In other aspects, the invention includes a program storage medium encoded with instructions that, when executed, perform this method and a computer programmed to perform this method. The apparatus includes a computing apparatus, comprising a text editor through which a source code program may be entered; and a compiler that may compile the source code program. The control block is capable of determining at least one waypoint in the source code program and invoking the compiler to compile the source code program up to the waypoint.

US Patent:

20180285477, Oct 4, 2018

Filed:

Aug 10, 2015

Appl. No.:

14/822553

Inventors:

- Mountain View CA, US
James C. Dehnert - Palo Alto CA, US
Matthew H. Austern - Palo Alto CA, US
Grzegorz Czajkowski - Redwood City CA, US

International Classification:

G06F 17/30
G06F 11/14

Abstract:

Data are received at a worker system in a distributed computing system that describe a graph representing relationships among a set of items. The graph models a condition having an associated problem. The graph has graph components having associated data fields. The received data are stored in a backup table, and the relationships are analyzed to identify a solution to the problem. As part of the analysis, a new value for the data field associated with a graph component is identified and compared with an existing value of the data field, and the data field is modified. The modified data field is stored in a delta table representing a change to the backup table.