mod2sparse_find   108 alist-to-pchk.c     { if (nxt<=0 || nxt>N || mod2sparse_find(H,i,nxt-1))
mod2sparse_find   119 alist-to-pchk.c     { if (nxt<=0 || nxt>M || !mod2sparse_find(H,nxt-1,j))
mod2sparse_find   190 make-ldpc.c              } while (mod2sparse_find(H,i,j));
mod2sparse_find   229 make-ldpc.c              for (i = t; i<cb_N && mod2sparse_find(H,u[i],j); i++) ;
mod2sparse_find   235 make-ldpc.c                } while (mod2sparse_find(H,i,j));
mod2sparse_find   241 make-ldpc.c                } while (mod2sparse_find(H,u[i],j));
mod2sparse_find   307 make-ldpc.c          } while (mod2sparse_find(H,i,j));
mod2sparse_find   341 make-ldpc.c                      } while (mod2sparse_find(H,i,j));
mod2sparse_find   231 mod2sparse-test.c   e = mod2sparse_find(s3,1,2);
mod2sparse_find   243 mod2sparse-test.c   e = mod2sparse_find(s3,1,1);
mod2sparse_find   126 mod2sparse.h   mod2entry *mod2sparse_find   (mod2sparse *, int, int);