MCPcopy Create free account

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

Functions675 in github.com/google-deepmind/alphageometry

⨍ Functions 675◇ Types & classes 52
↓ 2 callersMethodgreater_than
(self, other: Line)
numericals.py:182
↓ 2 callersFunctionhashed
(e: dict[str, float])
ar.py:78
↓ 2 callersFunctionhashed_txt
Return a tuple unique to name and args upto arg permutation equivariant.
problem.py:1071
↓ 2 callersFunctionhighlight
Draw highlights.
numericals.py:1058
↓ 2 callersFunctionis_zero
(e: dict[str, float])
ar.py:82
↓ 2 callersMethodmaybe_make_equal_pairs
Add ab/cd = mn/pq in case maybe either two of (ab,cd,mn,pq) are equal.
graph.py:1621
↓ 2 callersMethodnorm
(self)
numericals.py:129
↓ 2 callersFunctionperm2
(elems)
graph_utils.py:78
↓ 2 callersMethodremove
Remove nodes out of self because they are merged.
graph.py:642
↓ 2 callersMethodreplace
(self, v0: str, e0: dict[str, float])
ar.py:295
↓ 2 callersFunctionreshape
(l: list[Any], n: int = 1)
problem.py:33
↓ 2 callersMethodsample_within
Sample a point within the boundary of points.
numericals.py:293
↓ 2 callersFunctionsketch
( name: str, args: list[Union[Point, gm.Point]] )
numericals.py:1326
↓ 2 callersFunctionsketch_aline
Sketch the construction aline.
numericals.py:1489
↓ 2 callersFunctionsketch_dia
(args: tuple[gm.Point, ...])
numericals.py:1546
↓ 2 callersFunctionslice_in_dim_1
(window_length: int)
transformer_layer.py:46
↓ 2 callersMethodto_dict
(cls, data: list[Problem])
problem.py:182
↓ 2 callersMethodtranslate
(self, mapping: dict[str, str])
problem.py:97
↓ 2 callersFunctionupdate_groups
Update groups of equivalent elements. Given groups1 = [set1, set2, set3, ..] where all elems within each set_i is defined to be "equivalent" to e
ar.py:181
↓ 2 callersFunctionupdate_slice_in_dim_1
Update a stored keys/values slice for different-lengthed seqs in batch.
transformer_layer.py:41
↓ 2 callersMethodwhy_equal_groups
BFS for why self is equal to at least one member of each group.
geometry.py:233
↓ 1 callersMethod__init__
(self, points: list[str], constructions: list[Construction])
problem.py:82
↓ 1 callersMethod__init__
( self, p1: Point = None, p2: Point = None, coefficients: tuple[int, int, int] = None,
numericals.py:150
↓ 1 callersMethod_add_para_or_coll
Add a new parallel or collinear predicate.
graph.py:1179
↓ 1 callersFunction_all_4points
(l1, l2)
graph_utils.py:82
↓ 1 callersFunction_all_8points
(l1, l2, l3, l4)
graph_utils.py:94
↓ 1 callersFunction_comb3
(elems)
graph_utils.py:46
↓ 1 callersFunction_comb4
(elems)
graph_utils.py:59
↓ 1 callersFunction_cross
(elems1, elems2)
graph_utils.py:24
↓ 1 callersFunction_draw
Draw everything.
numericals.py:1134
↓ 1 callersMethod_find
(self, dep_hashed: tuple[str, ...])
problem.py:690
↓ 1 callersFunction_gcd
(x: int, y: int)
problem.py:121
↓ 1 callersFunction_gcd
(x: int, y: int)
ar.py:32
↓ 1 callersFunction_gcd
(x: int, y: int)
pretty.py:51
↓ 1 callersMethod_get_or_create_ratio_l
Get or create a new Ratio from two Lenghts l1 and l2.
graph.py:2060
↓ 1 callersMethod_maybe_add_cyclic_from_cong
Maybe add a new cyclic predicate from given congruent segments.
graph.py:1391
↓ 1 callersMethod_next_decoder_state
Compute the next decoder state, and return keys,values to attend to. The keys,values returned from this function are drawn from the prior dec
transformer_layer.py:58
↓ 1 callersFunction_perm2
(elems)
graph_utils.py:72
↓ 1 callersFunction_perm3
(elems)
graph_utils.py:104
↓ 1 callersFunction_perm4
(elems)
graph_utils.py:118
↓ 1 callersMethodadd_aconst
Add that an angle is equal to some constant.
graph.py:1830
↓ 1 callersMethodadd_circle
( self, points: list[Point], deps: EmptyDependency )
graph.py:1462
↓ 1 callersMethodadd_cong2
( self, points: list[Point], deps: EmptyDependency )
graph.py:2084
↓ 1 callersMethodadd_const_ratio
( self, l1: gm.Length, l2: gm.Length, m: float, n: float, dep: pr.Dependency )
ar.py:570
↓ 1 callersMethodadd_contri_check
( self, points: list[Point], deps: EmptyDependency )
graph.py:2341
↓ 1 callersMethodadd_eq2
( self, a: str, b: str, m: float, n: float, dep: pr.Dependency )
ar.py:425
↓ 1 callersMethodadd_eqratio4
( self, points: list[Point], deps: EmptyDependency )
graph.py:2109
↓ 1 callersMethodadd_midp
( self, points: list[Point], deps: EmptyDependency )
graph.py:1442
↓ 1 callersMethodadd_simtri_check
( self, points: list[Point], deps: EmptyDependency )
graph.py:2334
↓ 1 callersMethodadditionally_draw
Draw some extra line/circles for illustration purpose.
graph.py:2486
↓ 1 callersMethodall_eqangle_same_lines
(self)
graph.py:2730
↓ 1 callersMethodall_eqangles_6points
List all sets of 6 points that make two equal angles.
graph.py:2826
↓ 1 callersMethodall_eqangles_distinct_linepairss
No eqangles betcause para-para, or para-corresponding, or same.
graph.py:2736
↓ 1 callersMethodall_eqratios_6points
List all sets of 6 points that make two equal angles.
graph.py:2973
↓ 1 callersFunctionbeam_init
Initializes the beam search state data structure.
beam_search.py:194
↓ 1 callersMethodcall
Call the meliad model.
lm_inference.py:103
↓ 1 callersFunctionchain2
(elems: list[Any])
ar.py:174
↓ 1 callersMethodcheck_acompute
Check if an angle has a constant value.
graph.py:1977
↓ 1 callersMethodcheck_contri
(self, points: list[Point])
graph.py:2432
↓ 1 callersFunctioncheck_eqangle
Check if 8 points make 2 equal angles.
numericals.py:749
↓ 1 callersFunctioncheck_para
(points: list[Point])
numericals.py:687
↓ 1 callersMethodcheck_rcompute
Check whether a ratio is equal to some constant.
graph.py:2269
↓ 1 callersMethodcheck_record_eq
(self, v1: str, v2: str, v3: str, v4: str)
ar.py:414
↓ 1 callersMethodcheck_simtri
(self, points: list[Point])
graph.py:2391
↓ 1 callersFunctioncheck_valid_args
Check whether a predicate is grammarically correct. Args: name: str: name of the predicate args: list[str]: args of the predicate Return
alphageometry.py:316
↓ 1 callersFunctioncircle_segment_intersect
( circle: Circle, p1: Point, p2: Point )
numericals.py:555
↓ 1 callersMethodcoll_dep
Return the dep(.why) explaining why p is coll with points.
graph.py:912
↓ 1 callersFunctioncollx_to_coll
Convert collx to coll and dedup.
trace_back.py:228
↓ 1 callersFunctioncomb2
(elems: list[Any])
ar.py:160
↓ 1 callersFunctioncomb2
(elems)
graph_utils.py:42
↓ 1 callersMethodconclusion_name_args
( self, mapping: dict[str, gm.Point] )
problem.py:449
↓ 1 callersFunctioncreate_consts_str
(g: gh.Graph, s: str)
dd.py:1126
↓ 1 callersMethodcyclic_dep
(self, points: list[Point], p: Point)
graph.py:1495
↓ 1 callersMethodderive_angle_algebra
Derive new eqangles predicates.
graph.py:416
↓ 1 callersMethodderive_distance_algebra
Derive new cong predicates.
graph.py:453
↓ 1 callersMethodderive_ratio_algebra
Derive new eqratio predicates.
graph.py:391
↓ 1 callersFunctiondiv
Divide e1 by e2.
ar.py:115
↓ 1 callersMethoddo_algebra
Derive (but not add) new algebraic predicates.
graph.py:293
↓ 1 callersFunctiondraw_circle
Draw a circle.
numericals.py:1015
↓ 1 callersFunctiondraw_line
Draw a line.
numericals.py:969
↓ 1 callersFunctiondraw_point
draw a point.
numericals.py:925
↓ 1 callersFunctionfix_v
(v: float)
ar.py:64
↓ 1 callersFunctiongather_topk_beams
Gathers the top-k beam slices given by score_or_log_prob array. Args: nested: pytree of arrays or scalars (the latter ignored). score_or_lo
beam_search.py:140
↓ 1 callersMethodgenerate
Generate an output sequence. Args: inputs: the same as argument to _call_. Returns: An array of generated tokens of shape (batch
models.py:117
↓ 1 callersMethodget_all_eqs
( self, )
ar.py:467
↓ 1 callersMethodget_circle_thru_triplet
(self, p1: Point, p2: Point, p3: Point)
graph.py:855
↓ 1 callersFunctionget_circles_thru_all
(*points: list[Point])
geometry.py:447
↓ 1 callersMethodget_line_thru_pair
(self, p1: Point, p2: Point)
graph.py:877
↓ 1 callersFunctionget_lines_thru_all
(*points: list[Point])
geometry.py:420
↓ 1 callersFunctionget_lm
(ckpt_init: str, vocab_path: str)
alphageometry.py:198
↓ 1 callersFunctionhighlight_angle
Highlight an angle between ab and cd with (color, alpha).
numericals.py:1041
↓ 1 callersMethodin_cache
(self, name: str, args: list[Point])
graph.py:2458
↓ 1 callersMethodinit_decoder_state_vanilla
Return initial state for autoregressive generation.
decoder_stack.py:46
↓ 1 callersFunctioninsert_aux_to_premise
Insert auxiliary constructs from proof to premise. Args: pstring: str: describing the problem to solve. auxstring: str: describing the auxi
alphageometry.py:445
↓ 1 callersFunctionis_equiv
(x: Node, y: Node, level: int = None)
geometry.py:290
↓ 1 callersMethodis_val
(self, node: Node)
geometry.py:132
↓ 1 callersFunctionisint
(x: str)
problem.py:41
↓ 1 callersFunctionjoin_prems
Join proof steps with the same premises.
trace_back.py:317
↓ 1 callersMethodmap2obj
(self, names: list[str])
ar.py:685
↓ 1 callersFunctionmap_symbol_inv
(c: str)
pretty.py:47
← previousnext →201–300 of 675, ranked by callers