about summary refs log tree commit diff
path: root/sourcecodes/bnt-master/BNT/@assocarray/subsref.m
diff options
context:
space:
mode:
authorziejd22018-03-14 23:23:33 -0500
committerGitHub2018-03-14 23:23:33 -0500
commit1ff6baa44e22b91eefb48aea6f3befa078c0489b (patch)
treee0fd79d2e32fd2aedda2eadaed0f19af3514c520 /sourcecodes/bnt-master/BNT/@assocarray/subsref.m
parent6882395afdadf4e982b25b5215071a0932730950 (diff)
parentc80226899f5cdd9f11c163817d59445213f5bef0 (diff)
downloadBNW-1ff6baa44e22b91eefb48aea6f3befa078c0489b.tar.gz
Merge pull request #1 from ziejd2/octave_php_separate
Octave php separate
Diffstat (limited to 'sourcecodes/bnt-master/BNT/@assocarray/subsref.m')
-rw-r--r--sourcecodes/bnt-master/BNT/@assocarray/subsref.m15
1 files changed, 15 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/BNT/@assocarray/subsref.m b/sourcecodes/bnt-master/BNT/@assocarray/subsref.m
new file mode 100644
index 00000000..12673106
--- /dev/null
+++ b/sourcecodes/bnt-master/BNT/@assocarray/subsref.m
@@ -0,0 +1,15 @@
+function val = subsref(A, S)
+% SUBSREF Subscript reference for an associative array
+% A('foo') will return the value associated with foo.
+% If there are multiple identicaly keys, the first match is returned.
+% Currently the search is sequential.
+
+i = 1;
+while i <= length(A.keys)
+  if strcmp(S.subs{1}, A.keys{i})
+    val = A.vals{i};
+    return;
+  end
+  i = i + 1;
+end
+error(['can''t find ' S.subs{1}])