![]() ![]() It'll even work with autocomplete, like so: The client will automatically collapse the tagspace to whatever you set. Just open tags->manage tag siblings, and add a few. Also, obviously, these graphs are non-cyclic-no loops. Many things can point to a single ideal, but a tag cannot have more than one ideal. Note that if you say A->B, you cannot also say A->C. Many complicated arrangements are possible (and inevitable, as we try to merge many different communities' ideal tags): graph LRĪ -> B -> I The outcome of these two arrangements is the same-everything ends up as C. You can also have an A->C and B->C that does not include A->B. ![]() In this case, everything with 'lena_oxton' or 'lena oxton' will show 'character:tracer' instead. This relationship is transitive, which means as well as saying A->B, you can also say B->C, which implies A->C and B->C. ![]() Note that this relationship implies that B is in some way 'better' than A. Let's define a relationship, A->B, that means that any time we would normally see or use tag A or tag B, we will instead only get tag B: So, how do we fix this problem? tag siblings ¶ What we really want is x∪y (both circles). making the yellow circle entirely overlap the blue by manually giving y to everything with x), searches can only return x (blue circle) or y (yellow circle) or x∩y (the lens-shaped overlap). Without continual intervention by janitors or other experienced users to make sure y⊇x (i.e.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |