📄 rtpredicate.cpp
字号:
//--------------------------------------------------------------------// RTpredicate.cpp// ---------------// Implements the query predicate // // TPR-tree - Index for continuously moving objects// July 2001 release, Aalborg University//#include "rt.h"//----------------------------------------------------int RTpredicate::Consistent(const GiSTentry& entry) const{ RTentry &rtentry = (RTentry&) entry; if (entry.IsLeaf()) { switch (oper) { case RToverlap: return(rtentry.bbox().overlap_n1(*value));/* case RTcontains: return(rtentry.bbox().contain_n(*value)); case RTcontained: return(rtentry.bbox().contained_n(*value));*/ case RTEqual: // used also for delete operation return ptr == (GiSTpage) -1 ? rtentry.bbox().isEqual_n(*value) : ptr == entry.Ptr(); default: assert(0); return (0); } } else { switch (oper) { case RToverlap:// case RTcontained: return rtentry.bbox().overlap_n1(*value);/* case RTcontains:*/ case RTEqual: // used also for delete operation return ptr == (GiSTpage) -1 ? rtentry.bbox().contain_n(*value) : rtentry.bbox().contain_n1(*value); default: assert(0); return (0); } }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -