stelf

  
<objectdefs>
    <most module_alias="m" use_prefix="true">
      <protocol_return parent_objectdef="most.protocol_stock">
        <ref_sale>
          <category>most.related.protocols</category>
          <sort_id>189</sort_id>
          <data_source>relation</data_source>
          <is_obligatory>false</is_obligatory>
          <is_inmaintbl>true</is_inmaintbl>

stelf

for v in $(find . | egrep \\\.xml); do 
  xmlstarlet sel -t -c "//*[is_unique='false' and is_multiple='true']" $v; 
done

stelf

UPDATE 
    visionr.pv_m_itm iout
SET
    protocol_stock = (
        select 
            child_object 
        from 
            visionr.pv_m_rel_1_n 
        where 

stelf

#------------------------------------------------------------------------------
# CUSTOMIZED OPTIONS
#------------------------------------------------------------------------------
#
# this is from a Windows Server 2008 
# with 2 drives in SAS array
# and 32 GB of memory

# memory consumption

stelf

create or replace function update_all_seqs(inc integer) returns void as $$
DECLARE
    r pg_class%rowtype;
    i name;
    isit integer;
BEGIN 
	FOR i in SELECT c.relname from pg_class c where c.relkind = 'S' LOOP
		isit := POSITION('pv_' in i);
		IF (isit = 1) THEN 
			execute 'select last_value from visionr.' || i into isit;

stelf

// rpn.cpp : micro example of RPN calculator
//

#include "stdafx.h"
#include <stack>
#include <iostream>

using namespace std;

char * rpns[] = {

stelf

// Infite stream implementation with Basic promises.

// inspired by
// http://perl.plover.com/Stream/stream.html#streams

var Stream = function(_head, _tail) {
    this.h = _head;
    this.t = _tail;
};

stelf

(function() {
  var aval = 'val';
  var res = [];
  
  Q.longStackSupport = true;

    console.log('start dfs');
  
  function dfs(elem, level) {
    console.log('ENTER: ' + elem.tagName + ' level: ' + level + ' elem has ' + elem.childNodes.length + ' children');