59     for (int j = 0; j < arity_; ++j) {  in GoodTestTerm()  local
60       a_[j].resize(dim[j]);  in GoodTestTerm()
61       for (int u = 0; u < dim[j]; ++u) {  in GoodTestTerm()
62         a_[j][u] = 2.0 * RandDouble() - 1.0;  in GoodTestTerm()
77     for (int j = 0; j < arity_; ++j) {  in Evaluate()  local
78       for (int u = 0; u < parameter_block_sizes()[j]; ++u) {  in Evaluate()
79         ax += a_[j][u] * parameters[j][u];  in Evaluate()
89       for (int j = 0; j < arity_; ++j) {  in Evaluate()  local
90         if (jacobians[j]) {  in Evaluate()
91           for (int u = 0; u < parameter_block_sizes()[j]; ++u) {  in Evaluate()
93             jacobians[j][u] = - f * a_[j][u];  in Evaluate()
112     for (int j = 0; j < arity_; ++j) {  in BadTestTerm()  local
113       a_[j].resize(dim[j]);  in BadTestTerm()
114       for (int u = 0; u < dim[j]; ++u) {  in BadTestTerm()
115         a_[j][u] = 2.0 * RandDouble() - 1.0;  in BadTestTerm()
130     for (int j = 0; j < arity_; ++j) {  in Evaluate()  local
131       for (int u = 0; u < parameter_block_sizes()[j]; ++u) {  in Evaluate()
132         ax += a_[j][u] * parameters[j][u];  in Evaluate()
142       for (int j = 0; j < arity_; ++j) {  in Evaluate()  local
143         if (jacobians[j]) {  in Evaluate()
144           for (int u = 0; u < parameter_block_sizes()[j]; ++u) {  in Evaluate()
146             jacobians[j][u] = - f * a_[j][u] + 0.001;  in Evaluate()
169   for (int j = 0; j < arity; ++j) {  in TEST()  local
170     parameters[j] = new double[dim[j]];  in TEST()
171     for (int u = 0; u < dim[j]; ++u) {  in TEST()
172       parameters[j][u] = 2.0 * RandDouble() - 1.0;  in TEST()
187   for (int j = 0; j < arity; j++) {  in TEST()  local
188     delete[] parameters[j];  in TEST()