/dports/biology/exonerate/exonerate-2.4.0/src/bsdp/ |
H A D | hpair.c | 235 hpair); in HPair_confirm_start_func() 254 hpair); in HPair_update_start_func() 269 hpair); in HPair_confirm_end_func() 288 hpair); in HPair_update_end_func() 339 return hpair; in HPair_create() 363 g_free(hpair); in HPair_destroy() 370 g_assert(hpair); in HPair_add_hspset() 615 hrtrd.hpair = hpair; in HPair_find_candidate_hsp_pairs() 672 g_assert(hpair); in HPair_finalise() 699 hpair->user_data, alignment->score, hpair->subopt); [all …]
|
H A D | sar.c | 353 component = SAR_find_end_component(hpair, in SAR_Terminal_create() 396 hpair->user_data, hpair->subopt) in SAR_Terminal_find_score() 446 hpair->user_data); in SAR_reduce_mid_overlap() 700 hpair->user_data, hpair->subopt) in SAR_Join_find_score() 832 SAR_HSP_quality(hpair, src_portal->calc, in SAR_Span_create() 904 heuristic_data = hpair->user_data; in SAR_Span_find_score() 908 hpair->subopt); in SAR_Span_find_score() 914 hpair->subopt); in SAR_Span_find_score() 950 sar_alignment->hpair = hpair; in SAR_Alignment_create() 1039 sar_alignment->hpair->subopt); in SAR_Alignment_add_SAR_Span() [all …]
|
H A D | sar.h | 66 SAR_Terminal *SAR_Terminal_create(HSP *hsp, HPair *hpair, 74 Optimal *optimal, HPair *hpair); 85 SAR_Join *SAR_Join_create(HSP *src_hsp, HSP *dst_hsp, HPair *hpair, 89 C4_Score SAR_Join_find_score(SAR_Join *sar_join, HPair *hpair); 101 SAR_Span *SAR_Span_create(HSP *src_hsp, HSP *dst_hsp, HPair *hpair, 106 C4_Score SAR_Span_find_score(SAR_Span *sar_span, HPair *hpair); 115 HPair *hpair; member 125 HPair *hpair, C4_Score score);
|
H A D | hpair.h | 47 void HPair_destroy(HPair *hpair); 50 void HPair_add_hspset(HPair *hpair, C4_Portal *portal, 54 void HPair_finalise(HPair *hpair, C4_Score threshold); 56 Alignment *HPair_next_path(HPair *hpair, C4_Score threshold);
|
H A D | Makefile.am | 2 TESTS = heuristic.test bsdp.test hpair.test sar.test 15 noinst_HEADERS = heuristic.h bsdp.h hpair.h sar.h 54 hpair_test_SOURCES = hpair.test.c hpair.c heuristic.c bsdp.c sar.c
|
H A D | Makefile.in | 82 TESTS = heuristic.test bsdp.test hpair.test sar.test 89 noinst_HEADERS = heuristic.h bsdp.h hpair.h sar.h 108 hpair_test_SOURCES = hpair.test.c hpair.c heuristic.c bsdp.c sar.c 152 hpair_test_OBJECTS = hpair.test.o hpair.o heuristic.o bsdp.o sar.o 257 hpair.test: $(hpair_test_OBJECTS) $(hpair_test_DEPENDENCIES) 258 @rm -f hpair.test
|
/dports/devel/csoap/libsoap-1.1.0/nanohttp/ |
H A D | nanohttp-request.c | 74 hpair_t *hpair = NULL, *qpair = NULL, *tmppair = NULL; in _hrequest_parse_header() local 214 req->header = hpair = tmppair; in _hrequest_parse_header() 218 hpair->next = tmppair; in _hrequest_parse_header() 219 hpair = tmppair; in _hrequest_parse_header()
|
H A D | nanohttp-common.h | 300 typedef struct hpair hpair_t; 301 struct hpair struct
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | HalfedgeDS_list.h | 279 Halfedge_pair* hpair = edge_allocator.allocate(1); in get_edge_node() local 280 std::allocator_traits<Edge_allocator>::construct(edge_allocator, hpair, h, g); in get_edge_node() 281 Halfedge* h2 = &(hpair->first); in get_edge_node() 282 Halfedge* g2 = &(hpair->second); in get_edge_node() 283 CGAL_assertion( h2 == (Halfedge*)hpair); in get_edge_node() 292 Halfedge_pair* hpair = (Halfedge_pair*)(&*h); in put_edge_node() local 294 hpair = (Halfedge_pair*)(&*g); in put_edge_node() 295 CGAL_assertion( &(hpair->first) == (Halfedge*)hpair); in put_edge_node() 296 destroy(edge_allocator, hpair); in put_edge_node() 297 edge_allocator.deallocate( hpair, 1); in put_edge_node()
|
/dports/biology/exonerate/exonerate-2.4.0/src/c4/ |
H A D | opair.h | 43 Alignment *OPair_next_path(OPair *hpair, C4_Score threshold);
|
/dports/biology/exonerate/exonerate-2.4.0/src/hub/ |
H A D | gam.c | 803 HPair *hpair){ in GAM_Result_BSDP_add_HSPset() argument 806 HPair_add_hspset(hpair, portal, hspset); in GAM_Result_BSDP_add_HSPset() 833 register HPair *hpair; in GAM_Result_BSDP_create() local 844 hpair = HPair_create(gam->heuristic, gam_result->subopt, in GAM_Result_BSDP_create() 852 GAM_Result_BSDP_add_HSPset(comparison->dna_hspset, gam, hpair); in GAM_Result_BSDP_create() 855 hpair); in GAM_Result_BSDP_create() 858 hpair); in GAM_Result_BSDP_create() 859 HPair_finalise(hpair, threshold); in GAM_Result_BSDP_create() 864 alignment = HPair_next_path(hpair, threshold); in GAM_Result_BSDP_create() 875 HPair_destroy(hpair); in GAM_Result_BSDP_create()
|
H A D | Makefile.in | 90 …op_srcdir)/src/bsdp/heuristic.o $(top_srcdir)/src/bsdp/hpair.o … 129 $(top_srcdir)/src/bsdp/hpair.o $(top_srcdir)/src/sdp/boundary.o \ 174 $(top_srcdir)/src/bsdp/hpair.o $(top_srcdir)/src/sdp/boundary.o \
|
/dports/devel/cutils/cutils-1.6/lib/ |
H A D | htable.h | 39 } hpair; typedef
|
/dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 651 size_t[2] hpair; 652 hpair[0] = key.hashOf(); 653 hpair[1] = val.hashOf(); 654 h += hpair.hashOf();
|
/dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc10/gcc-10.3.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/devel/avr-gcc/gcc-10.2.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc9-devel/gcc-9-20211007/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc9/gcc-9.4.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc10-devel/gcc-10-20211008/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/lang/gcc9-aux/gcc-9.1.0/libphobos/libdruntime/core/internal/ |
H A D | hash.d | 680 size_t[2] hpair; 681 hpair[0] = key.hashOf(); 682 hpair[1] = val.hashOf(); 683 h += hpair.hashOf();
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Boolean_set_operations_2/ |
H A D | Gps_on_surface_base_2_impl.h | 601 std::pair<GP_Holes_const_iterator, GP_Holes_const_iterator> hpair = in _construct_curves() local 604 for (hit = hpair.first; hit != hpair.second; ++hit) in _construct_curves()
|
/dports/devel/cutils/cutils-1.6/src/cobfusc/ |
H A D | cobfusc.c | 236 hpair *hp; in free_tables() 952 hpair *hp; in main()
|