| /dports/math/faiss/faiss-1.7.1/faiss/ |
| H A D | IndexShards.cpp | 49 typename IndexClass::distance_t* distances, in merge_tables()
51 const std::vector<typename IndexClass::distance_t>& all_distances, in merge_tables()
57 using distance_t = typename IndexClass::distance_t; in merge_tables() typedef
65 std::vector<distance_t> buf2(nshard); in merge_tables()
66 distance_t* heap_vals = buf2.data(); in merge_tables()
71 const distance_t* D_in = all_distances.data() + i * k; in merge_tables()
87 distance_t* D = distances + i * k; in merge_tables()
290 distance_t* distances, in search()
296 std::vector<distance_t> all_distances(nshard * k * n); in search()
332 merge_tables<IndexT, CMin<distance_t, int>>( in search()
[all …]
|
| H A D | MetaIndexes.h | 26 using distance_t = typename IndexT::distance_t; member
45 distance_t* distances,
58 distance_t radius,
77 using distance_t = typename IndexT::distance_t; member
|
| H A D | IndexShards.h | 23 using distance_t = typename IndexT::distance_t; member
89 distance_t* distances,
|
| H A D | IndexReplicas.h | 25 using distance_t = typename IndexT::distance_t; variable
67 distance_t* distances,
|
| /dports/astro/routino/routino-3.3.3/src/ |
| H A D | nodes.h | 103 distance_t distance,Profile *profile,distance_t *bestdist);
106 distance_t distance,Profile *profile, distance_t *bestdist,
107 … index_t *bestnode1,index_t *bestnode2,distance_t *bestdist1,distance_t *bestdist2);
|
| H A D | nodes.c | 156 distance_t distance,Profile *profile,distance_t *bestdist) in FindClosestNode()
163 distance_t bestd=INF_DISTANCE; in FindClosestNode()
218 distance_t dist; in FindClosestNode()
308 distance_t distance,Profile *profile, distance_t *bestdist, in FindClosestSegment()
309 … index_t *bestnode1,index_t *bestnode2,distance_t *bestdist1,distance_t *bestdist2) in FindClosestSegment()
372 distance_t dist1; in FindClosestSegment()
403 distance_t dist2,dist3; in FindClosestSegment()
455 bestd1=(distance_t)dist3a; in FindClosestSegment()
456 bestd2=(distance_t)dist3b; in FindClosestSegment()
462 bestd1=(distance_t)dist3b; in FindClosestSegment()
[all …]
|
| H A D | types.h | 95 #define SEGMENT_AREA ((distance_t)0x80000000)
98 #define ONEWAY_1TO2 ((distance_t)0x40000000)
101 #define ONEWAY_2TO1 ((distance_t)0x20000000)
104 #define SEGMENT_SUPER ((distance_t)0x10000000)
107 #define SEGMENT_NORMAL ((distance_t)0x08000000)
110 #define DISTANCE(xx) ((distance_t)((xx)&(~(SEGMENT_AREA|ONEWAY_1TO2|ONEWAY_2TO1|SEGMENT_SUPER|SEG…
113 #define DISTFLAG(xx) ((distance_t)((xx)&(SEGMENT_AREA|ONEWAY_1TO2|ONEWAY_2TO1|SEGMENT_SUPER|SEGME…
190 typedef uint32_t distance_t; typedef
203 #define km_to_distance(xx) ((distance_t)((double)(xx)*1000.0))
|
| H A D | prunex.h | 36 void PruneIsolatedRegions(NodesX *nodesx,SegmentsX *segmentsx,WaysX *waysx,distance_t minimum);
38 void PruneShortSegments(NodesX *nodesx,SegmentsX *segmentsx,WaysX *waysx,distance_t minimum);
40 void PruneStraightHighwayNodes(NodesX *nodesx,SegmentsX *segmentsx,WaysX *waysx,distance_t maximum);
|
| H A D | segments.h | 50 distance_t distance; /*+ The distance between the nodes. +*/
96 distance_t Distance(double lat1,double lon1,double lat2,double lon2);
98 double DeltaLat(double lon,distance_t distance);
99 double DeltaLon(double lat,distance_t distance);
|
| H A D | fakes.h | 40 …egments,int point,Segment *segmentp,index_t node1,index_t node2,distance_t dist1,distance_t dist2);
|
| H A D | segmentsx.c | 63 static distance_t DistanceX(NodeX *nodex1,NodeX *nodex2);
146 void AppendSegmentList(SegmentsX *segmentsx,index_t way,index_t node1,index_t node2,distance_t dist… in AppendSegmentList()
344 distance_t a_distance=DISTANCE(a->distance); in sort_by_id()
345 distance_t b_distance=DISTANCE(b->distance); in sort_by_id()
353 distance_t a_distflag=DISTFLAG(a->distance); in sort_by_id()
354 distance_t b_distflag=DISTFLAG(b->distance); in sort_by_id()
383 distance_t prevdist=0; in ProcessSegments()
982 static distance_t DistanceX(NodeX *nodex1,NodeX *nodex2) in DistanceX()
|
| H A D | segments.c | 214 distance_t Distance(double lat1,double lon1,double lat2,double lon2) in Distance()
248 double DeltaLat(double lon,distance_t distance) in DeltaLat()
277 double DeltaLon(double lat,distance_t distance) in DeltaLon()
316 distance_t distance=DISTANCE(segmentp->distance); in Duration()
|
| H A D | segmentsx.h | 49 distance_t distance; /*+ The distance between the nodes. +*/
88 void AppendSegmentList(SegmentsX *segmentsx,index_t way,index_t node1,index_t node2,distance_t dist…
|
| H A D | superx.c | 294 …ppendSegmentList(supersegmentsx,segmentx->way,i,result->node,DISTANCE((distance_t)result->score)|O… in CreateSuperSegments()
296 …AppendSegmentList(supersegmentsx,segmentx->way,i,result->node,DISTANCE((distance_t)result->score)); in CreateSuperSegments()
529 distance_t cumulative_distance; in FindSuperRoutes()
555 cumulative_distance=(distance_t)result1->score+DISTANCE(segmentx->distance); in FindSuperRoutes()
|
| H A D | fakes.c | 73 …segments,int point,Segment *segmentp,index_t node1,index_t node2,distance_t dist1,distance_t dist2) in CreateFakes()
|
| /dports/biology/sra-tools/sra-tools-2.11.0/tools/bam-loader/ |
| H A D | mate-distance-stats.hpp | 5 typedef unsigned long distance_t; typedef in MateDistanceStats
8 typedef std::map<distance_t, count_t> map_t;
18 void Count(distance_t const &d) { ++map[d]; } in Count()
19 unsigned NthMostFrequent(unsigned N, distance_t result[N]) const;
|
| H A D | mate-distance-stats.cpp | 5 unsigned MateDistanceStats::NthMostFrequent(unsigned N, distance_t result[N]) const in NthMostFrequent()
|
| /dports/astro/routino/routino-3.3.3/python/src/ |
| H A D | database.hh | 44 const distance_t Segmentflag_Area = SEGMENT_AREA;
45 const distance_t Segmentflag_Oneway_1to2 = ONEWAY_1TO2;
46 const distance_t Segmentflag_Oneway_2to1 = ONEWAY_2TO1;
47 const distance_t Segmentflag_Super = SEGMENT_SUPER;
48 const distance_t Segmentflag_Normal = SEGMENT_NORMAL;
163 distance_t flags; /*+ The flags associated with the segment. +*/
|
| H A D | database.i | 55 %typemap(in) distance_t { $1 = PyInt_AsLong($input); }
56 %typemap(out) distance_t { $result = PyInt_FromLong($1); }
|
| /dports/print/gutenprint/gutenprint-5.3.3/src/main/ |
| H A D | dither-eventone.c | 44 } distance_t; typedef
50 distance_t d_sq;
62 distance_t dis;
63 distance_t *et_dis;
153 shade->et_dis = stp_malloc(sizeof(distance_t) * d->dst_width); in et_setup()
167 shade->et_dis = stp_malloc(sizeof(distance_t) * d->dst_width); in et_setup()
226 distance_t *etd = &sp->et_dis[x]; in advance_eventone_pre()
242 distance_t *etd = &sp->et_dis[x]; in eventone_update()
|
| /dports/print/gimp-gutenprint/gutenprint-5.3.3/src/main/ |
| H A D | dither-eventone.c | 44 } distance_t; typedef
50 distance_t d_sq;
62 distance_t dis;
63 distance_t *et_dis;
153 shade->et_dis = stp_malloc(sizeof(distance_t) * d->dst_width); in et_setup()
167 shade->et_dis = stp_malloc(sizeof(distance_t) * d->dst_width); in et_setup()
226 distance_t *etd = &sp->et_dis[x]; in advance_eventone_pre()
242 distance_t *etd = &sp->et_dis[x]; in eventone_update()
|
| /dports/databases/postgis32/postgis-3.2.0/regress/core/ |
| H A D | geography.sql | 82 round(ST_Distance(geog, tgeog, true)::numeric,3) AS distance_t,
89 ORDER BY distance_t;
|
| /dports/databases/postgis31/postgis-3.1.4/regress/core/ |
| H A D | geography.sql | 82 round(ST_Distance(geog, tgeog, true)::numeric,3) AS distance_t,
89 ORDER BY distance_t;
|
| /dports/databases/postgis30/postgis-3.0.4/regress/core/ |
| H A D | geography.sql | 82 round(ST_Distance(geog, tgeog, true)::numeric,3) AS distance_t,
89 ORDER BY distance_t;
|
| /dports/databases/postgis25/postgis-2.5.5/regress/ |
| H A D | geography.sql | 100 round(ST_Distance(geog, tgeog, true)::numeric,3) AS distance_t,
107 ORDER BY distance_t;
|