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

↓ 1 callersFunctionmark_segment

( ax: matplotlib.axes.Axes, p1: Point, p2: Point, color: Any, alpha: float )

numericals.py:1033

↓ 1 callersFunctionmatch_all

Match all instances of a certain relation.

dd.py:779

↓ 1 callersFunctionmatch_all_theorems

Match all instances of all theorems (rules).

dd.py:978

↓ 1 callersFunctionmatch_generic

Match any generic rule that is not one of the above match_*() rules.

dd.py:855

↓ 1 callersFunctionmatch_one_theorem

Match all instances of a single theorem (rule).

dd.py:949

↓ 1 callersMethodmaybe_make_para_from_perp

Maybe add a new parallel predicate from perp predicate.

graph.py:1219

↓ 1 callersMethodmerge_edge_graph

( self, new_edge_graph: dict[Node, dict[Node, list[Node]]] )

geometry.py:110

↓ 1 callersMethodmerge_one

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

geometry.py:123

↓ 1 callersFunctionnaming_position

Figure out a good naming position on the drawing.

numericals.py:890

↓ 1 callersMethodpairs

(self)

ar.py:458

↓ 1 callersMethodpairs

(self)

ar.py:668

↓ 1 callersFunctionparse_rely

(s: str)

problem.py:285

↓ 1 callersFunctionplus_all

(*es: list[dict[str, float]])

ar.py:100

↓ 1 callersFunctionpoint_levels

Reformat setup into levels of point constructions.

trace_back.py:28

↓ 1 callersFunctionproof_step_string

Translate proof to natural language. Args: proof_step: pr.Dependency with .name and .args refs: dict(hash: int) to keep track of derived pr

alphageometry.py:97

↓ 1 callersFunctionread

(q: problem.Dependency)

trace_back.py:154

↓ 1 callersFunctionrecon

Reconcile one variable in the expression e=0, given const.

ar.py:132

↓ 1 callersFunctionrecursive_traceback

Recursively traceback from the query, i.e. the conclusion.

trace_back.py:146

↓ 1 callersMethodregister2

( self, a: str, b: str, m: float, n: float, dep: pr.Dependency )

ar.py:363

↓ 1 callersMethodregister3

(self, a: str, b: str, f: float, dep: pr.Dependency)

ar.py:368

↓ 1 callersMethodregister4

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

ar.py:371

↓ 1 callersMethodremove_loop

(self)

problem.py:698

↓ 1 callersFunctionreplace

( e: dict[str, float], v0: str, e0: dict[str, float] )

ar.py:150

↓ 1 callersFunctionrun_alphageometry

Simplified code to run AlphaGeometry proof search. We removed all optimizations that are infrastructure-dependent, e.g. parallelized model infere

alphageometry.py:488

↓ 1 callersMethodsame

(self, other: Line)

numericals.py:194

↓ 1 callersMethodsame_side

(self, p1: Point, p2: Point)

numericals.py:273

↓ 1 callersFunctionsaturate_or_goal

Run DD until saturation or goal found.

ddar.py:27

↓ 1 callersFunctionseparate_dependency_difference

Identify and separate the dependency difference.

trace_back.py:89

↓ 1 callersMethodset_obj

(self, node: Node)

geometry.py:147

↓ 1 callersMethodset_rep

(self, node: Node)

geometry.py:69

↓ 1 callersFunctionset_theme

(theme)

numericals.py:1194

↓ 1 callersMethodset_val

(self, node: Node)

geometry.py:144

↓ 1 callersFunctionsetup_to_levels

Reformat setup into levels of point constructions.

trace_back.py:73

↓ 1 callersFunctionshorten_and_shave

Shorten the proof by removing unused predicates.

trace_back.py:297

↓ 1 callersFunctionshorten_proof

Join multiple trivials proof steps into one.

trace_back.py:333

↓ 1 callersMethodsign

(self, point: Point)

numericals.py:280

↓ 1 callersFunctionsimplify

(n: int, d: int)

problem.py:127

↓ 1 callersFunctionsketch_exbisect

