/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/include/ |
H A D | cnrp_cg.h | 48 char *cut_list; member 93 char *cut_list, double *demand, int mult, 100 char *cut_list, double *demand, int mult, 107 double *cut_val,int *ref, char *cut_list, 115 double *cut_val,int *ref, char *cut_list, 122 double *cut_val, char *cut_list, 129 char *cut_list, int max_num_cuts,
|
/dports/games/glbsp/glbsp-2.20/ |
H A D | seg.c | 325 if (*cut_list) in AddIntersection() 326 (*cut_list)->prev = cut; in AddIntersection() 328 (*cut_list) = cut; in AddIntersection() 841 intersection_t ** cut_list) in DivideOneSeg() argument 927 intersection_t ** cut_list) in SeparateSegs() argument 1014 intersection_t *cut_list) in AddMinisegs() argument 1019 if (! cut_list) in AddMinisegs() 1040 cur = cut_list; in AddMinisegs() 1205 while (cut_list) in AddMinisegs() 1207 cur = cut_list; in AddMinisegs() [all …]
|
H A D | seg.h | 95 intersection_t ** cut_list); 103 intersection_t ** cut_list); 111 intersection_t *cut_list);
|
/dports/games/edge/Edge-1.35-source/glbsp/src/ |
H A D | seg.c | 325 if (*cut_list) in AddIntersection() 326 (*cut_list)->prev = cut; in AddIntersection() 328 (*cut_list) = cut; in AddIntersection() 870 intersection_t ** cut_list) in DivideOneSeg() argument 956 intersection_t ** cut_list) in SeparateSegs() argument 1043 intersection_t *cut_list) in AddMinisegs() argument 1048 if (! cut_list) in AddMinisegs() 1069 cur = cut_list; in AddMinisegs() 1234 while (cut_list) in AddMinisegs() 1236 cur = cut_list; in AddMinisegs() [all …]
|
H A D | seg.h | 92 intersection_t ** cut_list); 100 intersection_t ** cut_list); 108 intersection_t *cut_list);
|
/dports/games/vavoom/vavoom-1.33/utils/glbsp/ |
H A D | seg.c | 325 if (*cut_list) in AddIntersection() 326 (*cut_list)->prev = cut; in AddIntersection() 328 (*cut_list) = cut; in AddIntersection() 841 intersection_t ** cut_list) in DivideOneSeg() argument 927 intersection_t ** cut_list) in SeparateSegs() argument 1014 intersection_t *cut_list) in AddMinisegs() argument 1019 if (! cut_list) in AddMinisegs() 1040 cur = cut_list; in AddMinisegs() 1205 while (cut_list) in AddMinisegs() 1207 cur = cut_list; in AddMinisegs() [all …]
|
H A D | seg.h | 95 intersection_t ** cut_list); 103 intersection_t ** cut_list); 111 intersection_t *cut_list);
|
/dports/games/edge/Edge-1.35-source/src/ |
H A D | tinybsp.cc | 525 cut_list.push_back(new_cut); in AddIntersection() 580 std::vector<intersect_t> & cut_list) in DivideOneSeg() argument 602 AddIntersection(cut_list, party, cur->v1, +2); in DivideOneSeg() 766 std::vector<intersect_t> & cut_list) in AddMinisegs() argument 768 if (cut_list.empty()) in AddMinisegs() 771 std::sort(cut_list.begin(), cut_list.end(), in AddMinisegs() 776 A = cut_list.begin(); in AddMinisegs() 778 while (A != cut_list.end()) in AddMinisegs() 787 if (B == cut_list.end()) in AddMinisegs() 839 std::vector<intersect_t> cut_list; in Poly_Split() local [all …]
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/include/ |
H A D | vrp_cg.h | 48 char *cut_list; member 87 char *cut_list, int *demand, cut_data ***cuts, 93 double *cut_val,int *ref, char *cut_list, 100 double *cut_val, char *cut_list, 106 char *cut_list, int max_num_cuts,
|
/dports/games/eureka/eureka-1.27b-source/src/ |
H A D | bsp_node.cc | 332 if (*cut_list) in AddIntersection() 333 (*cut_list)->prev = cut; in AddIntersection() 335 (*cut_list) = cut; in AddIntersection() 799 intersection_t ** cut_list) in DivideOneSeg() argument 883 intersection_t ** cut_list) in SeparateSegs() argument 944 if (! cut_list) in AddMinisegs() 955 for (cur=cut_list ; cur ; cur=cur->next) in AddMinisegs() 1030 while (cut_list) in AddMinisegs() 1032 cur = cut_list; in AddMinisegs() 1033 cut_list = cur->next; in AddMinisegs() [all …]
|
H A D | bsp.h | 605 intersection_t ** cut_list); 613 intersection_t ** cut_list); 621 intersection_t *cut_list);
|
/dports/multimedia/py-PySceneDetect/PySceneDetect-0.5.4/scenedetect/ |
H A D | scene_manager.py | 76 def get_scenes_from_cuts(cut_list, base_timecode, num_frames, start_frame=0): argument 102 if not cut_list: 108 for cut in cut_list: 117 def write_scene_list(output_csv_file, scene_list, cut_list=None): argument 132 cut_list if cut_list else [start.get_timecode() for start, _ in scene_list[1:]]) 147 def write_scene_list_html(output_html_filename, scene_list, cut_list=None, css=None, argument 206 (cut_list if cut_list else
|
/dports/sysutils/busybox/busybox-1.26.2/coreutils/ |
H A D | cut.c | 52 struct cut_list { struct 65 return (((struct cut_list *) a)->startpos - in cmpfunc() argument 66 ((struct cut_list *) b)->startpos); in cmpfunc() 69 static void cut_file(FILE *file, char delim, const struct cut_list *cut_lists, unsigned nlists) in cut_file() 198 struct cut_list *cut_lists = NULL; in cut_main()
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglZeroHalf/ |
H A D | Cgl012cut.hpp | 170 } cut_list; typedef 326 cut_list *basic_separation(); 347 short int best_neighbour(cut_list *out_cuts /* list of the violated cuts found */); 358 cut_list *tabu_012(); 416 void print_cut_list(cut_list *cuts);
|
/dports/multimedia/py-PySceneDetect/PySceneDetect-0.5.4/scenedetect/detectors/ |
H A D | content_detector.py | 83 cut_list = [] 132 cut_list.append(frame_num) 146 return cut_list
|
H A D | threshold_detector.py | 190 cut_list = [] 215 cut_list.append(f_split) 226 return cut_list
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/VRP/src/CutGen/ |
H A D | shrink.c | 177 memset(cut_list, 0, new_cut->size * (max_shrink_cuts + 1)); in greedy_shrinking1() 230 for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, in greedy_shrinking1() 278 double *cut_val, int *ref, char *cut_list, in greedy_shrinking6() argument 304 memset(cut_list, 0, new_cut->size * (max_shrink_cuts +1)); in greedy_shrinking6() 375 for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, in greedy_shrinking6() 424 double *cut_val, char *cut_list, int num_routes, in greedy_shrinking1_one() argument 492 for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, in greedy_shrinking1_one() 532 for (k=0, cutpt = cut_list; k < shrink_cuts; k++, in greedy_shrinking1_one() 581 char *cut_list, int max_shrink_cuts, int *demand, in greedy_shrinking6_one() argument 659 for (k = 0, cutpt = cut_list; k < shrink_cuts; k++, in greedy_shrinking6_one() [all …]
|
H A D | vrp_cg.c | 113 vrp->cut_list = (char *) malloc(((vrp->vertnum >> DELETE_POWER)+1)* in user_receive_cg_data() 175 FREE(vrp->cut_list); in user_free_cg() 220 char *cut_list = vrp->cut_list; local 509 ref, cut_list, new_demand, cuts, 514 new_cut, in_set, cut_val, cut_list, 529 in_set, cut_val, ref, cut_list, 536 cut_val, num_routes, cut_list,
|
/dports/math/cgl/Cgl-releases-0.60.3/Cgl/src/CglTwomir/ |
H A D | CglTwomir.cpp | 286 DGG_list_t cut_list; in generateCuts() local 287 DGG_list_init (&cut_list); in generateCuts() 333 for ( i=0; i<cut_list.n; i++){ in generateCuts() 422 for ( i=0; i<cut_list.n; i++) in generateCuts() 424 DGG_list_free (&cut_list); in generateCuts() 1412 int nc = cut_list->n; in DGG_generateTabRowCuts() 1484 int nc = cut_list->n; in DGG_generateFormulationCuts() 1519 DGG_list_t *cut_list, in DGG_generateFormulationCutsFromBase() argument 1596 DGG_list_t *cut_list, in DGG_generateCutsFromBase() argument 1606 int new_pos = cut_list->n; in DGG_generateCutsFromBase() [all …]
|
/dports/cad/cura-engine/CuraEngine-fadb5d6b/src/ |
H A D | infill.cpp | 407 …int line_distance, const AABB boundary, std::vector<std::vector<coord_t>>& cut_list, coord_t shift) in addLineInfill() argument 426 if (scanline_idx >= cut_list.size()) in addLineInfill() 430 std::vector<coord_t>& crossings = cut_list[scanline_idx]; in addLineInfill() 548 …std::vector<std::vector<coord_t>> cut_list; // mapping from scanline to all intersections with pol… in generateLinearBasedInfill() local 552 cut_list.push_back(std::vector<coord_t>()); in generateLinearBasedInfill() 614 …ne_idx - scanline_min_idx >= 0 && scanline_idx - scanline_min_idx < int(cut_list.size()) && "readi… in generateLinearBasedInfill() 615 cut_list[scanline_idx - scanline_min_idx].push_back(y); in generateLinearBasedInfill() 648 if (cut_list.size() == 0) in generateLinearBasedInfill() 652 if (connected_zigzags && cut_list.size() == 1 && cut_list[0].size() <= 2) in generateLinearBasedInfill() 657 …addLineInfill(result, rotation_matrix, scanline_min_idx, line_distance, boundary, cut_list, shift); in generateLinearBasedInfill()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutGen/ |
H A D | shrink.c | 244 memset(cut_list, 0, new_cut->size * (max_num_cuts + 1)); in greedy_shrinking1() 290 for (k = 0, cutpt = cut_list; k < cuts_found; k++, in greedy_shrinking1() 348 char *cut_list, double *demand, int mult, in greedy_shrinking1_dicut() argument 499 double *cut_val, int *ref, char *cut_list, in greedy_shrinking6() argument 652 double *cut_val, int *ref, char *cut_list, in greedy_shrinking6_dicut() argument 836 double *cut_val, char *cut_list, int num_routes, in greedy_shrinking1_one() argument 899 for (k = 0, cutpt = cut_list; k < cuts_found; k++, in greedy_shrinking1_one() 942 for (k=0, cutpt = cut_list; k < cuts_found; k++, in greedy_shrinking1_one() 1001 char *cut_list, int max_num_cuts, double *demand, in greedy_shrinking6_one() argument 1083 for (k = 0, cutpt = cut_list; k < cuts_found; k++, in greedy_shrinking6_one() [all …]
|
H A D | cnrp_cg.c | 87 cnrp->cut_list = (char *) malloc(((cnrp->vertnum >> DELETE_POWER)+1)* in user_receive_cg_data() 140 FREE(cnrp->cut_list); in user_free_cg() 207 char *cut_list = cnrp->cut_list; local 681 cut_list, demand, mult, num_cuts, 694 cut_list, 731 ref, cut_list, new_demand, mult, 736 new_cut, in_set, cut_val, cut_list, 753 in_set, cut_val, ref, cut_list, 760 cut_val, num_routes, cut_list,
|
/dports/audio/easytag/easytag-2.4.3/src/ |
H A D | file.c | 1483 GList *cut_list = NULL; in ET_Add_File_Name_To_List() local 1492 cut_list = ETFile->FileNameNew->next; // Cut after the current item... in ET_Add_File_Name_To_List() 1495 if (cut_list) in ET_Add_File_Name_To_List() 1496 cut_list->prev = NULL; in ET_Add_File_Name_To_List() 1504 ETFile->FileNameListBak = g_list_concat(ETFile->FileNameListBak,cut_list); in ET_Add_File_Name_To_List() 1515 GList *cut_list = NULL; in ET_Add_File_Tag_To_List() local 1521 cut_list = ETFile->FileTag->next; // Cut after the current item... in ET_Add_File_Tag_To_List() 1524 if (cut_list) in ET_Add_File_Tag_To_List() 1525 cut_list->prev = NULL; in ET_Add_File_Tag_To_List() 1532 ETFile->FileTagListBak = g_list_concat(ETFile->FileTagListBak,cut_list); in ET_Add_File_Tag_To_List()
|
/dports/multimedia/tvheadend/tvheadend-4.2.8/src/dvr/ |
H A D | dvr_cutpoints.c | 141 ( const char *path, dvr_cutpoint_list_t *cut_list, void *p ) in dvr_parse_file() argument 167 TAILQ_INSERT_TAIL(cut_list, cp, dc_link); in dvr_parse_file()
|
/dports/multimedia/py-PySceneDetect/PySceneDetect-0.5.4/scenedetect/cli/ |
H A D | context.py | 357 cut_list = self.scene_manager.get_cut_list(base_timecode) 385 write_scene_list(scene_list_file, scene_list, cut_list) 402 if cut_list: 404 ','.join([cut.get_timecode() for cut in cut_list])) 425 write_scene_list_html(html_path, scene_list, cut_list,
|