StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3255175
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-07-15T11:40:05.123
FavoriteCount
0
LastActivityDate
2010-07-15T12:18:06.030
LastEditDate
2010-07-15T12:18:06.030
LastEditorUserId
385378
OwnerUserId
385378
ParentId
3241070
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
I now have written an evaluator for your code, which addresses the circular reference problem, too. Use: <pre><code>$expression = new Evaluator($vars); $vars['a'] = 'This is a string'; // ... $vars['circular'] = '%ralucric'; $vars['ralucric'] = '%circular'; echo $expression->evaluate('%circular'); </code></pre> I use a <code>$this->stack</code> to handle circular references. (No idea what a stack actually is, I simply named it so ^^) <pre><code>class Evaluator { private $vars; private $stack = array(); private $inEval = false; public function __construct(&$vars) { $this->vars =& $vars; } public function evaluate($str) { // empty string if (!isset($str[0])) { return ''; } if ($str[0] == '^') { $this->inEval = true; ob_start(); eval('$str = ' . preg_replace_callback('#%(\w+)#', array($this, '_replace'), substr($str, 1)) . ';'); if ($error = ob_get_clean()) { throw new LogicException('Eval code failed: '.$error); } $this->inEval = false; } else { $str = preg_replace_callback('#%(\w+)#', array($this, '_replace'), $str); } return $str; } private function _replace(&$matches) { if (!isset($this->vars[$matches[1]])) { return $this->inEval ? 'null' : ''; } if (isset($this->stack[$matches[1]])) { throw new LogicException('Circular Reference detected!'); } $this->stack[$matches[1]] = true; $return = $this->evaluate($this->vars[$matches[1]]); unset($this->stack[$matches[1]]); return $this->inEval == false ? $return : '\'' . $return . '\''; } } </code></pre> Edit 1: I tested the maximum recursion depth for this script using this: <pre><code>$alphabet = 'abcdefghijklmnopqrstuvwxyzABCDEF'; // GHIJKLMNOPQRSTUVWXYZ $length = strlen($alphabet); $vars['a'] = 'Hallo World!'; for ($i = 1; $i < $length; ++$i) { $vars[$alphabet[$i]] = '%' . $alphabet[$i-1]; } var_dump($vars); $expression = new Evaluator($vars); echo $expression->evaluate('%' . $alphabet[$length - 1]); </code></pre> If another character is added to <code>$alphabet</code> maximum recursion depth of 100 is reached. (But probably you can modify this setting somewhere?)
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POPHP recursive variable replacement
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USNikiC
UserOwnerUserId
1. USNikiC
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.