Exemplo n.º 1
0
RELATION UnSet(KEY leftKey, RELATION id, KEY rightKey)
{
    register struct relationDef *rd = FindRelation(id);

    if (rd && CompareKey) {
	register struct relation *r;
	register struct relation **h;

	h = &rd->rd_relationsTable;

	for (r = rd->rd_relationsTable; r; r = r->r_next) {
	    if (CompareKey(r->r_leftKey, leftKey)
		&& CompareKey(r->r_rightKey, rightKey)) {
		*h = r->r_next;

		TCFreeMem(r, sizeof(*r));
		return id;
	    }

	    h = &r->r_next;
	}
    }

    return 0;
}
Exemplo n.º 2
0
RELATION SetP(KEY leftKey, RELATION id, KEY rightKey, PARAMETER parameter)
{
    register struct relationDef *rd = FindRelation(id);

    if (rd && CompareKey) {
	register struct relation *r;

	for (r = rd->rd_relationsTable; r; r = r->r_next) {
	    if (CompareKey(r->r_leftKey, leftKey)
		&& CompareKey(r->r_rightKey, rightKey)) {
		if (parameter != NO_PARAMETER)
		    r->r_parameter = parameter;
		return id;
	    }
	}

	if ((r = (struct relation *) TCAllocMem(sizeof(*r), 0))) {
	    r->r_next = rd->rd_relationsTable;
	    rd->rd_relationsTable = r;

	    r->r_leftKey = leftKey;
	    r->r_rightKey = rightKey;
	    r->r_parameter = parameter;

	    return id;
	}
    }

    return 0;
}
Exemplo n.º 3
0
RELATION CloneRelation(RELATION id, RELATION cloneId)
{
    register struct relationDef *rd;

    if ((rd = FindRelation(id))) {
	if (AddRelation(cloneId) || FindRelation(cloneId)) {
	    register struct relation *r;

	    for (r = rd->rd_relationsTable; r; r = r->r_next) {
		SetP(r->r_leftKey, cloneId, r->r_rightKey, r->r_parameter);
	    }

	    return cloneId;
	}
    }

    return 0;
}
Exemplo n.º 4
0
void AskAll(KEY leftKey, RELATION id, void (*UseKey) (void *))
{
    register struct relationDef *rd = FindRelation(id);

    if (rd && CompareKey) {
	register struct relation *r;

	for (r = rd->rd_relationsTable; r; r = r->r_next) {
	    if (CompareKey(r->r_leftKey, leftKey)) {
		if (UseKey)
		    UseKey(r->r_rightKey);
	    }
	}
    }
}
Exemplo n.º 5
0
PARAMETER GetP(KEY leftKey, RELATION id, KEY rightKey)
{
    register struct relationDef *rd = FindRelation(id);

    if (rd && CompareKey) {
	register struct relation *r;

	for (r = rd->rd_relationsTable; r; r = r->r_next) {
	    if (CompareKey(r->r_leftKey, leftKey)
		&& CompareKey(r->r_rightKey, rightKey))
		return r->r_parameter;
	}
    }

    return NO_PARAMETER;
}
Exemplo n.º 6
0
RELATION AddRelation(RELATION id)
{
    register struct relationDef *rd;

    if (!FindRelation(id)) {
	if ((rd = (struct relationDef *) TCAllocMem(sizeof(*rd), 0))) {
	    rd->rd_next = relationsDefBase;
	    relationsDefBase = rd;

	    rd->rd_id = id;
	    nrOfRelations++;

	    rd->rd_relationsTable = NULL;

	    return rd->rd_id;
	}
    }

    return 0;
}
Exemplo n.º 7
0
RELATION AskP(KEY leftKey, RELATION id, KEY rightKey, PARAMETER parameter,
	      COMPARSION comparsion)
{
    register struct relationDef *rd = FindRelation(id);

    if (rd && CompareKey) {
	register struct relation *r;

	for (r = rd->rd_relationsTable; r; r = r->r_next) {
	    if (CompareKey(r->r_leftKey, leftKey)
		&& CompareKey(r->r_rightKey, rightKey)) {
		if (comparsion && (parameter != NO_PARAMETER)) {
		    if (comparsion & CMP_EQUAL) {
			if (comparsion & CMP_HIGHER)
			    return (r->r_parameter >= parameter ? id : 0);
			else if (comparsion & CMP_LOWER)
			    return (r->r_parameter <= parameter ? id : 0);

			return (r->r_parameter == parameter ? id : 0);
		    } else if (comparsion & CMP_HIGHER)
			return (r->r_parameter > parameter ? id : 0);
		    else if (comparsion & CMP_LOWER)
			return (r->r_parameter < parameter ? id : 0);
		    else if (comparsion & CMP_NOT_EQUAL)
			return (r->r_parameter != parameter ? id : 0);

		    return 0;
		}

		return id;
	    }
	}
    }

    return 0;
}
Exemplo n.º 8
0
	bool PairSameWithTable( const vector<pair<string,string>>& expect,const shared_ptr<iConceptInteractTable> table )
	{
		class FindRelation
		{
			pair<string,string> _p;
		public: 
			FindRelation(const pair<string,string> p):_p(p){}
			~FindRelation(){}

			bool operator()(const pair<shared_ptr<iConcept>,shared_ptr<iConcept>> conceptPair)
			{
				if(conceptPair.first->GetString()==_p.first && conceptPair.second->GetString()==_p.second)
				{
					return true;
				}
				else
				{
					return false;
				}
			}
		};

		vector<pair<shared_ptr<iConcept>,shared_ptr<iConcept>>> relations=table->GetAllRelations();
		if(relations.size()!=expect.size())
		{
			return false;
		}

		for (size_t i=0;i<expect.size();++i)
		{
			vector<pair<shared_ptr<iConcept>,shared_ptr<iConcept>>>::iterator iter=find_if(relations.begin(),relations.end(),FindRelation(expect[i]));
			if(iter==relations.end())
			{
				return false;
			}
			else
			{
				relations.erase(iter);
			}
		}

		return true;
	}