(args: tuple[gm.Point, ...])

numericals.py:1535

↓ 1 callersFunctionsort_deps

(deps: list[Dependency])

problem.py:136

↓ 1 callersMethodtranslate

Translate point names into alphabetical.

problem.py:193

↓ 1 callersFunctiontranslate_constrained_to_constructive

Translate a predicate from constraint-based to construction-based. Args: point: str: name of the new point name: str: name of the predicate

alphageometry.py:234

↓ 1 callersFunctiontry_to_map

Recursively try to match the remaining points given current mapping.

dd.py:827

↓ 1 callersFunctiontry_translate_constrained_to_construct

Whether a string of aux construction can be constructed. Args: string: str: the string describing aux construction. g: gh.Graph: the curren

alphageometry.py:371

↓ 1 callersFunctionunflatten_beam_dim

Unflattens the first, flat batch*beam dimension of a non-scalar array.

beam_search.py:100

↓ 1 callersMethodwhy_coll

(self, args: tuple[Line, list[Point]])

graph.py:993

↓ 1 callersMethodwhy_coll

Why points are connected to self.

geometry.py:336

↓ 1 callersMethodwhy_cong

(self, args: tuple[Segment, Segment])

graph.py:1438

↓ 1 callersMethodwhy_connect

(self, node: Node, level: int = None)

geometry.py:273

↓ 1 callersMethodwhy_cyclic

Why points are connected to self.

geometry.py:375

↓ 1 callersFunctionwhy_eqratio

Why two ratios are equal, returns a Dependency objects.

problem.py:458

↓ 1 callersFunctionwrite_solution

Output the solution to out_file. Args: g: gh.Graph object, containing the proof state. p: pr.Problem object, containing the theorem. ou

Computes attention over a sequence of inputs. Args: xs: input sequence of shape (batch_size, sequence_length, num_hidden) start_of_se

transformer_layer.py:119

Method__call__

(self, x: Point, y: Point = None)

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

problem.py:57

Method__init__

(self, url: str, clauses: list[Clause], goal: Construction)

problem.py:185

Method__init__

( self, construction: Construction, rely: dict[str, str], deps: Clause, basics:

problem.py:347

Method__init__

( self, premise: list[Construction], conclusion: list[Construction] )

problem.py:414

Method__init__

(self, level: int, rule_name: str)

problem.py:593

Method__init__

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

problem.py:679

Method__init__

(self, vocab_path: str, load_dir: str, mode='beam_search')

(self, name: str = '')

ar.py:529

Method__init__

(self, name: str = '')

ar.py:561

Method__init__

(self, name: str = '')

ar.py:594

Method__init__

(self, name: str = '')

ar.py:662

Method__init__

(self, name: str = '', graph: Any = None)

(self, tail: Point, head: Point)

numericals.py:321

Method__init__

( self, center: Optional[Point] = None, radius: Optional[float] = None, p1: Optional[P

numericals.py:391

Method__init__

(self, center: Point, radius: float, hole: Point)

numericals.py:446

Method__init__

(self, max_size: int = 512)

(self, *points: list[Point])

graph.py:1488

Method_get_line_all

(self, a: Point, b: Point)

graph.py:840

Method_get_lines

Return all lines that connect to >= 2 points.

graph.py:847

Method_get_ratio

(self, l1: Length, l2: Length)

graph.py:2049

Method_why_coll8

Dependency list of why 8 points are collinear.

graph.py:1052

Functionadd_beam_dim_cache

Creates new beam dimension in non-scalar array and tiles into it.

beam_search.py:76

Methodadd_eqratio

( self, l1: gm.Length, l2: gm.Length, l3: gm.Length, l4: gm.Length, dep: p

ar.py:576

Methodadd_para

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

ar.py:607

Methodadd_points

Add new points with given names in list pnames.

( d1: Direction, d2: Direction, level: int = None )

( d1, d2, level=None )

geometry.py:543

Methodall_same_angle

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

graph.py:2479

Functionassert_close_enough

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

numericals.py:1245

← previous next →301–400 of 675, ranked by callers