|
| 1 | +<?xml version="1.0" encoding="UTF-8"?> |
| 2 | +<Export generator="Cache" version="25" zv="Cache for Windows (x86-64) 2015.3 (Build 215U)" ts="2015-09-18 03:21:40"> |
| 3 | +<Class name="SpatialIndex.Indexer"> |
| 4 | +<Super>%RegisteredObject</Super> |
| 5 | +<TimeChanged>63813,10285.724655</TimeChanged> |
| 6 | +<TimeCreated>63813,4756.736455</TimeCreated> |
| 7 | + |
| 8 | +<Parameter name="NODESIZE"> |
| 9 | +<Default>4</Default> |
| 10 | +</Parameter> |
| 11 | + |
| 12 | +<Parameter name="ROOTNODE"> |
| 13 | +<Default> </Default> |
| 14 | +</Parameter> |
| 15 | + |
| 16 | +<Parameter name="EPS"> |
| 17 | +<Default>0.0001</Default> |
| 18 | +</Parameter> |
| 19 | + |
| 20 | +<Parameter name="MINX"> |
| 21 | +<Default>-180</Default> |
| 22 | +</Parameter> |
| 23 | + |
| 24 | +<Parameter name="MINY"> |
| 25 | +<Default>-90</Default> |
| 26 | +</Parameter> |
| 27 | + |
| 28 | +<Parameter name="MAXX"> |
| 29 | +<Expression>180 + ..#EPS</Expression> |
| 30 | +</Parameter> |
| 31 | + |
| 32 | +<Parameter name="MAXY"> |
| 33 | +<Expression>90 + ..#EPS</Expression> |
| 34 | +</Parameter> |
| 35 | + |
| 36 | +<Property name="indexPath"> |
| 37 | +<Type>%String</Type> |
| 38 | +<Private>1</Private> |
| 39 | +</Property> |
| 40 | + |
| 41 | +<Method name="%OnNew"> |
| 42 | +<FormalSpec>indexPath:%String</FormalSpec> |
| 43 | +<ReturnType>%Status</ReturnType> |
| 44 | +<Implementation><![CDATA[ |
| 45 | + set ..indexPath = indexPath |
| 46 | + if ('##class(IndexNode).Exists(indexPath, ..#ROOTNODE)){ |
| 47 | + do ##class(IndexNode).Put(indexPath, ..#ROOTNODE, |
| 48 | + {"isLeaf":$$$YES, "minX":..#MINX, "maxX":..#MAXX, "minY":..#MINY, "maxY":..#MAXY, "size":0}) |
| 49 | + } |
| 50 | + return $$$OK |
| 51 | +]]></Implementation> |
| 52 | +</Method> |
| 53 | + |
| 54 | +<Method name="Insert"> |
| 55 | +<FormalSpec>x:%Float,y:%Float,id:%String,data:%String="",block:%String=..#ROOTNODE</FormalSpec> |
| 56 | +<Implementation><![CDATA[ |
| 57 | + #dim node As IndexNode |
| 58 | + set node = ##class(IndexNode).Get(..indexPath, block) |
| 59 | + if ((x<node.minX) || (x>=node.maxX) || (y<node.minY) || (y>=node.maxY)) return |
| 60 | + if (node.isLeaf){ |
| 61 | + if ('..Contains(x, y, block)) { |
| 62 | + set node.size = node.size + 1 |
| 63 | + do ##class(IndexNode).Put(..indexPath, block, node) |
| 64 | + } |
| 65 | + set @..indexPath@(block, "data", x, y, id) = data |
| 66 | + if (node.size > ..#NODESIZE) do ..Split(block) |
| 67 | + } |
| 68 | + else{ |
| 69 | + for i=0:1:3 { |
| 70 | + do ..Insert(x, y, id, data, block_i) |
| 71 | + } |
| 72 | + } |
| 73 | +]]></Implementation> |
| 74 | +</Method> |
| 75 | + |
| 76 | +<Method name="Contains"> |
| 77 | +<FormalSpec>x:%Float,y:%Float,block:%String=..#ROOTNODE</FormalSpec> |
| 78 | +<ReturnType>%Boolean</ReturnType> |
| 79 | +<Implementation><![CDATA[ |
| 80 | + #dim node As IndexNode |
| 81 | + set node = ##class(IndexNode).Get(..indexPath, block) |
| 82 | + if ((x<node.minX) || (x>=node.maxX) || (y<node.minY) || (y>=node.maxY)) return $$$NO |
| 83 | + if (node.isLeaf){ |
| 84 | + return $DATA(@..indexPath@(block, "data", x, y))>0 |
| 85 | + } |
| 86 | + for i=0:1:3 { |
| 87 | + if (..Contains(x, y, block_i)) return $$$YES |
| 88 | + } |
| 89 | + return $$$NO |
| 90 | +]]></Implementation> |
| 91 | +</Method> |
| 92 | + |
| 93 | +<Method name="Split"> |
| 94 | +<FormalSpec>block:%String</FormalSpec> |
| 95 | +<Implementation><![CDATA[ |
| 96 | + #dim node As IndexNode |
| 97 | + set node = ##class(IndexNode).Get(..indexPath, block) |
| 98 | + set midX = (node.minX+node.maxX)/2 |
| 99 | + set midY = (node.minY+node.maxY)/2 |
| 100 | + |
| 101 | + // Create subnodes |
| 102 | + set nodes(0) = ##class(IndexNode).%New(node.minX, node.minY, midX, midY) |
| 103 | + set nodes(1) = ##class(IndexNode).%New(midX, node.minY, node.maxX, midY) |
| 104 | + set nodes(2) = ##class(IndexNode).%New(node.minX, midY, midX, node.maxY) |
| 105 | + set nodes(3) = ##class(IndexNode).%New(midX, midY, node.maxX, node.maxY) |
| 106 | + |
| 107 | + // Saving structure |
| 108 | + set node.isLeaf = $$$NO |
| 109 | + set node.size = 0 |
| 110 | + do ##class(IndexNode).Put(..indexPath, block, node) |
| 111 | + for i=0:1:3 { |
| 112 | + do ##class(IndexNode).Put(..indexPath, block_i, nodes(i)) |
| 113 | + } |
| 114 | + |
| 115 | + // Reinsert data into node. Since it's not leaf, data will be inserted in subnodes |
| 116 | + set x = $o(@..indexPath@(block, "data", "")) |
| 117 | + while (x'=""){ |
| 118 | + set y = $o(@..indexPath@(block, "data", x, "")) |
| 119 | + while (y'=""){ |
| 120 | + set id = $o(@..indexPath@(block, "data", x, y, "")) |
| 121 | + while (id'=""){ |
| 122 | + do ..Insert(x, y, id, @..indexPath@(block, "data", x, y, id), block) |
| 123 | + set id = $o(@..indexPath@(block, "data", x, y, id)) |
| 124 | + } |
| 125 | + set y = $o(@..indexPath@(block, "data", x, y)) |
| 126 | + } |
| 127 | + set x = $o(@..indexPath@(block, "data", x)) |
| 128 | + } |
| 129 | + kill @..indexPath@(block, "data") |
| 130 | +]]></Implementation> |
| 131 | +</Method> |
| 132 | +</Class> |
| 133 | +</Export> |
0 commit comments