1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML3.2 EN">
<HTML>
<HEAD> <link rel="canonical" href="http://www.mcs.anl.gov/petsc/petsc-current/docs/manualpages/DT/PetscDTIndexToGradedOrder.html" />
<META NAME="GENERATOR" CONTENT="DOCTEXT">
<TITLE>PetscDTIndexToGradedOrder</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">
<div id="version" align=right><b>petsc-3.14.5 2021-03-03</b></div>
<div id="bugreport" align=right><a href="mailto:petsc-maint@mcs.anl.gov?subject=Typo or Error in Documentation &body=Please describe the typo or error in the documentation: petsc-3.14.5 v3.14.5 docs/manualpages/DT/PetscDTIndexToGradedOrder.html "><small>Report Typos and Errors</small></a></div>
<A NAME="PetscDTIndexToGradedOrder"><H1>PetscDTIndexToGradedOrder</H1></A>
convert an index into a tuple of monomial degrees in a graded order (that is, if the degree sum of tuple x is less than the degree sum of tuple y, then the index of x is smaller than the index of y)
<H3><FONT COLOR="#CC3333">Synopsis</FONT></H3>
<PRE>
#include "petscdt.h"
<A HREF="../Sys/PetscErrorCode.html#PetscErrorCode">PetscErrorCode</A> <A HREF="../DT/PetscDTIndexToGradedOrder.html#PetscDTIndexToGradedOrder">PetscDTIndexToGradedOrder</A>(<A HREF="../Sys/PetscInt.html#PetscInt">PetscInt</A> len, <A HREF="../Sys/PetscInt.html#PetscInt">PetscInt</A> index, <A HREF="../Sys/PetscInt.html#PetscInt">PetscInt</A> degtup[])
</PRE>
<H3><FONT COLOR="#CC3333">Input Parameters</FONT></H3>
<TABLE border="0" cellpadding="0" cellspacing="0">
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>len </B></TD><TD>- the desired length of the degree tuple
</TD></TR>
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>index </B></TD><TD>- the index to convert: should be >= 0
</TD></TR></TABLE>
<P>
<H3><FONT COLOR="#CC3333">Output Parameter</FONT></H3>
<TABLE border="0" cellpadding="0" cellspacing="0">
<TR><TD WIDTH=40></TD><TD ALIGN=LEFT VALIGN=TOP><B>degtup </B></TD><TD>- will be filled with a tuple of degrees
</TD></TR></TABLE>
<P>
<P>
Note: for two tuples x and y with the same degree sum, partial degree sums over the final elements of the tuples
acts as a tiebreaker. For example, (2, 1, 1) and (1, 2, 1) have the same degree sum, but the degree sum over the
last two elements is smaller for the former, so (2, 1, 1) < (1, 2, 1).
<P>
<H3><FONT COLOR="#CC3333">See Also</FONT></H3>
<A HREF="../DT/PetscDTGradedOrderToIndex.html#PetscDTGradedOrderToIndex">PetscDTGradedOrderToIndex</A>()
<BR><P><B></B><H3><FONT COLOR="#CC3333">Level</FONT></H3>beginner<BR>
<H3><FONT COLOR="#CC3333">Location</FONT></H3>
</B><A HREF="../../../src/dm/dt/interface/dt.c.html#PetscDTIndexToGradedOrder">src/dm/dt/interface/dt.c</A>
<BR><A HREF="./index.html">Index of all DT routines</A>
<BR><A HREF="../../index.html">Table of Contents for all manual pages</A>
<BR><A HREF="../singleindex.html">Index of all manual pages</A>
</BODY></HTML>
|
