Pitthea trifasciata

Pitthea trifasciata is a moth of the family Geometridae first described by Hermann Dewitz in 1881.

Pitthea trifasciata
Scientific classification
Kingdom:
Phylum:
Class:
Order:
Family:
Genus:
Species:
P. trifasciata
Binomial name
Pitthea trifasciata
Dewitz, 1881
Synonyms
  • Hymenocharta triplagiata Warren, 1897

Distribution

It is found in Kenya, Niger, Uganda, Zimbabwe and Tanzania.[1]

gollark: The embed says "no" on heav's website, fix?
gollark: This is not ideal. How can we use more without boring things like cryptominers?
gollark: Okay, this might fix it, pushed.
gollark: If the issue is what I think it could be, then it's accidentally dropping? data on the threshold of the rolling counter region incorrectly.
gollark: ```nimproc pollTargets(ctx: Ctx) {.async.} = for row in ctx.db.all("SELECT * FROM sites"): var (id, url, rollingTotalPings, rollingSuccessfulPings, rollingLatency, rollingDataSince) = row.unpack((int64, string, int64, int64, int64, Option[Time])) let res = await ctx.pollTarget(url) let threshold = getTime() # drop old data from rolling counters if rollingDataSince.isSome: for row in ctx.db.iterate("SELECT status, latency FROM reqs WHERE timestamp >= ? AND timestamp <= ? AND site = ?", rollingDataSince.get, threshold, id): let (statusRaw, latency) = row.unpack((int, int)) rollingTotalPings -= 1 rollingLatency -= latency if statusRaw <= 0: rollingSuccessfulPings -= 1 # add new data rollingTotalPings += 1 rollingLatency += res.latency if int(res.rtype) <= 0: rollingSuccessfulPings += 1 ctx.db.transaction: ctx.db.exec("UPDATE sites SET rc_total = ?, rc_success = ?, rc_latency = ?, rc_data_since = ? WHERE sid = ?", rollingTotalPings, rollingSuccessfulPings, rollingLatency, threshold, id) ctx.db.exec("INSERT INTO reqs (site, timestamp, status, latency) VALUES (?, ?, ?, ?)", id, getTime(), int(res.rtype), res.latency)```This is the core algorithm.

References

  1. De Prins, J. & De Prins, W. (2018). "Pitthea trifasciata Dewitz, 1881". Afromoths. Retrieved April 12, 2019.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.