Functions — github.com/google-deepmind/alphageometry

hub / github.com/google-deepmind/alphageometry / functions

Functions675 in github.com/google-deepmind/alphageometry

⨍ Functions 675◇ Types & classes 52

↓ 115 callersMethoddistance

(self, p: Point)

numericals.py:217

↓ 82 callersMethodneighbors

Neighbors of this node in the proof state graph.

geometry.py:89

↓ 55 callersMethodis_equal

(self, x: gm.Node, y: gm.Node, level: int = None)

graph.py:677

↓ 53 callersMethodhashed

(self, rename: bool = False)

problem.py:1055

↓ 51 callersMethodadd

(self, name: str, args: list[str])

problem.py:110

↓ 32 callersMethodpopulate

(self, name: str, args: list[gm.Point])

problem.py:600

↓ 27 callersMethodrep

(self)

geometry.py:76

↓ 26 callersMethod_get_line

(self, a: Point, b: Point)

graph.py:833

↓ 26 callersFunctionang_between

(tail: Point, head1: Point, head2: Point)

numericals.py:1255

↓ 26 callersMethodcheck_coll

(self, points: list[Point])

graph.py:983

↓ 25 callersMethodfrom_txt

(cls, data: str)

problem.py:73

↓ 24 callersMethodcheck_cong

(self, points: list[Point])

graph.py:1427

↓ 24 callersMethodwhy_me_or_cache

(self, g: Any, level: int)

problem.py:710

↓ 23 callersMethodcache_dep

( self, name: str, args: list[Point], premises: list[Dependency] )

graph.py:2461

↓ 22 callersFunctionclose_enough

(a: float, b: float, tol: float = 1e-12)

numericals.py:1241

↓ 21 callersMethod_get_segment

(self, p1: Point, p2: Point)

graph.py:1334

↓ 21 callersMethodconnect_val

Connect a node into its value (equality) node.

graph.py:660

↓ 21 callersMethodwhy_equal

(self, x: gm.Node, y: gm.Node, level: int)

graph.py:1037

↓ 20 callersFunction_draw_line

Draw a line in matplotlib.

numericals.py:951

↓ 20 callersMethodcos

(self, other: Point)

numericals.py:132

↓ 20 callersMethodcross

(self, other: Line)

numericals.py:237

↓ 20 callersMethodtwo_points_on_direction

(self, d: Direction)

graph.py:3025

↓ 19 callersMethodis_perp

(self, other: Line)

numericals.py:232

↓ 19 callersMethodnew_node

(self, oftype: Type[gm.Node], name: str = '')

graph.py:591

↓ 18 callersMethodcheck_eqangle

Check if two angles are equal.

graph.py:1995

↓ 18 callersMethodget_line_thru_pair_why

Get one line thru two given points and the corresponding dependency list.

graph.py:897

↓ 18 callersFunctionline_line_intersection

(l1: Line, l2: Line)

numericals.py:577

↓ 18 callersFunctionrandom_points

(n: int = 3)

numericals.py:1272

↓ 16 callersMethodfoot

(self, line: Line)

numericals.py:117

↓ 16 callersMethodmake_equal

Make that two nodes x and y are equal, i.e. merge their value node.

graph.py:1005

↓ 16 callersFunctionminus

(e1: dict[str, float], e2: dict[str, float])

ar.py:111

↓ 15 callersMethodcheck_ncoll

(self, points: list[Point])

graph.py:997

↓ 15 callersMethodcheck_perp

(self, points: list[Point])

graph.py:1321

↓ 15 callersMethodnames2nodes

(self, pnames: list[str])

graph.py:546

↓ 14 callersMethodbuild_problem

Build a problem into a gr.Graph object.

graph.py:486

↓ 14 callersMethodconnect

(self, a: gm.Node, b: gm.Node, deps: Dependency)

graph.py:656

↓ 14 callersMethodfrom_txt_file

Load a problem from a text file.

problem.py:144

↓ 14 callersFunctionline_circle_intersection

Returns a pair of points as intersections of line and circle.

numericals.py:511

↓ 13 callersMethodcheck

Symbolically check if a predicate is True.

graph.py:772

↓ 13 callersFunctionrandom_rfss

Random rotate-flip-scale-shift a point cloud.

numericals.py:1276

↓ 12 callersMethoddiff_side

(self, p1: Point, p2: Point)

numericals.py:266

↓ 11 callersMethod_get_or_create_segment

Get or create a Segment object between two Points p1 and p2.

graph.py:1340

↓ 11 callersMethodadd_cong

Add that two segments (4 points) are congruent.

graph.py:1359

↓ 11 callersFunctioncheck_coll

(points: list[Point])

numericals.py:660

↓ 11 callersMethodclose

(self, point: Point, tol: float = 1e-12)

numericals.py:81

↓ 11 callersMethodperpendicular_line

(self, p: Point)

numericals.py:178

↓ 10 callersMethodadd_eqratio

Add a new eqratio from 8 points.

graph.py:2190

↓ 10 callersMethodconnect_to

(self, node: Node, deps: list[Any] = None)

geometry.py:165

↓ 10 callersMethoddistance

(self, p: Union[Point, Line, Circle])

numericals.py:87

↓ 10 callersMethodextend

Extend the dependency list by (name, args).

problem.py:611

↓ 9 callersMethodadd_eqangle

Add eqangle made by 8 points in `points`.

graph.py:1765

↓ 9 callersMethodcheck_para

(self, points: list[Point])

(self, pointname: str, default_fn: Callable[str, Point])

graph.py:584

↓ 9 callersMethodget_or_create_const_ang

(self, n: int, d: int)

graph.py:155

↓ 9 callersFunctionstrip

(e: dict[str, float])

ar.py:86

↓ 8 callersMethodcheck_eqratio

Check if 8 points make an eqratio predicate.

graph.py:2288

↓ 8 callersMethodget_all_eqs_and_why

Check all 4/3/2-permutations for new equalities.

ar.py:478

↓ 8 callersMethodis_parallel

(self, other: Line)

numericals.py:227

↓ 8 callersFunctionmaybe_make_equal_pairs

Make a-b:c-d==m-n:p-q in case a-b==m-n or c-d==p-q.

problem.py:645

↓ 8 callersMethodmerge

Merge all nodes.

graph.py:602

↓ 8 callersMethodrotate

(self, sinb: float, cosb: float)

numericals.py:107

↓ 7 callersFunctionang_of

(tail: Point, head: Point)

numericals.py:1249

↓ 7 callersFunctioncircle_circle_intersection

Returns a pair of Points as intersections of c1 and c2.

numericals.py:481

↓ 7 callersMethodget_or_create_const_rat

(self, n: int, d: int)

graph.py:167

↓ 7 callersFunctionmult

(e: dict[str, float], m: float)

ar.py:107

↓ 7 callersFunctionplus

(e1: dict[str, float], e2: dict[str, float])

ar.py:90

↓ 7 callersMethodrep_and_why

(self)

geometry.py:85

↓ 6 callersMethodadd_cong

Add that distance between p1 and p2 (on l12) == p3 and p4 (on l34).

ar.py:688

↓ 6 callersMethodcheck_cyclic

(self, points: list[Point])

graph.py:1563

↓ 6 callersMethodequivs

(self)

geometry.py:162

↓ 6 callersMethodtwo_points_of_length

↓ 6 callersMethodwhy_equal

BFS why this node is equal to other nodes.

geometry.py:202

↓ 5 callersMethod_get_angle

( self, d1: Direction, d2: Direction )

graph.py:1122

↓ 5 callersMethod_get_or_create_angle

( self, l1: Line, l2: Line, deps: Dependency )

graph.py:1150

↓ 5 callersMethodadd

Add a new node to this queue.

alphageometry.py:466

↓ 5 callersMethodadd_eq4

(self, a: str, b: str, c: str, d: str, dep: pr.Dependency)

ar.py:443

↓ 5 callersMethodadd_eqangle

Add the inequality d1-d2=d3-d4.

ar.py:625

↓ 5 callersMethodadd_perp

Add a new perpendicular predicate from 4 points (2 lines).

graph.py:1245

↓ 5 callersMethodall_circles

(self)

graph.py:3013

↓ 5 callersMethodall_points

Return all nodes of type Point.

graph.py:532

↓ 5 callersFunctionapply_on_cache

Apply fn(val) only when key is 'keys' or 'val'.

beam_search.py:159

↓ 5 callersMethodget_name

(self, objs: list[Any])

ar.py:533

↓ 5 callersFunctionhashed

( name: str, args: list[gm.Point], rename: bool = False )

problem.py:1059

↓ 5 callersFunctionhead_from

(tail: Point, ang: float, length: float = 1)

numericals.py:1267

↓ 5 callersFunctionintersect1

(set1: set[Any], set2: set[Any])

dd.py:31

↓ 5 callersMethodpopulate

(self, name: str, args: list[gm.Point])

problem.py:716

↓ 5 callersMethodrecord_eq

(self, v1: str, v2: str, v3: str, v4: str)

ar.py:408

↓ 5 callersFunctionrotate_simtri

Rotate points around for similar triangle predicates.

dd.py:446

↓ 4 callersMethod__init__

(self, const: str = '1')

ar.py:276

↓ 4 callersMethodadd_const_angle

( self, d1: gm.Direction, d2: gm.Direction, ang: float, dep: pr.Dependency )

ar.py:612

↓ 4 callersMethodadd_expr

Add a new equality, represented by the list of tuples vc=[(v, c), ..].

ar.py:299

↓ 4 callersMethodadd_para

Add a new predicate that 4 points (2 lines) are parallel.

graph.py:1073

↓ 4 callersFunctionbring_together

( a: Point, b: Point, c: Point, d: Point )

numericals.py:713

↓ 4 callersMethodenum_triangle

( self, points: list[Point] )

graph.py:2356

↓ 4 callersMethodequivs_upto

What are the equivalent nodes up to a certain level.

geometry.py:177

↓ 4 callersFunctiongather_beams

Gathers the beam slices indexed by beam_indices into new beam array. Args: nested: pytree of arrays or scalars (the latter ignored). beam_i

beam_search.py:113

↓ 4 callersFunctionget_theme

()

numericals.py:1199

↓ 4 callersMethodintersect

(self, obj: Union[Line, Circle])

numericals.py:211

next →1–100 of 675, ranked by callers