/* dfs:
* Simple depth first search, adding traversed edges to tree.
*/
static void dfs(Agraph_t * g, Agnode_t * n, Agraph_t * tree)
{
Agedge_t *e;
Agnode_t *neighbor;
SET_VISITED(n);
for (e = agfstedge(g, n); e; e = agnxtedge(g, e, n)) {
neighbor = e->head;
if (neighbor == n)
neighbor = e->tail;
if (!VISITED(neighbor)) {
/* add the edge to the dfs tree */
aginsert(tree, e);
TPARENT(neighbor) = n;
dfs(g, neighbor, tree);
}
}
}
static EjsString *serialize(Ejs *ejs, EjsAny *vp, Json *json)
{
EjsName qname;
EjsFunction *fn;
EjsString *result, *sv;
EjsTrait *trait;
EjsObj *pp, *obj, *replacerArgs[2];
wchar *cp;
cchar *key;
int c, isArray, i, count, slotNum, quotes;
/*
The main code below can handle Arrays, Objects, objects derrived from Object and also native classes with properties.
All others just use toString.
*/
count = ejsIsPot(ejs, vp) ? ejsGetLength(ejs, vp) : 0;
if (count == 0 && TYPE(vp) != ESV(Object) && TYPE(vp) != ESV(Array)) {
// OPT - need some flag for this test.
if (!ejsIsDefined(ejs, vp) || ejsIs(ejs, vp, Boolean) || ejsIs(ejs, vp, Number)) {
return ejsToString(ejs, vp);
} else if (json->regexp) {
return ejsToString(ejs, vp);
} else {
return ejsToLiteralString(ejs, vp);
}
}
obj = vp;
json->nest++;
if (json->buf == 0) {
json->buf = mprCreateBuf(0, 0);
mprAddRoot(json->buf);
}
isArray = ejsIs(ejs, vp, Array);
mprPutCharToWideBuf(json->buf, isArray ? '[' : '{');
if (json->pretty) {
mprPutCharToWideBuf(json->buf, '\n');
}
if (++ejs->serializeDepth <= json->depth && !VISITED(obj)) {
SET_VISITED(obj, 1);
for (slotNum = 0; slotNum < count && !ejs->exception; slotNum++) {
trait = ejsGetPropertyTraits(ejs, obj, slotNum);
if (trait && (trait->attributes & (EJS_TRAIT_HIDDEN | EJS_TRAIT_DELETED | EJS_FUN_INITIALIZER |
EJS_FUN_MODULE_INITIALIZER)) && !json->hidden) {
continue;
}
pp = ejsGetProperty(ejs, obj, slotNum);
if (ejs->exception) {
SET_VISITED(obj, 0);
json->nest--;
return 0;
}
if (pp == 0) {
continue;
}
if (isArray) {
key = itos(slotNum);
qname.name = ejsCreateStringFromAsc(ejs, key);
qname.space = ESV(empty);
} else {
qname = ejsGetPropertyName(ejs, vp, slotNum);
}
quotes = json->quotes;
if (!quotes) {
// UNICODE
for (cp = qname.name->value; cp < &qname.name->value[qname.name->length]; cp++) {
if (!isalnum((uchar) *cp) && *cp != '_') {
quotes = 1;
break;
}
}
}
if (json->pretty) {
for (i = 0; i < ejs->serializeDepth; i++) {
mprPutStringToWideBuf(json->buf, json->indent);
}
}
if (!isArray) {
if (json->namespaces) {
if (qname.space != ESV(empty)) {
mprPutToBuf(json->buf, "\"%@\"::", qname.space);
}
}
if (quotes) {
mprPutCharToWideBuf(json->buf, '"');
}
for (cp = qname.name->value; cp && *cp; cp++) {
c = *cp;
if (c == '"' || c == '\\') {
mprPutCharToWideBuf(json->buf, '\\');
mprPutCharToWideBuf(json->buf, c);
} else {
mprPutCharToWideBuf(json->buf, c);
}
}
if (quotes) {
mprPutCharToWideBuf(json->buf, '"');
}
mprPutCharToWideBuf(json->buf, ':');
if (json->pretty) {
mprPutCharToWideBuf(json->buf, ' ');
}
}
fn = (EjsFunction*) ejsGetPropertyByName(ejs, TYPE(pp)->prototype, N(NULL, "toJSON"));
// OPT - check that this is going directly to serialize most of the time
if (!ejsIsFunction(ejs, fn) || (fn->isNativeProc && fn->body.proc == (EjsProc) ejsObjToJSON)) {
sv = serialize(ejs, pp, json);
} else {
sv = (EjsString*) ejsRunFunction(ejs, fn, pp, 1, &json->options);
}
if (sv == 0 || !ejsIs(ejs, sv, String)) {
if (ejs->exception) {
ejsThrowTypeError(ejs, "Cannot serialize property %@", qname.name);
SET_VISITED(obj, 0);
return 0;
}
} else {
if (json->replacer) {
replacerArgs[0] = (EjsObj*) qname.name;
replacerArgs[1] = (EjsObj*) sv;
/* function replacer(key: String, value: String): String */
sv = ejsRunFunction(ejs, json->replacer, obj, 2, (EjsObj**) replacerArgs);
}
mprPutBlockToBuf(json->buf, sv->value, sv->length * sizeof(wchar));
}
if ((slotNum + 1) < count || json->commas) {
mprPutCharToWideBuf(json->buf, ',');
}
if (json->pretty) {
mprPutCharToWideBuf(json->buf, '\n');
}
}
SET_VISITED(obj, 0);
}
--ejs->serializeDepth;
if (json->pretty) {
for (i = ejs->serializeDepth; i > 0; i--) {
mprPutStringToWideBuf(json->buf, json->indent);
}
}
mprPutCharToWideBuf(json->buf, isArray ? ']' : '}');
mprAddNullToWideBuf(json->buf);
if (--json->nest == 0) {
result = ejsCreateString(ejs, mprGetBufStart(json->buf), mprGetBufLength(json->buf) / sizeof(wchar));
mprRemoveRoot(json->buf);
} else {
result = 0;
}
return result;
}
int directed_MST(int root)
{
int i, j, k;
int has_cycle;
int weight, weight_contracted = 0;
int in_edge_weight[MAX_N];
int in_edge_src[MAX_N];
int v_in_cycle[MAX_N];
int contracted[MAX_N];
memset(contracted, 0, sizeof(contracted));
for (;;)
{
for (i = 0; i < n; i++)
{
in_edge_weight[i] = 0x7fffffff;
in_edge_src[i] = -1;
}
/* STEP 1 */
for (i = 0; i < m; i++)
{
/* The edges should be ingored, but condition 1 & 2 are removed in the other place */
/* 1. no edge to itself: e[i].s != e[i].d */
/* 2. no edge to root: e[i].d != root */
/* 3. has the lowest weight in all in-edge */
if (e[i].w < in_edge_weight[e[i].d])
{
in_edge_src[e[i].d] = e[i].s;
in_edge_weight[e[i].d] = e[i].w;
}
}
/* STEP 2 */
weight = 0;
has_cycle = 0;
for (i = 0; i < n; i++)
{
if (contracted[i] == 1)
continue;
if (in_edge_src[i] == -1 && i != root)
{
return -1; /* no MST */
}
if (in_edge_src[i] != -1)
weight += in_edge_weight[i];
/* if three is a cycle in the graph and v[i] is one of vertex connected to the cycle,
the final j won't be -1. */
RESET_VISITED();
for (j = i;
j != -1 && !IS_VISITED(j);
j = in_edge_src[j])
{
SET_VISITED(j);
}
if (j != -1 && IS_VISITED(j))
{
has_cycle = 1;
for (k = 0; k < n; k++)
v_in_cycle[k] = -1;
v_in_cycle[j] = j;
weight_contracted += in_edge_weight[j];
for (k = in_edge_src[j]; k != j; k = in_edge_src[k])
{
v_in_cycle[k] = j;
contracted[k] = 1;
weight_contracted += in_edge_weight[k];
}
break;
}
}
if (has_cycle == 0)
{
break;
}
/* STEP 3:
all vertexs in the cycle are contracted in to one vertex
For an edge e not in the cycle: the new weight will be updated to 'e.w - in_edge_weight[e.d]'.
It means if the edge is add to the MST, the edge from in_edge_src[e.d] to e.d would be removed.
*/
for (i = 0; i < m ; i++)
{
if (v_in_cycle[e[i].d] >= 0)
{
e[i].w -= in_edge_weight[e[i].d];
e[i].d = v_in_cycle[e[i].d];
}
if (v_in_cycle[e[i].s] >= 0)
{
e[i].s = v_in_cycle[e[i].s];
}
/* an edge to itself would be removed */
if (e[i].s == e[i].d)
{
e[i--] = e[--m];
}
}
}
return weight + weight_contracted;
}
/*
List the various property slot assignments
*/
static void lstSlotAssignments(EjsMod *mp, EjsModule *module, EjsObj *parent, int slotNum, EjsObj *obj)
{
Ejs *ejs;
EjsTrait *trait;
EjsType *type;
EjsObj *vp;
EjsPot *prototype;
EjsFunction *fun;
EjsBlock *block;
EjsName qname;
int i, numInherited, count;
mprAssert(obj);
mprAssert(module);
ejs = mp->ejs;
if (VISITED(obj)) {
return;
}
SET_VISITED(obj, 1);
if (obj == ejs->global) {
mprFprintf(mp->file, "\n#\n"
"# Global slot assignments (Num prop %d)\n"
"#\n", ejsGetLength(ejs, obj));
/*
List slots for global
*/
for (i = module->firstGlobal; i < module->lastGlobal; i++) {
trait = ejsGetPropertyTraits(ejs, ejs->global, i);
qname = ejsGetPropertyName(ejs, ejs->global, i);
if (qname.name == 0) {
continue;
}
lstVarSlot(mp, module, &qname, trait, i);
}
/*
List slots for the initializer
*/
fun = (EjsFunction*) module->initializer;
if (fun) {
mprFprintf(mp->file, "\n#\n"
"# Initializer slot assignments (Num prop %d)\n"
"#\n", ejsGetLength(ejs, (EjsObj*) fun));
count = ejsGetLength(ejs, (EjsObj*) fun);
for (i = 0; i < count; i++) {
trait = ejsGetPropertyTraits(ejs, (EjsObj*) fun, i);
qname = ejsGetPropertyName(ejs, (EjsObj*) fun, i);
if (qname.name == 0) {
continue;
}
mprAssert(trait);
lstVarSlot(mp, module, &qname, trait, i);
}
}
} else if (ejsIsFunction(ejs, obj)) {
fun = (EjsFunction*) obj;
count = ejsGetLength(ejs, (EjsObj*) obj);
if (count > 0) {
mprFprintf(mp->file, "\n#\n"
"# Local slot assignments for the \"%@\" function (Num slots %d)\n"
"#\n", fun->name, count);
for (i = 0; i < count; i++) {
trait = ejsGetPropertyTraits(ejs, obj, i);
mprAssert(trait);
qname = ejsGetPropertyName(ejs, obj, i);
lstVarSlot(mp, module, &qname, trait, i);
}
}
} else if (ejsIsType(ejs, obj)) {
/*
Types
*/
type = (EjsType*) obj;
mprFprintf(mp->file, "\n#\n"
"# Class slot assignments for the \"%@\" class (Num slots %d)\n"
"#\n", type->qname.name,
ejsGetLength(ejs, (EjsObj*) type));
count = ejsGetLength(ejs, (EjsObj*) type);
for (i = 0; i < count; i++) {
trait = ejsGetPropertyTraits(ejs, (EjsObj*) type, i);
mprAssert(trait);
qname = ejsGetPropertyName(ejs, obj, i);
lstVarSlot(mp, module, &qname, trait, i);
}
prototype = type->prototype;
if (type->baseType && type->baseType->prototype) {
numInherited = ejsGetLength(ejs, type->baseType->prototype);
} else {
numInherited = 0;
}
mprFprintf(mp->file, "\n#\n"
"# Instance slot assignments for the \"%@\" class (Num prop %d, num inherited %d)\n"
"#\n", type->qname.name,
prototype ? ejsGetLength(ejs, prototype): 0, numInherited);
if (prototype) {
count = ejsGetLength(ejs, prototype);
for (i = 0; i < count; i++) {
trait = ejsGetPropertyTraits(ejs, prototype, i);
mprAssert(trait);
qname = ejsGetPropertyName(ejs, prototype, i);
if (qname.name) {
lstVarSlot(mp, module, &qname, trait, i);
}
}
}
} else if (ejsIsBlock(ejs, obj)) {
qname = ejsGetPropertyName(ejs, parent, slotNum);
block = (EjsBlock*) obj;
count = ejsGetLength(ejs, (EjsObj*) block);
if (count > 0) {
mprFprintf(mp->file,
"\n#\n"
"# Block slot assignments for the \"%@\" (Num slots %d)\n"
"#\n", qname.name, ejsGetLength(ejs, obj));
count = ejsGetLength(ejs, obj);
for (i = 0; i < count; i++) {
trait = ejsGetPropertyTraits(ejs, obj, i);
mprAssert(trait);
qname = ejsGetPropertyName(ejs, obj, i);
lstVarSlot(mp, module, &qname, trait, i);
}
}
}
/*
Now recurse on types, functions and blocks
*/
if (obj == ejs->global) {
i = module->firstGlobal;
count = module->lastGlobal;
} else {
i = 0;
count = ejsGetLength(ejs, obj);
}
for (; i < count; i++) {
qname = ejsGetPropertyName(ejs, obj, i);
vp = ejsGetProperty(ejs, obj, i);
if (vp == 0) {
continue;
}
if (ejsIsType(ejs, vp) || ejsIsFunction(ejs, vp) || ejsIsBlock(ejs, vp)) {
lstSlotAssignments(mp, module, obj, i, vp);
}
}
SET_VISITED(obj, 0);
}