rem stringlengths 1 322k | add stringlengths 0 2.05M | context stringlengths 4 228k | meta stringlengths 156 215 |
|---|---|---|---|
0.85914091422952255 | 0.859140914229522... | def integral(f, *args, **kwds): r""" The integral of `f`. EXAMPLES:: sage: integral(sin(x), x) -cos(x) sage: integral(sin(x)^2, x, pi, 123*pi/2) 121/4*pi sage: integral( sin(x), x, 0, pi) 2 We integrate a symbolic function:: sage: f(x,y,z) = x*y/z + sin(z) sage: integral(f, z) (x, y, z) |--> x*y*log(z) - cos(z) ::... | 8441c8cd9f683d56e9e9dd906b08c8469d1b8d56 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/8441c8cd9f683d56e9e9dd906b08c8469d1b8d56/functional.py |
See also: :function:`Partition`, :meth:`Partition.to_exp` | See also: :func:`Partition`, :meth:`Partition.to_exp` | def from_polynomial_exp(self, p): r""" Conversion from polynomial in exponential notation | e590cc8877be643672b7cb85ed6de403c8b01e3c /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/e590cc8877be643672b7cb85ed6de403c8b01e3c/monomial.py |
For infinite periodic words (resp. for finite words of type `u^i u[0:j]`), the reduced Rauzy graph of order `n` (resp. for `n` smaller or equal to `(i-1)|u|+j`) is the directed graph whose unique vertex is the prefix `p` of length `n` of self and which has an only edge which is a loop on `p` labelled by `w[n+1:|w|] p` ... | For infinite periodic words (resp. for finite words of type `u^i u[0:j]`), the reduced Rauzy graph of order `n` (resp. for `n` smaller or equal to `(i-1)|u|+j`) is the directed graph whose unique vertex is the prefix `p` of length `n` of self and which has an only edge which is a loop on `p` labelled by `w[n+1:|w|] p` ... | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
:: For the Fibonacci word: :: | For the Fibonacci word:: | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
:: For periodic words: :: | For periodic words:: | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
:: For ultimataly periodic words: :: | For ultimately periodic words:: | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
return words," Advances in Applied Mathematics 42, no. 1 60-74 | return words," Advances in Applied Mathematics 42 (2009) 60-74. | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
155,(3-4) : 251-263, 2008. | 155 (2008) 251-263. | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
if g.num_verts() !=0 and len(l)==g.num_verts(): | if g.num_verts() !=0 and len(l)==g.num_verts(): | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
g.add_edge(i,o,g.edge_label(i,v)[0]+g.edge_label(v,o)[0]) | g.add_edge(i,o,g.edge_label(i,v)[0]*g.edge_label(v,o)[0]) | def reduced_rauzy_graph(self, n): r""" Returns the reduced Rauzy graph of order `n` of self. | 2eab66e63556bda27359db7a54db5c47986fb336 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2eab66e63556bda27359db7a54db5c47986fb336/word.py |
P1 = P[0]; P2 = P[1] | P1 = P[0] P2 = P[1] if is_Integer(P1) and is_Integer(P2): R = PolynomialRing(self.value_ring(), 'x') P1 = R(P1) P2 = R(P2) return JacobianMorphism_divisor_class_field(self, tuple([P1,P2])) if is_Integer(P1) and is_Polynomial(P2): R = PolynomialRing(self.value_ring(), 'x') P1 = R(P1) return JacobianMorphism_divisor_clas... | def __call__(self, P): r""" Returns a rational point P in the abstract Homset J(K), given: | 9ea22c466b5a94dda95e9df904284d741c0d57b4 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/9ea22c466b5a94dda95e9df904284d741c0d57b4/jacobian_homset.py |
Return the number type that contains both `self.field()` and `other`. | Return the common field for both ``self`` and ``other``. | def coerce_field(self, other): """ Return the number type that contains both `self.field()` and `other`. | ec32553b7b00a5ff90111c3c1c654046e3a1e835 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/ec32553b7b00a5ff90111c3c1c654046e3a1e835/polyhedra.py |
The argument `other` must be either * another `Polyhedron()` object * `QQ` or `RDF` * a constant that can be coerced to `QQ` or `RDF`. | The argument ``other`` must be either: * another ``Polyhedron`` object * `\QQ` or `RDF` * a constant that can be coerced to `\QQ` or `RDF` | def coerce_field(self, other): """ Return the number type that contains both `self.field()` and `other`. | ec32553b7b00a5ff90111c3c1c654046e3a1e835 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/ec32553b7b00a5ff90111c3c1c654046e3a1e835/polyhedra.py |
Either `QQ` or `RDF`. Raises `TypeError` if `other` is not a | Either `\QQ` or `RDF`. Raises ``TypeError`` if ``other`` is not a | def coerce_field(self, other): """ Return the number type that contains both `self.field()` and `other`. | ec32553b7b00a5ff90111c3c1c654046e3a1e835 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/ec32553b7b00a5ff90111c3c1c654046e3a1e835/polyhedra.py |
NOTE: "Real" numbers in sage are not necessarily elements of `RDF`. For example, the literal `1.0` is not. | .. NOTE:: "Real" numbers in sage are not necessarily elements of `RDF`. For example, the literal `1.0` is not. | def coerce_field(self, other): """ Return the number type that contains both `self.field()` and `other`. | ec32553b7b00a5ff90111c3c1c654046e3a1e835 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/ec32553b7b00a5ff90111c3c1c654046e3a1e835/polyhedra.py |
raise TypeError | raise TypeError("cannot determine field from %s!" % other) | def coerce_field(self, other): """ Return the number type that contains both `self.field()` and `other`. | ec32553b7b00a5ff90111c3c1c654046e3a1e835 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/ec32553b7b00a5ff90111c3c1c654046e3a1e835/polyhedra.py |
NOTE:: | NOTE: | def sturm_bound(self, M=None): r""" For a space M of modular forms, this function returns an integer B such that two modular forms in either self or M are equal if and only if their q-expansions are equal to precision B (note that this is 1+ the usual Sturm bound, since `O(q^\mathrm{prec})` has precision prec). If M is... | 489dccac1c7e285495d98a813942b73200338da0 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/489dccac1c7e285495d98a813942b73200338da0/space.py |
Normalization of arguments; see :cls:`UniqueRepresentation`. | Normalization of arguments; see :class:`UniqueRepresentation`. | def __classcall_private__(cls, fam, facade=True, keepkey=False): # was *args, **options): """ Normalization of arguments; see :cls:`UniqueRepresentation`. | 8bdc8dfac379304f9db7a9d72913caac14e98b5f /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/8bdc8dfac379304f9db7a9d72913caac14e98b5f/disjoint_union_enumerated_sets.py |
""" g = self.division_points(m, poly_only=True) return len(g.roots(multiplicities=False)) > 0 | A finite field example:: sage: E = EllipticCurve(GF(101),[23,34]) sage: E.cardinality().factor() 2 * 53 sage: Set([T.order() for T in E.points()]) {1, 106, 2, 53} sage: len([T for T in E.points() if T.is_divisible_by(2)]) 53 sage: len([T for T in E.points() if T.is_divisible_by(3)]) 106 TESTS: This shows that the b... | def is_divisible_by(self, m): """ Return True if there exists a point `Q` defined over the same field as self such that `mQ` == self. | 908ae000b4248b354b7f5ab2a76334849d2c3a84 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/908ae000b4248b354b7f5ab2a76334849d2c3a84/ell_point.py |
occured. Please put there the version of sageq at the time of deprecation. | occurred. Please put there the version of sage at the time of deprecation. | def deprecation(message, version=None): r""" Issue a deprecation warning. INPUT: - ``message`` - an explanation why things are deprecated and by what it should be replaced. - ``version`` - (optional) on which version and when the deprecation occured. Please put there the version of sageq at the time of deprecation. ... | 1d78cf8d98d4fe595d10148b4d6738e63873a04e /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/1d78cf8d98d4fe595d10148b4d6738e63873a04e/misc.py |
A wrapper around methods or functions wich automatically print the correct | A wrapper around methods or functions which automatically print the correct | sage: def bar(): | 1d78cf8d98d4fe595d10148b4d6738e63873a04e /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/1d78cf8d98d4fe595d10148b4d6738e63873a04e/misc.py |
if options['labels']: | if options.get('labels', False): | def _render_on_subplot(self, subplot): """ TESTS: | b930bde638c3418aac0325b1169327bc9ca7176c /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/b930bde638c3418aac0325b1169327bc9ca7176c/contour_plot.py |
if options['colorbar']: | if options.get('colorbar', False): | def _render_on_subplot(self, subplot): """ TESTS: | b930bde638c3418aac0325b1169327bc9ca7176c /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/b930bde638c3418aac0325b1169327bc9ca7176c/contour_plot.py |
dict(contours=[-1e307, 0, 1e307], cmap=cmap, fill=True, labels=False, **options))) | dict(contours=[-1e307, 0, 1e307], cmap=cmap, fill=True, **options))) | def region_plot(f, xrange, yrange, plot_points, incol, outcol, bordercol, borderstyle, borderwidth,**options): r""" ``region_plot`` takes a boolean function of two variables, `f(x,y)` and plots the region where f is True over the specified ``xrange`` and ``yrange`` as demonstrated below. ``region_plot(f, (xmin, xmax),... | b930bde638c3418aac0325b1169327bc9ca7176c /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/b930bde638c3418aac0325b1169327bc9ca7176c/contour_plot.py |
contours=[0], cmap=[bordercol], fill=False, labels=False, **options))) | contours=[0], cmap=[bordercol], fill=False, **options))) | def region_plot(f, xrange, yrange, plot_points, incol, outcol, bordercol, borderstyle, borderwidth,**options): r""" ``region_plot`` takes a boolean function of two variables, `f(x,y)` and plots the region where f is True over the specified ``xrange`` and ``yrange`` as demonstrated below. ``region_plot(f, (xmin, xmax),... | b930bde638c3418aac0325b1169327bc9ca7176c /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/b930bde638c3418aac0325b1169327bc9ca7176c/contour_plot.py |
X = list(X) | return Set_object_enumerated(list(X)) | def Set(X): r""" Create the underlying set of $X$. If $X$ is a list, tuple, Python set, or ``X.is_finite()`` is true, this returns a wrapper around Python's enumerated immutable frozenset type with extra functionality. Otherwise it returns a more formal wrapper. If you need the functionality of mutable sets, use Pyt... | c420173caede23fbb8fb537f8da61361adbf00d9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/c420173caede23fbb8fb537f8da61361adbf00d9/set.py |
Initializes base class Ellipse. | Initializes base class ``Ellipse``. | def __init__(self, x, y, r1, r2, angle, options): """ Initializes base class Ellipse. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
The bounding box is computed as minimal as possible. | The bounding box is computed to be as minimal as possible. | def get_minmax_data(self): """ Returns a dictionary with the bounding box data. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
An example without angle:: | An example without an angle:: | def get_minmax_data(self): """ Returns a dictionary with the bounding box data. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
The same example with a rotation of angle pi/2:: | The same example with a rotation of angle `\pi/2`:: | def get_minmax_data(self): """ Returns a dictionary with the bounding box data. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
Return the allowed options for the Ellipse class. | Return the allowed options for the ``Ellipse`` class. | def _allowed_options(self): """ Return the allowed options for the Ellipse class. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
String representation of Ellipse primitive. | String representation of ``Ellipse`` primitive. | def _repr_(self): """ String representation of Ellipse primitive. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
Plot 3d is not implemented. | Plotting in 3D is not implemented. | def plot3d(self): r""" Plot 3d is not implemented. | 4c5e1937fe73c05a208a1c8fdb96fca58580fae9 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c5e1937fe73c05a208a1c8fdb96fca58580fae9/ellipse.py |
key = (polynomial, polynomial.base_ring(), name, embedding, embedding.parent() if embedding is not None else None) | key = (polynomial, polynomial.base_ring(), name, latex_name, embedding, embedding.parent() if embedding is not None else None) | def NumberField(polynomial, name=None, check=True, names=None, cache=True, embedding=None, latex_name=None): r""" Return *the* number field defined by the given irreducible polynomial and with variable with the given name. If check is True (the default), also verify that the defining polynomial is irreducible and over ... | 7afdf4d31ed525919c3f4adb58ed37361d1e8917 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/7afdf4d31ed525919c3f4adb58ed37361d1e8917/number_field.py |
def QuadraticField(D, names, check=True, embedding=True, latex_name=None): | def QuadraticField(D, names, check=True, embedding=True, latex_name='sqrt'): | def QuadraticField(D, names, check=True, embedding=True, latex_name=None): r""" Return a quadratic field obtained by adjoining a square root of `D` to the rational numbers, where `D` is not a perfect square. INPUT: - ``D`` - a rational number - ``names`` - variable name - ``check`` - bool (default: True) - ``e... | 7afdf4d31ed525919c3f4adb58ed37361d1e8917 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/7afdf4d31ed525919c3f4adb58ed37361d1e8917/number_field.py |
root. | or upper half plane root. | def QuadraticField(D, names, check=True, embedding=True, latex_name=None): r""" Return a quadratic field obtained by adjoining a square root of `D` to the rational numbers, where `D` is not a perfect square. INPUT: - ``D`` - a rational number - ``names`` - variable name - ``check`` - bool (default: True) - ``e... | 7afdf4d31ed525919c3f4adb58ed37361d1e8917 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/7afdf4d31ed525919c3f4adb58ed37361d1e8917/number_field.py |
We can give the generator a special name for latex:: | By default, quadratic fields come with a nice latex representation:: sage: K.<a> = QuadraticField(-7) sage: latex(a) \sqrt{-7} sage: latex(1/(1+a)) -\frac{1}{8} \sqrt{-7} + \frac{1}{8} sage: K.latex_variable_name() '\\sqrt{-7}' We can provide our own name as well:: | def QuadraticField(D, names, check=True, embedding=True, latex_name=None): r""" Return a quadratic field obtained by adjoining a square root of `D` to the rational numbers, where `D` is not a perfect square. INPUT: - ``D`` - a rational number - ``names`` - variable name - ``check`` - bool (default: True) - ``e... | 7afdf4d31ed525919c3f4adb58ed37361d1e8917 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/7afdf4d31ed525919c3f4adb58ed37361d1e8917/number_field.py |
def tamagawa_product(self): | def tamagawa_product_bsd(self): | def tamagawa_product(self): r""" Given an elliptic curve `E` over a number field `K`, this function returns the integer `C(E/K)` that appears in the Birch and Swinnerton-Dyer conjecture accounting for the local information at finite places. If the model is a global minimal model then `C(E/K)` is simply the product of t... | 2541dc4b428f491f2ed6a4df21bd19922e831a64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2541dc4b428f491f2ed6a4df21bd19922e831a64/ell_number_field.py |
sage: E.tamagawa_product() | sage: E.tamagawa_product_bsd() | def tamagawa_product(self): r""" Given an elliptic curve `E` over a number field `K`, this function returns the integer `C(E/K)` that appears in the Birch and Swinnerton-Dyer conjecture accounting for the local information at finite places. If the model is a global minimal model then `C(E/K)` is simply the product of t... | 2541dc4b428f491f2ed6a4df21bd19922e831a64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2541dc4b428f491f2ed6a4df21bd19922e831a64/ell_number_field.py |
sage: E.tamagawa_product() | sage: E.tamagawa_product_bsd() | def tamagawa_product(self): r""" Given an elliptic curve `E` over a number field `K`, this function returns the integer `C(E/K)` that appears in the Birch and Swinnerton-Dyer conjecture accounting for the local information at finite places. If the model is a global minimal model then `C(E/K)` is simply the product of t... | 2541dc4b428f491f2ed6a4df21bd19922e831a64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2541dc4b428f491f2ed6a4df21bd19922e831a64/ell_number_field.py |
sage: E.tamagawa_product() | sage: E.tamagawa_product_bsd() | def tamagawa_product(self): r""" Given an elliptic curve `E` over a number field `K`, this function returns the integer `C(E/K)` that appears in the Birch and Swinnerton-Dyer conjecture accounting for the local information at finite places. If the model is a global minimal model then `C(E/K)` is simply the product of t... | 2541dc4b428f491f2ed6a4df21bd19922e831a64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2541dc4b428f491f2ed6a4df21bd19922e831a64/ell_number_field.py |
sage: E2 Elliptic Curve defined by y^2 + a*x*y + (a+1)*y = x^3 + (a+1)*x^2 + (12289755603565800754*a-75759141535687466985)*x + (51556320144761417221790307379*a-317814501841918807353201512829) over Number Field in a with defining polynomial x^2 - 38 | sage: E2 Elliptic Curve defined by y^2 + a*x*y + (a+1)*y = x^3 + (a+1)*x^2 + (368258520200522046806318444*a-2270097978636731786720859345)*x + (8456608930173478039472018047583706316424*a-52130038506793883217874390501829588391299) over Number Field in a with defining polynomial x^2 - 38 | def global_minimal_model(self, proof = None): r""" Returns a model of self that is integral, minimal at all primes. | 2541dc4b428f491f2ed6a4df21bd19922e831a64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2541dc4b428f491f2ed6a4df21bd19922e831a64/ell_number_field.py |
flags = [re.IGNORECASE] | flags = re.IGNORECASE | sage: 'divisors' in _search_src_or_doc('src', '^ *def prime', interact=False) | a3b63ec494930ca0c304e5abc50083120d755f64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a3b63ec494930ca0c304e5abc50083120d755f64/sagedoc.py |
flags = [] | flags = 0 | sage: 'divisors' in _search_src_or_doc('src', '^ *def prime', interact=False) | a3b63ec494930ca0c304e5abc50083120d755f64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a3b63ec494930ca0c304e5abc50083120d755f64/sagedoc.py |
if re.search(string, line, *flags): | if re.search(string, line, flags): | sage: 'divisors' in _search_src_or_doc('src', '^ *def prime', interact=False) | a3b63ec494930ca0c304e5abc50083120d755f64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a3b63ec494930ca0c304e5abc50083120d755f64/sagedoc.py |
if re.search(string, line, *flags)] | if re.search(string, line, flags)] | sage: 'divisors' in _search_src_or_doc('src', '^ *def prime', interact=False) | a3b63ec494930ca0c304e5abc50083120d755f64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a3b63ec494930ca0c304e5abc50083120d755f64/sagedoc.py |
re.MULTILINE, *flags), | re.MULTILINE | flags), | sage: 'divisors' in _search_src_or_doc('src', '^ *def prime', interact=False) | a3b63ec494930ca0c304e5abc50083120d755f64 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a3b63ec494930ca0c304e5abc50083120d755f64/sagedoc.py |
sage: region_plot([x^2+y^2<1, x<y], (x,-2,2), (y,-2,2), plot_points=400).show(aspect_ratio=1) | sage: region_plot([x^2+y^2<1, x<y], (x,-2,2), (y,-2,2), plot_points=400).show(aspect_ratio=1) | def region_plot(f, xrange, yrange, plot_points, incol, outcol, bordercol, borderstyle, borderwidth): r""" ``region_plot`` takes a boolean function of two variables, `f(x,y)` and plots the region where f is True over the specified ``xrange`` and ``yrange`` as demonstrated below. ``region_plot(f, (xmin, xmax), (ymin, ym... | 47cf9f98824089bdd425532ee6f4d0ae1a2df9a5 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/47cf9f98824089bdd425532ee6f4d0ae1a2df9a5/contour_plot.py |
_vars = str(self.gen()) | _vars = '(%s)'%self.gen() | def _singular_init_(self, singular=singular_default): """ Return a newly created Singular ring matching this ring. """ if not can_convert_to_singular(self): raise TypeError, "no conversion of this ring to a Singular ring defined" | 4c4bc1fc30f29e1e77cbd5b776888f941f1750a8 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/4c4bc1fc30f29e1e77cbd5b776888f941f1750a8/polynomial_singular_interface.py |
have_tkzgraph = not bool(os.system('kpsewhich tkz-graph.sty > /dev/null')) | have_tkzgraph = not bool(os.system('kpsewhich tkz-graph.sty &> /dev/null')) | def check_tkz_graph(): r""" Checks if the proper `\mbox{\rm\LaTeX}` packages for the ``tikzpicture`` environment are installed in the user's environment. If the requisite packages are not found on the first call to this function, warnings are printed. Thereafter, the function caches its result in the variable ``_have_... | 044dfa0dd6926142545c076e530fd00c854ff72f /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/044dfa0dd6926142545c076e530fd00c854ff72f/graph_latex.py |
have_tkzberge = not bool(os.system('kpsewhich tkz-berge.sty > /dev/null')) | have_tkzberge = not bool(os.system('kpsewhich tkz-berge.sty &> /dev/null')) | def check_tkz_graph(): r""" Checks if the proper `\mbox{\rm\LaTeX}` packages for the ``tikzpicture`` environment are installed in the user's environment. If the requisite packages are not found on the first call to this function, warnings are printed. Thereafter, the function caches its result in the variable ``_have_... | 044dfa0dd6926142545c076e530fd00c854ff72f /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/044dfa0dd6926142545c076e530fd00c854ff72f/graph_latex.py |
have_tkzgraph = not bool(os.system('kpsewhich tkz-graph.sty > /dev/null')) have_tkzberge = not bool(os.system('kpsewhich tkz-berge.sty > /dev/null')) | have_tkzgraph = not bool(os.system('kpsewhich tkz-graph.sty &> /dev/null')) have_tkzberge = not bool(os.system('kpsewhich tkz-berge.sty &> /dev/null')) | def have_tkz_graph(): r""" Returns ``True`` if the proper `\mbox{\rm\LaTeX}` packages for the ``tikzpicture`` environment are installed in the user's environment. The first time it is run, this function caches its result in the variable ``_have_tkz_graph``, and any subsequent time, it just checks the value of the vari... | 044dfa0dd6926142545c076e530fd00c854ff72f /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/044dfa0dd6926142545c076e530fd00c854ff72f/graph_latex.py |
Digraph on 6 vertices | Hasse diagram of a poset containing 6 elements | def hasse_diagram(self): """ Returns the Hasse_diagram of the poset as a Sage DiGraph object. | a21db62153bd83b6d2f5d707b3ec83d29f0913a0 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a21db62153bd83b6d2f5d707b3ec83d29f0913a0/posets.py |
This function is equivalent to the plot command with the options | This function is equivalent to the :func:`plot` command with the options | def polar_plot(funcs, *args, **kwds): r""" ``polar_plot`` takes a single function or a list or tuple of functions and plots them with polar coordinates in the given domain. This function is equivalent to the plot command with the options ``polar=True`` and ``aspect_ratio=1``. For more help on options, see the document... | e8704144441e51daff947b932d908ec579b5116d /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/e8704144441e51daff947b932d908ec579b5116d/plot.py |
see the documentation for plot. | see the documentation for :func:`plot`. | def polar_plot(funcs, *args, **kwds): r""" ``polar_plot`` takes a single function or a list or tuple of functions and plots them with polar coordinates in the given domain. This function is equivalent to the plot command with the options ``polar=True`` and ``aspect_ratio=1``. For more help on options, see the document... | e8704144441e51daff947b932d908ec579b5116d /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/e8704144441e51daff947b932d908ec579b5116d/plot.py |
Some cases that check on the negative twists:: | Some harder cases fail:: | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
sage: m._scaling -2 | Warning : Could not normalize the modular symbols, maybe all further results will be multiplied by -1, 2 or -2. sage: m._scaling 1 | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
Dlist = [5,8,12,13,17,21,24,28,29] | Dlist = [5,8,12,13,17,21,24,28,29, 33, 37, 40, 41, 44, 53, 56, 57, 60, 61, 65, 69, 73, 76, 77, 85, 88, 89, 92, 93, 97] | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
while j < 9 and at0 == 0 : | while j < 30 and at0 == 0 : | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
chtw = True for ell in prime_divisors(D): chtw = chtw and ( valuation(E.conductor(),ell)<= valuation(D,ell) ) if chtw : | if all( valuation(E.conductor(),ell)<= valuation(D,ell) for ell in prime_divisors(D) ) : | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
if j == 9 and at0 == 0: sc = 1 if not self._use_eclib : msn = ModularSymbolSage(self._E,sign = -1,normalize = "L_ratio") sc = msn._scaling if sc == 0 or self._use_eclib : self.__scale_by_periods_only__() else : self._scaling = sc | if j == 30 and at0 == 0: self.__scale_by_periods_only__() | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
verbose('scale modular symbols by %s'%(l1/at0)) | verbose('scale modular symbols by %s found at D=%s '%(l1/at0,D), level=2) | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
Dlist = [-3,-4,-7,-8,-11,-15,-19,-20,-23,-24] | Dlist = [-3,-4,-7,-8,-11,-15,-19,-20,-23,-24, -31, -35, -39, -40, -43, -47, -51, -52, -55, -56, -59, -67, -68, -71, -79, -83, -84, -87, -88, -91] | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
while j < 9 and at0 == 0 : | while j < 30 and at0 == 0 : | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
chtw = True for ell in prime_divisors(D): chtw = chtw and ( valuation(E.conductor(),ell)<= valuation(D,ell) ) if chtw : | if all( valuation(E.conductor(),ell)<= valuation(D,ell) for ell in prime_divisors(D) ) : | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
if j == 9 and at0 == 0: | if j == 30 and at0 == 0: | def _find_scaling_L_ratio(self): r""" This function is use to set ``_scaling``, the factor used to adjust the scalar multiple of the modular symbol. If `[0]`, the modular symbol evaluated at 0, is non-zero, we can just scale it with respect to the approximation of the L-value. It is known that the quotient is a rationa... | cc08e5f448102949495f5379323ef5e18b443617 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/cc08e5f448102949495f5379323ef5e18b443617/ell_modular_symbols.py |
.. note:: Reference for the Sturm bound that we use in the definition of of this function: J. Sturm, On the congruence of modular forms, Number theory (New York, 1984-1985), Springer, Berlin, 1987, pp. 275-280. Useful Remark: | sage: CuspForms(Gamma1(144), 3).sturm_bound() 3457 sage: CuspForms(DirichletGroup(144).1^2, 3).sturm_bound() 73 sage: CuspForms(Gamma0(144), 3).sturm_bound() 73 REFERENCE: - [Sturm] J. Sturm, On the congruence of modular forms, Number theory (New York, 1984-1985), Springer, Berlin, 1987, pp. 275-280. NOTE:: | def sturm_bound(self, M=None): r""" For a space M of modular forms, this function returns an integer B such that two modular forms in either self or M are equal if and only if their q-expansions are equal to precision B (note that this is 1+ the usual Sturm bound, since `O(q^\mathrm{prec})` has precision prec). If M is... | 412e194cea4c008b97aeebadee7649b3e59c811a /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/412e194cea4c008b97aeebadee7649b3e59c811a/space.py |
`s \geq` the sturm bound for `\Gamma_0` at | `s \geq` the Sturm bound for `\Gamma_0` at | def sturm_bound(self, M=None): r""" For a space M of modular forms, this function returns an integer B such that two modular forms in either self or M are equal if and only if their q-expansions are equal to precision B (note that this is 1+ the usual Sturm bound, since `O(q^\mathrm{prec})` has precision prec). If M is... | 412e194cea4c008b97aeebadee7649b3e59c811a /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/412e194cea4c008b97aeebadee7649b3e59c811a/space.py |
self.__sturm_bound = self.group().sturm_bound(self.weight())+1 | self.__sturm_bound = G.sturm_bound(self.weight())+1 | def sturm_bound(self, M=None): r""" For a space M of modular forms, this function returns an integer B such that two modular forms in either self or M are equal if and only if their q-expansions are equal to precision B (note that this is 1+ the usual Sturm bound, since `O(q^\mathrm{prec})` has precision prec). If M is... | 412e194cea4c008b97aeebadee7649b3e59c811a /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/412e194cea4c008b97aeebadee7649b3e59c811a/space.py |
self.n = ZZ(max(S)+1).exact_log(2) | self.n = ZZ(max(S)).nbits() | def __init__(self, *args, **kwargs): """ Construct a substitution box (S-box) for a given lookup table `S`. | 5965f6007c9b021e3cddf50e3262a14ee5075c92 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/5965f6007c9b021e3cddf50e3262a14ee5075c92/sbox.py |
def valuation(m, p): """ The exact power of p that divides m. m should be an integer or rational (but maybe other types work too.) | def valuation(m,*args1, **args2): """ | def valuation(m, p): """ The exact power of p that divides m. m should be an integer or rational (but maybe other types work too.) This actually just calls the m.valuation() method. If m is 0, this function returns rings.infinity. EXAMPLES:: sage: valuation(512,2) 9 sage: valuation(1,2) 0 sage: valuation(5/9, 3) -... | 76a0604de79ca52be1fc292931b87b7541765f65 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/76a0604de79ca52be1fc292931b87b7541765f65/arith.py |
If m is 0, this function returns rings.infinity. | See the documentation of m.valuation() for a more precise description. Use of this function by developers is discouraged. Use m.valuation() instead. .. NOTE:: This is not always a valuation in the mathematical sense. For more information see: sage.rings.finite_rings.integer_mod.IntegerMod_int.valuation | def valuation(m, p): """ The exact power of p that divides m. m should be an integer or rational (but maybe other types work too.) This actually just calls the m.valuation() method. If m is 0, this function returns rings.infinity. EXAMPLES:: sage: valuation(512,2) 9 sage: valuation(1,2) 0 sage: valuation(5/9, 3) -... | 76a0604de79ca52be1fc292931b87b7541765f65 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/76a0604de79ca52be1fc292931b87b7541765f65/arith.py |
""" if hasattr(m, 'valuation'): return m.valuation(p) if m == 0: import sage.rings.all return sage.rings.all.infinity if is_FractionFieldElement(m): return valuation(m.numerator()) - valuation(m.denominator()) r = 0 power = p while not (m % power): r += 1 power *= p return r | sage: y = QQ['y'].gen() sage: valuation(y^3, y) 3 sage: x = QQ[['x']].gen() sage: valuation((x^3-x^2)/(x-4)) 2 sage: valuation(4r,2r) 2 """ if isinstance(m,(int,long)): m=ZZ(m) return m.valuation(*args1, **args2) | def valuation(m, p): """ The exact power of p that divides m. m should be an integer or rational (but maybe other types work too.) This actually just calls the m.valuation() method. If m is 0, this function returns rings.infinity. EXAMPLES:: sage: valuation(512,2) 9 sage: valuation(1,2) 0 sage: valuation(5/9, 3) -... | 76a0604de79ca52be1fc292931b87b7541765f65 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/76a0604de79ca52be1fc292931b87b7541765f65/arith.py |
Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | Returns the unique graph on \{0,1,...,n-1\} ( n = self.order() ) which - is isomorphic to self, - has canonical vertex labels, - allows only permutations of vertices respecting the input set partition (if given). Canonical here means that all graphs isomorphic to self (and respecting the input set partition) have the ... | def canonical_label(self, partition=None, certify=False, verbosity=0, edge_labels=False): """ Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2/generic_graph.py |
respect to this partition will be computed. The default is the unit partition. | respect to this set partition will be computed. The default is the unit set partition. | def canonical_label(self, partition=None, certify=False, verbosity=0, edge_labels=False): """ Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2/generic_graph.py |
b_new = {} | c_new = {} | def canonical_label(self, partition=None, certify=False, verbosity=0, edge_labels=False): """ Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2/generic_graph.py |
b_new[v] = c[G_to[('o',v)]] H.relabel(b_new) | c_new[v] = c[G_to[('o',v)]] H.relabel(c_new) | def canonical_label(self, partition=None, certify=False, verbosity=0, edge_labels=False): """ Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2/generic_graph.py |
return H, relabeling | return H, c_new | def canonical_label(self, partition=None, certify=False, verbosity=0, edge_labels=False): """ Returns the canonical label with respect to the partition. If no partition is given, uses the unit partition. | f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/f6e3eeeb2a8f2125bc5ebd98cba6b22480df83c2/generic_graph.py |
""" qE = self._q | sage: T = EllipticCurve('14').tate_curve(7) sage: T.E2(30) 2 + 4*7 + 7^2 + 3*7^3 + 6*7^4 + 5*7^5 + 2*7^6 + 7^7 + 5*7^8 + 6*7^9 + 5*7^10 + 2*7^11 + 6*7^12 + 4*7^13 + 3*7^15 + 5*7^16 + 4*7^17 + 4*7^18 + 2*7^20 + 7^21 + 5*7^22 + 4*7^23 + 4*7^24 + 3*7^25 + 6*7^26 + 3*7^27 + 6*7^28 + O(7^30) """ | def E2(self,prec=20): r""" Returns the value of the `p`-adic Eisenstein series of weight 2 evaluated on the elliptic curve having split multiplicative reduction. | 2babbffd21a1ca4e0aaaae2c9113950b15207273 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/2babbffd21a1ca4e0aaaae2c9113950b15207273/ell_tate_curve.py |
if self._style == "coroots" and all(xv in ZZ for xv in x): | if self._style == "coroots" and isinstance(x, tuple) and all(xv in ZZ for xv in x): | def __call__(self, *args): """ Coerces the element into the ring. You may pass a vector in the ambient space, an element of the base_ring, or an argument list of integers (or half-integers for the spin types) which are the components of a vector in the ambient space. | 9f85fe1d7929cbc36adf7df38dde03d375dac9d2 /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/9f85fe1d7929cbc36adf7df38dde03d375dac9d2/weyl_characters.py |
and the fourth has no control points: path = [[p1, c1, c2, p2], [c3, c4, p3], [c5, p4], [p5], ...] | and the fourth has no control points:: path = [[p1, c1, c2, p2], [c3, c4, p3], [c5, p4], [p5], ...] | def bezier3d(path, **options): """ Draws a 3-dimensional bezier path. Input is similar to bezier_path, but each point in the path and each control point is required to have 3 coordinates. INPUT: - ``path`` - a list of curves, which each is a list of points. See further detail below. - ``thickness`` - (default: 2)... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
EXAMPLES: | EXAMPLES:: | def bezier3d(path, **options): """ Draws a 3-dimensional bezier path. Input is similar to bezier_path, but each point in the path and each control point is required to have 3 coordinates. INPUT: - ``path`` - a list of curves, which each is a list of points. See further detail below. - ``thickness`` - (default: 2)... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
To construct a simple curve, create a list containing a single list: | To construct a simple curve, create a list containing a single list:: | def bezier3d(path, **options): """ Draws a 3-dimensional bezier path. Input is similar to bezier_path, but each point in the path and each control point is required to have 3 coordinates. INPUT: - ``path`` - a list of curves, which each is a list of points. See further detail below. - ``thickness`` - (default: 2)... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
Draw a frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing. | Draw a frame in 3-D. Primarily used as a helper function for creating frames for 3-D graphics viewing. | def frame3d(lower_left, upper_right, **kwds): """ Draw a frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, ... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def frame3d(lower_left, upper_right, **kwds): """ Draw a frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, ... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def frame3d(lower_left, upper_right, **kwds): """ Draw a frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, ... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
Draw correct labels for a given frame in 3D. Primarily used as a helper function for creating frames for 3D graphics | Draw correct labels for a given frame in 3-D. Primarily used as a helper function for creating frames for 3-D graphics | def frame_labels(lower_left, upper_right, label_lower_left, label_upper_right, eps = 1, **kwds): """ Draw correct labels for a given frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing - do not use directly unless you know what you are doing! INPUT: - ``lower_left`` - the low... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def frame_labels(lower_left, upper_right, label_lower_left, label_upper_right, eps = 1, **kwds): """ Draw correct labels for a given frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing - do not use directly unless you know what you are doing! INPUT: - ``lower_left`` - the low... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def frame_labels(lower_left, upper_right, label_lower_left, label_upper_right, eps = 1, **kwds): """ Draw correct labels for a given frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing - do not use directly unless you know what you are doing! INPUT: - ``lower_left`` - the low... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
raise ValueError, "Ensure the upper right labels are above and to the right of the lower left labels." | raise ValueError("Ensure the upper right labels are above and to the right of the lower left labels.") | def frame_labels(lower_left, upper_right, label_lower_left, label_upper_right, eps = 1, **kwds): """ Draw correct labels for a given frame in 3D. Primarily used as a helper function for creating frames for 3D graphics viewing - do not use directly unless you know what you are doing! INPUT: - ``lower_left`` - the low... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
Draw a ruler in 3D, with major and minor ticks. | Draw a ruler in 3-D, with major and minor ticks. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
tuple, or vector | tuple, or vector. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
or vector | or vector. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
shown on the ruler | shown on the ruler. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
subdivisions between each major tick - ``absolute`` - (default: False) if True, makes a huge ruler in the direction of an axis - ``snap`` - (default: False) if True, snaps to an implied grid | subdivisions between each major tick. - ``absolute`` - (default: ``False``) if ``True``, makes a huge ruler in the direction of an axis. - ``snap`` - (default: ``False``) if ``True``, snaps to an implied grid. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
options for lines which are also available. | options for lines, which are also available. | def ruler(start, end, ticks=4, sub_ticks=4, absolute=False, snap=False, **kwds): """ Draw a ruler in 3D, with major and minor ticks. INPUT: - ``start`` - the beginning of the ruler, as a list, tuple, or vector - ``end`` - the end of the ruler, as a list, tuple, or vector - ``ticks`` - (default: 4) the number of maj... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
Draw a frame made of 3D rulers, with major and minor ticks. | Draw a frame made of 3-D rulers, with major and minor ticks. | def ruler_frame(lower_left, upper_right, ticks=4, sub_ticks=4, **kwds): """ Draw a frame made of 3D rulers, with major and minor ticks. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, or vector - ``t... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def ruler_frame(lower_left, upper_right, ticks=4, sub_ticks=4, **kwds): """ Draw a frame made of 3D rulers, with major and minor ticks. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, or vector - ``t... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
list, tuple, or vector | list, tuple, or vector. | def ruler_frame(lower_left, upper_right, ticks=4, sub_ticks=4, **kwds): """ Draw a frame made of 3D rulers, with major and minor ticks. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, or vector - ``t... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
shown on each ruler | shown on each ruler. | def ruler_frame(lower_left, upper_right, ticks=4, sub_ticks=4, **kwds): """ Draw a frame made of 3D rulers, with major and minor ticks. INPUT: - ``lower_left`` - the lower left corner of the frame, as a list, tuple, or vector - ``upper_right`` - the upper right corner of the frame, as a list, tuple, or vector - ``t... | a074a851cc2fcbb495453d24cda3b4b1c0b78eec /local1/tlutelli/issta_data/temp/all_python//python/2010_temp/2010/9417/a074a851cc2fcbb495453d24cda3b4b1c0b78eec/shapes2.py |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.