Shulou(Shulou.com)06/01 Report--

< root->

< nparts); rel->

< ncolumns; i++)//索引键 { info->

Indexkeys [I] = index- > indkey.values [I]; info- > canreturn [I] = index_can_return (indexRelation, I + 1);} for (I = 0; I

< nkeycolumns; i++)//索引键属性 { info->

Opfamily [I] = indexRelation- > rd_ family [I]; info- > opcintype [I] = indexRelation- > rd_ opcintype [I]; info- > indexcollations [I] = indexRelation- > rd_ indentation [I];} info- > relam = indexRelation- > rd_rel- > relam;//? / * We copy just the fields we need, not all of rd_amroutine * / amroutine = indexRelation- > rd_amroutine / / copy the information in IndexRelation info- > amcanorderbyop = amroutine- > amcanorderbyop; info- > amoptionalkey = amroutine- > amoptionalkey; info- > amsearcharray = amroutine- > amsearcharray; info- > amsearchnulls = amroutine- > amsearchnulls; info- > amcanparallel = amroutine- > amcanparallel; info- > amhasgettuple = (amroutine- > amgettuple! = NULL); info- > amhasgetbitmap = (amroutine- > amgetbitmap! = NULL); info- > amcostestimate = amroutine- > amcostestimate Assert (info- > amcostestimate! = NULL); / * Fetch the ordering information for the index, if any. * / if (info- > relam = = BTREE_AM_OID) / / BTree {/ * * If it's a btree index, we can use its opfamily OIDs * directly as the sort ordering opfamily OIDs. * / Assert (amroutine- > amcanorder); info- > sortopfamily = info- > opfamily; info- > reverse_sort = (bool *) palloc (sizeof (bool) * nkeycolumns); info- > nulls_first = (bool *) palloc (sizeof (bool) * nkeycolumns); for (I = 0; I

< nkeycolumns; i++) { int16 opt = indexRelation->

Rd_ indentation [I]; info- > reverse_ sort [I] = (opt & INDOPTION_DESC)! = 0; info- > nulls_ first [I] = (opt & INDOPTION_NULLS_FIRST)! = 0 }} else if (amroutine- > amcanorder) / / sortable access methods {/ * * Otherwise, identify the corresponding btree opfamilies by * trying to map this index's "

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.