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


Index

()
list<E> : 9.6
A()
d3_plane : 19.5
d3_rat_plane : 19.12
A0Coder : 12.1
A0sCoder : 12.2
abs(const bigfloat& x) : 8.3
abs(const integer& a) : 8.1
abs(const rational& q) : 8.2
abs(const real& x) : 8.4
abs(const residual& a) : 8.8
absolute(const residual& a)
residual : 8.8
accept()
leda_socket : 6.13
access(const K& k)
dictionary<K,I> : 10.1
acknowledge(string s)
GraphWin : 20.6
window : 20.2
activate(geo_scene sc)
GeoWin : 20.8
AdaptiveHuffmanCoder : 12.7
add(const residual& a, const residual& b)
residual : 8.8
add(double a, double b, double p)
residual : 8.7
add_dependence(geo_scene sc1, geo_scene sc2)
GeoWin : 20.8
add_edge_done_rule(gml_edge_rule f)
gml_graph : 14.26
add_edge_menu(string label, gw_action func)
GraphWin : 20.6
add_edge_rule(gml_edge_rule f, gml_value_type t, char* key=0)
gml_graph : 14.26
add_edge_rule_for_cur_path(gml_edge_rule f, gml_value_type t)
gml_graph : 14.26
add_export_object(geo_scene sc, geowin_export& eo, string name, string desc)
GeoWin : 20.8
add_graph_done_rule(gml_graph_rule f)
gml_graph : 14.26
add_graph_rule(gml_graph_rule f, gml_value_type t, char* key=0)
gml_graph : 14.26
add_graph_rule_for_cur_path(gml_graph_rule f, gml_value_type t)
gml_graph : 14.26
add_help_text(string name)
GeoWin : 20.8
GraphWin : 20.6
add_import_object(geo_scene sc, geowin_import& io, string name, string desc)
GeoWin : 20.8
add_key(const CryptKey& key)
CryptAutoDecoder : 13.6
add_keys_in_file(const char* file_name)
CryptAutoDecoder : 13.6
add_keys_in_stream(streambuf* key_stream)
CryptAutoDecoder : 13.6
add_member_call(void (GraphWin::*func)(), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)
GraphWin : 20.6
add_member_call(void (GraphWin::*func)(), string label, int menu_id=0, char* pmap=0)
GraphWin : 20.6
add_menu(long menu_id)
GraphWin : 20.6
add_menu(string label, int menu_id=0, char* pmap=0)
GraphWin : 20.6
add_new_edge_rule(gml_edge_rule f)
gml_graph : 14.26
add_new_graph_rule(gml_graph_rule f)
gml_graph : 14.26
add_new_node_rule(gml_node_rule f)
gml_graph : 14.26
add_node_done_rule(gml_node_rule f)
gml_graph : 14.26
add_node_menu(string label, gw_action func)
GraphWin : 20.6
add_node_rule(gml_node_rule f, gml_value_type t, char* key=0)
gml_graph : 14.26
add_node_rule_for_cur_path(gml_node_rule f, gml_value_type t)
gml_graph : 14.26
add_scene_buttons(const list<geo_scene>& Ls, const list<string>& Ln)
GeoWin : 20.8
add_scene_buttons(const list<geo_scene>& Ls, int w, int h, unsigned char** bm)
GeoWin : 20.8
add_separator(int menu_id)
GraphWin : 20.6
add_simple_call(void (*func)(GraphWin& ), string label, int menu_id, int bm_w, int bm_h, unsigned char* bm_bits)
GraphWin : 20.6
add_simple_call(void (*func)(GraphWin& ), string label, int menu_id=0, char* pmap=0)
GraphWin : 20.6
add_special_help_text(string name, bool auto_display = false)
GeoWin : 20.8
add_text(const geowin_text& gt)
GeoWin : 20.8
add_text(geo_scene sc, const geowin_text& gt)
GeoWin : 20.8
add_to_day(int d)
date : 6.21
add_to_month(int m)
date : 6.21
add_to_year(int y)
date : 6.21
add_user_layer_circle(const circle& c)
GeoWin : 20.8
add_user_layer_point(const point& p)
GeoWin : 20.8
add_user_layer_rectangle(const rectangle& r)
GeoWin : 20.8
add_user_layer_segment(const segment& s)
GeoWin : 20.8
addcost(d_vertex v, double x)
tree_collection<I> : 9.14
addLetter(char ch)
alphabet : 7.1
address(const_reference r)
leda_allocator<T> : 6.10
address(reference r)
leda_allocator<T> : 6.10
adj_edges(face)
graph : 14.1
adj_edges(node v)
graph : 14.1
adj_face(edge e)
graph : 14.1
adj_faces(node v)
graph : 14.1
adj_nodes(face f)
graph : 14.1
adj_nodes(node v)
graph : 14.1
adj_pred(edge e)
graph : 14.1
adj_pred(edge e, node v)
graph : 14.1
adj_succ(edge e)
graph : 14.1
adj_succ(edge e, node v)
graph : 14.1
AdjIt : 16.7
adjust_coords_to_box(node_array<double>& xpos, node_array<double>& ypos, double x0, double y0, double x1, double y1)
GraphWin : 20.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 : 20.6
adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos)
GraphWin : 20.6
adjust_coords_to_win(node_array<double>& xpos, node_array<double>& ypos, edge_array<list<double> >& xbends, edge_array<list<double> >& ybends)
GraphWin : 20.6
Adler32Coder : 12.16
affine_rank(const array<d3_point>& A) : 19.1
affine_rank(const array<d3_point>& L) : 19.1
affine_rank(const array<d3_rat_point>& A) : 19.8
affine_rank(const array<d3_rat_point>& L) : 19.8
affinely_independent(const array<d3_point>& A) : 19.1
affinely_independent(const array<d3_rat_point>& A) : 19.8
affinely_independent(const array<point>& A) : 17.1
affinely_independent(const array<rat_point>& A) : 17.10
affinely_independent(const array<real_point>& A) : 17.17
affinely_independent(const list<d3_point>& L) : 19.1
affinely_independent(const list<d3_rat_point>& L) : 19.8
alignment : 7.5
all_edges()
graph : 14.1
ALL_EMPTY_CIRCLES(const list<point>& L, list<circle>& CL) : 17.24
ALL_ENCLOSING_CIRCLES(const list<point>& L, list<circle>& CL) : 17.24
all_faces()
graph : 14.1
all_items()
d2_dictionary<K1,K2,I> : 18.1
all_nodes()
graph : 14.1
allocate(size_type n, const_pointer = 0)
leda_allocator<T> : 6.10
alphabet : 7.1
alt_key_down()
window : 20.2
angle()
line : 17.4
segment : 17.2
angle(const line& g)
line : 17.4
angle(const point& q, const point& r)
point : 17.1
angle(const ray& s)
ray : 17.3
angle(const segment& t)
segment : 17.2
angle(const vector& w)
vector : 8.10
animate(geo_scene sc, geowin_animation& anim)
GeoWin : 20.8
append(const char* key)
gml_graph : 14.26
append(const E& x)
b_queue<E> : 9.5
list<E> : 9.6
queue<E> : 9.3
slist<E> : 9.7
append(node v)
node_list : 14.18
append_directory_delimiter(string& dir) : 6.12
apply(void (*f)(E& x))
list<E> : 9.6
approximate(double dist)
r_circle_segment : 17.28
approximate_area()
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
r_circle_segment : 17.28
approximate_by_rat_gen_polygon(double dist)
r_circle_gen_polygon : 17.30
approximate_by_rat_point()
r_circle_point : 17.27
approximate_by_rat_points(double dist)
r_circle_segment : 17.28
approximate_by_rat_polygon(double dist)
r_circle_polygon : 17.29
approximate_by_rat_segments(double dist)
r_circle_segment : 17.28
area()
GEN_POLYGON : 17.7
POLYGON : 17.6
rat_rectangle : 17.16
rat_triangle : 17.15
real_rectangle : 17.23
real_triangle : 17.22
rectangle : 17.9
triangle : 17.8
area(const point& a, const point& b, const point& c) : 17.1
area(const point& q, const point& r)
point : 17.1
area(const rat_point& a, const rat_point& b, const rat_point& c) : 17.10
area(const rat_point& q, const rat_point& r)
rat_point : 17.10
area(const real_point& a, const real_point& b, const real_point& c) : 17.17
area(const real_point& q, const real_point& r)
real_point : 17.17
array2<E> : 9.1
ask_edge()
GraphWin : 20.6
ask_node()
GraphWin : 20.6
assign(edge e, const etype& x)
GRAPH<vtype,e...> : 14.2
PLANAR_MAP<vtype,e...> : 14.7
assign(face f, const ftype& x)
PLANAR_MAP<vtype,e...> : 14.7
assign(list_item it, const E& x)
list<E> : 9.6
assign(node v, const vtype& x)
GRAPH<vtype,e...> : 14.2
PLANAR_MAP<vtype,e...> : 14.7
AutoDecoder : 12.24
B()
d3_plane : 19.5
d3_rat_plane : 19.12
b_node_pq<N> : 14.21
b_priority_queue<I> : 11.2
b_queue<E> : 9.5
b_stack<E> : 9.4
back()
b_queue<E> : 9.5
list<E> : 9.6
basic_graph_alg : 15.1
begin()
STLNodeIt<DataAcc...> : 16.12
berry_ravindran()
string_matching : 7.2
BF_GEN(GRAPH<int,int>& G, int n, int m, bool non_negative = true) : 15.2
BFS(const graph& G, node s, node_array<int>& dist) : 15.1
BFS(const graph& G, node s, node_array<int>& dist, node_array<edge>& pred) : 15.1
BICONNECTED_COMPONENTS(const graph& G, edge_array<int>& compnum) : 15.1
bigfloat : 8.3
binary_entropy(double x) : 8.17.3
BlockCoder<Coder> : 12.25
bool_item(string s, bool& x, const char* hlp=0)
window : 20.2
bool_item(string s, bool& x, const window_handler& obj, const char* hlp=0)
window : 20.2
bool_item(string s, bool& x, void (*F)(int), const char* hlp=0)
window : 20.2
Bounding_Box(const list<point>& L, point& pl, point& pb, point& pr, point& pt) : 17.24
bounding_box(double& xmin, double& ymin, double& xmax, double& ymax)
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
bounding_box(POINT& xmin, POINT& ymin, POINT& xmax, POINT& ymax)
POLYGON : 17.6
bounding_box(real& xmin, real& ymin, real& xmax, real& ymax)
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
boyer_moore()
string_matching : 7.2
brute_force()
string_matching : 7.2
bucket_sort(int (*b)(const E& ))
list<E> : 9.6
bucket_sort(int i, int j, int (*b)(const E& ))
list<E> : 9.6
bucket_sort_edges(const edge_array<int>& A)
graph : 14.1
bucket_sort_edges(int (*ord)(const edge& ))
graph : 14.1
bucket_sort_edges(int l, int h, int (*ord)(const edge& ))
graph : 14.1
bucket_sort_nodes(const node_array<int>& A)
graph : 14.1
bucket_sort_nodes(int (*ord)(const node& ))
graph : 14.1
bucket_sort_nodes(int l, int h, int (*ord)(const node& ))
graph : 14.1
buffer(double d) : 17.29
r_circle_gen_polygon : 17.30
buffer(RAT_TYPE d)
GEN_POLYGON : 17.7
POLYGON : 17.6
button(char* pr1, char* pr2, string s, const window_handler& obj, const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, int n, const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, int n, const window_handler& obj, const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, int n, void (*F)(int), const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, int n, window& M, const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, void (*F)(int), const char* hlp=0)
window : 20.2
button(char* pr1, char* pr2, string s, window& M, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, const window_handler& obj, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, int n, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, int n, const window_handler& obj, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, int n, void (*F)(int), const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, int n, window& M, const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, void (*F)(int), const char* hlp=0)
window : 20.2
button(int w, int h, unsigned char* bm, string s, window& M, const char* hlp=0)
window : 20.2
button(string s)
menu : 20.4
button(string s, const char* hlp=0)
window : 20.2
button(string s, const window_handler& obj)
menu : 20.4
button(string s, const window_handler& obj, const char* hlp=0)
window : 20.2
button(string s, int n)
menu : 20.4
button(string s, int n, const char* hlp=0)
window : 20.2
button(string s, int n, const window_handler& obj)
menu : 20.4
button(string s, int n, const window_handler& obj, const char* hlp=0)
window : 20.2
button(string s, int n, void (*F)(int))
menu : 20.4
button(string s, int n, void (*F)(int), const char* hlp=0)
window : 20.2
button(string s, int n, window& M, const char* hlp=0)
window : 20.2
button(string s, int n, window& W)
menu : 20.4
button(string s, void (*F)(int))
menu : 20.4
button(string s, void (*F)(int), const char* hlp=0)
window : 20.2
button(string s, window& M, const char* hlp=0)
window : 20.2
button(string s, window& W)
menu : 20.4
button_press_time()
window : 20.2
button_release_time()
window : 20.2
buttons_per_line(int n)
window : 20.2
BWTCoder : 12.9
C()
d3_plane : 19.5
d3_rat_plane : 19.12
calculate_length_of_encoded_data(uint32 input_length)
CBCCoder< BlkCipher > : 13.4
OMACCoder< BlkCipher > : 13.5
callback
graph_morphism_algorithm< graph_t > : 15.16
canonical_rep()
GEN_POLYGON : 17.7
cardinality_iso(const graph_t& g1, const graph_t& g2, const node_compat& _node_comp = DEFAULT_NODE_CMP, const edge_compat& _edge_comp = DEFAULT_EDGE_CMP)
graph_morphism_algorithm< graph_t > : 15.16
cardinality_mono(const graph_t& g1, const graph_t& g2, const node_compat& _node_comp = DEFAULT_NODE_CMP, const edge_compat& _edge_comp = DEFAULT_EDGE_CMP)
graph_morphism_algorithm< graph_t > : 15.16
cardinality_sub(const graph_t& g1, const graph_t& g2, const node_compat& _node_comp = DEFAULT_NODE_CMP, const edge_compat& _edge_comp = DEFAULT_EDGE_CMP)
graph_morphism_algorithm< graph_t > : 15.16
cardinality_t
graph_morphism_algorithm< graph_t > : 15.16
catch_system_errors(bool b=true) : 6.11
CBCCoder< BlkCipher > : 13.4
CCITTCoder : 12.15
ceil(const bigfloat& x) : 8.3
ceil(const rational& q) : 8.2
ceil(const real& x) : 8.4
center()
circle : 17.5
d3_rat_sphere : 19.13
d3_sphere : 19.6
r_circle_segment : 17.28
rat_circle : 17.14
rat_rectangle : 17.16
real_circle : 17.21
real_rectangle : 17.23
rectangle : 17.9
center(const d3_point& a, const d3_point& b) : 19.1
center(const point& a, const point& b) : 17.1
center(const real_point& a, const real_point& b) : 17.17
center_pixrect(double x, double y, char* pr)
window : 20.2
CGAL : 16.1.4 | 16.5
change_inf(dic2_item it, const I& i)
d2_dictionary<K1,K2,I> : 18.1
change_inf(dic_item it, const I& i)
dictionary<K,I> : 10.1
change_inf(is_item it, const I& i)
interval_set<I> : 18.3
change_inf(p_dic_item it, const I& i)
p_dictionary<K,I> : 10.6
change_inf(partition_item it, const E& x)
Partition<E> : 9.12
change_inf(pp_dic_item it, const I& i)
pp_dictionary<K,I,CMP> : 10.7
change_inf(pq_item it, const I& i)
p_queue<P,I> : 11.1
change_inf(seg_item it, const I& i)
rat_segment_set<I> : 18.5
segment_set<I> : 18.4
change_inf(seq_item it, const I& i)
sortseq<K,I> : 10.8
check()
checksummer_base : 12.13
OMACCoder< BlkCipher > : 13.5
check(string str)
checksummer_base : 12.13
Check_Euler_Tour(const graph& G, const list<edge>& T) : 15.12
Check_Euler_Tour(const graph& G, const list<two_tuple<edge,int> >& T) : 15.12
CHECK_HULL(const GRAPH<d3_point,int>& H) : 19.15
CHECK_HULL(const GRAPH<d3_rat_point,int>& H) : 19.15
CHECK_KURATOWSKI(const graph& G, const list<edge>& el) : 15.13
CHECK_MAX_CARD_MATCHING(const graph& G, const list<edge>& M, const node_array<int>& OSC) : 15.8
CHECK_MCB(const graph& G, const list<edge>& M, const node_array<bool>& NC) : 15.6
check_representation()
GEN_POLYGON : 17.7
r_circle_gen_polygon : 17.30
check_representation(const list<POLYGON>& PL)
GEN_POLYGON : 17.7
check_representation(const list<r_circle_polygon>& polys, CHECK_TYPE check = WEAKLY_SIMPLE)
r_circle_gen_polygon : 17.30
check_simplicity()
POLYGON : 17.6
r_circle_polygon : 17.29
CheckStableMatching(const graph& G, const list<node>& A, const list<node>& B, const list<edge>& M) : 15.10
checksum_is_valid()
checksummer_base : 12.13
checksummer_base : 12.13
choice_item(string s, int& x, const list<string>& L, const window_handler& obj, const char* hlp=0)
window : 20.2
choice_item(string s, int& x, const list<string>& L, void (*F)(int)=0, const char* hlp=0)
window : 20.2
choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)
window : 20.2
choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, const window_handler& obj, const char* hlp=0)
window : 20.2
choice_item(string s, int& x, int n, int w, int h, unsigned char** bm, void (*F)(int), const char* hlp=0)
window : 20.2
choice_item(string s, int& x, string s1, ..., string sk)
window : 20.2
choice_mult_item(string s, int& x, const list<string>& L, const char* hlp=0)
window : 20.2
choice_mult_item(string s, int& x, const list<string>& L, const window_handler& obj, const char* hlp=0)
window : 20.2
choice_mult_item(string s, int& x, const list<string>& L, void (*F)(int), const char* hlp=0)
window : 20.2
choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, const char* hlp=0)
window : 20.2
choice_mult_item(string s, int& x, int n, int w, int h, unsigned char** bm, const window_handler& obj, const char* hlp=0)
window : 20.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 : 20.2
choose()
d_int_set : 9.10
edge_set : 14.17
node_set : 14.16
set<E> : 9.8
choose_edge()
graph : 14.1
choose_face()
graph : 14.1
choose_node()
graph : 14.1
circle : 17.5
circle()
r_circle_segment : 17.28
circulators : 16.5
circumscribing_sphere()
d3_rat_simplex : 19.14
d3_simplex : 19.7
clear()
b_priority_queue<I> : 11.2
b_queue<E> : 9.5
b_stack<E> : 9.4
CryptByteString : 13.1
d2_dictionary<K1,K2,I> : 18.1
d_array<I,E> : 10.2
d_int_set : 9.10
dictionary<K,I> : 10.1
edge_set : 14.17
graph : 14.1
h_array<I,E> : 10.3
int_set : 9.9
interval_set<I> : 18.3
list<E> : 9.6
map2<I1,I2,E> : 10.5
map<I,E> : 10.4
node_list : 14.18
node_pq<P> : 14.20
node_set : 14.16
p_queue<P,I> : 11.1
POINT_SET : 18.2
pp_dictionary<K,I,CMP> : 10.7
queue<E> : 9.3
rat_segment_set<I> : 18.5
segment_set<I> : 18.4
set<E> : 9.8
slist<E> : 9.7
sortseq<K,I> : 10.8
stack<E> : 9.2
window : 20.2
clear(color c)
window : 20.2
clear(const E& x)
h_array<I,E> : 10.3
map<I,E> : 10.4
clear(double x0, double y0, double x1, double y1)
window : 20.2
clear(double xorig, double yorig)
window : 20.2
clear_actions()
GeoWin : 20.8
GraphWin : 20.6
clear_graph()
GraphWin : 20.6
clear_keys()
CryptAutoDecoder : 13.6
clip(const line& l, segment& inter)
rectangle : 17.9
clip(const rat_line& l, rat_segment& inter)
rat_rectangle : 17.16
clip(const rat_ray& ry, rat_segment& inter)
rat_rectangle : 17.16
clip(const rat_segment& t, rat_segment& inter)
rat_rectangle : 17.16
clip(const ray& ry, segment& inter)
rectangle : 17.9
clip(const real_line& l, real_segment& inter)
real_rectangle : 17.23
clip(const real_ray& ry, real_segment& inter)
real_rectangle : 17.23
clip(const real_segment& t, real_segment& inter)
real_rectangle : 17.23
clip(const segment& t, segment& inter)
rectangle : 17.9
clip(point p, point q, segment& s)
line : 17.4
clip(rat_point p, rat_point q, rat_segment& s)
rat_line : 17.13
clip(real_point p, real_point q, real_segment& s)
real_line : 17.20
close()
decoding_ifstream<Coder> : 12.22
decoding_istream<Coder> : 12.20
encoding_ofstream<Coder> : 12.21
encoding_ostream<Coder> : 12.19
GeoWin : 20.8
GraphWin : 20.6
window : 20.2
CLOSEST_PAIR(list<point>& L, point& r1, point& r2) : 17.24
cmdline_graph(graph& G, int argc, char** argv) : 14.22
cmp_dist(const point& q, const point& r)
point : 17.1
cmp_dist(const rat_point& q, const rat_point& r)
rat_point : 17.10
cmp_dist(const real_point& q, const real_point& r)
real_point : 17.17
cmp_distances(const d3_point& p1, const d3_point& p2)
d3_plane : 19.5
cmp_distances(const d3_point& p1, const d3_point& p2, const d3_point& p3, const d3_point& p4) : 19.1
cmp_distances(const d3_rat_point& p1, const d3_rat_point& p2, const d3_rat_point& p3, const d3_rat_point& p4) : 19.8
cmp_distances(const point& p1, const point& p2, const point& p3, const point& p4) : 17.1
cmp_distances(const rat_point& p1, const rat_point& p2, const rat_point& p3, const rat_point& p4) : 17.10
cmp_distances(const real_point& p1, const real_point& p2, const real_point& p3, const real_point& p4) : 17.17
cmp_segments_at_xcoord(const rat_segment& s1, const rat_segment& s2, const rat_point& p) : 17.11
cmp_segments_at_xcoord(const real_segment& s1, const real_segment& s2, const real_point& p) : 17.18
cmp_segments_at_xcoord(const segment& s1, const segment& s2, const point& p) : 17.2
cmp_signed_dist(const point& a, const point& b, const point& c, const point& d) : 17.1
cmp_signed_dist(const rat_point& a, const rat_point& b, const rat_point& c, const rat_point& d) : 17.10
cmp_signed_dist(const real_point& a, const real_point& b, const real_point& c, const real_point& d) : 17.17
cmp_slope(const rat_segment& s1)
rat_segment : 17.11
cmp_slopes(const line& l1, const line& l2) : 17.4
cmp_slopes(const rat_line& l1, const rat_line& l2) : 17.13
cmp_slopes(const rat_ray& r1, const rat_ray& r2) : 17.12
cmp_slopes(const rat_segment& s1, const rat_segment& s2) : 17.11
cmp_slopes(const ray& r1, const ray& r2) : 17.3
cmp_slopes(const real_line& l1, const real_line& l2) : 17.20
cmp_slopes(const real_ray& r1, const real_ray& r2) : 17.19
cmp_slopes(const real_segment& s1, const real_segment& s2) : 17.18
cmp_slopes(const segment& s1, const segment& s2) : 17.2
cocircular(const point& a, const point& b, const point& c, const point& d) : 17.1
cocircular(const rat_point& a, const rat_point& b, const rat_point& c, const rat_point& d) : 17.10
cocircular(const real_point& a, const real_point& b, const real_point& c, const real_point& d) : 17.17
coder1
CoderPipe2<Coder1,...> : 12.23
coder2
CoderPipe2<Coder1,...> : 12.23
CoderPipe2<Coder1,...> : 12.23
col(int i)
integer_matrix : 8.13
matrix : 8.11
real_matrix : 8.16
collinear(const d3_point& a, const d3_point& b, const d3_point& c) : 19.1
collinear(const d3_rat_point& a, const d3_rat_point& b, const d3_rat_point& c) : 19.8
collinear(const point& a, const point& b, const point& c) : 17.1
collinear(const rat_point& a, const rat_point& b, const rat_point& c) : 17.10
collinear(const real_point& a, const real_point& b, const real_point& c) : 17.17
color : 20.1
color_item(string s, color& x, const char* hlp=0)
window : 20.2
color_item(string s, color& x, const window_handler& obj, const char* hlp=0)
window : 20.2
color_item(string s, color& x, void (*F)(int), const char* hlp=0)
window : 20.2
compare(...) : see User defined parameter types
compare(const real& y)
real : 8.4
compare_all(const growing_array<real>& R, int& j) : 8.4
compare_by_angle(const point& a, const point& b, const point& c, const point& d) : 17.1
compare_by_angle(const rat_point& a, const rat_point& b, const rat_point& c, const rat_point& d) : 17.10
compare_by_angle(const rat_vector& v1, const rat_vector& v2) : 8.14
compare_by_angle(const real_point& a, const real_point& b, const real_point& c, const real_point& d) : 17.17
compare_by_angle(const real_vector& v1, const real_vector& v2) : 8.15
compare_by_angle(const vector& v1, const vector& v2) : 8.10
compare_tangent_slopes(const r_circle_segment& cs1, const r_circle_segment& cs2, const r_circle_point& p) : 17.28
complement()
GEN_POLYGON : 17.7
int_set : 9.9
POLYGON : 17.6
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
complete_bigraph(graph& G, int a, int b, list<node>& A, list<node>& B) : 14.22
complete_graph(graph& G, int n) : 14.22
complete_ugraph(graph& G, int n) : 14.22
compnumb()
GIT_SCC<Out,In,...> : 16.20
COMPONENTS(const graph& G, node_array<int>& compnum) : 15.1
CompPred<Iter,DA...> : 16.10
compute_bounding_box(real& xmin, real& ymin, real& xmax, real& ymax)
r_circle_segment : 17.28
compute_faces()
graph : 14.1
compute_MAC(string str)
OMACCoder< BlkCipher > : 13.5
COMPUTE_SHORTEST_PATH(const graph& G, node s, node t, const node_array<edge>& pred) : 15.2
compute_voronoi(GRAPH<CIRCLE,POINT>& V)
POINT_SET : 18.2
compute_with_precision(long k)
real : 8.4
conc(list<E>& L1, int dir = leda::behind)
list<E> : 9.6
conc(slist<E>& L)
slist<E> : 9.7
conc(sortseq<K,I,seq_impl>& S1, int dir = leda::behind)
sortseq<K,I> : 10.8
confirm(string s)
window : 20.2
connect(int sec = 10)
leda_socket : 6.13
constant_da<T> : 16.14
construct(pointer p, const_reference r)
leda_allocator<T> : 6.10
contained_in_affine_hull(const array<d3_point>& A, const d3_point& x) : 19.1
contained_in_affine_hull(const array<d3_rat_point>& A, const d3_rat_point& x) : 19.8
contained_in_affine_hull(const array<point>& A, const point& p) : 17.1
contained_in_affine_hull(const array<rat_point>& A, const rat_point& p) : 17.10
contained_in_affine_hull(const array<real_point>& A, const real_point& p) : 17.17
contained_in_affine_hull(const list<d3_point>& L, const d3_point& x) : 19.1
contained_in_affine_hull(const list<d3_rat_point>& L, const d3_rat_point& x) : 19.8
contained_in_linear_hull(const array<rat_vector>& A, const rat_vector& x) : 8.14
contained_in_simplex(const array<d3_point>& A, const d3_point& x) : 19.1
contained_in_simplex(const array<d3_rat_point>& A, const d3_rat_point& x) : 19.8
contained_in_simplex(const array<point>& A, const point& p) : 17.1
contained_in_simplex(const array<rat_point>& A, const rat_point& p) : 17.10
contained_in_simplex(const array<real_point>& A, const real_point& p) : 17.17
contained_in_simplex(const d3_point& a, const d3_point& b, const d3_point& c, const d3_point& d, const d3_point& x) : 19.1
contained_in_simplex(const d3_rat_point& a, const d3_rat_point& b, const d3_rat_point& c, const d3_rat_point& d, const d3_rat_point& x) : 19.8
contains(const d3_point& p)
d3_line : 19.4
d3_ray : 19.2
d3_segment : 19.3
d3_sphere : 19.6
contains(const d3_point& q)
d3_plane : 19.5
contains(const d3_rat_point& p)
d3_rat_line : 19.10
d3_rat_ray : 19.9
d3_rat_segment : 19.11
d3_rat_sphere : 19.13
contains(const d3_rat_point& q)
d3_rat_plane : 19.12
contains(const d3_rat_segment& s)
d3_rat_ray : 19.9
contains(const d3_segment& s)
d3_ray : 19.2
contains(const point& )
ray : 17.3
contains(const point& p)
circle : 17.5
GEN_POLYGON : 17.7
line : 17.4
POLYGON : 17.6
rectangle : 17.9
segment : 17.2
triangle : 17.8
window : 20.2
contains(const r_circle_point& p)
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
r_circle_segment : 17.28
contains(const rat_point& p)
rat_circle : 17.14
rat_line : 17.13
rat_ray : 17.12
rat_rectangle : 17.16
rat_segment : 17.11
rat_triangle : 17.15
contains(const rat_segment& s)
rat_ray : 17.12
contains(const real_point& )
real_ray : 17.19
contains(const real_point& p)
real_circle : 17.21
real_line : 17.20
real_rectangle : 17.23
real_segment : 17.18
real_triangle : 17.22
contains(const real_segment& )
real_ray : 17.19
contains(const segment& )
ray : 17.3
contains(const string& s1)
string : 6.1
contains(double x)
interval : 8.5
contents(int i)
integer : 8.1
contents(item it)
slist<E> : 9.7
contents(list_item it)
list<E> : 9.6
contour()
r_circle_gen_polygon : 17.30
CONVEX_COMPONENTS(const gen_polygon& GP) : 17.24
CONVEX_COMPONENTS(const gen_polygon& GP, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary_edges, list<edge>& hole_edges) : 17.24
CONVEX_COMPONENTS(const polygon& P, GRAPH<point,segment>& G, list<edge>& inner_edges, list<edge>& boundary) : 17.24
CONVEX_HULL(const list<d3_point>& L, GRAPH<d3_point,int>& H) : 19.15
CONVEX_HULL(const list<d3_rat_point>& L, GRAPH<d3_rat_point,int>& H) : 19.15
CONVEX_HULL(const list<point>& L) : 17.24
CONVEX_HULL_IC(const list<point>& L) : 17.24
CONVEX_HULL_POLY(const list<point>& L) : 17.24
CONVEX_HULL_RIC(const list<point>& L) : 17.24
CONVEX_HULL_S(const list<point>& L) : 17.24
coord(int i)
rat_vector : 8.14
real_vector : 8.15
vector : 8.10
coord_type
circle : 17.5
d3_rat_simplex : 19.14
d3_simplex : 19.7
GEN_POLYGON : 17.7
line : 17.4
point : 17.1
POLYGON : 17.6
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
rat_circle : 17.14
rat_line : 17.13
rat_point : 17.10
rat_ray : 17.12
rat_segment : 17.11
rat_triangle : 17.15
ray : 17.3
real_circle : 17.21
real_line : 17.20
real_point : 17.17
real_ray : 17.19
real_segment : 17.18
real_triangle : 17.22
segment : 17.2
triangle : 17.8
coplanar(const d3_point& a, const d3_point& b, const d3_point& c, const d3_point& d) : 19.1
coplanar(const d3_rat_point& a, const d3_rat_point& b, const d3_rat_point& c, const d3_rat_point& d) : 19.8
copy_rect(double x0, double y0, double x1, double y1, double x, double y)
window : 20.2
CopyGraph(GRAPH<node,edge>& H, const graph& G) : 14.23
CopyGraph(GRAPH<node,edge>& H, const graph& G, const list<edge>& E) : 14.23
CopyGraph(GRAPH<node,edge>& H, const graph& G, const list<node>& V, const list<edge>& E) : 14.23
CopyGraph(graph& H, const graph& G) : 14.23
cost(vertex v)
dynamic_trees : 9.13
counter : 6.17
CRC32Coder : 12.14
create_bitmap(int w, int h, unsigned char* bm_data)
window : 20.2
create_directory(string fname) : 6.12
create_pixrect(const char** xpm_str)
window : 20.2
create_pixrect(int w, int h, unsigned char* bm_data, int fg=window::fgcol, int bg=window::bgcol)
window : 20.2
create_pixrect(string xpm_file)
window : 20.2
CreateInputGraph(graph& G, list<node>& A, list<node>& B, node_map<int>& nodes_a, node_map<int>& nodes_b, const list<int>& InputA, const list<int>& InputB, const map<int, list<int> >& preferencesA, const map<int, list<int> >& preferencesB) : 15.10
cross_product(const rat_vector& v1, const rat_vector& v2) : 8.14
cross_product(const real_vector& v1, const real_vector& v2) : 8.15
cross_product(const vector& v1, const vector& v2) : 8.10
CRUST(const list<point>& L0, GRAPH<point,int>& G) : 17.24
CryptAutoDecoder : 13.6
CryptByteString : 13.1
CryptKey : 13.2
cs_code(const point& p)
rectangle : 17.9
cs_code(const rat_point& p)
rat_rectangle : 17.16
cs_code(const real_point& p)
real_rectangle : 17.23
ctrl_key_down()
window : 20.2
curr_adj()
AdjIt : 16.7
GIT_DIJKSTRA<OutAdjI...> : 16.21
InAdjIt : 16.6
OutAdjIt : 16.5
current()
GIT_BFS<OutAdjI...> : 16.17
GIT_DFS<OutAdjI...> : 16.18
GIT_DIJKSTRA<OutAdjI...> : 16.21
GIT_TOPOSORT<OutAdjI...> : 16.19
current_node()
dynamic_markov_chain : 14.25
GIT_SCC<Out,In,...> : 16.20
markov_chain : 14.24
current_outdeg()
dynamic_markov_chain : 14.25
markov_chain : 14.24
cut(d_vertex v)
tree_collection<I> : 9.14
cut(vertex v)
dynamic_trees : 9.13
CUT_VALUE(const graph& G, const edge_array<int>& weight, const list<node>& C) : 15.5
cycle_found()
GIT_TOPOSORT<OutAdjI...> : 16.19
cyclic_adj_pred(edge e)
graph : 14.1
cyclic_adj_pred(edge e, node v)
graph : 14.1
cyclic_adj_succ(edge e)
graph : 14.1
cyclic_adj_succ(edge e, node v)
graph : 14.1
cyclic_in_pred(edge e)
graph : 14.1
cyclic_in_succ(edge e)
graph : 14.1
cyclic_pred(list_item it)
list<E> : 9.6
cyclic_pred(node v)
node_list : 14.18
cyclic_succ(item l)
slist<E> : 9.7
cyclic_succ(list_item it)
list<E> : 9.6
cyclic_succ(node v)
node_list : 14.18
D()
d3_plane : 19.5
d3_rat_plane : 19.12
d2(integer a, integer b, integer D)
rat_vector : 8.14
d2_dictionary<K1,K2,I> : 18.1
d3(integer a, integer b, integer c, integer D)
rat_vector : 8.14
d3_delaunay : 19.16
D3_DELAUNAY(const list<d3_rat_point>& L, GRAPH<d3_rat_point,int>& G) : 19.16
d3_grid_graph(graph& G, int n) : 14.22
d3_grid_graph(graph& G, node_array<double>& xcoord, node_array<double>& ycoord, node_array<double>& zcoord, int n) : 14.22
d3_hull : 19.15
d3_line : 19.4
d3_plane : 19.5
d3_point : 19.1
d3_rat_line : 19.10
d3_rat_plane : 19.12
d3_rat_point : 19.8
d3_rat_ray : 19.9
d3_rat_segment : 19.11
d3_rat_simplex : 19.14
d3_rat_sphere : 19.13
d3_ray : 19.2
d3_segment : 19.3
d3_simplex : 19.7
d3_sphere : 19.6
D3_SPRING_EMBEDDING(const graph& G, node_array<double>& xpos, node_array<double>& ypos, node_array<double>& zpos, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax, int iterations=250) : 15.14
D3_TRIANG(const list<d3_rat_point>& L, GRAPH<d3_rat_point,int>& G) : 19.16
D3_VORONOI(const list<d3_rat_point>& L0, GRAPH<d3_rat_sphere,int>& G) : 19.16
d3_window : 20.9
d_array<I,E> : 10.2
d_face_cycle_pred(edge e)
POINT_SET : 18.2
d_face_cycle_succ(edge e)
POINT_SET : 18.2
d_int_set : 9.10
damerau_levenshtein()
distance : 7.4
data accessor : 16.1.5
date : 6.21
days_until(const date& D2)
date : 6.21
deallocate(pointer p, size_type n)
leda_allocator<T> : 6.10
decode()
A0Coder : 12.1
A0sCoder : 12.2
AdaptiveHuffmanCoder : 12.7
AutoDecoder : 12.24
BlockCoder<Coder> : 12.25
BWTCoder : 12.9
CBCCoder< BlkCipher > : 13.4
checksummer_base : 12.13
CoderPipe2<Coder1,...> : 12.23
CryptAutoDecoder : 13.6
DeflateCoder : 12.4
DictCoder : 12.5
HuffmanCoder : 12.6
MTF2Coder : 12.11
MTFCoder : 12.10
OMACCoder< BlkCipher > : 13.5
PPMIICoder : 12.3
RLE0Coder : 12.12
RLECoder : 12.8
decode_memory_chunk(const char* in_buf, uint32 in_len, char* out_buf, uint32 out_len)
A0Coder : 12.1
A0sCoder : 12.2
AdaptiveHuffmanCoder : 12.7
AutoDecoder : 12.24
BlockCoder<Coder> : 12.25
BWTCoder : 12.9
CBCCoder< BlkCipher > : 13.4
checksummer_base : 12.13
CoderPipe2<Coder1,...> : 12.23
CryptAutoDecoder : 13.6
DeflateCoder : 12.4
DictCoder : 12.5
HuffmanCoder : 12.6
MTF2Coder : 12.11
MTFCoder : 12.10
OMACCoder< BlkCipher > : 13.5
PPMIICoder : 12.3
RLE0Coder : 12.12
RLECoder : 12.8
decoding_ifstream<Coder> : 12.22
decoding_istream<Coder> : 12.20
decrease_key(b_pq_item it, int newkey)
b_priority_queue<I> : 11.2
decrease_p(node v, const P& x)
node_pq<P> : 14.20
decrease_p(pq_item it, const P& x)
p_queue<P,I> : 11.1
define_area(double& x0, double& y0, double& x1, double& y1, const char* msg=")
GraphWin : 20.6
defined(const I1& i, const I2& j)
map2<I1,I2,E> : 10.5
defined(const I& i)
d_array<I,E> : 10.2
h_array<I,E> : 10.3
map<I,E> : 10.4
defined(const K& k)
dictionary<K,I> : 10.1
defined(node v, node w)
node_map2<E> : 14.15
DeflateCoder : 12.4
degree(node v)
graph : 14.1
del()
AdjIt : 16.7
EdgeIt : 16.3
InAdjIt : 16.6
NodeIt : 16.2
OutAdjIt : 16.5
del(const E& x)
set<E> : 9.8
del(const K1& x, const K2& y)
d2_dictionary<K1,K2,I> : 18.1
del(const K& k)
dictionary<K,I> : 10.1
p_dictionary<K,I> : 10.6
pp_dictionary<K,I,CMP> : 10.7
sortseq<K,I> : 10.8
del(const rat_segment& s)
rat_segment_set<I> : 18.5
del(const segment& s)
segment_set<I> : 18.4
del(const string& s1, int i=1)
string : 6.1
del(double x, double y)
interval_set<I> : 18.3
del(edge x)
edge_set : 14.17
del(geo_scenegroup gs, geo_scene sc)
GeoWin : 20.8
del(int i)
string : 6.1
del(int i, int j)
string : 6.1
del(int x)
d_int_set : 9.10
int_set : 9.9
del(list_item it)
list<E> : 9.6
del(node v)
node_list : 14.18
node_pq<P> : 14.20
POINT_SET : 18.2
del(node w, int=0)
b_node_pq<N> : 14.21
del(node x)
node_set : 14.16
del(POINT p)
POINT_SET : 18.2
del_all(const string& s1)
string : 6.1
del_all_edges()
graph : 14.1
del_all_faces()
graph : 14.1
del_all_nodes()
graph : 14.1
del_bitmap(char* bm)
window : 20.2
del_dependence(geo_scene sc1, geo_scene sc2)
GeoWin : 20.8
del_edge(edge e)
graph : 14.1
GraphWin : 20.6
planar_map : 14.6
del_edges(const list<edge>& L)
graph : 14.1
del_item(b_pq_item x)
b_priority_queue<I> : 11.2
del_item(dic2_item it)
d2_dictionary<K1,K2,I> : 18.1
del_item(dic_item it)
dictionary<K,I> : 10.1
del_item(is_item it)
interval_set<I> : 18.3
del_item(list_item it)
list<E> : 9.6
del_item(p_dic_item it)
p_dictionary<K,I> : 10.6
del_item(pp_dic_item it)
pp_dictionary<K,I,CMP> : 10.7
del_item(pq_item it)
p_queue<P,I> : 11.1
del_item(seg_item it)
rat_segment_set<I> : 18.5
segment_set<I> : 18.4
del_item(seq_item it)
sortseq<K,I> : 10.8
del_menu(long menu_id)
GraphWin : 20.6
del_message()
GraphWin : 20.6
window : 20.2
del_min()
b_node_pq<N> : 14.21
b_priority_queue<I> : 11.2
node_pq<P> : 14.20
p_queue<P,I> : 11.1
del_min(P& x)
node_pq<P> : 14.20
del_node(node v)
graph : 14.1
GraphWin : 20.6
del_nodes(const list<node>& L)
graph : 14.1
del_pin_point()
GeoWin : 20.8
del_pixrect(char* pr)
window : 20.2
del_succ_item(item it)
slist<E> : 9.7
del_tooltip(int i)
window : 20.2
DELAUNAY_DIAGRAM(const list<point>& L, GRAPH<point,int>& DD) : 17.24
DELAUNAY_TRIANG(const list<point>& L, GRAPH<point,int>& DT) : 17.24
DELAUNAY_TRIANG(const list<segment>& L, GRAPH<point,segment>& G) : 17.24
DELAUNAY_TRIANG(GRAPH<point,segment>& G) : 17.24
delete_file(string fname) : 6.12
Delete_Loops(graph& G) : 14.23
delete_prepared_graph(prep_graph pg)
graph_morphism_algorithm< graph_t > : 15.16
delete_subsequence(seq_item a, seq_item b, sortseq<K,I,seq_impl>& S1)
sortseq<K,I> : 10.8
delLetter(char ch)
alphabet : 7.1
denominator()
rational : 8.2
deselect(edge e)
GraphWin : 20.6
deselect(node v)
GraphWin : 20.6
deselect_all()
GraphWin : 20.6
deselect_all_edges()
GraphWin : 20.6
deselect_all_nodes()
GraphWin : 20.6
design pattern : 16.1.1
destroy(pointer p)
leda_allocator<T> : 6.10
det()
matrix : 8.11
real_matrix : 8.16
det2x2(const residual& a, const residual& b, const residual& c, const residual& d) : 8.8
residual : 8.8
determinant(const integer_matrix& M) : 8.13
determinant(const integer_matrix& M, integer_matrix& L, integer_matrix& U, array<int>& q, integer_vector& c) : 8.13
DFS(const graph& G, node s, node_array<bool>& reached) : 15.1
DFS_NUM(const graph& G, node_array<int>& dfsnum, node_array<int>& compnum) : 15.1
diamond(int j, const int_Polynomial& iP, algorithm_type algorithm = isolating_algorithm, bool is_squarefree = true) : 8.4
diamond(int j, const Polynomial& P, algorithm_type algorithm, bool is_squarefree) : 8.4
diamond(rational l, rational u, const int_Polynomial& iP, algorithm_type algorithm = isolating_algorithm, bool is_squarefree = true) : 8.4
diamond(rational l, rational u, const Polynomial& P, algorithm_type algorithm, bool is_squarefree) : 8.4
diamond_short(rational l, rational u, const Polynomial& P, algorithm_type algorithm, bool is_squarefree) : 8.4
DictCoder : 12.5
dictionary<K,I> : 10.1
diff(const d_int_set& T)
d_int_set : 9.10
diff(const GEN_POLYGON& Q)
GEN_POLYGON : 17.7
diff(const int_set& T)
int_set : 9.9
diff(const r_circle_gen_polygon& Q)
r_circle_gen_polygon : 17.30
diff(const set<E,set_impl>& T)
set<E> : 9.8
diff_approximate(const r_circle_gen_polygon& Q, double dist = 1e-2)
r_circle_gen_polygon : 17.30
difference(const rat_rectangle& q, list<rat_rectangle>& L)
rat_rectangle : 17.16
difference(const real_rectangle& q, list<real_rectangle>& L)
real_rectangle : 17.23
difference(const rectangle& q, list<rectangle>& L)
rectangle : 17.9
dim()
integer_vector : 8.12
POINT_SET : 18.2
rat_vector : 8.14
real_vector : 8.15
vector : 8.10
dim1()
integer_matrix : 8.13
matrix : 8.11
real_matrix : 8.16
dim2()
integer_matrix : 8.13
matrix : 8.11
real_matrix : 8.16
direction()
line : 17.4
ray : 17.3
segment : 17.2
disable_button(int b)
window : 20.2
disable_call(int id)
GraphWin : 20.6
disable_calls()
GraphWin : 20.6
disable_item(panel_item it)
window : 20.2
disable_menus()
GeoWin : 20.8
disable_panel(bool disable_every_item=true)
window : 20.2
disconnect()
leda_socket : 6.13
display()
GraphWin : 20.6
window : 20.2
display(int x = window::center, int y = window::center)
GeoWin : 20.8
display(int x, int y)
GraphWin : 20.6
window : 20.2
display(window& W0, int x, int y)
window : 20.2
display_help_text(string fname)
GraphWin : 20.6
window : 20.2
dist(const real& x, const real& y) : 8.4
dist(const real_point& p)
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
r_circle_segment : 17.28
distance : 7.4
distance()
point : 17.1
real_point : 17.17
real_segment : 17.18
segment : 17.2
distance(const circle& D)
circle : 17.5
distance(const d3_point& p)
d3_line : 19.4
distance(const d3_point& q)
d3_plane : 19.5
d3_point : 19.1
distance(const line& l)
circle : 17.5
distance(const point& p)
circle : 17.5
GEN_POLYGON : 17.7
POLYGON : 17.6
segment : 17.2
distance(const point& q)
line : 17.4
point : 17.1
distance(const real_circle& D)
real_circle : 17.21
distance(const real_line& l)
real_circle : 17.21
distance(const real_point& p)
real_circle : 17.21
real_segment : 17.18
distance(const real_point& q)
real_line : 17.20
real_point : 17.17
div(const residual& a, const residual& b)
residual : 8.8
div(double a, double b, double p)
residual : 8.7
do_intersect(const rat_rectangle& b)
rat_rectangle : 17.16
do_intersect(const real_rectangle& b)
real_rectangle : 17.23
do_intersect(const rectangle& b)
rectangle : 17.9
DocTools : 24
double_item(string s, double& x, const char* hlp=0)
window : 20.2
double_quotient(const integer& a, const integer& b) : 8.1
draw()
d3_window : 20.9
draw_arc(const point& p, const point& q, const point& r, color c=window::fgcol)
window : 20.2
draw_arc_arrow(const point& p, const point& q, const point& r, color c=window::fgcol)
window : 20.2
draw_arrow(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_arrow(const segment& s, color=window::fgcol)
window : 20.2
draw_arrow(double x1, double y1, double x2, double y2, color c =window::fgcol)
window : 20.2
draw_arrow_head(const point& p, double dir, color c=window::fgcol)
window : 20.2
draw_bezier(const list<point>& C, int n, color c=window::fgcol)
window : 20.2
draw_bezier_arrow(const list<point>& C, int n, color c=window::fgcol)
window : 20.2
draw_box(const rectangle& R, color c=window::fgcol)
window : 20.2
draw_box(double x0, double y0, double x1, double y1, color c=window::fgcol)
window : 20.2
draw_box(point p, point q, color c=window::fgcol)
window : 20.2
draw_circle(const circle& C, color c=window::fgcol)
window : 20.2
draw_circle(const point& p, double r, color c=window::fgcol)
window : 20.2
draw_circle(double x, double y, double r, color c=window::fgcol)
window : 20.2
draw_closed_spline(const list<point>& L, int n, color c=window::fgcol)
window : 20.2
draw_ctext(const point& p, string s, color c=window::fgcol)
window : 20.2
draw_ctext(double x, double y, string s, color c=window::fgcol)
window : 20.2
draw_ctext(string s, color c=window::fgcol)
window : 20.2
draw_disc(const circle& C, color c=window::fgcol)
window : 20.2
draw_disc(const point& p, double r, color c=window::fgcol)
window : 20.2
draw_disc(double x, double y, double r, color c=window::fgcol)
window : 20.2
draw_edge(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_edge(const segment& s, color c=window::fgcol)
window : 20.2
draw_edge(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 20.2
draw_edge(edge e, void (*draw_diagram_edge)(const POINT& , const POINT& ), void (*draw_triang_edge) (const POINT& , const POINT& ), void (*draw_hull_dart) (const POINT& , const POINT& ))
POINT_SET : 18.2
draw_edge_arrow(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_edge_arrow(const segment& s, color c=window::fgcol)
window : 20.2
draw_edge_arrow(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 20.2
draw_edges(const list<edge>& L, void (*draw_edge)(const POINT& , const POINT& ))
POINT_SET : 18.2
draw_edges(void (*draw_diagram_edge)(const POINT& , const POINT& ), void (*draw_triang_edge) (const POINT& , const POINT& ), void (*draw_hull_dart) (const POINT& , const POINT& ))
POINT_SET : 18.2
draw_ellipse(const point& p, double r1, double r2, color c=window::fgcol)
window : 20.2
draw_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)
window : 20.2
draw_filled_circle(const circle& C, color c=window::fgcol)
window : 20.2
draw_filled_circle(const point& p, double r, color c=window::fgcol)
window : 20.2
draw_filled_circle(double x, double y, double r, color c=window::fgcol)
window : 20.2
draw_filled_ellipse(const point& p, double r1, double r2, color c=window::fgcol)
window : 20.2
draw_filled_ellipse(double x, double y, double r1, double r2, color c=window::fgcol)
window : 20.2
draw_filled_node(const point& p, color c=window::bgcol)
window : 20.2
draw_filled_node(double x0, double y0, color c=window::bgcol)
window : 20.2
draw_filled_polygon(const gen_polygon& P, color c=window::fgcol)
window : 20.2
draw_filled_polygon(const list<point>& lp, color c=window::fgcol)
window : 20.2
draw_filled_polygon(const polygon& P, color c=window::fgcol)
window : 20.2
draw_filled_rectangle(const rectangle& R, color=window::fgcol)
window : 20.2
draw_filled_rectangle(point p, point q, color=window::fgcol)
window : 20.2
draw_filled_triangle(const triangle& T, color=window::fgcol)
window : 20.2
draw_filled_triangle(point a, point b, point c, color=window::fgcol)
window : 20.2
draw_hline(double y, color c=window::fgcol)
window : 20.2
draw_hull(void (*draw_poly)(const list<POINT>& ))
POINT_SET : 18.2
draw_int_node(const point& p, int i, color c=window::bgcol)
window : 20.2
draw_int_node(double x, double y, int i, color c=window::bgcol)
window : 20.2
draw_line(const line& l, color c=window::fgcol)
window : 20.2
draw_line(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_line(const segment& s, color c=window::fgcol)
window : 20.2
draw_line(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 20.2
draw_node(const point& p, color c=window::fgcol)
window : 20.2
draw_node(double x0, double y0, color c=window::fgcol)
window : 20.2
draw_nodes(void (*draw_node)(const POINT& ))
POINT_SET : 18.2
draw_oriented_polygon(const gen_polygon& P, color c=window::fgcol)
window : 20.2
draw_oriented_polygon(const list<point>& lp, color c=window::fgcol)
window : 20.2
draw_oriented_polygon(const polygon& P, color c=window::fgcol)
window : 20.2
draw_pixel(const point& p, color c=window::fgcol)
window : 20.2
draw_pixel(double x, double y, color c=window::fgcol)
window : 20.2
draw_pixels(const list<point>& L, color c=window::fgcol)
window : 20.2
draw_pixels(int n, double* xcoord, double* ycoord, color c=window::fgcol)
window : 20.2
draw_point(const point& p, color c=window::fgcol)
window : 20.2
draw_point(double x, double y, color c=window::fgcol)
window : 20.2
draw_polygon(const gen_polygon& P, color c=window::fgcol)
window : 20.2
draw_polygon(const list<point>& lp, color c=window::fgcol)
window : 20.2
draw_polygon(const polygon& P, color c=window::fgcol)
window : 20.2
draw_polyline(const list<point>& lp, color c=window::fgcol)
window : 20.2
draw_polyline(int n, double* xc, double* yc, color c=window::fgcol)
window : 20.2
draw_polyline_arrow(const list<point>& lp, color c=window::fgcol)
window : 20.2
draw_ray(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_ray(const ray& r, color c=window::fgcol)
window : 20.2
draw_ray(const segment& s, color c=window::fgcol)
window : 20.2
draw_ray(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 20.2
draw_ray(point p, point q, line l, color c = window::fgcol)
window : 20.2
draw_rectangle(const rectangle& R, color=window::fgcol)
window : 20.2
draw_rectangle(double x0, double y0, double x1, double y1, color=window::fgcol)
window : 20.2
draw_rectangle(point p, point q, color=window::fgcol)
window : 20.2
draw_roundbox(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)
window : 20.2
draw_roundbox(point p, point q, double rndness, color col=window::fgcol)
window : 20.2
draw_roundrect(double x0, double y0, double x1, double y1, double rndness, color col=window::fgcol)
window : 20.2
draw_roundrect(point p, point q, double rndness, color col=window::fgcol)
window : 20.2
draw_segment(const point& p, const point& q, color c=window::fgcol)
window : 20.2
draw_segment(const segment& s, color c=window::fgcol)
window : 20.2
draw_segment(double x1, double y1, double x2, double y2, color c=window::fgcol)
window : 20.2
draw_segment(point p, point q, line l, color c = window::fgcol)
window : 20.2
draw_segments(const list<segment>& L, color c=window::fgcol)
window : 20.2
draw_spline(const list<point>& L, int n, color c=window::fgcol)
window : 20.2
draw_spline(const polygon& P, int n, color c=window::fgcol)
window : 20.2
draw_spline_arrow(const list<point>& L, int n, color c=window::fgcol)
window : 20.2
draw_text(const point& p, string s, color c=window::fgcol)
window : 20.2
draw_text(double x, double y, string s, color c=window::fgcol)
window : 20.2
draw_text_node(const point& p, string s, color c=window::bgcol)
window : 20.2
draw_text_node(double x, double y, string s, color c=window::bgcol)
window : 20.2
draw_triangle(const triangle& T, color=window::fgcol)
window : 20.2
draw_triangle(point a, point b, point c, color=window::fgcol)
window : 20.2
draw_vline(double x, color c=window::fgcol)
window : 20.2
draw_voro(const GRAPH<CIRCLE,POINT>& , void (*draw_node)(const POINT& ), void (*draw_edge)(const POINT& , const POINT& ), void (*draw_ray) (const POINT& , const POINT& ))
POINT_SET : 18.2
draw_voro_edges(void (*draw_edge)(const POINT& , const POINT& ), void (*draw_ray) (const POINT& , const POINT& ))
POINT_SET : 18.2
dual()
line : 17.4
rat_line : 17.13
real_line : 17.20
dual_map(graph& D)
graph : 14.1
dx()
d3_rat_segment : 19.11
d3_segment : 19.3
rat_segment : 17.11
real_segment : 17.18
segment : 17.2
dxD()
rat_segment : 17.11
dy()
d3_rat_segment : 19.11
d3_segment : 19.3
rat_segment : 17.11
real_segment : 17.18
segment : 17.2
dyD()
rat_segment : 17.11
dynamic_markov_chain : 14.25
dynamic_random_variate : 6.8
dynamic_trees : 9.13
dz()
d3_rat_segment : 19.11
d3_segment : 19.3
edge
graph_morphism_algorithm< graph_t > : 15.16
static_graph : 14.3.7
edge_array<E> : 14.9
edge_compat
graph_morphism_algorithm< graph_t > : 15.16
edge_data()
GRAPH<vtype,e...> : 14.2
edge_inf(vertex v)
dynamic_trees : 9.13
edge_map<E> : 14.12
edge_morphism
graph_morphism_algorithm< graph_t > : 15.16
edge_set : 14.17
edge_value_type
GRAPH<vtype,e...> : 14.2
EdgeIt : 16.3
edges()
GEN_POLYGON : 17.7
r_circle_gen_polygon : 17.30
edit()
GeoWin : 20.8
GraphWin : 20.6
edit(geo_scene sc)
GeoWin : 20.8
elapsed_time() : 6.15
timer : 6.16
elapsed_time(float& T) : 6.15
element_type
d_array<I,E> : 10.2
map2<I1,I2,E> : 10.5
map<I,E> : 10.4
eliminate_cocircular_vertices()
r_circle_gen_polygon : 17.30
r_circle_polygon : 17.29
eliminate_colinear_vertices()
GEN_POLYGON : 17.7
POLYGON : 17.6
empty()
b_priority_queue<I> : 11.2
b_queue<E> : 9.5
b_stack<E> : 9.4
d2_dictionary<K1,K2,I> : 18.1
d_int_set : 9.10
dictionary<K,I> : 10.1
edge_set : 14.17
GEN_POLYGON : 17.7
graph : 14.1
h_array<I,E> : 10.3
interval_set<I> : 18.3
list<E> : 9.6
node_list : 14.18
node_pq<P> : 14.20
node_set : 14.16
p_dictionary<K,I> : 10.6
p_queue<P,I> : 11.1
POINT_SET : 18.2
POLYGON : 17.6
pp_dictionary<K,I,CMP> : 10.7
queue<E> : 9.3
rat_segment_set<I> : 18.5
segment_set<I> : 18.4
set<E> : 9.8
slist<E> : 9.7
sortseq<K,I> : 10.8
stack<E> : 9.2
string : 6.1
enable_button(int b)
window : 20.2
enable_call(int id)
GraphWin : 20.6
enable_calls()
Gr