Exemplo n.º 1
0
bool ogc_bbox_extent :: is_identical(
   const ogc_bbox_extent * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 2
0
bool ogc_base_geod_crs :: is_identical(
    const ogc_base_geod_crs * p) const
{
    return is_identical(this, p);
}
Exemplo n.º 3
0
bool ogc_order :: is_identical(
   const ogc_order * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 4
0
bool ogc_lenunit :: is_identical(
   const ogc_lenunit * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 5
0
/*------------------------------------------------------------------------
 * determine whether two vectors are identical
 */
bool ogc_vector :: is_identical(
   const ogc_vector * v) const
{
   return is_identical(this, v);
}
Exemplo n.º 6
0
bool ogc_cs :: is_identical(
   const ogc_cs * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 7
0
bool ogc_method :: is_identical(
   const ogc_method * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 8
0
 const value is_identical(::zval const& rhs) const {
     return is_identical(rhs BOOST_PHP_TSRM_DIRECT_CC);
 }
Exemplo n.º 9
0
bool ogc_image_datum :: is_identical(
   const ogc_image_datum * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 10
0
int main(void) {
	int i;
	node *t1, *t2, *t3;

	/* recursive_insert() */
	printf("=== Tesing Insert Recursive ===\n");
	t1 = NULL;

	int tree_values[10] = {5, 8, 3, 6, 1, 4, 9, 0, 7, 2};

	for (i=0; i<10; i++) {
		recursive_insert(&t1,tree_values[i]);
	}

	printf("=== Inorder Traversal ===\n");
	print_inorder_traverse(t1);
	printf("\n");


	printf("=== PreOrder Traversal ===\n");
	print_preorder_traverse(t1);
	printf("\n");

	printf("=== PostOrder Traversal ===\n");
	print_postorder_traverse(t1);
	printf("\n");

	node *elem;
	printf("=== Recursive Search ===\n");
	elem = recursive_search(t1, 5);
	printf("%d\n", elem->value);
	printf("%d\n", elem->left->value);
	printf("%d\n", elem->right->value);
	printf("\n");

	printf("=== Copy Tree ===\n");
	t2=copy(t1);
	print_inorder_traverse(t1);
	printf("\n");
	print_inorder_traverse(t2);
	printf("\n");

	printf("=== Depth ===\n");
	int _d = depth(t1);
	printf("%d\n", _d);
	printf("\n");


	printf("=== Num Nodes ===\n");
	int _n = num_nodes(t1);
	printf("%d\n", _n);
	printf("\n");

	printf("=== Destroy ===\n");
	destroy(&t1);
	print_inorder_traverse(t1);
	printf("\n");


	printf("=== Is Identical ===\n");
	t1=NULL;
	t2=NULL;

	for (i=0; i<10; i++) {
		recursive_insert(&t1,tree_values[i]);
		recursive_insert(&t2,tree_values[i]);
	}

	int identical = is_identical(t1, t2);
	if (identical)
		printf("%s\n", "Trees are identical");
	else
		printf("%s\n", "Trees are not identical");
	printf("\n");


	printf("=== Num of Leaves ===\n");
	int leaves = num_leaves(t1);
	printf("%d\n", leaves);
	printf("\n");

}
Exemplo n.º 11
0
bool ogc_bearing :: is_identical(
   const ogc_bearing * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 12
0
bool ogc_scope :: is_identical(
   const ogc_scope * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 13
0
bool ogc_ellipsoid :: is_identical(
   const ogc_ellipsoid * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 14
0
bool ogc_object :: is_identical(
   const ogc_object * p) const
{
   return is_identical(this, p);
}
Exemplo n.º 15
0
bool ogc_deriving_conv :: is_identical(
    const ogc_deriving_conv * p) const
{
    return is_identical(this, p);
}