/dports/www/moodle310/moodle/lib/behat/classes/ |
H A D | behat_core_generator.php | 306 $data['password'] = $data['username']; 371 if (isset($data['grade']) && strlen($data['grade']) && !is_number($data['grade'])) { 381 $data['idnumber'] = $data['name']; 439 $this->datagenerator->create_block($data['blockname'], $data, $data); 543 …$this->datagenerator->enrol_user($data['userid'], $data['courseid'], $data['roleid'], $data['enrol… 544 $data['timestart'], $data['timeend'], $data['status']); 746 ->create_question($data['qtype'], $which, $data); 777 [$data['userid'], $data['contactid']] 835 [$data['userid'], $data['contactid']] 873 [$data['userid'], $data['contactid']] [all …]
|
/dports/www/moodle39/moodle/lib/behat/classes/ |
H A D | behat_core_generator.php | 306 $data['password'] = $data['username']; 371 if (isset($data['grade']) && strlen($data['grade']) && !is_number($data['grade'])) { 381 $data['idnumber'] = $data['name']; 439 $this->datagenerator->create_block($data['blockname'], $data, $data); 543 …$this->datagenerator->enrol_user($data['userid'], $data['courseid'], $data['roleid'], $data['enrol… 544 $data['timestart'], $data['timeend'], $data['status']); 746 ->create_question($data['qtype'], $which, $data); 777 [$data['userid'], $data['contactid']] 835 [$data['userid'], $data['contactid']] 873 [$data['userid'], $data['contactid']] [all …]
|
/dports/graphics/sane-backends/sane-backends-1.0.32/testsuite/backend/genesys/ |
H A D | tests_image.cpp | 39 ASSERT_EQ(get_pixel_from_row(data.data(), 0, PixelFormat::I1), in test_get_pixel_from_row() 41 ASSERT_EQ(get_pixel_from_row(data.data(), 3, PixelFormat::I1), in test_get_pixel_from_row() 51 ASSERT_EQ(get_pixel_from_row(data.data(), 0, PixelFormat::I8), in test_get_pixel_from_row() 80 Data data; in test_set_pixel_to_row() local 88 set_pixel_to_row(data.data(), 0, pixel, PixelFormat::I1); in test_set_pixel_to_row() 94 set_pixel_to_row(data.data(), 2, pixel, PixelFormat::I1); in test_set_pixel_to_row() 100 set_pixel_to_row(data.data(), 8, pixel, PixelFormat::I1); in test_set_pixel_to_row() 124 set_pixel_to_row(data.data(), 0, pixel, PixelFormat::I8); in test_set_pixel_to_row() 130 set_pixel_to_row(data.data(), 2, pixel, PixelFormat::I8); in test_set_pixel_to_row() 243 Data data; in test_set_raw_pixel_to_row() local [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 81 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); in test() 91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test() 92 (void)std::includes(t.data, t.data+10, u.data, u.data+10); in test() 104 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 112 (void)std::search(t.data, t.data+10, u.data, u.data+5); in test() 114 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 115 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 116 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 117 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 122 (void)std::equal(t.data, t.data+10, u.data, u.data+10); in test() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 81 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); in test() 91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test() 92 (void)std::includes(t.data, t.data+10, u.data, u.data+10); in test() 104 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 112 (void)std::search(t.data, t.data+10, u.data, u.data+5); in test() 114 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 115 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 116 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 117 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 122 (void)std::equal(t.data, t.data+10, u.data, u.data+10); in test() [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 80 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); in test() 90 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test() 91 (void)std::includes(t.data, t.data+10, u.data, u.data+10); in test() 103 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 111 (void)std::search(t.data, t.data+10, u.data, u.data+5); in test() 113 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 114 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 115 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 116 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 121 (void)std::equal(t.data, t.data+10, u.data, u.data+10); in test() [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 81 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); in test() 91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test() 92 (void)std::includes(t.data, t.data+10, u.data, u.data+10); in test() 104 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 112 (void)std::search(t.data, t.data+10, u.data, u.data+5); in test() 114 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 115 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 116 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 117 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 122 (void)std::equal(t.data, t.data+10, u.data, u.data+10); in test() [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 81 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); in test() 91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); in test() 92 (void)std::includes(t.data, t.data+10, u.data, u.data+10); in test() 104 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 112 (void)std::search(t.data, t.data+10, u.data, u.data+5); in test() 114 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 115 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 116 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 117 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); in test() 122 (void)std::equal(t.data, t.data+10, u.data, u.data+10); in test() [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/ |
H A D | robust_against_adl.pass.cpp | 81 (void)std::rotate_copy(t.data, t.data+5, t.data+10, u.data); 91 (void)std::find_end(t.data, t.data+10, u.data, u.data+5); 92 (void)std::includes(t.data, t.data+10, u.data, u.data+10); 104 (void)std::merge(t.data, t.data+5, t.data+5, t.data+10, u.data); 112 (void)std::search(t.data, t.data+10, u.data, u.data+5); 114 (void)std::set_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); 115 (void)std::set_intersection(t.data, t.data+5, t.data+5, t.data+10, u.data); 116 (void)std::set_symmetric_difference(t.data, t.data+5, t.data+5, t.data+10, u.data); 117 (void)std::set_union(t.data, t.data+5, t.data+5, t.data+10, u.data); 122 (void)std::equal(t.data, t.data+10, u.data, u.data+10); [all …]
|
/dports/net-im/libnice/libnice-0.1.18/tests/ |
H A D | test-pseudotcp-fin.c | 510 expect_fin (data.left, data.left_sent, 7, 7); in pseudotcp_close_normal() 522 expect_ack (data.left, data.left_sent, 8, 8); in pseudotcp_close_normal() 648 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery1() 684 drop_segment (data.right, data.right_sent); in pseudotcp_close_normal_recovery2() 716 drop_segment (data.right, data.right_sent); in pseudotcp_close_normal_recovery3() 752 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery4() 778 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery_data() 852 drop_segment (data.left, data.left_sent); in pseudotcp_close_simultaneous_recovery1() 853 drop_segment (data.right, data.right_sent); in pseudotcp_close_simultaneous_recovery1() 896 drop_segment (data.left, data.left_sent); in pseudotcp_close_simultaneous_recovery2() [all …]
|
/dports/net-im/libnice-gst1/libnice-0.1.18/tests/ |
H A D | test-pseudotcp-fin.c | 510 expect_fin (data.left, data.left_sent, 7, 7); in pseudotcp_close_normal() 522 expect_ack (data.left, data.left_sent, 8, 8); in pseudotcp_close_normal() 648 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery1() 684 drop_segment (data.right, data.right_sent); in pseudotcp_close_normal_recovery2() 716 drop_segment (data.right, data.right_sent); in pseudotcp_close_normal_recovery3() 752 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery4() 778 drop_segment (data.left, data.left_sent); in pseudotcp_close_normal_recovery_data() 852 drop_segment (data.left, data.left_sent); in pseudotcp_close_simultaneous_recovery1() 853 drop_segment (data.right, data.right_sent); in pseudotcp_close_simultaneous_recovery1() 896 drop_segment (data.left, data.left_sent); in pseudotcp_close_simultaneous_recovery2() [all …]
|
/dports/math/p5-Statistics-Lite/Statistics-Lite-3.62/ |
H A D | Lite.pm | 31 return $data[0] unless @data > 1; 41 return $data[0] unless @data > 1; 52 return abs($data[1]-$data[0]) unless @data > 2; 81 @data= sort{$a<=>$b}@data; 82 return $data[$#data/2] if @data&1; 153 @data= sort{$a<=>$b}@data; 155 if(@data&1) { $median= $data[$#data/2]; } 224 %data= statshash @data; 248 =item C<min(@data)>, C<max(@data)>, C<range(@data)>, C<sum(@data)>, C<count(@data)> 258 =item C<mean(@data)>, C<median(@data)>, C<mode(@data)> [all …]
|
/dports/databases/grass7/grass-7.8.6/lib/gpde/ |
H A D | n_arrays.c | 101 data->rows_intern, data->cols_intern, data->offset = offset); in N_alloc_array_2d() 109 data->rows_intern, data->cols_intern, data->offset = offset); in N_alloc_array_2d() 118 data->rows_intern, data->cols_intern, data->offset = offset); in N_alloc_array_2d() 201 data->cell_array[(row + data->offset) * data->cols_intern + in N_get_array_2d_value() 206 data->fcell_array[(row + data->offset) * data->cols_intern + in N_get_array_2d_value() 211 data->dcell_array[(row + data->offset) * data->cols_intern + in N_get_array_2d_value() 432 data->cell_array[(row + data->offset) * data->cols_intern + col + in N_put_array_2d_value() 643 for (j = 0 - data->offset; j < data->rows + data->offset; j++) { in N_print_array_2d() 644 for (i = 0 - data->offset; i < data->cols + data->offset; i++) { in N_print_array_2d() 758 data->rows_intern, data->cols_intern, data->depths_intern, in N_alloc_array_3d() [all …]
|
/dports/devel/p5-Test-Parser/Test-Parser-1.9/lib/Test/Parser/ |
H A D | Sar.pm | 103 sub data { subroutine 189 if (scalar @data == 2 and $data[0] ne 'Average:') { 191 {time => $data[0], proc_s => $data[1]}; 204 if (scalar @data == 2 and $data[0] ne 'Average:') { 206 {time => $data[0], cswch_s => $data[1]}; 221 if (scalar @data == 3 and $data[0] ne 'Average:' and 224 {time => $data[0], intr_s => $data[2]}; 237 if (scalar @data == 3 and $data[0] ne 'Average:') { 256 if (scalar @data == 4 and $data[0] ne 'Average:') { 276 if (scalar @data == 5 and $data[0] ne 'Average:') { [all …]
|
/dports/emulators/ppsspp/ppsspp-1.12.3/ext/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClusteredNeg.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
/dports/emulators/ppsspp-qt5/ppsspp-1.12.3/ext/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
H A D | spv.subgroupExtendedTypesClusteredNeg.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
/dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
H A D | spv.subgroupExtendedTypesClusteredNeg.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
/dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
H A D | spv.subgroupExtendedTypesClusteredNeg.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
/dports/emulators/libretro-ppsspp/ppsspp-1.12.3/ext/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
H A D | spv.subgroupExtendedTypesClusteredNeg.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|
/dports/graphics/waifu2x-ncnn-vulkan/waifu2x-ncnn-vulkan-20210521/src/ncnn/glslang/Test/ |
H A D | spv.subgroupExtendedTypesClustered.comp | 20 } data[4]; 26 data[invocation].i8.x = subgroupClusteredAdd(data[0].i8.x, 1); 27 data[invocation].i8.xy = subgroupClusteredAdd(data[1].i8.xy, 1); 28 data[invocation].i8.xyz = subgroupClusteredAdd(data[2].i8.xyz, 1); 29 data[invocation].i8 = subgroupClusteredAdd(data[3].i8, 1); 31 data[invocation].i8.x = subgroupClusteredMul(data[0].i8.x, 1); 34 data[invocation].i8 = subgroupClusteredMul(data[3].i8, 1); 36 data[invocation].i8.x = subgroupClusteredMin(data[0].i8.x, 1); 39 data[invocation].i8 = subgroupClusteredMin(data[3].i8, 1); 44 data[invocation].i8 = subgroupClusteredMax(data[3].i8, 1); [all …]
|