Imagine there’s an akrasia-aware camel who wants to drink more water, enough to support his trek across the desert. He’s hip, so he signs up for Beeminder.
This camel is clever and wants to put a cap on the number of gallons of water Beeminder counts each day. “If I drink two gallons,” he thinks, “Beeminder should count 2 for that day. But I drink five gallons, Beeminder should still only count 2.”
How does this hypothetical, akrasia-aware, clever camel achieve this?
- The “max” aggregation method could be the solution… until the camel reads the aggday docs. (And yes, this camel can read, too!)
- “Binary” is close, but the camel isn’t measuring whether he drank water or not (possible values only 0 or 1). Rather, he’s Beeminding how much water he drank (0, 1, or 2).
- “Sum” is the default method and works fine except it doesn’t limit the amount counted per day.
- Maybe the camel has to choose “last” and do the math himself? In this case, if he drinks a gallon of water, he enters 1 in Beeminder. Later on, he drinks another three gallons, so he enters 2 (1+3 = 4, but cap it at 2). That seems to be fudging the numbers though.
What would you suggest to our camel friend?
P.S.: I don’t know whether the camel is of the one- or two-humped variety. But probably two because they’re cool.