search for: currentpo

...; void advance(double *node, int *current_pos, double newval); void retreat(double *node, int *current_pos); double new_val(double *node, double theta, int current_pos); double accept_prob(double *node, double theta, int current_pos); double accept_prob_fn(double a, double y); int main() { int currentpos = 0; int i; double newval, node[T+2], theta = THETA, p, u; set_seed(time(NULL), clock()); node[0]=0; for(i=1;i<=T;i++) node[i]= INITVAL; /* for simplicity choose all values the same */ node[T+1]=0; for(i=0; currentpos < T; i++) { u = unif_rand(); newval...

...they are the best when speed is a concern. but the problem is that sometimes ov_raw_tell returns the same value before and after calling ov_read; here's an example: prevPos = ov_raw_tell(&vf); const long ret = ov_read(&vf, temp_buffer, 4096, 0, bytesPerSample, 1, &current_section); currentPos = ov_raw_tell(&vf); now, if I check, I'll find that prevPos == currentPos, how could this be true?? I tried the other seeking methods, which are time and pcm, and none of the did the same, prevPos is never equal to currentPos. so how can I solve this? thanks for your time and effort....