HI Kalan,
You might want to read
https://commons.wikimedia.org/wiki/User:Multichill/Next_generation_categories
Maarten
Op 6-4-2012 17:11, Kalan schreef:
Hello,
I present a proposal for a system that is going to solve the category
intersection problem (and, in fact, allow all set-theory
Hello Kalan
This already exists and is currently being beta-tested on the toolserver. If
would be very cool if you could build on top of this!
The backend consists of two components, graphcore and graphserv. WMDE contracted
Johannes Kroll to implement them based on my spec. The code is available
Hello Kalan
This already exists and is currently being beta-tested on the toolserver. If
would be very cool if you could build on top of this!
The backend consists of two components, graphcore and graphserv. WMDE contracted
Johannes Kroll to implement them based on my spec. The code is available
Hello,
I present a proposal for a system that is going to solve the category
intersection problem (and, in fact, allow all set-theory operations
for categories). The name I suggest for it is “Caterpillar”.
Such a system would consist of a C or C++ backend daemon that stores
all the category
Kalan,
I would expand more on what you'd like to accomplish and why. Also move some
of the About info to the top and fill out the bottom About with information
about yourself in particular - we'd like to get to know you (for those that
don't already).
Have you had any interest from potential
Hello Kalan,
This is a late proposal, but still a very interesting goal.
I wonder however about how you expect to perform it.
What kind of structure would you use for in-memory storage
of the categories? How do you perform intersection in that?
How do you update them? (ie. category
