And
int obj_contains(moving_object *a, BOX *b)
{
if (b->low.x > a->x_low)
return 0;
if (b->low.y > a->y_low)
return 0;
if (b->high.x < a->x_high)
return 0;
if (b->high.y < a->y_high)
return 0;
return 1;
}
this is the procedure obj contains
On Wed, Jan 13, 2010 at 8:56 PM, Sergej Galkin
<sergej.galkin@gmail.com> wrote:
I want to add than I have a piece of my code that looks very strange
Datum gist_mov_penalty(PG_FUNCTION_ARGS)
{
GISTENTRY *origentry = (GISTENTRY *) PG_GETARG_POINTER(0);
GISTENTRY *newentry = (GISTENTRY *) PG_GETARG_POINTER(1);
float * result = (float *) PG_GETARG_POINTER(2);
moving_object *orig = &(*origentry).key;
make_now(orig);
moving_object *new = &(*origentry).key;
make_now(new);
Is everything ok in this code ??
On Wed, Jan 13, 2010 at 8:42 PM, Sergej Galkin
<sergej.galkin@gmail.com> wrote:
Hello all,
I am a student-magister and I'm writting my magister work. I realized gist index TPR tree - it is like a simple R tree but moving :)
Everything is compiling ok, I creating table and index, but after whese code - DB is restarting :(((
set enable_seqscan = false
select * from table_of_moving_objects where mov_obj ~ box '(0,0) (1,1)'
I can not understand why DB is restarting ? It is restarting when SQL begins use index :(((
Can anybody help me , I would by appretiate every people who downloads my sources, try to deploy index and maybe solve where is the problem.
Best regards,
Sergej Galkin