Lines Matching defs:ns

31  * @ns:  a node-set
37 * xmlXPathNAN if @ns is NULL or empty or if one of the nodes
41 exsltMathMin (xmlNodeSetPtr ns) {
45 if ((ns == NULL) || (ns->nodeNr == 0))
47 ret = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
50 for (i = 1; i < ns->nodeNr; i++) {
51 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
69 xmlNodeSetPtr ns;
85 ns = xmlXPathPopNodeSet(ctxt);
89 ret = exsltMathMin(ns);
91 xmlXPathFreeNodeSet(ns);
100 * @ns: a node-set
106 * xmlXPathNAN if @ns is NULL or empty or if one of the nodes
110 exsltMathMax (xmlNodeSetPtr ns) {
114 if ((ns == NULL) || (ns->nodeNr == 0))
116 ret = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
119 for (i = 1; i < ns->nodeNr; i++) {
120 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
138 xmlNodeSetPtr ns;
153 ns = xmlXPathPopNodeSet(ctxt);
157 ret = exsltMathMax(ns);
159 xmlXPathFreeNodeSet(ns);
168 * @ns: a node-set
177 exsltMathHighest (xmlNodeSetPtr ns) {
182 if ((ns == NULL) || (ns->nodeNr == 0))
185 max = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
189 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[0]);
191 for (i = 1; i < ns->nodeNr; i++) {
192 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
202 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
205 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
219 xmlNodeSetPtr ns, ret;
233 ns = xmlXPathPopNodeSet(ctxt);
237 ret = exsltMathHighest(ns);
239 xmlXPathFreeNodeSet(ns);
248 * @ns: a node-set
257 exsltMathLowest (xmlNodeSetPtr ns) {
262 if ((ns == NULL) || (ns->nodeNr == 0))
265 min = xmlXPathCastNodeToNumber(ns->nodeTab[0]);
269 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[0]);
271 for (i = 1; i < ns->nodeNr; i++) {
272 cur = xmlXPathCastNodeToNumber(ns->nodeTab[i]);
282 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
285 xmlXPathNodeSetAddUnique(ret, ns->nodeTab[i]);
299 xmlNodeSetPtr ns, ret;
314 ns = xmlXPathPopNodeSet(ctxt);
318 ret = exsltMathLowest(ns);
320 xmlXPathFreeNodeSet(ns);