Home
last modified time | relevance | path

Searched refs:commonTags (Results 1 – 6 of 6) sorted by relevance

/dports/games/chessx/chessx-1.5.6/dep/scid/code/src/
H A Dbytebuf.h50 constexpr std::string_view commonTags[] = { variable
73 const auto it = std::find(commonTags, std::end(commonTags), tag.first); in encodeTags()
74 if (it != std::end(commonTags)) { in encodeTags()
76 const auto tagnum = std::distance(commonTags, it) + MAX_TAG_LEN + 1; in encodeTags()
175 fn(commonTags[tagID], std::string_view(value, valueLen)); in decodeTags()
/dports/net/traefik/traefik-2.6.1/vendor/github.com/ExpediaDotCom/haystack-client-go/
H A Dtracer_options.go43 tracer.commonTags = append(tracer.commonTags, opentracing.Tag{Key: key, Value: value})
H A Dtracer.go34 commonTags []opentracing.Tag member
198 return tracer.commonTags
/dports/net-mgmt/bosun/bosun-0.9.0-preview/vendor/github.com/google/cadvisor/storage/influxdb/
H A Dinfluxdb.go158 commonTags := map[string]string{
164 addTagsToPoint(points[i], commonTags)
/dports/math/cvc4/CVC4-1.7/src/theory/uf/
H A Dequality_engine.cpp2060 Theory::Set commonTags = Theory::setIntersection(inputTags, toCompareTriggerSet.tags); in getDisequalities() local
2061 if (commonTags) { in getDisequalities()
2094 Theory::Set commonTags = Theory::setIntersection(disequalityTriggerSet.tags, tags); in propagateTriggerTermDisequalities() local
2095 Assert(commonTags); in propagateTriggerTermDisequalities()
2108 while (!d_done && ((currentTag = Theory::setPop(commonTags)) != THEORY_LAST)) { in propagateTriggerTermDisequalities()
/dports/games/scid/scid/src/
H A Dgame.cpp3135 static const char* commonTags[255 - MAX_TAG_LEN] = { variable
3163 const char ** common = commonTags; in encodeTags()
3212 char * ctag = (char *) commonTags[b - MAX_TAG_LEN - 1]; in DecodeTags()