for (j = 0; j < 3; j++)
{
P2tPoint *cdt_pt = p2t_triangle_get_point(cdt_tri, j);
- P2trPoint *new_pt = g_hash_table_lookup (point_map, cdt_pt);
+ P2trPoint *new_pt = (P2trPoint*) g_hash_table_lookup (point_map, cdt_pt);
if (new_pt == NULL)
{
P2tPoint *end = p2t_triangle_get_point (cdt_tri, (j + 1) % 3);
int edge_index = p2t_triangle_edge_index (cdt_tri, start, end);
- P2trPoint *start_new = g_hash_table_lookup (point_map, start);
- P2trPoint *end_new = g_hash_table_lookup (point_map, end);
+ P2trPoint *start_new = (P2trPoint*) g_hash_table_lookup (point_map, start);
+ P2trPoint *end_new = (P2trPoint*) g_hash_table_lookup (point_map, end);
if (! p2tr_point_has_edge_to (start_new, end_new))
{
{
P2tTriangle *cdt_tri = triangle_index (cdt_tris, i);
- P2trPoint *pt1 = g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 0));
- P2trPoint *pt2 = g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 1));
- P2trPoint *pt3 = g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 2));
+ P2trPoint *pt1 = (P2trPoint*) g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 0));
+ P2trPoint *pt2 = (P2trPoint*) g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 1));
+ P2trPoint *pt3 = (P2trPoint*) g_hash_table_lookup (point_map, p2t_triangle_get_point (cdt_tri, 2));
P2trTriangle *new_tri = p2tr_mesh_new_triangle (rmesh->mesh,
p2tr_point_get_edge_to(pt1, pt2, FALSE),
gdouble min_length_sq = G_MAXDOUBLE, temp;
GList *iter;
- for (iter = g_queue_peek_head(&self->edges); iter != NULL; iter = iter->next)
+ for (iter = self->edges.head; iter != NULL; iter = iter->next)
{
temp = p2tr_edge_get_length_squared ((P2trEdge*)iter->data);
min_length_sq = MIN(min_length_sq, temp);
{
GList *iter;
- for (iter = g_queue_peek_head(&self->edges); iter != NULL; iter = iter->next)
+ for (iter = self->edges.head; iter != NULL; iter = iter->next)
p2tr_edge_unref ((P2trEdge*)iter->data);
g_queue_clear (&self->edges);