next up previous contents
Next: About this document ... Up: The LEDA User Manual Previous: Bibliography   Contents


Index

()
window : 17.2
_d_array<I,E,impl> : 9.6
_dictionary<K,I,impl> : 9.2
_p_queue<P,I,impl> : 10.2
_sortseq<K,I,impl> : 9.4
abs(bigfloat x) : 7.3
abs(integer a) : 7.1
abs(rational q) : 7.2
abs(real x) : 7.4
access(K k)
dictionary<K,I> : 9.1
acknowledge(string s)
GraphWin : 17.6
window : 17.2
activate(geo_scene sc)
GeoWin : 17.7
add_dependence(geo_scene sc1, geo_scene sc2)
GeoWin : 17.7
add_edge_done_rule(gml_edge_rule f)
gml_graph : 11.25
add_edge_menu(string label, gw_action func)
GraphWin : 17.6
add_edge_rule(gml_edge_rule f, gml_value_type t, char* key=0)
gml_graph : 11.25
add_graph_done_rule(gml_graph_rule f)
gml_graph : 11.25
add_graph_rule(gml_graph_rule f, gml_value_type t, char* key=0)
gml_graph : 11.25
add_help_text(string name)
GeoWin : 17.7
GraphWin : 17.6
add_member_call(void (GraphWin::*func)(), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)
GraphWin : 17.6
add_member_call(void (GraphWin::*func)(), string label, int menu_id=0, char* pmap=0)
GraphWin : 17.6
add_menu(long menu_id)
GraphWin : 17.6
add_menu(string label, int menu_id=0, char* pmap=0)
GraphWin : 17.6
add_new_edge_rule(gml_edge_rule f)
gml_graph : 11.25
add_new_graph_rule(gml_graph_rule f)
gml_graph : 11.25
add_new_node_rule(gml_node_rule f)
gml_graph : 11.25
add_node_done_rule(gml_node_rule f)
gml_graph : 11.25
add_node_menu(string label, gw_action func)
GraphWin : 17.6
add_node_rule(gml_node_rule f, gml_value_type t, char* key=0)
gml_graph : 11.25
add_scene_buttons(list<geo_scene> Ls, int w, int h, unsigned char** bm)
GeoWin : 17.7
add_scene_buttons(list<geo_scene> Ls, list<string> Ln)
GeoWin : 17.7
add_separator(int menu_id)
GraphWin : 17.6
add_simple_call(void (*func)(GraphWin& ), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)
GraphWin : 17.6
add_simple_call(void (*func)(GraphWin& ), string label, int menu_id=0, char* pmap=0)
GraphWin : 17.6
add_to_day(int d)
date : 6.19
add_to_month(int m)
date : 6.19
add_to_year(int y)
date : 6.19
addcost(d_vertex v, double x)
tree_collection<I> : 8.15
address(const_reference r)
leda_allocator<T> : 6.12
address(reference r)
leda_allocator<T> : 6.12
adj_edges(face)
graph : 11.1
adj_edges(node v)
graph : 11.1
adj_face(edge e)
graph : 11.1
adj_faces(node v)
graph : 11.1
adj_nodes(face f)
graph : 11.1
adj_nodes(node v)
graph : 11.1
adj_pred(edge e)
graph : 11.1
adj_pred(edge e, node v)
graph : 11.1
adj_succ(edge e)
graph : 11.1
adj_succ(edge e, node v)
graph : 11.1
AdjIt : 13.7
adjust_coords_to_box(node_array<double>& xpos, node_array<double>& ypos, double x0, double y0, double x1, double y1)
GraphWin : 17.6
adjust_coords_to_box(node_array<double>& xpos, node_array<double>& ypos, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends, double x0, double y0, double x1, double y1)
GraphWin : 17.6
adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos)
GraphWin : 17.6
adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends)
GraphWin : 17.6
affine_rank(array<d3_point> A) : 16.1
affine_rank(array<d3_point> L) : 16.1
affine_rank(array<d3_rat_point> A) : 16.8
affine_rank(array<d3_rat_point> L) : 16.8
affinely_independent(array<d3_point> A) : 16.1
affinely_independent(array<d3_rat_point> A) : 16.8
affinely_independent(array<point> A) : 14.1
affinely_independent(array<rat_point> A) : 14.8
affinely_independent(list<d3_point> L) : 16.1
affinely_independent(list<d3_rat_point> L) : 16.8
all_edges()
graph : 11.1
ALL_EMPTY_CIRCLES(list<point> L, list<circle>& CL) : 14.13
ALL_ENCLOSING_CIRCLES(list<point> L, list<circle>& CL) : 14.13
all_faces()
graph : 11.1
all_items()
d2_dictionary<K1,K2,I> : 15.1
all_nodes()
graph : 11.1
allocate(size_type n, const_pointer = 0)
leda_allocator<T> : 6.12
alt_key_down()
window : 17.2
angle()
line : 14.4
segment : 14.2
angle(line g)
line : 14.4
angle(point q, point r)
point : 14.1
angle(ray s)
ray : 14.3
angle(segment t)
segment : 14.2
angle(vector w)
vector : 7.6
append(const char* key)
gml_graph : 11.25
append(E x)
b_queue<E> : 8.6
list<E> : 8.7
queue<E> : 8.4
slist<E> : 8.8
append(node v)
node_list : 11.17
apply(void (*f)(E& x))
list<E> : 8.7
area()
GEN_POLYGON : 14.7
POLYGON : 14.6
area(point a, point b, point c) : 14.1
area(rat_point a, rat_point b, rat_point c) : 14.8
array2<E> : 8.2
array<E> : 8.1
ask_edge()
GraphWin : 17.6
ask_node()
GraphWin : 17.6
assign(edge e, etype x)
GRAPH<vtype,e...> : 11.2
PLANAR_MAP<vtype,e...> : 11.6
assign(face f, ftype x)
PLANAR_MAP<vtype,e...> : 11.6
assign(list_item it, E x)
list<E> : 8.7
assign(node v, vtype x)
GRAPH<vtype,e...> : 11.2
PLANAR_MAP<vtype,e...> : 11.6
b_node_pq<N> : 11.20
b_priority_queue<K> : 10.3
b_queue<E> : 8.6
b_stack<E> : 8.5
back()
list<E> : 8.7
basic_graph_alg : 12.1
begin()
STLNodeIt<DataAcc...> : 13.12
BF_GEN(GRAPH<int,int>& G, int n, int m, bool non_negative = true) : 12.2
BFS(graph G, node s, node_array<int>& dist) : 12.1
BFS(graph G, node s, node_array<int>& dist, node_array<edge>& pred) : 12.1
BICONNECTED_COMPONENTS(graph G, edge_array<int>& compnum) : 12.1
bigfloat : 7.3
binary_entropy(double x) : 7.11.3
binary_locate(E x)
array<E> : 8.1
binary_locate(int (*cmp)(E, E ), E x)
array<E> : 8.1
binary_search(E x)
array<E> : 8.1
binary_search(int (*cmp)(E, E ), E x)
array<E> : 8.1
bool_item(string s, bool& x, const char* hlp=0)
window : 17.2
bool_item(string s, bool& x, void (*F)(int), const char* hlp=0)
window : 17.2
Bounding_Box(list<point> L, point& pl, point& pb, point& pr, point& pt) : 14.13
bounding_box(POINT& xmin, POINT& ymin, POINT& xmax, POINT& ymax)
POLYGON : 14.6
bucket_sort(int (*f)(E ))
list<E> : 8.7
bucket_sort(int i, int j, int (*f)(E ))
list<E> : 8.7
bucket_sort_edges(edge_array<int> A)
graph : 11.1
bucket_sort_edges(int (*ord)(edge ))
graph : 11.1
bucket_sort_edges(int l, int h, int (*ord)(edge ))
graph : 11.1
bucket_sort_nodes(int (*ord)(node ))
graph : 11.1
bucket_sort_nodes(int l, int h, int (*ord)(node ))
graph : 11.1
bucket_sort_nodes(node_array<int> A)
graph : 11.1
button(char* pr1, char* pr2, string s, int n, const char* hlp=0)
window : 17.2
button(char* pr1, char* pr2, string s, int n, void (*F)(int), const char* hlp=0)
window : 17.2
button(char* pr1, char* pr2, string s, int n, window& M, const char* hlp=0)
window : 17.2
button(char* pr1, char* pr2, string s, void (*F)(int), const char* hlp=0)
window : 17.2
button(char* pr1, char* pr2, string s, window& M, const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, int n, const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, int n, void (*F)(int), const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, int n, window& M, const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, void (*F)(int), const char* hlp=0)
window : 17.2
button(int w, int h, unsigned char* bm, string s, window& M, const char* hlp=0)
window : 17.2
button(string s)
menu : 17.4
button(string s, const char* hlp=0)
window : 17.2
button(string s, int n)
menu : 17.4
button(string s, int n, const char* hlp=0)
window : 17.2
button(string s, int n, void (*F)(int))
menu : 17.4
button(string s, int n, void (*F)(int), const char* hlp=0)
window : 17.2
button(string s, int n, window& M, const char* hlp=0)
window : 17.2
button(string s, int n, window& W)
menu : 17.4
button(string s, void (*F)(int))
menu : 17.4
button(string s, void (*F)(int), const char* hlp=0)
window : 17.2
button(string s, window& M, const char* hlp=0)
window : 17.2
button(string s, window& W)
menu : 17.4
button_press_time()
window : 17.2
button_release_time()
window : 17.2
buttons_per_line(int n)
window : 17.2
C_style()
array<E> : 8.1
canonical_rep()
GEN_POLYGON : 14.7
catch_system_errors(bool b=true) : 6.13
ceil(bigfloat x) : 7.3
ceil(rational q) : 7.2
center()
circle : 14.5
d3_rat_sphere : 16.13
d3_sphere : 16.6
rat_circle : 14.12
center(d3_point a, d3_point b) : 16.1
center(point a, point b) : 14.1
center_pixrect(double x, double y, char* pr)
window : 17.2
CGAL : 13.1.4 | 13.5
change_inf(dic2_item it, I i)
d2_dictionary<K1,K2,I> : 15.1
change_inf(dic_item it, I i)
dictionary<K,I> : 9.1
change_inf(is_item it, I i)
interval_set<I> : 15.3
change_inf(p_dic_item it, I i)
p_dictionary<K,I> : 9.10
change_inf(partition_item it, E x)
Partition<E> : 8.13
change_inf(pp_dic_item it, I i)
pp_dictionary<K,I,CMP> : 9.11
change_inf(pq_item it, I i)
p_queue<P,I> : 10.1
change_inf(seg_item it, I i)
segment_set<I> : 15.4
change_inf(seq_item it, I i)
sortseq<K,I> : 9.3
CHECK_HULL(GRAPH<d3_point,int> H) : 16.15
CHECK_HULL(GRAPH<d3_rat_point,int> H) : 16.15
CHECK_KURATOWSKI(graph G, list<edge> el) : 12.11
CHECK_MAX_CARD_MATCHING(graph G, list<edge> M, node_array<int> OSC) : 12.8
CHECK_MCB(graph G, list<edge> M, node_array<bool> NC) : 12.6
check_representation()
GEN_POLYGON : 14.7
check_simplicity()
POLYGON : 14.6
choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)
window : 17.2
choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, void (*F)(int), const char* hlp=0)
window : 17.2
choice_item(string s, int& x, list<string> L, void (*F)(int)=0, const char* hlp=0)
window : 17.2
choice_item(string s, int& x, string s1, ..., string sk)
window : 17.2
choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)
window : 17.2
choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, void (*F)(int), const char* hlp=0)
window : 17.2
choice_mult_item(string s, int& x, list<string> L, const char* hlp=0)
window : 17.2
choice_mult_item(string s, int& x, list<string> L, void (*F)(int), const char* hlp=0)
window : 17.2
choose()
d_int_set : 8.11
edge_set : 11.16
node_set : 11.15
set<E> : 8.9
choose_edge()
graph : 11.1
choose_face()
graph : 11.1
choose_node()
graph : 11.1
circle : 14.5
circulators : 13.5
circumscribing_sphere()
d3_rat_simplex : 16.14
d3_simplex : 16.7
clear()
b_queue<E> : 8.6
b_stack<E> : 8.5
d2_dictionary<K1,K2,I> : 15.1
d_array<I,E> : 9.5
d_int_set : 8.11
dictionary<K,I> : 9.1
edge_set : 11.16
graph : 11.1
h_array<I,E> : 9.7
int_set : 8.10
interval_set<I> : 15.3
list<E> : 8.7
map2<I1,I2,E> : 9.9
map<I,E> : 9.8
node_list : 11.17
node_pq<P> : 11.19
node_set : 11.15
p_queue<P,I> : 10.1
POINT_SET : 15.2
pp_dictionary<K,I,CMP> : 9.11
queue<E> : 8.4
segment_set<I> : 15.4
set<E> : 8.9
sortseq<K,I> : 9.3
stack<E> : 8.3
window : 17.2
clear(color c)
window : 17.2
clear(double x0, double y0, double x1, double y1)
window : 17.2
clear(double xorig, double yorig)
window : 17.2
clear(E x)
map<I,E> : 9.8
clear_actions()
GeoWin : 17.7
GraphWin : 17.6
clear_graph()
GraphWin : 17.6
clip(point p, point q, segment& s)
line : 14.4
clip(rat_point p, rat_point q, rat_segment& s)
rat_line : 14.11
close()
GeoWin : 17.7
GraphWin : 17.6
window : 17.2
CLOSEST_PAIR(list<point>& L, point& r1, point& r2) : 14.13
cmd_istream : 6.6
cmd_ostream : 6.7
cmdline_graph(graph& G, int argc, char** argv) : 11.21
cmp_dist(point q, point r)
point : 14.1
cmp_dist(rat_point q, rat_point r)
rat_point : 14.8
cmp_distances(d3_point p1, d3_point p2, d3_point p3, d3_point p4) : 16.1
cmp_distances(d3_rat_point p1, d3_rat_point p2, d3_rat_point p3, d3_rat_point p4) : 16.8
cmp_distances(point p1, point p2, point p3, point p4) : 14.1
cmp_distances(rat_point p1, rat_point p2, rat_point p3, rat_point p4) : 14.8
cmp_segments_at_xcoord(rat_segment s1, rat_segment s2, rat_point p) : 14.9
cmp_segments_at_xcoord(segment s1, segment s2, point p) : 14.2
cmp_signed_dist(point a, point b, point c, point d) : 14.1
cmp_signed_dist(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8
cmp_slope(rat_segment s1)
rat_segment : 14.9
cmp_slopes(line l1, line l2) : 14.4
cmp_slopes(rat_line l1, rat_line l2) : 14.11
cmp_slopes(rat_ray r1, rat_ray r2) : 14.10
cmp_slopes(rat_segment s1, rat_segment s2) : 14.9
cmp_slopes(ray r1, ray r2) : 14.3
cmp_slopes(segment s1, segment s2) : 14.2
cocircular(point a, point b, point c, point d) : 14.1
cocircular(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8
col(int i)
integer_matrix : 7.9
matrix : 7.7
collinear(d3_point a, d3_point b, d3_point c) : 16.1
collinear(d3_rat_point a, d3_rat_point b, d3_rat_point c) : 16.8
collinear(point a, point b, point c) : 14.1
collinear(rat_point a, rat_point b, rat_point c) : 14.8
color : 17.1
color_item(string s, color& x, const char* hlp=0)
window : 17.2
color_item(string s, color& x, void (*F)(int), const char* hlp=0)
window : 17.2
compare(...) : see User defined parameter types
compare_by_angle(rat_vector v1, rat_vector v2) : 7.10
compare_by_angle(vector v1, vector v2) : 7.6
complement()
GEN_POLYGON : 14.7
POLYGON : 14.6
complete_bigraph(graph& G, int a, int b, list<node>& A, list<node>& B) : 11.21
complete_graph(graph& G, int n) : 11.21
complete_ugraph(graph& G, int n) : 11.21
compnumb()
GIT_SCC<Out,In,...> : 13.20
COMPONENTS(graph G, node_array<int>& compnum) : 12.1
CompPred<Iter,DA...> : 13.10
compute_faces()
graph : 11.1
compute_voronoi(GRAPH<CIRCLE,POINT>& V)
POINT_SET : 15.2
compute_with_precision(long k)
real : 7.4
conc(list<E>& L1, int dir = LEDA::after)
list<E> : 8.7
conc(slist<E>& L1)
slist<E> : 8.8
conc(sortseq<K,I>& S1, int dir = LEDA::after)
sortseq<K,I> : 9.3
confirm(string s)
window : 17.2
constant_da<T> : 13.14
construct(pointer p, const_reference r)
leda_allocator<T> : 6.12
contained_in_affine_hull(array<d3_point> A, d3_point x) : 16.1
contained_in_affine_hull(array<d3_rat_point> A, d3_rat_point x) : 16.8
contained_in_affine_hull(array<point> A, point p) : 14.1
contained_in_affine_hull(array<rat_point> A, rat_point p) : 14.8
contained_in_affine_hull(list<d3_point> L, d3_point x) : 16.1
contained_in_affine_hull(list<d3_rat_point> L, d3_rat_point x) : 16.8
contained_in_linear_hull(array<rat_vector> A, rat_vector x) : 7.10
contained_in_simplex(array<d3_point> A, d3_point x) : 16.1
contained_in_simplex(array<d3_rat_point> A, d3_rat_point x) : 16.8
contained_in_simplex(array<point> A, point p) : 14.1
contained_in_simplex(array<rat_point> A, rat_point p) : 14.8
contained_in_simplex(d3_point a, d3_point b, d3_point c, d3_point d, d3_point x) : 16.1
contained_in_simplex(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d, d3_rat_point x) : 16.8
contains(d3_point p)
d3_line : 16.4
d3_ray : 16.2
d3_segment : 16.3
d3_sphere : 16.6
contains(d3_point q)
d3_plane : 16.5
contains(d3_rat_point p)
d3_rat_line : 16.10
d3_rat_ray : 16.9
d3_rat_segment : 16.11
d3_rat_sphere : 16.13
contains(d3_rat_point q)
d3_rat_plane : 16.12
contains(d3_rat_segment s)
d3_rat_ray : 16.9
contains(d3_segment s)
d3_ray : 16.2
contains(point p)
circle : 14.5
GEN_POLYGON : 14.7
line : 14.4
POLYGON : 14.6
segment : 14.2
window : 17.2
contains(point)
ray : 14.3
contains(rat_point p)
rat_circle : 14.12
rat_line : 14.11
rat_ray : 14.10
rat_segment : 14.9
contains(rat_segment s)
rat_ray : 14.10
contains(segment)
ray : 14.3
contents(int i)
integer : 7.1
contents(list_item it)
list<E> : 8.7
contents(slist_item it)
slist<E> : 8.8
CONVEX_COMPONENTS(gen_polygon GP, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary_edges, list<edge>& hole_edges) : 14.13
CONVEX_COMPONENTS(polygon P, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary) : 14.13
CONVEX_HULL(list<d3_point> L, GRAPH<d3_point,int>& H) : 16.15
CONVEX_HULL(list<d3_rat_point> L, GRAPH<d3_rat_point,int>& H) : 16.15
CONVEX_HULL(list<point> L) : 14.13
CONVEX_HULL_IC(list<point> L) : 14.13
CONVEX_HULL_POLY(list<point> L) : 14.13
CONVEX_HULL_RIC(list<point> L) : 14.13
CONVEX_HULL_S(list<point> L) : 14.13
coord(int i)
rat_vector : 7.10
vector : 7.6
coord_type
circle : 14.5
d3_rat_simplex : 16.14
d3_simplex : 16.7
line : 14.4
point : 14.1
POLYGON : 14.6
rat_circle : 14.12
rat_line : 14.11
rat_point : 14.8
rat_ray : 14.10
rat_segment : 14.9
ray : 14.3
segment : 14.2
coplanar(d3_point a, d3_point b, d3_point c, d3_point d) : 16.1
coplanar(d3_rat_point a, d3_rat_point b, d3_rat_point c, d3_rat_point d) : 16.8
copy(int x, array<E> B, int y)
array<E> : 8.1
copy(int x, int y)
array<E> : 8.1
copy_rect(double x0, double y0, double x1, double y1, double x, double y)
window : 17.2
CopyGraph(GRAPH<node,edge>& H, graph G) : 11.22
CopyGraph(GRAPH<node,edge>& H, graph G, list<edge> E) : 11.22
CopyGraph(GRAPH<node,edge>& H, graph G, list<node> V, list<edge> E) : 11.22
CopyGraph(graph& H, graph G) : 11.22
cost(vertex v)
dynamic_trees : 8.14
create_bitmap(int w, int h, unsigned char* bm_data)
window : 17.2
create_directory(string fname) : 6.14
create_pixrect(const char** xpm_str)
window : 17.2
create_pixrect(int w, int h, unsigned char* bm_data, int fg=window::fgcol, int bg=window::bgcol)
window : 17.2
create_pixrect(string xpm_file)
window : 17.2
CRUST(list<point> L0, GRAPH<point,int>& G) : 14.13
ctrl_key_down()
window : 17.2
curr_adj()
AdjIt : 13.7
GIT_DIJKSTRA<OutAdjI...> : 13.21
InAdjIt : 13.6
OutAdjIt : 13.5
current()
GIT_BFS<OutAdjI...> : 13.17
GIT_DFS<OutAdjI...> : 13.18
GIT_DIJKSTRA<OutAdjI...> : 13.21
GIT_TOPOSORT<OutAdjI...> : 13.19
current_node()
dynamic_markov_chain : 11.24
GIT_SCC<Out,In,...> : 13.20
markov_chain : 11.23
current_outdeg()
dynamic_markov_chain : 11.24
markov_chain : 11.23
cut(d_vertex v)
tree_collection<I> : 8.15
cut(vertex v)
dynamic_trees : 8.14
CUT_VALUE(graph G, edge_array<int> weight, list<node> C) : 12.5
cycle_found()
GIT_TOPOSORT<OutAdjI...> : 13.19
cyclic_adj_pred(edge e)
graph : 11.1
cyclic_adj_pred(edge e, node v)
graph : 11.1
cyclic_adj_succ(edge e)
graph : 11.1
cyclic_adj_succ(edge e, node v)
graph : 11.1
cyclic_in_pred(edge e)
graph : 11.1
cyclic_in_succ(edge e)
graph : 11.1
cyclic_pred(list_item it)
list<E> : 8.7
cyclic_pred(node v)
node_list : 11.17
cyclic_succ(list_item it)
list<E> : 8.7
cyclic_succ(node v)
node_list : 11.17
cyclic_succ(slist_item it)
slist<E> : 8.8
d2(integer a, integer b, integer D)
rat_vector : 7.10
d2_dictionary<K1,K2,I> : 15.1
d3(integer a, integer b, integer c, integer D)
rat_vector : 7.10
d3_grid_graph(graph& G, int n) : 11.21
d3_grid_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, node_array<double>& zcoord, int n) : 11.21
d3_hull : 16.15
d3_line : 16.4
d3_plane : 16.5
d3_point : 16.1
d3_rat_line : 16.10
d3_rat_plane : 16.12
d3_rat_point : 16.8
d3_rat_ray : 16.9
d3_rat_segment : 16.11
d3_rat_simplex : 16.14
d3_rat_sphere : 16.13
d3_ray : 16.2
d3_segment : 16.3
d3_simplex : 16.7
d3_sphere : 16.6
d_array<I,E> : 9.5
d_face_cycle_pred(edge e)
POINT_SET : 15.2
d_face_cycle_succ(edge e)
POINT_SET : 15.2
d_int_set : 8.11
data accessor : 13.1.5
date : 6.19
days_until(date D2)
date : 6.19
deallocate(pointer p, size_type n)
leda_allocator<T> : 6.12
decrease_p(node v, P x)
node_pq<P> : 11.19
decrease_p(pq_item it, P x)
p_queue<P,I> : 10.1
define_area(double& x0, double& y0, double& x1, double& y1, const char* msg=")
GraphWin : 17.6
defined(I i)
d_array<I,E> : 9.5
h_array<I,E> : 9.7
map<I,E> : 9.8
defined(I1 i, I2 j)
map2<I1,I2,E> : 9.9
defined(node v, node w)
node_map2<E> : 11.14
degree(node v)
graph : 11.1
del()
AdjIt : 13.7
EdgeIt : 13.3
InAdjIt : 13.6
NodeIt : 13.2
OutAdjIt : 13.5
del(double x, double y)
interval_set<I> : 15.3
del(E x)
set<E> : 8.9
del(edge x)
edge_set : 11.16
del(geo_scenegroup GS, geo_scene sc)
GeoWin : 17.7
del(int i)
string : 6.1
del(int i, int j)
string : 6.1
del(int x)
d_int_set : 8.11
int_set : 8.10
del(K k)
dictionary<K,I> : 9.1
p_dictionary<K,I> : 9.10
pp_dictionary<K,I,CMP> : 9.11
sortseq<K,I> : 9.3
del(K1 x, K2 y)
d2_dictionary<K1,K2,I> : 15.1
del(list_item it)
list<E> : 8.7
del(node v)
node_list : 11.17
node_pq<P> : 11.19
POINT_SET : 15.2
del(node w)
b_node_pq<N> : 11.20
del(node x)
node_set : 11.15
del(POINT p)
POINT_SET : 15.2
del(segment s)
segment_set<I> : 15.4
del(string s1, int i=1)
string : 6.1
del_all(string s1)
string : 6.1
del_all_edges()
graph : 11.1
del_all_faces()
graph : 11.1
del_all_nodes()
graph : 11.1
del_bitmap(char* bm)
window : 17.2
del_dependence(geo_scene sc1, geo_scene sc2)
GeoWin : 17.7
del_edge(edge e)
graph : 11.1
GraphWin : 17.6
planar_map : 11.5
del_edges(list<edge> L)
graph : 11.1
del_item(dic2_item it)
d2_dictionary<K1,K2,I> : 15.1
del_item(dic_item it)
dictionary<K,I> : 9.1
del_item(is_item it)
interval_set<I> : 15.3
del_item(list_item it)
list<E> : 8.7
del_item(p_dic_item it)
p_dictionary<K,I> : 9.10
del_item(pp_dic_item it)
pp_dictionary<K,I,CMP> : 9.11
del_item(pq_item it)
p_queue<P,I> : 10.1
del_item(seg_item it)
segment_set<I> : 15.4
del_item(seq_item it)
sortseq<K,I> : 9.3
del_menu(long menu_id)
GraphWin : 17.6
del_message()
GraphWin : 17.6
window : 17.2
del_min()
b_node_pq<N> : 11.20
node_pq<P> : 11.19
p_queue<P,I> : 10.1
del_node(node v)
graph : 11.1
GraphWin : 17.6
del_nodes(list<node> L)
graph : 11.1
del_pin_point()
GeoWin : 17.7
del_pixrect(char* pr)
window : 17.2
del_succ_item(slist_item it)
slist<E> : 8.8
DELAUNAY_DIAGRAM(list<point> L, GRAPH<point,int>& DD) : 14.13
DELAUNAY_TRIANG(GRAPH<point,segment>& G) : 14.13
DELAUNAY_TRIANG(list<point> L, GRAPH<point,int>& DT) : 14.13
DELAUNAY_TRIANG(list<segment> L, GRAPH<point,segment>& G) : 14.13
delete_file(string fname) : 6.14
Delete_Loops(graph& G) : 11.22
delete_subsequence(seq_item a, seq_item b, sortseq<K,I>& S1)
sortseq<K,I> : 9.3
denominator()
rational : 7.2
deselect(edge e)
GraphWin : 17.6
deselect(node v)
GraphWin : 17.6
deselect_all()
GraphWin : 17.6
deselect_all_edges()
GraphWin : 17.6
deselect_all_nodes()
GraphWin : 17.6
design pattern : 13.1.1
destroy(geo_scene sc)
GeoWin : 17.7
destroy(pointer p)
leda_allocator<T> : 6.12
det()
matrix : 7.7
determinant(integer_matrix M) : 7.9
determinant(integer_matrix M, integer_matrix& L, integer_matrix& U, array<int>& q, integer_vector& c) : 7.9
DFS(graph G, node s, node_array<bool>& reached) : 12.1
DFS_NUM(graph G, node_array<int>& dfsnum, node_array<int>& compnum) : 12.1
dictionary<K,I> : 9.1
diff(d_int_set T)
d_int_set : 8.11
diff(GEN_POLYGON Q)
GEN_POLYGON : 14.7
diff(set<E> T)
set<E> : 8.9
dim()
integer_vector : 7.8
POINT_SET : 15.2
rat_vector : 7.10
vector : 7.6
dim1()
integer_matrix : 7.9
matrix : 7.7
dim2()
integer_matrix : 7.9
matrix : 7.7
direction()
line : 14.4
ray : 14.3
segment : 14.2
disable_button(int b)
window : 17.2
disable_call(int id)
GraphWin : 17.6
disable_calls()
GraphWin : 17.6
disable_item(panel_item it)
window : 17.2
disable_menus()
GeoWin : 17.7
disable_panel(bool disable_every_item=true)
window : 17.2
display()
GraphWin : 17.6
window : 17.2
display(int x = window::center, int y = window::center)
GeoWin : 17.7
display(int x, int y)
GraphWin : 17.6
window : 17.2
display(window& w, int x, int y)
window : 17.2
display_help_text(string fname)
GraphWin : 17.6
window : 17.2
dist(real x, real y) : 7.4
distance()
point : 14.1
segment : 14.2
distance(circle D)
circle : 14.5
distance(d3_point p)
d3_line : 16.4
distance(d3_point q)
d3_plane : 16.5
d3_point : 16.1
distance(line l)
circle : 14.5
distance(point p)
circle : 14.5
GEN_POLYGON : 14.7
POLYGON : 14.6
segment : 14.2
distance(point q)
line : 14.4
point : 14.1
DocTools : 4.7
Double(rational q) : 7.2
double_item(string s, double& x, const char* hlp=0)
window : 17.2
draw_arc(point p, point q, point r, color c=window::fgcol)
window : 17.2
draw_arc_arrow(point p, point q, point r, color c=window::fgcol)
window : 17.2
draw_arrow(double x1, double y1, double x2, double y2, color c =window::fgcol)
window : 17.2
draw_arrow(point p, point q, color c=window::fgcol)
window : 17.2
draw_arrow(segment s, color=window::fgcol)
window : 17.2
draw_arrow_head(point p, double dir, color c=window::fgcol)
window : 17.2
draw_bezier(list<point> C, int n, color c=window::fgcol)
window : 17.2
draw_bezier_arrow(list<point> C, int n, color c=window::fgcol)
window : 17.2
draw_box(double x0, double y0, double x1, double y1, color c=window::fgcol)
window : 17.2
draw_box(point p, point q, color c=window::fgcol)
window : 17.2
draw_box(rectangle R, color c=window::fgcol)
window : 17.2
draw_circle(circle C, color c=window::fgcol)
window : 17.2
draw_circle(double x, double y, double r, color c=window::fgcol)
window : 17.2
draw_circle(point p, double r, color c=window::fgcol)
window : 17.2
draw_closed_spline(list<point> L, int n, color c=window::fgcol)
window : 17.2
draw_ctext(double x, double y, string s, color c=window::fgcol)
window : 17.2
draw_ctext(point p, string s, color c=window::fgcol)
window : 17.2
draw_ctext(string s, color c=window::fgcol)
window : 17.2
draw_disc(circle C, color c=window::fgcol)
window : 17.2
draw_disc(double x, double y, double r, color c=window::fgcol)
window : 17.2
draw_disc(point p, double r, color c=window::fgcol)
window : 17.2
draw_edge(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 17.2
draw_edge(edge e, void (*draw_diagram_edge)(POINT, POINT ), void (*draw_triang_edge) (POINT, POINT ), void (*draw_hull_dart) (POINT, POINT ))
POINT_SET : 15.2
draw_edge(point p, point q, color c=window::fgcol)
window : 17.2
draw_edge(segment s, color c=window::fgcol)
window : 17.2
draw_edge_arrow(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 17.2
draw_edge_arrow(point p, point q, color c=window::fgcol)
window : 17.2
draw_edge_arrow(segment s, color c=window::fgcol)
window : 17.2
draw_edges(list<edge> L, void (*draw_edge)(POINT, POINT ))
POINT_SET : 15.2
draw_edges(void (*draw_diagram_edge)(POINT, POINT ), void (*draw_triang_edge) (POINT, POINT ), void (*draw_hull_dart) (POINT, POINT ))
POINT_SET : 15.2
draw_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)
window : 17.2
draw_ellipse(point p, double r1, double r2, color c=window::fgcol)
window : 17.2
draw_filled_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)
window : 17.2
draw_filled_ellipse(point p, double r1, double r2, color c=window::fgcol)
window : 17.2
draw_filled_node(double x0, double y0, color c=window::bgcol)
window : 17.2
draw_filled_node(point p, color c=window::bgcol)
window : 17.2
draw_filled_polygon(gen_polygon P, color c=window::fgcol)
window : 17.2
draw_filled_polygon(list<point> lp, color c=window::fgcol)
window : 17.2
draw_filled_polygon(polygon P, color c=window::fgcol)
window : 17.2
draw_filled_rectangle(point p, point q, color=window::fgcol)
window : 17.2
draw_filled_rectangle(rectangle R, color=window::fgcol)
window : 17.2
draw_filled_triangle(point a, point b, point c, color=window::fgcol)
window : 17.2
draw_filled_triangle(triangle T, color=window::fgcol)
window : 17.2
draw_hline(double y, color c=window::fgcol)
window : 17.2
draw_hull(void (*draw_poly)(list<POINT> ))
POINT_SET : 15.2
draw_int_node(double x, double y, int i, color c=window::bgcol)
window : 17.2
draw_int_node(point p, int i, color c=window::bgcol)
window : 17.2
draw_line(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 17.2
draw_line(line l, color c=window::fgcol)
window : 17.2
draw_line(point p, point q, color c=window::fgcol)
window : 17.2
draw_line(segment s, color c=window::fgcol)
window : 17.2
draw_node(double x0, double y0, color c=window::fgcol)
window : 17.2
draw_node(point p, color c=window::fgcol)
window : 17.2
draw_nodes(void (*draw_node)(POINT ))
POINT_SET : 15.2
draw_oriented_polygon(gen_polygon P, color c=window::fgcol)
window : 17.2
draw_oriented_polygon(list<point> lp, color c=window::fgcol)
window : 17.2
draw_oriented_polygon(polygon P, color c=window::fgcol)
window : 17.2
draw_pixel(double x, double y, color c=window::fgcol)
window : 17.2
draw_pixel(point p, color c=window::fgcol)
window : 17.2
draw_pixels(int n, double* xcoord, double* ycoord, color c=window::fgcol)
window : 17.2
draw_pixels(list<point> L, color c=window::fgcol)
window : 17.2
draw_point(double x, double y, color c=window::fgcol)
window : 17.2
draw_point(point p, color c=window::fgcol)
window : 17.2
draw_polygon(gen_polygon P, color c=window::fgcol)
window : 17.2
draw_polygon(list<point> lp, color c=window::fgcol)
window : 17.2
draw_polygon(polygon P, color c=window::fgcol)
window : 17.2
draw_polyline(int n, double* xc, double* yc, color c=window::fgcol)
window : 17.2
draw_polyline(list<point> lp, color c=window::fgcol)
window : 17.2
draw_polyline_arrow(list<point> lp, color c=window::fgcol)
window : 17.2
draw_ray(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 17.2
draw_ray(point p, point q, color c=window::fgcol)
window : 17.2
draw_ray(point p, point q, line l, color c = window::fgcol)
window : 17.2
draw_ray(ray r, color c=window::fgcol)
window : 17.2
draw_ray(segment s, color c=window::fgcol)
window : 17.2
draw_rectangle(double x0, double y0, double x1, double y1, color=window::fgcol)
window : 17.2
draw_rectangle(point p, point q, color=window::fgcol)
window : 17.2
draw_rectangle(point p, point q, double rndness, color col=window::fgcol)
window : 17.2
draw_rectangle(rectangle R, color=window::fgcol)
window : 17.2
draw_roundbox(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)
window : 17.2
draw_roundbox(point p, point q, double rndness, color col=window::fgcol)
window : 17.2
draw_roundrect(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)
window : 17.2
draw_segment(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 17.2
draw_segment(point p, point q, color c=window::fgcol)
window : 17.2
draw_segment(point p, point q, line l, color c = window::fgcol)
window : 17.2
draw_segment(segment s, color c=window::fgcol)
window : 17.2
draw_segments(list<segment> L, color c=window::fgcol)
window : 17.2
draw_spline(list<point> L, int n, color c=window::fgcol)
window : 17.2
draw_spline(polygon P, int n, color c=window::fgcol)
window : 17.2
draw_spline_arrow(list<point> L, int n, color c=window::fgcol)
window : 17.2
draw_text(double x, double y, string s, color c=window::fgcol)
window : 17.2
draw_text(point p, string s, color c=window::fgcol)
window : 17.2
draw_text_node(double x, double y, string s, color c=window::bgcol)
window : 17.2
draw_text_node(point p, string s, color c=window::bgcol)
window : 17.2
draw_triangle(point a, point b, point c, color=window::fgcol)
window : 17.2
draw_triangle(triangle T, color=window::fgcol)
window : 17.2
draw_vline(double x, color c=window::fgcol)
window : 17.2
draw_voro(GRAPH<CIRCLE,POINT>, void (*draw_node)(POINT ), void (*draw_edge)(POINT, POINT ), void (*draw_ray) (POINT, POINT ))
POINT_SET : 15.2
draw_voro_edges(void (*draw_edge)(POINT, POINT ), void (*draw_ray) (POINT, POINT ))
POINT_SET : 15.2
dual()
line : 14.4
rat_line : 14.11
dual_map(graph& D)
graph : 11.1
dx()
d3_rat_segment : 16.11
d3_segment : 16.3
rat_segment : 14.9
segment : 14.2
dxD()
rat_segment : 14.9
dy()
d3_rat_segment : 16.11
d3_segment : 16.3
rat_segment : 14.9
segment : 14.2
dyD()
rat_segment : 14.9
dynamic_markov_chain : 11.24
dynamic_random_variate : 6.10
dynamic_trees : 8.14
dz()
d3_rat_segment : 16.11
d3_segment : 16.3
edge_array<E> : 11.8
edge_data()
GRAPH<vtype,e...> : 11.2
edge_inf(vertex v)
dynamic_trees : 8.14
edge_map<E> : 11.11
edge_set : 11.16
EdgeIt : 13.3
edges()
GEN_POLYGON : 14.7
edit()
GeoWin : 17.7
GraphWin : 17.6
edit(geo_scene sc)
GeoWin : 17.7
element_type
d_array<I,E> : 9.5
map<I,E> : 9.8
eliminate_colinear_vertices()
POLYGON : 14.6
empty()
b_queue<E> : 8.6
b_stack<E> : 8.5
d2_dictionary<K1,K2,I> : 15.1
d_int_set : 8.11
dictionary<K,I> : 9.1
edge_set : 11.16
GEN_POLYGON : 14.7
graph : 11.1
interval_set<I> : 15.3
list<E> : 8.7
node_list : 11.17
node_pq<P> : 11.19
node_set : 11.15
p_dictionary<K,I> : 9.10
p_queue<P,I> : 10.1
POINT_SET : 15.2
POLYGON : 14.6
pp_dictionary<K,I,CMP> : 9.11
queue<E> : 8.4
segment_set<I> : 15.4
set<E> : 8.9
slist<E> : 8.8
sortseq<K,I> : 9.3
stack<E> : 8.3
enable_button(int b)
window : 17.2
enable_call(int id)
GraphWin : 17.6
enable_calls()
GraphWin : 17.6
enable_item(panel_item it)
window : 17.2
enable_menus()
GeoWin : 17.7
enable_panel()
window : 17.2
end()
rat_segment : 14.9
segment : 14.2
STLNodeIt<DataAcc...> : 13.12
eol()
AdjIt : 13.7
EdgeIt : 13.3
FaceCirc : 13.8
FaceIt : 13.4
InAdjIt : 13.6
NodeIt : 13.2
OutAdjIt : 13.5
equal_as_sets(rat_circle C1, rat_circle C2)
rat_circle : 14.12
equal_as_sets(rat_line l, rat_line g) : 14.11
equal_as_sets(rat_segment s, rat_segment t) : 14.9
erase(list_item it)
list<E> : 8.7
error : 6.13
error_handler(int err_no, const char* msg) : 6.13
evert(vertex v)
dynamic_trees : 8.14
F_DELAUNAY_DIAGRAM(list<point> L, GRAPH<point,int>& FDD) : 14.13
F_DELAUNAY_TRIANG(list<point> L, GRAPH<point,int>& FDT) : 14.13
F_VORONOI(list<point> L, GRAPH<circle,point>& FVD) : 14.13
face_array<E> : 11.9
face_cycle_pred(edge e)
graph : 11.1
face_cycle_succ(edge e)
graph : 11.1
face_map<E> : 11.12
face_of(edge e) : 11.1
graph : 11.1
FaceCirc : 13.8
FaceIt : 13.4
fbutton(string s, const char* hlp=0)
window : 17.2
fbutton(string s, int n, const char* hlp=0)
window : 17.2
fbutton(string s, int n, void (*F)(int), const char* hlp=0)
window : 17.2
file : 6.14
file_istream : 6.2
file_ostream : 6.3
fill_window()
GeoWin : 17.7
FilterNodeIt<Predica...> : 13.9
find(node v)
node_partition : 11.18
find(partition_item p)
partition : 8.12
Partition<E> : 8.13
find_min()
node_pq<P> : 11.19
p_queue<P,I> : 10.1
findcost(d_vertex v, double& x)
tree_collection<I> : 8.15
findroot(d_vertex v)
tree_collection<I> : 8.15
finger_locate(K k)
sortseq<K,I> : 9.3
finger_locate(seq_item it, K k)
sortseq<K,I> : 9.3
finger_locate_from_front(K k)
sortseq<K,I> : 9.3
finger_locate_from_rear(K k)
sortseq<K,I> : 9.3
finger_locate_pred(K k)
sortseq<K,I> : 9.3
finger_locate_pred(seq_item it, K k)
sortseq<K,I> : 9.3
finger_locate_pred_from_front(K k)
sortseq<K,I> : 9.3
finger_locate_pred_from_rear(K k)
sortseq<K,I> : 9.3
finger_locate_succ(K k)
sortseq<K,I> : 9.3
finger_locate_succ(seq_item it, K k)
sortseq<K,I> : 9.3
finger_locate_succ_from_front(K k)
sortseq<K,I> : 9.3
finger_locate_succ_from_rear(K k)
sortseq<K,I> : 9.3
finger_lookup(K k)
sortseq<K,I> : 9.3
finger_lookup(seq_item it, K k)
sortseq<K,I> : 9.3
finger_lookup_from_front(K k)
sortseq<K,I> : 9.3
finger_lookup_from_rear(K k)
sortseq<K,I> : 9.3
finish_algo()
GIT_BFS<OutAdjI...> : 13.17
GIT_DFS<OutAdjI...> : 13.18
GIT_DIJKSTRA<OutAdjI...> : 13.21
GIT_SCC<Out,In,...> : 13.20
GIT_TOPOSORT<OutAdjI...> : 13.19
finish_menu_bar()
GraphWin : 17.6
finished()
GIT_BFS<OutAdjI...> : 13.17
GIT_DFS<OutAdjI...> : 13.18
GIT_DIJKSTRA<OutAdjI...> : 13.21
GIT_SCC<Out,In,...> : 13.20
GIT_TOPOSORT<OutAdjI...> : 13.19
first()
four_tuple<A,B,C,D> : 6.18
list<E> : 8.7
slist<E> : 8.8
three_tuple<A,B,C> : 6.17
two_tuple<A,B> : 6.16
first_adj_edge(node v)
graph : 11.1
first_edge()
graph : 11.1
first_face()
graph : 11.1
first_face_edge(face f)
graph : 11.1
first_file_in_path(string fname, string path, char sep = ':') : 6.14
first_in_edge(node v)
graph : 11.1
first_node()
graph : 11.1
FIVE_COLOR(graph& G, node_array<int>& C) : 12.11
flip_items(seq_item a, seq_item b)
sortseq<K,I> : 9.3
float_type
POLYGON : 14.6
rat_circle : 14.12
rat_line : 14.11
rat_point : 14.8
rat_ray : 14.10
rat_segment : 14.9
floatf : 7.5
floor(bigfloat x) : 7.3
floor(rational q) : 7.2
flush_buffer()
window : 17.2
flush_buffer(double dx, double dy)
window : 17.2
flush_buffer(double dx, double dy, double x0, double y0, double x1, double y1)
window : 17.2
flush_buffer(double x0, double y0, double x1, double y1)
window : 17.2
Fman : 4.7
four_tuple<A,B,C,D> : 6.18
fourth()
four_tuple<A,B,C,D> : 6.18
from_string(number_string s)
integer : 7.1
front()
list<E> : 8.7
full()
GEN_POLYGON : 14.7
gcd(integer a, integer b) : 7.1
GEN_POLYGON : 14.7
generate()
dynamic_random_variate : 6.10
random_variate : 6.9
Genus(graph G) : 11.22
geo_alg : 14.13
Geometry
delaunay tree : 18.1.3
interval tree : 18.1.3
priority search tree : 18.1.3
range tree : 18.1.3
segment tree : 18.1.3
GeoWin : 17.7
get()
random_source : 6.8
get(constant_da<T> ca, Iter it) : 13.14
get(int x)
array<E> : 8.1
get(node_array_da<T> da, Iter it) : 13.13
get(node_attribute_da<T> ma, Iter it) : 13.16
get(node_member_da<Str,T> ma, Iter it) : 13.15
get_action(long mask)
GeoWin : 17.7
GraphWin : 17.6
get_active_line_width(geo_scene sc)
GeoWin : 17.7
get_active_scene()
GeoWin : 17.7
get_bg_color()
GeoWin : 17.7
get_bg_pixmap()
GeoWin : 17.7
get_bigfloat_error()
real : 7.4
get_bounding_box(double& x0, double& y0, double& x1, double& y1)
GraphWin : 17.6
get_bounding_box(list<node> V, list<edge> E, double& x0, double& y0, double& x1, double& y1)
GraphWin : 17.6
get_button(string s)
window : 17.2
get_button_label(int but)
window : 17.2
get_call_button()
window : 17.2
get_call_item()
window : 17.2
get_call_window()
window : 17.2
get_client_data(int i=0)
window : 17.2
get_color(geo_scene sc)
GeoWin : 17.7
get_cursor()
window : 17.2
get_cyclic_colors(geo_scene sc)
GeoWin : 17.7
get_d3_fcn(geo_scene sc)
GeoWin : 17.7
get_date()
date : 6.19
get_day()
date : 6.19
get_day_in_year()
date : 6.19
get_day_of_week()
date : 6.19
get_directories(string dir) : 6.14
get_directory() : 6.14
get_double_error()
real : 7.4
get_dow_name()
date : 6.19
get_edge()
AdjIt : 13.7
EdgeIt : 13.3
FaceCirc : 13.8
InAdjIt : 13.6
OutAdjIt : 13.5
get_edge_param()
GraphWin : 17.6
get_edges_in_area(double x0, double y0, double x1, double y1)
GraphWin : 17.6
get_edit_edge()
GraphWin : 17.6
get_edit_node()
GraphWin : 17.6
get_edit_slider()
GraphWin : 17.6
get_element_list(list<int>& L)
d_int_set : 8.11
get_entries(string dir) : 6.14
get_environment(string var) : 6.15
get_environment(string var, string& val) : 6.15
get_event(int& val, double& x, double& y)
window : 17.2
get_exponent(void)
bigfloat : 7.3
get_face()
FaceIt : 13.4
get_files(string dir) : 6.14
get_files(string dir, string pattern) : 6.14
get_fill_color(geo_scene sc)
GeoWin : 17.7
get_geowin(geo_scene sc) : 17.7
get_graph()
AdjIt : 13.7
edge_array<E> : 11.8
edge_map<E> : 11.11
EdgeIt : 13.3
face_array<E> : 11.9
face_map<E> : 11.12
FaceCirc : 13.8
FaceIt : 13.4
GraphWin : 17.6
InAdjIt : 13.6
node_array<E> : 11.7
node_map<E> : 11.10
NodeIt : 13.2
OutAdjIt : 13.5
get_graphwin()
window : 17.2
get_grid_dist()
GeoWin : 17.7
window : 17.2
get_grid_mode()
window : 17.2
get_grid_style()
GeoWin : 17.7
window : 17.2
get_height(char* pr)
window : 17.2
get_home_directory() : 6.14
get_hull_dart()
POINT_SET : 15.2
get_hull_edge()
POINT_SET : 15.2
get_in_stack()
GIT_SCC<Out,In,...> : 13.20
get_input_format()
date : 6.19
get_input_format_str()
date : 6.19
get_item(int i)
list<E> : 8.7
get_item(string s)
window : 17.2
get_language()
date : 6.19
get_line_style()
window : 17.2
get_line_style(geo_scene sc)
GeoWin : 17.7
get_line_width()
window : 17.2
get_line_width(geo_scene sc)
GeoWin : 17.7
get_menu(string label)
GraphWin : 17.6
get_message()
GraphWin : 17.6
get_mode()
window : 17.2
get_month()
date : 6.19
get_month_name()
date : 6.19
get_mouse()
window : 17.2
get_mouse(double& x, double& y)
window : 17.2
get_mouse(point& p)
window : 17.2
get_mouse(window*& w, double& x, double& y) : 17.2
get_name(geo_scene sc)
GeoWin : 17.7
get_name(geo_scenegroup gs)
GeoWin : 17.7
get_node()
AdjIt : 13.7
InAdjIt : 13.6
NodeIt : 13.2
OutAdjIt : 13.5
get_node_param()
GraphWin : 17.6
get_node_width()
window : 17.2
get_nodes_in_area(double x0, double y0, double x1, double y1)
GraphWin : 17.6
get_observer()
ObserverNodeIt<Obs,Iter> : 13.11
get_out_stack()
GIT_SCC<Out,In,...> : 13.20
get_output_format()
date : 6.19
get_output_format_str()
date : 6.19
get_param(edge e)
GraphWin : 17.6
get_param(node v)
GraphWin : 17.6
get_pin_point(point& p)
GeoWin : 17.7
get_pixrect(double x1, double y1, double x2, double y2)
window : 17.2
get_point_style(geo_scene sc)
GeoWin : 17.7
get_position(node_array<point>& pos)
GraphWin : 17.6
get_precision()
random_source : 6.8
get_queue()
GIT_BFS<OutAdjI...> : 13.17
GIT_DIJKSTRA<OutAdjI...> : 13.21
GIT_TOPOSORT<OutAdjI...> : 13.19
get_rgb(int& r, int& g, int& b)
color : 17.1
get_scene_with_name(string nm)
GeoWin : 17.7
get_scenegroups()
GeoWin : 17.7
get_scenes()
GeoWin : 17.7
get_scenes(geo_scenegroup gs)
GeoWin : 17.7
get_selected_edges()
GraphWin : 17.6
get_selected_nodes()
GraphWin : 17.6
get_selection_color(geo_scene sc)
GeoWin : 17.7
get_show_grid()
GeoWin : 17.7
get_show_position()
GeoWin : 17.7
get_significant(void)
bigfloat : 7.3
get_significant_length(void)
bigfloat : 7.3
get_stack()
GIT_DFS<OutAdjI...> : 13.18
get_state()
window : 17.2
get_text_color(geo_scene sc)
GeoWin : 17.7
get_text_mode()
window : 17.2
get_visible(geo_scene sc)
GeoWin : 17.7
get_visible_scenes()
GeoWin : 17.7
get_week()
date : 6.19
get_width(char* pr)
window : 17.2
get_window()
GeoWin : 17.7
GraphWin : 17.6
get_window(int but)
window : 17.2
get_window_pixrect()
window : 17.2
get_xmax()
GeoWin : 17.7
GraphWin : 17.6
get_xmin()
GeoWin : 17.7
GraphWin : 17.6
get_year()
date : 6.19
get_ymax()
GeoWin : 17.7
GraphWin : 17.6
get_ymin()
GeoWin : 17.7
GraphWin : 17.6
GIT_BFS<OutAdjI...> : 13.17
GIT_DFS<OutAdjI...> : 13.18
GIT_DIJKSTRA<OutAdjI...> : 13.21
GIT_SCC<Out,In,...> : 13.20
GIT_TOPOSORT<OutAdjI...> : 13.19
gml_graph : 11.25
goback()
gml_graph : 11.25
graph : 11.1
GRAPH<vtype,e...> : 11.2
graph_draw : 12.12
graph_gen : 11.21
graph_misc : 11.22
graph_of(edge e) : 11.1
graph_of(face f) : 11.1
graph_of(node v) : 11.1
GraphWin : 17.6
grid_graph(graph& G, int n) : 11.21
grid_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, int n) : 11.21
guarantee_relative_error(long k)
real : 7.4
h_array<I,E> : 9.7
has_edge()
FaceCirc : 13.8
has_node()
AdjIt : 13.7
InAdjIt : 13.6
OutAdjIt : 13.5
Hash(...) : see User defined parameter types
Hashed Types : see User defined parameter types | see h_array | see map | see map2
Hashing : see User defined parameter types
dynamic and perfect : 18.1.1
with chaining : 18.1.1
hcoord(int i)
d3_rat_point : 16.8
rat_vector : 7.10
vector : 7.6
head()
list<E> : 8.7
node_list : 11.17
slist<E> : 8.8
head(int i)
string : 6.1
height()
window : 17.2
hex_print(ostream& o)
integer : 7.1
hidden_edges()
graph : 11.1
hidden_nodes()
graph : 11.1
hide_edge(edge e)
graph : 11.1
hide_node(node v)
graph : 11.1
hide_node(node v, list<edge>& h_edges)
graph : 11.1
high()
array<E> : 8.1
high1()
array2<E> : 8.2
high2()
array2<E> : 8.2
highword()
integer : 7.1
hilbert(int n, RAT_TYPE x1, RAT_TYPE y1, RAT_TYPE x2, RAT_TYPE y2) : 14.6
homogeneous_linear_solver(integer_matrix M, integer_matrix& spanning_vecs) : 7.9
homogeneous_linear_solver(integer_matrix M, integer_vector& x) : 7.9
identity(int n)
integer_matrix : 7.9
ilog2(bigfloat x) : 7.3
improve_approximation_to(integer q)
real : 7.4
in_current()
GIT_SCC<Out,In,...> : 13.20
in_edges(node v)
graph : 11.1
in_pred(edge e)
graph : 11.1
in_simplex(d3_point p)
d3_simplex : 16.7
in_simplex(d3_rat_point p)
d3_rat_simplex : 16.14
in_succ(edge e)
graph : 11.1
InAdjIt : 13.6
incircle(point a, point b, point c, point d) : 14.1
incircle(rat_point a, rat_point b, rat_point c, rat_point d) : 14.8
indeg(node v)
graph : 11.1
independent_columns(integer_matrix M, array<int>& columns) : 7.9
INDEPENDENT_SET(graph G, list<node>& I) : 12.11
index(d3_point p)
d3_simplex : 16.7
index(d3_rat_point p)
d3_rat_simplex : 16.14
index_type
d_array<I,E> : 9.5
map<I,E> : 9.8
inf(d_vertex v)
tree_collection<I> : 8.15
inf(dic2_item it)
d2_dictionary<K1,K2,I> : 15.1
inf(dic_item it)
dictionary<K,I> : 9.1
inf(edge e)
GRAPH<vtype,e...> : 11.2
PLANAR_MAP<vtype,e...> : 11.6
inf(face f)
PLANAR_MAP<vtype,e...> : 11.6
subdivision<I> : 15.5
inf(is_item it)
interval_set<I> : 15.3
inf(list_item it)
list<E> : 8.7
inf(node v)
GRAPH<vtype,e...> : 11.2
node_pq<P> : 11.19
PLANAR_MAP<vtype,e...> : 11.6
inf(p_dic_item it)
p_dictionary<K,I> : 9.10
inf(partition_item it)
Partition<E> : 8.13
inf(pp_dic_item it)
pp_dictionary<K,I,CMP> : 9.11
inf(pq_item it)
p_queue<P,I> : 10.1
inf(seg_item it)
segment_set<I> : 15.4
inf(seq_item it)
sortseq<K,I> : 9.3
inf(slist_item it)
slist<E> : 8.8
inf_type
dictionary<K,I> : 9.1
p_queue<P,I> : 10.1
sortseq<K,I> : 9.3
init()
edge_map<E> : 11.11
face_map<E> : 11.12
node_map2<E> : 11.14
node_map<E> : 11.10
init(double x0, double x1, double y0)
window : 17.2
init(double x0, double x1, double y0, int d, bool erase=true)
window : 17.2
init(double x1, double x2, double y1, double y2, int r=GEOWIN_MARGIN)
GeoWin : 17.7
init(double xmin, double xmax, double ymin)
GeoWin : 17.7
init(E x)
array<E> : 8.1
init(graph G)
edge_array<E> : 11.8
edge_map<E> : 11.11
face_array<E> : 11.9
face_map<E> : 11.12
node_array<E> : 11.7
node_map2<E> : 11.14
node_map<E> : 11.10
node_matrix<E> : 11.13
init(graph G, E x)
edge_array<E> : 11.8
edge_map<E> : 11.11
face_array<E> : 11.9
face_map<E> : 11.12
node_array<E> : 11.7
node_map2<E> : 11.14
node_map<E> : 11.10
node_matrix<E> : 11.13
init(graph G, int n, E x)
edge_array<E> : 11.8
face_array<E> : 11.9
node_array<E> : 11.7