GitHub PushEvent at 2014-03-11 06:03:05
Repository: gmqcc
Actor: ignatenkobrain
Payload: {"shas":[["6ea88c9a3f4c95d65784fee096bd954c3b8b2118","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","subtracting != adding","Wolfgang Bumiller",true],["de12a24bc929551aa2eb2cbbe2a991dfddc076f0","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","folder: fix -fperl-logic","Wolfgang Bumiller",true],["eee7d0aac1f89e15bbc16b04c6c2cd96de76f0fb","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","vec3_pbool: or, not and","Wolfgang Bumiller",true],["1d5229ee8ca9a72d161c34938a845c53f1ef4289","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","vec3_not: be consistent with compile-time behavior here","Wolfgang Bumiller",true],["eb4486a7accdcb9af2328ee8843b68154373b9b5","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","working fold_op_cmp implementation","Wolfgang Bumiller",true],["f43106017fdb66553e1f507d3330c4490f195e9e","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","bit more concise","Wolfgang Bumiller",true],["1900262df431cecdef59970c2d90a4c87061650a","db0f63c75392faa00a4bd6355ee80c0d77d3c593@gmail.com","Use a branch instead of math on enum types","Dale Weiler",true],["73c401504614cc10a3ca12ff79984cbcca74ec26","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Fix unary minus on vector","Dale Weiler",true],["49bb172a0948d2aa665dbc7fd1a41e595ef871f5","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","folder: change ~ for floats too","Wolfgang Bumiller",true],["9131644412862ff540058f473b7c752686e46e01","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","** precedence was wrong","Wolfgang Bumiller",true],["ec03b55d1a81b425afdb9ff708a5c3d146c385dd","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","now it parses and has the desired precedence","Wolfgang Bumiller",true],["7011a2ef2ceaf9652cea0b0e61319b338667888b","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Faster CRC16 algorithm based on the Slicing-by-8 algorithm, by Michael E. Kounavis and Frank L. Berry from Intel Corp.","Dale Weiler",true],["29f2cc302b25b45491710e49c3d0c6ab28776e46","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Add reference tool","Dale Weiler",true],["ae9d3d42cf95e3bdcdc891d0261d4b2461526056","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","A better mod implementation","Dale Weiler",true],["3b6e7d0ce136f9e6ca5fc9d1ace3e1c7f7f4668e","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","indent","Dale Weiler",true],["759fca692121e736bb78dac77dcaed6919bf301c","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","slice-by-8 crc16","Wolfgang Bumiller",true],["0860b7a68ba19ec6ddf245192d8877c01b48611b","5c215fe1b203f26a3852e51db87d2ddf76b34fe6@bumiller.com","crc16 slice-by-8 table generator code included for reference","Wolfgang Bumiller",true],["d9572e3e303929e1b6d7267d43c0904dac3078f5","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Fixed pow/exp using fast approximation until the fractional part is hit. Once fractional is reached a binary search is used to get close to the value.","Dale Weiler",true],["b1fd85b711c76a3fc719f4071e9475a5b21a8cc9","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Merge branch 'cooking' of github.com:graphitemaster/gmqcc into cooking","Dale Weiler",true],["292c8150b47f3e6fb65125e08a3b3243dc655c5c","f08e9e28615433c55489423238587ad30c1b3d06@gmail.com","Resolve undefined functions to compiler builtins if they exist.","Dale Weiler",true]],"size":94,"ref":"refs/heads/master","head":"7ffda37513835bbf0aaa65f4ad4984c41028d410"}