connections

I realized that the plan I posted makes the implicit assumption that every search parameter is linked by a logical AND–“look for events that are X AND Y.” This is flawed. It would be a much more powerful system if I enable it to do, “find events that are X OR Y” or “find events that are NOT X”. Even more powerful, I could eventually implement connectors besides these boolean operators, e.g. “find events X that are at the same time as event Y”.

About ruoian27

Computer science student, taking Student Originated Software presently
This entry was posted in Uncategorized and tagged , , , . Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *