/dports/biology/avida/avida-2.12.4-src/avida-core/source/tools/ |
H A D | cArgSchema.cc | 41 if (m_ints.GetSize() <= in_idx) m_ints.Resize(in_idx + 1, NULL); in AddEntry() 42 m_ints[in_idx] = entry; in AddEntry() 45 if (m_doubles.GetSize() <= in_idx) m_doubles.Resize(in_idx + 1, NULL); in AddEntry() 46 m_doubles[in_idx] = entry; in AddEntry() 49 if (m_strings.GetSize() <= in_idx) m_strings.Resize(in_idx + 1, NULL); in AddEntry() 70 if (m_ints.GetSize() <= in_idx) m_ints.Resize(in_idx + 1, NULL); in AddEntry() 71 m_ints[in_idx] = entry; in AddEntry() 108 if (m_doubles.GetSize() <= in_idx) m_doubles.Resize(in_idx + 1, NULL); in AddEntry() 109 m_doubles[in_idx] = entry; in AddEntry() 147 if (m_strings.GetSize() <= in_idx) m_strings.Resize(in_idx + 1, NULL); in AddEntry() [all …]
|
H A D | cArgSchema.h | 59 …sArgSchemaEntry(const cString& in_name, int in_idx, tType in_type) // Required Argument (supplied… in sArgSchemaEntry() 60 : name(in_name), type(in_type), index(in_idx), optional(false), has_range_limits(false) { ; } in sArgSchemaEntry() 61 sArgSchemaEntry(const cString& in_name, int in_idx, int def) // Optional Int Argument in sArgSchemaEntry() 62 …: name(in_name), type(SCHEMA_INT), index(in_idx), optional(true), def_int(def), has_range_limits(f… in sArgSchemaEntry() 63 sArgSchemaEntry(const cString& in_name, int in_idx, double def) // Optional Double Argument in sArgSchemaEntry() 64 …: name(in_name), type(SCHEMA_DOUBLE), index(in_idx), optional(true), def_double(def), has_range_li… in sArgSchemaEntry() 65 sArgSchemaEntry(const cString& in_name, int in_idx, cString* def) // Optional String Argument in sArgSchemaEntry() 93 …bool AddEntry(cString in_name, int in_idx, tType in_type); // Required Argument (… 94 …bool AddEntry(cString in_name, int in_idx, int def); // Optional Int Argum… 97 …bool AddEntry(cString in_name, int in_idx, double def); // Optional Double Arg… [all …]
|
/dports/comms/fldigi/fldigi-4.1.20/src/libtiniconv/ |
H A D | tiniconv.c | 55 int in_idx, out_idx; in tiniconv_convert() local 63 for (in_idx = 0, out_idx = 0; in_idx < in_size && out_idx < out_size;) in tiniconv_convert() 67 result = ctx->mb2wc(ctx, &wc, in_buf + in_idx, in_size - in_idx); in tiniconv_convert() 68 assert(result <= in_size - in_idx); in tiniconv_convert() 76 in_idx ++; in tiniconv_convert() 92 in_idx += RET_TOOFEW(result); in tiniconv_convert() 96 in_idx += last_result = result; in tiniconv_convert() 114 in_idx -= last_result; /* discarding the last read sequence */ in tiniconv_convert() 122 in_idx -= last_result; /* discarding the last read sequence */ in tiniconv_convert() 133 *p_in_size_consumed = in_idx; in tiniconv_convert()
|
/dports/comms/gnuradio/gnuradio-3.8.4.0/gr-blocks/lib/ |
H A D | multiply_matrix_impl.cc | 41 for (size_t in_idx = 0; in_idx < ninput_ports; in_idx++) { in propagate_tags_by_A() local 42 this->get_tags_in_window(tags, in_idx, 0, noutput_items); in propagate_tags_by_A() 45 if (d_A[out_idx][in_idx] == std::complex<float>(0, 0)) { in propagate_tags_by_A() 129 for (size_t in_idx = 0; in_idx < ninput_ports; in_idx++) { in propagate_tags_by_A() local 130 get_tags_in_window(tags, in_idx, 0, noutput_items); in propagate_tags_by_A() 133 if (d_A[out_idx][in_idx] == 0) { in propagate_tags_by_A() 277 for (size_t in_idx = 1; in_idx < input_items.size(); in_idx++) { in work() local 281 out[i] += in[i] * d_A[out_idx][in_idx]; in work() 302 for (size_t in_idx = 1; in_idx < input_items.size(); in_idx++) { in work() local 303 in = reinterpret_cast<const float*>(input_items[in_idx]); in work() [all …]
|
/dports/math/octave-forge-control/control-3.3.1/inst/@lti/ |
H A D | __lti_prune__.m | 27 function [lti, out_idx, in_idx] = __lti_prune__ (lti, out_idx, in_idx) 32 if (ischar (in_idx) && ! strcmp (in_idx, ":")) # sys(:, "grp") 33 in_idx = {in_idx}; variable 40 if (iscell (in_idx)) # sys(:, {"grp1", "grp2"}) 41 …tmp = cellfun (@(x) __str2idx__ (lti.ingroup, lti.inname, x, "in"), in_idx, "uniformoutput", false… 42 in_idx = vertcat (tmp{:}); variable 54 …[lti.ingroup, empty] = structfun (@(x) __group_prune__ (x, in_idx, m), lti.ingroup, "uniformoutput… 61 lti.inname = lti.inname(in_idx);
|
H A D | connect.m | 76 if (is_real_matrix (varargin{2})) # connect (sys, cm, in_idx, out_idx) 84 in_idx = varargin{3}; variable 111 if ((! is_real_vector (in_idx)) || (! isequal (in_idx, floor (in_idx)))) 115 if ((max (in_idx) > m) || (min (in_idx) <= 0)) 135 sys = __sys_prune__ (sys, out_idx, in_idx); 144 in_idx = varargin(io_idx){1}; variable 147 in_idx = ":"; variable 175 ## sys_prune will error out if names in out_idx and in_idx are not unique 176 ## the dark side handles cases with common in_idx names - so do we 184 if (is_real_vector (in_idx)) [all …]
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/logformat/clog2TOdrawable/ |
H A D | ObjDef.java | 27 public ObjDef( int in_idx, final RecDefState in_def, in ObjDef() argument 30 super( in_idx, in_def.name, in_topo, in ObjDef() 37 public ObjDef( int in_idx, final RecDefEvent in_def, in ObjDef() argument 40 super( in_idx, in_def.name, in_topo, in ObjDef() 47 public ObjDef( int in_idx, in ObjDef() argument 51 super( in_idx, in_def.name, in_topo, in_color, in_width ); in ObjDef()
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/libjava/java/io/ |
H A D | natFilePosix.cc | 144 int in_idx = 0; in getCanonicalPath() local 145 while (buf[in_idx] != '\0') in getCanonicalPath() 148 while (buf[in_idx] == '/') in getCanonicalPath() 149 ++in_idx; in getCanonicalPath() 150 int elt_start = in_idx; in getCanonicalPath() 152 while (buf[in_idx] != '\0' && buf[in_idx] != '/') in getCanonicalPath() 153 ++in_idx; in getCanonicalPath() 154 if (in_idx == elt_start) in getCanonicalPath() 159 int len = in_idx - elt_start; in getCanonicalPath() 160 if (len == 1 && buf[in_idx] == '.') in getCanonicalPath() [all …]
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/libjava/java/io/ |
H A D | natFilePosix.cc | 144 int in_idx = 0; in getCanonicalPath() local 145 while (buf[in_idx] != '\0') in getCanonicalPath() 148 while (buf[in_idx] == '/') in getCanonicalPath() 149 ++in_idx; in getCanonicalPath() 150 int elt_start = in_idx; in getCanonicalPath() 152 while (buf[in_idx] != '\0' && buf[in_idx] != '/') in getCanonicalPath() 153 ++in_idx; in getCanonicalPath() 154 if (in_idx == elt_start) in getCanonicalPath() 159 int len = in_idx - elt_start; in getCanonicalPath() 160 if (len == 1 && buf[in_idx] == '.') in getCanonicalPath() [all …]
|
/dports/security/py-pyvex/binaries-9.0.5405/tests_src/ |
H A D | path_encoding_overflow.c | 114 int in_idx = 0; in path_decode() local 115 while (in[in_idx] && in[in_idx+1]) { in path_decode() 116 out[out_idx] = (char)(16*path_char_to_val(in[in_idx]) + path_char_to_val(in[in_idx+1])); in path_decode() 118 in_idx += 2; in path_decode()
|
/dports/security/py-ailment/binaries-9.0.5405/tests_src/ |
H A D | path_encoding_overflow.c | 114 int in_idx = 0; in path_decode() local 115 while (in[in_idx] && in[in_idx+1]) { in path_decode() 116 out[out_idx] = (char)(16*path_char_to_val(in[in_idx]) + path_char_to_val(in[in_idx+1])); in path_decode() 118 in_idx += 2; in path_decode()
|
/dports/security/py-angr/binaries-9.0.5405/tests_src/ |
H A D | path_encoding_overflow.c | 114 int in_idx = 0; in path_decode() local 115 while (in[in_idx] && in[in_idx+1]) { in path_decode() 116 out[out_idx] = (char)(16*path_char_to_val(in[in_idx]) + path_char_to_val(in[in_idx+1])); in path_decode() 118 in_idx += 2; in path_decode()
|
/dports/devel/py-cle/binaries-9.0.5405/tests_src/ |
H A D | path_encoding_overflow.c | 114 int in_idx = 0; in path_decode() local 115 while (in[in_idx] && in[in_idx+1]) { in path_decode() 116 out[out_idx] = (char)(16*path_char_to_val(in[in_idx]) + path_char_to_val(in[in_idx+1])); in path_decode() 118 in_idx += 2; in path_decode()
|
/dports/biology/py-pysam/pysam-0.18.0/htslib/htscodecs/htscodecs/ |
H A D | fqzcomp_qual.c | 1164 int in_idx = 0; in fqz_read_parameters1() local 1171 pm->context = in[in_idx] + (in[in_idx+1]<<8); in fqz_read_parameters1() 1172 in_idx += 2; in fqz_read_parameters1() 1208 in_idx += read_array(in+in_idx, in_size-in_idx, pm->qtab, 256); in fqz_read_parameters1() 1215 in_idx += read_array(in+in_idx, in_size-in_idx, pm->ptab, 1024); in fqz_read_parameters1() 1221 in_idx += read_array(in+in_idx, in_size-in_idx, pm->dtab, 256); in fqz_read_parameters1() 1226 return in_idx; in fqz_read_parameters1() 1253 in_idx += read_array(in+in_idx, in_size-in_idx, gp->stab, 256); in fqz_read_parameters() 1270 in_idx += e; in fqz_read_parameters() 1277 return in_idx; in fqz_read_parameters() [all …]
|
/dports/biology/htslib/htslib-1.14/htscodecs/htscodecs/ |
H A D | fqzcomp_qual.c | 1164 int in_idx = 0; in fqz_read_parameters1() local 1171 pm->context = in[in_idx] + (in[in_idx+1]<<8); in fqz_read_parameters1() 1172 in_idx += 2; in fqz_read_parameters1() 1208 in_idx += read_array(in+in_idx, in_size-in_idx, pm->qtab, 256); in fqz_read_parameters1() 1215 in_idx += read_array(in+in_idx, in_size-in_idx, pm->ptab, 1024); in fqz_read_parameters1() 1221 in_idx += read_array(in+in_idx, in_size-in_idx, pm->dtab, 256); in fqz_read_parameters1() 1226 return in_idx; in fqz_read_parameters1() 1253 in_idx += read_array(in+in_idx, in_size-in_idx, gp->stab, 256); in fqz_read_parameters() 1270 in_idx += e; in fqz_read_parameters() 1277 return in_idx; in fqz_read_parameters() [all …]
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/runtime/graph/ |
H A D | graph_runtime.cc | 206 int in_idx = GetInputIndex(names[i]); in LoadParams() local 207 if (in_idx < 0) { in LoadParams() 212 uint32_t eid = this->entry_id(input_nodes_[in_idx], 0); in LoadParams() 234 int in_idx = GetInputIndex(names[i]); in ShareParams() local 235 if (in_idx < 0) continue; in ShareParams() 405 if (in_idx >= 0) this->SetInput(in_idx, args[1]); in GetFunction() 414 if (in_idx >= 0) this->SetInputZeroCopy(in_idx, args[1]); in GetFunction() 429 int in_idx = 0; in GetFunction() local 433 in_idx = args[0]; in GetFunction() 435 if (in_idx >= 0) { in GetFunction() [all …]
|
/dports/misc/tvm/incubator-tvm-0.6.1/src/runtime/graph/ |
H A D | graph_runtime.cc | 212 int in_idx = GetInputIndex(names[i]); in LoadParams() local 239 int in_idx = GetInputIndex(names[i]); in ShareParams() local 419 int in_idx = this->GetInputIndex(args[0]); in GetFunction() local 420 if (in_idx >= 0) this->SetInput(in_idx, args[1]); in GetFunction() 428 int in_idx = this->GetInputIndex(args[0]); in GetFunction() local 429 if (in_idx >= 0) this->SetInputZeroCopy(in_idx, args[1]); in GetFunction() 444 int in_idx = 0; in GetFunction() local 446 in_idx = this->GetInputIndex(args[0]); in GetFunction() 448 in_idx = args[0]; in GetFunction() 450 CHECK_GE(in_idx, 0); in GetFunction() [all …]
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/src/runtime/graph/ |
H A D | graph_runtime.cc | 212 int in_idx = GetInputIndex(names[i]); in LoadParams() local 239 int in_idx = GetInputIndex(names[i]); in ShareParams() local 419 int in_idx = this->GetInputIndex(args[0]); in GetFunction() local 420 if (in_idx >= 0) this->SetInput(in_idx, args[1]); in GetFunction() 428 int in_idx = this->GetInputIndex(args[0]); in GetFunction() local 429 if (in_idx >= 0) this->SetInputZeroCopy(in_idx, args[1]); in GetFunction() 444 int in_idx = 0; in GetFunction() local 446 in_idx = this->GetInputIndex(args[0]); in GetFunction() 448 in_idx = args[0]; in GetFunction() 450 CHECK_GE(in_idx, 0); in GetFunction() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/logformat/clogTOdrawable/ |
H A D | ObjDef.java | 25 public ObjDef( int in_idx, final RecDefState in_def, in ObjDef() argument 28 super( in_idx, in_def.description, in_topo, in ObjDef() 34 public ObjDef( int in_idx, in ObjDef() argument 38 super( in_idx, in_def.description, in_topo, in_color, in_width ); in ObjDef()
|
/dports/math/octave-forge-control/control-3.3.1/inst/@tf/ |
H A D | __sys_prune__.m | 27 function sys = __sys_prune__ (sys, out_idx, in_idx) 29 [sys.lti, out_idx, in_idx] = __lti_prune__ (sys.lti, out_idx, in_idx); 31 sys.num = sys.num(out_idx, in_idx); 32 sys.den = sys.den(out_idx, in_idx);
|
/dports/misc/py-mxnet/incubator-mxnet-1.9.0/src/operator/contrib/ |
H A D | dgl_graph-inl.h | 52 const TBlob &in_idx = inputs[0].aux_data(csr::kIdx); in DGLAdjacencyForwardEx() local 55 outputs[0].CheckAndAllocData(in_idx.shape_); in DGLAdjacencyForwardEx() 56 outputs[0].CheckAndAllocAuxData(csr::kIdx, in_idx.shape_); in DGLAdjacencyForwardEx() 61 mxnet_op::copy(s, outputs[0].aux_data(csr::kIdx), in_idx); in DGLAdjacencyForwardEx()
|
/dports/misc/mxnet/incubator-mxnet-1.9.0/src/operator/contrib/ |
H A D | dgl_graph-inl.h | 52 const TBlob &in_idx = inputs[0].aux_data(csr::kIdx); in DGLAdjacencyForwardEx() local 55 outputs[0].CheckAndAllocData(in_idx.shape_); in DGLAdjacencyForwardEx() 56 outputs[0].CheckAndAllocAuxData(csr::kIdx, in_idx.shape_); in DGLAdjacencyForwardEx() 61 mxnet_op::copy(s, outputs[0].aux_data(csr::kIdx), in_idx); in DGLAdjacencyForwardEx()
|
/dports/misc/tvm/incubator-tvm-0.6.1/python/tvm/autotvm/graph_tuner/utils/ |
H A D | utils.py | 45 for in_idx in node["inputs"]: 46 in_idx = in_idx[0] 47 in_node = node_list[in_idx]
|
/dports/misc/py-tvm/incubator-tvm-0.6.1/python/tvm/autotvm/graph_tuner/utils/ |
H A D | utils.py | 45 for in_idx in node["inputs"]: 46 in_idx = in_idx[0] 47 in_node = node_list[in_idx]
|
/dports/biology/iolib/io_lib-io_lib-1-14-10/io_lib/ |
H A D | fqzcomp_qual.c | 325 int vers = in[in_idx++]; in uncompress_block_fqz2f() 326 int max_sym = in[in_idx++]; in uncompress_block_fqz2f() 327 int nsym = in[in_idx++]; in uncompress_block_fqz2f() 332 qmap[i] = in[in_idx++]; in uncompress_block_fqz2f() 370 (in[in_idx+0]<< 0) in uncompress_block_fqz2f() 371 | (in[in_idx+1]<< 8) in uncompress_block_fqz2f() 372 | (in[in_idx+2]<<16) in uncompress_block_fqz2f() 373 | (in[in_idx+3]<<24); in uncompress_block_fqz2f() 374 in_idx+=4; in uncompress_block_fqz2f() 376 RC_SetInput(&rc, (char *)in+in_idx); in uncompress_block_fqz2f() [all …]
|