Lines Matching refs:snak
832 /// @param snak the last snake of the furthest path found. The end
846 d_path_vec& v, snake& snak)
924 snak = s;
973 /// @param snak the last snake of the furthest path found. The end
987 d_path_vec& v, snake& snak)
1060 snak = s;
1132 /// @param snak out parameter. This is the snake current when the two
1144 snake& snak, int& ses_len)
1207 snak = s;
1242 snak = s;
1331 snake snak;
1358 v, snak);
1361 if (found && snak.end().x() == -1 && snak.end().y() == -1)
1370 v, snak);
1373 if ((snak.end().x() == (int) a_size - 1)
1374 && (snak.end().y() == (int) b_size - 1))
1523 snake snak;
1530 snak, d);
1535 snak.add(a_offset, b_offset);
1541 if ( snak.has_diagonal_edge())
1542 for (int x = snak.diagonal_start().x(), y = snak.diagonal_start().y();
1543 x <= snak.end().x() && y <= snak.end().y();
1577 snake_end_points(snak, px, pu);
1598 if (snak.has_diagonal_edge())
1600 for (int x = snak.diagonal_start().x(), y = snak.diagonal_start().y();
1601 x <= snak.end().x() && y <= snak.end().y();
1609 if (snak.has_vertical_edge())
1611 point p = snak.intermediate();
1616 else if (snak.has_horizontal_edge())
1618 if (snak.is_forward())
1620 deletion del(snak.intermediate().x());
1625 deletion del(snak.begin().x());