Gothic - Revision history

Adamcolton: /* Parser Generator */

2016-01-10T18:16:42Z

Parser Generator

← Older revision		Revision as of 18:16, 10 January 2016
Line 14:		Line 14:

	It's written as a tool. I could pull the guts out into a package. This could also be submitted back to the go community.		It's written as a tool. I could pull the guts out into a package. This could also be submitted back to the go community.

			=== PEG ===
			https://github.com/pointlander/peg

	== Components ==		== Components ==

2016-01-10T18:13:02Z

← Older revision		Revision as of 18:13, 10 January 2016
Line 6:		Line 6:

	Before I get carried away (and I have a LOT to do with compiler-compilers) lets try a [[Gothic Alpha]]		Before I get carried away (and I have a LOT to do with compiler-compilers) lets try a [[Gothic Alpha]]

			== Parser Generator ==
			This ends up being the core. So much of what I want to do involves moving descriptions between environments.

			=== Go Yacc ===
			https://golang.org/src/cmd/yacc/yacc.go

			It's written as a tool. I could pull the guts out into a package. This could also be submitted back to the go community.

	== Components ==		== Components ==

2015-12-29T20:00:42Z

Though Experiments

← Older revision		Revision as of 20:00, 29 December 2015
Line 116:		Line 116:
	* Wiki		* Wiki
	* Work logs		* Work logs
			* My To-do, that has never actually been completed

	== Terms and Ideas ==		== Terms and Ideas ==

2015-12-29T19:50:16Z

← Older revision		Revision as of 19:50, 29 December 2015
Line 4:		Line 4:

	Look into dynamic linking for this.		Look into dynamic linking for this.

			Before I get carried away (and I have a LOT to do with compiler-compilers) lets try a [[Gothic Alpha]]

	== Components ==		== Components ==

2015-10-15T20:19:20Z

Index

← Older revision		Revision as of 20:19, 15 October 2015
Line 64:		Line 64:
	* map[string]LessThan(obj, val) bool		* map[string]LessThan(obj, val) bool

	This allows us to do comparisons. To compare two objects, we extract the field from one and pass it in as a value.		This allows us to do comparisons. To compare two objects, we extract the field from one and pass it in as a value. I could break a struct up into indexed and non-indexed fields. The main struct would be the non-indexed fields with the indexed fields embedded. This allows me to hold a reference to the indexed fields, but write the object to disk.

	=== Query ===		=== Query ===

2015-10-15T20:17:31Z

Cache

← Older revision		Revision as of 20:17, 15 October 2015
Line 59:		Line 59:
	* PostGC		* PostGC

	The WeakRef map tracks active Entities so that we don't have multiple clones instantiated. I can also do a mutex lock here so that two routines don't hydrate at the same time. Finalize will transfer an object from Active to Cached. PostGC we will check memory usage and if it's too high, we'll (proportionally) drop the oldest part of the cache.		The WeakRef map tracks active Entities so that we don't have multiple clones instantiated. I can also do a mutex lock here so that two routines don't hydrate at the same time, but the lock should only be on hydration, not on request. I could even add an arbitrary number of locks and use part of the ID. Finalize will transfer an object from Active to Cached. PostGC we will check memory usage and if it's too high, we'll (proportionally) drop the oldest part of the cache.

	=== Index ===		=== Index ===

2015-10-15T15:48:02Z

← Older revision		Revision as of 15:48, 15 October 2015
Line 2:		Line 2:

	Gothic runs in Go on a dedicated server. It is not meant to run behind Apache or share the machine with other services. But it can make efficient use of very small machines and scale out to utilize additional nodes efficiently.		Gothic runs in Go on a dedicated server. It is not meant to run behind Apache or share the machine with other services. But it can make efficient use of very small machines and scale out to utilize additional nodes efficiently.

			Look into dynamic linking for this.

	== Components ==		== Components ==

2015-10-04T14:15:29Z

Terms and Ideas

← Older revision		Revision as of 14:15, 4 October 2015
Line 117:		Line 117:
	* Package: A collection of modules and packages		* Package: A collection of modules and packages
	* Handler: A unique event handler. Modules and packages may require handlers to be enabled.		* Handler: A unique event handler. Modules and packages may require handlers to be enabled.

			I'd like to build in a good set of testing tools. Go already has unit testing, but I'll want to be able to run that as JS too. I'd like comprehensive integration testing. A dev/qa can pull up a page in a browser and hit "go" and it will run through all the defined tests and save the results including browser information.

			I want a full dev stack - git, bug tracking, features. Dev's won't need an ide or even an editor, everything can be done through a thin-client.

2015-10-03T17:22:07Z

Panels

← Older revision		Revision as of 17:22, 3 October 2015
Line 87:		Line 87:

	Some panels are simple, just a div. Some can be moderately complex like column layouts, sticky-footers, fixed-expanding-headers. And we can build highly complex containers like Tetris-Panels (Pintrist), tabbed panel, infiniscroll. Panels will be distributed as modules.		Some panels are simple, just a div. Some can be moderately complex like column layouts, sticky-footers, fixed-expanding-headers. And we can build highly complex containers like Tetris-Panels (Pintrist), tabbed panel, infiniscroll. Panels will be distributed as modules.

			Look at [http://patternlab.io/ Pattern Lab]

	=== Widgets and Views ===		=== Widgets and Views ===

2015-10-02T14:14:17Z

Store

← Older revision		Revision as of 14:14, 2 October 2015
Line 49:		Line 49:

	Be sure (later step) to add a mutex lock to the Entity struct. It's mostly not necessary, but during serialization, another process could access and modify the object.		Be sure (later step) to add a mutex lock to the Entity struct. It's mostly not necessary, but during serialization, another process could access and modify the object.

			My first approach was to build a tree of the reflect values. This allows me to parse through it once to get the size, then again to encode. But I'm doing all that to avoid resizing and copying the byte buffer. That's dumb though, I'll end up doing far more work and allocating far more space managing the tree. Better to just resize the array as I go. Also, I may be able to add some hinting or heuristics later that will help allocate the correct size slice.

	=== Cache ===		=== Cache ===