Originally Posted by
UnlucksMcGee
(I'm on mobile, so can't format my replies nicely, sorry)
@SodaPop
That's a nice different way of approaching it, but it has one flaw. It doesn't allow the employee to forget to clock-in/out, or sometimes clock-in twice (which happens often).
This is hardly unique as binary clocking is a pretty standard solve amongst professional clocking apps as the base clock method.
It isn't supposed to handle clock errors, as you pointed out you have a method to make corrections.
The problem here is design but also something we can't fix it seems so be that what it is you need a solution for where you are:
Assuming the clocks are all always correct and always have equal rows (which is what I think you are saying) you're headed in the right direction.
You said you have two queries so just number the rows for each query unique by name and date. So Q1 has John Doe's in clocks 1,2,3,4,5 and Q2 clocks 1,2,3,4,5 of say 01/05. Join those two queries by name (or other employee ID), date, and clock number. Pull the employee info you want and q1 clocks as in, and q2 clocks as out, right next to each other, then do the math.
Theory being you should have = in and out clocks so the rank of each oldest to newest should be the opposite sister record. Q1 R1 is the in punch to Q2 R1 out punch.
Hope that helps. Happy coding.