Exemplo n.º 9
0
int LoadRelations(char *file, U16 disk_id)
{
    RELATION rd;
    PARAMETER parameter;
    char buffer[256];
    char left[256];
    char right[256];
    U8 goOn;
    FILE *fh = NULL;
    U32 dummy;

    buffer[0] = '\0';
    left[0] = '\0';
    right[0] = '\0';

    if (EncodeKey) {
	if ((fh = dskOpen(file, "rb"))) {
	    dskGetLine(buffer, sizeof(buffer), fh);

	    if (strcmp(buffer, REL_FILE_MARK) == 0) {
		dskGetLine(buffer, sizeof(buffer), fh);

		while (!feof(fh) && strcmp(buffer, REL_TABLE_MARK) == 0) {
		    fscanf(fh, "%" SCNu32 "\r\n", &rd);

		    goOn = 0;
		    if (FindRelation(rd))
			goOn = 1;
		    else {
			if (AddRelation(rd))
			    goOn = 1;
		    }

		    if (goOn) {
			while (dskGetLine(left, sizeof(left), fh)) {
			    if (strcmp(left, REL_TABLE_MARK) == 0) {
				strcpy(buffer, left);
				break;
			    }

			    if (sscanf(left, "%" SCNu32, &dummy) != 1)
				break;

			    dskGetLine(right, sizeof(right), fh);

			    if (sscanf(right, "%" SCNu32, &dummy) != 1)
				break;

			    if (fscanf(fh, "%" SCNu32 "\r\n", &parameter) != 1)
				break;

			    if (!SetP
				(EncodeKey(left), rd, EncodeKey(right),
				 parameter)) {
				dskClose(fh);
				return 0;
			    }
			}
		    } else {
			dskClose(fh);
			return 0;
		    }
		}

		dskClose(fh);
		return 1;
	    }

	    dskClose(fh);
	}
    }

    return 0;
}