{"diffoscope-json-version": 1, "source1": "/srv/reproducible-results/rbuild-debian/r-b-build.mUSzJuWA/b1/opensubdiv_3.6.0-1_arm64.changes", "source2": "/srv/reproducible-results/rbuild-debian/r-b-build.mUSzJuWA/b2/opensubdiv_3.6.0-1_arm64.changes", "unified_diff": null, "details": [{"source1": "Files", "source2": "Files", "unified_diff": "@@ -1,9 +1,9 @@\n \n c9d985297a737f159ce593cbb625b0ab 153028 libdevel optional libosd-dev_3.6.0-1_arm64.deb\n- 5d5eafc6305fabae1c748779f2f7446e 31492544 doc optional libosd-doc_3.6.0-1_all.deb\n+ 4e8d16f8bc3bc69b9e27e970c05e67c2 31492948 doc optional libosd-doc_3.6.0-1_all.deb\n 7d0d25c3dc120889dcb6a6c86460c869 3441888 debug optional libosdcpu3.6.0-dbgsym_3.6.0-1_arm64.deb\n 3010f305417042b95bda138f00bc238d 290472 libs optional libosdcpu3.6.0_3.6.0-1_arm64.deb\n 0d7ae88ec9aaf7da66d629da13d51c8e 530876 debug optional libosdgpu3.6.0-dbgsym_3.6.0-1_arm64.deb\n bd5dccfc524483da3f332066ade1dc91 133204 libs optional libosdgpu3.6.0_3.6.0-1_arm64.deb\n 8b6af4bbb0debb4870df5a59331a447b 11990944 debug optional opensubdiv-tools-dbgsym_3.6.0-1_arm64.deb\n 69c37aca41d450a6e21c768275210c6a 566908 graphics optional opensubdiv-tools_3.6.0-1_arm64.deb\n"}, {"source1": "libosd-doc_3.6.0-1_all.deb", "source2": "libosd-doc_3.6.0-1_all.deb", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -1,3 +1,3 @@\n -rw-r--r-- 0 0 0 4 2024-01-06 14:18:14.000000 debian-binary\n--rw-r--r-- 0 0 0 25472 2024-01-06 14:18:14.000000 control.tar.xz\n--rw-r--r-- 0 0 0 31466880 2024-01-06 14:18:14.000000 data.tar.xz\n+-rw-r--r-- 0 0 0 25488 2024-01-06 14:18:14.000000 control.tar.xz\n+-rw-r--r-- 0 0 0 31467268 2024-01-06 14:18:14.000000 data.tar.xz\n"}, {"source1": "control.tar.xz", "source2": "control.tar.xz", "unified_diff": null, "details": [{"source1": "control.tar", "source2": "control.tar", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "unified_diff": null, "details": [{"source1": "./md5sums", "source2": "./md5sums", "comments": ["Files differ"], "unified_diff": null}, {"source1": "line order", "source2": "line order", "unified_diff": "@@ -47,17 +47,17 @@\n usr/share/doc/opensubdiv/doxy_html/a00692_source.html\n usr/share/doc/opensubdiv/doxy_html/a00695.html\n usr/share/doc/opensubdiv/doxy_html/a00695.js\n usr/share/doc/opensubdiv/doxy_html/a00695_source.html\n usr/share/doc/opensubdiv/doxy_html/a00698.html\n usr/share/doc/opensubdiv/doxy_html/a00698.js\n usr/share/doc/opensubdiv/doxy_html/a00698_source.html\n-usr/share/doc/opensubdiv/doxy_html/a00701.html\n-usr/share/doc/opensubdiv/doxy_html/a00701.js\n-usr/share/doc/opensubdiv/doxy_html/a00701_source.html\n+usr/share/doc/opensubdiv/doxy_html/a00704.html\n+usr/share/doc/opensubdiv/doxy_html/a00704.js\n+usr/share/doc/opensubdiv/doxy_html/a00704_source.html\n usr/share/doc/opensubdiv/doxy_html/a00707.html\n usr/share/doc/opensubdiv/doxy_html/a00707.js\n usr/share/doc/opensubdiv/doxy_html/a00707_source.html\n usr/share/doc/opensubdiv/doxy_html/a00710.html\n usr/share/doc/opensubdiv/doxy_html/a00710.js\n usr/share/doc/opensubdiv/doxy_html/a00710_source.html\n usr/share/doc/opensubdiv/doxy_html/a00713.html\n@@ -115,17 +115,17 @@\n usr/share/doc/opensubdiv/doxy_html/a00770_source.html\n usr/share/doc/opensubdiv/doxy_html/a00773.html\n usr/share/doc/opensubdiv/doxy_html/a00773.js\n usr/share/doc/opensubdiv/doxy_html/a00773_source.html\n usr/share/doc/opensubdiv/doxy_html/a00776.html\n usr/share/doc/opensubdiv/doxy_html/a00776_source.html\n usr/share/doc/opensubdiv/doxy_html/a00779.html\n+usr/share/doc/opensubdiv/doxy_html/a00779.js\n usr/share/doc/opensubdiv/doxy_html/a00779_source.html\n usr/share/doc/opensubdiv/doxy_html/a00782.html\n-usr/share/doc/opensubdiv/doxy_html/a00782.js\n usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n usr/share/doc/opensubdiv/doxy_html/a00785.html\n usr/share/doc/opensubdiv/doxy_html/a00785_source.html\n usr/share/doc/opensubdiv/doxy_html/a00788.html\n usr/share/doc/opensubdiv/doxy_html/a00788.js\n usr/share/doc/opensubdiv/doxy_html/a00788_source.html\n usr/share/doc/opensubdiv/doxy_html/a00791.html\n"}]}]}]}, {"source1": "data.tar.xz", "source2": "data.tar.xz", "unified_diff": null, "details": [{"source1": "data.tar", "source2": "data.tar", "unified_diff": null, "details": [{"source1": "file list", "source2": "file list", "unified_diff": "@@ -27,20 +27,20 @@\n -rw-r--r-- 0 root (0) root (0) 1660 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/css/doxy.css\n -rw-r--r-- 0 root (0) root (0) 27698 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/css/flavor.css\n -rw-r--r-- 0 root (0) root (0) 5321 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/css/pygments.css\n -rw-r--r-- 0 root (0) root (0) 3011 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/css/renderman-university.css\n -rw-r--r-- 0 root (0) root (0) 12971 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/css/rst.css\n -rw-r--r-- 0 root (0) root (0) 14561 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/downloads.html\n drwxr-xr-x 0 root (0) root (0) 0 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/\n--rw-r--r-- 0 root (0) root (0) 7384 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.html\n--rw-r--r-- 0 root (0) root (0) 109 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.js\n--rw-r--r-- 0 root (0) root (0) 65515 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674_source.html\n--rw-r--r-- 0 root (0) root (0) 6575 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.html\n--rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.js\n--rw-r--r-- 0 root (0) root (0) 76686 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677_source.html\n+-rw-r--r-- 0 root (0) root (0) 6575 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.html\n+-rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674.js\n+-rw-r--r-- 0 root (0) root (0) 76686 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00674_source.html\n+-rw-r--r-- 0 root (0) root (0) 7384 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.html\n+-rw-r--r-- 0 root (0) root (0) 109 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677.js\n+-rw-r--r-- 0 root (0) root (0) 65515 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00677_source.html\n -rw-r--r-- 0 root (0) root (0) 7310 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.html\n -rw-r--r-- 0 root (0) root (0) 195 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680.js\n -rw-r--r-- 0 root (0) root (0) 27166 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00680_source.html\n -rw-r--r-- 0 root (0) root (0) 6557 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.html\n -rw-r--r-- 0 root (0) root (0) 78 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683.js\n -rw-r--r-- 0 root (0) root (0) 35227 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00683_source.html\n -rw-r--r-- 0 root (0) root (0) 7503 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00686.html\n@@ -54,53 +54,53 @@\n -rw-r--r-- 0 root (0) root (0) 40417 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00692_source.html\n -rw-r--r-- 0 root (0) root (0) 6435 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.html\n -rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695.js\n -rw-r--r-- 0 root (0) root (0) 45701 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00695_source.html\n -rw-r--r-- 0 root (0) root (0) 6386 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698.html\n -rw-r--r-- 0 root (0) root (0) 55 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698.js\n -rw-r--r-- 0 root (0) root (0) 14298 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00698_source.html\n--rw-r--r-- 0 root (0) root (0) 7836 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00701.html\n--rw-r--r-- 0 root (0) root (0) 190 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00701.js\n--rw-r--r-- 0 root (0) root (0) 147346 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00701_source.html\n--rw-r--r-- 0 root (0) root (0) 8006 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.html\n--rw-r--r-- 0 root (0) root (0) 171 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.js\n--rw-r--r-- 0 root (0) root (0) 74097 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707_source.html\n--rw-r--r-- 0 root (0) root (0) 6697 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.html\n--rw-r--r-- 0 root (0) root (0) 66 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.js\n--rw-r--r-- 0 root (0) root (0) 66667 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710_source.html\n--rw-r--r-- 0 root (0) root (0) 7135 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.html\n--rw-r--r-- 0 root (0) root (0) 119 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.js\n--rw-r--r-- 0 root (0) root (0) 38038 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713_source.html\n--rw-r--r-- 0 root (0) root (0) 9467 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.html\n--rw-r--r-- 0 root (0) root (0) 404 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.js\n--rw-r--r-- 0 root (0) root (0) 84413 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716_source.html\n--rw-r--r-- 0 root (0) root (0) 9922 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.html\n--rw-r--r-- 0 root (0) root (0) 456 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.js\n--rw-r--r-- 0 root (0) root (0) 177058 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719_source.html\n--rw-r--r-- 0 root (0) root (0) 6562 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.html\n--rw-r--r-- 0 root (0) root (0) 64 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.js\n--rw-r--r-- 0 root (0) root (0) 19419 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722_source.html\n--rw-r--r-- 0 root (0) root (0) 7812 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.html\n--rw-r--r-- 0 root (0) root (0) 163 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.js\n--rw-r--r-- 0 root (0) root (0) 67818 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725_source.html\n--rw-r--r-- 0 root (0) root (0) 8222 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.html\n--rw-r--r-- 0 root (0) root (0) 130 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.js\n--rw-r--r-- 0 root (0) root (0) 212260 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728_source.html\n--rw-r--r-- 0 root (0) root (0) 7335 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.html\n--rw-r--r-- 0 root (0) root (0) 111 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.js\n--rw-r--r-- 0 root (0) root (0) 167870 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731_source.html\n--rw-r--r-- 0 root (0) root (0) 6744 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.html\n--rw-r--r-- 0 root (0) root (0) 103 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.js\n--rw-r--r-- 0 root (0) root (0) 42246 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734_source.html\n--rw-r--r-- 0 root (0) root (0) 7303 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737.html\n--rw-r--r-- 0 root (0) root (0) 160 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737.js\n--rw-r--r-- 0 root (0) root (0) 53847 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737_source.html\n--rw-r--r-- 0 root (0) root (0) 8123 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740.html\n--rw-r--r-- 0 root (0) root (0) 314 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740.js\n--rw-r--r-- 0 root (0) root (0) 50493 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740_source.html\n+-rw-r--r-- 0 root (0) root (0) 8006 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704.html\n+-rw-r--r-- 0 root (0) root (0) 171 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704.js\n+-rw-r--r-- 0 root (0) root (0) 74097 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00704_source.html\n+-rw-r--r-- 0 root (0) root (0) 6697 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.html\n+-rw-r--r-- 0 root (0) root (0) 66 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707.js\n+-rw-r--r-- 0 root (0) root (0) 66667 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00707_source.html\n+-rw-r--r-- 0 root (0) root (0) 7836 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.html\n+-rw-r--r-- 0 root (0) root (0) 190 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710.js\n+-rw-r--r-- 0 root (0) root (0) 147346 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00710_source.html\n+-rw-r--r-- 0 root (0) root (0) 9922 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.html\n+-rw-r--r-- 0 root (0) root (0) 456 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713.js\n+-rw-r--r-- 0 root (0) root (0) 177058 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00713_source.html\n+-rw-r--r-- 0 root (0) root (0) 7135 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.html\n+-rw-r--r-- 0 root (0) root (0) 119 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716.js\n+-rw-r--r-- 0 root (0) root (0) 38038 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00716_source.html\n+-rw-r--r-- 0 root (0) root (0) 9467 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.html\n+-rw-r--r-- 0 root (0) root (0) 404 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719.js\n+-rw-r--r-- 0 root (0) root (0) 84413 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00719_source.html\n+-rw-r--r-- 0 root (0) root (0) 8222 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.html\n+-rw-r--r-- 0 root (0) root (0) 130 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722.js\n+-rw-r--r-- 0 root (0) root (0) 212260 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00722_source.html\n+-rw-r--r-- 0 root (0) root (0) 6562 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.html\n+-rw-r--r-- 0 root (0) root (0) 64 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725.js\n+-rw-r--r-- 0 root (0) root (0) 19419 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00725_source.html\n+-rw-r--r-- 0 root (0) root (0) 7812 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.html\n+-rw-r--r-- 0 root (0) root (0) 163 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728.js\n+-rw-r--r-- 0 root (0) root (0) 67818 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00728_source.html\n+-rw-r--r-- 0 root (0) root (0) 6744 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.html\n+-rw-r--r-- 0 root (0) root (0) 103 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731.js\n+-rw-r--r-- 0 root (0) root (0) 42246 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00731_source.html\n+-rw-r--r-- 0 root (0) root (0) 7335 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.html\n+-rw-r--r-- 0 root (0) root (0) 111 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734.js\n+-rw-r--r-- 0 root (0) root (0) 167870 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00734_source.html\n+-rw-r--r-- 0 root (0) root (0) 8123 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737.html\n+-rw-r--r-- 0 root (0) root (0) 314 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737.js\n+-rw-r--r-- 0 root (0) root (0) 50493 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00737_source.html\n+-rw-r--r-- 0 root (0) root (0) 7303 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740.html\n+-rw-r--r-- 0 root (0) root (0) 160 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740.js\n+-rw-r--r-- 0 root (0) root (0) 53847 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00740_source.html\n -rw-r--r-- 0 root (0) root (0) 11426 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00743.html\n -rw-r--r-- 0 root (0) root (0) 1173 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00743.js\n -rw-r--r-- 0 root (0) root (0) 22910 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00743_source.html\n -rw-r--r-- 0 root (0) root (0) 5643 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00746.html\n -rw-r--r-- 0 root (0) root (0) 38293 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00746_source.html\n -rw-r--r-- 0 root (0) root (0) 5898 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00749.html\n -rw-r--r-- 0 root (0) root (0) 22112 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00749_source.html\n@@ -121,19 +121,19 @@\n -rw-r--r-- 0 root (0) root (0) 130 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00770.js\n -rw-r--r-- 0 root (0) root (0) 135866 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00770_source.html\n -rw-r--r-- 0 root (0) root (0) 6297 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00773.html\n -rw-r--r-- 0 root (0) root (0) 60 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00773.js\n -rw-r--r-- 0 root (0) root (0) 38673 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00773_source.html\n -rw-r--r-- 0 root (0) root (0) 5826 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00776.html\n -rw-r--r-- 0 root (0) root (0) 100441 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00776_source.html\n--rw-r--r-- 0 root (0) root (0) 5835 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779.html\n--rw-r--r-- 0 root (0) root (0) 89789 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779_source.html\n--rw-r--r-- 0 root (0) root (0) 6473 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782.html\n--rw-r--r-- 0 root (0) root (0) 59 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782.js\n--rw-r--r-- 0 root (0) root (0) 53912 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n+-rw-r--r-- 0 root (0) root (0) 6473 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779.html\n+-rw-r--r-- 0 root (0) root (0) 59 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779.js\n+-rw-r--r-- 0 root (0) root (0) 53912 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00779_source.html\n+-rw-r--r-- 0 root (0) root (0) 5835 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782.html\n+-rw-r--r-- 0 root (0) root (0) 89789 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00782_source.html\n -rw-r--r-- 0 root (0) root (0) 5752 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785.html\n -rw-r--r-- 0 root (0) root (0) 38296 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00785_source.html\n -rw-r--r-- 0 root (0) root (0) 6806 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788.html\n -rw-r--r-- 0 root (0) root (0) 67 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788.js\n -rw-r--r-- 0 root (0) root (0) 33909 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00788_source.html\n -rw-r--r-- 0 root (0) root (0) 7124 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791.html\n -rw-r--r-- 0 root (0) root (0) 115 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00791.js\n@@ -142,62 +142,62 @@\n -rw-r--r-- 0 root (0) root (0) 67 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794.js\n -rw-r--r-- 0 root (0) root (0) 23840 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00794_source.html\n -rw-r--r-- 0 root (0) root (0) 4477 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797.html\n -rw-r--r-- 0 root (0) root (0) 10582 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00797_source.html\n -rw-r--r-- 0 root (0) root (0) 6896 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800.html\n -rw-r--r-- 0 root (0) root (0) 65 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800.js\n -rw-r--r-- 0 root (0) root (0) 34222 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00800_source.html\n--rw-r--r-- 0 root (0) root (0) 7173 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.html\n--rw-r--r-- 0 root (0) root (0) 115 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.js\n--rw-r--r-- 0 root (0) root (0) 252039 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803_source.html\n--rw-r--r-- 0 root (0) root (0) 6160 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.html\n--rw-r--r-- 0 root (0) root (0) 63 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.js\n--rw-r--r-- 0 root (0) root (0) 14082 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806_source.html\n+-rw-r--r-- 0 root (0) root (0) 6160 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.html\n+-rw-r--r-- 0 root (0) root (0) 63 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803.js\n+-rw-r--r-- 0 root (0) root (0) 14082 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00803_source.html\n+-rw-r--r-- 0 root (0) root (0) 7173 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.html\n+-rw-r--r-- 0 root (0) root (0) 115 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806.js\n+-rw-r--r-- 0 root (0) root (0) 252039 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00806_source.html\n -rw-r--r-- 0 root (0) root (0) 6498 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.html\n -rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809.js\n -rw-r--r-- 0 root (0) root (0) 21924 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00809_source.html\n -rw-r--r-- 0 root (0) root (0) 6579 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.html\n -rw-r--r-- 0 root (0) root (0) 99 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812.js\n -rw-r--r-- 0 root (0) root (0) 12708 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00812_source.html\n--rw-r--r-- 0 root (0) root (0) 6451 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.html\n--rw-r--r-- 0 root (0) root (0) 79 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.js\n--rw-r--r-- 0 root (0) root (0) 25441 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815_source.html\n--rw-r--r-- 0 root (0) root (0) 6817 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.html\n--rw-r--r-- 0 root (0) root (0) 66 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.js\n--rw-r--r-- 0 root (0) root (0) 35393 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818_source.html\n+-rw-r--r-- 0 root (0) root (0) 6817 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.html\n+-rw-r--r-- 0 root (0) root (0) 66 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815.js\n+-rw-r--r-- 0 root (0) root (0) 35393 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00815_source.html\n+-rw-r--r-- 0 root (0) root (0) 6451 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.html\n+-rw-r--r-- 0 root (0) root (0) 79 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818.js\n+-rw-r--r-- 0 root (0) root (0) 25441 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00818_source.html\n -rw-r--r-- 0 root (0) root (0) 7051 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821.html\n -rw-r--r-- 0 root (0) root (0) 124 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821.js\n -rw-r--r-- 0 root (0) root (0) 223873 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00821_source.html\n--rw-r--r-- 0 root (0) root (0) 6508 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.html\n--rw-r--r-- 0 root (0) root (0) 70 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.js\n--rw-r--r-- 0 root (0) root (0) 18295 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824_source.html\n--rw-r--r-- 0 root (0) root (0) 6245 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.html\n--rw-r--r-- 0 root (0) root (0) 71 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.js\n--rw-r--r-- 0 root (0) root (0) 22525 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827_source.html\n--rw-r--r-- 0 root (0) root (0) 6591 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.html\n--rw-r--r-- 0 root (0) root (0) 101 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.js\n--rw-r--r-- 0 root (0) root (0) 12825 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830_source.html\n+-rw-r--r-- 0 root (0) root (0) 6245 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.html\n+-rw-r--r-- 0 root (0) root (0) 71 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824.js\n+-rw-r--r-- 0 root (0) root (0) 22525 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00824_source.html\n+-rw-r--r-- 0 root (0) root (0) 6591 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.html\n+-rw-r--r-- 0 root (0) root (0) 101 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827.js\n+-rw-r--r-- 0 root (0) root (0) 12825 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00827_source.html\n+-rw-r--r-- 0 root (0) root (0) 6508 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.html\n+-rw-r--r-- 0 root (0) root (0) 70 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830.js\n+-rw-r--r-- 0 root (0) root (0) 18295 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00830_source.html\n -rw-r--r-- 0 root (0) root (0) 6357 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833.html\n -rw-r--r-- 0 root (0) root (0) 70 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833.js\n -rw-r--r-- 0 root (0) root (0) 22932 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00833_source.html\n -rw-r--r-- 0 root (0) root (0) 6765 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836.html\n -rw-r--r-- 0 root (0) root (0) 68 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836.js\n -rw-r--r-- 0 root (0) root (0) 27920 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00836_source.html\n -rw-r--r-- 0 root (0) root (0) 6356 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839.html\n -rw-r--r-- 0 root (0) root (0) 81 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839.js\n -rw-r--r-- 0 root (0) root (0) 26983 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00839_source.html\n--rw-r--r-- 0 root (0) root (0) 7016 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.html\n--rw-r--r-- 0 root (0) root (0) 128 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.js\n--rw-r--r-- 0 root (0) root (0) 49760 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842_source.html\n--rw-r--r-- 0 root (0) root (0) 6409 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.html\n--rw-r--r-- 0 root (0) root (0) 73 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.js\n--rw-r--r-- 0 root (0) root (0) 22722 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845_source.html\n--rw-r--r-- 0 root (0) root (0) 7224 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.html\n--rw-r--r-- 0 root (0) root (0) 126 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.js\n--rw-r--r-- 0 root (0) root (0) 224156 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848_source.html\n+-rw-r--r-- 0 root (0) root (0) 6409 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.html\n+-rw-r--r-- 0 root (0) root (0) 73 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842.js\n+-rw-r--r-- 0 root (0) root (0) 22722 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00842_source.html\n+-rw-r--r-- 0 root (0) root (0) 7224 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.html\n+-rw-r--r-- 0 root (0) root (0) 126 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845.js\n+-rw-r--r-- 0 root (0) root (0) 224156 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00845_source.html\n+-rw-r--r-- 0 root (0) root (0) 7016 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.html\n+-rw-r--r-- 0 root (0) root (0) 128 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848.js\n+-rw-r--r-- 0 root (0) root (0) 49760 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00848_source.html\n -rw-r--r-- 0 root (0) root (0) 7198 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851.html\n -rw-r--r-- 0 root (0) root (0) 121 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851.js\n -rw-r--r-- 0 root (0) root (0) 239107 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00851_source.html\n -rw-r--r-- 0 root (0) root (0) 6508 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854.html\n -rw-r--r-- 0 root (0) root (0) 70 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854.js\n -rw-r--r-- 0 root (0) root (0) 18617 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00854_source.html\n -rw-r--r-- 0 root (0) root (0) 6573 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00857.html\n@@ -234,20 +234,20 @@\n -rw-r--r-- 0 root (0) root (0) 182424 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00887_source.html\n -rw-r--r-- 0 root (0) root (0) 6369 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00890.html\n -rw-r--r-- 0 root (0) root (0) 68 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00890.js\n -rw-r--r-- 0 root (0) root (0) 19253 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00890_source.html\n -rw-r--r-- 0 root (0) root (0) 6910 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00893.html\n -rw-r--r-- 0 root (0) root (0) 66 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00893.js\n -rw-r--r-- 0 root (0) root (0) 44338 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00893_source.html\n--rw-r--r-- 0 root (0) root (0) 6380 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896.html\n--rw-r--r-- 0 root (0) root (0) 61 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896.js\n--rw-r--r-- 0 root (0) root (0) 110646 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896_source.html\n--rw-r--r-- 0 root (0) root (0) 6686 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899.html\n--rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899.js\n--rw-r--r-- 0 root (0) root (0) 27491 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899_source.html\n+-rw-r--r-- 0 root (0) root (0) 6686 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896.html\n+-rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896.js\n+-rw-r--r-- 0 root (0) root (0) 27491 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00896_source.html\n+-rw-r--r-- 0 root (0) root (0) 6380 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899.html\n+-rw-r--r-- 0 root (0) root (0) 61 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899.js\n+-rw-r--r-- 0 root (0) root (0) 110646 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00899_source.html\n -rw-r--r-- 0 root (0) root (0) 6374 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00902.html\n -rw-r--r-- 0 root (0) root (0) 69 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00902.js\n -rw-r--r-- 0 root (0) root (0) 20015 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00902_source.html\n -rw-r--r-- 0 root (0) root (0) 4658 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00905.html\n -rw-r--r-- 0 root (0) root (0) 71 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00905.js\n -rw-r--r-- 0 root (0) root (0) 5891 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00906.html\n -rw-r--r-- 0 root (0) root (0) 216 2024-01-06 14:18:14.000000 ./usr/share/doc/opensubdiv/doxy_html/a00906.js\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00674.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00674.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/tessellation.h File Reference\n+OpenSubdiv: opensubdiv/bfr/vertexDescriptor.h File Reference\n \n \n \n \n \n \n \n@@ -90,29 +90,26 @@\n \n \n \n
\n
\n Classes |\n Namespaces
\n-
tessellation.h File Reference
\n+
vertexDescriptor.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../bfr/parameterization.h"
\n+#include "../vtr/stackBuffer.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  Tessellation
 Encapsulates a specific tessellation pattern of a Parameterization. More...
 
class  Tessellation::Options
 Options configure a Tessellation to specify the nature of both its results and the structure of the coordinate and facet index arrays that its methods will populate. More...
class  VertexDescriptor
 Simple class used by subclasses of SurfaceFactory to describe a vertex. More...
 
\n \n \n \n \n@@ -121,13 +118,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-tessellation.h File Reference\n+vertexDescriptor.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-\u00a0 Encapsulates a specific tessellation pattern of a _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn.\n+class \u00a0 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+\u00a0 Simple class used by subclasses of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to describe a vertex.\n _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n- _\bO_\bp_\bt_\bi_\bo_\bn_\bs configure a _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn to specify the nature of both its\n-\u00a0 results and the structure of the coordinate and facet index arrays that\n- its methods will populate. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh\n+ * _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00674.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00674.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00674 = [\n- [\"Tessellation\", \"a00961.html\", \"a00961\"],\n- [\"Options\", \"a00965.html\", \"a00965\"]\n+ [\"VertexDescriptor\", \"a00969.html\", \"a00969\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00674_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00674_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/tessellation.h Source File\n+OpenSubdiv: opensubdiv/bfr/vertexDescriptor.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
tessellation.h
\n+
vertexDescriptor.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,281 +119,425 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_TESSELLATION_H
\n-
26#define OPENSUBDIV3_BFR_TESSELLATION_H
\n+
25#ifndef OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H
\n+
26#define OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../bfr/parameterization.h"
\n+
30#include "../vtr/stackBuffer.h"
\n
31
\n
32namespace OpenSubdiv {
\n
33namespace OPENSUBDIV_VERSION {
\n
34
\n
35namespace Bfr {
\n
36
\n-
\n-\n-
52public:
\n-
\n-
65 class Options {
\n-
66 public:
\n-
\n-
67 Options() : _preserveQuads(false), _facetSize4(false),
\n-
68 _coordStride(0), _facetStride(0) { }
\n-
\n-
69
\n-
72 Options & PreserveQuads(bool on);
\n-
74 bool PreserveQuads() const { return _preserveQuads; }
\n-
75
\n-
78 Options & SetFacetSize(int numIndices);
\n-
79 // @brief Return the number of indices per facet
\n-
80 int GetFacetSize() const { return 3 + (int)_facetSize4; }
\n-
81
\n-
83 Options & SetFacetStride(int stride);
\n-
85 int GetFacetStride() const { return _facetStride; }
\n-
86
\n-
88 Options & SetCoordStride(int stride);
\n-
90 int GetCoordStride() const { return _coordStride; }
\n-
91
\n-
92 private:
\n-
93 unsigned int _preserveQuads : 1;
\n-
94 unsigned int _facetSize4 : 1;
\n-
95
\n-
96 short _coordStride;
\n-
97 short _facetStride;
\n-
98 };
\n-
\n-
99
\n-
100public:
\n-
102
\n-
111
\n-
118 Tessellation(Parameterization const & p, int uniformRate,
\n-
119 Options const & options = Options());
\n-
120
\n-
158 Tessellation(Parameterization const & p, int numRates, int const rates[],
\n-
159 Options const & options = Options());
\n-
160
\n-
162 bool IsValid() const { return _isValid; }
\n-
163
\n-
165 Tessellation() = delete;
\n-
166
\n-
167 Tessellation(Tessellation const &) = delete;
\n-\n-\n-
171
\n-
173
\n-
177
\n-
179 Parameterization GetParameterization() const { return _param; }
\n-
180
\n-
182 int GetFaceSize() const { return _param.GetFaceSize(); }
\n-
183
\n-
185 int GetRates(int rates[]) const;
\n-
186
\n-
188 bool IsUniform() const { return _isUniform; }
\n-
190
\n-
192
\n+
50//
\n+
51// WIP - need to migrate some of these comments into Doxygen
\n+
52// - others will be moved to the external documentation
\n+
53//
\n+
54// It is used by subclasses of SurfaceFactory to provide a complete
\n+
55// topological description for each vertex of a face, i.e. invoked via
\n+
56// the virtual method:
\n+
57//
\n+
58// int populateFaceVertexDescriptor(Index baseFace,
\n+
59// int cornerVertex,
\n+
60// VertexDescriptor & v) const;
\n+
61//
\n+
62// Assignment of the full topology can be involved in the presence of
\n+
63// irregular faces, non-manifold topology or creasing around a vertex, but
\n+
64// many cases will be simple. For example, to specify a regular boundary
\n+
65// vertex of a Catmark mesh without any optional sharpness:
\n+
66//
\n+
67// int numIncidentFaces = 2;
\n+
68// bool vertexOnBoundary = true;
\n+
69//
\n+
70// vd.Initialize(numIncidentFaces);
\n+
71// vd.SetManifold(true);
\n+
72// vd.SetBoundary(vertexOnBoundary);
\n+
73// vd.ClearIncidentFaceSizes();
\n+
74// vd.Finalize();
\n+
75//
\n+
76// For a more general example, to assign a vertex of some valence whose
\n+
77// incident faces are of different sizes (e.g. required when triangles
\n+
78// appear around a vertex in an otherwise quad-dominant Catmark mesh):
\n+
79//
\n+
80// int numIncidentFaces = meshVertex.GetNumIncidentFaces();
\n+
81// bool vertexOnBoundary = meshVertex.IsBoundar();
\n+
82//
\n+
83// vd.Initialize(numIncidentFaces);
\n+
84// vd.SetManifold(true);
\n+
85// vd.SetBoundary(vertexOnBoundary);
\n+
86//
\n+
87// for (int i = 0; i < numIncidentFaces; ++i) {
\n+
88// vd.SetIncidentFaceSize(i, meshVertex.GetIncidentFaceSize(i));
\n+
89// }
\n+
90// vd.Finalize();
\n+
91//
\n+
92// These examples specify the incident faces as forming a manifold ring
\n+
93// (or half-ring) around the vertex, i.e. they can be specified as a
\n+
94// continuous, connected sequence in counter-clockwise order (and also
\n+
95// without degeneracies). In the case of a boundary vertex, the first
\n+
96// face must be on the leading edge of the boundary while the last is on
\n+
97// the trailing edge. For an interior vertex, which face is specified
\n+
98// first does not matter (since the set is periodic).
\n+
99//
\n+
100// In both cases, the location of the base face in this sequence -- the
\n+
101// face whose corner vertex is being described here -- must be specified
\n+
102// in the return value to populateFaceVertexDescriptor() (e.g. when a
\n+
103// boundary vertex has 3 incident faces, a return value of 0, 1 or 2
\n+
104// will indicate which is the base face).
\n+
105//
\n+
106// The corresponding methods to specify mesh control vertex indices (or
\n+
107// face-varying indices) complete the specification of the neighborhood:
\n+
108//
\n+
109// int getFaceCornerVertexIndices(Index baseFace, int cornerVertex,
\n+
110// Index vertexIndices[]) const;
\n+
111//
\n+
112// int getFaceCornerFVarValueIndices(Index baseFace, int cornerVertex,
\n+
113// Index fvarValueIndices[],
\n+
114// int fvarChannel) const;
\n+
115//
\n+
116// and are invoked by the Factory when needed.
\n+
117//
\n+
118// For each incident face, the indices for all vertices of that face are
\n+
119// to be specified (not the one-ring or some other subset). These indices
\n+
120// must also be specified in an orientation relative to the vertex, i.e.
\n+
121// for a vertex A and an incident face with face-vertices that may be
\n+
122// stored internally as {D, C, A, B}, they must be specified with A first
\n+
123// as {A, B, C, D}. This may seem a bit cumbersome, but it has clear
\n+
124// advantages when dealing with face-varying indices and unordered faces.
\n+
125//
\n+
126// More compact ways of specifying vertex indices for ordered, manifold
\n+
127// cases may be worth exploring in future, but face-varying indices and
\n+
128// non-manifold (unordered) vertices will always require such a full set,
\n+
129// so both methods will need to co-exist.
\n+
130//
\n+
\n+\n+
132public:
\n+
133 // The full declaration must be enclosed by calls to these methods:
\n+
134 //
\n+
135 // Note that vertex valences or face sizes in excess of those defined
\n+
136 // in Bfr::Limits (typically 16-bits) are not valid. When specifying
\n+
137 // values in excess of these limits, initialization will fail and/or
\n+
138 // the descriptor will be marked invalid and finalization will fail.
\n+
139 //
\n+
140
\n+
142
\n+
149
\n+
151 bool Initialize(int numIncidentFaces);
\n+
152
\n+
154 bool Finalize();
\n+
155
\n+
157 bool IsValid() const;
\n+
159
\n+
160 //
\n+
161 // WIP - need to migrate these comments into Doxygen
\n+
162 //
\n+
163 // Three groups of methods describe the topology around a vertex:
\n+
164 // - simple properties (vertex is a boundary, manifold, etc.)
\n+
165 // - sizes of incident faces (constant or size for each face)
\n+
166 // - sharpness of the vertex and its incident edges (optional)
\n+
167 //
\n+
168
\n+
169 // Manifold and boundary conditions:
\n+
170 //
\n+
171 // The manifold property is a strict condition but preferred for
\n+
172 // efficiency and is usually available from common connected mesh
\n+
173 // representations. When declaring the topology as "manifold",
\n+
174 // the Factory assumes the following:
\n+
175 //
\n+
176 // - all incident faces are "ordered" (counter-clockwise)
\n+
177 // - all incident faces are consistently oriented
\n+
178 // - all incident edges are non-degenerate
\n+
179 //
\n+
180 // If not certain that all of these conditions are met, it is best
\n+
181 // to not declare manifold -- leaving the Factory to make sense of
\n+
182 // the set of incident faces from the face-vertex indices that are
\n+
183 // provided elsewhere.
\n+
184 //
\n+
185
\n+
187
\n+
191
\n+
193 void SetManifold(bool isManifold);
\n+
194
\n+
196 void SetBoundary(bool isOnBoundary);
\n+
197
\n+
199 void SetIncidentFaceSize(int faceIndex, int faceSize);
\n+
200
\n+\n
203
\n-
205 int GetNumCoords() const { return _numInteriorPoints + _numBoundaryPoints; }
\n+
205 void SetVertexSharpness(float sharpness);
\n
206
\n-
208 int GetCoordStride() const { return _coordStride; }
\n+\n
209
\n-
211 int GetNumBoundaryCoords() const { return _numBoundaryPoints; }
\n-
212
\n-
214 int GetNumInteriorCoords() const { return _numInteriorPoints; }
\n-
215
\n-
218 int GetNumEdgeCoords(int edge) const { return _outerRates[edge] - 1; }
\n-
219
\n-
221 template <typename REAL>
\n-
222 int GetCoords(REAL coordTuples[]) const;
\n-
223
\n-
225 template <typename REAL>
\n-
226 int GetBoundaryCoords(REAL coordTuples[]) const;
\n-
227
\n-
229 template <typename REAL>
\n-
230 int GetInteriorCoords(REAL coordTuples[]) const;
\n-
231
\n-
233 template <typename REAL>
\n-
234 int GetVertexCoord(int vertex, REAL coordTuples[]) const;
\n-
235
\n-
238 template <typename REAL>
\n-
239 int GetEdgeCoords(int edge, REAL coordTuples[]) const;
\n-
241
\n-
243
\n-
253
\n-
255 int GetNumFacets() const { return _numFacets; }
\n-
256
\n-
258 int GetFacetSize() const { return _facetSize; }
\n-
259
\n-
261 int GetFacetStride() const { return _facetStride; }
\n-
262
\n-
264 int GetFacets(int facetTuples[]) const;
\n+
221 void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness);
\n+
222
\n+
238 void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp,
\n+
239 float trailingEdgeSharp);
\n+
240
\n+
242 void ClearEdgeSharpness();
\n+
244
\n+
246
\n+
251
\n+
253 bool IsManifold() const;
\n+
254
\n+
256 bool IsBoundary() const;
\n+
257
\n+
259 bool HasIncidentFaceSizes() const;
\n+
260
\n+
262 int GetIncidentFaceSize(int faceIndex) const;
\n+
263
\n+
265 bool HasVertexSharpness() const;
\n
266
\n-
268
\n-
283
\n-
285 void TransformFacetCoordIndices(int facetTuples[], int commonOffset);
\n-
286
\n-
289 void TransformFacetCoordIndices(int facetTuples[],
\n-
290 int const boundaryIndices[],
\n-
291 int interiorOffset);
\n-
292
\n-
294 void TransformFacetCoordIndices(int facetTuples[],
\n-
295 int const boundaryIndices[],
\n-
296 int const interiorIndices[]);
\n-
298
\n-
299private:
\n-
300 // Private initialization methods:
\n-
301 bool validateArguments(Parameterization const & p,
\n-
302 int nRates, int const rates[], Options const & options);
\n-
303
\n-
304 void initialize(Parameterization const & p,
\n-
305 int nRates, int const rates[], Options const & options);
\n-
306
\n-
307 void initializeDefaults();
\n-
308 int initializeRates(int nRates, int const rates[]);
\n-
309 void initializeInventoryForParamTri(int sumOfOuterRates);
\n-
310 void initializeInventoryForParamQuad(int sumOfOuterRates);
\n-
311 void initializeInventoryForParamQPoly(int sumOfOuterRates);
\n-
312
\n-
313private:
\n-
314 // Private members:
\n-
315 Parameterization _param;
\n-
316
\n-
317 unsigned short _isValid : 1;
\n-
318 unsigned short _isUniform : 1;
\n-
319 unsigned short _triangulate : 1;
\n-
320 unsigned short _singleFace : 1;
\n-
321 unsigned short _segmentedFace : 1;
\n-
322 unsigned short _triangleFan : 1;
\n-
323 unsigned short _splitQuad : 1;
\n-
324
\n-
325 short _facetSize;
\n-
326 int _facetStride;
\n-
327 int _coordStride;
\n-
328
\n-
329 int _numGivenRates;
\n-
330 int _numBoundaryPoints;
\n-
331 int _numInteriorPoints;
\n-
332 int _numFacets;
\n-
333
\n-
334 int _innerRates[2];
\n-
335 int* _outerRates;
\n-
336 int _outerRatesLocal[4];
\n-
337};
\n-
\n-
338
\n-
339//
\n-
340// Inline implementations:
\n-
341//
\n-\n-
\n-\n-
344 _preserveQuads = on;
\n-
345 return *this;
\n-
346}
\n-
\n-\n-
\n-\n-
349 _facetSize4 = (numIndices == 4);
\n-
350 return *this;
\n-
351}
\n-
\n-\n-
\n-\n-
354 _facetStride = (short) stride;
\n-
355 return *this;
\n-
356}
\n-
\n-\n-
\n-\n-
359 _coordStride = (short) stride;
\n-
360 return *this;
\n-
361}
\n-
\n-
362
\n-
363template <typename REAL>
\n-
364inline int
\n-
\n-
365Tessellation::GetVertexCoord(int vertex, REAL coord[]) const {
\n-
366 _param.GetVertexCoord(vertex, coord);
\n-
367 return 1;
\n-
368}
\n-
\n-
369
\n-
370template <typename REAL>
\n-
371inline int
\n-
\n-
372Tessellation::GetCoords(REAL coordTuples[]) const {
\n-
373 int nCoords = GetBoundaryCoords(coordTuples);
\n-
374 nCoords += GetInteriorCoords(coordTuples + nCoords * _coordStride);
\n-
375 return nCoords;
\n-
376}
\n-
\n-
377
\n-
378} // end namespace Bfr
\n-
379
\n-
380} // end namespace OPENSUBDIV_VERSION
\n-
381using namespace OPENSUBDIV_VERSION;
\n-
382
\n-
383} // end namespace OpenSubdiv
\n-
384
\n-
385#endif /* OPENSUBDIV3_BFR_TESSELLATION */
\n+
268 float GetVertexSharpness() const;
\n+
269
\n+
271 bool HasEdgeSharpness() const;
\n+
272
\n+
274 float GetManifoldEdgeSharpness(int edgeIndex) const;
\n+
275
\n+
277 void GetIncidentFaceEdgeSharpness(int faceIndex,
\n+
278 float * leadingEdgeSharp, float * trailingEdgeSharp) const;
\n+
280
\n+
281protected:
\n+
283 friend class FaceVertex;
\n+
284
\n+
285 VertexDescriptor() { }
\n+\n+
287
\n+
288 typedef Vtr::internal::StackBuffer<int,8,true> IntBuffer;
\n+
289 typedef Vtr::internal::StackBuffer<float,16,true> FloatBuffer;
\n+
290
\n+
291 void initFaceSizes();
\n+
292 void initEdgeSharpness();
\n+
294
\n+
295protected:
\n+
297 // Member variables assigned through the above interface:
\n+
298 unsigned short _isValid : 1;
\n+
299 unsigned short _isInitialized : 1;
\n+
300 unsigned short _isFinalized : 1;
\n+
301
\n+
302 unsigned short _isManifold : 1;
\n+
303 unsigned short _isBoundary : 1;
\n+
304
\n+
305 unsigned short _hasFaceSizes : 1;
\n+
306 unsigned short _hasEdgeSharpness : 1;
\n+
307
\n+
308 short _numFaces;
\n+
309 float _vertSharpness;
\n+
310
\n+
311 FloatBuffer _faceEdgeSharpness;
\n+
312 IntBuffer _faceSizeOffsets;
\n+
314};
\n+
\n+
315
\n+
316//
\n+
317// Public inline methods for simple assignment:
\n+
318//
\n+
319inline bool
\n+
\n+\n+
321 return _isValid;
\n+
322}
\n+
\n+
323
\n+
324inline void
\n+
\n+\n+
326 _isManifold = isManifold;
\n+
327}
\n+
\n+
328inline bool
\n+
\n+\n+
330 return _isManifold;
\n+
331}
\n+
\n+
332
\n+
333inline void
\n+
\n+\n+
335 _isBoundary = isBoundary;
\n+
336}
\n+
\n+
337inline bool
\n+
\n+\n+
339 return _isBoundary;
\n+
340}
\n+
\n+
341
\n+
342//
\n+
343// Public inline methods involving sizes of incident faces:
\n+
344//
\n+
345inline bool
\n+
\n+\n+
347 return _hasFaceSizes;
\n+
348}
\n+
\n+
349inline void
\n+
\n+\n+
351 _hasFaceSizes = false;
\n+
352}
\n+
\n+
353
\n+
354inline void
\n+
\n+
355VertexDescriptor::SetIncidentFaceSize(int incFaceIndex, int faceSize) {
\n+
356
\n+
357 if (!_hasFaceSizes) initFaceSizes();
\n+
358
\n+
359 _faceSizeOffsets[incFaceIndex] = faceSize;
\n+
360}
\n+
\n+
361inline int
\n+
\n+\n+
363
\n+
364 return _isFinalized ?
\n+
365 (_faceSizeOffsets[incFaceIndex+1] - _faceSizeOffsets[incFaceIndex]) :
\n+
366 _faceSizeOffsets[incFaceIndex];
\n+
367}
\n+
\n+
368
\n+
369//
\n+
370// Public inline methods involving vertex sharpness:
\n+
371//
\n+
372inline bool
\n+
\n+\n+
374 return _vertSharpness > 0.0f;
\n+
375}
\n+
\n+
376inline void
\n+
\n+\n+
378 _vertSharpness = 0.0f;
\n+
379}
\n+
\n+
380
\n+
381inline void
\n+
\n+\n+
383 _vertSharpness = vertSharpness;
\n+
384}
\n+
\n+
385inline float
\n+
\n+\n+
387 return _vertSharpness;
\n+
388}
\n+
\n+
389
\n+
390//
\n+
391// Public inline methods involving vertex sharpness:
\n+
392//
\n+
393inline bool
\n+
\n+\n+
395 return _hasEdgeSharpness;
\n+
396}
\n+
\n+
397inline void
\n+
\n+\n+
399 _hasEdgeSharpness = false;
\n+
400}
\n+
\n+
401
\n+
402inline void
\n+
\n+
403VertexDescriptor::SetManifoldEdgeSharpness(int edgeIndex, float sharpness) {
\n+
404
\n+
405 if (!_hasEdgeSharpness) initEdgeSharpness();
\n+
406
\n+
407 // Assign the leading edge of the face after the edge (even index):
\n+
408 if (edgeIndex < _numFaces) {
\n+
409 _faceEdgeSharpness[2*edgeIndex] = sharpness;
\n+
410 }
\n+
411
\n+
412 // Assign the trailing edge of the face before the edge (odd index):
\n+
413 if (edgeIndex > 0) {
\n+
414 _faceEdgeSharpness[2*edgeIndex-1] = sharpness;
\n+
415 } else if (!IsBoundary()) {
\n+
416 _faceEdgeSharpness[2*_numFaces-1] = sharpness;
\n+
417 }
\n+
418}
\n+
\n+
419inline float
\n+
\n+\n+
421
\n+
422 // All edges are first of the pair (even index) except last of boundary
\n+
423 return _faceEdgeSharpness[2*edgeIndex - (edgeIndex == _numFaces)];
\n+
424}
\n+
\n+
425
\n+
426inline void
\n+
\n+\n+
428 float leadingEdgeSharpness, float trailingEdgeSharpness) {
\n+
429
\n+
430 if (!_hasEdgeSharpness) initEdgeSharpness();
\n+
431
\n+
432 _faceEdgeSharpness[2*faceIndex ] = leadingEdgeSharpness;
\n+
433 _faceEdgeSharpness[2*faceIndex+1] = trailingEdgeSharpness;
\n+
434}
\n+
\n+
435inline void
\n+
\n+\n+
437 float * leadingEdgeSharpness, float * trailingEdgeSharpness) const {
\n+
438
\n+
439 *leadingEdgeSharpness = _faceEdgeSharpness[2*faceIndex];
\n+
440 *trailingEdgeSharpness = _faceEdgeSharpness[2*faceIndex+1];
\n+
441}
\n+
\n+
442
\n+
443} // end namespace Bfr
\n+
444
\n+
445} // end namespace OPENSUBDIV_VERSION
\n+
446using namespace OPENSUBDIV_VERSION;
\n+
447} // end namespace OpenSubdiv
\n+
448
\n+
449#endif /* OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H */
\n \n-
Simple class defining the 2D parameterization of a face.
\n-
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n-
void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const
Returns the (u,v) coordinate of a given vertex.
\n-
Encapsulates a specific tessellation pattern of a Parameterization.
\n-
int GetFaceSize() const
Return the size of the face.
\n-
int GetNumBoundaryCoords() const
Return the number of boundary coordinates.
\n-\n-
void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int const interiorIndices[])
Reassign all facet coordinate indices.
\n-
int GetCoordStride() const
Return the number of elements between each coordinate.
\n-
int GetNumEdgeCoords(int edge) const
Return the number of coordinates within a given edge (excluding those at its end vertices)
\n-
int GetInteriorCoords(REAL coordTuples[]) const
Retrieve the coordinates for the boundary.
\n-
int GetFacetStride() const
Return the number of elements between each facet.
\n-
bool IsUniform() const
Return if the pattern is uniform.
\n-
int GetNumCoords() const
Return the number of coordinates in the entire pattern.
\n-
int GetCoords(REAL coordTuples[]) const
Retrieve the coordinates for the entire pattern.
\n-
void TransformFacetCoordIndices(int facetTuples[], int commonOffset)
Apply a common offset to all facet coordinate indices.
\n-
Tessellation(Parameterization const &p, int numRates, int const rates[], Options const &options=Options())
General constructor providing multiple tessellation rates for a non-uniform tessellation.
\n-
Parameterization GetParameterization() const
Return the Parameterization.
\n-
void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int interiorOffset)
Reassign indices of boundary coordinates while offseting those of interior coordinates.
\n-
int GetFacetSize() const
Return the number of indices assigned to each facet.
\n-
Tessellation()=delete
Default construction is unavailable.
\n-
Tessellation(Parameterization const &p, int uniformRate, Options const &options=Options())
Simple constructor providing a single uniform tessellation rate.
\n-
int GetFacets(int facetTuples[]) const
Retrieve the facet indices for the entire pattern.
\n-
int GetNumFacets() const
Return the number of facets in the entire pattern.
\n-
int GetNumInteriorCoords() const
Return the number of interior coordinates.
\n-
int GetVertexCoord(int vertex, REAL coordTuples[]) const
Retrieve the coordinate for a given vertex of the face.
\n-
int GetBoundaryCoords(REAL coordTuples[]) const
Retrieve the coordinates for the boundary.
\n-\n-
int GetRates(int rates[]) const
Retrieve the rates assigned.
\n-
bool IsValid() const
Return true if correctly initialized.
\n-
Tessellation & operator=(Tessellation const &)=delete
\n-
int GetEdgeCoords(int edge, REAL coordTuples[]) const
Retrieve the coordinates for a given edge of the face (excluding those at its end vertices)
\n-
Options configure a Tessellation to specify the nature of both its results and the structure of the c...
\n-\n-
int GetCoordStride() const
Return the stride between (u,v) pairs.
\n-
Options & SetFacetSize(int numIndices)
Assign the number of indices per facet (must be 3 or 4, default is 3)
\n-
int GetFacetStride() const
Return the stride between facets.
\n-\n-
Options & SetCoordStride(int stride)
Assign the stride between (u,v) pairs (default is 2)
\n-
Options & SetFacetStride(int stride)
Assign the stride between facets (default is facet size)
\n-
bool PreserveQuads() const
Return if preservation of quads is set.
\n+
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n+
float GetVertexSharpness() const
Return the sharpness of the vertex.
\n+
bool Finalize()
Terminate the sequence of specifications.
\n+
void SetManifold(bool isManifold)
Declare the vertex neighborhood as manifold (ordered)
\n+
bool Initialize(int numIncidentFaces)
Initialize specification with the number of incident faces.
\n+
bool IsManifold() const
Return if vertex neighborhood is manifold.
\n+
bool HasEdgeSharpness() const
Return if sharpness was assigned to the incident edges.
\n+
int GetIncidentFaceSize(int faceIndex) const
Return the size of an incident face.
\n+
float GetManifoldEdgeSharpness(int edgeIndex) const
Return the sharpness assigned to a manifold edge.
\n+
void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp, float trailingEdgeSharp)
Assign sharpness to the edges of an incident face.
\n+
bool HasVertexSharpness() const
Return if sharpness was assigned to the vertex.
\n+
void ClearIncidentFaceSizes()
Remove any assigned sizes of incident faces.
\n+
void SetVertexSharpness(float sharpness)
Assign sharpness to the vertex.
\n+
void ClearVertexSharpness()
Remove any sharpness assigned to the vertex.
\n+
void ClearEdgeSharpness()
Remove any sharpness assigned to the incident edges.
\n+
void GetIncidentFaceEdgeSharpness(int faceIndex, float *leadingEdgeSharp, float *trailingEdgeSharp) const
Return the sharpness assigned to edges of an incident face.
\n+
bool IsBoundary() const
Return if vertex neighborhood is on a boundary.
\n+
bool IsValid() const
Return if instance is valid.
\n+
bool HasIncidentFaceSizes() const
Return if the sizes of incident faces are assigned.
\n+
void SetBoundary(bool isOnBoundary)
Declare the vertex neighborhood as being on a boundary.
\n+
void SetIncidentFaceSize(int faceIndex, int faceSize)
Assign the size of an incident face.
\n+
void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness)
Assign sharpness to the edge of a manifold neighborhood.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-tessellation.h\n+vertexDescriptor.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,367 +24,446 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_TESSELLATION_H\n-26#define OPENSUBDIV3_BFR_TESSELLATION_H\n+25#ifndef OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H\n+26#define OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../bfr/parameterization.h\"\n+30#include \"../vtr/stackBuffer.h\"\n 31\n 32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n 33namespace OPENSUBDIV_VERSION {\n 34\n 35namespace Bfr {\n 36\n-_\b5_\b1class _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn {\n-52public:\n-_\b6_\b5 class _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-66 public:\n-_\b6_\b7 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _preserveQuads(false), _facetSize4(false),\n-68 _coordStride(0), _facetStride(0) { }\n-69\n-72 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs(bool on);\n-_\b7_\b4 bool _\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs() const { return _preserveQuads; }\n-75\n-78 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be(int numIndices);\n-79 // @brief Return the number of indices per facet\n-_\b8_\b0 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be() const { return 3 + (int)_facetSize4; }\n-81\n-83 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be(int stride);\n-_\b8_\b5 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be() const { return _facetStride; }\n-86\n-88 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be(int stride);\n-_\b9_\b0 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be() const { return _coordStride; }\n-91\n-92 private:\n-93 unsigned int _preserveQuads : 1;\n-94 unsigned int _facetSize4 : 1;\n-95\n-96 short _coordStride;\n-97 short _facetStride;\n-98 };\n-99\n-100public:\n-102\n-111\n-_\b1_\b1_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p, int uniformRate,\n-119 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-120\n-_\b1_\b5_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p, int numRates, int const rates[],\n-159 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-160\n-_\b1_\b6_\b2 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const { return _isValid; }\n-163\n-_\b1_\b6_\b5 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn() = delete;\n-166\n-_\b1_\b6_\b7 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn const &) = delete;\n-_\b1_\b6_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn const &) = delete;\n-_\b1_\b6_\b9 _\b~_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn();\n-171\n-173\n-177\n-_\b1_\b7_\b9 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() const { return _param; }\n-180\n-_\b1_\b8_\b2 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() const { return _param._\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(); }\n-183\n-_\b1_\b8_\b5 int _\bG_\be_\bt_\bR_\ba_\bt_\be_\bs(int rates[]) const;\n-186\n-_\b1_\b8_\b8 bool _\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm() const { return _isUniform; }\n-190\n-192\n+50//\n+51// WIP - need to migrate some of these comments into Doxygen\n+52// - others will be moved to the external documentation\n+53//\n+54// It is used by subclasses of SurfaceFactory to provide a complete\n+55// topological description for each vertex of a face, i.e. invoked via\n+56// the virtual method:\n+57//\n+58// int populateFaceVertexDescriptor(Index baseFace,\n+59// int cornerVertex,\n+60// VertexDescriptor & v) const;\n+61//\n+62// Assignment of the full topology can be involved in the presence of\n+63// irregular faces, non-manifold topology or creasing around a vertex, but\n+64// many cases will be simple. For example, to specify a regular boundary\n+65// vertex of a Catmark mesh without any optional sharpness:\n+66//\n+67// int numIncidentFaces = 2;\n+68// bool vertexOnBoundary = true;\n+69//\n+70// vd.Initialize(numIncidentFaces);\n+71// vd.SetManifold(true);\n+72// vd.SetBoundary(vertexOnBoundary);\n+73// vd.ClearIncidentFaceSizes();\n+74// vd.Finalize();\n+75//\n+76// For a more general example, to assign a vertex of some valence whose\n+77// incident faces are of different sizes (e.g. required when triangles\n+78// appear around a vertex in an otherwise quad-dominant Catmark mesh):\n+79//\n+80// int numIncidentFaces = meshVertex.GetNumIncidentFaces();\n+81// bool vertexOnBoundary = meshVertex.IsBoundar();\n+82//\n+83// vd.Initialize(numIncidentFaces);\n+84// vd.SetManifold(true);\n+85// vd.SetBoundary(vertexOnBoundary);\n+86//\n+87// for (int i = 0; i < numIncidentFaces; ++i) {\n+88// vd.SetIncidentFaceSize(i, meshVertex.GetIncidentFaceSize(i));\n+89// }\n+90// vd.Finalize();\n+91//\n+92// These examples specify the incident faces as forming a manifold ring\n+93// (or half-ring) around the vertex, i.e. they can be specified as a\n+94// continuous, connected sequence in counter-clockwise order (and also\n+95// without degeneracies). In the case of a boundary vertex, the first\n+96// face must be on the leading edge of the boundary while the last is on\n+97// the trailing edge. For an interior vertex, which face is specified\n+98// first does not matter (since the set is periodic).\n+99//\n+100// In both cases, the location of the base face in this sequence -- the\n+101// face whose corner vertex is being described here -- must be specified\n+102// in the return value to populateFaceVertexDescriptor() (e.g. when a\n+103// boundary vertex has 3 incident faces, a return value of 0, 1 or 2\n+104// will indicate which is the base face).\n+105//\n+106// The corresponding methods to specify mesh control vertex indices (or\n+107// face-varying indices) complete the specification of the neighborhood:\n+108//\n+109// int getFaceCornerVertexIndices(Index baseFace, int cornerVertex,\n+110// Index vertexIndices[]) const;\n+111//\n+112// int getFaceCornerFVarValueIndices(Index baseFace, int cornerVertex,\n+113// Index fvarValueIndices[],\n+114// int fvarChannel) const;\n+115//\n+116// and are invoked by the Factory when needed.\n+117//\n+118// For each incident face, the indices for all vertices of that face are\n+119// to be specified (not the one-ring or some other subset). These indices\n+120// must also be specified in an orientation relative to the vertex, i.e.\n+121// for a vertex A and an incident face with face-vertices that may be\n+122// stored internally as {D, C, A, B}, they must be specified with A first\n+123// as {A, B, C, D}. This may seem a bit cumbersome, but it has clear\n+124// advantages when dealing with face-varying indices and unordered faces.\n+125//\n+126// More compact ways of specifying vertex indices for ordered, manifold\n+127// cases may be worth exploring in future, but face-varying indices and\n+128// non-manifold (unordered) vertices will always require such a full set,\n+129// so both methods will need to co-exist.\n+130//\n+_\b1_\b3_\b1class _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n+132public:\n+133 // The full declaration must be enclosed by calls to these methods:\n+134 //\n+135 // Note that vertex valences or face sizes in excess of those defined\n+136 // in Bfr::Limits (typically 16-bits) are not valid. When specifying\n+137 // values in excess of these limits, initialization will fail and/or\n+138 // the descriptor will be marked invalid and finalization will fail.\n+139 //\n+140\n+142\n+149\n+_\b1_\b5_\b1 bool _\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be(int numIncidentFaces);\n+152\n+_\b1_\b5_\b4 bool _\bF_\bi_\bn_\ba_\bl_\bi_\bz_\be();\n+155\n+157 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const;\n+159\n+160 //\n+161 // WIP - need to migrate these comments into Doxygen\n+162 //\n+163 // Three groups of methods describe the topology around a vertex:\n+164 // - simple properties (vertex is a boundary, manifold, etc.)\n+165 // - sizes of incident faces (constant or size for each face)\n+166 // - sharpness of the vertex and its incident edges (optional)\n+167 //\n+168\n+169 // Manifold and boundary conditions:\n+170 //\n+171 // The manifold property is a strict condition but preferred for\n+172 // efficiency and is usually available from common connected mesh\n+173 // representations. When declaring the topology as \"manifold\",\n+174 // the Factory assumes the following:\n+175 //\n+176 // - all incident faces are \"ordered\" (counter-clockwise)\n+177 // - all incident faces are consistently oriented\n+178 // - all incident edges are non-degenerate\n+179 //\n+180 // If not certain that all of these conditions are met, it is best\n+181 // to not declare manifold -- leaving the Factory to make sense of\n+182 // the set of incident faces from the face-vertex indices that are\n+183 // provided elsewhere.\n+184 //\n+185\n+187\n+191\n+193 void _\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(bool isManifold);\n+194\n+196 void _\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(bool isOnBoundary);\n+197\n+199 void _\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int faceIndex, int faceSize);\n+200\n+202 void _\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs();\n 203\n-_\b2_\b0_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bo_\br_\bd_\bs() const { return _numInteriorPoints + _numBoundaryPoints;\n-}\n+205 void _\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness);\n 206\n-_\b2_\b0_\b8 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be() const { return _coordStride; }\n+208 void _\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs();\n 209\n-_\b2_\b1_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs() const { return _numBoundaryPoints; }\n-212\n-_\b2_\b1_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs() const { return _numInteriorPoints; }\n-215\n-_\b2_\b1_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs(int edge) const { return _outerRates[edge] - 1; }\n-219\n-221 template \n-222 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n-223\n-225 template \n-_\b2_\b2_\b6 int _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n-227\n-229 template \n-_\b2_\b3_\b0 int _\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n-231\n-233 template \n-234 int _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertex, REAL coordTuples[]) const;\n-235\n-238 template \n-_\b2_\b3_\b9 int _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs(int edge, REAL coordTuples[]) const;\n-241\n-243\n-253\n-_\b2_\b5_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bt_\bs() const { return _numFacets; }\n-256\n-_\b2_\b5_\b8 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be() const { return _facetSize; }\n-259\n-_\b2_\b6_\b1 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be() const { return _facetStride; }\n-262\n-_\b2_\b6_\b4 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bs(int facetTuples[]) const;\n+221 void _\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex, float edgeSharpness);\n+222\n+238 void _\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex, float leadingEdgeSharp,\n+239 float trailingEdgeSharp);\n+240\n+242 void _\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs();\n+244\n+246\n+251\n+253 bool _\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd() const;\n+254\n+256 bool _\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const;\n+257\n+259 bool _\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() const;\n+260\n+262 int _\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int faceIndex) const;\n+263\n+265 bool _\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n 266\n-268\n-283\n-_\b2_\b8_\b5 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[], int commonOffset);\n-286\n-_\b2_\b8_\b9 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[],\n-290 int const boundaryIndices[],\n-291 int interiorOffset);\n-292\n-_\b2_\b9_\b4 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[],\n-295 int const boundaryIndices[],\n-296 int const interiorIndices[]);\n-298\n-299private:\n-300 // Private initialization methods:\n-301 bool validateArguments(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p,\n-302 int nRates, int const rates[], _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n-303\n-304 void initialize(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p,\n-305 int nRates, int const rates[], _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n-306\n-307 void initializeDefaults();\n-308 int initializeRates(int nRates, int const rates[]);\n-309 void initializeInventoryForParamTri(int sumOfOuterRates);\n-310 void initializeInventoryForParamQuad(int sumOfOuterRates);\n-311 void initializeInventoryForParamQPoly(int sumOfOuterRates);\n-312\n-313private:\n-314 // Private members:\n-315 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _param;\n-316\n-317 unsigned short _isValid : 1;\n-318 unsigned short _isUniform : 1;\n-319 unsigned short _triangulate : 1;\n-320 unsigned short _singleFace : 1;\n-321 unsigned short _segmentedFace : 1;\n-322 unsigned short _triangleFan : 1;\n-323 unsigned short _splitQuad : 1;\n-324\n-325 short _facetSize;\n-326 int _facetStride;\n-327 int _coordStride;\n-328\n-329 int _numGivenRates;\n-330 int _numBoundaryPoints;\n-331 int _numInteriorPoints;\n-332 int _numFacets;\n-333\n-334 int _innerRates[2];\n-335 int* _outerRates;\n-336 int _outerRatesLocal[4];\n-337};\n-338\n-339//\n-340// Inline implementations:\n-341//\n-342inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b3_\b4_\b3_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs(bool on) {\n-344 _preserveQuads = on;\n-345 return *this;\n-346}\n-347inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b3_\b4_\b8_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be(int numIndices) {\n-349 _facetSize4 = (numIndices == 4);\n-350 return *this;\n-351}\n-352inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b3_\b5_\b3_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be(int stride) {\n-354 _facetStride = (short) stride;\n-355 return *this;\n-356}\n-357inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n-_\b3_\b5_\b8_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be(int stride) {\n-359 _coordStride = (short) stride;\n-360 return *this;\n-361}\n-362\n-363template \n-364inline int\n-_\b3_\b6_\b5_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertex, REAL coord[]) const {\n-366 _param._\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(vertex, coord);\n-367 return 1;\n-368}\n-369\n-370template \n-371inline int\n-_\b3_\b7_\b2_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const {\n-373 int nCoords = _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs(coordTuples);\n-374 nCoords += _\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs(coordTuples + nCoords * _coordStride);\n-375 return nCoords;\n-376}\n-377\n-378} // end namespace Bfr\n-379\n-380} // end namespace OPENSUBDIV_VERSION\n-381using namespace OPENSUBDIV_VERSION;\n-382\n-383} // end namespace OpenSubdiv\n-384\n-385#endif /* OPENSUBDIV3_BFR_TESSELLATION */\n+268 float _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n+269\n+271 bool _\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n+272\n+274 float _\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex) const;\n+275\n+277 void _\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n+278 float * leadingEdgeSharp, float * trailingEdgeSharp) const;\n+280\n+281protected:\n+283 friend class FaceVertex;\n+284\n+285 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() { }\n+286 _\b~_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() { }\n+287\n+288 typedef Vtr::internal::StackBuffer IntBuffer;\n+289 typedef Vtr::internal::StackBuffer FloatBuffer;\n+290\n+291 void initFaceSizes();\n+292 void initEdgeSharpness();\n+294\n+295protected:\n+297 // Member variables assigned through the above interface:\n+298 unsigned short _isValid : 1;\n+299 unsigned short _isInitialized : 1;\n+300 unsigned short _isFinalized : 1;\n+301\n+302 unsigned short _isManifold : 1;\n+303 unsigned short _isBoundary : 1;\n+304\n+305 unsigned short _hasFaceSizes : 1;\n+306 unsigned short _hasEdgeSharpness : 1;\n+307\n+308 short _numFaces;\n+309 float _vertSharpness;\n+310\n+311 FloatBuffer _faceEdgeSharpness;\n+312 IntBuffer _faceSizeOffsets;\n+314};\n+315\n+316//\n+317// Public inline methods for simple assignment:\n+318//\n+319inline bool\n+_\b3_\b2_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd() const {\n+321 return _isValid;\n+322}\n+323\n+324inline void\n+_\b3_\b2_\b5_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(bool isManifold) {\n+326 _isManifold = isManifold;\n+327}\n+328inline bool\n+_\b3_\b2_\b9_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd() const {\n+330 return _isManifold;\n+331}\n+332\n+333inline void\n+_\b3_\b3_\b4_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(bool isBoundary) {\n+335 _isBoundary = isBoundary;\n+336}\n+337inline bool\n+_\b3_\b3_\b8_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const {\n+339 return _isBoundary;\n+340}\n+341\n+342//\n+343// Public inline methods involving sizes of incident faces:\n+344//\n+345inline bool\n+_\b3_\b4_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() const {\n+347 return _hasFaceSizes;\n+348}\n+349inline void\n+_\b3_\b5_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() {\n+351 _hasFaceSizes = false;\n+352}\n+353\n+354inline void\n+_\b3_\b5_\b5_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int incFaceIndex, int faceSize) {\n+356\n+357 if (!_hasFaceSizes) initFaceSizes();\n+358\n+359 _faceSizeOffsets[incFaceIndex] = faceSize;\n+360}\n+361inline int\n+_\b3_\b6_\b2_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int incFaceIndex) const {\n+363\n+364 return _isFinalized ?\n+365 (_faceSizeOffsets[incFaceIndex+1] - _faceSizeOffsets[incFaceIndex]) :\n+366 _faceSizeOffsets[incFaceIndex];\n+367}\n+368\n+369//\n+370// Public inline methods involving vertex sharpness:\n+371//\n+372inline bool\n+_\b3_\b7_\b3_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n+374 return _vertSharpness > 0.0f;\n+375}\n+376inline void\n+_\b3_\b7_\b7_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() {\n+378 _vertSharpness = 0.0f;\n+379}\n+380\n+381inline void\n+_\b3_\b8_\b2_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertSharpness) {\n+383 _vertSharpness = vertSharpness;\n+384}\n+385inline float\n+_\b3_\b8_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n+387 return _vertSharpness;\n+388}\n+389\n+390//\n+391// Public inline methods involving vertex sharpness:\n+392//\n+393inline bool\n+_\b3_\b9_\b4_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n+395 return _hasEdgeSharpness;\n+396}\n+397inline void\n+_\b3_\b9_\b8_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() {\n+399 _hasEdgeSharpness = false;\n+400}\n+401\n+402inline void\n+_\b4_\b0_\b3_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex, float sharpness) {\n+404\n+405 if (!_hasEdgeSharpness) initEdgeSharpness();\n+406\n+407 // Assign the leading edge of the face after the edge (even index):\n+408 if (edgeIndex < _numFaces) {\n+409 _faceEdgeSharpness[2*edgeIndex] = sharpness;\n+410 }\n+411\n+412 // Assign the trailing edge of the face before the edge (odd index):\n+413 if (edgeIndex > 0) {\n+414 _faceEdgeSharpness[2*edgeIndex-1] = sharpness;\n+415 } else if (!_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by()) {\n+416 _faceEdgeSharpness[2*_numFaces-1] = sharpness;\n+417 }\n+418}\n+419inline float\n+_\b4_\b2_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex) const {\n+421\n+422 // All edges are first of the pair (even index) except last of boundary\n+423 return _faceEdgeSharpness[2*edgeIndex - (edgeIndex == _numFaces)];\n+424}\n+425\n+426inline void\n+_\b4_\b2_\b7_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n+428 float leadingEdgeSharpness, float trailingEdgeSharpness) {\n+429\n+430 if (!_hasEdgeSharpness) initEdgeSharpness();\n+431\n+432 _faceEdgeSharpness[2*faceIndex ] = leadingEdgeSharpness;\n+433 _faceEdgeSharpness[2*faceIndex+1] = trailingEdgeSharpness;\n+434}\n+435inline void\n+_\b4_\b3_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n+437 float * leadingEdgeSharpness, float * trailingEdgeSharpness) const {\n+438\n+439 *leadingEdgeSharpness = _faceEdgeSharpness[2*faceIndex];\n+440 *trailingEdgeSharpness = _faceEdgeSharpness[2*faceIndex+1];\n+441}\n+442\n+443} // end namespace Bfr\n+444\n+445} // end namespace OPENSUBDIV_VERSION\n+446using namespace OPENSUBDIV_VERSION;\n+447} // end namespace OpenSubdiv\n+448\n+449#endif /* OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Simple class defining the 2D parameterization of a face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-int GetFaceSize() const\n-Returns the size (number of vertices) of the corresponding face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n-void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const\n-Returns the (u,v) coordinate of a given vertex.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-Encapsulates a specific tessellation pattern of a Parameterization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-int GetFaceSize() const\n-Return the size of the face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs\n-int GetNumBoundaryCoords() const\n-Return the number of boundary coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b~_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-~Tessellation()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[],\n-int const interiorIndices[])\n-Reassign all facet coordinate indices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n-int GetCoordStride() const\n-Return the number of elements between each coordinate.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs\n-int GetNumEdgeCoords(int edge) const\n-Return the number of coordinates within a given edge (excluding those at its\n-end vertices)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs\n-int GetInteriorCoords(REAL coordTuples[]) const\n-Retrieve the coordinates for the boundary.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n-int GetFacetStride() const\n-Return the number of elements between each facet.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-bool IsUniform() const\n-Return if the pattern is uniform.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bo_\br_\bd_\bs\n-int GetNumCoords() const\n-Return the number of coordinates in the entire pattern.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs\n-int GetCoords(REAL coordTuples[]) const\n-Retrieve the coordinates for the entire pattern.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-void TransformFacetCoordIndices(int facetTuples[], int commonOffset)\n-Apply a common offset to all facet coordinate indices.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-Tessellation(Parameterization const &p, int numRates, int const rates[],\n-Options const &options=Options())\n-General constructor providing multiple tessellation rates for a non-uniform\n-tessellation.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n-Parameterization GetParameterization() const\n-Return the Parameterization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[],\n-int interiorOffset)\n-Reassign indices of boundary coordinates while offseting those of interior\n-coordinates.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n-int GetFacetSize() const\n-Return the number of indices assigned to each facet.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-Tessellation()=delete\n-Default construction is unavailable.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-Tessellation(Parameterization const &p, int uniformRate, Options const\n-&options=Options())\n-Simple constructor providing a single uniform tessellation rate.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bs\n-int GetFacets(int facetTuples[]) const\n-Retrieve the facet indices for the entire pattern.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bt_\bs\n-int GetNumFacets() const\n-Return the number of facets in the entire pattern.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs\n-int GetNumInteriorCoords() const\n-Return the number of interior coordinates.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n-int GetVertexCoord(int vertex, REAL coordTuples[]) const\n-Retrieve the coordinate for a given vertex of the face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs\n-int GetBoundaryCoords(REAL coordTuples[]) const\n-Retrieve the coordinates for the boundary.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n-Tessellation(Tessellation const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bR_\ba_\bt_\be_\bs\n-int GetRates(int rates[]) const\n-Retrieve the rates assigned.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+Simple class used by subclasses of SurfaceFactory to describe a vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float GetVertexSharpness() const\n+Return the sharpness of the vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bi_\bn_\ba_\bl_\bi_\bz_\be\n+bool Finalize()\n+Terminate the sequence of specifications.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+void SetManifold(bool isManifold)\n+Declare the vertex neighborhood as manifold (ordered)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be\n+bool Initialize(int numIncidentFaces)\n+Initialize specification with the number of incident faces.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+bool IsManifold() const\n+Return if vertex neighborhood is manifold.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+bool HasEdgeSharpness() const\n+Return if sharpness was assigned to the incident edges.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+int GetIncidentFaceSize(int faceIndex) const\n+Return the size of an incident face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float GetManifoldEdgeSharpness(int edgeIndex) const\n+Return the sharpness assigned to a manifold edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n+_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp, float\n+trailingEdgeSharp)\n+Assign sharpness to the edges of an incident face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+bool HasVertexSharpness() const\n+Return if sharpness was assigned to the vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs\n+void ClearIncidentFaceSizes()\n+Remove any assigned sizes of incident faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void SetVertexSharpness(float sharpness)\n+Assign sharpness to the vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void ClearVertexSharpness()\n+Remove any sharpness assigned to the vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void ClearEdgeSharpness()\n+Remove any sharpness assigned to the incident edges.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n+_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void GetIncidentFaceEdgeSharpness(int faceIndex, float *leadingEdgeSharp, float\n+*trailingEdgeSharp) const\n+Return the sharpness assigned to edges of an incident face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n+bool IsBoundary() const\n+Return if vertex neighborhood is on a boundary.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n bool IsValid() const\n-Return true if correctly initialized.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-Tessellation & operator=(Tessellation const &)=delete\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs\n-int GetEdgeCoords(int edge, REAL coordTuples[]) const\n-Retrieve the coordinates for a given edge of the face (excluding those at its\n-end vertices)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options configure a Tessellation to specify the nature of both its results and\n-the structure of the c...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n-int GetCoordStride() const\n-Return the stride between (u,v) pairs.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n-Options & SetFacetSize(int numIndices)\n-Assign the number of indices per facet (must be 3 or 4, default is 3)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n-int GetFacetStride() const\n-Return the stride between facets.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n-int GetFacetSize() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n-Options & SetCoordStride(int stride)\n-Assign the stride between (u,v) pairs (default is 2)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n-Options & SetFacetStride(int stride)\n-Assign the stride between facets (default is facet size)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs\n-bool PreserveQuads() const\n-Return if preservation of quads is set.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b7_\b4\n+Return if instance is valid.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs\n+bool HasIncidentFaceSizes() const\n+Return if the sizes of incident faces are assigned.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n+void SetBoundary(bool isOnBoundary)\n+Declare the vertex neighborhood as being on a boundary.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+void SetIncidentFaceSize(int faceIndex, int faceSize)\n+Assign the size of an incident face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness)\n+Assign sharpness to the edge of a manifold neighborhood.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b0_\b3\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh\n+ * _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00677.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00677.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/vertexDescriptor.h File Reference\n+OpenSubdiv: opensubdiv/bfr/tessellation.h File Reference\n \n \n \n \n \n \n \n@@ -90,26 +90,29 @@\n \n \n \n
\n \n-
vertexDescriptor.h File Reference
\n+
tessellation.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../vtr/stackBuffer.h"
\n+#include "../bfr/parameterization.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n \n

\n Classes

class  VertexDescriptor
 Simple class used by subclasses of SurfaceFactory to describe a vertex. More...
class  Tessellation
 Encapsulates a specific tessellation pattern of a Parameterization. More...
 
class  Tessellation::Options
 Options configure a Tessellation to specify the nature of both its results and the structure of the coordinate and facet index arrays that its methods will populate. More...
 
\n \n \n \n \n@@ -118,13 +121,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-vertexDescriptor.h File Reference\n+tessellation.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bb_\bf_\br_\b/_\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-\u00a0 Simple class used by subclasses of _\bS_\bu_\br_\bf_\ba_\bc_\be_\bF_\ba_\bc_\bt_\bo_\br_\by to describe a vertex.\n+class \u00a0 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+\u00a0 Encapsulates a specific tessellation pattern of a _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn.\n _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n+class \u00a0 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+ _\bO_\bp_\bt_\bi_\bo_\bn_\bs configure a _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn to specify the nature of both its\n+\u00a0 results and the structure of the coordinate and facet index arrays that\n+ its methods will populate. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00677.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00677.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00677 = [\n- [\"VertexDescriptor\", \"a00969.html\", \"a00969\"]\n+ [\"Tessellation\", \"a00961.html\", \"a00961\"],\n+ [\"Options\", \"a00965.html\", \"a00965\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00677_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00677_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/bfr/vertexDescriptor.h Source File\n+OpenSubdiv: opensubdiv/bfr/tessellation.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
vertexDescriptor.h
\n+
tessellation.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2021 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,425 +119,281 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H
\n-
26#define OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H
\n+
25#ifndef OPENSUBDIV3_BFR_TESSELLATION_H
\n+
26#define OPENSUBDIV3_BFR_TESSELLATION_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../vtr/stackBuffer.h"
\n+
30#include "../bfr/parameterization.h"
\n
31
\n
32namespace OpenSubdiv {
\n
33namespace OPENSUBDIV_VERSION {
\n
34
\n
35namespace Bfr {
\n
36
\n-
50//
\n-
51// WIP - need to migrate some of these comments into Doxygen
\n-
52// - others will be moved to the external documentation
\n-
53//
\n-
54// It is used by subclasses of SurfaceFactory to provide a complete
\n-
55// topological description for each vertex of a face, i.e. invoked via
\n-
56// the virtual method:
\n-
57//
\n-
58// int populateFaceVertexDescriptor(Index baseFace,
\n-
59// int cornerVertex,
\n-
60// VertexDescriptor & v) const;
\n-
61//
\n-
62// Assignment of the full topology can be involved in the presence of
\n-
63// irregular faces, non-manifold topology or creasing around a vertex, but
\n-
64// many cases will be simple. For example, to specify a regular boundary
\n-
65// vertex of a Catmark mesh without any optional sharpness:
\n-
66//
\n-
67// int numIncidentFaces = 2;
\n-
68// bool vertexOnBoundary = true;
\n-
69//
\n-
70// vd.Initialize(numIncidentFaces);
\n-
71// vd.SetManifold(true);
\n-
72// vd.SetBoundary(vertexOnBoundary);
\n-
73// vd.ClearIncidentFaceSizes();
\n-
74// vd.Finalize();
\n-
75//
\n-
76// For a more general example, to assign a vertex of some valence whose
\n-
77// incident faces are of different sizes (e.g. required when triangles
\n-
78// appear around a vertex in an otherwise quad-dominant Catmark mesh):
\n-
79//
\n-
80// int numIncidentFaces = meshVertex.GetNumIncidentFaces();
\n-
81// bool vertexOnBoundary = meshVertex.IsBoundar();
\n-
82//
\n-
83// vd.Initialize(numIncidentFaces);
\n-
84// vd.SetManifold(true);
\n-
85// vd.SetBoundary(vertexOnBoundary);
\n-
86//
\n-
87// for (int i = 0; i < numIncidentFaces; ++i) {
\n-
88// vd.SetIncidentFaceSize(i, meshVertex.GetIncidentFaceSize(i));
\n-
89// }
\n-
90// vd.Finalize();
\n-
91//
\n-
92// These examples specify the incident faces as forming a manifold ring
\n-
93// (or half-ring) around the vertex, i.e. they can be specified as a
\n-
94// continuous, connected sequence in counter-clockwise order (and also
\n-
95// without degeneracies). In the case of a boundary vertex, the first
\n-
96// face must be on the leading edge of the boundary while the last is on
\n-
97// the trailing edge. For an interior vertex, which face is specified
\n-
98// first does not matter (since the set is periodic).
\n-
99//
\n-
100// In both cases, the location of the base face in this sequence -- the
\n-
101// face whose corner vertex is being described here -- must be specified
\n-
102// in the return value to populateFaceVertexDescriptor() (e.g. when a
\n-
103// boundary vertex has 3 incident faces, a return value of 0, 1 or 2
\n-
104// will indicate which is the base face).
\n-
105//
\n-
106// The corresponding methods to specify mesh control vertex indices (or
\n-
107// face-varying indices) complete the specification of the neighborhood:
\n-
108//
\n-
109// int getFaceCornerVertexIndices(Index baseFace, int cornerVertex,
\n-
110// Index vertexIndices[]) const;
\n-
111//
\n-
112// int getFaceCornerFVarValueIndices(Index baseFace, int cornerVertex,
\n-
113// Index fvarValueIndices[],
\n-
114// int fvarChannel) const;
\n-
115//
\n-
116// and are invoked by the Factory when needed.
\n-
117//
\n-
118// For each incident face, the indices for all vertices of that face are
\n-
119// to be specified (not the one-ring or some other subset). These indices
\n-
120// must also be specified in an orientation relative to the vertex, i.e.
\n-
121// for a vertex A and an incident face with face-vertices that may be
\n-
122// stored internally as {D, C, A, B}, they must be specified with A first
\n-
123// as {A, B, C, D}. This may seem a bit cumbersome, but it has clear
\n-
124// advantages when dealing with face-varying indices and unordered faces.
\n-
125//
\n-
126// More compact ways of specifying vertex indices for ordered, manifold
\n-
127// cases may be worth exploring in future, but face-varying indices and
\n-
128// non-manifold (unordered) vertices will always require such a full set,
\n-
129// so both methods will need to co-exist.
\n-
130//
\n-
\n-\n-
132public:
\n-
133 // The full declaration must be enclosed by calls to these methods:
\n-
134 //
\n-
135 // Note that vertex valences or face sizes in excess of those defined
\n-
136 // in Bfr::Limits (typically 16-bits) are not valid. When specifying
\n-
137 // values in excess of these limits, initialization will fail and/or
\n-
138 // the descriptor will be marked invalid and finalization will fail.
\n-
139 //
\n-
140
\n-
142
\n-
149
\n-
151 bool Initialize(int numIncidentFaces);
\n-
152
\n-
154 bool Finalize();
\n-
155
\n-
157 bool IsValid() const;
\n-
159
\n-
160 //
\n-
161 // WIP - need to migrate these comments into Doxygen
\n-
162 //
\n-
163 // Three groups of methods describe the topology around a vertex:
\n-
164 // - simple properties (vertex is a boundary, manifold, etc.)
\n-
165 // - sizes of incident faces (constant or size for each face)
\n-
166 // - sharpness of the vertex and its incident edges (optional)
\n-
167 //
\n-
168
\n-
169 // Manifold and boundary conditions:
\n-
170 //
\n-
171 // The manifold property is a strict condition but preferred for
\n-
172 // efficiency and is usually available from common connected mesh
\n-
173 // representations. When declaring the topology as "manifold",
\n-
174 // the Factory assumes the following:
\n-
175 //
\n-
176 // - all incident faces are "ordered" (counter-clockwise)
\n-
177 // - all incident faces are consistently oriented
\n-
178 // - all incident edges are non-degenerate
\n-
179 //
\n-
180 // If not certain that all of these conditions are met, it is best
\n-
181 // to not declare manifold -- leaving the Factory to make sense of
\n-
182 // the set of incident faces from the face-vertex indices that are
\n-
183 // provided elsewhere.
\n-
184 //
\n-
185
\n-
187
\n-
191
\n-
193 void SetManifold(bool isManifold);
\n-
194
\n-
196 void SetBoundary(bool isOnBoundary);
\n-
197
\n-
199 void SetIncidentFaceSize(int faceIndex, int faceSize);
\n-
200
\n-\n+
\n+\n+
52public:
\n+
\n+
65 class Options {
\n+
66 public:
\n+
\n+
67 Options() : _preserveQuads(false), _facetSize4(false),
\n+
68 _coordStride(0), _facetStride(0) { }
\n+
\n+
69
\n+
72 Options & PreserveQuads(bool on);
\n+
74 bool PreserveQuads() const { return _preserveQuads; }
\n+
75
\n+
78 Options & SetFacetSize(int numIndices);
\n+
79 // @brief Return the number of indices per facet
\n+
80 int GetFacetSize() const { return 3 + (int)_facetSize4; }
\n+
81
\n+
83 Options & SetFacetStride(int stride);
\n+
85 int GetFacetStride() const { return _facetStride; }
\n+
86
\n+
88 Options & SetCoordStride(int stride);
\n+
90 int GetCoordStride() const { return _coordStride; }
\n+
91
\n+
92 private:
\n+
93 unsigned int _preserveQuads : 1;
\n+
94 unsigned int _facetSize4 : 1;
\n+
95
\n+
96 short _coordStride;
\n+
97 short _facetStride;
\n+
98 };
\n+
\n+
99
\n+
100public:
\n+
102
\n+
111
\n+
118 Tessellation(Parameterization const & p, int uniformRate,
\n+
119 Options const & options = Options());
\n+
120
\n+
158 Tessellation(Parameterization const & p, int numRates, int const rates[],
\n+
159 Options const & options = Options());
\n+
160
\n+
162 bool IsValid() const { return _isValid; }
\n+
163
\n+
165 Tessellation() = delete;
\n+
166
\n+
167 Tessellation(Tessellation const &) = delete;
\n+\n+\n+
171
\n+
173
\n+
177
\n+
179 Parameterization GetParameterization() const { return _param; }
\n+
180
\n+
182 int GetFaceSize() const { return _param.GetFaceSize(); }
\n+
183
\n+
185 int GetRates(int rates[]) const;
\n+
186
\n+
188 bool IsUniform() const { return _isUniform; }
\n+
190
\n+
192
\n
203
\n-
205 void SetVertexSharpness(float sharpness);
\n+
205 int GetNumCoords() const { return _numInteriorPoints + _numBoundaryPoints; }
\n
206
\n-\n+
208 int GetCoordStride() const { return _coordStride; }
\n
209
\n-
221 void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness);
\n-
222
\n-
238 void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp,
\n-
239 float trailingEdgeSharp);
\n-
240
\n-
242 void ClearEdgeSharpness();
\n-
244
\n-
246
\n-
251
\n-
253 bool IsManifold() const;
\n-
254
\n-
256 bool IsBoundary() const;
\n-
257
\n-
259 bool HasIncidentFaceSizes() const;
\n-
260
\n-
262 int GetIncidentFaceSize(int faceIndex) const;
\n-
263
\n-
265 bool HasVertexSharpness() const;
\n+
211 int GetNumBoundaryCoords() const { return _numBoundaryPoints; }
\n+
212
\n+
214 int GetNumInteriorCoords() const { return _numInteriorPoints; }
\n+
215
\n+
218 int GetNumEdgeCoords(int edge) const { return _outerRates[edge] - 1; }
\n+
219
\n+
221 template <typename REAL>
\n+
222 int GetCoords(REAL coordTuples[]) const;
\n+
223
\n+
225 template <typename REAL>
\n+
226 int GetBoundaryCoords(REAL coordTuples[]) const;
\n+
227
\n+
229 template <typename REAL>
\n+
230 int GetInteriorCoords(REAL coordTuples[]) const;
\n+
231
\n+
233 template <typename REAL>
\n+
234 int GetVertexCoord(int vertex, REAL coordTuples[]) const;
\n+
235
\n+
238 template <typename REAL>
\n+
239 int GetEdgeCoords(int edge, REAL coordTuples[]) const;
\n+
241
\n+
243
\n+
253
\n+
255 int GetNumFacets() const { return _numFacets; }
\n+
256
\n+
258 int GetFacetSize() const { return _facetSize; }
\n+
259
\n+
261 int GetFacetStride() const { return _facetStride; }
\n+
262
\n+
264 int GetFacets(int facetTuples[]) const;
\n
266
\n-
268 float GetVertexSharpness() const;
\n-
269
\n-
271 bool HasEdgeSharpness() const;
\n-
272
\n-
274 float GetManifoldEdgeSharpness(int edgeIndex) const;
\n-
275
\n-
277 void GetIncidentFaceEdgeSharpness(int faceIndex,
\n-
278 float * leadingEdgeSharp, float * trailingEdgeSharp) const;
\n-
280
\n-
281protected:
\n-
283 friend class FaceVertex;
\n-
284
\n-
285 VertexDescriptor() { }
\n-\n-
287
\n-
288 typedef Vtr::internal::StackBuffer<int,8,true> IntBuffer;
\n-
289 typedef Vtr::internal::StackBuffer<float,16,true> FloatBuffer;
\n-
290
\n-
291 void initFaceSizes();
\n-
292 void initEdgeSharpness();
\n-
294
\n-
295protected:
\n-
297 // Member variables assigned through the above interface:
\n-
298 unsigned short _isValid : 1;
\n-
299 unsigned short _isInitialized : 1;
\n-
300 unsigned short _isFinalized : 1;
\n-
301
\n-
302 unsigned short _isManifold : 1;
\n-
303 unsigned short _isBoundary : 1;
\n-
304
\n-
305 unsigned short _hasFaceSizes : 1;
\n-
306 unsigned short _hasEdgeSharpness : 1;
\n-
307
\n-
308 short _numFaces;
\n-
309 float _vertSharpness;
\n-
310
\n-
311 FloatBuffer _faceEdgeSharpness;
\n-
312 IntBuffer _faceSizeOffsets;
\n-
314};
\n-
\n-
315
\n-
316//
\n-
317// Public inline methods for simple assignment:
\n-
318//
\n-
319inline bool
\n-
\n-\n-
321 return _isValid;
\n-
322}
\n-
\n-
323
\n-
324inline void
\n-
\n-\n-
326 _isManifold = isManifold;
\n-
327}
\n-
\n-
328inline bool
\n-
\n-\n-
330 return _isManifold;
\n-
331}
\n-
\n-
332
\n-
333inline void
\n-
\n-\n-
335 _isBoundary = isBoundary;
\n-
336}
\n-
\n-
337inline bool
\n-
\n-\n-
339 return _isBoundary;
\n-
340}
\n-
\n-
341
\n-
342//
\n-
343// Public inline methods involving sizes of incident faces:
\n-
344//
\n-
345inline bool
\n-
\n-\n-
347 return _hasFaceSizes;
\n-
348}
\n-
\n-
349inline void
\n-
\n-\n-
351 _hasFaceSizes = false;
\n-
352}
\n-
\n-
353
\n-
354inline void
\n-
\n-
355VertexDescriptor::SetIncidentFaceSize(int incFaceIndex, int faceSize) {
\n-
356
\n-
357 if (!_hasFaceSizes) initFaceSizes();
\n-
358
\n-
359 _faceSizeOffsets[incFaceIndex] = faceSize;
\n-
360}
\n-
\n-
361inline int
\n-
\n-\n-
363
\n-
364 return _isFinalized ?
\n-
365 (_faceSizeOffsets[incFaceIndex+1] - _faceSizeOffsets[incFaceIndex]) :
\n-
366 _faceSizeOffsets[incFaceIndex];
\n-
367}
\n-
\n-
368
\n-
369//
\n-
370// Public inline methods involving vertex sharpness:
\n-
371//
\n-
372inline bool
\n-
\n-\n-
374 return _vertSharpness > 0.0f;
\n-
375}
\n-
\n-
376inline void
\n-
\n-\n-
378 _vertSharpness = 0.0f;
\n-
379}
\n-
\n-
380
\n-
381inline void
\n-
\n-\n-
383 _vertSharpness = vertSharpness;
\n-
384}
\n-
\n-
385inline float
\n-
\n-\n-
387 return _vertSharpness;
\n-
388}
\n-
\n-
389
\n-
390//
\n-
391// Public inline methods involving vertex sharpness:
\n-
392//
\n-
393inline bool
\n-
\n-\n-
395 return _hasEdgeSharpness;
\n-
396}
\n-
\n-
397inline void
\n-
\n-\n-
399 _hasEdgeSharpness = false;
\n-
400}
\n-
\n-
401
\n-
402inline void
\n-
\n-
403VertexDescriptor::SetManifoldEdgeSharpness(int edgeIndex, float sharpness) {
\n-
404
\n-
405 if (!_hasEdgeSharpness) initEdgeSharpness();
\n-
406
\n-
407 // Assign the leading edge of the face after the edge (even index):
\n-
408 if (edgeIndex < _numFaces) {
\n-
409 _faceEdgeSharpness[2*edgeIndex] = sharpness;
\n-
410 }
\n-
411
\n-
412 // Assign the trailing edge of the face before the edge (odd index):
\n-
413 if (edgeIndex > 0) {
\n-
414 _faceEdgeSharpness[2*edgeIndex-1] = sharpness;
\n-
415 } else if (!IsBoundary()) {
\n-
416 _faceEdgeSharpness[2*_numFaces-1] = sharpness;
\n-
417 }
\n-
418}
\n-
\n-
419inline float
\n-
\n-\n-
421
\n-
422 // All edges are first of the pair (even index) except last of boundary
\n-
423 return _faceEdgeSharpness[2*edgeIndex - (edgeIndex == _numFaces)];
\n-
424}
\n-
\n-
425
\n-
426inline void
\n-
\n-\n-
428 float leadingEdgeSharpness, float trailingEdgeSharpness) {
\n-
429
\n-
430 if (!_hasEdgeSharpness) initEdgeSharpness();
\n-
431
\n-
432 _faceEdgeSharpness[2*faceIndex ] = leadingEdgeSharpness;
\n-
433 _faceEdgeSharpness[2*faceIndex+1] = trailingEdgeSharpness;
\n-
434}
\n-
\n-
435inline void
\n-
\n-\n-
437 float * leadingEdgeSharpness, float * trailingEdgeSharpness) const {
\n-
438
\n-
439 *leadingEdgeSharpness = _faceEdgeSharpness[2*faceIndex];
\n-
440 *trailingEdgeSharpness = _faceEdgeSharpness[2*faceIndex+1];
\n-
441}
\n-
\n-
442
\n-
443} // end namespace Bfr
\n-
444
\n-
445} // end namespace OPENSUBDIV_VERSION
\n-
446using namespace OPENSUBDIV_VERSION;
\n-
447} // end namespace OpenSubdiv
\n-
448
\n-
449#endif /* OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H */
\n+
268
\n+
283
\n+
285 void TransformFacetCoordIndices(int facetTuples[], int commonOffset);
\n+
286
\n+
289 void TransformFacetCoordIndices(int facetTuples[],
\n+
290 int const boundaryIndices[],
\n+
291 int interiorOffset);
\n+
292
\n+
294 void TransformFacetCoordIndices(int facetTuples[],
\n+
295 int const boundaryIndices[],
\n+
296 int const interiorIndices[]);
\n+
298
\n+
299private:
\n+
300 // Private initialization methods:
\n+
301 bool validateArguments(Parameterization const & p,
\n+
302 int nRates, int const rates[], Options const & options);
\n+
303
\n+
304 void initialize(Parameterization const & p,
\n+
305 int nRates, int const rates[], Options const & options);
\n+
306
\n+
307 void initializeDefaults();
\n+
308 int initializeRates(int nRates, int const rates[]);
\n+
309 void initializeInventoryForParamTri(int sumOfOuterRates);
\n+
310 void initializeInventoryForParamQuad(int sumOfOuterRates);
\n+
311 void initializeInventoryForParamQPoly(int sumOfOuterRates);
\n+
312
\n+
313private:
\n+
314 // Private members:
\n+
315 Parameterization _param;
\n+
316
\n+
317 unsigned short _isValid : 1;
\n+
318 unsigned short _isUniform : 1;
\n+
319 unsigned short _triangulate : 1;
\n+
320 unsigned short _singleFace : 1;
\n+
321 unsigned short _segmentedFace : 1;
\n+
322 unsigned short _triangleFan : 1;
\n+
323 unsigned short _splitQuad : 1;
\n+
324
\n+
325 short _facetSize;
\n+
326 int _facetStride;
\n+
327 int _coordStride;
\n+
328
\n+
329 int _numGivenRates;
\n+
330 int _numBoundaryPoints;
\n+
331 int _numInteriorPoints;
\n+
332 int _numFacets;
\n+
333
\n+
334 int _innerRates[2];
\n+
335 int* _outerRates;
\n+
336 int _outerRatesLocal[4];
\n+
337};
\n+
\n+
338
\n+
339//
\n+
340// Inline implementations:
\n+
341//
\n+\n+
\n+\n+
344 _preserveQuads = on;
\n+
345 return *this;
\n+
346}
\n+
\n+\n+
\n+\n+
349 _facetSize4 = (numIndices == 4);
\n+
350 return *this;
\n+
351}
\n+
\n+\n+
\n+\n+
354 _facetStride = (short) stride;
\n+
355 return *this;
\n+
356}
\n+
\n+\n+
\n+\n+
359 _coordStride = (short) stride;
\n+
360 return *this;
\n+
361}
\n+
\n+
362
\n+
363template <typename REAL>
\n+
364inline int
\n+
\n+
365Tessellation::GetVertexCoord(int vertex, REAL coord[]) const {
\n+
366 _param.GetVertexCoord(vertex, coord);
\n+
367 return 1;
\n+
368}
\n+
\n+
369
\n+
370template <typename REAL>
\n+
371inline int
\n+
\n+
372Tessellation::GetCoords(REAL coordTuples[]) const {
\n+
373 int nCoords = GetBoundaryCoords(coordTuples);
\n+
374 nCoords += GetInteriorCoords(coordTuples + nCoords * _coordStride);
\n+
375 return nCoords;
\n+
376}
\n+
\n+
377
\n+
378} // end namespace Bfr
\n+
379
\n+
380} // end namespace OPENSUBDIV_VERSION
\n+
381using namespace OPENSUBDIV_VERSION;
\n+
382
\n+
383} // end namespace OpenSubdiv
\n+
384
\n+
385#endif /* OPENSUBDIV3_BFR_TESSELLATION */
\n \n-
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n-
float GetVertexSharpness() const
Return the sharpness of the vertex.
\n-
bool Finalize()
Terminate the sequence of specifications.
\n-
void SetManifold(bool isManifold)
Declare the vertex neighborhood as manifold (ordered)
\n-
bool Initialize(int numIncidentFaces)
Initialize specification with the number of incident faces.
\n-
bool IsManifold() const
Return if vertex neighborhood is manifold.
\n-
bool HasEdgeSharpness() const
Return if sharpness was assigned to the incident edges.
\n-
int GetIncidentFaceSize(int faceIndex) const
Return the size of an incident face.
\n-
float GetManifoldEdgeSharpness(int edgeIndex) const
Return the sharpness assigned to a manifold edge.
\n-
void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp, float trailingEdgeSharp)
Assign sharpness to the edges of an incident face.
\n-
bool HasVertexSharpness() const
Return if sharpness was assigned to the vertex.
\n-
void ClearIncidentFaceSizes()
Remove any assigned sizes of incident faces.
\n-
void SetVertexSharpness(float sharpness)
Assign sharpness to the vertex.
\n-
void ClearVertexSharpness()
Remove any sharpness assigned to the vertex.
\n-
void ClearEdgeSharpness()
Remove any sharpness assigned to the incident edges.
\n-
void GetIncidentFaceEdgeSharpness(int faceIndex, float *leadingEdgeSharp, float *trailingEdgeSharp) const
Return the sharpness assigned to edges of an incident face.
\n-
bool IsBoundary() const
Return if vertex neighborhood is on a boundary.
\n-
bool IsValid() const
Return if instance is valid.
\n-
bool HasIncidentFaceSizes() const
Return if the sizes of incident faces are assigned.
\n-
void SetBoundary(bool isOnBoundary)
Declare the vertex neighborhood as being on a boundary.
\n-
void SetIncidentFaceSize(int faceIndex, int faceSize)
Assign the size of an incident face.
\n-
void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness)
Assign sharpness to the edge of a manifold neighborhood.
\n+
Simple class defining the 2D parameterization of a face.
\n+
int GetFaceSize() const
Returns the size (number of vertices) of the corresponding face.
\n+
void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const
Returns the (u,v) coordinate of a given vertex.
\n+
Encapsulates a specific tessellation pattern of a Parameterization.
\n+
int GetFaceSize() const
Return the size of the face.
\n+
int GetNumBoundaryCoords() const
Return the number of boundary coordinates.
\n+\n+
void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int const interiorIndices[])
Reassign all facet coordinate indices.
\n+
int GetCoordStride() const
Return the number of elements between each coordinate.
\n+
int GetNumEdgeCoords(int edge) const
Return the number of coordinates within a given edge (excluding those at its end vertices)
\n+
int GetInteriorCoords(REAL coordTuples[]) const
Retrieve the coordinates for the boundary.
\n+
int GetFacetStride() const
Return the number of elements between each facet.
\n+
bool IsUniform() const
Return if the pattern is uniform.
\n+
int GetNumCoords() const
Return the number of coordinates in the entire pattern.
\n+
int GetCoords(REAL coordTuples[]) const
Retrieve the coordinates for the entire pattern.
\n+
void TransformFacetCoordIndices(int facetTuples[], int commonOffset)
Apply a common offset to all facet coordinate indices.
\n+
Tessellation(Parameterization const &p, int numRates, int const rates[], Options const &options=Options())
General constructor providing multiple tessellation rates for a non-uniform tessellation.
\n+
Parameterization GetParameterization() const
Return the Parameterization.
\n+
void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int interiorOffset)
Reassign indices of boundary coordinates while offseting those of interior coordinates.
\n+
int GetFacetSize() const
Return the number of indices assigned to each facet.
\n+
Tessellation()=delete
Default construction is unavailable.
\n+
Tessellation(Parameterization const &p, int uniformRate, Options const &options=Options())
Simple constructor providing a single uniform tessellation rate.
\n+
int GetFacets(int facetTuples[]) const
Retrieve the facet indices for the entire pattern.
\n+
int GetNumFacets() const
Return the number of facets in the entire pattern.
\n+
int GetNumInteriorCoords() const
Return the number of interior coordinates.
\n+
int GetVertexCoord(int vertex, REAL coordTuples[]) const
Retrieve the coordinate for a given vertex of the face.
\n+
int GetBoundaryCoords(REAL coordTuples[]) const
Retrieve the coordinates for the boundary.
\n+\n+
int GetRates(int rates[]) const
Retrieve the rates assigned.
\n+
bool IsValid() const
Return true if correctly initialized.
\n+
Tessellation & operator=(Tessellation const &)=delete
\n+
int GetEdgeCoords(int edge, REAL coordTuples[]) const
Retrieve the coordinates for a given edge of the face (excluding those at its end vertices)
\n+
Options configure a Tessellation to specify the nature of both its results and the structure of the c...
\n+\n+
int GetCoordStride() const
Return the stride between (u,v) pairs.
\n+
Options & SetFacetSize(int numIndices)
Assign the number of indices per facet (must be 3 or 4, default is 3)
\n+
int GetFacetStride() const
Return the stride between facets.
\n+\n+
Options & SetCoordStride(int stride)
Assign the stride between (u,v) pairs (default is 2)
\n+
Options & SetFacetStride(int stride)
Assign the stride between facets (default is facet size)
\n+
bool PreserveQuads() const
Return if preservation of quads is set.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-vertexDescriptor.h\n+tessellation.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2021 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,446 +24,367 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H\n-26#define OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H\n+25#ifndef OPENSUBDIV3_BFR_TESSELLATION_H\n+26#define OPENSUBDIV3_BFR_TESSELLATION_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../vtr/stackBuffer.h\"\n+30#include \"../bfr/parameterization.h\"\n 31\n 32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n 33namespace OPENSUBDIV_VERSION {\n 34\n 35namespace Bfr {\n 36\n-50//\n-51// WIP - need to migrate some of these comments into Doxygen\n-52// - others will be moved to the external documentation\n-53//\n-54// It is used by subclasses of SurfaceFactory to provide a complete\n-55// topological description for each vertex of a face, i.e. invoked via\n-56// the virtual method:\n-57//\n-58// int populateFaceVertexDescriptor(Index baseFace,\n-59// int cornerVertex,\n-60// VertexDescriptor & v) const;\n-61//\n-62// Assignment of the full topology can be involved in the presence of\n-63// irregular faces, non-manifold topology or creasing around a vertex, but\n-64// many cases will be simple. For example, to specify a regular boundary\n-65// vertex of a Catmark mesh without any optional sharpness:\n-66//\n-67// int numIncidentFaces = 2;\n-68// bool vertexOnBoundary = true;\n-69//\n-70// vd.Initialize(numIncidentFaces);\n-71// vd.SetManifold(true);\n-72// vd.SetBoundary(vertexOnBoundary);\n-73// vd.ClearIncidentFaceSizes();\n-74// vd.Finalize();\n-75//\n-76// For a more general example, to assign a vertex of some valence whose\n-77// incident faces are of different sizes (e.g. required when triangles\n-78// appear around a vertex in an otherwise quad-dominant Catmark mesh):\n-79//\n-80// int numIncidentFaces = meshVertex.GetNumIncidentFaces();\n-81// bool vertexOnBoundary = meshVertex.IsBoundar();\n-82//\n-83// vd.Initialize(numIncidentFaces);\n-84// vd.SetManifold(true);\n-85// vd.SetBoundary(vertexOnBoundary);\n-86//\n-87// for (int i = 0; i < numIncidentFaces; ++i) {\n-88// vd.SetIncidentFaceSize(i, meshVertex.GetIncidentFaceSize(i));\n-89// }\n-90// vd.Finalize();\n-91//\n-92// These examples specify the incident faces as forming a manifold ring\n-93// (or half-ring) around the vertex, i.e. they can be specified as a\n-94// continuous, connected sequence in counter-clockwise order (and also\n-95// without degeneracies). In the case of a boundary vertex, the first\n-96// face must be on the leading edge of the boundary while the last is on\n-97// the trailing edge. For an interior vertex, which face is specified\n-98// first does not matter (since the set is periodic).\n-99//\n-100// In both cases, the location of the base face in this sequence -- the\n-101// face whose corner vertex is being described here -- must be specified\n-102// in the return value to populateFaceVertexDescriptor() (e.g. when a\n-103// boundary vertex has 3 incident faces, a return value of 0, 1 or 2\n-104// will indicate which is the base face).\n-105//\n-106// The corresponding methods to specify mesh control vertex indices (or\n-107// face-varying indices) complete the specification of the neighborhood:\n-108//\n-109// int getFaceCornerVertexIndices(Index baseFace, int cornerVertex,\n-110// Index vertexIndices[]) const;\n-111//\n-112// int getFaceCornerFVarValueIndices(Index baseFace, int cornerVertex,\n-113// Index fvarValueIndices[],\n-114// int fvarChannel) const;\n-115//\n-116// and are invoked by the Factory when needed.\n-117//\n-118// For each incident face, the indices for all vertices of that face are\n-119// to be specified (not the one-ring or some other subset). These indices\n-120// must also be specified in an orientation relative to the vertex, i.e.\n-121// for a vertex A and an incident face with face-vertices that may be\n-122// stored internally as {D, C, A, B}, they must be specified with A first\n-123// as {A, B, C, D}. This may seem a bit cumbersome, but it has clear\n-124// advantages when dealing with face-varying indices and unordered faces.\n-125//\n-126// More compact ways of specifying vertex indices for ordered, manifold\n-127// cases may be worth exploring in future, but face-varying indices and\n-128// non-manifold (unordered) vertices will always require such a full set,\n-129// so both methods will need to co-exist.\n-130//\n-_\b1_\b3_\b1class _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n-132public:\n-133 // The full declaration must be enclosed by calls to these methods:\n-134 //\n-135 // Note that vertex valences or face sizes in excess of those defined\n-136 // in Bfr::Limits (typically 16-bits) are not valid. When specifying\n-137 // values in excess of these limits, initialization will fail and/or\n-138 // the descriptor will be marked invalid and finalization will fail.\n-139 //\n-140\n-142\n-149\n-_\b1_\b5_\b1 bool _\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be(int numIncidentFaces);\n-152\n-_\b1_\b5_\b4 bool _\bF_\bi_\bn_\ba_\bl_\bi_\bz_\be();\n-155\n-157 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const;\n-159\n-160 //\n-161 // WIP - need to migrate these comments into Doxygen\n-162 //\n-163 // Three groups of methods describe the topology around a vertex:\n-164 // - simple properties (vertex is a boundary, manifold, etc.)\n-165 // - sizes of incident faces (constant or size for each face)\n-166 // - sharpness of the vertex and its incident edges (optional)\n-167 //\n-168\n-169 // Manifold and boundary conditions:\n-170 //\n-171 // The manifold property is a strict condition but preferred for\n-172 // efficiency and is usually available from common connected mesh\n-173 // representations. When declaring the topology as \"manifold\",\n-174 // the Factory assumes the following:\n-175 //\n-176 // - all incident faces are \"ordered\" (counter-clockwise)\n-177 // - all incident faces are consistently oriented\n-178 // - all incident edges are non-degenerate\n-179 //\n-180 // If not certain that all of these conditions are met, it is best\n-181 // to not declare manifold -- leaving the Factory to make sense of\n-182 // the set of incident faces from the face-vertex indices that are\n-183 // provided elsewhere.\n-184 //\n-185\n-187\n-191\n-193 void _\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(bool isManifold);\n-194\n-196 void _\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(bool isOnBoundary);\n-197\n-199 void _\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int faceIndex, int faceSize);\n-200\n-202 void _\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs();\n+_\b5_\b1class _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn {\n+52public:\n+_\b6_\b5 class _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+66 public:\n+_\b6_\b7 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _preserveQuads(false), _facetSize4(false),\n+68 _coordStride(0), _facetStride(0) { }\n+69\n+72 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs(bool on);\n+_\b7_\b4 bool _\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs() const { return _preserveQuads; }\n+75\n+78 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be(int numIndices);\n+79 // @brief Return the number of indices per facet\n+_\b8_\b0 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be() const { return 3 + (int)_facetSize4; }\n+81\n+83 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be(int stride);\n+_\b8_\b5 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be() const { return _facetStride; }\n+86\n+88 _\bO_\bp_\bt_\bi_\bo_\bn_\bs & _\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be(int stride);\n+_\b9_\b0 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be() const { return _coordStride; }\n+91\n+92 private:\n+93 unsigned int _preserveQuads : 1;\n+94 unsigned int _facetSize4 : 1;\n+95\n+96 short _coordStride;\n+97 short _facetStride;\n+98 };\n+99\n+100public:\n+102\n+111\n+_\b1_\b1_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p, int uniformRate,\n+119 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n+120\n+_\b1_\b5_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p, int numRates, int const rates[],\n+159 _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n+160\n+_\b1_\b6_\b2 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const { return _isValid; }\n+163\n+_\b1_\b6_\b5 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn() = delete;\n+166\n+_\b1_\b6_\b7 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn(_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn const &) = delete;\n+_\b1_\b6_\b8 _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=(_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn const &) = delete;\n+_\b1_\b6_\b9 _\b~_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn();\n+171\n+173\n+177\n+_\b1_\b7_\b9 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn() const { return _param; }\n+180\n+_\b1_\b8_\b2 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() const { return _param._\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(); }\n+183\n+_\b1_\b8_\b5 int _\bG_\be_\bt_\bR_\ba_\bt_\be_\bs(int rates[]) const;\n+186\n+_\b1_\b8_\b8 bool _\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm() const { return _isUniform; }\n+190\n+192\n 203\n-205 void _\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness);\n+_\b2_\b0_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bo_\br_\bd_\bs() const { return _numInteriorPoints + _numBoundaryPoints;\n+}\n 206\n-208 void _\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs();\n+_\b2_\b0_\b8 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be() const { return _coordStride; }\n 209\n-221 void _\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex, float edgeSharpness);\n-222\n-238 void _\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex, float leadingEdgeSharp,\n-239 float trailingEdgeSharp);\n-240\n-242 void _\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs();\n-244\n-246\n-251\n-253 bool _\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd() const;\n-254\n-256 bool _\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const;\n-257\n-259 bool _\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() const;\n-260\n-262 int _\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int faceIndex) const;\n-263\n-265 bool _\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n+_\b2_\b1_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs() const { return _numBoundaryPoints; }\n+212\n+_\b2_\b1_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs() const { return _numInteriorPoints; }\n+215\n+_\b2_\b1_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs(int edge) const { return _outerRates[edge] - 1; }\n+219\n+221 template \n+222 int _\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n+223\n+225 template \n+_\b2_\b2_\b6 int _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n+227\n+229 template \n+_\b2_\b3_\b0 int _\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const;\n+231\n+233 template \n+234 int _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertex, REAL coordTuples[]) const;\n+235\n+238 template \n+_\b2_\b3_\b9 int _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs(int edge, REAL coordTuples[]) const;\n+241\n+243\n+253\n+_\b2_\b5_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bt_\bs() const { return _numFacets; }\n+256\n+_\b2_\b5_\b8 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be() const { return _facetSize; }\n+259\n+_\b2_\b6_\b1 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be() const { return _facetStride; }\n+262\n+_\b2_\b6_\b4 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bs(int facetTuples[]) const;\n 266\n-268 float _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n-269\n-271 bool _\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const;\n-272\n-274 float _\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex) const;\n-275\n-277 void _\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n-278 float * leadingEdgeSharp, float * trailingEdgeSharp) const;\n-280\n-281protected:\n-283 friend class FaceVertex;\n-284\n-285 _\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() { }\n-286 _\b~_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() { }\n-287\n-288 typedef Vtr::internal::StackBuffer IntBuffer;\n-289 typedef Vtr::internal::StackBuffer FloatBuffer;\n-290\n-291 void initFaceSizes();\n-292 void initEdgeSharpness();\n-294\n-295protected:\n-297 // Member variables assigned through the above interface:\n-298 unsigned short _isValid : 1;\n-299 unsigned short _isInitialized : 1;\n-300 unsigned short _isFinalized : 1;\n-301\n-302 unsigned short _isManifold : 1;\n-303 unsigned short _isBoundary : 1;\n-304\n-305 unsigned short _hasFaceSizes : 1;\n-306 unsigned short _hasEdgeSharpness : 1;\n-307\n-308 short _numFaces;\n-309 float _vertSharpness;\n-310\n-311 FloatBuffer _faceEdgeSharpness;\n-312 IntBuffer _faceSizeOffsets;\n-314};\n-315\n-316//\n-317// Public inline methods for simple assignment:\n-318//\n-319inline bool\n-_\b3_\b2_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd() const {\n-321 return _isValid;\n-322}\n-323\n-324inline void\n-_\b3_\b2_\b5_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(bool isManifold) {\n-326 _isManifold = isManifold;\n-327}\n-328inline bool\n-_\b3_\b2_\b9_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd() const {\n-330 return _isManifold;\n-331}\n-332\n-333inline void\n-_\b3_\b3_\b4_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(bool isBoundary) {\n-335 _isBoundary = isBoundary;\n-336}\n-337inline bool\n-_\b3_\b3_\b8_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const {\n-339 return _isBoundary;\n-340}\n-341\n-342//\n-343// Public inline methods involving sizes of incident faces:\n-344//\n-345inline bool\n-_\b3_\b4_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() const {\n-347 return _hasFaceSizes;\n-348}\n-349inline void\n-_\b3_\b5_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs() {\n-351 _hasFaceSizes = false;\n-352}\n-353\n-354inline void\n-_\b3_\b5_\b5_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int incFaceIndex, int faceSize) {\n-356\n-357 if (!_hasFaceSizes) initFaceSizes();\n-358\n-359 _faceSizeOffsets[incFaceIndex] = faceSize;\n-360}\n-361inline int\n-_\b3_\b6_\b2_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be(int incFaceIndex) const {\n-363\n-364 return _isFinalized ?\n-365 (_faceSizeOffsets[incFaceIndex+1] - _faceSizeOffsets[incFaceIndex]) :\n-366 _faceSizeOffsets[incFaceIndex];\n-367}\n-368\n-369//\n-370// Public inline methods involving vertex sharpness:\n-371//\n-372inline bool\n-_\b3_\b7_\b3_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n-374 return _vertSharpness > 0.0f;\n-375}\n-376inline void\n-_\b3_\b7_\b7_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() {\n-378 _vertSharpness = 0.0f;\n-379}\n-380\n-381inline void\n-_\b3_\b8_\b2_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertSharpness) {\n-383 _vertSharpness = vertSharpness;\n-384}\n-385inline float\n-_\b3_\b8_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n-387 return _vertSharpness;\n-388}\n-389\n-390//\n-391// Public inline methods involving vertex sharpness:\n-392//\n-393inline bool\n-_\b3_\b9_\b4_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() const {\n-395 return _hasEdgeSharpness;\n-396}\n-397inline void\n-_\b3_\b9_\b8_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs() {\n-399 _hasEdgeSharpness = false;\n-400}\n-401\n-402inline void\n-_\b4_\b0_\b3_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex, float sharpness) {\n-404\n-405 if (!_hasEdgeSharpness) initEdgeSharpness();\n-406\n-407 // Assign the leading edge of the face after the edge (even index):\n-408 if (edgeIndex < _numFaces) {\n-409 _faceEdgeSharpness[2*edgeIndex] = sharpness;\n-410 }\n-411\n-412 // Assign the trailing edge of the face before the edge (odd index):\n-413 if (edgeIndex > 0) {\n-414 _faceEdgeSharpness[2*edgeIndex-1] = sharpness;\n-415 } else if (!_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by()) {\n-416 _faceEdgeSharpness[2*_numFaces-1] = sharpness;\n-417 }\n-418}\n-419inline float\n-_\b4_\b2_\b0_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int edgeIndex) const {\n-421\n-422 // All edges are first of the pair (even index) except last of boundary\n-423 return _faceEdgeSharpness[2*edgeIndex - (edgeIndex == _numFaces)];\n-424}\n-425\n-426inline void\n-_\b4_\b2_\b7_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n-428 float leadingEdgeSharpness, float trailingEdgeSharpness) {\n-429\n-430 if (!_hasEdgeSharpness) initEdgeSharpness();\n-431\n-432 _faceEdgeSharpness[2*faceIndex ] = leadingEdgeSharpness;\n-433 _faceEdgeSharpness[2*faceIndex+1] = trailingEdgeSharpness;\n-434}\n-435inline void\n-_\b4_\b3_\b6_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(int faceIndex,\n-437 float * leadingEdgeSharpness, float * trailingEdgeSharpness) const {\n-438\n-439 *leadingEdgeSharpness = _faceEdgeSharpness[2*faceIndex];\n-440 *trailingEdgeSharpness = _faceEdgeSharpness[2*faceIndex+1];\n-441}\n-442\n-443} // end namespace Bfr\n-444\n-445} // end namespace OPENSUBDIV_VERSION\n-446using namespace OPENSUBDIV_VERSION;\n-447} // end namespace OpenSubdiv\n-448\n-449#endif /* OPENSUBDIV3_BFR_VERTEX_DESCRIPTOR_H */\n+268\n+283\n+_\b2_\b8_\b5 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[], int commonOffset);\n+286\n+_\b2_\b8_\b9 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[],\n+290 int const boundaryIndices[],\n+291 int interiorOffset);\n+292\n+_\b2_\b9_\b4 void _\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs(int facetTuples[],\n+295 int const boundaryIndices[],\n+296 int const interiorIndices[]);\n+298\n+299private:\n+300 // Private initialization methods:\n+301 bool validateArguments(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p,\n+302 int nRates, int const rates[], _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n+303\n+304 void initialize(_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn const & p,\n+305 int nRates, int const rates[], _\bO_\bp_\bt_\bi_\bo_\bn_\bs const & options);\n+306\n+307 void initializeDefaults();\n+308 int initializeRates(int nRates, int const rates[]);\n+309 void initializeInventoryForParamTri(int sumOfOuterRates);\n+310 void initializeInventoryForParamQuad(int sumOfOuterRates);\n+311 void initializeInventoryForParamQPoly(int sumOfOuterRates);\n+312\n+313private:\n+314 // Private members:\n+315 _\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn _param;\n+316\n+317 unsigned short _isValid : 1;\n+318 unsigned short _isUniform : 1;\n+319 unsigned short _triangulate : 1;\n+320 unsigned short _singleFace : 1;\n+321 unsigned short _segmentedFace : 1;\n+322 unsigned short _triangleFan : 1;\n+323 unsigned short _splitQuad : 1;\n+324\n+325 short _facetSize;\n+326 int _facetStride;\n+327 int _coordStride;\n+328\n+329 int _numGivenRates;\n+330 int _numBoundaryPoints;\n+331 int _numInteriorPoints;\n+332 int _numFacets;\n+333\n+334 int _innerRates[2];\n+335 int* _outerRates;\n+336 int _outerRatesLocal[4];\n+337};\n+338\n+339//\n+340// Inline implementations:\n+341//\n+342inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b3_\b4_\b3_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs(bool on) {\n+344 _preserveQuads = on;\n+345 return *this;\n+346}\n+347inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b3_\b4_\b8_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be(int numIndices) {\n+349 _facetSize4 = (numIndices == 4);\n+350 return *this;\n+351}\n+352inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b3_\b5_\b3_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be(int stride) {\n+354 _facetStride = (short) stride;\n+355 return *this;\n+356}\n+357inline _\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs &\n+_\b3_\b5_\b8_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be(int stride) {\n+359 _coordStride = (short) stride;\n+360 return *this;\n+361}\n+362\n+363template \n+364inline int\n+_\b3_\b6_\b5_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(int vertex, REAL coord[]) const {\n+366 _param._\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd(vertex, coord);\n+367 return 1;\n+368}\n+369\n+370template \n+371inline int\n+_\b3_\b7_\b2_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs(REAL coordTuples[]) const {\n+373 int nCoords = _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs(coordTuples);\n+374 nCoords += _\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs(coordTuples + nCoords * _coordStride);\n+375 return nCoords;\n+376}\n+377\n+378} // end namespace Bfr\n+379\n+380} // end namespace OPENSUBDIV_VERSION\n+381using namespace OPENSUBDIV_VERSION;\n+382\n+383} // end namespace OpenSubdiv\n+384\n+385#endif /* OPENSUBDIV3_BFR_TESSELLATION */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-Simple class used by subclasses of SurfaceFactory to describe a vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float GetVertexSharpness() const\n-Return the sharpness of the vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bi_\bn_\ba_\bl_\bi_\bz_\be\n-bool Finalize()\n-Terminate the sequence of specifications.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n-void SetManifold(bool isManifold)\n-Declare the vertex neighborhood as manifold (ordered)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bi_\bt_\bi_\ba_\bl_\bi_\bz_\be\n-bool Initialize(int numIncidentFaces)\n-Initialize specification with the number of incident faces.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n-bool IsManifold() const\n-Return if vertex neighborhood is manifold.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-bool HasEdgeSharpness() const\n-Return if sharpness was assigned to the incident edges.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-int GetIncidentFaceSize(int faceIndex) const\n-Return the size of an incident face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float GetManifoldEdgeSharpness(int edgeIndex) const\n-Return the sharpness assigned to a manifold edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n-_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void SetIncidentFaceEdgeSharpness(int faceIndex, float leadingEdgeSharp, float\n-trailingEdgeSharp)\n-Assign sharpness to the edges of an incident face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-bool HasVertexSharpness() const\n-Return if sharpness was assigned to the vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs\n-void ClearIncidentFaceSizes()\n-Remove any assigned sizes of incident faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void SetVertexSharpness(float sharpness)\n-Assign sharpness to the vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void ClearVertexSharpness()\n-Remove any sharpness assigned to the vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bC_\bl_\be_\ba_\br_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void ClearEdgeSharpness()\n-Remove any sharpness assigned to the incident edges.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n-_\bG_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void GetIncidentFaceEdgeSharpness(int faceIndex, float *leadingEdgeSharp, float\n-*trailingEdgeSharp) const\n-Return the sharpness assigned to edges of an incident face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n-bool IsBoundary() const\n-Return if vertex neighborhood is on a boundary.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Simple class defining the 2D parameterization of a face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+int GetFaceSize() const\n+Returns the size (number of vertices) of the corresponding face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n+void GetVertexCoord(int vertexIndex, REAL uvCoord[2]) const\n+Returns the (u,v) coordinate of a given vertex.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+Encapsulates a specific tessellation pattern of a Parameterization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+int GetFaceSize() const\n+Return the size of the face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs\n+int GetNumBoundaryCoords() const\n+Return the number of boundary coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\b~_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+~Tessellation()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[],\n+int const interiorIndices[])\n+Reassign all facet coordinate indices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n+int GetCoordStride() const\n+Return the number of elements between each coordinate.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs\n+int GetNumEdgeCoords(int edge) const\n+Return the number of coordinates within a given edge (excluding those at its\n+end vertices)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs\n+int GetInteriorCoords(REAL coordTuples[]) const\n+Retrieve the coordinates for the boundary.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n+int GetFacetStride() const\n+Return the number of elements between each facet.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm\n+bool IsUniform() const\n+Return if the pattern is uniform.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bo_\br_\bd_\bs\n+int GetNumCoords() const\n+Return the number of coordinates in the entire pattern.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b0_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bs\n+int GetCoords(REAL coordTuples[]) const\n+Retrieve the coordinates for the entire pattern.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+void TransformFacetCoordIndices(int facetTuples[], int commonOffset)\n+Apply a common offset to all facet coordinate indices.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+Tessellation(Parameterization const &p, int numRates, int const rates[],\n+Options const &options=Options())\n+General constructor providing multiple tessellation rates for a non-uniform\n+tessellation.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\be_\bt_\be_\br_\bi_\bz_\ba_\bt_\bi_\bo_\bn\n+Parameterization GetParameterization() const\n+Return the Parameterization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\br_\ba_\bn_\bs_\bf_\bo_\br_\bm_\bF_\ba_\bc_\be_\bt_\bC_\bo_\bo_\br_\bd_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+void TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[],\n+int interiorOffset)\n+Reassign indices of boundary coordinates while offseting those of interior\n+coordinates.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n+int GetFacetSize() const\n+Return the number of indices assigned to each facet.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+Tessellation()=delete\n+Default construction is unavailable.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+Tessellation(Parameterization const &p, int uniformRate, Options const\n+&options=Options())\n+Simple constructor providing a single uniform tessellation rate.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bs\n+int GetFacets(int facetTuples[]) const\n+Retrieve the facet indices for the entire pattern.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bt_\bs\n+int GetNumFacets() const\n+Return the number of facets in the entire pattern.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bI_\bn_\bt_\be_\br_\bi_\bo_\br_\bC_\bo_\bo_\br_\bd_\bs\n+int GetNumInteriorCoords() const\n+Return the number of interior coordinates.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b2_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\bo_\br_\bd\n+int GetVertexCoord(int vertex, REAL coordTuples[]) const\n+Retrieve the coordinate for a given vertex of the face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bo_\br_\bd_\bs\n+int GetBoundaryCoords(REAL coordTuples[]) const\n+Retrieve the coordinates for the boundary.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn\n+Tessellation(Tessellation const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bR_\ba_\bt_\be_\bs\n+int GetRates(int rates[]) const\n+Retrieve the rates assigned.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n bool IsValid() const\n-Return if instance is valid.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bH_\ba_\bs_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be_\bs\n-bool HasIncidentFaceSizes() const\n-Return if the sizes of incident faces are assigned.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n-void SetBoundary(bool isOnBoundary)\n-Declare the vertex neighborhood as being on a boundary.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bI_\bn_\bc_\bi_\bd_\be_\bn_\bt_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-void SetIncidentFaceSize(int faceIndex, int faceSize)\n-Assign the size of an incident face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b3_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bS_\be_\bt_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-void SetManifoldEdgeSharpness(int edgeIndex, float edgeSharpness)\n-Assign sharpness to the edge of a manifold neighborhood.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b0_\b3\n+Return true if correctly initialized.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b1_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+Tessellation & operator=(Tessellation const &)=delete\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bo_\bo_\br_\bd_\bs\n+int GetEdgeCoords(int edge, REAL coordTuples[]) const\n+Retrieve the coordinates for a given edge of the face (excluding those at its\n+end vertices)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options configure a Tessellation to specify the nature of both its results and\n+the structure of the c...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n+int GetCoordStride() const\n+Return the stride between (u,v) pairs.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n+Options & SetFacetSize(int numIndices)\n+Assign the number of indices per facet (must be 3 or 4, default is 3)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n+int GetFacetStride() const\n+Return the stride between facets.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bi_\bz_\be\n+int GetFacetSize() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bC_\bo_\bo_\br_\bd_\bS_\bt_\br_\bi_\bd_\be\n+Options & SetCoordStride(int stride)\n+Assign the stride between (u,v) pairs (default is 2)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\ba_\bc_\be_\bt_\bS_\bt_\br_\bi_\bd_\be\n+Options & SetFacetStride(int stride)\n+Assign the stride between facets (default is facet size)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b3_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bB_\bf_\br_\b:_\b:_\bT_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bP_\br_\be_\bs_\be_\br_\bv_\be_\bQ_\bu_\ba_\bd_\bs\n+bool PreserveQuads() const\n+Return if preservation of quads is set.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh_\b:_\b7_\b4\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bb_\bf_\br\n- * _\bv_\be_\br_\bt_\be_\bx_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bt_\be_\bs_\bs_\be_\bl_\bl_\ba_\bt_\bi_\bo_\bn_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00683_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00683_source.html", "unified_diff": "@@ -249,15 +249,15 @@\n
virtual int populateFaceVertexDescriptor(Index faceIndex, int faceVertex, VertexDescriptor *vertexDescriptor) const =0
Describe the topology of incident faces around a face-vertex.
\n
virtual bool getFaceNeighborhoodVertexIndicesIfRegular(Index faceIndex, Index vertexIndices[]) const
\n
virtual bool getFaceNeighborhoodFVarValueIndicesIfRegular(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const
\n
virtual int getFaceFVarValueIndices(Index faceIndex, FVarID fvarID, Index fvarValueIndices[]) const =0
Gather the face-varying indices of the face's vertices.
\n
virtual int getFaceVertexIndices(Index faceIndex, Index vertexIndices[]) const =0
Gather the indices of the face's vertices.
\n
virtual bool isFaceHole(Index faceIndex) const =0
Returns if a face is a hole.
\n
std::intptr_t FVarID
Type used to identify and specify face-varying primvars.
\n-
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n+
Simple class used by subclasses of SurfaceFactory to describe a vertex.
\n \n \n \n
\n
\n \n \n
\n
    \n
  • opensubdiv
  • bfr
  • refinerSurfaceFactory.h
  • \n
  • Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by \"doxygen\"/ 1.9.8
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00707.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00707.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyRefiner.h File Reference\n+OpenSubdiv: opensubdiv/far/topologyLevel.h File Reference\n \n \n \n \n \n \n \n@@ -90,53 +90,44 @@\n
\n \n \n
\n \n-
topologyRefiner.h File Reference
\n+
topologyLevel.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/types.h"
\n-#include "../sdc/options.h"
\n+#include "../vtr/level.h"
\n+#include "../vtr/refinement.h"
\n #include "../far/types.h"
\n-#include "../far/topologyLevel.h"
\n #include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  TopologyRefiner
 Stores topology data for a specified set of refinement options. More...
 
struct  TopologyRefiner::UniformOptions
 Uniform refinement options. More...
 
struct  TopologyRefiner::AdaptiveOptions
 Adaptive refinement options. More...
class  TopologyLevel
 An interface for accessing data in a specific level of a refined topology hierarchy. More...
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Vtr
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,37 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyRefiner.h File Reference\n+topologyLevel.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n #include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-\u00a0 Stores topology data for a specified set of refinement options.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 Uniform refinement options. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 Adaptive refinement options. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n+\u00a0 An interface for accessing data in a specific level of a refined\n+ topology hierarchy. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00707.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00707.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,3 @@\n var a00707 = [\n- [\"TopologyRefiner\", \"a01121.html\", \"a01121\"],\n- [\"UniformOptions\", \"a01125.html\", \"a01125\"],\n- [\"AdaptiveOptions\", \"a01129.html\", \"a01129\"]\n+ [\"TopologyLevel\", \"a01113.html\", \"a01113\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00707_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00707_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyRefiner.h Source File\n+OpenSubdiv: opensubdiv/far/topologyLevel.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
topologyRefiner.h
\n+
topologyLevel.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2014 DreamWorks Animation LLC.
\n+
2// Copyright 2015 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,305 +118,228 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H
\n-
25#define OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H
\n+
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H
\n+
25#define OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H
\n
26
\n
27#include "../version.h"
\n
28
\n-
29#include "../sdc/types.h"
\n-
30#include "../sdc/options.h"
\n+
29#include "../vtr/level.h"
\n+
30#include "../vtr/refinement.h"
\n
31#include "../far/types.h"
\n-
32#include "../far/topologyLevel.h"
\n-
33
\n-
34#include <vector>
\n-
35
\n-
36
\n-
37namespace OpenSubdiv {
\n-
38namespace OPENSUBDIV_VERSION {
\n+
32
\n+
33#include <vector>
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Far {
\n
39
\n-
40namespace Vtr { namespace internal { class SparseSelector; } }
\n-
41namespace Far { namespace internal { class FeatureMask; } }
\n-
42
\n-
43namespace Far {
\n-
44
\n-
45template <typename REAL> class PrimvarRefinerReal;
\n-
46template <class MESH> class TopologyRefinerFactory;
\n-
47
\n-
\n-\n-
52
\n-
53public:
\n-
54
\n-\n-
57
\n-\n+
\n+\n+
50
\n+
51public:
\n+
53
\n
60
\n-
62 Sdc::SchemeType GetSchemeType() const { return _subdivType; }
\n+
62 int GetNumVertices() const { return _level->getNumVertices(); }
\n
63
\n-
65 Sdc::Options GetSchemeOptions() const { return _subdivOptions; }
\n+
65 int GetNumFaces() const { return _level->getNumFaces(); }
\n
66
\n-
68 bool IsUniform() const { return _isUniform; }
\n+
68 int GetNumEdges() const { return _level->getNumEdges(); }
\n
69
\n-
71 int GetNumLevels() const { return (int)_farLevels.size(); }
\n-
72
\n-
74 int GetMaxLevel() const { return _maxLevel; }
\n+
71 int GetNumFaceVertices() const { return _level->getNumFaceVerticesTotal(); }
\n+
73
\n
75
\n-
77 int GetMaxValence() const { return _maxValence; }
\n-
78
\n-
80 bool HasHoles() const { return _hasHoles; }
\n-
81
\n-
83 int GetNumVerticesTotal() const { return _totalVertices; }
\n-
84
\n-
86 int GetNumEdgesTotal() const { return _totalEdges; }
\n-
87
\n-
89 int GetNumFacesTotal() const { return _totalFaces; }
\n-
90
\n-
92 int GetNumFaceVerticesTotal() const { return _totalFaceVertices; }
\n-
93
\n-
95 TopologyLevel const & GetLevel(int level) const { return _farLevels[level]; }
\n-
96
\n-
98
\n+
90 //
\n+
91
\n+
93 ConstIndexArray GetFaceVertices(Index f) const { return _level->getFaceVertices(f); }
\n+
94
\n+
96 ConstIndexArray GetFaceEdges(Index f) const { return _level->getFaceEdges(f); }
\n+
97
\n+
99 ConstIndexArray GetEdgeVertices(Index e) const { return _level->getEdgeVertices(e); }
\n
100
\n-
101 //
\n-
102 // Uniform refinement
\n-
103 //
\n-
104
\n-
\n-\n-
119
\n-
\n-
120 UniformOptions(int level) :
\n-
121 refinementLevel(level & 0xf),
\n-\n-
123 fullTopologyInLastLevel(false) { }
\n-
\n+
102 ConstIndexArray GetEdgeFaces(Index e) const { return _level->getEdgeFaces(e); }
\n+
103
\n+
105 ConstIndexArray GetVertexFaces(Index v) const { return _level->getVertexFaces(v); }
\n+
106
\n+
108 ConstIndexArray GetVertexEdges(Index v) const { return _level->getVertexEdges(v); }
\n+
109
\n+
111 ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const { return _level->getVertexFaceLocalIndices(v); }
\n+
112
\n+
114 ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const { return _level->getVertexEdgeLocalIndices(v); }
\n+
115
\n+
117 ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const { return _level->getEdgeFaceLocalIndices(e); }
\n+
118
\n+
120 Index FindEdge(Index v0, Index v1) const { return _level->findEdge(v0, v1); }
\n+
122
\n
124
\n-
126 void SetRefinementLevel(int level) { refinementLevel = level & 0xf; }
\n-
127
\n-
128 unsigned int refinementLevel:4,
\n-\n-\n-
134 };
\n-
\n+
126
\n+
128 bool IsEdgeNonManifold(Index e) const { return _level->isEdgeNonManifold(e); }
\n+
129
\n+
131 bool IsVertexNonManifold(Index v) const { return _level->isVertexNonManifold(v); }
\n+
132
\n+
134 bool IsEdgeBoundary(Index e) const { return _level->getEdgeTag(e)._boundary; }
\n
135
\n-\n-
147
\n-
149 UniformOptions GetUniformOptions() const { return _uniformOptions; }
\n-
150
\n-
151 //
\n-
152 // Adaptive refinement
\n-
153 //
\n-
154
\n-
\n-\n-
157
\n-
\n-
158 AdaptiveOptions(int level) :
\n-
159 isolationLevel(level & 0xf),
\n-
160 secondaryLevel(0xf),
\n-\n-
162 useInfSharpPatch(false),
\n-\n-\n-
\n-
165
\n-
167 void SetIsolationLevel(int level) { isolationLevel = level & 0xf; }
\n-
168
\n-
170 void SetSecondaryLevel(int level) { secondaryLevel = level & 0xf; }
\n+
137 bool IsVertexBoundary(Index v) const { return _level->getVertexTag(v)._boundary; }
\n+
138
\n+
140 bool IsVertexCorner(Index v) const { return (_level->getNumVertexFaces(v) == 1); }
\n+
141
\n+
162 bool IsVertexValenceRegular(Index v) const { return !_level->getVertexTag(v)._xordinary || IsVertexCorner(v); }
\n+
164
\n+
166
\n
171
\n-
172 unsigned int isolationLevel:4;
\n-
174 unsigned int secondaryLevel:4;
\n-
176 unsigned int useSingleCreasePatch:1;
\n-
178 unsigned int useInfSharpPatch:1;
\n-
180 unsigned int considerFVarChannels:1;
\n-\n-
184 };
\n-
\n-
185
\n-\n-
193 ConstIndexArray selectedFaces = ConstIndexArray());
\n-
194
\n-
196 AdaptiveOptions GetAdaptiveOptions() const { return _adaptiveOptions; }
\n-
197
\n-
199 void Unrefine();
\n-
200
\n-
201
\n-
203
\n-
205
\n-
207 int GetNumFVarChannels() const;
\n-
208
\n-\n-
211
\n-
213 int GetNumFVarValuesTotal(int channel = 0) const;
\n-
214
\n-
216
\n-
217protected:
\n-
218
\n-
219 //
\n-
220 // Lower level protected methods intended strictly for internal use:
\n-
221 //
\n-
222 template <class MESH>
\n-\n-\n-
225 friend class PatchTableBuilder;
\n-
226 friend class PatchBuilder;
\n-
227 friend class PtexIndices;
\n-
228 template <typename REAL>
\n-
229 friend class PrimvarRefinerReal;
\n-
230
\n-
231 // Copy constructor exposed via the factory class:
\n-\n-
233
\n-
234public:
\n-
235 // Levels and Refinements available internally (avoids need for more friends)
\n-
236 Vtr::internal::Level & getLevel(int l) { return *_levels[l]; }
\n-
237 Vtr::internal::Level const & getLevel(int l) const { return *_levels[l]; }
\n-
238
\n-
239 Vtr::internal::Refinement & getRefinement(int l) { return *_refinements[l]; }
\n-
240 Vtr::internal::Refinement const & getRefinement(int l) const { return *_refinements[l]; }
\n-
241
\n-
242private:
\n-
243 // Not default constructible or copyable:
\n-
244 TopologyRefiner() : _uniformOptions(0), _adaptiveOptions(0) { }
\n-
245 TopologyRefiner & operator=(TopologyRefiner const &) { return *this; }
\n-
246
\n-
247 void selectFeatureAdaptiveComponents(Vtr::internal::SparseSelector& selector,
\n-
248 internal::FeatureMask const & mask,
\n-
249 ConstIndexArray selectedFaces);
\n-
250 void selectLinearIrregularFaces(Vtr::internal::SparseSelector& selector,
\n-
251 ConstIndexArray selectedFaces);
\n-
252
\n-
253 void initializeInventory();
\n-
254 void updateInventory(Vtr::internal::Level const & newLevel);
\n+
173 float GetEdgeSharpness(Index e) const { return _level->getEdgeSharpness(e); }
\n+
174
\n+
176 float GetVertexSharpness(Index v) const { return _level->getVertexSharpness(v); }
\n+
177
\n+
179 bool IsEdgeInfSharp(Index e) const { return _level->getEdgeTag(e)._infSharp; }
\n+
180
\n+
182 bool IsVertexInfSharp(Index v) const { return _level->getVertexTag(v)._infSharp; }
\n+
183
\n+
185 bool IsEdgeSemiSharp(Index e) const { return _level->getEdgeTag(e)._semiSharp; }
\n+
186
\n+
188 bool IsVertexSemiSharp(Index v) const { return _level->getVertexTag(v)._semiSharp; }
\n+
189
\n+
191 bool IsFaceHole(Index f) const { return _level->isFaceHole(f); }
\n+
192
\n+
194 Sdc::Crease::Rule GetVertexRule(Index v) const { return _level->getVertexRule(v); }
\n+
196
\n+
198
\n+
228
\n+
230 int GetNumFVarChannels() const { return _level->getNumFVarChannels(); }
\n+
231
\n+
234 int GetNumFVarValues(int channel = 0) const { return _level->getNumFVarValues(channel); }
\n+
235
\n+
\n+
237 ConstIndexArray GetFaceFVarValues(Index f, int channel = 0) const {
\n+
238 return _level->getFaceFVarValues(f, channel);
\n+
239 }
\n+
\n+
240
\n+
\n+
242 bool DoesVertexFVarTopologyMatch(Index v, int channel = 0) const {
\n+
243 return _level->doesVertexFVarTopologyMatch(v, channel);
\n+
244 }
\n+
\n+
245
\n+
\n+
247 bool DoesEdgeFVarTopologyMatch(Index e, int channel = 0) const {
\n+
248 return _level->doesEdgeFVarTopologyMatch(e, channel);
\n+
249 }
\n+
\n+
250
\n+
\n+
252 bool DoesFaceFVarTopologyMatch(Index f, int channel = 0) const {
\n+
253 return _level->doesFaceFVarTopologyMatch(f, channel);
\n+
254 }
\n+
\n
255
\n-
256 void appendLevel(Vtr::internal::Level & newLevel);
\n-
257 void appendRefinement(Vtr::internal::Refinement & newRefinement);
\n-
258 void assembleFarLevels();
\n+
257
\n
259
\n-
260private:
\n-
261
\n-
262 Sdc::SchemeType _subdivType;
\n-
263 Sdc::Options _subdivOptions;
\n-
264
\n-
265 unsigned int _isUniform : 1;
\n-
266 unsigned int _hasHoles : 1;
\n-
267 unsigned int _hasIrregFaces : 1;
\n-
268 unsigned int _regFaceSize : 3;
\n-
269 unsigned int _maxLevel : 4;
\n-
270
\n-
271 // Options assigned on refinement:
\n-
272 UniformOptions _uniformOptions;
\n-
273 AdaptiveOptions _adaptiveOptions;
\n-
274
\n-
275 // Cumulative properties of all levels:
\n-
276 int _totalVertices;
\n-
277 int _totalEdges;
\n-
278 int _totalFaces;
\n-
279 int _totalFaceVertices;
\n-
280 int _maxValence;
\n-
281
\n-
282 // Note the base level may be shared with another instance
\n-
283 bool _baseLevelOwned;
\n+
260
\n+
262 ConstIndexArray GetFaceChildFaces(Index f) const { return _refToChild->getFaceChildFaces(f); }
\n+
263
\n+
265 ConstIndexArray GetFaceChildEdges(Index f) const { return _refToChild->getFaceChildEdges(f); }
\n+
266
\n+
268 ConstIndexArray GetEdgeChildEdges(Index e) const { return _refToChild->getEdgeChildEdges(e); }
\n+
269
\n+
271 Index GetFaceChildVertex( Index f) const { return _refToChild->getFaceChildVertex(f); }
\n+
272
\n+
274 Index GetEdgeChildVertex( Index e) const { return _refToChild->getEdgeChildVertex(e); }
\n+
275
\n+
277 Index GetVertexChildVertex(Index v) const { return _refToChild->getVertexChildVertex(v); }
\n+
278
\n+
280 Index GetFaceParentFace(Index f) const { return _refToParent->getChildFaceParentFace(f); }
\n+
282
\n
284
\n-
285 std::vector<Vtr::internal::Level *> _levels;
\n-
286 std::vector<Vtr::internal::Refinement *> _refinements;
\n-
287
\n-
288 std::vector<TopologyLevel> _farLevels;
\n-
289};
\n-
\n+
285
\n+
286 bool ValidateTopology() const { return _level->validateTopology(); }
\n+
287 void PrintTopology(bool children = true) const { _level->print((children && _refToChild) ? _refToChild : 0); }
\n+
289
\n
290
\n-
291
\n-
292inline int
\n-
\n-\n-
294
\n-
295 return _levels[0]->getNumFVarChannels();
\n-
296}
\n-
\n-\n-
\n-\n-
299
\n-
300 return _levels[0]->getFVarOptions(channel).GetFVarLinearInterpolation();
\n-
301}
\n-
\n-
302
\n-
303} // end namespace Far
\n-
304
\n-
305} // end namespace OPENSUBDIV_VERSION
\n-
306using namespace OPENSUBDIV_VERSION;
\n-
307} // end namespace OpenSubdiv
\n-
308
\n-
309#endif /* OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H */
\n+
291private:
\n+
292 friend class TopologyRefiner;
\n+
293
\n+
294 Vtr::internal::Level const * _level;
\n+
295 Vtr::internal::Refinement const * _refToParent;
\n+
296 Vtr::internal::Refinement const * _refToChild;
\n+
297
\n+
298public:
\n+
299 // Not intended for public use, but required by std::vector, etc...
\n+\n+\n+
302};
\n+
\n+
303
\n+
304} // end namespace Far
\n+
305
\n+
306} // end namespace OPENSUBDIV_VERSION
\n+
307using namespace OPENSUBDIV_VERSION;
\n+
308} // end namespace OpenSubdiv
\n+
309
\n+
310#endif /* OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H */
\n \n-
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n-
Applies refinement operations to generic primvar data.
\n-
Object used to compute and query ptex face indices.
Definition ptexIndices.h:46
\n-
An interface for accessing data in a specific level of a refined topology hierarchy.
\n-
Factory for constructing TopologyRefiners from specific mesh classes.
\n-
Stores topology data for a specified set of refinement options.
\n-
TopologyRefiner(TopologyRefiner const &source)
\n-
int GetMaxValence() const
Returns the maximum vertex valence in all levels.
\n-
Vtr::internal::Level const & getLevel(int l) const
\n-
bool HasHoles() const
Returns true if faces have been tagged as holes.
\n-
int GetNumLevels() const
Returns the number of refinement levels.
\n-
int GetNumFVarValuesTotal(int channel=0) const
Returns the total number of face-varying values in all levels.
\n-
Vtr::internal::Refinement const & getRefinement(int l) const
\n-
Sdc::Options GetSchemeOptions() const
Returns the subdivision options.
\n-\n-
bool IsUniform() const
Returns true if uniform refinement has been applied.
\n-
Sdc::SchemeType GetSchemeType() const
Returns the subdivision scheme.
\n-
int GetMaxLevel() const
Returns the highest level of refinement.
\n-
TopologyRefiner(Sdc::SchemeType type, Sdc::Options options=Sdc::Options())
Constructor.
\n-
int GetNumEdgesTotal() const
Returns the total number of edges in all levels.
\n-\n-
int GetNumFVarChannels() const
Returns the number of face-varying channels in the tables.
\n-
UniformOptions GetUniformOptions() const
Returns the options specified on refinement.
\n-
int GetNumFacesTotal() const
Returns the total number of edges in all levels.
\n-
int GetNumFaceVerticesTotal() const
Returns the total number of face vertices in all levels.
\n-
Vtr::internal::Refinement & getRefinement(int l)
\n-
void RefineUniform(UniformOptions options)
Refine the topology uniformly.
\n-\n-\n-
TopologyLevel const & GetLevel(int level) const
Returns a handle to access data specific to a particular level.
\n-
int GetNumVerticesTotal() const
Returns the total number of vertices in all levels.
\n-
void Unrefine()
Unrefine the topology, keeping only the base level.
\n-
AdaptiveOptions GetAdaptiveOptions() const
Returns the options specified on refinement.
\n-
Sdc::Options::FVarLinearInterpolation GetFVarLinearInterpolation(int channel=0) const
Returns the face-varying interpolation rule set for a given channel.
\n-
void RefineAdaptive(AdaptiveOptions options, ConstIndexArray selectedFaces=ConstIndexArray())
Feature Adaptive topology refinement.
\n-\n-
unsigned int refinementLevel
Number of refinement iterations.
\n-\n-
void SetRefinementLevel(int level)
Set uniform refinement level.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
void SetSecondaryLevel(int level)
Set secondary isolation level.
\n-
Private base class of Factories for constructing TopologyRefiners.
\n-
All supported options applying to subdivision scheme.
Definition options.h:51
\n-\n+\n+
An interface for accessing data in a specific level of a refined topology hierarchy.
\n+
Index GetFaceParentFace(Index f) const
Return the parent face (in the previous level) of a given face.
\n+\n+
bool IsVertexValenceRegular(Index v) const
Return if the valence of the vertex is regular (must be manifold)
\n+
float GetEdgeSharpness(Index e) const
Return the sharpness assigned a given edge.
\n+
bool DoesFaceFVarTopologyMatch(Index f, int channel=0) const
Return if face-varying topology around a face matches.
\n+
Sdc::Crease::Rule GetVertexRule(Index v) const
Return the subdivision rule assigned a given vertex specific to this level.
\n+
bool IsVertexCorner(Index v) const
Return if the vertex is a corner (only one incident face)
\n+
Index GetVertexChildVertex(Index v) const
Return the child vertex (in the next level) of a given vertex.
\n+
ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const
Access the local indices of an edge with respect to its incident faces.
\n+
ConstIndexArray GetFaceChildEdges(Index f) const
Access the child edges (in the next level) of a given face.
\n+
bool DoesEdgeFVarTopologyMatch(Index e, int channel=0) const
Return if face-varying topology across the edge only matches.
\n+\n+
ConstIndexArray GetFaceVertices(Index f) const
Access the vertices incident a given face.
\n+
ConstIndexArray GetFaceChildFaces(Index f) const
Access the child faces (in the next level) of a given face.
\n+
int GetNumEdges() const
Return the number of edges in this level.
\n+\n+
bool IsEdgeNonManifold(Index e) const
Return if the edge is non-manifold.
\n+
bool IsFaceHole(Index f) const
Return if a given face has been tagged as a hole.
\n+
ConstIndexArray GetVertexEdges(Index v) const
Access the edges incident a given vertex.
\n+
Index GetFaceChildVertex(Index f) const
Return the child vertex (in the next level) of a given face.
\n+
bool DoesVertexFVarTopologyMatch(Index v, int channel=0) const
Return if face-varying topology around a vertex matches.
\n+
ConstIndexArray GetEdgeChildEdges(Index e) const
Access the child edges (in the next level) of a given edge.
\n+
bool IsEdgeInfSharp(Index e) const
Return if the edge is infinitely-sharp.
\n+
ConstIndexArray GetVertexFaces(Index v) const
Access the faces incident a given vertex.
\n+
Index FindEdge(Index v0, Index v1) const
Identify the edge matching the given vertex pair.
\n+
ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const
Access the local indices of a vertex with respect to its incident edges.
\n+
ConstIndexArray GetFaceEdges(Index f) const
Access the edges incident a given face.
\n+
int GetNumFaces() const
Return the number of faces in this level.
\n+
bool IsVertexBoundary(Index v) const
Return if the vertex is on a boundary (at least one incident boundary edge)
\n+
int GetNumFVarChannels() const
Return the number of face-varying channels (should be same for all levels)
\n+
int GetNumVertices() const
Return the number of vertices in this level.
\n+
ConstIndexArray GetEdgeFaces(Index e) const
Access the faces incident a given edge.
\n+
ConstIndexArray GetFaceFVarValues(Index f, int channel=0) const
Access the face-varying values associated with a particular face.
\n+
ConstIndexArray GetEdgeVertices(Index e) const
Access the vertices incident a given edge.
\n+
bool IsEdgeSemiSharp(Index e) const
Return if the edge is semi-sharp.
\n+\n+
float GetVertexSharpness(Index v) const
Return the sharpness assigned a given vertex.
\n+
Index GetEdgeChildVertex(Index e) const
Return the child vertex (in the next level) of a given edge.
\n+
bool IsVertexSemiSharp(Index v) const
Return if the vertex is semi-sharp.
\n+
int GetNumFaceVertices() const
Return the total number of face-vertices, i.e. the sum of all vertices for all faces.
\n+
bool IsVertexNonManifold(Index v) const
Return if the vertex is non-manifold.
\n+
bool IsEdgeBoundary(Index e) const
Return if the edge is a boundary (only one incident face)
\n+
bool IsVertexInfSharp(Index v) const
Return if the vertex is infinitely-sharp.
\n+
int GetNumFVarValues(int channel=0) const
Return the total number of face-varying values in a particular channel (the upper bound of a face-var...
\n+
ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const
Access the local indices of a vertex with respect to its incident faces.
\n+
Stores topology data for a specified set of refinement options.
\n+\n \n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-topologyRefiner.h\n+topologyLevel.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2014 DreamWorks Animation LLC.\n+2// Copyright 2015 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,441 +23,387 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H\n-25#define OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H\n+24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H\n+25#define OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H\n 26\n 27#include \"../version.h\"\n 28\n-29#include \"../sdc/types.h\"\n-30#include \"../sdc/options.h\"\n+29#include \"../vtr/level.h\"\n+30#include \"../vtr/refinement.h\"\n 31#include \"../far/types.h\"\n-32#include \"../far/topologyLevel.h\"\n-33\n-34#include \n-35\n-36\n-37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-38namespace OPENSUBDIV_VERSION {\n+32\n+33#include \n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Far {\n 39\n-_\b4_\b0namespace Vtr { namespace internal { class SparseSelector; } }\n-41namespace Far { namespace internal { class FeatureMask; } }\n-42\n-43namespace Far {\n-44\n-45template class PrimvarRefinerReal;\n-46template class TopologyRefinerFactory;\n-47\n-_\b5_\b1class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br {\n-52\n-53public:\n-54\n-_\b5_\b6 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be type, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-());\n-57\n-_\b5_\b9 _\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br();\n+_\b4_\b9class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl {\n+50\n+51public:\n+53\n 60\n-_\b6_\b2 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be() const { return _subdivType; }\n+_\b6_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const { return _level->getNumVertices(); }\n 63\n-_\b6_\b5 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const { return _subdivOptions; }\n+_\b6_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const { return _level->getNumFaces(); }\n 66\n-_\b6_\b8 bool _\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm() const { return _isUniform; }\n+_\b6_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs() const { return _level->getNumEdges(); }\n 69\n-_\b7_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\be_\bv_\be_\bl_\bs() const { return (int)_farLevels.size(); }\n-72\n-_\b7_\b4 int _\bG_\be_\bt_\bM_\ba_\bx_\bL_\be_\bv_\be_\bl() const { return _maxLevel; }\n+_\b7_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const { return _level->getNumFaceVerticesTotal(); }\n+73\n 75\n-_\b7_\b7 int _\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() const { return _maxValence; }\n-78\n-_\b8_\b0 bool _\bH_\ba_\bs_\bH_\bo_\bl_\be_\bs() const { return _hasHoles; }\n-81\n-_\b8_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl() const { return _totalVertices; }\n-84\n-_\b8_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs_\bT_\bo_\bt_\ba_\bl() const { return _totalEdges; }\n-87\n-_\b8_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl() const { return _totalFaces; }\n-90\n-_\b9_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl() const { return _totalFaceVertices; }\n-93\n-_\b9_\b5 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl const & _\bG_\be_\bt_\bL_\be_\bv_\be_\bl(int level) const { return _farLevels[level];\n-}\n-96\n-98\n+90 //\n+91\n+_\b9_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _level-\n+>getFaceVertices(f); }\n+94\n+_\b9_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _level->getFaceEdges\n+(f); }\n+97\n+_\b9_\b9 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level-\n+>getEdgeVertices(e); }\n 100\n-101 //\n-102 // Uniform refinement\n-103 //\n-104\n-_\b1_\b1_\b8 struct _\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-119\n-_\b1_\b2_\b0 _\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs(int level) :\n-121 _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl(level & 0xf),\n-122 _\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt(false),\n-123 _\bf_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bn_\bL_\ba_\bs_\bt_\bL_\be_\bv_\be_\bl(false) { }\n+_\b1_\b0_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeFaces\n+(e); }\n+103\n+_\b1_\b0_\b5 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n+>getVertexFaces(v); }\n+106\n+_\b1_\b0_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n+>getVertexEdges(v); }\n+109\n+_\b1_\b1_\b1 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return\n+_level->getVertexFaceLocalIndices(v); }\n+112\n+_\b1_\b1_\b4 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return\n+_level->getVertexEdgeLocalIndices(v); }\n+115\n+_\b1_\b1_\b7 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return\n+_level->getEdgeFaceLocalIndices(e); }\n+118\n+_\b1_\b2_\b0 _\bI_\bn_\bd_\be_\bx _\bF_\bi_\bn_\bd_\bE_\bd_\bg_\be(_\bI_\bn_\bd_\be_\bx v0, _\bI_\bn_\bd_\be_\bx v1) const { return _level->findEdge(v0, v1);\n+}\n+122\n 124\n-_\b1_\b2_\b6 void _\bS_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl(int level) { _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl = level & 0xf; }\n-127\n-_\b1_\b2_\b8 unsigned int _\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl:4,\n-_\b1_\b2_\b9 _\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt:1,\n-_\b1_\b3_\b1 _\bf_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bn_\bL_\ba_\bs_\bt_\bL_\be_\bv_\be_\bl:1;\n-134 };\n+126\n+_\b1_\b2_\b8 bool _\bI_\bs_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bI_\bn_\bd_\be_\bx e) const { return _level->isEdgeNonManifold\n+(e); }\n+129\n+_\b1_\b3_\b1 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n+>isVertexNonManifold(v); }\n+132\n+_\b1_\b3_\b4 bool _\bI_\bs_\bE_\bd_\bg_\be_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n+(e)._boundary; }\n 135\n-_\b1_\b4_\b6 void _\bR_\be_\bf_\bi_\bn_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs options);\n-147\n-_\b1_\b4_\b9 _\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const { return _uniformOptions; }\n-150\n-151 //\n-152 // Adaptive refinement\n-153 //\n-154\n-_\b1_\b5_\b6 struct _\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-157\n-_\b1_\b5_\b8 _\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs(int level) :\n-159 _\bi_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(level & 0xf),\n-160 _\bs_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl(0xf),\n-161 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh(false),\n-162 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh(false),\n-163 _\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(false),\n-164 _\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt(false) { }\n-165\n-_\b1_\b6_\b7 void _\bS_\be_\bt_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(int level) { _\bi_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl = level & 0xf; }\n-168\n-_\b1_\b7_\b0 void _\bS_\be_\bt_\bS_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl(int level) { _\bs_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl = level & 0xf; }\n+_\b1_\b3_\b7 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n+(v)._boundary; }\n+138\n+_\b1_\b4_\b0 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br(_\bI_\bn_\bd_\be_\bx v) const { return (_level->getNumVertexFaces(v)\n+== 1); }\n+141\n+_\b1_\b6_\b2 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bR_\be_\bg_\bu_\bl_\ba_\br(_\bI_\bn_\bd_\be_\bx v) const { return !_level->getVertexTag\n+(v)._xordinary || _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br(v); }\n+164\n+166\n 171\n-_\b1_\b7_\b2 unsigned int _\bi_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl:4;\n-_\b1_\b7_\b4 unsigned int _\bs_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl:4;\n-_\b1_\b7_\b6 unsigned int _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh:1;\n-_\b1_\b7_\b8 unsigned int _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh:1;\n-_\b1_\b8_\b0 unsigned int _\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs:1;\n-_\b1_\b8_\b2 unsigned int _\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt:1;\n-184 };\n-185\n-_\b1_\b9_\b2 void _\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be(_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs options,\n-193 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces = _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by());\n-194\n-_\b1_\b9_\b6 _\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const { return _adaptiveOptions; }\n-197\n-_\b1_\b9_\b9 void _\bU_\bn_\br_\be_\bf_\bi_\bn_\be();\n-200\n-201\n-203\n-205\n-207 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const;\n-208\n-210 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn(int\n-channel = 0) const;\n-211\n-_\b2_\b1_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs_\bT_\bo_\bt_\ba_\bl(int channel = 0) const;\n-214\n-216\n-217protected:\n-218\n-219 //\n-220 // Lower level protected methods intended strictly for internal use:\n-221 //\n-222 template \n-_\b2_\b2_\b3 friend class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-_\b2_\b2_\b4 friend class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be;\n-_\b2_\b2_\b5 friend class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br;\n-_\b2_\b2_\b6 friend class _\bP_\ba_\bt_\bc_\bh_\bB_\bu_\bi_\bl_\bd_\be_\br;\n-_\b2_\b2_\b7 friend class _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-228 template \n-_\b2_\b2_\b9 friend class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl;\n-230\n-231 // Copy constructor exposed via the factory class:\n-_\b2_\b3_\b2 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & source);\n-233\n-234public:\n-235 // Levels and Refinements available internally (avoids need for more\n-friends)\n-_\b2_\b3_\b6 Vtr::internal::Level & _\bg_\be_\bt_\bL_\be_\bv_\be_\bl(int l) { return *_levels[l]; }\n-_\b2_\b3_\b7 Vtr::internal::Level const & _\bg_\be_\bt_\bL_\be_\bv_\be_\bl(int l) const { return *_levels[l]; }\n-238\n-_\b2_\b3_\b9 Vtr::internal::Refinement & _\bg_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(int l) { return *_refinements[l];\n+_\b1_\b7_\b3 float _\bG_\be_\bt_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeSharpness(e);\n }\n-_\b2_\b4_\b0 Vtr::internal::Refinement const & _\bg_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt(int l) const { return\n-*_refinements[l]; }\n-241\n-242private:\n-243 // Not default constructible or copyable:\n-244 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br() : _uniformOptions(0), _adaptiveOptions(0) { }\n-245 TopologyRefiner & operator=(TopologyRefiner const &) { return *this; }\n-246\n-247 void selectFeatureAdaptiveComponents(Vtr::internal::SparseSelector&\n-selector,\n-248 internal::FeatureMask const & mask,\n-249 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces);\n-250 void selectLinearIrregularFaces(Vtr::internal::SparseSelector& selector,\n-251 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces);\n-252\n-253 void initializeInventory();\n-254 void updateInventory(Vtr::internal::Level const & newLevel);\n+174\n+_\b1_\b7_\b6 float _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexSharpness\n+(v); }\n+177\n+_\b1_\b7_\b9 bool _\bI_\bs_\bE_\bd_\bg_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n+(e)._infSharp; }\n+180\n+_\b1_\b8_\b2 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n+(v)._infSharp; }\n+183\n+_\b1_\b8_\b5 bool _\bI_\bs_\bE_\bd_\bg_\be_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n+(e)._semiSharp; }\n+186\n+_\b1_\b8_\b8 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n+(v)._semiSharp; }\n+189\n+_\b1_\b9_\b1 bool _\bI_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bI_\bn_\bd_\be_\bx f) const { return _level->isFaceHole(f); }\n+192\n+_\b1_\b9_\b4 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n+>getVertexRule(v); }\n+196\n+198\n+228\n+_\b2_\b3_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return _level->getNumFVarChannels(); }\n+231\n+_\b2_\b3_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int channel = 0) const { return _level-\n+>getNumFVarValues(channel); }\n+235\n+_\b2_\b3_\b7 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bI_\bn_\bd_\be_\bx f, int channel = 0) const {\n+238 return _level->getFaceFVarValues(f, channel);\n+239 }\n+240\n+_\b2_\b4_\b2 bool _\bD_\bo_\be_\bs_\bV_\be_\br_\bt_\be_\bx_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx v, int channel = 0) const {\n+243 return _level->doesVertexFVarTopologyMatch(v, channel);\n+244 }\n+245\n+_\b2_\b4_\b7 bool _\bD_\bo_\be_\bs_\bE_\bd_\bg_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx e, int channel = 0) const {\n+248 return _level->doesEdgeFVarTopologyMatch(e, channel);\n+249 }\n+250\n+_\b2_\b5_\b2 bool _\bD_\bo_\be_\bs_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx f, int channel = 0) const {\n+253 return _level->doesFaceFVarTopologyMatch(f, channel);\n+254 }\n 255\n-256 void appendLevel(Vtr::internal::Level & newLevel);\n-257 void appendRefinement(Vtr::internal::Refinement & newRefinement);\n-258 void assembleFarLevels();\n+257\n 259\n-260private:\n-261\n-262 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _subdivType;\n-263 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _subdivOptions;\n-264\n-265 unsigned int _isUniform : 1;\n-266 unsigned int _hasHoles : 1;\n-267 unsigned int _hasIrregFaces : 1;\n-268 unsigned int _regFaceSize : 3;\n-269 unsigned int _maxLevel : 4;\n-270\n-271 // Options assigned on refinement:\n-272 UniformOptions _uniformOptions;\n-273 AdaptiveOptions _adaptiveOptions;\n-274\n-275 // Cumulative properties of all levels:\n-276 int _totalVertices;\n-277 int _totalEdges;\n-278 int _totalFaces;\n-279 int _totalFaceVertices;\n-280 int _maxValence;\n-281\n-282 // Note the base level may be shared with another instance\n-283 bool _baseLevelOwned;\n+260\n+_\b2_\b6_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n+>getFaceChildFaces(f); }\n+263\n+_\b2_\b6_\b5 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n+>getFaceChildEdges(f); }\n+266\n+_\b2_\b6_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _refToChild-\n+>getEdgeChildEdges(e); }\n+269\n+_\b2_\b7_\b1 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx( _\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n+>getFaceChildVertex(f); }\n+272\n+_\b2_\b7_\b4 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx( _\bI_\bn_\bd_\be_\bx e) const { return _refToChild-\n+>getEdgeChildVertex(e); }\n+275\n+_\b2_\b7_\b7 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx(_\bI_\bn_\bd_\be_\bx v) const { return _refToChild-\n+>getVertexChildVertex(v); }\n+278\n+_\b2_\b8_\b0 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\be_\bn_\bt_\bF_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx f) const { return _refToParent-\n+>getChildFaceParentFace(f); }\n+282\n 284\n-285 std::vector _levels;\n-286 std::vector _refinements;\n-287\n-288 std::vector _farLevels;\n-289};\n+285\n+_\b2_\b8_\b6 bool _\bV_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by() const { return _level->validateTopology(); }\n+_\b2_\b8_\b7 void _\bP_\br_\bi_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(bool children = true) const { _level->print((children &&\n+_refToChild) ? _refToChild : 0); }\n+289\n 290\n-291\n-292inline int\n-_\b2_\b9_\b3_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const {\n-294\n-295 return _levels[0]->getNumFVarChannels();\n-296}\n-297inline _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-_\b2_\b9_\b8_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn(int channel) const {\n-299\n-300 return _levels[0]->getFVarOptions(channel).GetFVarLinearInterpolation();\n-301}\n-302\n-303} // end namespace Far\n-304\n-305} // end namespace OPENSUBDIV_VERSION\n-306using namespace OPENSUBDIV_VERSION;\n-307} // end namespace OpenSubdiv\n-308\n-309#endif /* OPENSUBDIV3_FAR_TOPOLOGY_REFINER_H */\n+291private:\n+_\b2_\b9_\b2 friend class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br;\n+293\n+294 Vtr::internal::Level const * _level;\n+295 Vtr::internal::Refinement const * _refToParent;\n+296 Vtr::internal::Refinement const * _refToChild;\n+297\n+298public:\n+299 // Not intended for public use, but required by std::vector, etc...\n+_\b3_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl() { }\n+_\b3_\b0_\b1 _\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl() { }\n+302};\n+303\n+304} // end namespace Far\n+305\n+306} // end namespace OPENSUBDIV_VERSION\n+307using namespace OPENSUBDIV_VERSION;\n+308} // end namespace OpenSubdiv\n+309\n+310#endif /* OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::ConstIndexArray ConstIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-SchemeType\n-Enumerated type for all subdivision schemes supported by OpenSubdiv.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-Applies refinement operations to generic primvar data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Object used to compute and query ptex face indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\b:_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n An interface for accessing data in a specific level of a refined topology\n hierarchy.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Factory for constructing TopologyRefiners from specific mesh classes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\be_\bn_\bt_\bF_\ba_\bc_\be\n+Index GetFaceParentFace(Index f) const\n+Return the parent face (in the previous level) of a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n+TopologyLevel()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b3_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bR_\be_\bg_\bu_\bl_\ba_\br\n+bool IsVertexValenceRegular(Index v) const\n+Return if the valence of the vertex is regular (must be manifold)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float GetEdgeSharpness(Index e) const\n+Return the sharpness assigned a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n+bool DoesFaceFVarTopologyMatch(Index f, int channel=0) const\n+Return if face-varying topology around a face matches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n+Sdc::Crease::Rule GetVertexRule(Index v) const\n+Return the subdivision rule assigned a given vertex specific to this level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br\n+bool IsVertexCorner(Index v) const\n+Return if the vertex is a corner (only one incident face)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n+Index GetVertexChildVertex(Index v) const\n+Return the child vertex (in the next level) of a given vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const\n+Access the local indices of an edge with respect to its incident faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs\n+ConstIndexArray GetFaceChildEdges(Index f) const\n+Access the child edges (in the next level) of a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bE_\bd_\bg_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n+bool DoesEdgeFVarTopologyMatch(Index e, int channel=0) const\n+Return if face-varying topology across the edge only matches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bP_\br_\bi_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+void PrintTopology(bool children=true) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetFaceVertices(Index f) const\n+Access the vertices incident a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bF_\ba_\bc_\be_\bs\n+ConstIndexArray GetFaceChildFaces(Index f) const\n+Access the child faces (in the next level) of a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs\n+int GetNumEdges() const\n+Return the number of edges in this level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bV_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+bool ValidateTopology() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+bool IsEdgeNonManifold(Index e) const\n+Return if the edge is non-manifold.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n+bool IsFaceHole(Index f) const\n+Return if a given face has been tagged as a hole.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs\n+ConstIndexArray GetVertexEdges(Index v) const\n+Access the edges incident a given vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n+Index GetFaceChildVertex(Index f) const\n+Return the child vertex (in the next level) of a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bV_\be_\br_\bt_\be_\bx_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n+bool DoesVertexFVarTopologyMatch(Index v, int channel=0) const\n+Return if face-varying topology around a vertex matches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs\n+ConstIndexArray GetEdgeChildEdges(Index e) const\n+Access the child edges (in the next level) of a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp\n+bool IsEdgeInfSharp(Index e) const\n+Return if the edge is infinitely-sharp.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n+ConstIndexArray GetVertexFaces(Index v) const\n+Access the faces incident a given vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bF_\bi_\bn_\bd_\bE_\bd_\bg_\be\n+Index FindEdge(Index v0, Index v1) const\n+Identify the edge matching the given vertex pair.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const\n+Access the local indices of a vertex with respect to its incident edges.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs\n+ConstIndexArray GetFaceEdges(Index f) const\n+Access the edges incident a given face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n+int GetNumFaces() const\n+Return the number of faces in this level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n+bool IsVertexBoundary(Index v) const\n+Return if the vertex is on a boundary (at least one incident boundary edge)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int GetNumFVarChannels() const\n+Return the number of face-varying channels (should be same for all levels)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+Return the number of vertices in this level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs\n+ConstIndexArray GetEdgeFaces(Index e) const\n+Access the faces incident a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+ConstIndexArray GetFaceFVarValues(Index f, int channel=0) const\n+Access the face-varying values associated with a particular face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetEdgeVertices(Index e) const\n+Access the vertices incident a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n+bool IsEdgeSemiSharp(Index e) const\n+Return if the edge is semi-sharp.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n+~TopologyLevel()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b3_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float GetVertexSharpness(Index v) const\n+Return the sharpness assigned a given vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n+Index GetEdgeChildVertex(Index e) const\n+Return the child vertex (in the next level) of a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n+bool IsVertexSemiSharp(Index v) const\n+Return if the vertex is semi-sharp.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumFaceVertices() const\n+Return the total number of face-vertices, i.e. the sum of all vertices for all\n+faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+bool IsVertexNonManifold(Index v) const\n+Return if the vertex is non-manifold.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n+bool IsEdgeBoundary(Index e) const\n+Return if the edge is a boundary (only one incident face)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp\n+bool IsVertexInfSharp(Index v) const\n+Return if the vertex is infinitely-sharp.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+int GetNumFVarValues(int channel=0) const\n+Return the total number of face-varying values in a particular channel (the\n+upper bound of a face-var...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const\n+Access the local indices of a vertex with respect to its incident faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-TopologyRefiner(TopologyRefiner const &source)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n-int GetMaxValence() const\n-Returns the maximum vertex valence in all levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bg_\be_\bt_\bL_\be_\bv_\be_\bl\n-Vtr::internal::Level const & getLevel(int l) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bH_\ba_\bs_\bH_\bo_\bl_\be_\bs\n-bool HasHoles() const\n-Returns true if faces have been tagged as holes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\be_\bv_\be_\bl_\bs\n-int GetNumLevels() const\n-Returns the number of refinement levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumFVarValuesTotal(int channel=0) const\n-Returns the total number of face-varying values in all levels.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bg_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Vtr::internal::Refinement const & getRefinement(int l) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Sdc::Options GetSchemeOptions() const\n-Returns the subdivision options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bg_\be_\bt_\bL_\be_\bv_\be_\bl\n-Vtr::internal::Level & getLevel(int l)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-bool IsUniform() const\n-Returns true if uniform refinement has been applied.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-Sdc::SchemeType GetSchemeType() const\n-Returns the subdivision scheme.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bx_\bL_\be_\bv_\be_\bl\n-int GetMaxLevel() const\n-Returns the highest level of refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-TopologyRefiner(Sdc::SchemeType type, Sdc::Options options=Sdc::Options())\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumEdgesTotal() const\n-Returns the total number of edges in all levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bB_\bu_\bi_\bl_\bd_\be_\br\n-friend class PatchBuilder\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-Returns the number of face-varying channels in the tables.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-UniformOptions GetUniformOptions() const\n-Returns the options specified on refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumFacesTotal() const\n-Returns the total number of edges in all levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumFaceVerticesTotal() const\n-Returns the total number of face vertices in all levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bg_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt\n-Vtr::internal::Refinement & getRefinement(int l)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-void RefineUniform(UniformOptions options)\n-Refine the topology uniformly.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-~TopologyRefiner()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br\n-friend class PatchTableBuilder\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bL_\be_\bv_\be_\bl\n-TopologyLevel const & GetLevel(int level) const\n-Returns a handle to access data specific to a particular level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumVerticesTotal() const\n-Returns the total number of vertices in all levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\br_\be_\bf_\bi_\bn_\be\n-void Unrefine()\n-Unrefine the topology, keeping only the base level.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-AdaptiveOptions GetAdaptiveOptions() const\n-Returns the options specified on refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:\n-_\bG_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-Sdc::Options::FVarLinearInterpolation GetFVarLinearInterpolation(int channel=0)\n-const\n-Returns the face-varying interpolation rule set for a given channel.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n-void RefineAdaptive(AdaptiveOptions options, ConstIndexArray\n-selectedFaces=ConstIndexArray())\n-Feature Adaptive topology refinement.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Uniform refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl\n-unsigned int refinementLevel\n-Number of refinement iterations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt\n-unsigned int orderVerticesFromFacesFirst\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b3_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\bL_\be_\bv_\be_\bl\n-void SetRefinementLevel(int level)\n-Set uniform refinement level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bI_\bn_\bL_\ba_\bs_\bt_\bL_\be_\bv_\be_\bl\n-unsigned int fullTopologyInLastLevel\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-UniformOptions(int level)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Adaptive refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bs_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl\n-unsigned int secondaryLevel\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bo_\br_\bd_\be_\br_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs_\bF_\bi_\br_\bs_\bt\n-unsigned int orderVerticesFromFacesFirst\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-AdaptiveOptions(int level)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-unsigned int isolationLevel\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n-unsigned int useSingleCreasePatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n-unsigned int useInfSharpPatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-void SetIsolationLevel(int level)\n-Set isolation level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-unsigned int considerFVarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bS_\be_\bc_\bo_\bn_\bd_\ba_\br_\by_\bL_\be_\bv_\be_\bl\n-void SetSecondaryLevel(int level)\n-Set secondary isolation level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-Private base class of Factories for constructing TopologyRefiners.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-All supported options applying to subdivision scheme.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-FVarLinearInterpolation\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n+Rule\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00710.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00710.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyLevel.h File Reference\n+OpenSubdiv: opensubdiv/far/topologyRefinerFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,29 +90,34 @@\n \n \n \n
\n \n-
topologyLevel.h File Reference
\n+
topologyRefinerFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../vtr/level.h"
\n-#include "../vtr/refinement.h"
\n-#include "../far/types.h"
\n-#include <vector>
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/error.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

class  TopologyLevel
 An interface for accessing data in a specific level of a refined topology hierarchy. More...
class  TopologyRefinerFactoryBase
 Private base class of Factories for constructing TopologyRefiners. More...
 
class  TopologyRefinerFactory< MESH >
 Factory for constructing TopologyRefiners from specific mesh classes. More...
 
struct  TopologyRefinerFactory< MESH >::Options
 Options related to the construction of each TopologyRefiner. More...
 
\n \n \n \n \n@@ -121,13 +126,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,34 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyLevel.h File Reference\n+topologyRefinerFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n-\u00a0 An interface for accessing data in a specific level of a refined\n- topology hierarchy. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+\u00a0 Private base class of Factories for constructing TopologyRefiners.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+ class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bM_\bE_\bS_\bH_\b _\b>\n+\u00a0 Factory for constructing TopologyRefiners from specific mesh classes.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bM_\bE_\bS_\bH_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 _\bO_\bp_\bt_\bi_\bo_\bn_\bs related to the construction of each _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00710.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00710.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,5 @@\n var a00710 = [\n- [\"TopologyLevel\", \"a01113.html\", \"a01113\"]\n+ [\"TopologyRefinerFactoryBase\", \"a01133.html\", \"a01133\"],\n+ [\"TopologyRefinerFactory< MESH >\", \"a01117.html\", \"a01117\"],\n+ [\"Options\", \"a01137.html\", \"a01137\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00710_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00710_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyLevel.h Source File\n+OpenSubdiv: opensubdiv/far/topologyRefinerFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
topologyLevel.h
\n+
topologyRefinerFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 DreamWorks Animation LLC.
\n+
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,228 +118,698 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H
\n-
25#define OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H
\n+
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H
\n+
25#define OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H
\n
26
\n
27#include "../version.h"
\n
28
\n-
29#include "../vtr/level.h"
\n-
30#include "../vtr/refinement.h"
\n-
31#include "../far/types.h"
\n-
32
\n-
33#include <vector>
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Far {
\n-
39
\n-
\n-\n-
50
\n-
51public:
\n-
53
\n-
60
\n-
62 int GetNumVertices() const { return _level->getNumVertices(); }
\n+
29#include "../far/topologyRefiner.h"
\n+
30#include "../far/error.h"
\n+
31
\n+
32#include <cassert>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38
\n+
46//
\n+
\n+\n+
48protected:
\n+
49
\n+
50 //
\n+
51 // Protected methods invoked by the subclass template to verify and process each
\n+
52 // stage of construction implemented by the subclass:
\n+
53 //
\n+
54 typedef Vtr::internal::Level::ValidationCallback TopologyCallback;
\n+
55
\n+\n+
57 static bool prepareComponentTopologyAssignment(TopologyRefiner& refiner, bool fullValidation,
\n+
58 TopologyCallback callback, void const * callbackData);
\n+\n+\n+
61};
\n+
\n+
62
\n
63
\n-
65 int GetNumFaces() const { return _level->getNumFaces(); }
\n-
66
\n-
68 int GetNumEdges() const { return _level->getNumEdges(); }
\n-
69
\n-
71 int GetNumFaceVertices() const { return _level->getNumFaceVerticesTotal(); }
\n-
73
\n-
75
\n-
90 //
\n-
91
\n-
93 ConstIndexArray GetFaceVertices(Index f) const { return _level->getFaceVertices(f); }
\n-
94
\n-
96 ConstIndexArray GetFaceEdges(Index f) const { return _level->getFaceEdges(f); }
\n-
97
\n-
99 ConstIndexArray GetEdgeVertices(Index e) const { return _level->getEdgeVertices(e); }
\n-
100
\n-
102 ConstIndexArray GetEdgeFaces(Index e) const { return _level->getEdgeFaces(e); }
\n-
103
\n-
105 ConstIndexArray GetVertexFaces(Index v) const { return _level->getVertexFaces(v); }
\n-
106
\n-
108 ConstIndexArray GetVertexEdges(Index v) const { return _level->getVertexEdges(v); }
\n-
109
\n-
111 ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const { return _level->getVertexFaceLocalIndices(v); }
\n-
112
\n-
114 ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const { return _level->getVertexEdgeLocalIndices(v); }
\n-
115
\n-
117 ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const { return _level->getEdgeFaceLocalIndices(e); }
\n-
118
\n-
120 Index FindEdge(Index v0, Index v1) const { return _level->findEdge(v0, v1); }
\n-
122
\n-
124
\n-
126
\n-
128 bool IsEdgeNonManifold(Index e) const { return _level->isEdgeNonManifold(e); }
\n+
77template <class MESH>
\n+
\n+\n+
79
\n+
80public:
\n+
81
\n+
\n+
84 struct Options {
\n+
85
\n+
\n+\n+
87 schemeType(sdcType),
\n+
88 schemeOptions(sdcOptions),
\n+
89 validateFullTopology(false) { }
\n+
\n+
90
\n+\n+\n+
94 unsigned int validateFullTopology : 1;
\n+
97 };
\n+
\n+
98
\n+
108 //
\n+
113 static TopologyRefiner* Create(MESH const& mesh, Options options = Options());
\n+
114
\n+
128 static TopologyRefiner* Create(TopologyRefiner const & baseLevel);
\n
129
\n-
131 bool IsVertexNonManifold(Index v) const { return _level->isVertexNonManifold(v); }
\n+
130protected:
\n+
131 typedef Vtr::internal::Level::TopologyError TopologyError;
\n
132
\n-
134 bool IsEdgeBoundary(Index e) const { return _level->getEdgeTag(e)._boundary; }
\n-
135
\n-
137 bool IsVertexBoundary(Index v) const { return _level->getVertexTag(v)._boundary; }
\n-
138
\n-
140 bool IsVertexCorner(Index v) const { return (_level->getNumVertexFaces(v) == 1); }
\n-
141
\n-
162 bool IsVertexValenceRegular(Index v) const { return !_level->getVertexTag(v)._xordinary || IsVertexCorner(v); }
\n-
164
\n-
166
\n-
171
\n-
173 float GetEdgeSharpness(Index e) const { return _level->getEdgeSharpness(e); }
\n-
174
\n-
176 float GetVertexSharpness(Index v) const { return _level->getVertexSharpness(v); }
\n-
177
\n-
179 bool IsEdgeInfSharp(Index e) const { return _level->getEdgeTag(e)._infSharp; }
\n-
180
\n-
182 bool IsVertexInfSharp(Index v) const { return _level->getVertexTag(v)._infSharp; }
\n-
183
\n-
185 bool IsEdgeSemiSharp(Index e) const { return _level->getEdgeTag(e)._semiSharp; }
\n-
186
\n-
188 bool IsVertexSemiSharp(Index v) const { return _level->getVertexTag(v)._semiSharp; }
\n-
189
\n-
191 bool IsFaceHole(Index f) const { return _level->isFaceHole(f); }
\n-
192
\n-
194 Sdc::Crease::Rule GetVertexRule(Index v) const { return _level->getVertexRule(v); }
\n+
134
\n+
149
\n+
151 static bool resizeComponentTopology(TopologyRefiner& newRefiner, MESH const& mesh);
\n+
152
\n+
155 static bool assignComponentTopology(TopologyRefiner& newRefiner, MESH const& mesh);
\n+
156
\n+
158 static bool assignComponentTags(TopologyRefiner& newRefiner, MESH const& mesh);
\n+
159
\n+
161 static bool assignFaceVaryingTopology(TopologyRefiner& newRefiner, MESH const& mesh);
\n+
162
\n+
164 static void reportInvalidTopology(TopologyError errCode, char const * msg, MESH const& mesh);
\n+
165
\n+
167
\n+
168protected:
\n+
170
\n+
187
\n+
189 static void setNumBaseVertices(TopologyRefiner & newRefiner, int count);
\n+
190
\n+
192 static void setNumBaseFaces(TopologyRefiner & newRefiner, int count);
\n+
193
\n+
195 static void setNumBaseEdges(TopologyRefiner & newRefiner, int count);
\n
196
\n-
198
\n-
228
\n-
230 int GetNumFVarChannels() const { return _level->getNumFVarChannels(); }
\n-
231
\n-
234 int GetNumFVarValues(int channel = 0) const { return _level->getNumFVarValues(channel); }
\n-
235
\n-
\n-
237 ConstIndexArray GetFaceFVarValues(Index f, int channel = 0) const {
\n-
238 return _level->getFaceFVarValues(f, channel);
\n-
239 }
\n-
\n+
198 static void setNumBaseFaceVertices(TopologyRefiner & newRefiner, Index f, int count);
\n+
199
\n+
201 static void setNumBaseEdgeFaces(TopologyRefiner & newRefiner, Index e, int count);
\n+
202
\n+
204 static void setNumBaseVertexFaces(TopologyRefiner & newRefiner, Index v, int count);
\n+
205
\n+
207 static void setNumBaseVertexEdges(TopologyRefiner & newRefiner, Index v, int count);
\n+
208
\n+
209 static int getNumBaseVertices(TopologyRefiner const & newRefiner);
\n+
210 static int getNumBaseFaces(TopologyRefiner const & newRefiner);
\n+
211 static int getNumBaseEdges(TopologyRefiner const & newRefiner);
\n+
213
\n+
215
\n+
237
\n+
239 static IndexArray getBaseFaceVertices(TopologyRefiner & newRefiner, Index f);
\n
240
\n-
\n-
242 bool DoesVertexFVarTopologyMatch(Index v, int channel = 0) const {
\n-
243 return _level->doesVertexFVarTopologyMatch(v, channel);
\n-
244 }
\n-
\n-
245
\n-
\n-
247 bool DoesEdgeFVarTopologyMatch(Index e, int channel = 0) const {
\n-
248 return _level->doesEdgeFVarTopologyMatch(e, channel);
\n-
249 }
\n-
\n-
250
\n-
\n-
252 bool DoesFaceFVarTopologyMatch(Index f, int channel = 0) const {
\n-
253 return _level->doesFaceFVarTopologyMatch(f, channel);
\n-
254 }
\n-
\n+
242 static IndexArray getBaseFaceEdges(TopologyRefiner & newRefiner, Index f);
\n+
243
\n+
245 static IndexArray getBaseEdgeVertices(TopologyRefiner & newRefiner, Index e);
\n+
246
\n+
248 static IndexArray getBaseEdgeFaces(TopologyRefiner & newRefiner, Index e);
\n+
249
\n+
251 static IndexArray getBaseVertexFaces(TopologyRefiner & newRefiner, Index v);
\n+
252
\n+
254 static IndexArray getBaseVertexEdges(TopologyRefiner & newRefiner, Index v);
\n
255
\n-
257
\n-
259
\n-
260
\n-
262 ConstIndexArray GetFaceChildFaces(Index f) const { return _refToChild->getFaceChildFaces(f); }
\n-
263
\n-
265 ConstIndexArray GetFaceChildEdges(Index f) const { return _refToChild->getFaceChildEdges(f); }
\n-
266
\n-
268 ConstIndexArray GetEdgeChildEdges(Index e) const { return _refToChild->getEdgeChildEdges(e); }
\n-
269
\n-
271 Index GetFaceChildVertex( Index f) const { return _refToChild->getFaceChildVertex(f); }
\n+\n+\n+\n+
262
\n+
264 static void populateBaseLocalIndices(TopologyRefiner & newRefiner);
\n+
265
\n+
267 static void setBaseEdgeNonManifold(TopologyRefiner & newRefiner, Index e, bool b);
\n+
268
\n+
270 static void setBaseVertexNonManifold(TopologyRefiner & newRefiner, Index v, bool b);
\n
272
\n-
274 Index GetEdgeChildVertex( Index e) const { return _refToChild->getEdgeChildVertex(e); }
\n-
275
\n-
277 Index GetVertexChildVertex(Index v) const { return _refToChild->getVertexChildVertex(v); }
\n-
278
\n-
280 Index GetFaceParentFace(Index f) const { return _refToParent->getChildFaceParentFace(f); }
\n-
282
\n-
284
\n-
285
\n-
286 bool ValidateTopology() const { return _level->validateTopology(); }
\n-
287 void PrintTopology(bool children = true) const { _level->print((children && _refToChild) ? _refToChild : 0); }
\n+
274
\n+
283
\n+
285 static Index findBaseEdge(TopologyRefiner const & newRefiner, Index v0, Index v1);
\n+
286
\n+
288 static void setBaseEdgeSharpness(TopologyRefiner & newRefiner, Index e, float sharpness);
\n
289
\n-
290
\n-
291private:
\n-
292 friend class TopologyRefiner;
\n-
293
\n-
294 Vtr::internal::Level const * _level;
\n-
295 Vtr::internal::Refinement const * _refToParent;
\n-
296 Vtr::internal::Refinement const * _refToChild;
\n-
297
\n-
298public:
\n-
299 // Not intended for public use, but required by std::vector, etc...
\n-\n-\n-
302};
\n-
\n-
303
\n-
304} // end namespace Far
\n-
305
\n-
306} // end namespace OPENSUBDIV_VERSION
\n-
307using namespace OPENSUBDIV_VERSION;
\n-
308} // end namespace OpenSubdiv
\n-
309
\n-
310#endif /* OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H */
\n+
291 static void setBaseVertexSharpness(TopologyRefiner & newRefiner, Index v, float sharpness);
\n+
292
\n+
294 static void setBaseFaceHole(TopologyRefiner & newRefiner, Index f, bool isHole);
\n+
296
\n+
298
\n+
308
\n+
310 static int createBaseFVarChannel(TopologyRefiner & newRefiner, int numValues);
\n+
311
\n+
313 static int createBaseFVarChannel(TopologyRefiner & newRefiner, int numValues, Sdc::Options const& fvarOptions);
\n+
314
\n+
316 static IndexArray getBaseFaceFVarValues(TopologyRefiner & newRefiner, Index face, int channel = 0);
\n+
317
\n+
319
\n+
320protected:
\n+
321 //
\n+
322 // Not to be specialized:
\n+
323 //
\n+
324 static bool populateBaseLevel(TopologyRefiner& refiner, MESH const& mesh, Options options);
\n+
325
\n+
326private:
\n+
327 //
\n+
328 // An oversight in the interfaces of the error reporting function between the factory
\n+
329 // class and the Vtr::Level requires this adapter function to avoid warnings.
\n+
330 //
\n+
331 // The static class method requires a reference as the MESH argument, but the interface
\n+
332 // for Vtr::Level requires a pointer (void*). So this adapter with a MESH* argument is
\n+
333 // used to effectively cast the function pointer required by Vtr::Level error reporting:
\n+
334 //
\n+
335 static void reportInvalidTopologyAdapter(TopologyError errCode, char const * msg, MESH const * mesh) {
\n+
336 reportInvalidTopology(errCode, msg, *mesh);
\n+
337 }
\n+
338};
\n+
\n+
339
\n+
340
\n+
341//
\n+
342// Generic implementations:
\n+
343//
\n+
344template <class MESH>
\n+
345TopologyRefiner*
\n+
\n+\n+
347
\n+
348 TopologyRefiner * refiner = new TopologyRefiner(options.schemeType, options.schemeOptions);
\n+
349
\n+
350 if (! populateBaseLevel(*refiner, mesh, options)) {
\n+
351 delete refiner;
\n+
352 return 0;
\n+
353 }
\n+
354
\n+
355 // Eventually want to move the Refiner's inventory initialization here. Currently it
\n+
356 // is handled after topology assignment, but if the inventory is to include additional
\n+
357 // features (e.g. holes, etc.) it is better off deferred to here.
\n+
358
\n+
359 return refiner;
\n+
360}
\n+
\n+
361
\n+
362template <class MESH>
\n+\n+
\n+\n+
365
\n+
366 return new TopologyRefiner(source);
\n+
367}
\n+
\n+
368
\n+
369template <class MESH>
\n+
370bool
\n+
\n+\n+
372
\n+
373 //
\n+
374 // Construction of a specialized topology refiner involves four steps, each of which
\n+
375 // involves a method specialized for MESH followed by one that takes an action in
\n+
376 // response to it or in preparation for the next step.
\n+
377 //
\n+
378 // Both the specialized methods and those that follow them may find fault in the
\n+
379 // construction and trigger failure at any time:
\n+
380 //
\n+
381
\n+
382 //
\n+
383 // Sizing of the topology -- this is a required specialization for MESH. This defines
\n+
384 // an inventory of all components and their relations that is used to allocate buffers
\n+
385 // to be efficiently populated in the subsequent topology assignment step.
\n+
386 //
\n+
387 if (! resizeComponentTopology(refiner, mesh)) return false;
\n+
388 if (! prepareComponentTopologySizing(refiner)) return false;
\n+
389
\n+
390 //
\n+
391 // Assignment of the topology -- this is a required specialization for MESH. If edges
\n+
392 // are specified, all other topological relations are expected to be defined for them.
\n+
393 // Otherwise edges and remaining topology will be completed from the face-vertices:
\n+
394 //
\n+
395 bool validate = options.validateFullTopology;
\n+
396 TopologyCallback callback = reinterpret_cast<TopologyCallback>(reportInvalidTopologyAdapter);
\n+
397 void const * userData = &mesh;
\n+
398
\n+
399 if (! assignComponentTopology(refiner, mesh)) return false;
\n+
400 if (! prepareComponentTopologyAssignment(refiner, validate, callback, userData)) return false;
\n+
401
\n+
402 //
\n+
403 // User assigned and internal tagging of components -- an optional specialization for
\n+
404 // MESH. Allows the specification of sharpness values, holes, etc.
\n+
405 //
\n+
406 if (! assignComponentTags(refiner, mesh)) return false;
\n+
407 if (! prepareComponentTagsAndSharpness(refiner)) return false;
\n+
408
\n+
409 //
\n+
410 // Defining channels of face-varying primvar data -- an optional specialization for MESH.
\n+
411 //
\n+
412 if (! assignFaceVaryingTopology(refiner, mesh)) return false;
\n+
413 if (! prepareFaceVaryingChannels(refiner)) return false;
\n+
414
\n+
415 return true;
\n+
416}
\n+
\n+
417
\n+
418template <class MESH>
\n+
419inline void
\n+
\n+\n+
421 newRefiner._levels[0]->resizeFaces(count);
\n+
422}
\n+
\n+
423template <class MESH>
\n+
424inline void
\n+
\n+\n+
426 newRefiner._levels[0]->resizeEdges(count);
\n+
427}
\n+
\n+
428template <class MESH>
\n+
429inline void
\n+
\n+\n+
431 newRefiner._levels[0]->resizeVertices(count);
\n+
432}
\n+
\n+
433
\n+
434template <class MESH>
\n+
435inline int
\n+
\n+\n+
437 return newRefiner._levels[0]->getNumFaces();
\n+
438}
\n+
\n+
439template <class MESH>
\n+
440inline int
\n+
\n+\n+
442 return newRefiner._levels[0]->getNumEdges();
\n+
443}
\n+
\n+
444template <class MESH>
\n+
445inline int
\n+
\n+\n+
447 return newRefiner._levels[0]->getNumVertices();
\n+
448}
\n+
\n+
449
\n+
450template <class MESH>
\n+
451inline void
\n+
\n+\n+
453 newRefiner._levels[0]->resizeFaceVertices(f, count);
\n+
454 newRefiner._hasIrregFaces = newRefiner._hasIrregFaces || (count != newRefiner._regFaceSize);
\n+
455}
\n+
\n+
456template <class MESH>
\n+
457inline void
\n+
\n+\n+
459 newRefiner._levels[0]->resizeEdgeFaces(e, count);
\n+
460}
\n+
\n+
461template <class MESH>
\n+
462inline void
\n+
\n+\n+
464 newRefiner._levels[0]->resizeVertexFaces(v, count);
\n+
465}
\n+
\n+
466template <class MESH>
\n+
467inline void
\n+
\n+\n+
469 newRefiner._levels[0]->resizeVertexEdges(v, count);
\n+
470}
\n+
\n+
471
\n+
472template <class MESH>
\n+
473inline IndexArray
\n+
\n+\n+
475 return newRefiner._levels[0]->getFaceVertices(f);
\n+
476}
\n+
\n+
477template <class MESH>
\n+
478inline IndexArray
\n+
\n+\n+
480 return newRefiner._levels[0]->getFaceEdges(f);
\n+
481}
\n+
\n+
482template <class MESH>
\n+
483inline IndexArray
\n+
\n+\n+
485 return newRefiner._levels[0]->getEdgeVertices(e);
\n+
486}
\n+
\n+
487template <class MESH>
\n+
488inline IndexArray
\n+
\n+\n+
490 return newRefiner._levels[0]->getEdgeFaces(e);
\n+
491}
\n+
\n+
492template <class MESH>
\n+
493inline IndexArray
\n+
\n+\n+
495 return newRefiner._levels[0]->getVertexFaces(v);
\n+
496}
\n+
\n+
497template <class MESH>
\n+
498inline IndexArray
\n+
\n+\n+
500 return newRefiner._levels[0]->getVertexEdges(v);
\n+
501}
\n+
\n+
502
\n+
503template <class MESH>
\n+
504inline LocalIndexArray
\n+
\n+\n+
506 return newRefiner._levels[0]->getEdgeFaceLocalIndices(e);
\n+
507}
\n+
\n+
508template <class MESH>
\n+
509inline LocalIndexArray
\n+
\n+\n+
511 return newRefiner._levels[0]->getVertexFaceLocalIndices(v);
\n+
512}
\n+
\n+
513template <class MESH>
\n+
514inline LocalIndexArray
\n+
\n+\n+
516 return newRefiner._levels[0]->getVertexEdgeLocalIndices(v);
\n+
517}
\n+
\n+
518
\n+
519template <class MESH>
\n+
520inline Index
\n+
\n+\n+
522 return newRefiner._levels[0]->findEdge(v0, v1);
\n+
523}
\n+
\n+
524
\n+
525template <class MESH>
\n+
526inline void
\n+
\n+\n+
528 newRefiner._levels[0]->populateLocalIndices();
\n+
529}
\n+
\n+
530
\n+
531template <class MESH>
\n+
532inline void
\n+
\n+\n+
534 newRefiner._levels[0]->setEdgeNonManifold(e, b);
\n+
535}
\n+
\n+
536template <class MESH>
\n+
537inline void
\n+
\n+\n+
539 newRefiner._levels[0]->setVertexNonManifold(v, b);
\n+
540}
\n+
\n+
541
\n+
542template <class MESH>
\n+
543inline void
\n+
\n+\n+
545 newRefiner._levels[0]->getEdgeSharpness(e) = s;
\n+
546}
\n+
\n+
547template <class MESH>
\n+
548inline void
\n+
\n+\n+
550 newRefiner._levels[0]->getVertexSharpness(v) = s;
\n+
551}
\n+
\n+
552template <class MESH>
\n+
553inline void
\n+
\n+\n+
555 newRefiner._levels[0]->setFaceHole(f, b);
\n+
556 newRefiner._hasHoles = newRefiner._hasHoles || b;
\n+
557}
\n+
\n+
558
\n+
559template <class MESH>
\n+
560inline int
\n+
\n+\n+
562 return newRefiner._levels[0]->createFVarChannel(numValues, newRefiner._subdivOptions);
\n+
563}
\n+
\n+
564template <class MESH>
\n+
565inline int
\n+
\n+\n+
567 Sdc::Options newOptions = newRefiner._subdivOptions;
\n+\n+
569 return newRefiner._levels[0]->createFVarChannel(numValues, newOptions);
\n+
570}
\n+
\n+
571template <class MESH>
\n+
572inline IndexArray
\n+
\n+\n+
574 return newRefiner._levels[0]->getFaceFVarValues(face, channel);
\n+
575}
\n+
\n+
576
\n+
577
\n+
578template <class MESH>
\n+
579bool
\n+
\n+\n+
581
\n+\n+
583 "Failure in TopologyRefinerFactory<>::resizeComponentTopology() -- no specialization provided.");
\n+
584
\n+
585 //
\n+
586 // Sizing the topology tables:
\n+
587 // This method is for determining the sizes of the various topology tables (and other
\n+
588 // data) associated with the mesh. Once completed, appropriate memory will be allocated
\n+
589 // and an additional method invoked to populate it accordingly.
\n+
590 //
\n+
591 // The following methods should be called -- first those to specify the number of faces,
\n+
592 // edges and vertices in the mesh:
\n+
593 //
\n+
594 // void setBaseFaceCount( TopologyRefiner& newRefiner, int count)
\n+
595 // void setBaseEdgeCount( TopologyRefiner& newRefiner, int count)
\n+
596 // void setBaseVertexCount(TopologyRefiner& newRefiner, int count)
\n+
597 //
\n+
598 // and then for each face, edge and vertex, the number of its incident components:
\n+
599 //
\n+
600 // void setBaseFaceVertexCount(TopologyRefiner& newRefiner, Index face, int count)
\n+
601 // void setBaseEdgeFaceCount( TopologyRefiner& newRefiner, Index edge, int count)
\n+
602 // void setBaseVertexFaceCount(TopologyRefiner& newRefiner, Index vertex, int count)
\n+
603 // void setBaseVertexEdgeCount(TopologyRefiner& newRefiner, Index vertex, int count)
\n+
604 //
\n+
605 // The count/size for a component type must be set before indices associated with that
\n+
606 // component type can be used.
\n+
607 //
\n+
608 // Note that it is only necessary to size 4 of the 6 supported topological relations --
\n+
609 // the number of edge-vertices is fixed at two per edge, and the number of face-edges is
\n+
610 // the same as the number of face-vertices.
\n+
611 //
\n+
612 // So a single pass through your mesh to gather up all of this sizing information will
\n+
613 // allow the Tables to be allocated appropriately once and avoid any dynamic resizing as
\n+
614 // it grows.
\n+
615 //
\n+
616 return false;
\n+
617}
\n+
\n+
618
\n+
619template <class MESH>
\n+
620bool
\n+
\n+\n+
622
\n+\n+
624 "Failure in TopologyRefinerFactory<>::assignComponentTopology() -- no specialization provided.");
\n+
625
\n+
626 //
\n+
627 // Assigning the topology tables:
\n+
628 // Once the topology tables have been allocated, the six required topological
\n+
629 // relations can be directly populated using the following methods:
\n+
630 //
\n+
631 // IndexArray setBaseFaceVertices(TopologyRefiner& newRefiner, Index face)
\n+
632 // IndexArray setBaseFaceEdges(TopologyRefiner& newRefiner, Index face)
\n+
633 //
\n+
634 // IndexArray setBaseEdgeVertices(TopologyRefiner& newRefiner, Index edge)
\n+
635 // IndexArray setBaseEdgeFaces(TopologyRefiner& newRefiner, Index edge)
\n+
636 //
\n+
637 // IndexArray setBaseVertexEdges(TopologyRefiner& newRefiner, Index vertex)
\n+
638 // IndexArray setBaseVertexFaces(TopologyRefiner& newRefiner, Index vertex)
\n+
639 //
\n+
640 // For the last two relations -- the faces and edges incident a vertex -- there are
\n+
641 // also "local indices" that must be specified (considering doing this internally),
\n+
642 // where the "local index" of each incident face or edge is the index of the vertex
\n+
643 // within that face or edge, and so ranging from 0-3 for incident quads and 0-1 for
\n+
644 // incident edges. These are assigned through similarly retrieved arrays:
\n+
645 //
\n+
646 // LocalIndexArray setBaseVertexFaceLocalIndices(TopologyRefiner& newRefiner, Index vertex)
\n+
647 // LocalIndexArray setBaseVertexEdgeLocalIndices(TopologyRefiner& newRefiner, Index vertex)
\n+
648 // LocalIndexArray setBaseEdgeFaceLocalIndices( TopologyRefiner& newRefiner, Index edge)
\n+
649 //
\n+
650 // or, if the mesh is manifold, explicit assignment of these can be deferred and
\n+
651 // all can be determined by calling:
\n+
652 //
\n+
653 // void populateBaseLocalIndices(TopologyRefiner& newRefiner)
\n+
654 //
\n+
655 // All components are assumed to be locally manifold and ordering of components in
\n+
656 // the above relations is expected to be counter-clockwise.
\n+
657 //
\n+
658 // For non-manifold components, no ordering/orientation of incident components is
\n+
659 // assumed or required, but be sure to explicitly tag such components (vertices and
\n+
660 // edges) as non-manifold:
\n+
661 //
\n+
662 // void setBaseEdgeNonManifold(TopologyRefiner& newRefiner, Index edge, bool b);
\n+
663 //
\n+
664 // void setBaseVertexNonManifold(TopologyRefiner& newRefiner, Index vertex, bool b);
\n+
665 //
\n+
666 // Also consider using TopologyLevel::ValidateTopology() when debugging to ensure
\n+
667 // that topology has been completely and correctly specified.
\n+
668 //
\n+
669 return false;
\n+
670}
\n+
\n+
671
\n+
672template <class MESH>
\n+
673bool
\n+
\n+\n+
675
\n+
676 //
\n+
677 // Optional assigning face-varying topology tables:
\n+
678 //
\n+
679 // Create independent face-varying primitive variable channels:
\n+
680 // int createBaseFVarChannel(TopologyRefiner& newRefiner, int numValues)
\n+
681 //
\n+
682 // For each channel, populate the face-vertex values:
\n+
683 // IndexArray setBaseFaceFVarValues(TopologyRefiner& newRefiner, Index face, int channel = 0)
\n+
684 //
\n+
685 return true;
\n+
686}
\n+
\n+
687
\n+
688template <class MESH>
\n+
689bool
\n+
\n+\n+
691
\n+
692 //
\n+
693 // Optional tagging:
\n+
694 // This is where any additional feature tags -- sharpness, holes, etc. -- can be
\n+
695 // specified using:
\n+
696 //
\n+
697 // void setBaseEdgeSharpness(TopologyRefiner& newRefiner, Index edge, float sharpness)
\n+
698 // void setBaseVertexSharpness(TopologyRefiner& newRefiner, Index vertex, float sharpness)
\n+
699 //
\n+
700 // void setBaseFaceHole(TopologyRefiner& newRefiner, Index face, bool hole)
\n+
701 //
\n+
702 return true;
\n+
703}
\n+
\n+
704
\n+
705template <class MESH>
\n+
706void
\n+
\n+\n+
708 TopologyError /* errCode */, char const * /* msg */, MESH const& /* mesh */) {
\n+
709
\n+
710 //
\n+
711 // Optional topology validation error reporting:
\n+
712 // This method is called whenever the factory encounters topology validation
\n+
713 // errors. By default, nothing is reported
\n+
714 //
\n+
715}
\n+
\n+
716
\n+
717} // end namespace Far
\n+
718
\n+
719} // end namespace OPENSUBDIV_VERSION
\n+
720using namespace OPENSUBDIV_VERSION;
\n+
721} // end namespace OpenSubdiv
\n+
722
\n+
723#endif /* OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H */
\n \n+
void Error(ErrorType err, const char *format,...)
Sends an OSD error with a message (internal use only)
\n+
@ FAR_RUNTIME_ERROR
Issue a generic runtime error, but continue execution.
Definition error.h:40
\n \n-
An interface for accessing data in a specific level of a refined topology hierarchy.
\n-
Index GetFaceParentFace(Index f) const
Return the parent face (in the previous level) of a given face.
\n-\n-
bool IsVertexValenceRegular(Index v) const
Return if the valence of the vertex is regular (must be manifold)
\n-
float GetEdgeSharpness(Index e) const
Return the sharpness assigned a given edge.
\n-
bool DoesFaceFVarTopologyMatch(Index f, int channel=0) const
Return if face-varying topology around a face matches.
\n-
Sdc::Crease::Rule GetVertexRule(Index v) const
Return the subdivision rule assigned a given vertex specific to this level.
\n-
bool IsVertexCorner(Index v) const
Return if the vertex is a corner (only one incident face)
\n-
Index GetVertexChildVertex(Index v) const
Return the child vertex (in the next level) of a given vertex.
\n-
ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const
Access the local indices of an edge with respect to its incident faces.
\n-
ConstIndexArray GetFaceChildEdges(Index f) const
Access the child edges (in the next level) of a given face.
\n-
bool DoesEdgeFVarTopologyMatch(Index e, int channel=0) const
Return if face-varying topology across the edge only matches.
\n-\n-
ConstIndexArray GetFaceVertices(Index f) const
Access the vertices incident a given face.
\n-
ConstIndexArray GetFaceChildFaces(Index f) const
Access the child faces (in the next level) of a given face.
\n-
int GetNumEdges() const
Return the number of edges in this level.
\n-\n-
bool IsEdgeNonManifold(Index e) const
Return if the edge is non-manifold.
\n-
bool IsFaceHole(Index f) const
Return if a given face has been tagged as a hole.
\n-
ConstIndexArray GetVertexEdges(Index v) const
Access the edges incident a given vertex.
\n-
Index GetFaceChildVertex(Index f) const
Return the child vertex (in the next level) of a given face.
\n-
bool DoesVertexFVarTopologyMatch(Index v, int channel=0) const
Return if face-varying topology around a vertex matches.
\n-
ConstIndexArray GetEdgeChildEdges(Index e) const
Access the child edges (in the next level) of a given edge.
\n-
bool IsEdgeInfSharp(Index e) const
Return if the edge is infinitely-sharp.
\n-
ConstIndexArray GetVertexFaces(Index v) const
Access the faces incident a given vertex.
\n-
Index FindEdge(Index v0, Index v1) const
Identify the edge matching the given vertex pair.
\n-
ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const
Access the local indices of a vertex with respect to its incident edges.
\n-
ConstIndexArray GetFaceEdges(Index f) const
Access the edges incident a given face.
\n-
int GetNumFaces() const
Return the number of faces in this level.
\n-
bool IsVertexBoundary(Index v) const
Return if the vertex is on a boundary (at least one incident boundary edge)
\n-
int GetNumFVarChannels() const
Return the number of face-varying channels (should be same for all levels)
\n-
int GetNumVertices() const
Return the number of vertices in this level.
\n-
ConstIndexArray GetEdgeFaces(Index e) const
Access the faces incident a given edge.
\n-
ConstIndexArray GetFaceFVarValues(Index f, int channel=0) const
Access the face-varying values associated with a particular face.
\n-
ConstIndexArray GetEdgeVertices(Index e) const
Access the vertices incident a given edge.
\n-
bool IsEdgeSemiSharp(Index e) const
Return if the edge is semi-sharp.
\n-\n-
float GetVertexSharpness(Index v) const
Return the sharpness assigned a given vertex.
\n-
Index GetEdgeChildVertex(Index e) const
Return the child vertex (in the next level) of a given edge.
\n-
bool IsVertexSemiSharp(Index v) const
Return if the vertex is semi-sharp.
\n-
int GetNumFaceVertices() const
Return the total number of face-vertices, i.e. the sum of all vertices for all faces.
\n-
bool IsVertexNonManifold(Index v) const
Return if the vertex is non-manifold.
\n-
bool IsEdgeBoundary(Index e) const
Return if the edge is a boundary (only one incident face)
\n-
bool IsVertexInfSharp(Index v) const
Return if the vertex is infinitely-sharp.
\n-
int GetNumFVarValues(int channel=0) const
Return the total number of face-varying values in a particular channel (the upper bound of a face-var...
\n-
ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const
Access the local indices of a vertex with respect to its incident faces.
\n-
Stores topology data for a specified set of refinement options.
\n-\n-\n+
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n+\n+
Factory for constructing TopologyRefiners from specific mesh classes.
\n+
static int getNumBaseFaces(TopologyRefiner const &newRefiner)
\n+
static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces,...
\n+
static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH const &mesh)
(Optional) Control run-time topology validation and error reporting
\n+
static LocalIndexArray getBaseVertexFaceLocalIndices(TopologyRefiner &newRefiner, Index v)
Assign the local indices of a vertex within each of its incident faces.
\n+
static int getNumBaseVertices(TopologyRefiner const &newRefiner)
\n+
static void setNumBaseEdgeFaces(TopologyRefiner &newRefiner, Index e, int count)
Specify the number of faces incident each edge.
\n+
static IndexArray getBaseFaceVertices(TopologyRefiner &newRefiner, Index f)
Assign the vertices incident each face.
\n+
static LocalIndexArray getBaseEdgeFaceLocalIndices(TopologyRefiner &newRefiner, Index e)
Assign the local indices of an edge within each of its incident faces.
\n+
static bool populateBaseLevel(TopologyRefiner &refiner, MESH const &mesh, Options options)
\n+
static void populateBaseLocalIndices(TopologyRefiner &newRefiner)
Determine all local indices by inspection (only for pure manifold meshes)
\n+
static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify edge or vertex sharpness or face holes
\n+
static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the number of vertices, faces, face-vertices, etc.
\n+
static void setNumBaseVertexEdges(TopologyRefiner &newRefiner, Index v, int count)
Specify the number of edges incident each vertex.
\n+\n+
static IndexArray getBaseFaceFVarValues(TopologyRefiner &newRefiner, Index face, int channel=0)
Assign the face-varying values for the corners of each face.
\n+
static IndexArray getBaseEdgeFaces(TopologyRefiner &newRefiner, Index e)
Assign the faces incident each edge.
\n+
static void setNumBaseVertexFaces(TopologyRefiner &newRefiner, Index v, int count)
Specify the number of faces incident each vertex.
\n+
static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify face-varying data per face
\n+
static void setBaseVertexSharpness(TopologyRefiner &newRefiner, Index v, float sharpness)
Assign a sharpness value to a given vertex.
\n+
static LocalIndexArray getBaseVertexEdgeLocalIndices(TopologyRefiner &newRefiner, Index v)
Assign the local indices of a vertex within each of its incident edges.
\n+
static IndexArray getBaseEdgeVertices(TopologyRefiner &newRefiner, Index e)
Assign the vertices incident each edge.
\n+
static IndexArray getBaseVertexFaces(TopologyRefiner &newRefiner, Index v)
Assign the faces incident each vertex.
\n+
static void setBaseVertexNonManifold(TopologyRefiner &newRefiner, Index v, bool b)
Tag a vertex as non-manifold.
\n+
static void setNumBaseFaces(TopologyRefiner &newRefiner, int count)
Specify the number of faces to be accommodated.
\n+
static IndexArray getBaseFaceEdges(TopologyRefiner &newRefiner, Index f)
Assign the edges incident each face.
\n+
static void setNumBaseFaceVertices(TopologyRefiner &newRefiner, Index f, int count)
Specify the number of vertices incident each face.
\n+
static void setBaseEdgeSharpness(TopologyRefiner &newRefiner, Index e, float sharpness)
Assign a sharpness value to a given edge.
\n+
static void setBaseEdgeNonManifold(TopologyRefiner &newRefiner, Index e, bool b)
Tag an edge as non-manifold.
\n+
static void setNumBaseEdges(TopologyRefiner &newRefiner, int count)
Specify the number of edges to be accommodated.
\n+
static TopologyRefiner * Create(MESH const &mesh, Options options=Options())
Instantiates a TopologyRefiner from client-provided topological representation.
\n+
static Index findBaseEdge(TopologyRefiner const &newRefiner, Index v0, Index v1)
Identify an edge to be assigned a sharpness value given a vertex pair.
\n+
static IndexArray getBaseVertexEdges(TopologyRefiner &newRefiner, Index v)
Assign the edges incident each vertex.
\n+
static int createBaseFVarChannel(TopologyRefiner &newRefiner, int numValues)
Create a new face-varying channel with the given number of values.
\n+
static int getNumBaseEdges(TopologyRefiner const &newRefiner)
\n+
static void setNumBaseVertices(TopologyRefiner &newRefiner, int count)
Specify the number of vertices to be accommodated.
\n+
static void setBaseFaceHole(TopologyRefiner &newRefiner, Index f, bool isHole)
Tag a face as a hole.
\n+
Stores topology data for a specified set of refinement options.
\n+
Private base class of Factories for constructing TopologyRefiners.
\n+
static bool prepareComponentTopologyAssignment(TopologyRefiner &refiner, bool fullValidation, TopologyCallback callback, void const *callbackData)
\n+\n+
static bool prepareComponentTagsAndSharpness(TopologyRefiner &refiner)
\n+
static bool prepareComponentTopologySizing(TopologyRefiner &refiner)
\n+
static bool prepareFaceVaryingChannels(TopologyRefiner &refiner)
\n+
Options related to the construction of each TopologyRefiner.
\n+
Options(Sdc::SchemeType sdcType=Sdc::SCHEME_CATMARK, Sdc::Options sdcOptions=Sdc::Options())
\n+\n+
Sdc::SchemeType schemeType
The subdivision scheme type identifier.
\n+\n+
All supported options applying to subdivision scheme.
Definition options.h:51
\n+
void SetFVarLinearInterpolation(FVarLinearInterpolation b)
Set face-varying interpolation rule.
Definition options.h:98
\n+
FVarLinearInterpolation GetFVarLinearInterpolation() const
Get face-varying interpolation rule.
Definition options.h:95
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-topologyLevel.h\n+topologyRefinerFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 DreamWorks Animation LLC.\n+2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,387 +23,931 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H\n-25#define OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H\n+24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H\n+25#define OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H\n 26\n 27#include \"../version.h\"\n 28\n-29#include \"../vtr/level.h\"\n-30#include \"../vtr/refinement.h\"\n-31#include \"../far/types.h\"\n-32\n-33#include \n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Far {\n-39\n-_\b4_\b9class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl {\n-50\n-51public:\n-53\n-60\n-_\b6_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const { return _level->getNumVertices(); }\n+29#include \"../far/topologyRefiner.h\"\n+30#include \"../far/error.h\"\n+31\n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38\n+46//\n+_\b4_\b7class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be {\n+48protected:\n+49\n+50 //\n+51 // Protected methods invoked by the subclass template to verify and process\n+each\n+52 // stage of construction implemented by the subclass:\n+53 //\n+_\b5_\b4 typedef Vtr::internal::Level::ValidationCallback _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bC_\ba_\bl_\bl_\bb_\ba_\bc_\bk;\n+55\n+_\b5_\b6 static bool _\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bz_\bi_\bn_\bg(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner);\n+_\b5_\b7 static bool _\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bA_\bs_\bs_\bi_\bg_\bn_\bm_\be_\bn_\bt(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner,\n+bool fullValidation,\n+58 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bC_\ba_\bl_\bl_\bb_\ba_\bc_\bk callback, void const * callbackData);\n+_\b5_\b9 static bool _\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs_\bA_\bn_\bd_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner);\n+_\b6_\b0 static bool _\bp_\br_\be_\bp_\ba_\br_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner);\n+61};\n+62\n 63\n-_\b6_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const { return _level->getNumFaces(); }\n-66\n-_\b6_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs() const { return _level->getNumEdges(); }\n-69\n-_\b7_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const { return _level->getNumFaceVerticesTotal(); }\n-73\n-75\n-90 //\n-91\n-_\b9_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _level-\n->getFaceVertices(f); }\n-94\n-_\b9_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _level->getFaceEdges\n-(f); }\n-97\n-_\b9_\b9 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level-\n->getEdgeVertices(e); }\n-100\n-_\b1_\b0_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeFaces\n-(e); }\n-103\n-_\b1_\b0_\b5 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n->getVertexFaces(v); }\n-106\n-_\b1_\b0_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n->getVertexEdges(v); }\n-109\n-_\b1_\b1_\b1 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return\n-_level->getVertexFaceLocalIndices(v); }\n-112\n-_\b1_\b1_\b4 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx v) const { return\n-_level->getVertexEdgeLocalIndices(v); }\n-115\n-_\b1_\b1_\b7 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return\n-_level->getEdgeFaceLocalIndices(e); }\n-118\n-_\b1_\b2_\b0 _\bI_\bn_\bd_\be_\bx _\bF_\bi_\bn_\bd_\bE_\bd_\bg_\be(_\bI_\bn_\bd_\be_\bx v0, _\bI_\bn_\bd_\be_\bx v1) const { return _level->findEdge(v0, v1);\n-}\n-122\n-124\n-126\n-_\b1_\b2_\b8 bool _\bI_\bs_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bI_\bn_\bd_\be_\bx e) const { return _level->isEdgeNonManifold\n-(e); }\n+77template \n+_\b7_\b8class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be {\n+79\n+80public:\n+81\n+_\b8_\b4 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+85\n+_\b8_\b6 _\bO_\bp_\bt_\bi_\bo_\bn_\bs(_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be sdcType = _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+sdcOptions = _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs()) :\n+87 _\bs_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be(sdcType),\n+88 _\bs_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs(sdcOptions),\n+89 _\bv_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bF_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(false) { }\n+90\n+_\b9_\b1 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be _\bs_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be;\n+_\b9_\b2 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bs_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs;\n+_\b9_\b4 unsigned int _\bv_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bF_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by : 1;\n+97 };\n+98\n+108 //\n+113 static _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br* _\bC_\br_\be_\ba_\bt_\be(MESH const& mesh, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+());\n+114\n+128 static _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br* _\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & baseLevel);\n 129\n-_\b1_\b3_\b1 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n->isVertexNonManifold(v); }\n+130protected:\n+_\b1_\b3_\b1 typedef Vtr::internal::Level::TopologyError _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bE_\br_\br_\bo_\br;\n 132\n-_\b1_\b3_\b4 bool _\bI_\bs_\bE_\bd_\bg_\be_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n-(e)._boundary; }\n-135\n-_\b1_\b3_\b7 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n-(v)._boundary; }\n-138\n-_\b1_\b4_\b0 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br(_\bI_\bn_\bd_\be_\bx v) const { return (_level->getNumVertexFaces(v)\n-== 1); }\n-141\n-_\b1_\b6_\b2 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bR_\be_\bg_\bu_\bl_\ba_\br(_\bI_\bn_\bd_\be_\bx v) const { return !_level->getVertexTag\n-(v)._xordinary || _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br(v); }\n-164\n-166\n-171\n-_\b1_\b7_\b3 float _\bG_\be_\bt_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeSharpness(e);\n-}\n-174\n-_\b1_\b7_\b6 float _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexSharpness\n-(v); }\n-177\n-_\b1_\b7_\b9 bool _\bI_\bs_\bE_\bd_\bg_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n-(e)._infSharp; }\n-180\n-_\b1_\b8_\b2 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n-(v)._infSharp; }\n-183\n-_\b1_\b8_\b5 bool _\bI_\bs_\bE_\bd_\bg_\be_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx e) const { return _level->getEdgeTag\n-(e)._semiSharp; }\n-186\n-_\b1_\b8_\b8 bool _\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(_\bI_\bn_\bd_\be_\bx v) const { return _level->getVertexTag\n-(v)._semiSharp; }\n-189\n-_\b1_\b9_\b1 bool _\bI_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bI_\bn_\bd_\be_\bx f) const { return _level->isFaceHole(f); }\n-192\n-_\b1_\b9_\b4 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(_\bI_\bn_\bd_\be_\bx v) const { return _level-\n->getVertexRule(v); }\n+134\n+149\n+151 static bool _\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& newRefiner, MESH\n+const& mesh);\n+152\n+155 static bool _\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& newRefiner, MESH\n+const& mesh);\n+156\n+158 static bool _\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& newRefiner, MESH const&\n+mesh);\n+159\n+161 static bool _\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& newRefiner, MESH\n+const& mesh);\n+162\n+164 static void _\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(TopologyError errCode, char const * msg,\n+MESH const& mesh);\n+165\n+167\n+168protected:\n+170\n+187\n+189 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, int count);\n+190\n+192 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, int count);\n+193\n+195 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, int count);\n 196\n-198\n-228\n-_\b2_\b3_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return _level->getNumFVarChannels(); }\n-231\n-_\b2_\b3_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int channel = 0) const { return _level-\n->getNumFVarValues(channel); }\n-235\n-_\b2_\b3_\b7 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bI_\bn_\bd_\be_\bx f, int channel = 0) const {\n-238 return _level->getFaceFVarValues(f, channel);\n-239 }\n+198 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx f,\n+int count);\n+199\n+201 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx e, int\n+count);\n+202\n+204 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx v,\n+int count);\n+205\n+207 static void _\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx v,\n+int count);\n+208\n+209 static int _\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & newRefiner);\n+210 static int _\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & newRefiner);\n+211 static int _\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & newRefiner);\n+213\n+215\n+237\n+239 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx\n+f);\n 240\n-_\b2_\b4_\b2 bool _\bD_\bo_\be_\bs_\bV_\be_\br_\bt_\be_\bx_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx v, int channel = 0) const {\n-243 return _level->doesVertexFVarTopologyMatch(v, channel);\n-244 }\n-245\n-_\b2_\b4_\b7 bool _\bD_\bo_\be_\bs_\bE_\bd_\bg_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx e, int channel = 0) const {\n-248 return _level->doesEdgeFVarTopologyMatch(e, channel);\n-249 }\n-250\n-_\b2_\b5_\b2 bool _\bD_\bo_\be_\bs_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh(_\bI_\bn_\bd_\be_\bx f, int channel = 0) const {\n-253 return _level->doesFaceFVarTopologyMatch(f, channel);\n-254 }\n+242 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx f);\n+243\n+245 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx\n+e);\n+246\n+248 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx e);\n+249\n+251 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx\n+v);\n+252\n+254 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx\n+v);\n 255\n-257\n-259\n-260\n-_\b2_\b6_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bF_\ba_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n->getFaceChildFaces(f); }\n-263\n-_\b2_\b6_\b5 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n->getFaceChildEdges(f); }\n-266\n-_\b2_\b6_\b8 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs(_\bI_\bn_\bd_\be_\bx e) const { return _refToChild-\n->getEdgeChildEdges(e); }\n-269\n-_\b2_\b7_\b1 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx( _\bI_\bn_\bd_\be_\bx f) const { return _refToChild-\n->getFaceChildVertex(f); }\n+257 static _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v);\n+259 static _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v);\n+261 static _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e);\n+262\n+264 static void _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner);\n+265\n+267 static void _\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx e,\n+bool b);\n+268\n+270 static void _\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx v,\n+bool b);\n 272\n-_\b2_\b7_\b4 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx( _\bI_\bn_\bd_\be_\bx e) const { return _refToChild-\n->getEdgeChildVertex(e); }\n-275\n-_\b2_\b7_\b7 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx(_\bI_\bn_\bd_\be_\bx v) const { return _refToChild-\n->getVertexChildVertex(v); }\n-278\n-_\b2_\b8_\b0 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\be_\bn_\bt_\bF_\ba_\bc_\be(_\bI_\bn_\bd_\be_\bx f) const { return _refToParent-\n->getChildFaceParentFace(f); }\n-282\n-284\n-285\n-_\b2_\b8_\b6 bool _\bV_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by() const { return _level->validateTopology(); }\n-_\b2_\b8_\b7 void _\bP_\br_\bi_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(bool children = true) const { _level->print((children &&\n-_refToChild) ? _refToChild : 0); }\n+274\n+283\n+285 static _\bI_\bn_\bd_\be_\bx _\bf_\bi_\bn_\bd_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & newRefiner, _\bI_\bn_\bd_\be_\bx v0,\n+_\bI_\bn_\bd_\be_\bx v1);\n+286\n+288 static void _\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx e,\n+float sharpness);\n 289\n-290\n-291private:\n-_\b2_\b9_\b2 friend class _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br;\n-293\n-294 Vtr::internal::Level const * _level;\n-295 Vtr::internal::Refinement const * _refToParent;\n-296 Vtr::internal::Refinement const * _refToChild;\n-297\n-298public:\n-299 // Not intended for public use, but required by std::vector, etc...\n-_\b3_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl() { }\n-_\b3_\b0_\b1 _\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl() { }\n-302};\n-303\n-304} // end namespace Far\n-305\n-306} // end namespace OPENSUBDIV_VERSION\n-307using namespace OPENSUBDIV_VERSION;\n-308} // end namespace OpenSubdiv\n-309\n-310#endif /* OPENSUBDIV3_FAR_TOPOLOGY_LEVEL_H */\n+291 static void _\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx v,\n+float sharpness);\n+292\n+294 static void _\bs_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx f, bool\n+isHole);\n+296\n+298\n+308\n+310 static int _\bc_\br_\be_\ba_\bt_\be_\bB_\ba_\bs_\be_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, int\n+numValues);\n+311\n+313 static int _\bc_\br_\be_\ba_\bt_\be_\bB_\ba_\bs_\be_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, int\n+numValues, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const& fvarOptions);\n+314\n+316 static _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner, _\bI_\bn_\bd_\be_\bx\n+face, int channel = 0);\n+317\n+319\n+320protected:\n+321 //\n+322 // Not to be specialized:\n+323 //\n+324 static bool _\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner, MESH const& mesh,\n+_\bO_\bp_\bt_\bi_\bo_\bn_\bs options);\n+325\n+326private:\n+327 //\n+328 // An oversight in the interfaces of the error reporting function between\n+the factory\n+329 // class and the Vtr::Level requires this adapter function to avoid\n+warnings.\n+330 //\n+331 // The static class method requires a reference as the MESH argument, but\n+the interface\n+332 // for Vtr::Level requires a pointer (void*). So this adapter with a MESH*\n+argument is\n+333 // used to effectively cast the function pointer required by Vtr::Level\n+error reporting:\n+334 //\n+335 static void reportInvalidTopologyAdapter(TopologyError errCode, char const\n+* msg, MESH const * mesh) {\n+336 _\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(errCode, msg, *mesh);\n+337 }\n+338};\n+339\n+340\n+341//\n+342// Generic implementations:\n+343//\n+344template \n+345TopologyRefiner*\n+_\b3_\b4_\b6_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(MESH const& mesh, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options) {\n+347\n+348 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br * refiner = new _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br(options._\bs_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be,\n+options._\bs_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs);\n+349\n+350 if (! populateBaseLevel(*refiner, mesh, options)) {\n+351 delete refiner;\n+352 return 0;\n+353 }\n+354\n+355 // Eventually want to move the Refiner's inventory initialization here.\n+Currently it\n+356 // is handled after topology assignment, but if the inventory is to include\n+additional\n+357 // features (e.g. holes, etc.) it is better off deferred to here.\n+358\n+359 return refiner;\n+360}\n+361\n+362template \n+363_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br*\n+_\b3_\b6_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & source) {\n+365\n+366 return new _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br(source);\n+367}\n+368\n+369template \n+370bool\n+_\b3_\b7_\b1_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& refiner,\n+MESH const& mesh, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options) {\n+372\n+373 //\n+374 // Construction of a specialized topology refiner involves four steps, each\n+of which\n+375 // involves a method specialized for MESH followed by one that takes an\n+action in\n+376 // response to it or in preparation for the next step.\n+377 //\n+378 // Both the specialized methods and those that follow them may find fault\n+in the\n+379 // construction and trigger failure at any time:\n+380 //\n+381\n+382 //\n+383 // Sizing of the topology -- this is a required specialization for MESH.\n+This defines\n+384 // an inventory of all components and their relations that is used to\n+allocate buffers\n+385 // to be efficiently populated in the subsequent topology assignment step.\n+386 //\n+387 if (! resizeComponentTopology(refiner, mesh)) return false;\n+388 if (! prepareComponentTopologySizing(refiner)) return false;\n+389\n+390 //\n+391 // Assignment of the topology -- this is a required specialization for\n+MESH. If edges\n+392 // are specified, all other topological relations are expected to be\n+defined for them.\n+393 // Otherwise edges and remaining topology will be completed from the face-\n+vertices:\n+394 //\n+395 bool validate = options._\bv_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bF_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by;\n+396 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bC_\ba_\bl_\bl_\bb_\ba_\bc_\bk callback = reinterpret_cast<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bC_\ba_\bl_\bl_\bb_\ba_\bc_\bk>\n+(reportInvalidTopologyAdapter);\n+397 void const * userData = &mesh;\n+398\n+399 if (! assignComponentTopology(refiner, mesh)) return false;\n+400 if (! prepareComponentTopologyAssignment(refiner, validate, callback,\n+userData)) return false;\n+401\n+402 //\n+403 // User assigned and internal tagging of components -- an optional\n+specialization for\n+404 // MESH. Allows the specification of sharpness values, holes, etc.\n+405 //\n+406 if (! assignComponentTags(refiner, mesh)) return false;\n+407 if (! prepareComponentTagsAndSharpness(refiner)) return false;\n+408\n+409 //\n+410 // Defining channels of face-varying primvar data -- an optional\n+specialization for MESH.\n+411 //\n+412 if (! assignFaceVaryingTopology(refiner, mesh)) return false;\n+413 if (! prepareFaceVaryingChannels(refiner)) return false;\n+414\n+415 return true;\n+416}\n+417\n+418template \n+419inline void\n+_\b4_\b2_\b0_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner,\n+int count) {\n+421 newRefiner._levels[0]->resizeFaces(count);\n+422}\n+423template \n+424inline void\n+_\b4_\b2_\b5_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner,\n+int count) {\n+426 newRefiner._levels[0]->resizeEdges(count);\n+427}\n+428template \n+429inline void\n+_\b4_\b3_\b0_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, int count) {\n+431 newRefiner._levels[0]->resizeVertices(count);\n+432}\n+433\n+434template \n+435inline int\n+_\b4_\b3_\b6_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &\n+newRefiner) {\n+437 return newRefiner._levels[0]->getNumFaces();\n+438}\n+439template \n+440inline int\n+_\b4_\b4_\b1_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &\n+newRefiner) {\n+442 return newRefiner._levels[0]->getNumEdges();\n+443}\n+444template \n+445inline int\n+_\b4_\b4_\b6_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &\n+newRefiner) {\n+447 return newRefiner._levels[0]->getNumVertices();\n+448}\n+449\n+450template \n+451inline void\n+_\b4_\b5_\b2_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx f, int count) {\n+453 newRefiner._levels[0]->resizeFaceVertices(f, count);\n+454 newRefiner._hasIrregFaces = newRefiner._hasIrregFaces || (count !=\n+newRefiner._regFaceSize);\n+455}\n+456template \n+457inline void\n+_\b4_\b5_\b8_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e, int count) {\n+459 newRefiner._levels[0]->resizeEdgeFaces(e, count);\n+460}\n+461template \n+462inline void\n+_\b4_\b6_\b3_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v, int count) {\n+464 newRefiner._levels[0]->resizeVertexFaces(v, count);\n+465}\n+466template \n+467inline void\n+_\b4_\b6_\b8_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v, int count) {\n+469 newRefiner._levels[0]->resizeVertexEdges(v, count);\n+470}\n+471\n+472template \n+473inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b7_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx f) {\n+475 return newRefiner._levels[0]->getFaceVertices(f);\n+476}\n+477template \n+478inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b7_\b9_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner,\n+_\bI_\bn_\bd_\be_\bx f) {\n+480 return newRefiner._levels[0]->getFaceEdges(f);\n+481}\n+482template \n+483inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b8_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e) {\n+485 return newRefiner._levels[0]->getEdgeVertices(e);\n+486}\n+487template \n+488inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b8_\b9_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner,\n+_\bI_\bn_\bd_\be_\bx e) {\n+490 return newRefiner._levels[0]->getEdgeFaces(e);\n+491}\n+492template \n+493inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b9_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v) {\n+495 return newRefiner._levels[0]->getVertexFaces(v);\n+496}\n+497template \n+498inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b4_\b9_\b9_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v) {\n+500 return newRefiner._levels[0]->getVertexEdges(v);\n+501}\n+502\n+503template \n+504inline _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b5_\b0_\b5_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e) {\n+506 return newRefiner._levels[0]->getEdgeFaceLocalIndices(e);\n+507}\n+508template \n+509inline _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b5_\b1_\b0_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+& newRefiner, _\bI_\bn_\bd_\be_\bx v) {\n+511 return newRefiner._levels[0]->getVertexFaceLocalIndices(v);\n+512}\n+513template \n+514inline _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b5_\b1_\b5_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+& newRefiner, _\bI_\bn_\bd_\be_\bx v) {\n+516 return newRefiner._levels[0]->getVertexEdgeLocalIndices(v);\n+517}\n+518\n+519template \n+520inline _\bI_\bn_\bd_\be_\bx\n+_\b5_\b2_\b1_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bf_\bi_\bn_\bd_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v0, _\bI_\bn_\bd_\be_\bx v1) {\n+522 return newRefiner._levels[0]->findEdge(v0, v1);\n+523}\n+524\n+525template \n+526inline void\n+_\b5_\b2_\b7_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner) {\n+528 newRefiner._levels[0]->populateLocalIndices();\n+529}\n+530\n+531template \n+532inline void\n+_\b5_\b3_\b3_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e, bool b) {\n+534 newRefiner._levels[0]->setEdgeNonManifold(e, b);\n+535}\n+536template \n+537inline void\n+_\b5_\b3_\b8_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v, bool b) {\n+539 newRefiner._levels[0]->setVertexNonManifold(v, b);\n+540}\n+541\n+542template \n+543inline void\n+_\b5_\b4_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx e, float s) {\n+545 newRefiner._levels[0]->getEdgeSharpness(e) = s;\n+546}\n+547template \n+548inline void\n+_\b5_\b4_\b9_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx v, float s) {\n+550 newRefiner._levels[0]->getVertexSharpness(v) = s;\n+551}\n+552template \n+553inline void\n+_\b5_\b5_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & newRefiner,\n+_\bI_\bn_\bd_\be_\bx f, bool b) {\n+555 newRefiner._levels[0]->setFaceHole(f, b);\n+556 newRefiner._hasHoles = newRefiner._hasHoles || b;\n+557}\n+558\n+559template \n+560inline int\n+_\b5_\b6_\b1_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\bB_\ba_\bs_\be_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, int numValues) {\n+562 return newRefiner._levels[0]->createFVarChannel(numValues,\n+newRefiner._subdivOptions);\n+563}\n+564template \n+565inline int\n+_\b5_\b6_\b6_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bc_\br_\be_\ba_\bt_\be_\bB_\ba_\bs_\be_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, int numValues, _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs const& fvarOptions) {\n+567 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs newOptions = newRefiner._subdivOptions;\n+568 newOptions._\bS_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+(fvarOptions._\bG_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn());\n+569 return newRefiner._levels[0]->createFVarChannel(numValues, newOptions);\n+570}\n+571template \n+572inline _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+_\b5_\b7_\b3_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br &\n+newRefiner, _\bI_\bn_\bd_\be_\bx face, int channel) {\n+574 return newRefiner._levels[0]->getFaceFVarValues(face, channel);\n+575}\n+576\n+577\n+578template \n+579bool\n+_\b5_\b8_\b0_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& /\n+* refiner */, MESH const& /* mesh */) {\n+581\n+582 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+583 \"Failure in TopologyRefinerFactory<>::resizeComponentTopology() -- no\n+specialization provided.\");\n+584\n+585 //\n+586 // Sizing the topology tables:\n+587 // This method is for determining the sizes of the various topology tables\n+(and other\n+588 // data) associated with the mesh. Once completed, appropriate memory will\n+be allocated\n+589 // and an additional method invoked to populate it accordingly.\n+590 //\n+591 // The following methods should be called -- first those to specify the\n+number of faces,\n+592 // edges and vertices in the mesh:\n+593 //\n+594 // void setBaseFaceCount( TopologyRefiner& newRefiner, int count)\n+595 // void setBaseEdgeCount( TopologyRefiner& newRefiner, int count)\n+596 // void setBaseVertexCount(TopologyRefiner& newRefiner, int count)\n+597 //\n+598 // and then for each face, edge and vertex, the number of its incident\n+components:\n+599 //\n+600 // void setBaseFaceVertexCount(TopologyRefiner& newRefiner, Index face, int\n+count)\n+601 // void setBaseEdgeFaceCount( TopologyRefiner& newRefiner, Index edge, int\n+count)\n+602 // void setBaseVertexFaceCount(TopologyRefiner& newRefiner, Index vertex,\n+int count)\n+603 // void setBaseVertexEdgeCount(TopologyRefiner& newRefiner, Index vertex,\n+int count)\n+604 //\n+605 // The count/size for a component type must be set before indices\n+associated with that\n+606 // component type can be used.\n+607 //\n+608 // Note that it is only necessary to size 4 of the 6 supported topological\n+relations --\n+609 // the number of edge-vertices is fixed at two per edge, and the number of\n+face-edges is\n+610 // the same as the number of face-vertices.\n+611 //\n+612 // So a single pass through your mesh to gather up all of this sizing\n+information will\n+613 // allow the Tables to be allocated appropriately once and avoid any\n+dynamic resizing as\n+614 // it grows.\n+615 //\n+616 return false;\n+617}\n+618\n+619template \n+620bool\n+_\b6_\b2_\b1_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& /\n+* refiner */, MESH const& /* mesh */) {\n+622\n+623 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+624 \"Failure in TopologyRefinerFactory<>::assignComponentTopology() -- no\n+specialization provided.\");\n+625\n+626 //\n+627 // Assigning the topology tables:\n+628 // Once the topology tables have been allocated, the six required\n+topological\n+629 // relations can be directly populated using the following methods:\n+630 //\n+631 // IndexArray setBaseFaceVertices(TopologyRefiner& newRefiner, Index face)\n+632 // IndexArray setBaseFaceEdges(TopologyRefiner& newRefiner, Index face)\n+633 //\n+634 // IndexArray setBaseEdgeVertices(TopologyRefiner& newRefiner, Index edge)\n+635 // IndexArray setBaseEdgeFaces(TopologyRefiner& newRefiner, Index edge)\n+636 //\n+637 // IndexArray setBaseVertexEdges(TopologyRefiner& newRefiner, Index vertex)\n+638 // IndexArray setBaseVertexFaces(TopologyRefiner& newRefiner, Index vertex)\n+639 //\n+640 // For the last two relations -- the faces and edges incident a vertex -\n+- there are\n+641 // also \"local indices\" that must be specified (considering doing this\n+internally),\n+642 // where the \"local index\" of each incident face or edge is the index of\n+the vertex\n+643 // within that face or edge, and so ranging from 0-3 for incident quads and\n+0-1 for\n+644 // incident edges. These are assigned through similarly retrieved arrays:\n+645 //\n+646 // LocalIndexArray setBaseVertexFaceLocalIndices(TopologyRefiner&\n+newRefiner, Index vertex)\n+647 // LocalIndexArray setBaseVertexEdgeLocalIndices(TopologyRefiner&\n+newRefiner, Index vertex)\n+648 // LocalIndexArray setBaseEdgeFaceLocalIndices( TopologyRefiner&\n+newRefiner, Index edge)\n+649 //\n+650 // or, if the mesh is manifold, explicit assignment of these can be\n+deferred and\n+651 // all can be determined by calling:\n+652 //\n+653 // void populateBaseLocalIndices(TopologyRefiner& newRefiner)\n+654 //\n+655 // All components are assumed to be locally manifold and ordering of\n+components in\n+656 // the above relations is expected to be counter-clockwise.\n+657 //\n+658 // For non-manifold components, no ordering/orientation of incident\n+components is\n+659 // assumed or required, but be sure to explicitly tag such components\n+(vertices and\n+660 // edges) as non-manifold:\n+661 //\n+662 // void setBaseEdgeNonManifold(TopologyRefiner& newRefiner, Index edge,\n+bool b);\n+663 //\n+664 // void setBaseVertexNonManifold(TopologyRefiner& newRefiner, Index vertex,\n+bool b);\n+665 //\n+666 // Also consider using TopologyLevel::ValidateTopology() when debugging to\n+ensure\n+667 // that topology has been completely and correctly specified.\n+668 //\n+669 return false;\n+670}\n+671\n+672template \n+673bool\n+_\b6_\b7_\b4_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& /\n+* refiner */, MESH const& /* mesh */) {\n+675\n+676 //\n+677 // Optional assigning face-varying topology tables:\n+678 //\n+679 // Create independent face-varying primitive variable channels:\n+680 // int createBaseFVarChannel(TopologyRefiner& newRefiner, int numValues)\n+681 //\n+682 // For each channel, populate the face-vertex values:\n+683 // IndexArray setBaseFaceFVarValues(TopologyRefiner& newRefiner, Index\n+face, int channel = 0)\n+684 //\n+685 return true;\n+686}\n+687\n+688template \n+689bool\n+_\b6_\b9_\b0_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br& /\n+* refiner */, MESH const& /* mesh */) {\n+691\n+692 //\n+693 // Optional tagging:\n+694 // This is where any additional feature tags -- sharpness, holes, etc. -\n+- can be\n+695 // specified using:\n+696 //\n+697 // void setBaseEdgeSharpness(TopologyRefiner& newRefiner, Index edge, float\n+sharpness)\n+698 // void setBaseVertexSharpness(TopologyRefiner& newRefiner, Index vertex,\n+float sharpness)\n+699 //\n+700 // void setBaseFaceHole(TopologyRefiner& newRefiner, Index face, bool hole)\n+701 //\n+702 return true;\n+703}\n+704\n+705template \n+706void\n+_\b7_\b0_\b7_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bM_\bE_\bS_\bH_\b>_\b:_\b:_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+708 TopologyError /* errCode */, char const * /* msg */, MESH const& /* mesh */\n+) {\n+709\n+710 //\n+711 // Optional topology validation error reporting:\n+712 // This method is called whenever the factory encounters topology\n+validation\n+713 // errors. By default, nothing is reported\n+714 //\n+715}\n+716\n+717} // end namespace Far\n+718\n+719} // end namespace OPENSUBDIV_VERSION\n+720using namespace OPENSUBDIV_VERSION;\n+721} // end namespace OpenSubdiv\n+722\n+723#endif /* OPENSUBDIV3_FAR_TOPOLOGY_REFINER_FACTORY_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bE_\br_\br_\bo_\br\n+void Error(ErrorType err, const char *format,...)\n+Sends an OSD error with a message (internal use only)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR\n+@ FAR_RUNTIME_ERROR\n+Issue a generic runtime error, but continue execution.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\be_\br_\br_\bo_\br_\b._\bh_\b:_\b4_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n Vtr::Index Index\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n-An interface for accessing data in a specific level of a refined topology\n-hierarchy.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bP_\ba_\br_\be_\bn_\bt_\bF_\ba_\bc_\be\n-Index GetFaceParentFace(Index f) const\n-Return the parent face (in the previous level) of a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n-TopologyLevel()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b3_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bR_\be_\bg_\bu_\bl_\ba_\br\n-bool IsVertexValenceRegular(Index v) const\n-Return if the valence of the vertex is regular (must be manifold)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float GetEdgeSharpness(Index e) const\n-Return the sharpness assigned a given edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n-bool DoesFaceFVarTopologyMatch(Index f, int channel=0) const\n-Return if face-varying topology around a face matches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n-Sdc::Crease::Rule GetVertexRule(Index v) const\n-Return the subdivision rule assigned a given vertex specific to this level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bC_\bo_\br_\bn_\be_\br\n-bool IsVertexCorner(Index v) const\n-Return if the vertex is a corner (only one incident face)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n-Index GetVertexChildVertex(Index v) const\n-Return the child vertex (in the next level) of a given vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-ConstLocalIndexArray GetEdgeFaceLocalIndices(Index e) const\n-Access the local indices of an edge with respect to its incident faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs\n-ConstIndexArray GetFaceChildEdges(Index f) const\n-Access the child edges (in the next level) of a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bE_\bd_\bg_\be_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n-bool DoesEdgeFVarTopologyMatch(Index e, int channel=0) const\n-Return if face-varying topology across the edge only matches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bP_\br_\bi_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-void PrintTopology(bool children=true) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetFaceVertices(Index f) const\n-Access the vertices incident a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bF_\ba_\bc_\be_\bs\n-ConstIndexArray GetFaceChildFaces(Index f) const\n-Access the child faces (in the next level) of a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bd_\bg_\be_\bs\n-int GetNumEdges() const\n-Return the number of edges in this level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bV_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-bool ValidateTopology() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n-bool IsEdgeNonManifold(Index e) const\n-Return if the edge is non-manifold.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n-bool IsFaceHole(Index f) const\n-Return if a given face has been tagged as a hole.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs\n-ConstIndexArray GetVertexEdges(Index v) const\n-Access the edges incident a given vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n-Index GetFaceChildVertex(Index f) const\n-Return the child vertex (in the next level) of a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bD_\bo_\be_\bs_\bV_\be_\br_\bt_\be_\bx_\bF_\bV_\ba_\br_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bM_\ba_\bt_\bc_\bh\n-bool DoesVertexFVarTopologyMatch(Index v, int channel=0) const\n-Return if face-varying topology around a vertex matches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bE_\bd_\bg_\be_\bs\n-ConstIndexArray GetEdgeChildEdges(Index e) const\n-Access the child edges (in the next level) of a given edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp\n-bool IsEdgeInfSharp(Index e) const\n-Return if the edge is infinitely-sharp.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n-ConstIndexArray GetVertexFaces(Index v) const\n-Access the faces incident a given vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bF_\bi_\bn_\bd_\bE_\bd_\bg_\be\n-Index FindEdge(Index v0, Index v1) const\n-Identify the edge matching the given vertex pair.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-ConstLocalIndexArray GetVertexEdgeLocalIndices(Index v) const\n-Access the local indices of a vertex with respect to its incident edges.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs\n-ConstIndexArray GetFaceEdges(Index f) const\n-Access the edges incident a given face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n-int GetNumFaces() const\n-Return the number of faces in this level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n-bool IsVertexBoundary(Index v) const\n-Return if the vertex is on a boundary (at least one incident boundary edge)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-Return the number of face-varying channels (should be same for all levels)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-Return the number of vertices in this level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs\n-ConstIndexArray GetEdgeFaces(Index e) const\n-Access the faces incident a given edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-ConstIndexArray GetFaceFVarValues(Index f, int channel=0) const\n-Access the face-varying values associated with a particular face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetEdgeVertices(Index e) const\n-Access the vertices incident a given edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b9_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n-bool IsEdgeSemiSharp(Index e) const\n-Return if the edge is semi-sharp.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\b~_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl\n-~TopologyLevel()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b3_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float GetVertexSharpness(Index v) const\n-Return the sharpness assigned a given vertex.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bE_\bd_\bg_\be_\bC_\bh_\bi_\bl_\bd_\bV_\be_\br_\bt_\be_\bx\n-Index GetEdgeChildVertex(Index e) const\n-Return the child vertex (in the next level) of a given edge.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n-bool IsVertexSemiSharp(Index v) const\n-Return if the vertex is semi-sharp.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumFaceVertices() const\n-Return the total number of face-vertices, i.e. the sum of all vertices for all\n-faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n-bool IsVertexNonManifold(Index v) const\n-Return if the vertex is non-manifold.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bE_\bd_\bg_\be_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n-bool IsEdgeBoundary(Index e) const\n-Return if the edge is a boundary (only one incident face)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bI_\bs_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp\n-bool IsVertexInfSharp(Index v) const\n-Return if the vertex is infinitely-sharp.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-int GetNumFVarValues(int channel=0) const\n-Return the total number of face-varying values in a particular channel (the\n-upper bound of a face-var...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b2_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-ConstLocalIndexArray GetVertexFaceLocalIndices(Index v) const\n-Access the local indices of a vertex with respect to its incident faces.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh_\b:_\b1_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+SchemeType\n+Enumerated type for all subdivision schemes supported by OpenSubdiv.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK\n+@ SCHEME_CATMARK\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Factory for constructing TopologyRefiners from specific mesh classes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs\n+static int getNumBaseFaces(TopologyRefiner const &newRefiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the relationships between vertices, faces, etc. ie the face-vertices,\n+vertex-faces,...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH\n+const &mesh)\n+(Optional) Control run-time topology validation and error reporting\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+static LocalIndexArray getBaseVertexFaceLocalIndices(TopologyRefiner\n+&newRefiner, Index v)\n+Assign the local indices of a vertex within each of its incident faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static int getNumBaseVertices(TopologyRefiner const &newRefiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs\n+static void setNumBaseEdgeFaces(TopologyRefiner &newRefiner, Index e, int\n+count)\n+Specify the number of faces incident each edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static IndexArray getBaseFaceVertices(TopologyRefiner &newRefiner, Index f)\n+Assign the vertices incident each face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+static LocalIndexArray getBaseEdgeFaceLocalIndices(TopologyRefiner &newRefiner,\n+Index e)\n+Assign the local indices of an edge within each of its incident faces.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b0_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl\n+static bool populateBaseLevel(TopologyRefiner &refiner, MESH const &mesh,\n+Options options)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bp_\bo_\bp_\bu_\bl_\ba_\bt_\be_\bB_\ba_\bs_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+static void populateBaseLocalIndices(TopologyRefiner &newRefiner)\n+Determine all local indices by inspection (only for pure manifold meshes)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs\n+static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)\n+(Optional) Specify edge or vertex sharpness or face holes\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the number of vertices, faces, face-vertices, etc.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs\n+static void setNumBaseVertexEdges(TopologyRefiner &newRefiner, Index v, int\n+count)\n+Specify the number of edges incident each vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bE_\br_\br_\bo_\br\n+Vtr::internal::Level::TopologyError TopologyError\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+static IndexArray getBaseFaceFVarValues(TopologyRefiner &newRefiner, Index\n+face, int channel=0)\n+Assign the face-varying values for the corners of each face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bF_\ba_\bc_\be_\bs\n+static IndexArray getBaseEdgeFaces(TopologyRefiner &newRefiner, Index e)\n+Assign the faces incident each edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n+static void setNumBaseVertexFaces(TopologyRefiner &newRefiner, Index v, int\n+count)\n+Specify the number of faces incident each vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+(Optional) Specify face-varying data per face\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+static void setBaseVertexSharpness(TopologyRefiner &newRefiner, Index v, float\n+sharpness)\n+Assign a sharpness value to a given vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+static LocalIndexArray getBaseVertexEdgeLocalIndices(TopologyRefiner\n+&newRefiner, Index v)\n+Assign the local indices of a vertex within each of its incident edges.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bg_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static IndexArray getBaseEdgeVertices(TopologyRefiner &newRefiner, Index e)\n+Assign the vertices incident each edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n+static IndexArray getBaseVertexFaces(TopologyRefiner &newRefiner, Index v)\n+Assign the faces incident each vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+static void setBaseVertexNonManifold(TopologyRefiner &newRefiner, Index v, bool\n+b)\n+Tag a vertex as non-manifold.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bs\n+static void setNumBaseFaces(TopologyRefiner &newRefiner, int count)\n+Specify the number of faces to be accommodated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bE_\bd_\bg_\be_\bs\n+static IndexArray getBaseFaceEdges(TopologyRefiner &newRefiner, Index f)\n+Assign the edges incident each face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static void setNumBaseFaceVertices(TopologyRefiner &newRefiner, Index f, int\n+count)\n+Specify the number of vertices incident each face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+static void setBaseEdgeSharpness(TopologyRefiner &newRefiner, Index e, float\n+sharpness)\n+Assign a sharpness value to a given edge.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bs_\be_\bt_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bN_\bo_\bn_\bM_\ba_\bn_\bi_\bf_\bo_\bl_\bd\n+static void setBaseEdgeNonManifold(TopologyRefiner &newRefiner, Index e, bool\n+b)\n+Tag an edge as non-manifold.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs\n+static void setNumBaseEdges(TopologyRefiner &newRefiner, int count)\n+Specify the number of edges to be accommodated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static TopologyRefiner * Create(MESH const &mesh, Options options=Options())\n+Instantiates a TopologyRefiner from client-provided topological representation.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bf_\bi_\bn_\bd_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be\n+static Index findBaseEdge(TopologyRefiner const &newRefiner, Index v0, Index\n+v1)\n+Identify an edge to be assigned a sharpness value given a vertex pair.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bE_\bd_\bg_\be_\bs\n+static IndexArray getBaseVertexEdges(TopologyRefiner &newRefiner, Index v)\n+Assign the edges incident each vertex.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b9_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bc_\br_\be_\ba_\bt_\be_\bB_\ba_\bs_\be_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+static int createBaseFVarChannel(TopologyRefiner &newRefiner, int numValues)\n+Create a new face-varying channel with the given number of values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bg_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bE_\bd_\bg_\be_\bs\n+static int getNumBaseEdges(TopologyRefiner const &newRefiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bN_\bu_\bm_\bB_\ba_\bs_\be_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+static void setNumBaseVertices(TopologyRefiner &newRefiner, int count)\n+Specify the number of vertices to be accommodated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b3_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bs_\be_\bt_\bB_\ba_\bs_\be_\bF_\ba_\bc_\be_\bH_\bo_\bl_\be\n+static void setBaseFaceHole(TopologyRefiner &newRefiner, Index f, bool isHole)\n+Tag a face as a hole.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5_\b4\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n-Rule\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n+Private base class of Factories for constructing TopologyRefiners.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bA_\bs_\bs_\bi_\bg_\bn_\bm_\be_\bn_\bt\n+static bool prepareComponentTopologyAssignment(TopologyRefiner &refiner, bool\n+fullValidation, TopologyCallback callback, void const *callbackData)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bC_\ba_\bl_\bl_\bb_\ba_\bc_\bk\n+Vtr::internal::Level::ValidationCallback TopologyCallback\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs_\bA_\bn_\bd_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+static bool prepareComponentTagsAndSharpness(TopologyRefiner &refiner)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bp_\br_\be_\bp_\ba_\br_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bS_\bi_\bz_\bi_\bn_\bg\n+static bool prepareComponentTopologySizing(TopologyRefiner &refiner)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be_\b:_\b:\n+_\bp_\br_\be_\bp_\ba_\br_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+static bool prepareFaceVaryingChannels(TopologyRefiner &refiner)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options related to the construction of each TopologyRefiner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options(Sdc::SchemeType sdcType=Sdc::SCHEME_CATMARK, Sdc::Options\n+sdcOptions=Sdc::Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bs_\bc_\bh_\be_\bm_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Sdc::Options schemeOptions\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bs_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+Sdc::SchemeType schemeType\n+The subdivision scheme type identifier.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bv_\ba_\bl_\bi_\bd_\ba_\bt_\be_\bF_\bu_\bl_\bl_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+unsigned int validateFullTopology\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+All supported options applying to subdivision scheme.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+void SetFVarLinearInterpolation(FVarLinearInterpolation b)\n+Set face-varying interpolation rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+FVarLinearInterpolation GetFVarLinearInterpolation() const\n+Get face-varying interpolation rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b1_\b0_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyDescriptor.h File Reference\n+OpenSubdiv: opensubdiv/far/stencilTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,31 +90,51 @@\n \n \n \n
\n \n-
topologyDescriptor.h File Reference
\n+
stencilTable.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/topologyRefiner.h"
\n-#include "../far/topologyRefinerFactory.h"
\n-#include "../far/error.h"
\n+#include "../far/types.h"
\n #include <cassert>
\n+#include <cstring>
\n+#include <vector>
\n+#include <iostream>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n \n

\n Classes

struct  TopologyDescriptor
 A simple reference to raw topology data for use with TopologyRefinerFactory. More...
class  StencilReal< REAL >
 Vertex stencil descriptor. More...
 
struct  TopologyDescriptor::FVarChannel
class  Stencil
 Vertex stencil class wrapping the template for compatibility. More...
 
class  StencilTableReal< REAL >
 Table of subdivision stencils. More...
 
class  StencilTable
 Stencil table class wrapping the template for compatibility. More...
 
class  LimitStencilReal< REAL >
 Limit point stencil descriptor. More...
 
class  LimitStencil
 Limit point stencil class wrapping the template for compatibility. More...
 
class  LimitStencilTableReal< REAL >
 Table of limit subdivision stencils. More...
 
class  LimitStencilTable
 Limit stencil table class wrapping the template for compatibility. More...
 
\n \n \n \n \n@@ -123,13 +143,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,51 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyDescriptor.h File Reference\n+stencilTable.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \n+#include \n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-\u00a0 A simple reference to raw topology data for use with\n- _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Vertex stencil descriptor. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl\n+\u00a0 Vertex stencil class wrapping the template for compatibility. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Table of subdivision stencils. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table class wrapping the template for compatibility. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Limit point stencil descriptor. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+\u00a0 Limit point stencil class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Table of limit subdivision stencils. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 Limit stencil table class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,10 @@\n var a00713 = [\n- [\"TopologyDescriptor\", \"a01105.html\", \"a01105\"],\n- [\"FVarChannel\", \"a01109.html\", \"a01109\"]\n+ [\"StencilReal< REAL >\", \"a01053.html\", \"a01053\"],\n+ [\"Stencil\", \"a01057.html\", \"a01057\"],\n+ [\"StencilTableReal< REAL >\", \"a01061.html\", \"a01061\"],\n+ [\"StencilTable\", \"a01065.html\", \"a01065\"],\n+ [\"LimitStencilReal< REAL >\", \"a01069.html\", \"a01069\"],\n+ [\"LimitStencil\", \"a01073.html\", \"a01073\"],\n+ [\"LimitStencilTableReal< REAL >\", \"a01077.html\", \"a01077\"],\n+ [\"LimitStencilTable\", \"a01081.html\", \"a01081\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00713_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00713_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyDescriptor.h Source File\n+OpenSubdiv: opensubdiv/far/stencilTable.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
topologyDescriptor.h
\n+
stencilTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2014 DreamWorks Animation LLC.
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,146 +118,893 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n-
25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n-
26
\n-
27#include "../version.h"
\n-
28
\n-
29#include "../far/topologyRefiner.h"
\n-
30#include "../far/topologyRefinerFactory.h"
\n-
31#include "../far/error.h"
\n-
32
\n-
33#include <cassert>
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Far {
\n+
24
\n+
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_H
\n+
26#define OPENSUBDIV3_FAR_STENCILTABLE_H
\n+
27
\n+
28#include "../version.h"
\n+
29
\n+
30#include "../far/types.h"
\n+
31
\n+
32#include <cassert>
\n+
33#include <cstring>
\n+
34#include <vector>
\n+
35#include <iostream>
\n+
36
\n+
37namespace OpenSubdiv {
\n+
38namespace OPENSUBDIV_VERSION {
\n
39
\n-
\n-\n-
50
\n-\n-\n-
53
\n-
54 int const * numVertsPerFace;
\n-\n-
56
\n-\n-\n-
59 float const * creaseWeights;
\n-
60
\n-\n-\n-
63 float const * cornerWeights;
\n-
64
\n-\n-\n-
67
\n-\n+
40namespace Far {
\n+
41
\n+
42// Forward declarations for friends:
\n+
43class PatchTableBuilder;
\n+
44
\n+
45template <typename REAL> class StencilTableFactoryReal;
\n+
46template <typename REAL> class LimitStencilTableFactoryReal;
\n+
47
\n+
52template <typename REAL>
\n+
\n+\n+
54public:
\n+
55
\n+\n+
58
\n+
\n+
67 StencilReal(int * size, Index * indices, REAL * weights)
\n+
68 : _size(size), _indices(indices), _weights(weights) { }
\n+
\n
69
\n-
70 // Face-varying data channel -- value indices correspond to vertex indices,
\n-
71 // i.e. one for every vertex of every face:
\n-
72 //
\n-
\n-
73 struct FVarChannel {
\n-
74
\n-\n-\n-
77
\n-\n-
79 };
\n-
\n-
80
\n-\n-\n-
83
\n-\n-
85};
\n+
\n+
71 StencilReal(StencilReal const & other) {
\n+
72 _size = other._size;
\n+
73 _indices = other._indices;
\n+
74 _weights = other._weights;
\n+
75 }
\n+
\n+
76
\n+
\n+
78 int GetSize() const {
\n+
79 return *_size;
\n+
80 }
\n+
\n+
81
\n+
\n+
83 int * GetSizePtr() const {
\n+
84 return _size;
\n+
85 }
\n
\n
86
\n-
87
\n-
88//
\n-
89// Forward declarations of required TopologyRefinerFactory<TopologyDescriptor>
\n-
90// specializations (defined internally):
\n-
91//
\n-
92// @cond EXCLUDE_DOXYGEN
\n-
93
\n-
94template <>
\n-
95bool
\n-\n-
97 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n-
98
\n-
99template <>
\n-
100bool
\n-\n-
102 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n-
103
\n-
104template <>
\n-
105bool
\n-\n-
107 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
\n+
88 Index const * GetVertexIndices() const {
\n+
89 return _indices;
\n+
90 }
\n+
\n+
91
\n+
\n+
93 REAL const * GetWeights() const {
\n+
94 return _weights;
\n+
95 }
\n+
\n+
96
\n+
98 void Next() {
\n+
99 int stride = *_size;
\n+
100 ++_size;
\n+
101 _indices += stride;
\n+
102 _weights += stride;
\n+
103 }
\n+
104
\n+
105protected:
\n+
106 friend class StencilTableFactoryReal<REAL>;
\n+
107 friend class LimitStencilTableFactoryReal<REAL>;
\n
108
\n-
109template <>
\n-
110bool
\n-\n-
112 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
109 int * _size;
\n+\n+
111 REAL * _weights;
\n+
112};
\n+
\n
113
\n-
114template <>
\n-
115void
\n-\n-
117 TopologyError errCode, char const * msg, TopologyDescriptor const & desc);
\n-
118
\n-
119// @endcond
\n-
120
\n-
121} // end namespace Far
\n-
122
\n-
123} // end namespace OPENSUBDIV_VERSION
\n-
124using namespace OPENSUBDIV_VERSION;
\n-
125} // end namespace OpenSubdiv
\n+
\n+
116class Stencil : public StencilReal<float> {
\n+
117protected:
\n+\n+
119
\n+
120public:
\n+\n+
122 Stencil(BaseStencil const & other) : BaseStencil(other) { }
\n+
\n+
123 Stencil(int * size, Index * indices, float * weights)
\n+
124 : BaseStencil(size, indices, weights) { }
\n+
\n+
125};
\n+
\n
126
\n-
127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */
\n+
127
\n+
140template <typename REAL>
\n+
\n+\n+
142protected:
\n+
143 StencilTableReal(int numControlVerts,
\n+
144 std::vector<int> const& offsets,
\n+
145 std::vector<int> const& sizes,
\n+
146 std::vector<int> const& sources,
\n+
147 std::vector<REAL> const& weights,
\n+
148 bool includeCoarseVerts,
\n+
149 size_t firstOffset);
\n+
150
\n+
151public:
\n+
152
\n+
153 virtual ~StencilTableReal() {};
\n+
154
\n+
\n+
156 int GetNumStencils() const {
\n+
157 return (int)_sizes.size();
\n+
158 }
\n+
\n+
159
\n+
\n+\n+
162 return _numControlVertices;
\n+
163 }
\n+
\n+
164
\n+
\n+\n+
167
\n+
\n+
169 std::vector<int> const & GetSizes() const {
\n+
170 return _sizes;
\n+
171 }
\n+
\n+
172
\n+
\n+
174 std::vector<Index> const & GetOffsets() const {
\n+
175 return _offsets;
\n+
176 }
\n+
\n+
177
\n+
\n+
179 std::vector<Index> const & GetControlIndices() const {
\n+
180 return _indices;
\n+
181 }
\n+
\n+
182
\n+
\n+
184 std::vector<REAL> const & GetWeights() const {
\n+
185 return _weights;
\n+
186 }
\n+
\n+
187
\n+
\n+\n+
190
\n+
204 template <class T, class U>
\n+
\n+
205 void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-1) const {
\n+
206 this->update(srcValues, dstValues, _weights, start, end);
\n+
207 }
\n+
\n+
208
\n+
209 template <class T1, class T2, class U>
\n+
\n+
210 void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef,
\n+
211 U &dstValues, Index start=-1, Index end=-1) const {
\n+
212 this->update(srcBase, numBase, srcRef, dstValues, _weights, start, end);
\n+
213 }
\n+
\n+
214
\n+
215 // Pointer interface for backward compatibility
\n+
216 template <class T, class U>
\n+
\n+
217 void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const {
\n+
218 this->update(src, dst, _weights, start, end);
\n+
219 }
\n+
\n+
220 template <class T1, class T2, class U>
\n+
\n+
221 void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef,
\n+
222 U *dst, Index start=-1, Index end=-1) const {
\n+
223 this->update(srcBase, numBase, srcRef, dst, _weights, start, end);
\n+
224 }
\n+
\n+
225
\n+
227 void Clear();
\n+
228
\n+
229protected:
\n+
230
\n+
231 // Update values by applying cached stencil weights to new control values
\n+
232 template <class T, class U>
\n+
\n+
233 void update( T const &srcValues, U &dstValues,
\n+
234 std::vector<REAL> const & valueWeights, Index start, Index end) const;
\n+
235 template <class T1, class T2, class U>
\n+
\n+
236 void update( T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues,
\n+
237 std::vector<REAL> const & valueWeights, Index start, Index end) const;
\n+
238
\n+
239 // Populate the offsets table from the stencil sizes in _sizes (factory helper)
\n+
\n+\n+
241
\n+
242 // Resize the table arrays (factory helper)
\n+
\n+
243 void resize(int nstencils, int nelems);
\n+
244
\n+
245 // Reserves the table arrays (factory helper)
\n+
\n+
246 void reserve(int nstencils, int nelems);
\n+
247
\n+
248 // Reallocates the table arrays to remove excess capacity (factory helper)
\n+
\n+\n+
250
\n+
251 // Performs any final operations on internal tables (factory helper)
\n+
\n+
252 void finalize();
\n+
253
\n+
254protected:
\n+\n+
256 StencilTableReal(int numControlVerts)
\n+
257 : _numControlVertices(numControlVerts)
\n+
258 { }
\n+
259
\n+
260 friend class StencilTableFactoryReal<REAL>;
\n+\n+
262
\n+
263 int _numControlVertices; // number of control vertices
\n+
264
\n+
265 std::vector<int> _sizes; // number of coefficients for each stencil
\n+
266 std::vector<Index> _offsets, // offset to the start of each stencil
\n+
267 _indices; // indices of contributing coarse vertices
\n+
268 std::vector<REAL> _weights; // stencil weight coefficients
\n+
269};
\n+
270
\n+
\n+
273class StencilTable : public StencilTableReal<float> {
\n+
274protected:
\n+\n+
276
\n+
277public:
\n+
\n+
278 Stencil GetStencil(Index index) const {
\n+
279 return Stencil(BaseTable::GetStencil(index));
\n+
280 }
\n+
\n+
\n+
281 Stencil operator[] (Index index) const {
\n+
282 return Stencil(BaseTable::GetStencil(index));
\n+
283 }
\n+
\n+
284
\n+
285protected:
\n+\n+
287 StencilTable(int numControlVerts) : BaseTable(numControlVerts) { }
\n+
\n+
288 StencilTable(int numControlVerts,
\n+
289 std::vector<int> const& offsets,
\n+
290 std::vector<int> const& sizes,
\n+
291 std::vector<int> const& sources,
\n+
292 std::vector<float> const& weights,
\n+
293 bool includeCoarseVerts,
\n+
294 size_t firstOffset)
\n+
295 : BaseTable(numControlVerts, offsets,
\n+
296 sizes, sources, weights, includeCoarseVerts, firstOffset) { }
\n+
\n+
297};
\n+
\n+
298
\n+
299
\n+
302template <typename REAL>
\n+
\n+
303class LimitStencilReal : public StencilReal<REAL> {
\n+
304public:
\n+
305
\n+
\n+\n+
325 Index * indices,
\n+
326 REAL * weights,
\n+
327 REAL * duWeights=0,
\n+
328 REAL * dvWeights=0,
\n+
329 REAL * duuWeights=0,
\n+
330 REAL * duvWeights=0,
\n+
331 REAL * dvvWeights=0)
\n+
332 : StencilReal<REAL>(size, indices, weights),
\n+
333 _duWeights(duWeights),
\n+
334 _dvWeights(dvWeights),
\n+
335 _duuWeights(duuWeights),
\n+
336 _duvWeights(duvWeights),
\n+
337 _dvvWeights(dvvWeights) {
\n+
338 }
\n+
\n+
339
\n+
\n+
341 REAL const * GetDuWeights() const {
\n+
342 return _duWeights;
\n+
343 }
\n+
\n+
344
\n+
\n+
346 REAL const * GetDvWeights() const {
\n+
347 return _dvWeights;
\n+
348 }
\n+
\n+
349
\n+
\n+
351 REAL const * GetDuuWeights() const {
\n+
352 return _duuWeights;
\n+
353 }
\n+
\n+
354
\n+
\n+
356 REAL const * GetDuvWeights() const {
\n+
357 return _duvWeights;
\n+
358 }
\n+
\n+
359
\n+
\n+
361 REAL const * GetDvvWeights() const {
\n+
362 return _dvvWeights;
\n+
363 }
\n+
\n+
364
\n+
366 void Next() {
\n+
367 int stride = *this->_size;
\n+
368 ++this->_size;
\n+
369 this->_indices += stride;
\n+
370 this->_weights += stride;
\n+
371 if (_duWeights) _duWeights += stride;
\n+
372 if (_dvWeights) _dvWeights += stride;
\n+
373 if (_duuWeights) _duuWeights += stride;
\n+
374 if (_duvWeights) _duvWeights += stride;
\n+
375 if (_dvvWeights) _dvvWeights += stride;
\n+
376 }
\n+
377
\n+
378private:
\n+
379
\n+
380 friend class StencilTableFactoryReal<REAL>;
\n+
381 friend class LimitStencilTableFactoryReal<REAL>;
\n+
382
\n+
383 REAL * _duWeights, // pointer to stencil u derivative limit weights
\n+
384 * _dvWeights, // pointer to stencil v derivative limit weights
\n+
385 * _duuWeights, // pointer to stencil uu derivative limit weights
\n+
386 * _duvWeights, // pointer to stencil uv derivative limit weights
\n+
387 * _dvvWeights; // pointer to stencil vv derivative limit weights
\n+
388};
\n+
\n+
389
\n+
\n+
392class LimitStencil : public LimitStencilReal<float> {
\n+
393protected:
\n+\n+
395
\n+
396public:
\n+
397 LimitStencil(BaseStencil const & other) : BaseStencil(other) { }
\n+
\n+
398 LimitStencil(int* size, Index * indices, float * weights,
\n+
399 float * duWeights=0, float * dvWeights=0,
\n+
400 float * duuWeights=0, float * duvWeights=0, float * dvvWeights=0)
\n+
401 : BaseStencil(size, indices, weights,
\n+
402 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights) { }
\n+
\n+
403};
\n+
\n+
404
\n+
405
\n+
408template <typename REAL>
\n+
\n+\n+
410protected:
\n+\n+
412 int numControlVerts,
\n+
413 std::vector<int> const& offsets,
\n+
414 std::vector<int> const& sizes,
\n+
415 std::vector<int> const& sources,
\n+
416 std::vector<REAL> const& weights,
\n+
417 std::vector<REAL> const& duWeights,
\n+
418 std::vector<REAL> const& dvWeights,
\n+
419 std::vector<REAL> const& duuWeights,
\n+
420 std::vector<REAL> const& duvWeights,
\n+
421 std::vector<REAL> const& dvvWeights,
\n+
422 bool includeCoarseVerts,
\n+
423 size_t firstOffset);
\n+
424
\n+
425public:
\n+
426
\n+
\n+\n+
429
\n+
\n+\n+
432
\n+
\n+
434 std::vector<REAL> const & GetDuWeights() const {
\n+
435 return _duWeights;
\n+
436 }
\n+
\n+
437
\n+
\n+
439 std::vector<REAL> const & GetDvWeights() const {
\n+
440 return _dvWeights;
\n+
441 }
\n+
\n+
442
\n+
\n+
444 std::vector<REAL> const & GetDuuWeights() const {
\n+
445 return _duuWeights;
\n+
446 }
\n+
\n+
447
\n+
\n+
449 std::vector<REAL> const & GetDuvWeights() const {
\n+
450 return _duvWeights;
\n+
451 }
\n+
\n+
452
\n+
\n+
454 std::vector<REAL> const & GetDvvWeights() const {
\n+
455 return _dvvWeights;
\n+
456 }
\n+
\n+
457
\n+
475 template <class T, class U>
\n+
\n+
476 void UpdateDerivs(T const & srcValues, U & uderivs, U & vderivs,
\n+
477 int start=-1, int end=-1) const {
\n+
478
\n+
479 this->update(srcValues, uderivs, _duWeights, start, end);
\n+
480 this->update(srcValues, vderivs, _dvWeights, start, end);
\n+
481 }
\n+
\n+
482
\n+
483 template <class T1, class T2, class U>
\n+
\n+
484 void UpdateDerivs(T1 const & srcBase, int numBase, T2 const & srcRef,
\n+
485 U & uderivs, U & vderivs, int start=-1, int end=-1) const {
\n+
486
\n+
487 this->update(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);
\n+
488 this->update(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);
\n+
489 }
\n+
\n+
490
\n+
491 // Pointer interface for backward compatibility
\n+
492 template <class T, class U>
\n+
\n+
493 void UpdateDerivs(T const *src, U *uderivs, U *vderivs,
\n+
494 int start=-1, int end=-1) const {
\n+
495
\n+
496 this->update(src, uderivs, _duWeights, start, end);
\n+
497 this->update(src, vderivs, _dvWeights, start, end);
\n+
498 }
\n+
\n+
499 template <class T1, class T2, class U>
\n+
\n+
500 void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef,
\n+
501 U *uderivs, U *vderivs, int start=-1, int end=-1) const {
\n+
502
\n+
503 this->update(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);
\n+
504 this->update(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);
\n+
505 }
\n+
\n+
506
\n+
527 template <class T, class U>
\n+
\n+
528 void Update2ndDerivs(T const & srcValues,
\n+
529 U & uuderivs, U & uvderivs, U & vvderivs,
\n+
530 int start=-1, int end=-1) const {
\n+
531
\n+
532 this->update(srcValues, uuderivs, _duuWeights, start, end);
\n+
533 this->update(srcValues, uvderivs, _duvWeights, start, end);
\n+
534 this->update(srcValues, vvderivs, _dvvWeights, start, end);
\n+
535 }
\n+
\n+
536
\n+
537 template <class T1, class T2, class U>
\n+
\n+
538 void Update2ndDerivs(T1 const & srcBase, int numBase, T2 const & srcRef,
\n+
539 U & uuderivs, U & uvderivs, U & vvderivs, int start=-1, int end=-1) const {
\n+
540
\n+
541 this->update(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);
\n+
542 this->update(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);
\n+
543 this->update(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);
\n+
544 }
\n+
\n+
545
\n+
546 // Pointer interface for backward compatibility
\n+
547 template <class T, class U>
\n+
\n+
548 void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs,
\n+
549 int start=-1, int end=-1) const {
\n+
550
\n+
551 this->update(src, uuderivs, _duuWeights, start, end);
\n+
552 this->update(src, uvderivs, _duvWeights, start, end);
\n+
553 this->update(src, vvderivs, _dvvWeights, start, end);
\n+
554 }
\n+
\n+
555 template <class T1, class T2, class U>
\n+
\n+
556 void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef,
\n+
557 U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const {
\n+
558
\n+
559 this->update(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);
\n+
560 this->update(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);
\n+
561 this->update(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);
\n+
562 }
\n+
\n+
563
\n+
565 void Clear();
\n+
566
\n+
567private:
\n+
568 friend class LimitStencilTableFactoryReal<REAL>;
\n+
569
\n+
570 // Resize the table arrays (factory helper)
\n+
571 void resize(int nstencils, int nelems);
\n+
572
\n+
573private:
\n+
574 std::vector<REAL> _duWeights, // u derivative limit stencil weights
\n+
575 _dvWeights, // v derivative limit stencil weights
\n+
576 _duuWeights, // uu derivative limit stencil weights
\n+
577 _duvWeights, // uv derivative limit stencil weights
\n+
578 _dvvWeights; // vv derivative limit stencil weights
\n+
579};
\n+
580
\n+
\n+\n+
584protected:
\n+\n+
586
\n+
587public:
\n+
\n+\n+\n+
590 }
\n+
\n+
\n+\n+\n+
593 }
\n+
\n+
594
\n+
595protected:
\n+
\n+
596 LimitStencilTable(int numControlVerts,
\n+
597 std::vector<int> const& offsets,
\n+
598 std::vector<int> const& sizes,
\n+
599 std::vector<int> const& sources,
\n+
600 std::vector<float> const& weights,
\n+
601 std::vector<float> const& duWeights,
\n+
602 std::vector<float> const& dvWeights,
\n+
603 std::vector<float> const& duuWeights,
\n+
604 std::vector<float> const& duvWeights,
\n+
605 std::vector<float> const& dvvWeights,
\n+
606 bool includeCoarseVerts,
\n+
607 size_t firstOffset)
\n+
608 : BaseTable(numControlVerts,
\n+
609 offsets, sizes, sources, weights,
\n+
610 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights,
\n+
611 includeCoarseVerts, firstOffset) { }
\n+
\n+
612};
\n+
\n+
613
\n+
614
\n+
615// Update values by applying cached stencil weights to new control values
\n+
616template <typename REAL>
\n+
617template <class T1, class T2, class U> void
\n+
\n+
618StencilTableReal<REAL>::update(T1 const &srcBase, int numBase,
\n+
619 T2 const &srcRef, U &dstValues,
\n+
620 std::vector<REAL> const &valueWeights, Index start, Index end) const {
\n+
621
\n+
622 int const * sizes = &_sizes.at(0);
\n+
623 Index const * indices = &_indices.at(0);
\n+
624 REAL const * weights = &valueWeights.at(0);
\n+
625
\n+
626 if (start > 0) {
\n+
627 assert(start < (Index)_offsets.size());
\n+
628 sizes += start;
\n+
629 indices += _offsets[start];
\n+
630 weights += _offsets[start];
\n+
631 } else {
\n+
632 start = 0;
\n+
633 }
\n+
634
\n+
635 int nstencils = ((end < start) ? GetNumStencils() : end) - start;
\n+
636
\n+
637 for (int i = 0; i < nstencils; ++i, ++sizes) {
\n+
638 dstValues[start + i].Clear();
\n+
639 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {
\n+
640 if (*indices < numBase) {
\n+
641 dstValues[start + i].AddWithWeight(srcBase[*indices], *weights);
\n+
642 } else {
\n+
643 dstValues[start + i].AddWithWeight(srcRef[*indices - numBase], *weights);
\n+
644 }
\n+
645 }
\n+
646 }
\n+
647}
\n+
\n+
648template <typename REAL>
\n+
649template <class T, class U> void
\n+
\n+
650StencilTableReal<REAL>::update(T const &srcValues, U &dstValues,
\n+
651 std::vector<REAL> const &valueWeights, Index start, Index end) const {
\n+
652
\n+
653 int const * sizes = &_sizes.at(0);
\n+
654 Index const * indices = &_indices.at(0);
\n+
655 REAL const * weights = &valueWeights.at(0);
\n+
656
\n+
657 if (start > 0) {
\n+
658 assert(start < (Index)_offsets.size());
\n+
659 sizes += start;
\n+
660 indices += _offsets[start];
\n+
661 weights += _offsets[start];
\n+
662 } else {
\n+
663 start = 0;
\n+
664 }
\n+
665
\n+
666 int nstencils = ((end < start) ? GetNumStencils() : end) - start;
\n+
667
\n+
668 for (int i = 0; i < nstencils; ++i, ++sizes) {
\n+
669 dstValues[start + i].Clear();
\n+
670 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {
\n+
671 dstValues[start + i].AddWithWeight(srcValues[*indices], *weights);
\n+
672 }
\n+
673 }
\n+
674}
\n+
\n+
675
\n+
676template <typename REAL>
\n+
677inline void
\n+
\n+\n+
679 Index offset=0;
\n+
680 int noffsets = (int)_sizes.size();
\n+
681 _offsets.resize(noffsets);
\n+
682 for (int i=0; i<(int)_sizes.size(); ++i ) {
\n+
683 _offsets[i]=offset;
\n+
684 offset+=_sizes[i];
\n+
685 }
\n+
686}
\n+
\n+
687
\n+
688template <typename REAL>
\n+
689inline void
\n+
\n+
690StencilTableReal<REAL>::resize(int nstencils, int nelems) {
\n+
691 _sizes.resize(nstencils);
\n+
692 _indices.resize(nelems);
\n+
693 _weights.resize(nelems);
\n+
694}
\n+
\n+
695
\n+
696template <typename REAL>
\n+
697inline void
\n+
\n+
698StencilTableReal<REAL>::reserve(int nstencils, int nelems) {
\n+
699 _sizes.reserve(nstencils);
\n+
700 _indices.reserve(nelems);
\n+
701 _weights.reserve(nelems);
\n+
702}
\n+
\n+
703
\n+
704template <typename REAL>
\n+
705inline void
\n+
\n+\n+
707 std::vector<int>(_sizes).swap(_sizes);
\n+
708 std::vector<Index>(_indices).swap(_indices);
\n+
709 std::vector<REAL>(_weights).swap(_weights);
\n+
710}
\n+
\n+
711
\n+
712template <typename REAL>
\n+
713inline void
\n+
\n+\n+
715 shrinkToFit();
\n+
716 generateOffsets();
\n+
717}
\n+
\n+
718
\n+
719// Returns a Stencil at index i in the table
\n+
720template <typename REAL>
\n+\n+
\n+\n+
723 assert((! _offsets.empty()) && i<(int)_offsets.size());
\n+
724
\n+
725 Index ofs = _offsets[i];
\n+
726
\n+
727 return StencilReal<REAL>(const_cast<int*>(&_sizes[i]),
\n+
728 const_cast<Index*>(&_indices[ofs]),
\n+
729 const_cast<REAL*>(&_weights[ofs]));
\n+
730}
\n+
\n+
731
\n+
732template <typename REAL>
\n+\n+
\n+\n+
735 return GetStencil(index);
\n+
736}
\n+
\n+
737
\n+
738template <typename REAL>
\n+
739inline void
\n+
740LimitStencilTableReal<REAL>::resize(int nstencils, int nelems) {
\n+
741 StencilTableReal<REAL>::resize(nstencils, nelems);
\n+
742 _duWeights.resize(nelems);
\n+
743 _dvWeights.resize(nelems);
\n+
744}
\n+
745
\n+
746// Returns a LimitStencil at index i in the table
\n+
747template <typename REAL>
\n+
748inline LimitStencilReal<REAL>
\n+
\n+\n+
750 assert((! this->GetOffsets().empty()) && i<(int)this->GetOffsets().size());
\n+
751
\n+
752 Index ofs = this->GetOffsets()[i];
\n+
753
\n+
754 if (!_duWeights.empty() && !_dvWeights.empty() &&
\n+
755 !_duuWeights.empty() && !_duvWeights.empty() && !_dvvWeights.empty()) {
\n+\n+
757 const_cast<int *>(&this->GetSizes()[i]),
\n+
758 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n+
759 const_cast<REAL *>(&this->GetWeights()[ofs]),
\n+
760 const_cast<REAL *>(&GetDuWeights()[ofs]),
\n+
761 const_cast<REAL *>(&GetDvWeights()[ofs]),
\n+
762 const_cast<REAL *>(&GetDuuWeights()[ofs]),
\n+
763 const_cast<REAL *>(&GetDuvWeights()[ofs]),
\n+
764 const_cast<REAL *>(&GetDvvWeights()[ofs]) );
\n+
765 } else if (!_duWeights.empty() && !_dvWeights.empty()) {
\n+\n+
767 const_cast<int *>(&this->GetSizes()[i]),
\n+
768 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n+
769 const_cast<REAL *>(&this->GetWeights()[ofs]),
\n+
770 const_cast<REAL *>(&GetDuWeights()[ofs]),
\n+
771 const_cast<REAL *>(&GetDvWeights()[ofs]) );
\n+
772 } else {
\n+\n+
774 const_cast<int *>(&this->GetSizes()[i]),
\n+
775 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n+
776 const_cast<REAL *>(&this->GetWeights()[ofs]) );
\n+
777 }
\n+
778}
\n+
\n+
779
\n+
780template <typename REAL>
\n+\n+
\n+\n+
783 return GetLimitStencil(index);
\n+
784}
\n+
\n+
\n+
785
\n+
786} // end namespace Far
\n+
787
\n+
788} // end namespace OPENSUBDIV_VERSION
\n+
789using namespace OPENSUBDIV_VERSION;
\n+
790
\n+
791} // end namespace OpenSubdiv
\n+
792
\n+
793#endif // OPENSUBDIV3_FAR_STENCILTABLE_H
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n \n \n-
A simple reference to raw topology data for use with TopologyRefinerFactory.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces,...
\n-
static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH const &mesh)
(Optional) Control run-time topology validation and error reporting
\n-
static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify edge or vertex sharpness or face holes
\n-
static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the number of vertices, faces, face-vertices, etc.
\n-
static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify face-varying data per face
\n-
Stores topology data for a specified set of refinement options.
\n+\n+\n+\n+\n+\n+
StencilReal(int *size, Index *indices, REAL *weights)
Constructor.
\n+
void Next()
Advance to the next stencil in the table.
\n+
StencilReal(StencilReal const &other)
Copy constructor.
\n+\n+
Index const * GetVertexIndices() const
Returns the control vertices' indices.
\n+
int GetSize() const
Returns the size of the stencil.
\n+\n+
int * GetSizePtr() const
Returns the size of the stencil as a pointer.
\n+
REAL const * GetWeights() const
Returns the interpolation weights.
\n+
Vertex stencil class wrapping the template for compatibility.
\n+\n+
Stencil(int *size, Index *indices, float *weights)
\n+\n+\n+\n+
int GetNumControlVertices() const
Returns the number of control vertices indexed in the table.
\n+\n+\n+
void update(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues, std::vector< REAL > const &valueWeights, Index start, Index end) const
\n+
void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues, Index start=-1, Index end=-1) const
\n+
std::vector< Index > const & GetControlIndices() const
Returns the indices of the control vertices.
\n+\n+
StencilReal< REAL > operator[](Index index) const
Returns the stencil at index i in the table.
\n+\n+
void update(T const &srcValues, U &dstValues, std::vector< REAL > const &valueWeights, Index start, Index end) const
\n+
std::vector< int > const & GetSizes() const
Returns the number of control vertices of each stencil in the table.
\n+
int GetNumStencils() const
Returns the number of stencils in the table.
\n+\n+
std::vector< Index > const & GetOffsets() const
Returns the offset to a given stencil (factory may leave empty)
\n+
StencilReal< REAL > GetStencil(Index i) const
Returns a Stencil at index i in the table.
\n+\n+\n+
void Clear()
Clears the stencils from the table.
\n+\n+\n+\n+
std::vector< REAL > const & GetWeights() const
Returns the stencil interpolation weights.
\n+
void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef, U *dst, Index start=-1, Index end=-1) const
\n+
StencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< REAL > const &weights, bool includeCoarseVerts, size_t firstOffset)
\n+\n+\n+\n+
void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const
\n+
void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-1) const
Updates point values based on the control values.
\n+
Stencil table class wrapping the template for compatibility.
\n+
StencilTable(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< float > const &weights, bool includeCoarseVerts, size_t firstOffset)
\n+\n+\n+\n+\n+\n+\n+
REAL const * GetDuvWeights() const
Returns the uv derivative weights.
\n+
REAL const * GetDvWeights() const
Returns the v derivative weights.
\n+
void Next()
Advance to the next stencil in the table.
\n+
REAL const * GetDvvWeights() const
Returns the vv derivative weights.
\n+
LimitStencilReal(int *size, Index *indices, REAL *weights, REAL *duWeights=0, REAL *dvWeights=0, REAL *duuWeights=0, REAL *duvWeights=0, REAL *dvvWeights=0)
Constructor.
\n+
REAL const * GetDuWeights() const
Returns the u derivative weights.
\n+
REAL const * GetDuuWeights() const
Returns the uu derivative weights.
\n+
Limit point stencil class wrapping the template for compatibility.
\n+\n+\n+
LimitStencil(int *size, Index *indices, float *weights, float *duWeights=0, float *dvWeights=0, float *duuWeights=0, float *duvWeights=0, float *dvvWeights=0)
\n+\n+
std::vector< REAL > const & GetDuuWeights() const
Returns the 'uu' derivative stencil interpolation weights.
\n+
LimitStencilReal< REAL > operator[](Index index) const
Returns the limit stencil at index i in the table.
\n+
std::vector< REAL > const & GetDvvWeights() const
Returns the 'vv' derivative stencil interpolation weights.
\n+
void UpdateDerivs(T const *src, U *uderivs, U *vderivs, int start=-1, int end=-1) const
\n+
void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const
\n+
std::vector< REAL > const & GetDvWeights() const
Returns the 'v' derivative stencil interpolation weights.
\n+
void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const
\n+
void UpdateDerivs(T const &srcValues, U &uderivs, U &vderivs, int start=-1, int end=-1) const
Updates derivative values based on the control values.
\n+
LimitStencilReal< REAL > GetLimitStencil(Index i) const
Returns a LimitStencil at index i in the table.
\n+
LimitStencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< REAL > const &weights, std::vector< REAL > const &duWeights, std::vector< REAL > const &dvWeights, std::vector< REAL > const &duuWeights, std::vector< REAL > const &duvWeights, std::vector< REAL > const &dvvWeights, bool includeCoarseVerts, size_t firstOffset)
\n+
void Update2ndDerivs(T const &srcValues, U &uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const
Updates 2nd derivative values based on the control values.
\n+
std::vector< REAL > const & GetDuWeights() const
Returns the 'u' derivative stencil interpolation weights.
\n+
void Clear()
Clears the stencils from the table.
\n+
void Update2ndDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const
\n+
std::vector< REAL > const & GetDuvWeights() const
Returns the 'uv' derivative stencil interpolation weights.
\n+
void UpdateDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uderivs, U &vderivs, int start=-1, int end=-1) const
\n+
void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uderivs, U *vderivs, int start=-1, int end=-1) const
\n+
Limit stencil table class wrapping the template for compatibility.
\n+\n+\n+
LimitStencilTable(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< float > const &weights, std::vector< float > const &duWeights, std::vector< float > const &dvWeights, std::vector< float > const &duuWeights, std::vector< float > const &duvWeights, std::vector< float > const &dvvWeights, bool includeCoarseVerts, size_t firstOffset)
\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-topologyDescriptor.h\n+stencilTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2014 DreamWorks Animation LLC.\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,208 +23,991 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n-25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n-26\n-27#include \"../version.h\"\n-28\n-29#include \"../far/topologyRefiner.h\"\n-30#include \"../far/topologyRefinerFactory.h\"\n-31#include \"../far/error.h\"\n-32\n-33#include \n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Far {\n+24\n+25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_H\n+26#define OPENSUBDIV3_FAR_STENCILTABLE_H\n+27\n+28#include \"../version.h\"\n+29\n+30#include \"../far/types.h\"\n+31\n+32#include \n+33#include \n+34#include \n+35#include \n+36\n+37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+38namespace OPENSUBDIV_VERSION {\n 39\n-_\b4_\b9struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n-50\n-_\b5_\b1 int _\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs,\n-_\b5_\b2 _\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs;\n-53\n-_\b5_\b4 int const * _\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n-_\b5_\b5 _\bI_\bn_\bd_\be_\bx const * _\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n-56\n-_\b5_\b7 int _\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs;\n-_\b5_\b8 _\bI_\bn_\bd_\be_\bx const * _\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs;\n-_\b5_\b9 float const * _\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n-60\n-_\b6_\b1 int _\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs;\n-_\b6_\b2 _\bI_\bn_\bd_\be_\bx const * _\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-_\b6_\b3 float const * _\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n-64\n-_\b6_\b5 int _\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs;\n-_\b6_\b6 _\bI_\bn_\bd_\be_\bx const * _\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-67\n-_\b6_\b8 bool _\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd;\n+40namespace Far {\n+41\n+42// Forward declarations for friends:\n+43class PatchTableBuilder;\n+44\n+45template class StencilTableFactoryReal;\n+46template class LimitStencilTableFactoryReal;\n+47\n+52template \n+_\b5_\b3class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n+54public:\n+55\n+_\b5_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl() {}\n+58\n+_\b6_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(int * size, _\bI_\bn_\bd_\be_\bx * indices, REAL * weights)\n+68 : _\b__\bs_\bi_\bz_\be(size), _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs(indices), _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs(weights) { }\n 69\n-70 // Face-varying data channel -- value indices correspond to vertex indices,\n-71 // i.e. one for every vertex of every face:\n-72 //\n-_\b7_\b3 struct _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl {\n-74\n-_\b7_\b5 int _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs;\n-_\b7_\b6 _\bI_\bn_\bd_\be_\bx const * _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-77\n-_\b7_\b8 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl() : _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs(0), _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(0) { }\n-79 };\n-80\n-_\b8_\b1 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-_\b8_\b2 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-83\n-_\b8_\b4 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br();\n-85};\n+_\b7_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl const & other) {\n+72 _\b__\bs_\bi_\bz_\be = other._\b__\bs_\bi_\bz_\be;\n+73 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs = other._\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n+74 _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs = other._\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n+75 }\n+76\n+_\b7_\b8 int _\bG_\be_\bt_\bS_\bi_\bz_\be() const {\n+79 return *_\b__\bs_\bi_\bz_\be;\n+80 }\n+81\n+_\b8_\b3 int * _\bG_\be_\bt_\bS_\bi_\bz_\be_\bP_\bt_\br() const {\n+84 return _\b__\bs_\bi_\bz_\be;\n+85 }\n 86\n-87\n-88//\n-89// Forward declarations of required\n-TopologyRefinerFactory\n-90// specializations (defined internally):\n-91//\n-92// @cond EXCLUDE_DOXYGEN\n-93\n-94template <>\n-95bool\n-96_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-97 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-98\n-99template <>\n-100bool\n-101_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-102 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-103\n-104template <>\n-105bool\n-106_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(\n-107 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+_\b8_\b8 _\bI_\bn_\bd_\be_\bx const * _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const {\n+89 return _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n+90 }\n+91\n+_\b9_\b3 REAL const * _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+94 return _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n+95 }\n+96\n+_\b9_\b8 void _\bN_\be_\bx_\bt() {\n+99 int stride = *_\b__\bs_\bi_\bz_\be;\n+100 ++_\b__\bs_\bi_\bz_\be;\n+101 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs += stride;\n+102 _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs += stride;\n+103 }\n+104\n+105protected:\n+106 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n+107 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n 108\n-109template <>\n-110bool\n-111_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-112 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+_\b1_\b0_\b9 int * _\b__\bs_\bi_\bz_\be;\n+_\b1_\b1_\b0 _\bI_\bn_\bd_\be_\bx * _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n+_\b1_\b1_\b1 REAL * _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n+112};\n 113\n-114template <>\n-115void\n-116_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n-117 TopologyError errCode, char const * msg, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n-118\n-119// @endcond\n-120\n-121} // end namespace Far\n-122\n-123} // end namespace OPENSUBDIV_VERSION\n-124using namespace OPENSUBDIV_VERSION;\n-125} // end namespace OpenSubdiv\n+_\b1_\b1_\b6class _\bS_\bt_\be_\bn_\bc_\bi_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n+117protected:\n+_\b1_\b1_\b8 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl;\n+119\n+120public:\n+_\b1_\b2_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl() : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl() { }\n+_\b1_\b2_\b2 _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl const & other) : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(other) { }\n+_\b1_\b2_\b3 _\bS_\bt_\be_\bn_\bc_\bi_\bl(int * size, _\bI_\bn_\bd_\be_\bx * indices, float * weights)\n+124 : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(size, indices, weights) { }\n+125};\n 126\n-127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */\n+127\n+140template \n+_\b1_\b4_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n+142protected:\n+_\b1_\b4_\b3 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(int numControlVerts,\n+144 std::vector const& offsets,\n+145 std::vector const& sizes,\n+146 std::vector const& sources,\n+147 std::vector const& weights,\n+148 bool includeCoarseVerts,\n+149 size_t firstOffset);\n+150\n+151public:\n+152\n+_\b1_\b5_\b3 virtual _\b~_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl() {};\n+154\n+_\b1_\b5_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const {\n+157 return (int)_\b__\bs_\bi_\bz_\be_\bs.size();\n+158 }\n+159\n+_\b1_\b6_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n+162 return _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs;\n+163 }\n+164\n+_\b1_\b6_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const;\n+167\n+_\b1_\b6_\b9 std::vector const & _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs() const {\n+170 return _\b__\bs_\bi_\bz_\be_\bs;\n+171 }\n+172\n+_\b1_\b7_\b4 std::vector const & _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs() const {\n+175 return _\b__\bo_\bf_\bf_\bs_\be_\bt_\bs;\n+176 }\n+177\n+_\b1_\b7_\b9 std::vector const & _\bG_\be_\bt_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs() const {\n+180 return _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n+181 }\n+182\n+_\b1_\b8_\b4 std::vector const & _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+185 return _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n+186 }\n+187\n+_\b1_\b8_\b9 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const;\n+190\n+204 template \n+_\b2_\b0_\b5 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T const &srcValues, U &dstValues, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx\n+end=-1) const {\n+206 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, dstValues, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n+207 }\n+208\n+209 template \n+_\b2_\b1_\b0 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T1 const &srcBase, int numBase, T2 const &srcRef,\n+211 U &dstValues, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const {\n+212 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, dstValues, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n+213 }\n+214\n+215 // Pointer interface for backward compatibility\n+216 template \n+_\b2_\b1_\b7 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T const *src, U *dst, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const\n+{\n+218 this->_\bu_\bp_\bd_\ba_\bt_\be(src, dst, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n+219 }\n+220 template \n+_\b2_\b2_\b1 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n+222 U *dst, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const {\n+223 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, dst, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n+224 }\n+225\n+_\b2_\b2_\b7 void _\bC_\bl_\be_\ba_\br();\n+228\n+229protected:\n+230\n+231 // Update values by applying cached stencil weights to new control values\n+232 template \n+_\b2_\b3_\b3 void _\bu_\bp_\bd_\ba_\bt_\be( T const &srcValues, U &dstValues,\n+234 std::vector const & valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const;\n+235 template \n+_\b2_\b3_\b6 void _\bu_\bp_\bd_\ba_\bt_\be( T1 const &srcBase, int numBase, T2 const &srcRef, U\n+&dstValues,\n+237 std::vector const & valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const;\n+238\n+239 // Populate the offsets table from the stencil sizes in _sizes (factory\n+helper)\n+_\b2_\b4_\b0 void _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs();\n+241\n+242 // Resize the table arrays (factory helper)\n+_\b2_\b4_\b3 void _\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems);\n+244\n+245 // Reserves the table arrays (factory helper)\n+_\b2_\b4_\b6 void _\br_\be_\bs_\be_\br_\bv_\be(int nstencils, int nelems);\n+247\n+248 // Reallocates the table arrays to remove excess capacity (factory helper)\n+_\b2_\b4_\b9 void _\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt();\n+250\n+251 // Performs any final operations on internal tables (factory helper)\n+_\b2_\b5_\b2 void _\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be();\n+253\n+254protected:\n+_\b2_\b5_\b5 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl() : _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(0) {}\n+_\b2_\b5_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(int numControlVerts)\n+257 : _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(numControlVerts)\n+258 { }\n+259\n+260 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n+_\b2_\b6_\b1 friend class _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br;\n+262\n+_\b2_\b6_\b3 int _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs; // number of control vertices\n+264\n+_\b2_\b6_\b5 std::vector _\b__\bs_\bi_\bz_\be_\bs; // number of coefficients for each stencil\n+_\b2_\b6_\b6 std::vector _\b__\bo_\bf_\bf_\bs_\be_\bt_\bs, // offset to the start of each stencil\n+_\b2_\b6_\b7 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs; // indices of contributing coarse vertices\n+_\b2_\b6_\b8 std::vector _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs; // stencil weight coefficients\n+269};\n+270\n+_\b2_\b7_\b3class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n+274protected:\n+_\b2_\b7_\b5 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+276\n+277public:\n+_\b2_\b7_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl _\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx index) const {\n+279 return _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n+280 }\n+_\b2_\b8_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n+282 return _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n+283 }\n+284\n+285protected:\n+_\b2_\b8_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be() { }\n+_\b2_\b8_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts) : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts) { }\n+_\b2_\b8_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts,\n+289 std::vector const& offsets,\n+290 std::vector const& sizes,\n+291 std::vector const& sources,\n+292 std::vector const& weights,\n+293 bool includeCoarseVerts,\n+294 size_t firstOffset)\n+295 : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts, offsets,\n+296 sizes, sources, weights, includeCoarseVerts, firstOffset) { }\n+297};\n+298\n+299\n+302template \n+_\b3_\b0_\b3class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n+304public:\n+305\n+_\b3_\b2_\b4 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl( int* size,\n+325 _\bI_\bn_\bd_\be_\bx * indices,\n+326 REAL * weights,\n+327 REAL * duWeights=0,\n+328 REAL * dvWeights=0,\n+329 REAL * duuWeights=0,\n+330 REAL * duvWeights=0,\n+331 REAL * dvvWeights=0)\n+332 : _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(size, indices, weights),\n+333 _duWeights(duWeights),\n+334 _dvWeights(dvWeights),\n+335 _duuWeights(duuWeights),\n+336 _duvWeights(duvWeights),\n+337 _dvvWeights(dvvWeights) {\n+338 }\n+339\n+_\b3_\b4_\b1 REAL const * _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+342 return _duWeights;\n+343 }\n+344\n+_\b3_\b4_\b6 REAL const * _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+347 return _dvWeights;\n+348 }\n+349\n+_\b3_\b5_\b1 REAL const * _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+352 return _duuWeights;\n+353 }\n+354\n+_\b3_\b5_\b6 REAL const * _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+357 return _duvWeights;\n+358 }\n+359\n+_\b3_\b6_\b1 REAL const * _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+362 return _dvvWeights;\n+363 }\n+364\n+_\b3_\b6_\b6 void _\bN_\be_\bx_\bt() {\n+367 int stride = *this->_\b__\bs_\bi_\bz_\be;\n+368 ++this->_\b__\bs_\bi_\bz_\be;\n+369 this->_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs += stride;\n+370 this->_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs += stride;\n+371 if (_duWeights) _duWeights += stride;\n+372 if (_dvWeights) _dvWeights += stride;\n+373 if (_duuWeights) _duuWeights += stride;\n+374 if (_duvWeights) _duvWeights += stride;\n+375 if (_dvvWeights) _dvvWeights += stride;\n+376 }\n+377\n+378private:\n+379\n+380 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n+381 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n+382\n+383 REAL * _duWeights, // pointer to stencil u derivative limit weights\n+384 * _dvWeights, // pointer to stencil v derivative limit weights\n+385 * _duuWeights, // pointer to stencil uu derivative limit weights\n+386 * _duvWeights, // pointer to stencil uv derivative limit weights\n+387 * _dvvWeights; // pointer to stencil vv derivative limit weights\n+388};\n+389\n+_\b3_\b9_\b2class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n+393protected:\n+_\b3_\b9_\b4 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl;\n+395\n+396public:\n+_\b3_\b9_\b7 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl const & other) : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(other) { }\n+_\b3_\b9_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(int* size, _\bI_\bn_\bd_\be_\bx * indices, float * weights,\n+399 float * duWeights=0, float * dvWeights=0,\n+400 float * duuWeights=0, float * duvWeights=0, float * dvvWeights=0)\n+401 : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(size, indices, weights,\n+402 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights) { }\n+403};\n+404\n+405\n+408template \n+_\b4_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n+410protected:\n+_\b4_\b1_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(\n+412 int numControlVerts,\n+413 std::vector const& offsets,\n+414 std::vector const& sizes,\n+415 std::vector const& sources,\n+416 std::vector const& weights,\n+417 std::vector const& duWeights,\n+418 std::vector const& dvWeights,\n+419 std::vector const& duuWeights,\n+420 std::vector const& duvWeights,\n+421 std::vector const& dvvWeights,\n+422 bool includeCoarseVerts,\n+423 size_t firstOffset);\n+424\n+425public:\n+426\n+_\b4_\b2_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const;\n+429\n+_\b4_\b3_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const;\n+432\n+_\b4_\b3_\b4 std::vector const & _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+435 return _duWeights;\n+436 }\n+437\n+_\b4_\b3_\b9 std::vector const & _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+440 return _dvWeights;\n+441 }\n+442\n+_\b4_\b4_\b4 std::vector const & _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+445 return _duuWeights;\n+446 }\n+447\n+_\b4_\b4_\b9 std::vector const & _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+450 return _duvWeights;\n+451 }\n+452\n+_\b4_\b5_\b4 std::vector const & _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n+455 return _dvvWeights;\n+456 }\n+457\n+475 template \n+_\b4_\b7_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T const & srcValues, U & uderivs, U & vderivs,\n+477 int start=-1, int end=-1) const {\n+478\n+479 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uderivs, _duWeights, start, end);\n+480 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, vderivs, _dvWeights, start, end);\n+481 }\n+482\n+483 template \n+_\b4_\b8_\b4 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T1 const & srcBase, int numBase, T2 const & srcRef,\n+485 U & uderivs, U & vderivs, int start=-1, int end=-1) const {\n+486\n+487 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);\n+488 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);\n+489 }\n+490\n+491 // Pointer interface for backward compatibility\n+492 template \n+_\b4_\b9_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T const *src, U *uderivs, U *vderivs,\n+494 int start=-1, int end=-1) const {\n+495\n+496 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uderivs, _duWeights, start, end);\n+497 this->_\bu_\bp_\bd_\ba_\bt_\be(src, vderivs, _dvWeights, start, end);\n+498 }\n+499 template \n+_\b5_\b0_\b0 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n+501 U *uderivs, U *vderivs, int start=-1, int end=-1) const {\n+502\n+503 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);\n+504 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);\n+505 }\n+506\n+527 template \n+_\b5_\b2_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T const & srcValues,\n+529 U & uuderivs, U & uvderivs, U & vvderivs,\n+530 int start=-1, int end=-1) const {\n+531\n+532 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uuderivs, _duuWeights, start, end);\n+533 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uvderivs, _duvWeights, start, end);\n+534 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, vvderivs, _dvvWeights, start, end);\n+535 }\n+536\n+537 template \n+_\b5_\b3_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T1 const & srcBase, int numBase, T2 const & srcRef,\n+539 U & uuderivs, U & uvderivs, U & vvderivs, int start=-1, int end=-1) const {\n+540\n+541 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);\n+542 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);\n+543 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);\n+544 }\n+545\n+546 // Pointer interface for backward compatibility\n+547 template \n+_\b5_\b4_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs,\n+549 int start=-1, int end=-1) const {\n+550\n+551 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uuderivs, _duuWeights, start, end);\n+552 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uvderivs, _duvWeights, start, end);\n+553 this->_\bu_\bp_\bd_\ba_\bt_\be(src, vvderivs, _dvvWeights, start, end);\n+554 }\n+555 template \n+_\b5_\b5_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n+557 U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const {\n+558\n+559 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);\n+560 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);\n+561 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);\n+562 }\n+563\n+_\b5_\b6_\b5 void _\bC_\bl_\be_\ba_\br();\n+566\n+567private:\n+568 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n+569\n+570 // Resize the table arrays (factory helper)\n+571 void resize(int nstencils, int nelems);\n+572\n+573private:\n+574 std::vector _duWeights, // u derivative limit stencil weights\n+575 _dvWeights, // v derivative limit stencil weights\n+576 _duuWeights, // uu derivative limit stencil weights\n+577 _duvWeights, // uv derivative limit stencil weights\n+578 _dvvWeights; // vv derivative limit stencil weights\n+579};\n+580\n+_\b5_\b8_\b3class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n+584protected:\n+_\b5_\b8_\b5 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+586\n+587public:\n+_\b5_\b8_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl _\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx index) const {\n+589 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n+590 }\n+_\b5_\b9_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n+592 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n+593 }\n+594\n+595protected:\n+_\b5_\b9_\b6 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts,\n+597 std::vector const& offsets,\n+598 std::vector const& sizes,\n+599 std::vector const& sources,\n+600 std::vector const& weights,\n+601 std::vector const& duWeights,\n+602 std::vector const& dvWeights,\n+603 std::vector const& duuWeights,\n+604 std::vector const& duvWeights,\n+605 std::vector const& dvvWeights,\n+606 bool includeCoarseVerts,\n+607 size_t firstOffset)\n+608 : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts,\n+609 offsets, sizes, sources, weights,\n+610 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights,\n+611 includeCoarseVerts, firstOffset) { }\n+612};\n+613\n+614\n+615// Update values by applying cached stencil weights to new control values\n+616template \n+617template void\n+_\b6_\b1_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be(T1 const &srcBase, int numBase,\n+619 T2 const &srcRef, U &dstValues,\n+620 std::vector const &valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const {\n+621\n+622 int const * sizes = &_sizes.at(0);\n+623 _\bI_\bn_\bd_\be_\bx const * indices = &_indices.at(0);\n+624 REAL const * weights = &valueWeights.at(0);\n+625\n+626 if (start > 0) {\n+627 assert(start < (_\bI_\bn_\bd_\be_\bx)_offsets.size());\n+628 sizes += start;\n+629 indices += _offsets[start];\n+630 weights += _offsets[start];\n+631 } else {\n+632 start = 0;\n+633 }\n+634\n+635 int nstencils = ((end < start) ? GetNumStencils() : end) - start;\n+636\n+637 for (int i = 0; i < nstencils; ++i, ++sizes) {\n+638 dstValues[start + i].Clear();\n+639 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {\n+640 if (*indices < numBase) {\n+641 dstValues[start + i].AddWithWeight(srcBase[*indices], *weights);\n+642 } else {\n+643 dstValues[start + i].AddWithWeight(srcRef[*indices - numBase], *weights);\n+644 }\n+645 }\n+646 }\n+647}\n+648template \n+649template void\n+_\b6_\b5_\b0_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be(T const &srcValues, U &dstValues,\n+651 std::vector const &valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const {\n+652\n+653 int const * sizes = &_sizes.at(0);\n+654 _\bI_\bn_\bd_\be_\bx const * indices = &_indices.at(0);\n+655 REAL const * weights = &valueWeights.at(0);\n+656\n+657 if (start > 0) {\n+658 assert(start < (_\bI_\bn_\bd_\be_\bx)_offsets.size());\n+659 sizes += start;\n+660 indices += _offsets[start];\n+661 weights += _offsets[start];\n+662 } else {\n+663 start = 0;\n+664 }\n+665\n+666 int nstencils = ((end < start) ? GetNumStencils() : end) - start;\n+667\n+668 for (int i = 0; i < nstencils; ++i, ++sizes) {\n+669 dstValues[start + i].Clear();\n+670 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {\n+671 dstValues[start + i].AddWithWeight(srcValues[*indices], *weights);\n+672 }\n+673 }\n+674}\n+675\n+676template \n+677inline void\n+_\b6_\b7_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs() {\n+679 _\bI_\bn_\bd_\be_\bx offset=0;\n+680 int noffsets = (int)_sizes.size();\n+681 _offsets.resize(noffsets);\n+682 for (int i=0; i<(int)_sizes.size(); ++i ) {\n+683 _offsets[i]=offset;\n+684 offset+=_sizes[i];\n+685 }\n+686}\n+687\n+688template \n+689inline void\n+_\b6_\b9_\b0_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems) {\n+691 _sizes.resize(nstencils);\n+692 _indices.resize(nelems);\n+693 _weights.resize(nelems);\n+694}\n+695\n+696template \n+697inline void\n+_\b6_\b9_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be(int nstencils, int nelems) {\n+699 _sizes.reserve(nstencils);\n+700 _indices.reserve(nelems);\n+701 _weights.reserve(nelems);\n+702}\n+703\n+704template \n+705inline void\n+_\b7_\b0_\b6_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt() {\n+707 std::vector(_sizes).swap(_sizes);\n+708 std::vector(_indices).swap(_indices);\n+709 std::vector(_weights).swap(_weights);\n+710}\n+711\n+712template \n+713inline void\n+_\b7_\b1_\b4_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be() {\n+715 shrinkToFit();\n+716 generateOffsets();\n+717}\n+718\n+719// Returns a Stencil at index i in the table\n+720template \n+721inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n+_\b7_\b2_\b2_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const {\n+723 assert((! _offsets.empty()) && i<(int)_offsets.size());\n+724\n+725 _\bI_\bn_\bd_\be_\bx ofs = _offsets[i];\n+726\n+727 return _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(const_cast(&_sizes[i]),\n+728 const_cast<_\bI_\bn_\bd_\be_\bx*>(&_indices[ofs]),\n+729 const_cast(&_weights[ofs]));\n+730}\n+731\n+732template \n+733inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n+_\b7_\b3_\b4_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n+735 return GetStencil(index);\n+736}\n+737\n+738template \n+739inline void\n+740_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems) {\n+741 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(nstencils, nelems);\n+742 _duWeights.resize(nelems);\n+743 _dvWeights.resize(nelems);\n+744}\n+745\n+746// Returns a LimitStencil at index i in the table\n+747template \n+748inline LimitStencilReal\n+_\b7_\b4_\b9_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const {\n+750 assert((! this->GetOffsets().empty()) && i<(int)this->GetOffsets().size());\n+751\n+752 _\bI_\bn_\bd_\be_\bx ofs = this->GetOffsets()[i];\n+753\n+754 if (!_duWeights.empty() && !_dvWeights.empty() &&\n+755 !_duuWeights.empty() && !_duvWeights.empty() && !_dvvWeights.empty()) {\n+756 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n+757 const_cast(&this->GetSizes()[i]),\n+758 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n+759 const_cast(&this->GetWeights()[ofs]),\n+760 const_cast(&GetDuWeights()[ofs]),\n+761 const_cast(&GetDvWeights()[ofs]),\n+762 const_cast(&GetDuuWeights()[ofs]),\n+763 const_cast(&GetDuvWeights()[ofs]),\n+764 const_cast(&GetDvvWeights()[ofs]) );\n+765 } else if (!_duWeights.empty() && !_dvWeights.empty()) {\n+766 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n+767 const_cast(&this->GetSizes()[i]),\n+768 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n+769 const_cast(&this->GetWeights()[ofs]),\n+770 const_cast(&GetDuWeights()[ofs]),\n+771 const_cast(&GetDvWeights()[ofs]) );\n+772 } else {\n+773 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n+774 const_cast(&this->GetSizes()[i]),\n+775 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n+776 const_cast(&this->GetWeights()[ofs]) );\n+777 }\n+778}\n+779\n+780template \n+781inline _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n+_\b7_\b8_\b2_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n+783 return GetLimitStencil(index);\n+784}\n+785\n+786} // end namespace Far\n+787\n+788} // end namespace OPENSUBDIV_VERSION\n+789using namespace OPENSUBDIV_VERSION;\n+790\n+791} // end namespace OpenSubdiv\n+792\n+793#endif // OPENSUBDIV3_FAR_STENCILTABLE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n Vtr::Index Index\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-A simple reference to raw topology data for use with TopologyRefinerFactory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-FVarChannel const * fvarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int numVertices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * cornerVertexIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n-Index const * vertIndicesPerFace\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs\n-Index const * creaseVertexIndexPairs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * holeIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs\n-int numFaces\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs\n-int numCorners\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-float const * cornerWeights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd\n-bool isLeftHanded\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n-int const * numVertsPerFace\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-TopologyDescriptor()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-float const * creaseWeights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs\n-int numCreases\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs\n-int numHoles\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int numFVarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n-_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-FVarChannel()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n-_\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * valueIndices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:_\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs\n-int numValues\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-Specify the relationships between vertices, faces, etc. ie the face-vertices,\n-vertex-faces,...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH\n-const &mesh)\n-(Optional) Control run-time topology validation and error reporting\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs\n-static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)\n-(Optional) Specify edge or vertex sharpness or face holes\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-Specify the number of vertices, faces, face-vertices, etc.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n-static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const\n-&mesh)\n-(Optional) Specify face-varying data per face\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-Stores topology data for a specified set of refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+A specialized factory for StencilTable.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+A specialized factory for LimitStencilTable.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+Vertex stencil descriptor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+StencilReal()\n+Default constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bs_\bi_\bz_\be\n+int * _size\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+StencilReal(int *size, Index *indices, REAL *weights)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bN_\be_\bx_\bt\n+void Next()\n+Advance to the next stencil in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+StencilReal(StencilReal const &other)\n+Copy constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs\n+Index * _indices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * GetVertexIndices() const\n+Returns the control vertices' indices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be\n+int GetSize() const\n+Returns the size of the stencil.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs\n+REAL * _weights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bP_\bt_\br\n+int * GetSizePtr() const\n+Returns the size of the stencil as a pointer.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetWeights() const\n+Returns the interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Vertex stencil class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Stencil(BaseStencil const &other)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Stencil(int *size, Index *indices, float *weights)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+StencilReal< float > BaseStencil\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Stencil()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+Table of subdivision stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumControlVertices() const\n+Returns the number of control vertices indexed in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bs_\bi_\bz_\be_\bs\n+std::vector< int > _sizes\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br\n+friend class Far::PatchTableBuilder\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be\n+void update(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues,\n+std::vector< REAL > const &valueWeights, Index start, Index end) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n+void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef, U\n+&dstValues, Index start=-1, Index end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+std::vector< Index > const & GetControlIndices() const\n+Returns the indices of the control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be\n+void finalize()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n+StencilReal< REAL > operator[](Index index) const\n+Returns the stencil at index i in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int _numControlVertices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be\n+void update(T const &srcValues, U &dstValues, std::vector< REAL > const\n+&valueWeights, Index start, Index end) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs\n+std::vector< int > const & GetSizes() const\n+Returns the number of control vertices of each stencil in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+Returns the number of stencils in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+virtual ~StencilTableReal()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs\n+std::vector< Index > const & GetOffsets() const\n+Returns the offset to a given stencil (factory may leave empty)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+StencilReal< REAL > GetStencil(Index i) const\n+Returns a Stencil at index i in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt\n+void shrinkToFit()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n+void generateOffsets()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bC_\bl_\be_\ba_\br\n+void Clear()\n+Clears the stencils from the table.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bo_\bf_\bf_\bs_\be_\bt_\bs\n+std::vector< Index > _offsets\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > _weights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n+void resize(int nstencils, int nelems)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetWeights() const\n+Returns the stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n+void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef, U *dst,\n+Index start=-1, Index end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+StencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::\n+vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n+REAL > const &weights, bool includeCoarseVerts, size_t firstOffset)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs\n+std::vector< Index > _indices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+StencilTableReal()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be\n+void reserve(int nstencils, int nelems)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n+void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n+void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-\n+1) const\n+Updates point values based on the control values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b0_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable(int numControlVerts, std::vector< int > const &offsets, std::\n+vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n+float > const &weights, bool includeCoarseVerts, size_t firstOffset)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable(int numControlVerts)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be\n+StencilTableReal< float > BaseTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Stencil GetStencil(Index index) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n+Stencil operator[](Index index) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+Limit point stencil descriptor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetDuvWeights() const\n+Returns the uv derivative weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetDvWeights() const\n+Returns the v derivative weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bN_\be_\bx_\bt\n+void Next()\n+Advance to the next stencil in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetDvvWeights() const\n+Returns the vv derivative weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n+LimitStencilReal(int *size, Index *indices, REAL *weights, REAL *duWeights=0,\n+REAL *dvWeights=0, REAL *duuWeights=0, REAL *duvWeights=0, REAL *dvvWeights=0)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b2_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetDuWeights() const\n+Returns the u derivative weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+REAL const * GetDuuWeights() const\n+Returns the uu derivative weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+Limit point stencil class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+LimitStencil(BaseStencil const &other)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+LimitStencilReal< float > BaseStencil\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+LimitStencil(int *size, Index *indices, float *weights, float *duWeights=0,\n+float *dvWeights=0, float *duuWeights=0, float *duvWeights=0, float\n+*dvvWeights=0)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+Table of limit subdivision stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetDuuWeights() const\n+Returns the 'uu' derivative stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n+LimitStencilReal< REAL > operator[](Index index) const\n+Returns the limit stencil at index i in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetDvvWeights() const\n+Returns the 'vv' derivative stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n+void UpdateDerivs(T const *src, U *uderivs, U *vderivs, int start=-1, int end=-\n+1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n+void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs, int\n+start=-1, int end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetDvWeights() const\n+Returns the 'v' derivative stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n+void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U\n+*uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n+void UpdateDerivs(T const &srcValues, U &uderivs, U &vderivs, int start=-1, int\n+end=-1) const\n+Updates derivative values based on the control values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+LimitStencilReal< REAL > GetLimitStencil(Index i) const\n+Returns a LimitStencil at index i in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+LimitStencilTableReal(int numControlVerts, std::vector< int > const &offsets,\n+std::vector< int > const &sizes, std::vector< int > const &sources, std::\n+vector< REAL > const &weights, std::vector< REAL > const &duWeights, std::\n+vector< REAL > const &dvWeights, std::vector< REAL > const &duuWeights, std::\n+vector< REAL > const &duvWeights, std::vector< REAL > const &dvvWeights, bool\n+includeCoarseVerts, size_t firstOffset)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n+void Update2ndDerivs(T const &srcValues, U &uuderivs, U &uvderivs, U &vvderivs,\n+int start=-1, int end=-1) const\n+Updates 2nd derivative values based on the control values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetDuWeights() const\n+Returns the 'u' derivative stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bC_\bl_\be_\ba_\br\n+void Clear()\n+Clears the stencils from the table.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n+void Update2ndDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U\n+&uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+std::vector< REAL > const & GetDuvWeights() const\n+Returns the 'uv' derivative stencil interpolation weights.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n+void UpdateDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uderivs,\n+U &vderivs, int start=-1, int end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n+void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uderivs,\n+U *vderivs, int start=-1, int end=-1) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be\n+LimitStencilTableReal< float > BaseTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n+LimitStencil GetLimitStencil(Index index) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+LimitStencilTable(int numControlVerts, std::vector< int > const &offsets, std::\n+vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n+float > const &weights, std::vector< float > const &duWeights, std::vector<\n+float > const &dvWeights, std::vector< float > const &duuWeights, std::vector<\n+float > const &duvWeights, std::vector< float > const &dvvWeights, bool\n+includeCoarseVerts, size_t firstOffset)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n+LimitStencil operator[](Index index) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b9_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTableFactory.h File Reference\n+OpenSubdiv: opensubdiv/far/topologyDescriptor.h File Reference\n \n \n \n \n \n \n \n@@ -90,43 +90,31 @@\n \n \n \n
\n \n-
stencilTableFactory.h File Reference
\n+
topologyDescriptor.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n-#include <vector>
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/topologyRefinerFactory.h"
\n+#include "../far/error.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n+\n \n

\n Classes

class  StencilTableFactoryReal< REAL >
 A specialized factory for StencilTable. More...
struct  TopologyDescriptor
 A simple reference to raw topology data for use with TopologyRefinerFactory. More...
 
struct  StencilTableFactoryReal< REAL >::Options
 
class  LimitStencilTableFactoryReal< REAL >
 A specialized factory for LimitStencilTable. More...
 
struct  LimitStencilTableFactoryReal< REAL >::Options
 
struct  LimitStencilTableFactoryReal< REAL >::LocationArray
 Descriptor for limit surface locations. More...
 
class  StencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
class  LimitStencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
struct  TopologyDescriptor::FVarChannel
 
\n \n \n \n \n@@ -135,13 +123,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,43 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-stencilTableFactory.h File Reference\n+topologyDescriptor.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 A specialized factory for _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+\u00a0 A simple reference to raw topology data for use with\n+ _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0\n- class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 A specialized factory for _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0\n-struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-\u00a0 Descriptor for limit surface locations. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n- class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,4 @@\n var a00716 = [\n- [\"StencilTableFactoryReal< REAL >\", \"a01045.html\", \"a01045\"],\n- [\"Options\", \"a01085.html\", \"a01085\"],\n- [\"LimitStencilTableFactoryReal< REAL >\", \"a01049.html\", \"a01049\"],\n- [\"Options\", \"a01089.html\", \"a01089\"],\n- [\"LocationArray\", \"a01093.html\", \"a01093\"],\n- [\"StencilTableFactory\", \"a01097.html\", null],\n- [\"LimitStencilTableFactory\", \"a01101.html\", null]\n+ [\"TopologyDescriptor\", \"a01105.html\", \"a01105\"],\n+ [\"FVarChannel\", \"a01109.html\", \"a01109\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00716_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00716_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTableFactory.h Source File\n+OpenSubdiv: opensubdiv/far/topologyDescriptor.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
stencilTableFactory.h
\n+
topologyDescriptor.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,358 +118,146 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24
\n-
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n-
26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n-
27
\n-
28#include "../version.h"
\n-
29
\n-
30#include "../far/patchTable.h"
\n-
31
\n-
32#include <vector>
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38
\n-
39class TopologyRefiner;
\n-
40
\n-
41template <typename REAL> class StencilReal;
\n-
42template <typename REAL> class StencilTableReal;
\n-
43
\n-
44template <typename REAL> class LimitStencilReal;
\n-
45template <typename REAL> class LimitStencilTableReal;
\n-
46
\n-
47
\n-
50template <typename REAL>
\n-
\n-\n-
52
\n-
53public:
\n-
54
\n-\n+
24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n+
25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H
\n+
26
\n+
27#include "../version.h"
\n+
28
\n+
29#include "../far/topologyRefiner.h"
\n+
30#include "../far/topologyRefinerFactory.h"
\n+
31#include "../far/error.h"
\n+
32
\n+
33#include <cassert>
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Far {
\n+
39
\n+
\n+\n+
50
\n+\n+\n+
53
\n+
54 int const * numVertsPerFace;
\n+\n+
56
\n+\n+\n+
59 float const * creaseWeights;
\n
60
\n-
\n-
61 struct Options {
\n-
62
\n-\n-
70
\n-
71 unsigned int interpolationMode : 2,
\n-\n-\n-\n-\n-\n-
79 unsigned int fvarChannel;
\n-
81 };
\n-
\n-
82
\n-\n-
95 TopologyRefiner const & refiner, Options options = Options());
\n-
96
\n-
97
\n-\n-
111 int numTables, StencilTableReal<REAL> const ** tables);
\n-
112
\n+\n+\n+
63 float const * cornerWeights;
\n+
64
\n+\n+\n+
67
\n+\n+
69
\n+
70 // Face-varying data channel -- value indices correspond to vertex indices,
\n+
71 // i.e. one for every vertex of every face:
\n+
72 //
\n+
\n+
73 struct FVarChannel {
\n+
74
\n+\n+\n+
77
\n+\n+
79 };
\n+
\n+
80
\n+\n+\n+
83
\n+\n+
85};
\n+
\n+
86
\n+
87
\n+
88//
\n+
89// Forward declarations of required TopologyRefinerFactory<TopologyDescriptor>
\n+
90// specializations (defined internally):
\n+
91//
\n+
92// @cond EXCLUDE_DOXYGEN
\n+
93
\n+
94template <>
\n+
95bool
\n+\n+
97 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
98
\n+
99template <>
\n+
100bool
\n+\n+
102 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
103
\n+
104template <>
\n+
105bool
\n+\n+
107 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n+
108
\n+
109template <>
\n+
110bool
\n+\n+
112 TopologyRefiner & refiner, TopologyDescriptor const & desc);
\n
113
\n-\n-
129 TopologyRefiner const &refiner,
\n-
130 StencilTableReal<REAL> const *baseStencilTable,
\n-
131 StencilTableReal<REAL> const *localPointStencilTable,
\n-
132 bool factorize = true);
\n-
133
\n-
\n-\n-
149 TopologyRefiner const &refiner,
\n-
150 StencilTableReal<REAL> const *baseStencilTable,
\n-
151 StencilTableReal<REAL> const *localPointStencilTable,
\n-
152 bool factorize = true) {
\n-\n-
154 refiner, baseStencilTable, localPointStencilTable, factorize);
\n-
155 }
\n-
\n-
156
\n-\n-
175 TopologyRefiner const &refiner,
\n-
176 StencilTableReal<REAL> const *baseStencilTable,
\n-
177 StencilTableReal<REAL> const *localPointStencilTable,
\n-
178 int channel = 0,
\n-
179 bool factorize = true);
\n-
180
\n-
181private:
\n-
182
\n-
183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)
\n-
184 static void generateControlVertStencils(
\n-
185 int numControlVerts,
\n-
186 StencilReal<REAL> & dst);
\n-
187
\n-
188 // Internal method to splice local point stencils
\n-
189 static StencilTableReal<REAL> const * appendLocalPointStencilTable(
\n-
190 TopologyRefiner const &refiner,
\n-
191 StencilTableReal<REAL> const * baseStencilTable,
\n-
192 StencilTableReal<REAL> const * localPointStencilTable,
\n-
193 int channel,
\n-
194 bool factorize);
\n-
195};
\n-
\n-
196
\n-
208template <typename REAL>
\n-
\n-\n-
210
\n-
211public:
\n-
212
\n-\n-
218
\n-
\n-
219 struct Options {
\n-
220
\n-\n-
225
\n-
226 unsigned int interpolationMode : 2,
\n-\n-\n-
229 unsigned int fvarChannel;
\n-
230 };
\n-
\n-
231
\n-
\n-\n-
234
\n-
235 LocationArray() : ptexIdx(-1), numLocations(0), s(0), t(0) { }
\n-
236
\n-\n-\n-
239
\n-
240 REAL const * s,
\n-
241 * t;
\n-
242 };
\n-
\n-
243
\n-
244 typedef std::vector<LocationArray> LocationArrayVec;
\n-
245
\n-\n-
270 TopologyRefiner const & refiner,
\n-
271 LocationArrayVec const & locationArrays,
\n-
272 StencilTableReal<REAL> const * cvStencils = 0,
\n-
273 PatchTable const * patchTable = 0,
\n-
274 Options options = Options());
\n-
275
\n-
276};
\n-
\n-
277
\n-
278
\n-
279//
\n-
280// Public wrapper classes for the templates
\n-
281//
\n-
282class Stencil;
\n-
283class StencilTable;
\n-
284
\n-
\n-\n-
288private:
\n-\n-\n-
291
\n-
292public:
\n-
\n-
293 static StencilTable const * Create(
\n-
294 TopologyRefiner const & refiner, Options options = Options()) {
\n-
295
\n-
296 return static_cast<StencilTable const *>(
\n-
297 BaseFactory::Create(refiner, options));
\n-
298 }
\n-
\n-
299
\n-
\n-
300 static StencilTable const * Create(
\n-
301 int numTables, StencilTable const ** tables) {
\n-
302
\n-
303 return static_cast<StencilTable const *>(
\n-
304 BaseFactory::Create(numTables,
\n-
305 reinterpret_cast<BaseTable const **>(tables)));
\n-
306 }
\n-
\n-
307
\n-
\n-\n-
309 TopologyRefiner const &refiner,
\n-
310 StencilTable const *baseStencilTable,
\n-
311 StencilTable const *localPointStencilTable,
\n-
312 bool factorize = true) {
\n-
313
\n-
314 return static_cast<StencilTable const *>(
\n-\n-
316 static_cast<BaseTable const *>(baseStencilTable),
\n-
317 static_cast<BaseTable const *>(localPointStencilTable),
\n-
318 factorize));
\n-
319 }
\n-
\n-
320
\n-
\n-\n-
322 TopologyRefiner const &refiner,
\n-
323 StencilTable const *baseStencilTable,
\n-
324 StencilTable const *localPointStencilTable,
\n-
325 bool factorize = true) {
\n-
326
\n-
327 return static_cast<StencilTable const *>(
\n-\n-
329 static_cast<BaseTable const *>(baseStencilTable),
\n-
330 static_cast<BaseTable const *>(localPointStencilTable),
\n-
331 factorize));
\n-
332 }
\n-
\n-
333
\n-
\n-\n-
335 TopologyRefiner const &refiner,
\n-
336 StencilTable const *baseStencilTable,
\n-
337 StencilTable const *localPointStencilTable,
\n-
338 int channel = 0,
\n-
339 bool factorize = true) {
\n-
340
\n-
341 return static_cast<StencilTable const *>(
\n-\n-
343 static_cast<BaseTable const *>(baseStencilTable),
\n-
344 static_cast<BaseTable const *>(localPointStencilTable),
\n-
345 channel, factorize));
\n-
346 }
\n-
\n-
347};
\n-
\n-
348
\n-
349class LimitStencil;
\n-
350class LimitStencilTable;
\n-
351
\n-
\n-\n-
355private:
\n-\n-\n-
358
\n-
359public:
\n-
\n-
360 static LimitStencilTable const * Create(
\n-
361 TopologyRefiner const & refiner,
\n-
362 LocationArrayVec const & locationArrays,
\n-
363 StencilTable const * cvStencils = 0,
\n-
364 PatchTable const * patchTable = 0,
\n-
365 Options options = Options()) {
\n-
366
\n-
367 return static_cast<LimitStencilTable const *>(
\n-\n-
369 refiner,
\n-
370 locationArrays,
\n-
371 static_cast<BaseTable const *>(cvStencils),
\n-
372 patchTable,
\n-
373 options));
\n-
374 }
\n-
\n-
375};
\n-
\n-
376
\n-
377} // end namespace Far
\n-
378
\n-
379} // end namespace OPENSUBDIV_VERSION
\n-
380using namespace OPENSUBDIV_VERSION;
\n-
381
\n-
382} // end namespace OpenSubdiv
\n-
383
\n-
384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n+
114template <>
\n+
115void
\n+\n+
117 TopologyError errCode, char const * msg, TopologyDescriptor const & desc);
\n+
118
\n+
119// @endcond
\n+
120
\n+
121} // end namespace Far
\n+
122
\n+
123} // end namespace OPENSUBDIV_VERSION
\n+
124using namespace OPENSUBDIV_VERSION;
\n+
125} // end namespace OpenSubdiv
\n+
126
\n+
127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */
\n \n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-
static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, Options options=Options())
Instantiates StencilTable from TopologyRefiner that have been refined uniformly or adaptively.
\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int channel=0, bool factorize=true)
Utility function for stencil splicing for local point face-varying stencils.
\n-\n-\n-\n-\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point varying stencils.
\n-
static StencilTableReal< REAL > const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point stencils.
\n-
static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal< REAL > const **tables)
Instantiates StencilTable by concatenating an array of existing stencil tables.
\n-\n-\n-\n-\n-\n-\n-
static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL > const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
Instantiates LimitStencilTable from a TopologyRefiner that has been refined either uniformly or adapt...
\n-\n-
Vertex stencil class wrapping the template for compatibility.
\n-\n-
Stencil table class wrapping the template for compatibility.
\n-\n-
Limit stencil table class wrapping the template for compatibility.
\n-\n-\n-\n-\n-
unsigned int generateIntermediateLevels
vertices at all levels or highest only
\n-
unsigned int generateControlVerts
generate stencils for control-vertices
\n-\n-\n-\n-\n-\n-\n-\n-
unsigned int generate2ndDerivatives
Generate weights for 2nd derivatives.
\n-
unsigned int generate1stDerivatives
Generate weights for 1st derivatives.
\n-\n-\n-\n-\n-\n-\n-
Stencil table factory class wrapping the template for compatibility.
\n-
static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n-
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n-
static StencilTable const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)
\n-
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n-
static StencilTable const * Create(int numTables, StencilTable const **tables)
\n-
Stencil table factory class wrapping the template for compatibility.
\n-
static LimitStencilTable const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
\n-
Stores topology data for a specified set of refinement options.
\n+\n+
A simple reference to raw topology data for use with TopologyRefinerFactory.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces,...
\n+
static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH const &mesh)
(Optional) Control run-time topology validation and error reporting
\n+
static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify edge or vertex sharpness or face holes
\n+
static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const &mesh)
Specify the number of vertices, faces, face-vertices, etc.
\n+
static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const &mesh)
(Optional) Specify face-varying data per face
\n+
Stores topology data for a specified set of refinement options.
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-stencilTableFactory.h\n+topologyDescriptor.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,498 +23,208 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24\n-25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n-26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n-27\n-28#include \"../version.h\"\n-29\n-30#include \"../far/patchTable.h\"\n-31\n-32#include \n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38\n-39class TopologyRefiner;\n-40\n-41template class StencilReal;\n-42template class StencilTableReal;\n-43\n-44template class LimitStencilReal;\n-45template class LimitStencilTableReal;\n-46\n-47\n-50template \n-_\b5_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-52\n-53public:\n-54\n-_\b5_\b5 enum _\bM_\bo_\bd_\be {\n-_\b5_\b6 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n-_\b5_\b7 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n-58 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-_\b5_\b9 };\n+24#ifndef OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n+25#define OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H\n+26\n+27#include \"../version.h\"\n+28\n+29#include \"../far/topologyRefiner.h\"\n+30#include \"../far/topologyRefinerFactory.h\"\n+31#include \"../far/error.h\"\n+32\n+33#include \n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Far {\n+39\n+_\b4_\b9struct _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n+50\n+_\b5_\b1 int _\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs,\n+_\b5_\b2 _\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs;\n+53\n+_\b5_\b4 int const * _\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n+_\b5_\b5 _\bI_\bn_\bd_\be_\bx const * _\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be;\n+56\n+_\b5_\b7 int _\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs;\n+_\b5_\b8 _\bI_\bn_\bd_\be_\bx const * _\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs;\n+_\b5_\b9 float const * _\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n 60\n-_\b6_\b1 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-62\n-_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n-64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs(false),\n-65 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs(false),\n-66 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n-67 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n-68 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl(10),\n-69 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n-70\n-_\b7_\b1 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n-_\b7_\b2 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs : 1,\n-_\b7_\b3 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs : 1,\n-_\b7_\b4 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b7_\b5 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b7_\b8 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl : 4;\n-_\b7_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n-81 };\n-82\n-_\b9_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-95 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-96\n-97\n-_\b1_\b1_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-111 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const ** tables);\n-112\n+_\b6_\b1 int _\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs;\n+_\b6_\b2 _\bI_\bn_\bd_\be_\bx const * _\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+_\b6_\b3 float const * _\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs;\n+64\n+_\b6_\b5 int _\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs;\n+_\b6_\b6 _\bI_\bn_\bd_\be_\bx const * _\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+67\n+_\b6_\b8 bool _\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd;\n+69\n+70 // Face-varying data channel -- value indices correspond to vertex indices,\n+71 // i.e. one for every vertex of every face:\n+72 //\n+_\b7_\b3 struct _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl {\n+74\n+_\b7_\b5 int _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs;\n+_\b7_\b6 _\bI_\bn_\bd_\be_\bx const * _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+77\n+_\b7_\b8 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl() : _\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs(0), _\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs(0) { }\n+79 };\n+80\n+_\b8_\b1 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+_\b8_\b2 _\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+83\n+_\b8_\b4 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br();\n+85};\n+86\n+87\n+88//\n+89// Forward declarations of required\n+TopologyRefinerFactory\n+90// specializations (defined internally):\n+91//\n+92// @cond EXCLUDE_DOXYGEN\n+93\n+94template <>\n+95bool\n+96_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+97 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+98\n+99template <>\n+100bool\n+101_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+102 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+103\n+104template <>\n+105bool\n+106_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs(\n+107 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+108\n+109template <>\n+110bool\n+111_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+112 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br & refiner, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n 113\n-_\b1_\b2_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-129 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-130 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-131 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-132 bool factorize = true);\n-133\n-_\b1_\b4_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-149 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-150 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-151 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-152 bool factorize = true) {\n-153 return _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-154 refiner, baseStencilTable, localPointStencilTable, factorize);\n-155 }\n-156\n-_\b1_\b7_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-175 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-176 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n-177 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n-178 int channel = 0,\n-179 bool factorize = true);\n-180\n-181private:\n-182\n-183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)\n-184 static void generateControlVertStencils(\n-185 int numControlVerts,\n-186 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> & dst);\n-187\n-188 // Internal method to splice local point stencils\n-189 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * appendLocalPointStencilTable(\n-190 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-191 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * baseStencilTable,\n-192 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * localPointStencilTable,\n-193 int channel,\n-194 bool factorize);\n-195};\n-196\n-208template \n-_\b2_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-210\n-211public:\n-212\n-_\b2_\b1_\b3 enum _\bM_\bo_\bd_\be {\n-_\b2_\b1_\b4 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n-_\b2_\b1_\b5 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n-216 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-_\b2_\b1_\b7 };\n-218\n-_\b2_\b1_\b9 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-220\n-_\b2_\b2_\b1 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n-222 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(true),\n-223 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(false),\n-224 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n-225\n-_\b2_\b2_\b6 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n-_\b2_\b2_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1,\n-_\b2_\b2_\b8 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1;\n-_\b2_\b2_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n-230 };\n-231\n-_\b2_\b3_\b3 struct _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by {\n-234\n-_\b2_\b3_\b5 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by() : _\bp_\bt_\be_\bx_\bI_\bd_\bx(-1), _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs(0), _\bs(0), _\bt(0) { }\n-236\n-_\b2_\b3_\b7 int _\bp_\bt_\be_\bx_\bI_\bd_\bx,\n-_\b2_\b3_\b8 _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs;\n-239\n-_\b2_\b4_\b0 REAL const * _\bs,\n-_\b2_\b4_\b1 * _\bt;\n-242 };\n-243\n-_\b2_\b4_\b4 typedef std::vector _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc;\n-245\n-_\b2_\b6_\b9 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n-270 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-271 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n-272 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * cvStencils = 0,\n-273 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n-274 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n-275\n-276};\n-277\n-278\n-279//\n-280// Public wrapper classes for the templates\n-281//\n-282class _\bS_\bt_\be_\bn_\bc_\bi_\bl;\n-283class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be;\n-284\n-_\b2_\b8_\b7class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n-288private:\n-289 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-290 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-291\n-292public:\n-_\b2_\b9_\b3 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-294 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, Options options = Options()) {\n-295\n-296 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-297 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(refiner, options));\n-298 }\n-299\n-_\b3_\b0_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-301 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const ** tables) {\n-302\n-303 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-304 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(numTables,\n-305 reinterpret_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const **>(tables)));\n-306 }\n-307\n-_\b3_\b0_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n-309 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-310 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-311 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-312 bool factorize = true) {\n-313\n-314 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-315 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(refiner,\n-316 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-317 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-318 factorize));\n-319 }\n-320\n-_\b3_\b2_\b1 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-322 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-323 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-324 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-325 bool factorize = true) {\n-326\n-327 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-328 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n-329 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-330 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-331 factorize));\n-332 }\n-333\n-_\b3_\b3_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-335 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-336 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n-337 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n-338 int channel = 0,\n-339 bool factorize = true) {\n-340\n-341 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-342 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n-343 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n-344 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n-345 channel, factorize));\n-346 }\n-347};\n-348\n-349class LimitStencil;\n-350class LimitStencilTable;\n-351\n-_\b3_\b5_\b4class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-{\n-355private:\n-356 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n-357 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-358\n-359public:\n-_\b3_\b6_\b0 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n-361 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-362 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n-363 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * cvStencils = 0,\n-364 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n-365 Options options = Options()) {\n-366\n-367 return static_cast<_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-368 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(\n-369 refiner,\n-370 locationArrays,\n-371 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(cvStencils),\n-372 patchTable,\n-373 options));\n-374 }\n-375};\n-376\n-377} // end namespace Far\n-378\n-379} // end namespace OPENSUBDIV_VERSION\n-380using namespace OPENSUBDIV_VERSION;\n-381\n-382} // end namespace OpenSubdiv\n-383\n-384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n+114template <>\n+115void\n+116_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b>_\b:_\b:_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by(\n+117 TopologyError errCode, char const * msg, _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & desc);\n+118\n+119// @endcond\n+120\n+121} // end namespace Far\n+122\n+123} // end namespace OPENSUBDIV_VERSION\n+124using namespace OPENSUBDIV_VERSION;\n+125} // end namespace OpenSubdiv\n+126\n+127#endif /* OPENSUBDIV3_FAR_TOPOLOGY_DESCRIPTOR_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-Container for arrays of parametric patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-A specialized factory for StencilTable.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner,\n-Options options=Options())\n-Instantiates StencilTable from TopologyRefiner that have been refined uniformly\n-or adaptively.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int\n-channel=0, bool factorize=true)\n-Utility function for stencil splicing for local point face-varying stencils.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n-Mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_FACE_VARYING\n-face-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_VARYING\n-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n-@ INTERPOLATE_VERTEX\n-vertex primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n-factorize=true)\n-Utility function for stencil splicing for local point varying stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-static StencilTableReal< REAL > const * AppendLocalPointStencilTable\n-(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n-*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n-factorize=true)\n-Utility function for stencil splicing for local point stencils.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal<\n-REAL > const **tables)\n-Instantiates StencilTable by concatenating an array of existing stencil tables.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n-A specialized factory for LimitStencilTable.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n-Mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_FACE_VARYING\n-face-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n-@ INTERPOLATE_VARYING\n-varying primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n-@ INTERPOLATE_VERTEX\n-vertex primvar stencils\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc\n-std::vector< LocationArray > LocationArrayVec\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const\n-&refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL >\n-const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())\n-Instantiates LimitStencilTable from a TopologyRefiner that has been refined\n-either uniformly or adapt...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-Vertex stencil descriptor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Vertex stencil class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-Table of subdivision stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-Table of limit subdivision stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int factorizeIntermediateLevels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bm_\ba_\bx_\bL_\be_\bv_\be_\bl\n-unsigned int maxLevel\n-generate stencils up to 'maxLevel'\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int generateIntermediateLevels\n-vertices at all levels or highest only\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs\n-unsigned int generateControlVerts\n-generate stencils for control-vertices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n-unsigned int generateOffsets\n-populate optional \"_offsets\" field\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-unsigned int fvarChannel\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n-unsigned int interpolationMode\n-interpolation mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n-unsigned int fvarChannel\n-face-varying channel to use\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n-unsigned int interpolationMode\n-interpolation mode\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n-unsigned int generate2ndDerivatives\n-Generate weights for 2nd derivatives.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n-unsigned int generate1stDerivatives\n-Generate weights for 1st derivatives.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-Descriptor for limit surface locations.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bt\n-REAL const * t\n-array of v coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bs\n-REAL const * s\n-array of u coordinates\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n-LocationArray()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs\n-int numLocations\n-number of (u,v) coordinates in the array\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bp_\bt_\be_\bx_\bI_\bd_\bx\n-int ptexIdx\n-ptex face index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Stencil table factory class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner\n-const &refiner, StencilTable const *baseStencilTable, StencilTable const\n-*localPointStencilTable, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTable const * Create(TopologyRefiner const &refiner, Options\n-options=Options())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static StencilTable const * AppendLocalPointStencilTableFaceVarying\n-(TopologyRefiner const &refiner, StencilTable const *baseStencilTable,\n-StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n-_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const\n-&refiner, StencilTable const *baseStencilTable, StencilTable const\n-*localPointStencilTable, bool factorize=true)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static StencilTable const * Create(int numTables, StencilTable const **tables)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Stencil table factory class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static LimitStencilTable const * Create(TopologyRefiner const &refiner,\n-LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0,\n-PatchTable const *patchTable=0, Options options=Options())\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+A simple reference to raw topology data for use with TopologyRefinerFactory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+FVarChannel const * fvarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int numVertices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * cornerVertexIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n+Index const * vertIndicesPerFace\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\be_\bx_\bP_\ba_\bi_\br_\bs\n+Index const * creaseVertexIndexPairs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bh_\bo_\bl_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * holeIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\ba_\bc_\be_\bs\n+int numFaces\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\bo_\br_\bn_\be_\br_\bs\n+int numCorners\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\bo_\br_\bn_\be_\br_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+float const * cornerWeights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bi_\bs_\bL_\be_\bf_\bt_\bH_\ba_\bn_\bd_\be_\bd\n+bool isLeftHanded\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bV_\be_\br_\bt_\bs_\bP_\be_\br_\bF_\ba_\bc_\be\n+int const * numVertsPerFace\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+TopologyDescriptor()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bc_\br_\be_\ba_\bs_\be_\bW_\be_\bi_\bg_\bh_\bt_\bs\n+float const * creaseWeights\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bC_\br_\be_\ba_\bs_\be_\bs\n+int numCreases\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bH_\bo_\bl_\be_\bs\n+int numHoles\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int numFVarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n+_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+FVarChannel()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:\n+_\bv_\ba_\bl_\bu_\be_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index const * valueIndices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\b:_\b:_\bn_\bu_\bm_\bV_\ba_\bl_\bu_\be_\bs\n+int numValues\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the relationships between vertices, faces, etc. ie the face-vertices,\n+vertex-faces,...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bp_\bo_\br_\bt_\bI_\bn_\bv_\ba_\bl_\bi_\bd_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static void reportInvalidTopology(TopologyError errCode, char const *msg, MESH\n+const &mesh)\n+(Optional) Control run-time topology validation and error reporting\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\ba_\bg_\bs\n+static bool assignComponentTags(TopologyRefiner &newRefiner, MESH const &mesh)\n+(Optional) Specify edge or vertex sharpness or face holes\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\br_\be_\bs_\bi_\bz_\be_\bC_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool resizeComponentTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+Specify the number of vertices, faces, face-vertices, etc.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by\n+static bool assignFaceVaryingTopology(TopologyRefiner &newRefiner, MESH const\n+&mesh)\n+(Optional) Specify face-varying data per face\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b7_\b4\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00719.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00719.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTable.h File Reference\n+OpenSubdiv: opensubdiv/far/stencilTableFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,51 +90,43 @@\n \n \n \n
\n \n-
stencilTable.h File Reference
\n+
stencilTableFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/types.h"
\n-#include <cassert>
\n-#include <cstring>
\n+#include "../far/patchTable.h"
\n #include <vector>
\n-#include <iostream>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  StencilReal< REAL >
 Vertex stencil descriptor. More...
class  StencilTableFactoryReal< REAL >
 A specialized factory for StencilTable. More...
 
class  Stencil
 Vertex stencil class wrapping the template for compatibility. More...
struct  StencilTableFactoryReal< REAL >::Options
 
class  StencilTableReal< REAL >
 Table of subdivision stencils. More...
class  LimitStencilTableFactoryReal< REAL >
 A specialized factory for LimitStencilTable. More...
 
class  StencilTable
 Stencil table class wrapping the template for compatibility. More...
struct  LimitStencilTableFactoryReal< REAL >::Options
 
class  LimitStencilReal< REAL >
 Limit point stencil descriptor. More...
struct  LimitStencilTableFactoryReal< REAL >::LocationArray
 Descriptor for limit surface locations. More...
 
class  LimitStencil
 Limit point stencil class wrapping the template for compatibility. More...
class  StencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
class  LimitStencilTableReal< REAL >
 Table of limit subdivision stencils. More...
 
class  LimitStencilTable
 Limit stencil table class wrapping the template for compatibility. More...
class  LimitStencilTableFactory
 Stencil table factory class wrapping the template for compatibility. More...
 
\n \n \n \n \n@@ -143,13 +135,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,51 +1,43 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-stencilTable.h File Reference\n+stencilTableFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n #include \n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Vertex stencil descriptor. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 A specialized factory for _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl\n-\u00a0 Vertex stencil class wrapping the template for compatibility. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n \u00a0\n-class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Table of subdivision stencils. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 A specialized factory for _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table class wrapping the template for compatibility. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n \u00a0\n-class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Limit point stencil descriptor. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+\u00a0 Descriptor for limit surface locations. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-\u00a0 Limit point stencil class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Table of limit subdivision stencils. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 Limit stencil table class wrapping the template for compatibility.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 _\bS_\bt_\be_\bn_\bc_\bi_\bl table factory class wrapping the template for compatibility.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00719.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00719.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,9 @@\n var a00719 = [\n- [\"StencilReal< REAL >\", \"a01053.html\", \"a01053\"],\n- [\"Stencil\", \"a01057.html\", \"a01057\"],\n- [\"StencilTableReal< REAL >\", \"a01061.html\", \"a01061\"],\n- [\"StencilTable\", \"a01065.html\", \"a01065\"],\n- [\"LimitStencilReal< REAL >\", \"a01069.html\", \"a01069\"],\n- [\"LimitStencil\", \"a01073.html\", \"a01073\"],\n- [\"LimitStencilTableReal< REAL >\", \"a01077.html\", \"a01077\"],\n- [\"LimitStencilTable\", \"a01081.html\", \"a01081\"]\n+ [\"StencilTableFactoryReal< REAL >\", \"a01045.html\", \"a01045\"],\n+ [\"Options\", \"a01085.html\", \"a01085\"],\n+ [\"LimitStencilTableFactoryReal< REAL >\", \"a01049.html\", \"a01049\"],\n+ [\"Options\", \"a01089.html\", \"a01089\"],\n+ [\"LocationArray\", \"a01093.html\", \"a01093\"],\n+ [\"StencilTableFactory\", \"a01097.html\", null],\n+ [\"LimitStencilTableFactory\", \"a01101.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00719_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00719_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/stencilTable.h Source File\n+OpenSubdiv: opensubdiv/far/stencilTableFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
stencilTable.h
\n+
stencilTableFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,892 +119,357 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_H
\n-
26#define OPENSUBDIV3_FAR_STENCILTABLE_H
\n+
25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n+
26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../far/types.h"
\n+
30#include "../far/patchTable.h"
\n
31
\n-
32#include <cassert>
\n-
33#include <cstring>
\n-
34#include <vector>
\n-
35#include <iostream>
\n+
32#include <vector>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n
36
\n-
37namespace OpenSubdiv {
\n-
38namespace OPENSUBDIV_VERSION {
\n-
39
\n-
40namespace Far {
\n-
41
\n-
42// Forward declarations for friends:
\n-
43class PatchTableBuilder;
\n-
44
\n-
45template <typename REAL> class StencilTableFactoryReal;
\n-
46template <typename REAL> class LimitStencilTableFactoryReal;
\n+
37namespace Far {
\n+
38
\n+
39class TopologyRefiner;
\n+
40
\n+
41template <typename REAL> class StencilReal;
\n+
42template <typename REAL> class StencilTableReal;
\n+
43
\n+
44template <typename REAL> class LimitStencilReal;
\n+
45template <typename REAL> class LimitStencilTableReal;
\n+
46
\n
47
\n-
52template <typename REAL>
\n-
\n-\n-
54public:
\n-
55
\n-\n-
58
\n-
\n-
67 StencilReal(int * size, Index * indices, REAL * weights)
\n-
68 : _size(size), _indices(indices), _weights(weights) { }
\n-
\n-
69
\n-
\n-
71 StencilReal(StencilReal const & other) {
\n-
72 _size = other._size;
\n-
73 _indices = other._indices;
\n-
74 _weights = other._weights;
\n-
75 }
\n-
\n-
76
\n-
\n-
78 int GetSize() const {
\n-
79 return *_size;
\n-
80 }
\n-
\n-
81
\n-
\n-
83 int * GetSizePtr() const {
\n-
84 return _size;
\n-
85 }
\n-
\n-
86
\n-
\n-
88 Index const * GetVertexIndices() const {
\n-
89 return _indices;
\n-
90 }
\n-
\n-
91
\n-
\n-
93 REAL const * GetWeights() const {
\n-
94 return _weights;
\n-
95 }
\n-
\n+
50template <typename REAL>
\n+
\n+\n+
52
\n+
53public:
\n+
54
\n+\n+
60
\n+
\n+
61 struct Options {
\n+
62
\n+\n+
70
\n+
71 unsigned int interpolationMode : 2,
\n+\n+\n+\n+\n+\n+
79 unsigned int fvarChannel;
\n+
81 };
\n+
\n+
82
\n+\n+
95 TopologyRefiner const & refiner, Options options = Options());
\n
96
\n-
98 void Next() {
\n-
99 int stride = *_size;
\n-
100 ++_size;
\n-
101 _indices += stride;
\n-
102 _weights += stride;
\n-
103 }
\n-
104
\n-
105protected:
\n-
106 friend class StencilTableFactoryReal<REAL>;
\n-
107 friend class LimitStencilTableFactoryReal<REAL>;
\n-
108
\n-
109 int * _size;
\n-\n-
111 REAL * _weights;
\n-
112};
\n-
\n+
97
\n+\n+
111 int numTables, StencilTableReal<REAL> const ** tables);
\n+
112
\n
113
\n-
\n-
116class Stencil : public StencilReal<float> {
\n-
117protected:
\n-\n-
119
\n-
120public:
\n-\n-
122 Stencil(BaseStencil const & other) : BaseStencil(other) { }
\n-
\n-
123 Stencil(int * size, Index * indices, float * weights)
\n-
124 : BaseStencil(size, indices, weights) { }
\n-
\n-
125};
\n-
\n-
126
\n-
127
\n-
140template <typename REAL>
\n-
\n-\n-
142protected:
\n-
143 StencilTableReal(int numControlVerts,
\n-
144 std::vector<int> const& offsets,
\n-
145 std::vector<int> const& sizes,
\n-
146 std::vector<int> const& sources,
\n-
147 std::vector<REAL> const& weights,
\n-
148 bool includeCoarseVerts,
\n-
149 size_t firstOffset);
\n-
150
\n-
151public:
\n-
152
\n-
153 virtual ~StencilTableReal() {};
\n-
154
\n-
\n-
156 int GetNumStencils() const {
\n-
157 return (int)_sizes.size();
\n-
158 }
\n-
\n-
159
\n-
\n-\n-
162 return _numControlVertices;
\n-
163 }
\n-
\n-
164
\n-
\n-\n-
167
\n-
\n-
169 std::vector<int> const & GetSizes() const {
\n-
170 return _sizes;
\n-
171 }
\n-
\n-
172
\n-
\n-
174 std::vector<Index> const & GetOffsets() const {
\n-
175 return _offsets;
\n-
176 }
\n-
\n-
177
\n-
\n-
179 std::vector<Index> const & GetControlIndices() const {
\n-
180 return _indices;
\n-
181 }
\n-
\n+\n+
129 TopologyRefiner const &refiner,
\n+
130 StencilTableReal<REAL> const *baseStencilTable,
\n+
131 StencilTableReal<REAL> const *localPointStencilTable,
\n+
132 bool factorize = true);
\n+
133
\n+
\n+\n+
149 TopologyRefiner const &refiner,
\n+
150 StencilTableReal<REAL> const *baseStencilTable,
\n+
151 StencilTableReal<REAL> const *localPointStencilTable,
\n+
152 bool factorize = true) {
\n+\n+
154 refiner, baseStencilTable, localPointStencilTable, factorize);
\n+
155 }
\n+
\n+
156
\n+\n+
175 TopologyRefiner const &refiner,
\n+
176 StencilTableReal<REAL> const *baseStencilTable,
\n+
177 StencilTableReal<REAL> const *localPointStencilTable,
\n+
178 int channel = 0,
\n+
179 bool factorize = true);
\n+
180
\n+
181private:
\n
182
\n-
\n-
184 std::vector<REAL> const & GetWeights() const {
\n-
185 return _weights;
\n-
186 }
\n-
\n+
183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)
\n+
184 static void generateControlVertStencils(
\n+
185 int numControlVerts,
\n+
186 StencilReal<REAL> & dst);
\n
187
\n-
\n-\n-
190
\n-
204 template <class T, class U>
\n-
\n-
205 void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-1) const {
\n-
206 this->update(srcValues, dstValues, _weights, start, end);
\n-
207 }
\n-
\n-
208
\n-
209 template <class T1, class T2, class U>
\n-
\n-
210 void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef,
\n-
211 U &dstValues, Index start=-1, Index end=-1) const {
\n-
212 this->update(srcBase, numBase, srcRef, dstValues, _weights, start, end);
\n-
213 }
\n-
\n-
214
\n-
215 // Pointer interface for backward compatibility
\n-
216 template <class T, class U>
\n-
\n-
217 void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const {
\n-
218 this->update(src, dst, _weights, start, end);
\n-
219 }
\n-
\n-
220 template <class T1, class T2, class U>
\n+
188 // Internal method to splice local point stencils
\n+
189 static StencilTableReal<REAL> const * appendLocalPointStencilTable(
\n+
190 TopologyRefiner const &refiner,
\n+
191 StencilTableReal<REAL> const * baseStencilTable,
\n+
192 StencilTableReal<REAL> const * localPointStencilTable,
\n+
193 int channel,
\n+
194 bool factorize);
\n+
195};
\n+
\n+
196
\n+
208template <typename REAL>
\n+
\n+\n+
210
\n+
211public:
\n+
212
\n+\n+
218
\n+
\n+
219 struct Options {
\n+
220
\n
\n-
221 void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef,
\n-
222 U *dst, Index start=-1, Index end=-1) const {
\n-
223 this->update(srcBase, numBase, srcRef, dst, _weights, start, end);
\n-
224 }
\n+\n+\n+\n+
224 fvarChannel(0) { }
\n
\n
225
\n-
227 void Clear();
\n-
228
\n-
229protected:
\n-
230
\n-
231 // Update values by applying cached stencil weights to new control values
\n-
232 template <class T, class U>
\n-
\n-
233 void update( T const &srcValues, U &dstValues,
\n-
234 std::vector<REAL> const & valueWeights, Index start, Index end) const;
\n-
235 template <class T1, class T2, class U>
\n-
\n-
236 void update( T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues,
\n-
237 std::vector<REAL> const & valueWeights, Index start, Index end) const;
\n-
238
\n-
239 // Populate the offsets table from the stencil sizes in _sizes (factory helper)
\n-
\n-\n-
241
\n-
242 // Resize the table arrays (factory helper)
\n-
\n-
243 void resize(int nstencils, int nelems);
\n-
244
\n-
245 // Reserves the table arrays (factory helper)
\n-
\n-
246 void reserve(int nstencils, int nelems);
\n-
247
\n-
248 // Reallocates the table arrays to remove excess capacity (factory helper)
\n-
\n-\n-
250
\n-
251 // Performs any final operations on internal tables (factory helper)
\n-
\n-
252 void finalize();
\n-
253
\n-
254protected:
\n-\n-
256 StencilTableReal(int numControlVerts)
\n-
257 : _numControlVertices(numControlVerts)
\n-
258 { }
\n-
259
\n-
260 friend class StencilTableFactoryReal<REAL>;
\n-\n-
262
\n-
263 int _numControlVertices; // number of control vertices
\n-
264
\n-
265 std::vector<int> _sizes; // number of coefficients for each stencil
\n-
266 std::vector<Index> _offsets, // offset to the start of each stencil
\n-
267 _indices; // indices of contributing coarse vertices
\n-
268 std::vector<REAL> _weights; // stencil weight coefficients
\n-
269};
\n-
270
\n-
\n-
273class StencilTable : public StencilTableReal<float> {
\n-
274protected:
\n-\n-
276
\n-
277public:
\n-
\n-
278 Stencil GetStencil(Index index) const {
\n-
279 return Stencil(BaseTable::GetStencil(index));
\n-
280 }
\n-
\n-
\n-
281 Stencil operator[] (Index index) const {
\n-
282 return Stencil(BaseTable::GetStencil(index));
\n-
283 }
\n-
\n+
226 unsigned int interpolationMode : 2,
\n+\n+\n+
229 unsigned int fvarChannel;
\n+
230 };
\n+
\n+
231
\n+
\n+\n+
234
\n+
235 LocationArray() : ptexIdx(-1), numLocations(0), s(0), t(0) { }
\n+
236
\n+\n+\n+
239
\n+
240 REAL const * s,
\n+
241 * t;
\n+
242 };
\n+
\n+
243
\n+
244 typedef std::vector<LocationArray> LocationArrayVec;
\n+
245
\n+\n+
270 TopologyRefiner const & refiner,
\n+
271 LocationArrayVec const & locationArrays,
\n+
272 StencilTableReal<REAL> const * cvStencils = 0,
\n+
273 PatchTable const * patchTable = 0,
\n+
274 Options options = Options());
\n+
275
\n+
276};
\n+
\n+
277
\n+
278
\n+
279//
\n+
280// Public wrapper classes for the templates
\n+
281//
\n+
282class Stencil;
\n+
283class StencilTable;
\n
284
\n-
285protected:
\n-\n-
287 StencilTable(int numControlVerts) : BaseTable(numControlVerts) { }
\n-
\n-
288 StencilTable(int numControlVerts,
\n-
289 std::vector<int> const& offsets,
\n-
290 std::vector<int> const& sizes,
\n-
291 std::vector<int> const& sources,
\n-
292 std::vector<float> const& weights,
\n-
293 bool includeCoarseVerts,
\n-
294 size_t firstOffset)
\n-
295 : BaseTable(numControlVerts, offsets,
\n-
296 sizes, sources, weights, includeCoarseVerts, firstOffset) { }
\n-
\n-
297};
\n+
\n+\n+
288private:
\n+\n+\n+
291
\n+
292public:
\n+
\n+
293 static StencilTable const * Create(
\n+
294 TopologyRefiner const & refiner, Options options = Options()) {
\n+
295
\n+
296 return static_cast<StencilTable const *>(
\n+
297 BaseFactory::Create(refiner, options));
\n+
298 }
\n
\n-
298
\n
299
\n-
302template <typename REAL>
\n-
\n-
303class LimitStencilReal : public StencilReal<REAL> {
\n-
304public:
\n-
305
\n-
\n-\n-
325 Index * indices,
\n-
326 REAL * weights,
\n-
327 REAL * duWeights=0,
\n-
328 REAL * dvWeights=0,
\n-
329 REAL * duuWeights=0,
\n-
330 REAL * duvWeights=0,
\n-
331 REAL * dvvWeights=0)
\n-
332 : StencilReal<REAL>(size, indices, weights),
\n-
333 _duWeights(duWeights),
\n-
334 _dvWeights(dvWeights),
\n-
335 _duuWeights(duuWeights),
\n-
336 _duvWeights(duvWeights),
\n-
337 _dvvWeights(dvvWeights) {
\n-
338 }
\n-
\n-
339
\n-
\n-
341 REAL const * GetDuWeights() const {
\n-
342 return _duWeights;
\n-
343 }
\n-
\n-
344
\n-
\n-
346 REAL const * GetDvWeights() const {
\n-
347 return _dvWeights;
\n-
348 }
\n-
\n-
349
\n-
\n-
351 REAL const * GetDuuWeights() const {
\n-
352 return _duuWeights;
\n-
353 }
\n-
\n-
354
\n-
\n-
356 REAL const * GetDuvWeights() const {
\n-
357 return _duvWeights;
\n-
358 }
\n-
\n-
359
\n-
\n-
361 REAL const * GetDvvWeights() const {
\n-
362 return _dvvWeights;
\n-
363 }
\n-
\n-
364
\n-
366 void Next() {
\n-
367 int stride = *this->_size;
\n-
368 ++this->_size;
\n-
369 this->_indices += stride;
\n-
370 this->_weights += stride;
\n-
371 if (_duWeights) _duWeights += stride;
\n-
372 if (_dvWeights) _dvWeights += stride;
\n-
373 if (_duuWeights) _duuWeights += stride;
\n-
374 if (_duvWeights) _duvWeights += stride;
\n-
375 if (_dvvWeights) _dvvWeights += stride;
\n-
376 }
\n-
377
\n-
378private:
\n-
379
\n-
380 friend class StencilTableFactoryReal<REAL>;
\n-
381 friend class LimitStencilTableFactoryReal<REAL>;
\n-
382
\n-
383 REAL * _duWeights, // pointer to stencil u derivative limit weights
\n-
384 * _dvWeights, // pointer to stencil v derivative limit weights
\n-
385 * _duuWeights, // pointer to stencil uu derivative limit weights
\n-
386 * _duvWeights, // pointer to stencil uv derivative limit weights
\n-
387 * _dvvWeights; // pointer to stencil vv derivative limit weights
\n-
388};
\n-
\n-
389
\n-
\n-
392class LimitStencil : public LimitStencilReal<float> {
\n-
393protected:
\n-\n-
395
\n-
396public:
\n-
397 LimitStencil(BaseStencil const & other) : BaseStencil(other) { }
\n-
\n-
398 LimitStencil(int* size, Index * indices, float * weights,
\n-
399 float * duWeights=0, float * dvWeights=0,
\n-
400 float * duuWeights=0, float * duvWeights=0, float * dvvWeights=0)
\n-
401 : BaseStencil(size, indices, weights,
\n-
402 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights) { }
\n-
\n-
403};
\n-
\n-
404
\n-
405
\n-
408template <typename REAL>
\n-
\n-\n-
410protected:
\n-\n-
412 int numControlVerts,
\n-
413 std::vector<int> const& offsets,
\n-
414 std::vector<int> const& sizes,
\n-
415 std::vector<int> const& sources,
\n-
416 std::vector<REAL> const& weights,
\n-
417 std::vector<REAL> const& duWeights,
\n-
418 std::vector<REAL> const& dvWeights,
\n-
419 std::vector<REAL> const& duuWeights,
\n-
420 std::vector<REAL> const& duvWeights,
\n-
421 std::vector<REAL> const& dvvWeights,
\n-
422 bool includeCoarseVerts,
\n-
423 size_t firstOffset);
\n-
424
\n-
425public:
\n-
426
\n-
\n-\n-
429
\n-
\n-\n-
432
\n-
\n-
434 std::vector<REAL> const & GetDuWeights() const {
\n-
435 return _duWeights;
\n-
436 }
\n-
\n-
437
\n-
\n-
439 std::vector<REAL> const & GetDvWeights() const {
\n-
440 return _dvWeights;
\n-
441 }
\n-
\n-
442
\n-
\n-
444 std::vector<REAL> const & GetDuuWeights() const {
\n-
445 return _duuWeights;
\n-
446 }
\n-
\n-
447
\n-
\n-
449 std::vector<REAL> const & GetDuvWeights() const {
\n-
450 return _duvWeights;
\n-
451 }
\n-
\n-
452
\n-
\n-
454 std::vector<REAL> const & GetDvvWeights() const {
\n-
455 return _dvvWeights;
\n-
456 }
\n-
\n-
457
\n-
475 template <class T, class U>
\n-
\n-
476 void UpdateDerivs(T const & srcValues, U & uderivs, U & vderivs,
\n-
477 int start=-1, int end=-1) const {
\n-
478
\n-
479 this->update(srcValues, uderivs, _duWeights, start, end);
\n-
480 this->update(srcValues, vderivs, _dvWeights, start, end);
\n-
481 }
\n-
\n-
482
\n-
483 template <class T1, class T2, class U>
\n-
\n-
484 void UpdateDerivs(T1 const & srcBase, int numBase, T2 const & srcRef,
\n-
485 U & uderivs, U & vderivs, int start=-1, int end=-1) const {
\n-
486
\n-
487 this->update(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);
\n-
488 this->update(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);
\n-
489 }
\n-
\n-
490
\n-
491 // Pointer interface for backward compatibility
\n-
492 template <class T, class U>
\n-
\n-
493 void UpdateDerivs(T const *src, U *uderivs, U *vderivs,
\n-
494 int start=-1, int end=-1) const {
\n-
495
\n-
496 this->update(src, uderivs, _duWeights, start, end);
\n-
497 this->update(src, vderivs, _dvWeights, start, end);
\n-
498 }
\n-
\n-
499 template <class T1, class T2, class U>
\n-
\n-
500 void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef,
\n-
501 U *uderivs, U *vderivs, int start=-1, int end=-1) const {
\n-
502
\n-
503 this->update(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);
\n-
504 this->update(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);
\n-
505 }
\n-
\n-
506
\n-
527 template <class T, class U>
\n-
\n-
528 void Update2ndDerivs(T const & srcValues,
\n-
529 U & uuderivs, U & uvderivs, U & vvderivs,
\n-
530 int start=-1, int end=-1) const {
\n-
531
\n-
532 this->update(srcValues, uuderivs, _duuWeights, start, end);
\n-
533 this->update(srcValues, uvderivs, _duvWeights, start, end);
\n-
534 this->update(srcValues, vvderivs, _dvvWeights, start, end);
\n-
535 }
\n-
\n-
536
\n-
537 template <class T1, class T2, class U>
\n-
\n-
538 void Update2ndDerivs(T1 const & srcBase, int numBase, T2 const & srcRef,
\n-
539 U & uuderivs, U & uvderivs, U & vvderivs, int start=-1, int end=-1) const {
\n-
540
\n-
541 this->update(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);
\n-
542 this->update(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);
\n-
543 this->update(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);
\n-
544 }
\n-
\n-
545
\n-
546 // Pointer interface for backward compatibility
\n-
547 template <class T, class U>
\n-
\n-
548 void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs,
\n-
549 int start=-1, int end=-1) const {
\n-
550
\n-
551 this->update(src, uuderivs, _duuWeights, start, end);
\n-
552 this->update(src, uvderivs, _duvWeights, start, end);
\n-
553 this->update(src, vvderivs, _dvvWeights, start, end);
\n-
554 }
\n-
\n-
555 template <class T1, class T2, class U>
\n-
\n-
556 void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef,
\n-
557 U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const {
\n-
558
\n-
559 this->update(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);
\n-
560 this->update(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);
\n-
561 this->update(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);
\n-
562 }
\n-
\n-
563
\n-
565 void Clear();
\n-
566
\n-
567private:
\n-
568 friend class LimitStencilTableFactoryReal<REAL>;
\n-
569
\n-
570 // Resize the table arrays (factory helper)
\n-
571 void resize(int nstencils, int nelems);
\n-
572
\n-
573private:
\n-
574 std::vector<REAL> _duWeights, // u derivative limit stencil weights
\n-
575 _dvWeights, // v derivative limit stencil weights
\n-
576 _duuWeights, // uu derivative limit stencil weights
\n-
577 _duvWeights, // uv derivative limit stencil weights
\n-
578 _dvvWeights; // vv derivative limit stencil weights
\n-
579};
\n-
580
\n-
\n-\n-
584protected:
\n-\n-
586
\n-
587public:
\n-
\n-\n-\n-
590 }
\n-
\n-
\n-\n-\n-
593 }
\n-
\n-
594
\n-
595protected:
\n-
\n-
596 LimitStencilTable(int numControlVerts,
\n-
597 std::vector<int> const& offsets,
\n-
598 std::vector<int> const& sizes,
\n-
599 std::vector<int> const& sources,
\n-
600 std::vector<float> const& weights,
\n-
601 std::vector<float> const& duWeights,
\n-
602 std::vector<float> const& dvWeights,
\n-
603 std::vector<float> const& duuWeights,
\n-
604 std::vector<float> const& duvWeights,
\n-
605 std::vector<float> const& dvvWeights,
\n-
606 bool includeCoarseVerts,
\n-
607 size_t firstOffset)
\n-
608 : BaseTable(numControlVerts,
\n-
609 offsets, sizes, sources, weights,
\n-
610 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights,
\n-
611 includeCoarseVerts, firstOffset) { }
\n-
\n-
612};
\n-
\n-
613
\n-
614
\n-
615// Update values by applying cached stencil weights to new control values
\n-
616template <typename REAL>
\n-
617template <class T1, class T2, class U> void
\n-
\n-
618StencilTableReal<REAL>::update(T1 const &srcBase, int numBase,
\n-
619 T2 const &srcRef, U &dstValues,
\n-
620 std::vector<REAL> const &valueWeights, Index start, Index end) const {
\n-
621
\n-
622 int const * sizes = &_sizes.at(0);
\n-
623 Index const * indices = &_indices.at(0);
\n-
624 REAL const * weights = &valueWeights.at(0);
\n-
625
\n-
626 if (start > 0) {
\n-
627 assert(start < (Index)_offsets.size());
\n-
628 sizes += start;
\n-
629 indices += _offsets[start];
\n-
630 weights += _offsets[start];
\n-
631 } else {
\n-
632 start = 0;
\n-
633 }
\n-
634
\n-
635 int nstencils = ((end < start) ? GetNumStencils() : end) - start;
\n-
636
\n-
637 for (int i = 0; i < nstencils; ++i, ++sizes) {
\n-
638 dstValues[start + i].Clear();
\n-
639 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {
\n-
640 if (*indices < numBase) {
\n-
641 dstValues[start + i].AddWithWeight(srcBase[*indices], *weights);
\n-
642 } else {
\n-
643 dstValues[start + i].AddWithWeight(srcRef[*indices - numBase], *weights);
\n-
644 }
\n-
645 }
\n-
646 }
\n-
647}
\n-
\n-
648template <typename REAL>
\n-
649template <class T, class U> void
\n-
\n-
650StencilTableReal<REAL>::update(T const &srcValues, U &dstValues,
\n-
651 std::vector<REAL> const &valueWeights, Index start, Index end) const {
\n-
652
\n-
653 int const * sizes = &_sizes.at(0);
\n-
654 Index const * indices = &_indices.at(0);
\n-
655 REAL const * weights = &valueWeights.at(0);
\n-
656
\n-
657 if (start > 0) {
\n-
658 assert(start < (Index)_offsets.size());
\n-
659 sizes += start;
\n-
660 indices += _offsets[start];
\n-
661 weights += _offsets[start];
\n-
662 } else {
\n-
663 start = 0;
\n-
664 }
\n-
665
\n-
666 int nstencils = ((end < start) ? GetNumStencils() : end) - start;
\n-
667
\n-
668 for (int i = 0; i < nstencils; ++i, ++sizes) {
\n-
669 dstValues[start + i].Clear();
\n-
670 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {
\n-
671 dstValues[start + i].AddWithWeight(srcValues[*indices], *weights);
\n-
672 }
\n-
673 }
\n-
674}
\n-
\n-
675
\n-
676template <typename REAL>
\n-
677inline void
\n-
\n-\n-
679 Index offset=0;
\n-
680 int noffsets = (int)_sizes.size();
\n-
681 _offsets.resize(noffsets);
\n-
682 for (int i=0; i<(int)_sizes.size(); ++i ) {
\n-
683 _offsets[i]=offset;
\n-
684 offset+=_sizes[i];
\n-
685 }
\n-
686}
\n-
\n-
687
\n-
688template <typename REAL>
\n-
689inline void
\n-
\n-
690StencilTableReal<REAL>::resize(int nstencils, int nelems) {
\n-
691 _sizes.resize(nstencils);
\n-
692 _indices.resize(nelems);
\n-
693 _weights.resize(nelems);
\n-
694}
\n-
\n-
695
\n-
696template <typename REAL>
\n-
697inline void
\n-
\n-
698StencilTableReal<REAL>::reserve(int nstencils, int nelems) {
\n-
699 _sizes.reserve(nstencils);
\n-
700 _indices.reserve(nelems);
\n-
701 _weights.reserve(nelems);
\n-
702}
\n-
\n-
703
\n-
704template <typename REAL>
\n-
705inline void
\n-
\n-\n-
707 std::vector<int>(_sizes).swap(_sizes);
\n-
708 std::vector<Index>(_indices).swap(_indices);
\n-
709 std::vector<REAL>(_weights).swap(_weights);
\n-
710}
\n-
\n-
711
\n-
712template <typename REAL>
\n-
713inline void
\n-
\n-\n-
715 shrinkToFit();
\n-
716 generateOffsets();
\n-
717}
\n-
\n-
718
\n-
719// Returns a Stencil at index i in the table
\n-
720template <typename REAL>
\n-\n-
\n-\n-
723 assert((! _offsets.empty()) && i<(int)_offsets.size());
\n-
724
\n-
725 Index ofs = _offsets[i];
\n-
726
\n-
727 return StencilReal<REAL>(const_cast<int*>(&_sizes[i]),
\n-
728 const_cast<Index*>(&_indices[ofs]),
\n-
729 const_cast<REAL*>(&_weights[ofs]));
\n-
730}
\n-
\n-
731
\n-
732template <typename REAL>
\n-\n-
\n-\n-
735 return GetStencil(index);
\n-
736}
\n-
\n-
737
\n-
738template <typename REAL>
\n-
739inline void
\n-
740LimitStencilTableReal<REAL>::resize(int nstencils, int nelems) {
\n-
741 StencilTableReal<REAL>::resize(nstencils, nelems);
\n-
742 _duWeights.resize(nelems);
\n-
743 _dvWeights.resize(nelems);
\n-
744}
\n-
745
\n-
746// Returns a LimitStencil at index i in the table
\n-
747template <typename REAL>
\n-
748inline LimitStencilReal<REAL>
\n-
\n-\n-
750 assert((! this->GetOffsets().empty()) && i<(int)this->GetOffsets().size());
\n-
751
\n-
752 Index ofs = this->GetOffsets()[i];
\n-
753
\n-
754 if (!_duWeights.empty() && !_dvWeights.empty() &&
\n-
755 !_duuWeights.empty() && !_duvWeights.empty() && !_dvvWeights.empty()) {
\n-\n-
757 const_cast<int *>(&this->GetSizes()[i]),
\n-
758 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n-
759 const_cast<REAL *>(&this->GetWeights()[ofs]),
\n-
760 const_cast<REAL *>(&GetDuWeights()[ofs]),
\n-
761 const_cast<REAL *>(&GetDvWeights()[ofs]),
\n-
762 const_cast<REAL *>(&GetDuuWeights()[ofs]),
\n-
763 const_cast<REAL *>(&GetDuvWeights()[ofs]),
\n-
764 const_cast<REAL *>(&GetDvvWeights()[ofs]) );
\n-
765 } else if (!_duWeights.empty() && !_dvWeights.empty()) {
\n-\n-
767 const_cast<int *>(&this->GetSizes()[i]),
\n-
768 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n-
769 const_cast<REAL *>(&this->GetWeights()[ofs]),
\n-
770 const_cast<REAL *>(&GetDuWeights()[ofs]),
\n-
771 const_cast<REAL *>(&GetDvWeights()[ofs]) );
\n-
772 } else {
\n-\n-
774 const_cast<int *>(&this->GetSizes()[i]),
\n-
775 const_cast<Index *>(&this->GetControlIndices()[ofs]),
\n-
776 const_cast<REAL *>(&this->GetWeights()[ofs]) );
\n-
777 }
\n-
778}
\n-
\n-
779
\n-
780template <typename REAL>
\n-\n-
\n-\n-
783 return GetLimitStencil(index);
\n-
784}
\n-
\n-
\n-
785
\n-
786} // end namespace Far
\n-
787
\n-
788} // end namespace OPENSUBDIV_VERSION
\n-
789using namespace OPENSUBDIV_VERSION;
\n-
790
\n-
791} // end namespace OpenSubdiv
\n-
792
\n-
793#endif // OPENSUBDIV3_FAR_STENCILTABLE_H
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
300 static StencilTable const * Create(
\n+
301 int numTables, StencilTable const ** tables) {
\n+
302
\n+
303 return static_cast<StencilTable const *>(
\n+
304 BaseFactory::Create(numTables,
\n+
305 reinterpret_cast<BaseTable const **>(tables)));
\n+
306 }
\n+
\n+
307
\n+
\n+\n+
309 TopologyRefiner const &refiner,
\n+
310 StencilTable const *baseStencilTable,
\n+
311 StencilTable const *localPointStencilTable,
\n+
312 bool factorize = true) {
\n+
313
\n+
314 return static_cast<StencilTable const *>(
\n+\n+
316 static_cast<BaseTable const *>(baseStencilTable),
\n+
317 static_cast<BaseTable const *>(localPointStencilTable),
\n+
318 factorize));
\n+
319 }
\n+
\n+
320
\n+
\n+\n+
322 TopologyRefiner const &refiner,
\n+
323 StencilTable const *baseStencilTable,
\n+
324 StencilTable const *localPointStencilTable,
\n+
325 bool factorize = true) {
\n+
326
\n+
327 return static_cast<StencilTable const *>(
\n+\n+
329 static_cast<BaseTable const *>(baseStencilTable),
\n+
330 static_cast<BaseTable const *>(localPointStencilTable),
\n+
331 factorize));
\n+
332 }
\n+
\n+
333
\n+
\n+\n+
335 TopologyRefiner const &refiner,
\n+
336 StencilTable const *baseStencilTable,
\n+
337 StencilTable const *localPointStencilTable,
\n+
338 int channel = 0,
\n+
339 bool factorize = true) {
\n+
340
\n+
341 return static_cast<StencilTable const *>(
\n+\n+
343 static_cast<BaseTable const *>(baseStencilTable),
\n+
344 static_cast<BaseTable const *>(localPointStencilTable),
\n+
345 channel, factorize));
\n+
346 }
\n+
\n+
347};
\n+
\n+
348
\n+
349class LimitStencil;
\n+
350class LimitStencilTable;
\n+
351
\n+
\n+\n+
355private:
\n+\n+\n+
358
\n+
359public:
\n+
\n+
360 static LimitStencilTable const * Create(
\n+
361 TopologyRefiner const & refiner,
\n+
362 LocationArrayVec const & locationArrays,
\n+
363 StencilTable const * cvStencils = 0,
\n+
364 PatchTable const * patchTable = 0,
\n+
365 Options options = Options()) {
\n+
366
\n+
367 return static_cast<LimitStencilTable const *>(
\n+\n+
369 refiner,
\n+
370 locationArrays,
\n+
371 static_cast<BaseTable const *>(cvStencils),
\n+
372 patchTable,
\n+
373 options));
\n+
374 }
\n+
\n+
375};
\n+
\n+
376
\n+
377} // end namespace Far
\n+
378
\n+
379} // end namespace OPENSUBDIV_VERSION
\n+
380using namespace OPENSUBDIV_VERSION;
\n+
381
\n+
382} // end namespace OpenSubdiv
\n+
383
\n+
384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H
\n \n-\n-\n-\n-\n-\n-\n-
StencilReal(int *size, Index *indices, REAL *weights)
Constructor.
\n-
void Next()
Advance to the next stencil in the table.
\n-
StencilReal(StencilReal const &other)
Copy constructor.
\n-\n-
Index const * GetVertexIndices() const
Returns the control vertices' indices.
\n-
int GetSize() const
Returns the size of the stencil.
\n-\n-
int * GetSizePtr() const
Returns the size of the stencil as a pointer.
\n-
REAL const * GetWeights() const
Returns the interpolation weights.
\n-
Vertex stencil class wrapping the template for compatibility.
\n-\n-
Stencil(int *size, Index *indices, float *weights)
\n-\n-\n-\n-
int GetNumControlVertices() const
Returns the number of control vertices indexed in the table.
\n-\n-\n-
void update(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues, std::vector< REAL > const &valueWeights, Index start, Index end) const
\n-
void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues, Index start=-1, Index end=-1) const
\n-
std::vector< Index > const & GetControlIndices() const
Returns the indices of the control vertices.
\n-\n-
StencilReal< REAL > operator[](Index index) const
Returns the stencil at index i in the table.
\n-\n-
void update(T const &srcValues, U &dstValues, std::vector< REAL > const &valueWeights, Index start, Index end) const
\n-
std::vector< int > const & GetSizes() const
Returns the number of control vertices of each stencil in the table.
\n-
int GetNumStencils() const
Returns the number of stencils in the table.
\n-\n-
std::vector< Index > const & GetOffsets() const
Returns the offset to a given stencil (factory may leave empty)
\n-
StencilReal< REAL > GetStencil(Index i) const
Returns a Stencil at index i in the table.
\n-\n-\n-
void Clear()
Clears the stencils from the table.
\n-\n-\n-\n-
std::vector< REAL > const & GetWeights() const
Returns the stencil interpolation weights.
\n-
void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef, U *dst, Index start=-1, Index end=-1) const
\n-
StencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< REAL > const &weights, bool includeCoarseVerts, size_t firstOffset)
\n-\n-\n-\n-
void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const
\n-
void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-1) const
Updates point values based on the control values.
\n-
Stencil table class wrapping the template for compatibility.
\n-
StencilTable(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< float > const &weights, bool includeCoarseVerts, size_t firstOffset)
\n-\n-\n-\n-\n-\n-\n-
REAL const * GetDuvWeights() const
Returns the uv derivative weights.
\n-
REAL const * GetDvWeights() const
Returns the v derivative weights.
\n-
void Next()
Advance to the next stencil in the table.
\n-
REAL const * GetDvvWeights() const
Returns the vv derivative weights.
\n-
LimitStencilReal(int *size, Index *indices, REAL *weights, REAL *duWeights=0, REAL *dvWeights=0, REAL *duuWeights=0, REAL *duvWeights=0, REAL *dvvWeights=0)
Constructor.
\n-
REAL const * GetDuWeights() const
Returns the u derivative weights.
\n-
REAL const * GetDuuWeights() const
Returns the uu derivative weights.
\n-
Limit point stencil class wrapping the template for compatibility.
\n-\n-\n-
LimitStencil(int *size, Index *indices, float *weights, float *duWeights=0, float *dvWeights=0, float *duuWeights=0, float *duvWeights=0, float *dvvWeights=0)
\n-\n-
std::vector< REAL > const & GetDuuWeights() const
Returns the 'uu' derivative stencil interpolation weights.
\n-
LimitStencilReal< REAL > operator[](Index index) const
Returns the limit stencil at index i in the table.
\n-
std::vector< REAL > const & GetDvvWeights() const
Returns the 'vv' derivative stencil interpolation weights.
\n-
void UpdateDerivs(T const *src, U *uderivs, U *vderivs, int start=-1, int end=-1) const
\n-
void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const
\n-
std::vector< REAL > const & GetDvWeights() const
Returns the 'v' derivative stencil interpolation weights.
\n-
void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const
\n-
void UpdateDerivs(T const &srcValues, U &uderivs, U &vderivs, int start=-1, int end=-1) const
Updates derivative values based on the control values.
\n-
LimitStencilReal< REAL > GetLimitStencil(Index i) const
Returns a LimitStencil at index i in the table.
\n-
LimitStencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< REAL > const &weights, std::vector< REAL > const &duWeights, std::vector< REAL > const &dvWeights, std::vector< REAL > const &duuWeights, std::vector< REAL > const &duvWeights, std::vector< REAL > const &dvvWeights, bool includeCoarseVerts, size_t firstOffset)
\n-
void Update2ndDerivs(T const &srcValues, U &uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const
Updates 2nd derivative values based on the control values.
\n-
std::vector< REAL > const & GetDuWeights() const
Returns the 'u' derivative stencil interpolation weights.
\n-
void Clear()
Clears the stencils from the table.
\n-
void Update2ndDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const
\n-
std::vector< REAL > const & GetDuvWeights() const
Returns the 'uv' derivative stencil interpolation weights.
\n-
void UpdateDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uderivs, U &vderivs, int start=-1, int end=-1) const
\n-
void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uderivs, U *vderivs, int start=-1, int end=-1) const
\n-
Limit stencil table class wrapping the template for compatibility.
\n-\n-\n-
LimitStencilTable(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< float > const &weights, std::vector< float > const &duWeights, std::vector< float > const &dvWeights, std::vector< float > const &duuWeights, std::vector< float > const &duvWeights, std::vector< float > const &dvvWeights, bool includeCoarseVerts, size_t firstOffset)
\n-\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+
static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, Options options=Options())
Instantiates StencilTable from TopologyRefiner that have been refined uniformly or adaptively.
\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int channel=0, bool factorize=true)
Utility function for stencil splicing for local point face-varying stencils.
\n+\n+\n+\n+\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point varying stencils.
\n+
static StencilTableReal< REAL > const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTableReal< REAL > const *baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool factorize=true)
Utility function for stencil splicing for local point stencils.
\n+
static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal< REAL > const **tables)
Instantiates StencilTable by concatenating an array of existing stencil tables.
\n+\n+\n+\n+\n+\n+\n+
static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL > const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
Instantiates LimitStencilTable from a TopologyRefiner that has been refined either uniformly or adapt...
\n+\n+
Vertex stencil class wrapping the template for compatibility.
\n+\n+
Stencil table class wrapping the template for compatibility.
\n+\n+
Limit stencil table class wrapping the template for compatibility.
\n+\n+\n+\n+\n+
unsigned int generateIntermediateLevels
vertices at all levels or highest only
\n+
unsigned int generateControlVerts
generate stencils for control-vertices
\n+\n+\n+\n+\n+\n+\n+\n+
unsigned int generate2ndDerivatives
Generate weights for 2nd derivatives.
\n+
unsigned int generate1stDerivatives
Generate weights for 1st derivatives.
\n+\n+\n+\n+\n+\n+\n+
Stencil table factory class wrapping the template for compatibility.
\n+
static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n+
static StencilTable const * AppendLocalPointStencilTableFaceVarying(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)
\n+
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
static StencilTable const * Create(int numTables, StencilTable const **tables)
\n+
Stencil table factory class wrapping the template for compatibility.
\n+
static LimitStencilTable const * Create(TopologyRefiner const &refiner, LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())
\n+
Stores topology data for a specified set of refinement options.
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-stencilTable.h\n+stencilTableFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,990 +24,497 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_H\n-26#define OPENSUBDIV3_FAR_STENCILTABLE_H\n+25#ifndef OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n+26#define OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../far/types.h\"\n+30#include \"../far/patchTable.h\"\n 31\n-32#include \n-33#include \n-34#include \n-35#include \n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n 36\n-37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-38namespace OPENSUBDIV_VERSION {\n-39\n-40namespace Far {\n-41\n-42// Forward declarations for friends:\n-43class PatchTableBuilder;\n-44\n-45template class StencilTableFactoryReal;\n-46template class LimitStencilTableFactoryReal;\n+37namespace Far {\n+38\n+39class TopologyRefiner;\n+40\n+41template class StencilReal;\n+42template class StencilTableReal;\n+43\n+44template class LimitStencilReal;\n+45template class LimitStencilTableReal;\n+46\n 47\n-52template \n-_\b5_\b3class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n-54public:\n-55\n-_\b5_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl() {}\n-58\n-_\b6_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(int * size, _\bI_\bn_\bd_\be_\bx * indices, REAL * weights)\n-68 : _\b__\bs_\bi_\bz_\be(size), _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs(indices), _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs(weights) { }\n-69\n-_\b7_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl const & other) {\n-72 _\b__\bs_\bi_\bz_\be = other._\b__\bs_\bi_\bz_\be;\n-73 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs = other._\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n-74 _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs = other._\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n-75 }\n-76\n-_\b7_\b8 int _\bG_\be_\bt_\bS_\bi_\bz_\be() const {\n-79 return *_\b__\bs_\bi_\bz_\be;\n-80 }\n-81\n-_\b8_\b3 int * _\bG_\be_\bt_\bS_\bi_\bz_\be_\bP_\bt_\br() const {\n-84 return _\b__\bs_\bi_\bz_\be;\n-85 }\n-86\n-_\b8_\b8 _\bI_\bn_\bd_\be_\bx const * _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs() const {\n-89 return _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n-90 }\n-91\n-_\b9_\b3 REAL const * _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-94 return _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n-95 }\n+50template \n+_\b5_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+52\n+53public:\n+54\n+_\b5_\b5 enum _\bM_\bo_\bd_\be {\n+_\b5_\b6 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n+_\b5_\b7 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n+58 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+_\b5_\b9 };\n+60\n+_\b6_\b1 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+62\n+_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n+64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs(false),\n+65 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs(false),\n+66 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n+67 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs(true),\n+68 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl(10),\n+69 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n+70\n+_\b7_\b1 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n+_\b7_\b2 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs : 1,\n+_\b7_\b3 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs : 1,\n+_\b7_\b4 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b7_\b5 _\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b7_\b8 _\bm_\ba_\bx_\bL_\be_\bv_\be_\bl : 4;\n+_\b7_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n+81 };\n+82\n+_\b9_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+95 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n 96\n-_\b9_\b8 void _\bN_\be_\bx_\bt() {\n-99 int stride = *_\b__\bs_\bi_\bz_\be;\n-100 ++_\b__\bs_\bi_\bz_\be;\n-101 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs += stride;\n-102 _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs += stride;\n-103 }\n-104\n-105protected:\n-106 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-107 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-108\n-_\b1_\b0_\b9 int * _\b__\bs_\bi_\bz_\be;\n-_\b1_\b1_\b0 _\bI_\bn_\bd_\be_\bx * _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n-_\b1_\b1_\b1 REAL * _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n-112};\n+97\n+_\b1_\b1_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+111 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const ** tables);\n+112\n 113\n-_\b1_\b1_\b6class _\bS_\bt_\be_\bn_\bc_\bi_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n-117protected:\n-_\b1_\b1_\b8 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl;\n-119\n-120public:\n-_\b1_\b2_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl() : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl() { }\n-_\b1_\b2_\b2 _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl const & other) : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(other) { }\n-_\b1_\b2_\b3 _\bS_\bt_\be_\bn_\bc_\bi_\bl(int * size, _\bI_\bn_\bd_\be_\bx * indices, float * weights)\n-124 : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(size, indices, weights) { }\n-125};\n-126\n-127\n-140template \n-_\b1_\b4_\b1class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n-142protected:\n-_\b1_\b4_\b3 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(int numControlVerts,\n-144 std::vector const& offsets,\n-145 std::vector const& sizes,\n-146 std::vector const& sources,\n-147 std::vector const& weights,\n-148 bool includeCoarseVerts,\n-149 size_t firstOffset);\n-150\n-151public:\n-152\n-_\b1_\b5_\b3 virtual _\b~_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl() {};\n-154\n-_\b1_\b5_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const {\n-157 return (int)_\b__\bs_\bi_\bz_\be_\bs.size();\n-158 }\n-159\n-_\b1_\b6_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n-162 return _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs;\n-163 }\n-164\n-_\b1_\b6_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const;\n-167\n-_\b1_\b6_\b9 std::vector const & _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs() const {\n-170 return _\b__\bs_\bi_\bz_\be_\bs;\n-171 }\n-172\n-_\b1_\b7_\b4 std::vector const & _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs() const {\n-175 return _\b__\bo_\bf_\bf_\bs_\be_\bt_\bs;\n-176 }\n-177\n-_\b1_\b7_\b9 std::vector const & _\bG_\be_\bt_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs() const {\n-180 return _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs;\n-181 }\n+_\b1_\b2_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+129 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+130 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+131 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+132 bool factorize = true);\n+133\n+_\b1_\b4_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+149 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+150 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+151 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+152 bool factorize = true) {\n+153 return _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+154 refiner, baseStencilTable, localPointStencilTable, factorize);\n+155 }\n+156\n+_\b1_\b7_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+175 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+176 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *baseStencilTable,\n+177 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *localPointStencilTable,\n+178 int channel = 0,\n+179 bool factorize = true);\n+180\n+181private:\n 182\n-_\b1_\b8_\b4 std::vector const & _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-185 return _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs;\n-186 }\n+183 // Generate stencils for the coarse control-vertices (single weight = 1.0f)\n+184 static void generateControlVertStencils(\n+185 int numControlVerts,\n+186 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> & dst);\n 187\n-_\b1_\b8_\b9 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const;\n-190\n-204 template \n-_\b2_\b0_\b5 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T const &srcValues, U &dstValues, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx\n-end=-1) const {\n-206 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, dstValues, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n-207 }\n-208\n-209 template \n-_\b2_\b1_\b0 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T1 const &srcBase, int numBase, T2 const &srcRef,\n-211 U &dstValues, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const {\n-212 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, dstValues, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n-213 }\n-214\n-215 // Pointer interface for backward compatibility\n-216 template \n-_\b2_\b1_\b7 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T const *src, U *dst, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const\n-{\n-218 this->_\bu_\bp_\bd_\ba_\bt_\be(src, dst, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n-219 }\n-220 template \n-_\b2_\b2_\b1 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n-222 U *dst, _\bI_\bn_\bd_\be_\bx start=-1, _\bI_\bn_\bd_\be_\bx end=-1) const {\n-223 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, dst, _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs, start, end);\n-224 }\n+188 // Internal method to splice local point stencils\n+189 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * appendLocalPointStencilTable(\n+190 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+191 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * baseStencilTable,\n+192 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * localPointStencilTable,\n+193 int channel,\n+194 bool factorize);\n+195};\n+196\n+208template \n+_\b2_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+210\n+211public:\n+212\n+_\b2_\b1_\b3 enum _\bM_\bo_\bd_\be {\n+_\b2_\b1_\b4 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX=0,\n+_\b2_\b1_\b5 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG,\n+216 _\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+_\b2_\b1_\b7 };\n+218\n+_\b2_\b1_\b9 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n+220\n+_\b2_\b2_\b1 _\bO_\bp_\bt_\bi_\bo_\bn_\bs() : _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be(_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX),\n+222 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(true),\n+223 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs(false),\n+224 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl(0) { }\n 225\n-_\b2_\b2_\b7 void _\bC_\bl_\be_\ba_\br();\n-228\n-229protected:\n-230\n-231 // Update values by applying cached stencil weights to new control values\n-232 template \n-_\b2_\b3_\b3 void _\bu_\bp_\bd_\ba_\bt_\be( T const &srcValues, U &dstValues,\n-234 std::vector const & valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const;\n-235 template \n-_\b2_\b3_\b6 void _\bu_\bp_\bd_\ba_\bt_\be( T1 const &srcBase, int numBase, T2 const &srcRef, U\n-&dstValues,\n-237 std::vector const & valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const;\n-238\n-239 // Populate the offsets table from the stencil sizes in _sizes (factory\n-helper)\n-_\b2_\b4_\b0 void _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs();\n-241\n-242 // Resize the table arrays (factory helper)\n-_\b2_\b4_\b3 void _\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems);\n-244\n-245 // Reserves the table arrays (factory helper)\n-_\b2_\b4_\b6 void _\br_\be_\bs_\be_\br_\bv_\be(int nstencils, int nelems);\n-247\n-248 // Reallocates the table arrays to remove excess capacity (factory helper)\n-_\b2_\b4_\b9 void _\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt();\n-250\n-251 // Performs any final operations on internal tables (factory helper)\n-_\b2_\b5_\b2 void _\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be();\n-253\n-254protected:\n-_\b2_\b5_\b5 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl() : _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(0) {}\n-_\b2_\b5_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(int numControlVerts)\n-257 : _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(numControlVerts)\n-258 { }\n-259\n-260 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-_\b2_\b6_\b1 friend class _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br;\n-262\n-_\b2_\b6_\b3 int _\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs; // number of control vertices\n-264\n-_\b2_\b6_\b5 std::vector _\b__\bs_\bi_\bz_\be_\bs; // number of coefficients for each stencil\n-_\b2_\b6_\b6 std::vector _\b__\bo_\bf_\bf_\bs_\be_\bt_\bs, // offset to the start of each stencil\n-_\b2_\b6_\b7 _\b__\bi_\bn_\bd_\bi_\bc_\be_\bs; // indices of contributing coarse vertices\n-_\b2_\b6_\b8 std::vector _\b__\bw_\be_\bi_\bg_\bh_\bt_\bs; // stencil weight coefficients\n-269};\n-270\n-_\b2_\b7_\b3class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n-274protected:\n-_\b2_\b7_\b5 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-276\n-277public:\n-_\b2_\b7_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl _\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx index) const {\n-279 return _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n-280 }\n-_\b2_\b8_\b1 _\bS_\bt_\be_\bn_\bc_\bi_\bl _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n-282 return _\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n-283 }\n+_\b2_\b2_\b6 unsigned int _\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be : 2,\n+_\b2_\b2_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1,\n+_\b2_\b2_\b8 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs : 1;\n+_\b2_\b2_\b9 unsigned int _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl;\n+230 };\n+231\n+_\b2_\b3_\b3 struct _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by {\n+234\n+_\b2_\b3_\b5 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by() : _\bp_\bt_\be_\bx_\bI_\bd_\bx(-1), _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs(0), _\bs(0), _\bt(0) { }\n+236\n+_\b2_\b3_\b7 int _\bp_\bt_\be_\bx_\bI_\bd_\bx,\n+_\b2_\b3_\b8 _\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs;\n+239\n+_\b2_\b4_\b0 REAL const * _\bs,\n+_\b2_\b4_\b1 * _\bt;\n+242 };\n+243\n+_\b2_\b4_\b4 typedef std::vector _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc;\n+245\n+_\b2_\b6_\b9 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bC_\br_\be_\ba_\bt_\be(\n+270 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+271 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n+272 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * cvStencils = 0,\n+273 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n+274 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs());\n+275\n+276};\n+277\n+278\n+279//\n+280// Public wrapper classes for the templates\n+281//\n+282class _\bS_\bt_\be_\bn_\bc_\bi_\bl;\n+283class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be;\n 284\n-285protected:\n-_\b2_\b8_\b6 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be() { }\n-_\b2_\b8_\b7 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts) : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts) { }\n-_\b2_\b8_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts,\n-289 std::vector const& offsets,\n-290 std::vector const& sizes,\n-291 std::vector const& sources,\n-292 std::vector const& weights,\n-293 bool includeCoarseVerts,\n-294 size_t firstOffset)\n-295 : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts, offsets,\n-296 sizes, sources, weights, includeCoarseVerts, firstOffset) { }\n-297};\n-298\n+_\b2_\b8_\b7class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl {\n+288private:\n+289 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+290 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+291\n+292public:\n+_\b2_\b9_\b3 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+294 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner, Options options = Options()) {\n+295\n+296 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+297 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(refiner, options));\n+298 }\n 299\n-302template \n-_\b3_\b0_\b3class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n-304public:\n-305\n-_\b3_\b2_\b4 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl( int* size,\n-325 _\bI_\bn_\bd_\be_\bx * indices,\n-326 REAL * weights,\n-327 REAL * duWeights=0,\n-328 REAL * dvWeights=0,\n-329 REAL * duuWeights=0,\n-330 REAL * duvWeights=0,\n-331 REAL * dvvWeights=0)\n-332 : _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl(size, indices, weights),\n-333 _duWeights(duWeights),\n-334 _dvWeights(dvWeights),\n-335 _duuWeights(duuWeights),\n-336 _duvWeights(duvWeights),\n-337 _dvvWeights(dvvWeights) {\n-338 }\n-339\n-_\b3_\b4_\b1 REAL const * _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-342 return _duWeights;\n-343 }\n-344\n-_\b3_\b4_\b6 REAL const * _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-347 return _dvWeights;\n-348 }\n-349\n-_\b3_\b5_\b1 REAL const * _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-352 return _duuWeights;\n-353 }\n-354\n-_\b3_\b5_\b6 REAL const * _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-357 return _duvWeights;\n-358 }\n-359\n-_\b3_\b6_\b1 REAL const * _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-362 return _dvvWeights;\n-363 }\n-364\n-_\b3_\b6_\b6 void _\bN_\be_\bx_\bt() {\n-367 int stride = *this->_\b__\bs_\bi_\bz_\be;\n-368 ++this->_\b__\bs_\bi_\bz_\be;\n-369 this->_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs += stride;\n-370 this->_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs += stride;\n-371 if (_duWeights) _duWeights += stride;\n-372 if (_dvWeights) _dvWeights += stride;\n-373 if (_duuWeights) _duuWeights += stride;\n-374 if (_duvWeights) _duvWeights += stride;\n-375 if (_dvvWeights) _dvvWeights += stride;\n-376 }\n-377\n-378private:\n-379\n-380 friend class _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-381 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-382\n-383 REAL * _duWeights, // pointer to stencil u derivative limit weights\n-384 * _dvWeights, // pointer to stencil v derivative limit weights\n-385 * _duuWeights, // pointer to stencil uu derivative limit weights\n-386 * _duvWeights, // pointer to stencil uv derivative limit weights\n-387 * _dvvWeights; // pointer to stencil vv derivative limit weights\n-388};\n-389\n-_\b3_\b9_\b2class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl {\n-393protected:\n-_\b3_\b9_\b4 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl;\n-395\n-396public:\n-_\b3_\b9_\b7 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl const & other) : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(other) { }\n-_\b3_\b9_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(int* size, _\bI_\bn_\bd_\be_\bx * indices, float * weights,\n-399 float * duWeights=0, float * dvWeights=0,\n-400 float * duuWeights=0, float * duvWeights=0, float * dvvWeights=0)\n-401 : _\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl(size, indices, weights,\n-402 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights) { }\n-403};\n-404\n-405\n-408template \n-_\b4_\b0_\b9class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl : public _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n-410protected:\n-_\b4_\b1_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl(\n-412 int numControlVerts,\n-413 std::vector const& offsets,\n-414 std::vector const& sizes,\n-415 std::vector const& sources,\n-416 std::vector const& weights,\n-417 std::vector const& duWeights,\n-418 std::vector const& dvWeights,\n-419 std::vector const& duuWeights,\n-420 std::vector const& duvWeights,\n-421 std::vector const& dvvWeights,\n-422 bool includeCoarseVerts,\n-423 size_t firstOffset);\n-424\n-425public:\n-426\n-_\b4_\b2_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const;\n-429\n-_\b4_\b3_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const;\n-432\n-_\b4_\b3_\b4 std::vector const & _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-435 return _duWeights;\n-436 }\n-437\n-_\b4_\b3_\b9 std::vector const & _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-440 return _dvWeights;\n-441 }\n-442\n-_\b4_\b4_\b4 std::vector const & _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-445 return _duuWeights;\n-446 }\n-447\n-_\b4_\b4_\b9 std::vector const & _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-450 return _duvWeights;\n-451 }\n-452\n-_\b4_\b5_\b4 std::vector const & _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs() const {\n-455 return _dvvWeights;\n-456 }\n-457\n-475 template \n-_\b4_\b7_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T const & srcValues, U & uderivs, U & vderivs,\n-477 int start=-1, int end=-1) const {\n-478\n-479 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uderivs, _duWeights, start, end);\n-480 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, vderivs, _dvWeights, start, end);\n-481 }\n-482\n-483 template \n-_\b4_\b8_\b4 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T1 const & srcBase, int numBase, T2 const & srcRef,\n-485 U & uderivs, U & vderivs, int start=-1, int end=-1) const {\n-486\n-487 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);\n-488 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);\n-489 }\n-490\n-491 // Pointer interface for backward compatibility\n-492 template \n-_\b4_\b9_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T const *src, U *uderivs, U *vderivs,\n-494 int start=-1, int end=-1) const {\n-495\n-496 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uderivs, _duWeights, start, end);\n-497 this->_\bu_\bp_\bd_\ba_\bt_\be(src, vderivs, _dvWeights, start, end);\n-498 }\n-499 template \n-_\b5_\b0_\b0 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n-501 U *uderivs, U *vderivs, int start=-1, int end=-1) const {\n-502\n-503 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uderivs, _duWeights, start, end);\n-504 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vderivs, _dvWeights, start, end);\n-505 }\n-506\n-527 template \n-_\b5_\b2_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T const & srcValues,\n-529 U & uuderivs, U & uvderivs, U & vvderivs,\n-530 int start=-1, int end=-1) const {\n-531\n-532 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uuderivs, _duuWeights, start, end);\n-533 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, uvderivs, _duvWeights, start, end);\n-534 this->_\bu_\bp_\bd_\ba_\bt_\be(srcValues, vvderivs, _dvvWeights, start, end);\n-535 }\n-536\n-537 template \n-_\b5_\b3_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T1 const & srcBase, int numBase, T2 const & srcRef,\n-539 U & uuderivs, U & uvderivs, U & vvderivs, int start=-1, int end=-1) const {\n-540\n-541 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);\n-542 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);\n-543 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);\n-544 }\n-545\n-546 // Pointer interface for backward compatibility\n-547 template \n-_\b5_\b4_\b8 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs,\n-549 int start=-1, int end=-1) const {\n-550\n-551 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uuderivs, _duuWeights, start, end);\n-552 this->_\bu_\bp_\bd_\ba_\bt_\be(src, uvderivs, _duvWeights, start, end);\n-553 this->_\bu_\bp_\bd_\ba_\bt_\be(src, vvderivs, _dvvWeights, start, end);\n-554 }\n-555 template \n-_\b5_\b5_\b6 void _\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs(T1 const *srcBase, int numBase, T2 const *srcRef,\n-557 U *uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const {\n-558\n-559 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uuderivs, _duuWeights, start, end);\n-560 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, uvderivs, _duvWeights, start, end);\n-561 this->_\bu_\bp_\bd_\ba_\bt_\be(srcBase, numBase, srcRef, vvderivs, _dvvWeights, start, end);\n-562 }\n-563\n-_\b5_\b6_\b5 void _\bC_\bl_\be_\ba_\br();\n-566\n-567private:\n-568 friend class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl;\n-569\n-570 // Resize the table arrays (factory helper)\n-571 void resize(int nstencils, int nelems);\n-572\n-573private:\n-574 std::vector _duWeights, // u derivative limit stencil weights\n-575 _dvWeights, // v derivative limit stencil weights\n-576 _duuWeights, // uu derivative limit stencil weights\n-577 _duvWeights, // uv derivative limit stencil weights\n-578 _dvvWeights; // vv derivative limit stencil weights\n-579};\n-580\n-_\b5_\b8_\b3class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl {\n-584protected:\n-_\b5_\b8_\b5 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n-586\n-587public:\n-_\b5_\b8_\b8 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl _\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx index) const {\n-589 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n-590 }\n-_\b5_\b9_\b1 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n-592 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(index));\n-593 }\n-594\n-595protected:\n-_\b5_\b9_\b6 _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int numControlVerts,\n-597 std::vector const& offsets,\n-598 std::vector const& sizes,\n-599 std::vector const& sources,\n-600 std::vector const& weights,\n-601 std::vector const& duWeights,\n-602 std::vector const& dvWeights,\n-603 std::vector const& duuWeights,\n-604 std::vector const& duvWeights,\n-605 std::vector const& dvvWeights,\n-606 bool includeCoarseVerts,\n-607 size_t firstOffset)\n-608 : _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be(numControlVerts,\n-609 offsets, sizes, sources, weights,\n-610 duWeights, dvWeights, duuWeights, duvWeights, dvvWeights,\n-611 includeCoarseVerts, firstOffset) { }\n-612};\n-613\n-614\n-615// Update values by applying cached stencil weights to new control values\n-616template \n-617template void\n-_\b6_\b1_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be(T1 const &srcBase, int numBase,\n-619 T2 const &srcRef, U &dstValues,\n-620 std::vector const &valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const {\n-621\n-622 int const * sizes = &_sizes.at(0);\n-623 _\bI_\bn_\bd_\be_\bx const * indices = &_indices.at(0);\n-624 REAL const * weights = &valueWeights.at(0);\n-625\n-626 if (start > 0) {\n-627 assert(start < (_\bI_\bn_\bd_\be_\bx)_offsets.size());\n-628 sizes += start;\n-629 indices += _offsets[start];\n-630 weights += _offsets[start];\n-631 } else {\n-632 start = 0;\n-633 }\n-634\n-635 int nstencils = ((end < start) ? GetNumStencils() : end) - start;\n-636\n-637 for (int i = 0; i < nstencils; ++i, ++sizes) {\n-638 dstValues[start + i].Clear();\n-639 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {\n-640 if (*indices < numBase) {\n-641 dstValues[start + i].AddWithWeight(srcBase[*indices], *weights);\n-642 } else {\n-643 dstValues[start + i].AddWithWeight(srcRef[*indices - numBase], *weights);\n-644 }\n-645 }\n-646 }\n-647}\n-648template \n-649template void\n-_\b6_\b5_\b0_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be(T const &srcValues, U &dstValues,\n-651 std::vector const &valueWeights, _\bI_\bn_\bd_\be_\bx start, _\bI_\bn_\bd_\be_\bx end) const {\n-652\n-653 int const * sizes = &_sizes.at(0);\n-654 _\bI_\bn_\bd_\be_\bx const * indices = &_indices.at(0);\n-655 REAL const * weights = &valueWeights.at(0);\n-656\n-657 if (start > 0) {\n-658 assert(start < (_\bI_\bn_\bd_\be_\bx)_offsets.size());\n-659 sizes += start;\n-660 indices += _offsets[start];\n-661 weights += _offsets[start];\n-662 } else {\n-663 start = 0;\n-664 }\n-665\n-666 int nstencils = ((end < start) ? GetNumStencils() : end) - start;\n-667\n-668 for (int i = 0; i < nstencils; ++i, ++sizes) {\n-669 dstValues[start + i].Clear();\n-670 for (int j = 0; j < *sizes; ++j, ++indices, ++weights) {\n-671 dstValues[start + i].AddWithWeight(srcValues[*indices], *weights);\n-672 }\n-673 }\n-674}\n-675\n-676template \n-677inline void\n-_\b6_\b7_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs() {\n-679 _\bI_\bn_\bd_\be_\bx offset=0;\n-680 int noffsets = (int)_sizes.size();\n-681 _offsets.resize(noffsets);\n-682 for (int i=0; i<(int)_sizes.size(); ++i ) {\n-683 _offsets[i]=offset;\n-684 offset+=_sizes[i];\n-685 }\n-686}\n-687\n-688template \n-689inline void\n-_\b6_\b9_\b0_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems) {\n-691 _sizes.resize(nstencils);\n-692 _indices.resize(nelems);\n-693 _weights.resize(nelems);\n-694}\n-695\n-696template \n-697inline void\n-_\b6_\b9_\b8_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be(int nstencils, int nelems) {\n-699 _sizes.reserve(nstencils);\n-700 _indices.reserve(nelems);\n-701 _weights.reserve(nelems);\n-702}\n-703\n-704template \n-705inline void\n-_\b7_\b0_\b6_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt() {\n-707 std::vector(_sizes).swap(_sizes);\n-708 std::vector(_indices).swap(_indices);\n-709 std::vector(_weights).swap(_weights);\n-710}\n-711\n-712template \n-713inline void\n-_\b7_\b1_\b4_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be() {\n-715 shrinkToFit();\n-716 generateOffsets();\n-717}\n-718\n-719// Returns a Stencil at index i in the table\n-720template \n-721inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n-_\b7_\b2_\b2_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const {\n-723 assert((! _offsets.empty()) && i<(int)_offsets.size());\n-724\n-725 _\bI_\bn_\bd_\be_\bx ofs = _offsets[i];\n-726\n-727 return _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(const_cast(&_sizes[i]),\n-728 const_cast<_\bI_\bn_\bd_\be_\bx*>(&_indices[ofs]),\n-729 const_cast(&_weights[ofs]));\n-730}\n-731\n-732template \n-733inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n-_\b7_\b3_\b4_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n-735 return GetStencil(index);\n-736}\n-737\n-738template \n-739inline void\n-740_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(int nstencils, int nelems) {\n-741 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\br_\be_\bs_\bi_\bz_\be(nstencils, nelems);\n-742 _duWeights.resize(nelems);\n-743 _dvWeights.resize(nelems);\n-744}\n-745\n-746// Returns a LimitStencil at index i in the table\n-747template \n-748inline LimitStencilReal\n-_\b7_\b4_\b9_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl(_\bI_\bn_\bd_\be_\bx i) const {\n-750 assert((! this->GetOffsets().empty()) && i<(int)this->GetOffsets().size());\n-751\n-752 _\bI_\bn_\bd_\be_\bx ofs = this->GetOffsets()[i];\n-753\n-754 if (!_duWeights.empty() && !_dvWeights.empty() &&\n-755 !_duuWeights.empty() && !_duvWeights.empty() && !_dvvWeights.empty()) {\n-756 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n-757 const_cast(&this->GetSizes()[i]),\n-758 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n-759 const_cast(&this->GetWeights()[ofs]),\n-760 const_cast(&GetDuWeights()[ofs]),\n-761 const_cast(&GetDvWeights()[ofs]),\n-762 const_cast(&GetDuuWeights()[ofs]),\n-763 const_cast(&GetDuvWeights()[ofs]),\n-764 const_cast(&GetDvvWeights()[ofs]) );\n-765 } else if (!_duWeights.empty() && !_dvWeights.empty()) {\n-766 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n-767 const_cast(&this->GetSizes()[i]),\n-768 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n-769 const_cast(&this->GetWeights()[ofs]),\n-770 const_cast(&GetDuWeights()[ofs]),\n-771 const_cast(&GetDvWeights()[ofs]) );\n-772 } else {\n-773 return _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>(\n-774 const_cast(&this->GetSizes()[i]),\n-775 const_cast<_\bI_\bn_\bd_\be_\bx *>(&this->GetControlIndices()[ofs]),\n-776 const_cast(&this->GetWeights()[ofs]) );\n-777 }\n-778}\n-779\n-780template \n-781inline _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>\n-_\b7_\b8_\b2_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]_\b (_\bI_\bn_\bd_\be_\bx index) const {\n-783 return GetLimitStencil(index);\n-784}\n-785\n-786} // end namespace Far\n-787\n-788} // end namespace OPENSUBDIV_VERSION\n-789using namespace OPENSUBDIV_VERSION;\n-790\n-791} // end namespace OpenSubdiv\n-792\n-793#endif // OPENSUBDIV3_FAR_STENCILTABLE_H\n+_\b3_\b0_\b0 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+301 int numTables, _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const ** tables) {\n+302\n+303 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+304 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(numTables,\n+305 reinterpret_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const **>(tables)));\n+306 }\n+307\n+_\b3_\b0_\b8 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(\n+309 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+310 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+311 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+312 bool factorize = true) {\n+313\n+314 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+315 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(refiner,\n+316 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+317 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+318 factorize));\n+319 }\n+320\n+_\b3_\b2_\b1 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+322 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+323 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+324 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+325 bool factorize = true) {\n+326\n+327 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+328 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n+329 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+330 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+331 factorize));\n+332 }\n+333\n+_\b3_\b3_\b4 static _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+335 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+336 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *baseStencilTable,\n+337 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *localPointStencilTable,\n+338 int channel = 0,\n+339 bool factorize = true) {\n+340\n+341 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+342 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(refiner,\n+343 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(baseStencilTable),\n+344 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(localPointStencilTable),\n+345 channel, factorize));\n+346 }\n+347};\n+348\n+349class LimitStencil;\n+350class LimitStencilTable;\n+351\n+_\b3_\b5_\b4class _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by : public _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n+{\n+355private:\n+356 typedef _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by;\n+357 typedef _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bf_\bl_\bo_\ba_\bt_\b> _\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be;\n+358\n+359public:\n+_\b3_\b6_\b0 static _\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * _\bC_\br_\be_\ba_\bt_\be(\n+361 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+362 _\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc const & locationArrays,\n+363 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const * cvStencils = 0,\n+364 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const * patchTable = 0,\n+365 Options options = Options()) {\n+366\n+367 return static_cast<_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+368 _\bB_\ba_\bs_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be(\n+369 refiner,\n+370 locationArrays,\n+371 static_cast<_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be const *>(cvStencils),\n+372 patchTable,\n+373 options));\n+374 }\n+375};\n+376\n+377} // end namespace Far\n+378\n+379} // end namespace OPENSUBDIV_VERSION\n+380using namespace OPENSUBDIV_VERSION;\n+381\n+382} // end namespace OpenSubdiv\n+383\n+384#endif // OPENSUBDIV3_FAR_STENCILTABLE_FACTORY_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+Container for arrays of parametric patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n A specialized factory for StencilTable.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTableReal< REAL > const * Create(TopologyRefiner const &refiner,\n+Options options=Options())\n+Instantiates StencilTable from TopologyRefiner that have been refined uniformly\n+or adaptively.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTableFaceVarying\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, int\n+channel=0, bool factorize=true)\n+Utility function for stencil splicing for local point face-varying stencils.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n+Mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_FACE_VARYING\n+face-varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_VARYING\n+varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n+@ INTERPOLATE_VERTEX\n+vertex primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTableVarying\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n+factorize=true)\n+Utility function for stencil splicing for local point varying stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+static StencilTableReal< REAL > const * AppendLocalPointStencilTable\n+(TopologyRefiner const &refiner, StencilTableReal< REAL > const\n+*baseStencilTable, StencilTableReal< REAL > const *localPointStencilTable, bool\n+factorize=true)\n+Utility function for stencil splicing for local point stencils.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTableReal< REAL > const * Create(int numTables, StencilTableReal<\n+REAL > const **tables)\n+Instantiates StencilTable by concatenating an array of existing stencil tables.\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl\n A specialized factory for LimitStencilTable.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bM_\bo_\bd_\be\n+Mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bF_\bA_\bC_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_FACE_VARYING\n+face-varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bA_\bR_\bY_\bI_\bN_\bG\n+@ INTERPOLATE_VARYING\n+varying primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bI_\bN_\bT_\bE_\bR_\bP_\bO_\bL_\bA_\bT_\bE_\b__\bV_\bE_\bR_\bT_\bE_\bX\n+@ INTERPOLATE_VERTEX\n+vertex primvar stencils\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\bV_\be_\bc\n+std::vector< LocationArray > LocationArrayVec\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static LimitStencilTableReal< REAL > const * Create(TopologyRefiner const\n+&refiner, LocationArrayVec const &locationArrays, StencilTableReal< REAL >\n+const *cvStencils=0, PatchTable const *patchTable=0, Options options=Options())\n+Instantiates LimitStencilTable from a TopologyRefiner that has been refined\n+either uniformly or adapt...\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n Vertex stencil descriptor.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-StencilReal()\n-Default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bs_\bi_\bz_\be\n-int * _size\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-StencilReal(int *size, Index *indices, REAL *weights)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bN_\be_\bx_\bt\n-void Next()\n-Advance to the next stencil in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-StencilReal(StencilReal const &other)\n-Copy constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs\n-Index * _indices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index const * GetVertexIndices() const\n-Returns the control vertices' indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be\n-int GetSize() const\n-Returns the size of the stencil.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs\n-REAL * _weights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bP_\bt_\br\n-int * GetSizePtr() const\n-Returns the size of the stencil as a pointer.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetWeights() const\n-Returns the interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b3\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n Vertex stencil class wrapping the template for compatibility.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Stencil(BaseStencil const &other)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Stencil(int *size, Index *indices, float *weights)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-StencilReal< float > BaseStencil\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Stencil()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b2_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n Table of subdivision stencils.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumControlVertices() const\n-Returns the number of control vertices indexed in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bs_\bi_\bz_\be_\bs\n-std::vector< int > _sizes\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br\n-friend class Far::PatchTableBuilder\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be\n-void update(T1 const &srcBase, int numBase, T2 const &srcRef, U &dstValues,\n-std::vector< REAL > const &valueWeights, Index start, Index end) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n-void UpdateValues(T1 const &srcBase, int numBase, T2 const &srcRef, U\n-&dstValues, Index start=-1, Index end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b1_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-std::vector< Index > const & GetControlIndices() const\n-Returns the indices of the control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bf_\bi_\bn_\ba_\bl_\bi_\bz_\be\n-void finalize()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-StencilReal< REAL > operator[](Index index) const\n-Returns the stencil at index i in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bn_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int _numControlVertices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bu_\bp_\bd_\ba_\bt_\be\n-void update(T const &srcValues, U &dstValues, std::vector< REAL > const\n-&valueWeights, Index start, Index end) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs\n-std::vector< int > const & GetSizes() const\n-Returns the number of control vertices of each stencil in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-Returns the number of stencils in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-virtual ~StencilTableReal()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs\n-std::vector< Index > const & GetOffsets() const\n-Returns the offset to a given stencil (factory may leave empty)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-StencilReal< REAL > GetStencil(Index i) const\n-Returns a Stencil at index i in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bs_\bh_\br_\bi_\bn_\bk_\bT_\bo_\bF_\bi_\bt\n-void shrinkToFit()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n-void generateOffsets()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bC_\bl_\be_\ba_\br\n-void Clear()\n-Clears the stencils from the table.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bo_\bf_\bf_\bs_\be_\bt_\bs\n-std::vector< Index > _offsets\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bw_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > _weights\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\br_\be_\bs_\bi_\bz_\be\n-void resize(int nstencils, int nelems)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetWeights() const\n-Returns the stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n-void UpdateValues(T1 const *srcBase, int numBase, T2 const *srcRef, U *dst,\n-Index start=-1, Index end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-StencilTableReal(int numControlVerts, std::vector< int > const &offsets, std::\n-vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n-REAL > const &weights, bool includeCoarseVerts, size_t firstOffset)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\b__\bi_\bn_\bd_\bi_\bc_\be_\bs\n-std::vector< Index > _indices\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-StencilTableReal()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\br_\be_\bs_\be_\br_\bv_\be\n-void reserve(int nstencils, int nelems)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n-void UpdateValues(T const *src, U *dst, Index start=-1, Index end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bV_\ba_\bl_\bu_\be_\bs\n-void UpdateValues(T const &srcValues, U &dstValues, Index start=-1, Index end=-\n-1) const\n-Updates point values based on the control values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b0_\b5\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n Stencil table class wrapping the template for compatibility.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable(int numControlVerts, std::vector< int > const &offsets, std::\n-vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n-float > const &weights, bool includeCoarseVerts, size_t firstOffset)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable(int numControlVerts)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be\n-StencilTableReal< float > BaseTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Stencil GetStencil(Index index) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-Stencil operator[](Index index) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-Limit point stencil descriptor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetDuvWeights() const\n-Returns the uv derivative weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetDvWeights() const\n-Returns the v derivative weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bN_\be_\bx_\bt\n-void Next()\n-Advance to the next stencil in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetDvvWeights() const\n-Returns the vv derivative weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl\n-LimitStencilReal(int *size, Index *indices, REAL *weights, REAL *duWeights=0,\n-REAL *dvWeights=0, REAL *duuWeights=0, REAL *duvWeights=0, REAL *dvvWeights=0)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b2_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetDuWeights() const\n-Returns the u derivative weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-REAL const * GetDuuWeights() const\n-Returns the uu derivative weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-Limit point stencil class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-LimitStencil(BaseStencil const &other)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bB_\ba_\bs_\be_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-LimitStencilReal< float > BaseStencil\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-LimitStencil(int *size, Index *indices, float *weights, float *duWeights=0,\n-float *dvWeights=0, float *duuWeights=0, float *duvWeights=0, float\n-*dvvWeights=0)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b8\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n Table of limit subdivision stencils.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetDuuWeights() const\n-Returns the 'uu' derivative stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-LimitStencilReal< REAL > operator[](Index index) const\n-Returns the limit stencil at index i in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetDvvWeights() const\n-Returns the 'vv' derivative stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n-void UpdateDerivs(T const *src, U *uderivs, U *vderivs, int start=-1, int end=-\n-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n-void Update2ndDerivs(T const *src, T *uuderivs, U *uvderivs, U *vvderivs, int\n-start=-1, int end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetDvWeights() const\n-Returns the 'v' derivative stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n-void Update2ndDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U\n-*uuderivs, U *uvderivs, U *vvderivs, int start=-1, int end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n-void UpdateDerivs(T const &srcValues, U &uderivs, U &vderivs, int start=-1, int\n-end=-1) const\n-Updates derivative values based on the control values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-LimitStencilReal< REAL > GetLimitStencil(Index i) const\n-Returns a LimitStencil at index i in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:\n-_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-LimitStencilTableReal(int numControlVerts, std::vector< int > const &offsets,\n-std::vector< int > const &sizes, std::vector< int > const &sources, std::\n-vector< REAL > const &weights, std::vector< REAL > const &duWeights, std::\n-vector< REAL > const &dvWeights, std::vector< REAL > const &duuWeights, std::\n-vector< REAL > const &duvWeights, std::vector< REAL > const &dvvWeights, bool\n-includeCoarseVerts, size_t firstOffset)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n-void Update2ndDerivs(T const &srcValues, U &uuderivs, U &uvderivs, U &vvderivs,\n-int start=-1, int end=-1) const\n-Updates 2nd derivative values based on the control values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetDuWeights() const\n-Returns the 'u' derivative stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bC_\bl_\be_\ba_\br\n-void Clear()\n-Clears the stencils from the table.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\bs\n-void Update2ndDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U\n-&uuderivs, U &uvderivs, U &vvderivs, int start=-1, int end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs\n-std::vector< REAL > const & GetDuvWeights() const\n-Returns the 'uv' derivative stencil interpolation weights.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n-void UpdateDerivs(T1 const &srcBase, int numBase, T2 const &srcRef, U &uderivs,\n-U &vderivs, int start=-1, int end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\be_\br_\bi_\bv_\bs\n-void UpdateDerivs(T1 const *srcBase, int numBase, T2 const *srcRef, U *uderivs,\n-U *vderivs, int start=-1, int end=-1) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b0_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n Limit stencil table class wrapping the template for compatibility.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bB_\ba_\bs_\be_\bT_\ba_\bb_\bl_\be\n-LimitStencilTableReal< float > BaseTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl\n-LimitStencil GetLimitStencil(Index index) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-LimitStencilTable(int numControlVerts, std::vector< int > const &offsets, std::\n-vector< int > const &sizes, std::vector< int > const &sources, std::vector<\n-float > const &weights, std::vector< float > const &duWeights, std::vector<\n-float > const &dvWeights, std::vector< float > const &duuWeights, std::vector<\n-float > const &duvWeights, std::vector< float > const &dvvWeights, bool\n-includeCoarseVerts, size_t firstOffset)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b[_\b]\n-LimitStencil operator[](Index index) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\ba_\bc_\bt_\bo_\br_\bi_\bz_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int factorizeIntermediateLevels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bm_\ba_\bx_\bL_\be_\bv_\be_\bl\n+unsigned int maxLevel\n+generate stencils up to 'maxLevel'\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bI_\bn_\bt_\be_\br_\bm_\be_\bd_\bi_\ba_\bt_\be_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int generateIntermediateLevels\n+vertices at all levels or highest only\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bs\n+unsigned int generateControlVerts\n+generate stencils for control-vertices\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bO_\bf_\bf_\bs_\be_\bt_\bs\n+unsigned int generateOffsets\n+populate optional \"_offsets\" field\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+unsigned int fvarChannel\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n+unsigned int interpolationMode\n+interpolation mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl\n+unsigned int fvarChannel\n+face-varying channel to use\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bM_\bo_\bd_\be\n+unsigned int interpolationMode\n+interpolation mode\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b2_\bn_\bd_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n+unsigned int generate2ndDerivatives\n+Generate weights for 2nd derivatives.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\b1_\bs_\bt_\bD_\be_\br_\bi_\bv_\ba_\bt_\bi_\bv_\be_\bs\n+unsigned int generate1stDerivatives\n+Generate weights for 1st derivatives.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+Descriptor for limit surface locations.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bt\n+REAL const * t\n+array of v coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bs\n+REAL const * s\n+array of u coordinates\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by\n+LocationArray()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bn_\bu_\bm_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bs\n+int numLocations\n+number of (u,v) coordinates in the array\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\bR_\be_\ba_\bl_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bt_\bi_\bo_\bn_\bA_\br_\br_\ba_\by_\b:_\b:_\bp_\bt_\be_\bx_\bI_\bd_\bx\n+int ptexIdx\n+ptex face index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Stencil table factory class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTable const * AppendLocalPointStencilTableVarying(TopologyRefiner\n+const &refiner, StencilTable const *baseStencilTable, StencilTable const\n+*localPointStencilTable, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTable const * Create(TopologyRefiner const &refiner, Options\n+options=Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static StencilTable const * AppendLocalPointStencilTableFaceVarying\n+(TopologyRefiner const &refiner, StencilTable const *baseStencilTable,\n+StencilTable const *localPointStencilTable, int channel=0, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:\n+_\bA_\bp_\bp_\be_\bn_\bd_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const\n+&refiner, StencilTable const *baseStencilTable, StencilTable const\n+*localPointStencilTable, bool factorize=true)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static StencilTable const * Create(int numTables, StencilTable const **tables)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Stencil table factory class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static LimitStencilTable const * Create(TopologyRefiner const &refiner,\n+LocationArrayVec const &locationArrays, StencilTable const *cvStencils=0,\n+PatchTable const *patchTable=0, Options options=Options())\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b3_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+Stores topology data for a specified set of refinement options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00722.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00722.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/ptexIndices.h File Reference\n+OpenSubdiv: opensubdiv/far/primvarRefiner.h File Reference\n \n \n \n \n \n \n \n@@ -90,28 +90,43 @@\n \n \n \n
\n \n-
ptexIndices.h File Reference
\n+
primvarRefiner.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/topologyRefiner.h"
\n+#include "../sdc/types.h"
\n+#include "../sdc/options.h"
\n+#include "../sdc/bilinearScheme.h"
\n+#include "../sdc/catmarkScheme.h"
\n+#include "../sdc/loopScheme.h"
\n+#include "../vtr/level.h"
\n+#include "../vtr/fvarLevel.h"
\n+#include "../vtr/refinement.h"
\n+#include "../vtr/fvarRefinement.h"
\n+#include "../vtr/stackBuffer.h"
\n+#include "../vtr/componentInterfaces.h"
\n #include "../far/types.h"
\n-#include <vector>
\n+#include "../far/error.h"
\n+#include "../far/topologyLevel.h"
\n+#include "../far/topologyRefiner.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n \n

\n Classes

class  PtexIndices
 Object used to compute and query ptex face indices. More...
class  PrimvarRefinerReal< REAL >
 Applies refinement operations to generic primvar data. More...
 
class  PrimvarRefiner
 
\n \n \n \n \n@@ -120,13 +135,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,41 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-ptexIndices.h File Reference\n+primvarRefiner.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bl_\bo_\bo_\bp_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bc_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-\u00a0 Object used to compute and query ptex face indices. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n+\u00a0 Applies refinement operations to generic primvar data. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh\n+ * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00722.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00722.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00722 = [\n- [\"PtexIndices\", \"a01041.html\", \"a01041\"]\n+ [\"PrimvarRefinerReal< REAL >\", \"a01029.html\", \"a01029\"],\n+ [\"PrimvarRefiner\", \"a01037.html\", \"a01037\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00722_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00722_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/ptexIndices.h Source File\n+OpenSubdiv: opensubdiv/far/primvarRefiner.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
ptexIndices.h
\n+
primvarRefiner.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2015 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,81 +118,1233 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_PTEX_INDICES_H
\n-
25#define OPENSUBDIV3_FAR_PTEX_INDICES_H
\n+
24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n+
25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n
26
\n
27#include "../version.h"
\n
28
\n-
29#include "../far/topologyRefiner.h"
\n-
30#include "../far/types.h"
\n-
31
\n-
32#include <vector>
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38
\n-
\n-\n-
47
\n-
48public:
\n+
29#include "../sdc/types.h"
\n+
30#include "../sdc/options.h"
\n+
31#include "../sdc/bilinearScheme.h"
\n+
32#include "../sdc/catmarkScheme.h"
\n+
33#include "../sdc/loopScheme.h"
\n+
34#include "../vtr/level.h"
\n+
35#include "../vtr/fvarLevel.h"
\n+
36#include "../vtr/refinement.h"
\n+
37#include "../vtr/fvarRefinement.h"
\n+
38#include "../vtr/stackBuffer.h"
\n+
39#include "../vtr/componentInterfaces.h"
\n+
40#include "../far/types.h"
\n+
41#include "../far/error.h"
\n+
42#include "../far/topologyLevel.h"
\n+
43#include "../far/topologyRefiner.h"
\n+
44
\n+
45#include <cassert>
\n+
46
\n+
47namespace OpenSubdiv {
\n+
48namespace OPENSUBDIV_VERSION {
\n
49
\n-\n-
52
\n-\n-
55
\n+
50namespace Far {
\n+
51
\n+
55template <typename REAL>
\n+
\n+\n
57
\n-
60
\n-
63 int GetNumFaces() const;
\n-
64
\n-
67 int GetFaceId(Index f) const;
\n-
68
\n-\n-
84 TopologyRefiner const &refiner,
\n-
85 int face, int quadrant,
\n-
86 int adjFaces[4], int adjEdges[4]) const;
\n-
87
\n-
89
\n-
90private:
\n-
91
\n-
92 void initializePtexIndices(TopologyRefiner const &refiner);
\n-
93
\n-
94private:
\n-
95
\n-
96 std::vector<Index> _ptexIndices;
\n-
97};
\n-
\n-
98
\n-
99
\n-
100} // end namespace Far
\n-
101
\n-
102} // end namespace OPENSUBDIV_VERSION
\n-
103using namespace OPENSUBDIV_VERSION;
\n-
104} // end namespace OpenSubdiv
\n-
105
\n-
106#endif /* OPENSUBDIV3_FAR_PTEX_INDICES_H */
\n+
58public:
\n+
59 PrimvarRefinerReal(TopologyRefiner const & refiner) : _refiner(refiner) { }
\n+\n+
61
\n+
62 TopologyRefiner const & GetTopologyRefiner() const { return _refiner; }
\n+
63
\n+
65
\n+
100
\n+
\n+
113 template <class T, class U> void Interpolate(int level, T const & src, U & dst) const;
\n+
114
\n+
\n+
130 template <class T, class U> void InterpolateVarying(int level, T const & src, U & dst) const;
\n+
131
\n+
\n+
148 template <class T, class U> void InterpolateFaceUniform(int level, T const & src, U & dst) const;
\n+
149
\n+
\n+
161 template <class T, class U> void InterpolateFaceVarying(int level, T const & src, U & dst, int channel = 0) const;
\n+
162
\n+
163
\n+
\n+
175 template <class T, class U> void Limit(T const & src, U & dstPos) const;
\n+
176
\n+
177 template <class T, class U, class U1, class U2>
\n+
\n+
178 void Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;
\n+
179
\n+
\n+
180 template <class T, class U> void LimitFaceVarying(T const & src, U & dst, int channel = 0) const;
\n+
181
\n+
183
\n+
184private:
\n+
185 typedef REAL Weight;
\n+
186
\n+
187 // Non-copyable:
\n+
188 PrimvarRefinerReal(PrimvarRefinerReal const & src) : _refiner(src._refiner) { }
\n+
189 PrimvarRefinerReal & operator=(PrimvarRefinerReal const &) { return *this; }
\n+
190
\n+
191 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromFaces(int, T const &, U &) const;
\n+
192 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromEdges(int, T const &, U &) const;
\n+
193 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromVerts(int, T const &, U &) const;
\n+
194
\n+
195 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromFaces(int, T const &, U &, int) const;
\n+
196 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromEdges(int, T const &, U &, int) const;
\n+
197 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromVerts(int, T const &, U &, int) const;
\n+
198
\n+
199 template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n+
200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;
\n+
201
\n+
202 template <Sdc::SchemeType SCHEME, class T, class U>
\n+
203 void limitFVar(T const & src, U & dst, int channel) const;
\n+
204
\n+
205private:
\n+
206 TopologyRefiner const & _refiner;
\n+
207
\n+
208private:
\n+
209 //
\n+
210 // Local class to fulfill interface for <typename MASK> in the Scheme mask queries:
\n+
211 //
\n+
212 class Mask {
\n+
213 public:
\n+
214 typedef REAL Weight; // Also part of the expected interface
\n+
215
\n+
216 public:
\n+
217 Mask(Weight* v, Weight* e, Weight* f) :
\n+
218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),
\n+
219 _vertCount(0), _edgeCount(0), _faceCount(0),
\n+
220 _faceWeightsForFaceCenters(false)
\n+
221 { }
\n+
222
\n+
223 ~Mask() { }
\n+
224
\n+
225 public: // Generic interface expected of <typename MASK>:
\n+
226 int GetNumVertexWeights() const { return _vertCount; }
\n+
227 int GetNumEdgeWeights() const { return _edgeCount; }
\n+
228 int GetNumFaceWeights() const { return _faceCount; }
\n+
229
\n+
230 void SetNumVertexWeights(int count) { _vertCount = count; }
\n+
231 void SetNumEdgeWeights( int count) { _edgeCount = count; }
\n+
232 void SetNumFaceWeights( int count) { _faceCount = count; }
\n+
233
\n+
234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }
\n+
235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }
\n+
236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }
\n+
237
\n+
238 Weight& VertexWeight(int index) { return _vertWeights[index]; }
\n+
239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }
\n+
240 Weight& FaceWeight( int index) { return _faceWeights[index]; }
\n+
241
\n+
242 bool AreFaceWeightsForFaceCenters() const { return _faceWeightsForFaceCenters; }
\n+
243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters = on; }
\n+
244
\n+
245 private:
\n+
246 Weight* _vertWeights;
\n+
247 Weight* _edgeWeights;
\n+
248 Weight* _faceWeights;
\n+
249
\n+
250 int _vertCount;
\n+
251 int _edgeCount;
\n+
252 int _faceCount;
\n+
253
\n+
254 bool _faceWeightsForFaceCenters;
\n+
255 };
\n+
256};
\n+
257
\n+
258
\n+
259//
\n+
260// Public entry points to the methods. Queries of the scheme type and its
\n+
261// use as a template parameter in subsequent implementation will be factored
\n+
262// out of a later release:
\n+
263//
\n+
264template <typename REAL>
\n+
265template <class T, class U>
\n+
266inline void
\n+
\n+
267PrimvarRefinerReal<REAL>::Interpolate(int level, T const & src, U & dst) const {
\n+
268
\n+
269 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
270
\n+
271 switch (_refiner._subdivType) {
\n+\n+
273 interpFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
274 interpFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
275 interpFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst);
\n+
276 break;
\n+
277 case Sdc::SCHEME_LOOP:
\n+
278 interpFromFaces<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
279 interpFromEdges<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
280 interpFromVerts<Sdc::SCHEME_LOOP>(level, src, dst);
\n+
281 break;
\n+\n+
283 interpFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
284 interpFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
285 interpFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n+
286 break;
\n+
287 }
\n+
288}
\n+
\n+
289
\n+
290template <typename REAL>
\n+
291template <class T, class U>
\n+
292inline void
\n+
\n+
293PrimvarRefinerReal<REAL>::InterpolateFaceVarying(int level, T const & src, U & dst, int channel) const {
\n+
294
\n+
295 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
296
\n+
297 switch (_refiner._subdivType) {
\n+\n+
299 interpFVarFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
300 interpFVarFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
301 interpFVarFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n+
302 break;
\n+
303 case Sdc::SCHEME_LOOP:
\n+
304 interpFVarFromFaces<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
305 interpFVarFromEdges<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
306 interpFVarFromVerts<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n+
307 break;
\n+\n+
309 interpFVarFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
310 interpFVarFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
311 interpFVarFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n+
312 break;
\n+
313 }
\n+
314}
\n+
\n+
315
\n+
316template <typename REAL>
\n+
317template <class T, class U>
\n+
318inline void
\n+
\n+
319PrimvarRefinerReal<REAL>::Limit(T const & src, U & dst) const {
\n+
320
\n+
321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
323 "Failure in PrimvarRefiner::Limit() -- "
\n+
324 "last level of refinement does not include full topology.");
\n+
325 return;
\n+
326 }
\n+
327
\n+
328 switch (_refiner._subdivType) {
\n+\n+
330 limit<Sdc::SCHEME_CATMARK>(src, dst, (U*)0, (U*)0);
\n+
331 break;
\n+
332 case Sdc::SCHEME_LOOP:
\n+
333 limit<Sdc::SCHEME_LOOP>(src, dst, (U*)0, (U*)0);
\n+
334 break;
\n+\n+
336 limit<Sdc::SCHEME_BILINEAR>(src, dst, (U*)0, (U*)0);
\n+
337 break;
\n+
338 }
\n+
339}
\n+
\n+
340
\n+
341template <typename REAL>
\n+
342template <class T, class U, class U1, class U2>
\n+
343inline void
\n+
\n+
344PrimvarRefinerReal<REAL>::Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const {
\n+
345
\n+
346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
348 "Failure in PrimvarRefiner::Limit() -- "
\n+
349 "last level of refinement does not include full topology.");
\n+
350 return;
\n+
351 }
\n+
352
\n+
353 switch (_refiner._subdivType) {
\n+\n+
355 limit<Sdc::SCHEME_CATMARK>(src, dstPos, &dstTan1, &dstTan2);
\n+
356 break;
\n+
357 case Sdc::SCHEME_LOOP:
\n+
358 limit<Sdc::SCHEME_LOOP>(src, dstPos, &dstTan1, &dstTan2);
\n+
359 break;
\n+\n+
361 limit<Sdc::SCHEME_BILINEAR>(src, dstPos, &dstTan1, &dstTan2);
\n+
362 break;
\n+
363 }
\n+
364}
\n+
\n+
365
\n+
366template <typename REAL>
\n+
367template <class T, class U>
\n+
368inline void
\n+
\n+
369PrimvarRefinerReal<REAL>::LimitFaceVarying(T const & src, U & dst, int channel) const {
\n+
370
\n+
371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n+\n+
373 "Failure in PrimvarRefiner::LimitFaceVarying() -- "
\n+
374 "last level of refinement does not include full topology.");
\n+
375 return;
\n+
376 }
\n+
377
\n+
378 switch (_refiner._subdivType) {
\n+\n+
380 limitFVar<Sdc::SCHEME_CATMARK>(src, dst, channel);
\n+
381 break;
\n+
382 case Sdc::SCHEME_LOOP:
\n+
383 limitFVar<Sdc::SCHEME_LOOP>(src, dst, channel);
\n+
384 break;
\n+\n+
386 limitFVar<Sdc::SCHEME_BILINEAR>(src, dst, channel);
\n+
387 break;
\n+
388 }
\n+
389}
\n+
\n+
\n+
390
\n+
391template <typename REAL>
\n+
392template <class T, class U>
\n+
393inline void
\n+
\n+
394PrimvarRefinerReal<REAL>::InterpolateFaceUniform(int level, T const & src, U & dst) const {
\n+
395
\n+
396 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
397
\n+
398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
399 Vtr::internal::Level const & child = refinement.child();
\n+
400
\n+
401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {
\n+
402
\n+
403 Vtr::Index pFace = refinement.getChildFaceParentFace(cFace);
\n+
404
\n+
405 dst[cFace] = src[pFace];
\n+
406 }
\n+
407}
\n+
\n+
408
\n+
409template <typename REAL>
\n+
410template <class T, class U>
\n+
411inline void
\n+
\n+
412PrimvarRefinerReal<REAL>::InterpolateVarying(int level, T const & src, U & dst) const {
\n+
413
\n+
414 assert(level>0 && level<=(int)_refiner._refinements.size());
\n+
415
\n+
416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
417 Vtr::internal::Level const & parent = refinement.parent();
\n+
418
\n+
419 //
\n+
420 // Group values to interpolate based on origin -- note that there may
\n+
421 // be none originating from faces:
\n+
422 //
\n+
423 if (refinement.getNumChildVerticesFromFaces() > 0) {
\n+
424
\n+
425 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n+
426
\n+
427 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
428 if (Vtr::IndexIsValid(cVert)) {
\n+
429
\n+
430 // Apply the weights to the parent face's vertices:
\n+
431 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n+
432
\n+
433 Weight fVaryingWeight = 1.0f / (Weight) fVerts.size();
\n+
434
\n+
435 dst[cVert].Clear();
\n+
436 for (int i = 0; i < fVerts.size(); ++i) {
\n+
437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);
\n+
438 }
\n+
439 }
\n+
440 }
\n+
441 }
\n+
442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n+
443
\n+
444 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
445 if (Vtr::IndexIsValid(cVert)) {
\n+
446
\n+
447 // Apply the weights to the parent edges's vertices
\n+
448 ConstIndexArray eVerts = parent.getEdgeVertices(edge);
\n+
449
\n+
450 dst[cVert].Clear();
\n+
451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);
\n+
452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);
\n+
453 }
\n+
454 }
\n+
455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n+
456
\n+
457 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
458 if (Vtr::IndexIsValid(cVert)) {
\n+
459
\n+
460 // Essentially copy the parent vertex:
\n+
461 dst[cVert].Clear();
\n+
462 dst[cVert].AddWithWeight(src[vert], 1.0f);
\n+
463 }
\n+
464 }
\n+
465}
\n+
\n+
466
\n+
467
\n+
468//
\n+
469// Internal implementation methods -- grouping vertices to be interpolated
\n+
470// based on the type of parent component from which they originated:
\n+
471//
\n+
472template <typename REAL>
\n+
473template <Sdc::SchemeType SCHEME, class T, class U>
\n+
474inline void
\n+
475PrimvarRefinerReal<REAL>::interpFromFaces(int level, T const & src, U & dst) const {
\n+
476
\n+
477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
478 Vtr::internal::Level const & parent = refinement.parent();
\n+
479
\n+
480 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n+
481
\n+
482 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
483
\n+
484 Vtr::internal::StackBuffer<Weight,16> fVertWeights(parent.getMaxValence());
\n+
485
\n+
486 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n+
487
\n+
488 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
489 if (!Vtr::IndexIsValid(cVert))
\n+
490 continue;
\n+
491
\n+
492 // Declare and compute mask weights for this vertex relative to its parent face:
\n+
493 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n+
494
\n+
495 Mask fMask(fVertWeights, 0, 0);
\n+
496 Vtr::internal::FaceInterface fHood(fVerts.size());
\n+
497
\n+
498 scheme.ComputeFaceVertexMask(fHood, fMask);
\n+
499
\n+
500 // Apply the weights to the parent face's vertices:
\n+
501 dst[cVert].Clear();
\n+
502
\n+
503 for (int i = 0; i < fVerts.size(); ++i) {
\n+
504
\n+
505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);
\n+
506 }
\n+
507 }
\n+
508}
\n+
509
\n+
510template <typename REAL>
\n+
511template <Sdc::SchemeType SCHEME, class T, class U>
\n+
512inline void
\n+
513PrimvarRefinerReal<REAL>::interpFromEdges(int level, T const & src, U & dst) const {
\n+
514
\n+
515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
516 Vtr::internal::Level const & parent = refinement.parent();
\n+
517 Vtr::internal::Level const & child = refinement.child();
\n+
518
\n+
519 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
520
\n+
521 Vtr::internal::EdgeInterface eHood(parent);
\n+
522
\n+
523 Weight eVertWeights[2];
\n+
524 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parent.getMaxEdgeFaces());
\n+
525
\n+
526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n+
527
\n+
528 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
529 if (!Vtr::IndexIsValid(cVert))
\n+
530 continue;
\n+
531
\n+
532 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
533 ConstIndexArray eVerts = parent.getEdgeVertices(edge),
\n+
534 eFaces = parent.getEdgeFaces(edge);
\n+
535
\n+
536 Mask eMask(eVertWeights, 0, eFaceWeights);
\n+
537
\n+
538 eHood.SetIndex(edge);
\n+
539
\n+
540 Sdc::Crease::Rule pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n+
541 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n+
542
\n+
543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n+
544
\n+
545 // Apply the weights to the parent edges's vertices and (if applicable) to
\n+
546 // the child vertices of its incident faces:
\n+
547 dst[cVert].Clear();
\n+
548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);
\n+
549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);
\n+
550
\n+
551 if (eMask.GetNumFaceWeights() > 0) {
\n+
552
\n+
553 for (int i = 0; i < eFaces.size(); ++i) {
\n+
554
\n+
555 if (eMask.AreFaceWeightsForFaceCenters()) {
\n+
556 assert(refinement.getNumChildVerticesFromFaces() > 0);
\n+
557 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n+
558
\n+
559 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);
\n+
561 } else {
\n+
562 Vtr::Index pFace = eFaces[i];
\n+
563 ConstIndexArray pFaceEdges = parent.getFaceEdges(pFace),
\n+
564 pFaceVerts = parent.getFaceVertices(pFace);
\n+
565
\n+
566 int eInFace = 0;
\n+
567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n+
568
\n+
569 int vInFace = eInFace + 2;
\n+
570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n+
571
\n+
572 Vtr::Index pVertNext = pFaceVerts[vInFace];
\n+
573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);
\n+
574 }
\n+
575 }
\n+
576 }
\n+
577 }
\n+
578}
\n+
579
\n+
580template <typename REAL>
\n+
581template <Sdc::SchemeType SCHEME, class T, class U>
\n+
582inline void
\n+
583PrimvarRefinerReal<REAL>::interpFromVerts(int level, T const & src, U & dst) const {
\n+
584
\n+
585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
586 Vtr::internal::Level const & parent = refinement.parent();
\n+
587 Vtr::internal::Level const & child = refinement.child();
\n+
588
\n+
589 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
590
\n+
591 Vtr::internal::VertexInterface vHood(parent, child);
\n+
592
\n+
593 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parent.getMaxValence());
\n+
594
\n+
595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n+
596
\n+
597 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
598 if (!Vtr::IndexIsValid(cVert))
\n+
599 continue;
\n+
600
\n+
601 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
602 ConstIndexArray vEdges = parent.getVertexEdges(vert),
\n+
603 vFaces = parent.getVertexFaces(vert);
\n+
604
\n+
605 Weight vVertWeight,
\n+
606 * vEdgeWeights = weightBuffer,
\n+
607 * vFaceWeights = vEdgeWeights + vEdges.size();
\n+
608
\n+
609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n+
610
\n+
611 vHood.SetIndex(vert, cVert);
\n+
612
\n+
613 Sdc::Crease::Rule pRule = parent.getVertexRule(vert);
\n+
614 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n+
615
\n+
616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n+
617
\n+
618 // Apply the weights to the parent vertex, the vertices opposite its incident
\n+
619 // edges, and the child vertices of its incident faces:
\n+
620 //
\n+
621 // In order to improve numerical precision, it's better to apply smaller weights
\n+
622 // first, so begin with the face-weights followed by the edge-weights and the
\n+
623 // vertex weight last.
\n+
624 dst[cVert].Clear();
\n+
625
\n+
626 if (vMask.GetNumFaceWeights() > 0) {
\n+
627 assert(vMask.AreFaceWeightsForFaceCenters());
\n+
628
\n+
629 for (int i = 0; i < vFaces.size(); ++i) {
\n+
630
\n+
631 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n+
632 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);
\n+
634 }
\n+
635 }
\n+
636 if (vMask.GetNumEdgeWeights() > 0) {
\n+
637
\n+
638 for (int i = 0; i < vEdges.size(); ++i) {
\n+
639
\n+
640 ConstIndexArray eVerts = parent.getEdgeVertices(vEdges[i]);
\n+
641 Vtr::Index pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n+
642
\n+
643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);
\n+
644 }
\n+
645 }
\n+
646 dst[cVert].AddWithWeight(src[vert], vVertWeight);
\n+
647 }
\n+
648}
\n+
649
\n+
650
\n+
651//
\n+
652// Internal face-varying implementation details:
\n+
653//
\n+
654template <typename REAL>
\n+
655template <Sdc::SchemeType SCHEME, class T, class U>
\n+
656inline void
\n+
657PrimvarRefinerReal<REAL>::interpFVarFromFaces(int level, T const & src, U & dst, int channel) const {
\n+
658
\n+
659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
660
\n+
661 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n+
662
\n+
663 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
664
\n+
665 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
666 Vtr::internal::Level const & childLevel = refinement.child();
\n+
667
\n+
668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
670
\n+
671 Vtr::internal::StackBuffer<Weight,16> fValueWeights(parentLevel.getMaxValence());
\n+
672
\n+
673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {
\n+
674
\n+
675 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n+
676 if (!Vtr::IndexIsValid(cVert))
\n+
677 continue;
\n+
678
\n+
679 Vtr::Index cVertValue = childFVar.getVertexValueOffset(cVert);
\n+
680
\n+
681 // The only difference for face-varying here is that we get the values associated
\n+
682 // with each face-vertex directly from the FVarLevel, rather than using the parent
\n+
683 // face-vertices directly. If any face-vertex has any sibling values, then we may
\n+
684 // get the wrong one using the face-vertex index directly.
\n+
685
\n+
686 // Declare and compute mask weights for this vertex relative to its parent face:
\n+
687 ConstIndexArray fValues = parentFVar.getFaceValues(face);
\n+
688
\n+
689 Mask fMask(fValueWeights, 0, 0);
\n+
690 Vtr::internal::FaceInterface fHood(fValues.size());
\n+
691
\n+
692 scheme.ComputeFaceVertexMask(fHood, fMask);
\n+
693
\n+
694 // Apply the weights to the parent face's vertices:
\n+
695 dst[cVertValue].Clear();
\n+
696
\n+
697 for (int i = 0; i < fValues.size(); ++i) {
\n+
698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);
\n+
699 }
\n+
700 }
\n+
701}
\n+
702
\n+
703template <typename REAL>
\n+
704template <Sdc::SchemeType SCHEME, class T, class U>
\n+
705inline void
\n+
706PrimvarRefinerReal<REAL>::interpFVarFromEdges(int level, T const & src, U & dst, int channel) const {
\n+
707
\n+
708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
709
\n+
710 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
711
\n+
712 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
713 Vtr::internal::Level const & childLevel = refinement.child();
\n+
714
\n+
715 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n+
716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
718
\n+
719 //
\n+
720 // Allocate and initialize (if linearly interpolated) interpolation weights for
\n+
721 // the edge mask:
\n+
722 //
\n+
723 Weight eVertWeights[2];
\n+
724 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parentLevel.getMaxEdgeFaces());
\n+
725
\n+
726 Mask eMask(eVertWeights, 0, eFaceWeights);
\n+
727
\n+
728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n+
729 if (isLinearFVar) {
\n+
730 eMask.SetNumVertexWeights(2);
\n+
731 eMask.SetNumEdgeWeights(0);
\n+
732 eMask.SetNumFaceWeights(0);
\n+
733
\n+
734 eVertWeights[0] = 0.5f;
\n+
735 eVertWeights[1] = 0.5f;
\n+
736 }
\n+
737
\n+
738 Vtr::internal::EdgeInterface eHood(parentLevel);
\n+
739
\n+
740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {
\n+
741
\n+
742 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n+
743 if (!Vtr::IndexIsValid(cVert))
\n+
744 continue;
\n+
745
\n+
746 ConstIndexArray cVertValues = childFVar.getVertexValues(cVert);
\n+
747
\n+
748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n+
749 if (fvarEdgeVertMatchesVertex) {
\n+
750 //
\n+
751 // If smoothly interpolated, compute new weights for the edge mask:
\n+
752 //
\n+
753 if (!isLinearFVar) {
\n+
754 eHood.SetIndex(edge);
\n+
755
\n+
756 Sdc::Crease::Rule pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)
\n+
757 ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n+
758 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n+
759
\n+
760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n+
761 }
\n+
762
\n+
763 // Apply the weights to the parent edge's vertices and (if applicable) to
\n+
764 // the child vertices of its incident faces:
\n+
765 //
\n+
766 // Even though the face-varying topology matches the vertex topology, we need
\n+
767 // to be careful here when getting values corresponding to the two end-vertices.
\n+
768 // While the edge may be continuous, the vertices at their ends may have
\n+
769 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n+
770 // of the end-vertex) and so have sibling values associated with them. In most
\n+
771 // cases the topology for an end-vertex will match and we can use it directly,
\n+
772 // but we must still check and retrieve as needed.
\n+
773 //
\n+
774 // Indices for values corresponding to face-vertices are guaranteed to match,
\n+
775 // so we can use the child-vertex indices directly.
\n+
776 //
\n+
777 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n+
778 // values in the "src" to account for the possible indirection that may exist at
\n+
779 // level 0 -- where there may be fewer values than vertices and an additional
\n+
780 // indirection is necessary. We can use a vertex index directly for "dst" when
\n+
781 // it matches.
\n+
782 //
\n+
783 Vtr::Index eVertValues[2];
\n+
784
\n+
785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);
\n+
786
\n+
787 Index cVertValue = cVertValues[0];
\n+
788
\n+
789 dst[cVertValue].Clear();
\n+
790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);
\n+
791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);
\n+
792
\n+
793 if (eMask.GetNumFaceWeights() > 0) {
\n+
794
\n+
795 ConstIndexArray eFaces = parentLevel.getEdgeFaces(edge);
\n+
796
\n+
797 for (int i = 0; i < eFaces.size(); ++i) {
\n+
798 if (eMask.AreFaceWeightsForFaceCenters()) {
\n+
799
\n+
800 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n+
801 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
802
\n+
803 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n+
804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);
\n+
805 } else {
\n+
806 Vtr::Index pFace = eFaces[i];
\n+
807 ConstIndexArray pFaceEdges = parentLevel.getFaceEdges(pFace),
\n+
808 pFaceVerts = parentLevel.getFaceVertices(pFace);
\n+
809
\n+
810 int eInFace = 0;
\n+
811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n+
812
\n+
813 // Edge "i" spans vertices [i,i+1] so we want i+2...
\n+
814 int vInFace = eInFace + 2;
\n+
815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n+
816
\n+
817 Vtr::Index pValueNext = parentFVar.getFaceValues(pFace)[vInFace];
\n+
818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);
\n+
819 }
\n+
820 }
\n+
821 }
\n+
822 } else {
\n+
823 //
\n+
824 // Mismatched edge-verts should just be linearly interpolated between the pairs of
\n+
825 // values for each sibling of the child edge-vertex -- the question is: which face
\n+
826 // holds that pair of values for a given sibling?
\n+
827 //
\n+
828 // In the manifold case, the sibling and edge-face indices will correspond. We
\n+
829 // will eventually need to update this to account for > 3 incident faces.
\n+
830 //
\n+
831 for (int i = 0; i < cVertValues.size(); ++i) {
\n+
832 Vtr::Index eVertValues[2];
\n+
833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);
\n+
834 assert(eFaceIndex == i);
\n+
835
\n+
836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);
\n+
837
\n+
838 Index cVertValue = cVertValues[i];
\n+
839
\n+
840 dst[cVertValue].Clear();
\n+
841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);
\n+
842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);
\n+
843 }
\n+
844 }
\n+
845 }
\n+
846}
\n+
847
\n+
848template <typename REAL>
\n+
849template <Sdc::SchemeType SCHEME, class T, class U>
\n+
850inline void
\n+
851PrimvarRefinerReal<REAL>::interpFVarFromVerts(int level, T const & src, U & dst, int channel) const {
\n+
852
\n+
853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n+
854
\n+
855 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
856
\n+
857 Vtr::internal::Level const & parentLevel = refinement.parent();
\n+
858 Vtr::internal::Level const & childLevel = refinement.child();
\n+
859
\n+
860 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n+
861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n+
862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n+
863
\n+
864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n+
865
\n+
866 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parentLevel.getMaxValence());
\n+
867
\n+
868 Vtr::internal::StackBuffer<Vtr::Index,16> vEdgeValues(parentLevel.getMaxValence());
\n+
869
\n+
870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);
\n+
871
\n+
872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {
\n+
873
\n+
874 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n+
875 if (!Vtr::IndexIsValid(cVert))
\n+
876 continue;
\n+
877
\n+
878 ConstIndexArray pVertValues = parentFVar.getVertexValues(vert),
\n+
879 cVertValues = childFVar.getVertexValues(cVert);
\n+
880
\n+
881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n+
882 if (isLinearFVar && fvarVertVertMatchesVertex) {
\n+
883 dst[cVertValues[0]].Clear();
\n+
884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);
\n+
885 continue;
\n+
886 }
\n+
887
\n+
888 if (fvarVertVertMatchesVertex) {
\n+
889 //
\n+
890 // Declare and compute mask weights for this vertex relative to its parent edge:
\n+
891 //
\n+
892 // (We really need to encapsulate this somewhere else for use here and in the
\n+
893 // general case)
\n+
894 //
\n+
895 ConstIndexArray vEdges = parentLevel.getVertexEdges(vert);
\n+
896
\n+
897 Weight vVertWeight;
\n+
898 Weight * vEdgeWeights = weightBuffer;
\n+
899 Weight * vFaceWeights = vEdgeWeights + vEdges.size();
\n+
900
\n+
901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n+
902
\n+
903 vHood.SetIndex(vert, cVert);
\n+
904
\n+
905 Sdc::Crease::Rule pRule = parentLevel.getVertexRule(vert);
\n+
906 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n+
907
\n+
908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n+
909
\n+
910 // Apply the weights to the parent vertex, the vertices opposite its incident
\n+
911 // edges, and the child vertices of its incident faces:
\n+
912 //
\n+
913 // Even though the face-varying topology matches the vertex topology, we need
\n+
914 // to be careful here when getting values corresponding to vertices at the
\n+
915 // ends of edges. While the edge may be continuous, the end vertex may have
\n+
916 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n+
917 // of the end-vertex) and so have sibling values associated with them. In most
\n+
918 // cases the topology for an end-vertex will match and we can use it directly,
\n+
919 // but we must still check and retrieve as needed.
\n+
920 //
\n+
921 // Indices for values corresponding to face-vertices are guaranteed to match,
\n+
922 // so we can use the child-vertex indices directly.
\n+
923 //
\n+
924 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n+
925 // values in the "src" to account for the possible indirection that may exist at
\n+
926 // level 0 -- where there may be fewer values than vertices and an additional
\n+
927 // indirection is necessary. We can use a vertex index directly for "dst" when
\n+
928 // it matches.
\n+
929 //
\n+
930 // As with applying the mask to vertex data, in order to improve numerical
\n+
931 // precision, it's better to apply smaller weights first, so begin with the
\n+
932 // face-weights followed by the edge-weights and the vertex weight last.
\n+
933 //
\n+
934 Vtr::Index pVertValue = pVertValues[0];
\n+
935 Vtr::Index cVertValue = cVertValues[0];
\n+
936
\n+
937 dst[cVertValue].Clear();
\n+
938 if (vMask.GetNumFaceWeights() > 0) {
\n+
939 assert(vMask.AreFaceWeightsForFaceCenters());
\n+
940
\n+
941 ConstIndexArray vFaces = parentLevel.getVertexFaces(vert);
\n+
942
\n+
943 for (int i = 0; i < vFaces.size(); ++i) {
\n+
944
\n+
945 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n+
946 assert(Vtr::IndexIsValid(cVertOfFace));
\n+
947
\n+
948 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n+
949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);
\n+
950 }
\n+
951 }
\n+
952 if (vMask.GetNumEdgeWeights() > 0) {
\n+
953
\n+
954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);
\n+
955
\n+
956 for (int i = 0; i < vEdges.size(); ++i) {
\n+
957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);
\n+
958 }
\n+
959 }
\n+
960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);
\n+
961 } else {
\n+
962 //
\n+
963 // Each FVar value associated with a vertex will be either a corner or a crease,
\n+
964 // or potentially in transition from corner to crease:
\n+
965 // - if the CHILD is a corner, there can be no transition so we have a corner
\n+
966 // - otherwise if the PARENT is a crease, both will be creases (no transition)
\n+
967 // - otherwise the parent must be a corner and the child a crease (transition)
\n+
968 //
\n+
969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags = parentFVar.getVertexValueTags(vert);
\n+
970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags = childFVar.getVertexValueTags(cVert);
\n+
971
\n+
972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size(); ++cSiblingIndex) {
\n+
973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert, cSiblingIndex);
\n+
974 assert(pSiblingIndex == cSiblingIndex);
\n+
975
\n+
976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;
\n+
977
\n+
978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;
\n+
979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;
\n+
980
\n+
981 Vtr::Index pVertValue = pVertValues[pSibling];
\n+
982 Vtr::Index cVertValue = cVertValues[cSibling];
\n+
983
\n+
984 dst[cVertValue].Clear();
\n+
985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {
\n+
986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);
\n+
987 } else {
\n+
988 //
\n+
989 // We have either a crease or a transition from corner to crease -- in
\n+
990 // either case, we need the end values for the full/fractional crease:
\n+
991 //
\n+
992 Index pEndValues[2];
\n+
993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);
\n+
994
\n+
995 Weight vWeight = 0.75f;
\n+
996 Weight eWeight = 0.125f;
\n+
997
\n+
998 //
\n+
999 // If semi-sharp we need to apply fractional weighting -- if made sharp because
\n+
1000 // of the other sibling (dependent-sharp) use the fractional weight from that
\n+
1001 // other sibling (should only occur when there are 2):
\n+
1002 //
\n+
1003 if (pValueTags[pSibling].isSemiSharp()) {
\n+
1004 Weight wCorner = pValueTags[pSibling].isDepSharp()
\n+
1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)
\n+
1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);
\n+
1007 Weight wCrease = 1.0f - wCorner;
\n+
1008
\n+
1009 vWeight = wCrease * 0.75f + wCorner;
\n+
1010 eWeight = wCrease * 0.125f;
\n+
1011 }
\n+
1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);
\n+
1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);
\n+
1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);
\n+
1015 }
\n+
1016 }
\n+
1017 }
\n+
1018 }
\n+
1019}
\n+
1020
\n+
1021template <typename REAL>
\n+
1022template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n+
1023inline void
\n+
1024PrimvarRefinerReal<REAL>::limit(T const & src, U & dstPos, U1 * dstTan1Ptr, U2 * dstTan2Ptr) const {
\n+
1025
\n+
1026 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
1027
\n+
1028 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n+
1029
\n+
1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n+
1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);
\n+
1032 int numMasks = 1 + (hasTangents ? 2 : 0);
\n+
1033
\n+
1034 Vtr::internal::StackBuffer<Index,33> indexBuffer(maxWeightsPerMask);
\n+
1035 Vtr::internal::StackBuffer<Weight,99> weightBuffer(numMasks * maxWeightsPerMask);
\n+
1036
\n+
1037 Weight * vPosWeights = weightBuffer,
\n+
1038 * ePosWeights = vPosWeights + 1,
\n+
1039 * fPosWeights = ePosWeights + level.getMaxValence();
\n+
1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,
\n+
1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,
\n+
1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;
\n+
1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,
\n+
1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,
\n+
1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;
\n+
1046
\n+
1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);
\n+
1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);
\n+
1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);
\n+
1050
\n+
1051 // This is a bit obscure -- assigning both parent and child as last level -- but
\n+
1052 // this mask type was intended for another purpose. Consider one for the limit:
\n+
1053 Vtr::internal::VertexInterface vHood(level, level);
\n+
1054
\n+
1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n+
1056 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n+
1057
\n+
1058 // Incomplete vertices (present in sparse refinement) do not have their full
\n+
1059 // topological neighborhood to determine a proper limit -- just leave the
\n+
1060 // vertex at the refined location and continue to the next:
\n+
1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {
\n+
1062 dstPos[vert].Clear();
\n+
1063 dstPos[vert].AddWithWeight(src[vert], 1.0);
\n+
1064 if (hasTangents) {
\n+
1065 (*dstTan1Ptr)[vert].Clear();
\n+
1066 (*dstTan2Ptr)[vert].Clear();
\n+
1067 }
\n+
1068 continue;
\n+
1069 }
\n+
1070
\n+
1071 //
\n+
1072 // Limit masks require the subdivision Rule for the vertex in order to deal
\n+
1073 // with infinitely sharp features correctly -- including boundaries and corners.
\n+
1074 // The vertex neighborhood is minimally defined with vertex and edge counts.
\n+
1075 //
\n+
1076 Sdc::Crease::Rule vRule = level.getVertexRule(vert);
\n+
1077
\n+
1078 // This is a bit obscure -- child vertex index will be ignored here
\n+
1079 vHood.SetIndex(vert, vert);
\n+
1080
\n+
1081 if (hasTangents) {
\n+
1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);
\n+
1083 } else {
\n+
1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);
\n+
1085 }
\n+
1086
\n+
1087 //
\n+
1088 // Gather the neighboring vertices of this vertex -- the vertices opposite its
\n+
1089 // incident edges, and the opposite vertices of its incident faces:
\n+
1090 //
\n+
1091 Index * eIndices = indexBuffer;
\n+
1092 Index * fIndices = indexBuffer + vEdges.size();
\n+
1093
\n+
1094 for (int i = 0; i < vEdges.size(); ++i) {
\n+
1095 ConstIndexArray eVerts = level.getEdgeVertices(vEdges[i]);
\n+
1096
\n+
1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n+
1098 }
\n+
1099 if (posMask.GetNumFaceWeights() || (hasTangents && tan1Mask.GetNumFaceWeights())) {
\n+
1100 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n+
1101 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n+
1102
\n+
1103 for (int i = 0; i < vFaces.size(); ++i) {
\n+
1104 ConstIndexArray fVerts = level.getFaceVertices(vFaces[i]);
\n+
1105
\n+
1106 LocalIndex vOppInFace = (vInFace[i] + 2);
\n+
1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (LocalIndex)fVerts.size();
\n+
1108
\n+
1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];
\n+
1110 }
\n+
1111 }
\n+
1112
\n+
1113 //
\n+
1114 // Combine the weights and indices for position and tangents. As with applying
\n+
1115 // refinement masks to vertex data, in order to improve numerical precision, it's
\n+
1116 // better to apply smaller weights first, so begin with the face-weights followed
\n+
1117 // by the edge-weights and the vertex weight last.
\n+
1118 //
\n+
1119 dstPos[vert].Clear();
\n+
1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {
\n+
1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);
\n+
1122 }
\n+
1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {
\n+
1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);
\n+
1125 }
\n+
1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);
\n+
1127
\n+
1128 //
\n+
1129 // Apply the tangent masks -- both will have the same number of weights and
\n+
1130 // indices (one tangent may be "padded" to accommodate the other), but these
\n+
1131 // may differ from those of the position:
\n+
1132 //
\n+
1133 if (hasTangents) {
\n+
1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());
\n+
1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());
\n+
1136
\n+
1137 U1 & dstTan1 = *dstTan1Ptr;
\n+
1138 U2 & dstTan2 = *dstTan2Ptr;
\n+
1139
\n+
1140 dstTan1[vert].Clear();
\n+
1141 dstTan2[vert].Clear();
\n+
1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {
\n+
1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);
\n+
1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);
\n+
1145 }
\n+
1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {
\n+
1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);
\n+
1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);
\n+
1149 }
\n+
1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);
\n+
1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);
\n+
1152 }
\n+
1153 }
\n+
1154}
\n+
1155
\n+
1156template <typename REAL>
\n+
1157template <Sdc::SchemeType SCHEME, class T, class U>
\n+
1158inline void
\n+
1159PrimvarRefinerReal<REAL>::limitFVar(T const & src, U & dst, int channel) const {
\n+
1160
\n+
1161 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n+
1162
\n+
1163 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n+
1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel(channel);
\n+
1165
\n+
1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n+
1167
\n+
1168 Vtr::internal::StackBuffer<Weight,33> weightBuffer(maxWeightsPerMask);
\n+
1169 Vtr::internal::StackBuffer<Index,16> vEdgeBuffer(level.getMaxValence());
\n+
1170
\n+
1171 // This is a bit obscure -- assign both parent and child as last level
\n+
1172 Vtr::internal::VertexInterface vHood(level, level);
\n+
1173
\n+
1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n+
1175
\n+
1176 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n+
1177 ConstIndexArray vValues = fvarChannel.getVertexValues(vert);
\n+
1178
\n+
1179 // Incomplete vertices (present in sparse refinement) do not have their full
\n+
1180 // topological neighborhood to determine a proper limit -- just leave the
\n+
1181 // values (perhaps more than one per vertex) at the refined location.
\n+
1182 //
\n+
1183 // The same can be done if the face-varying channel is purely linear.
\n+
1184 //
\n+
1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0));
\n+
1186 if (isIncomplete || fvarChannel.isLinear()) {
\n+
1187 for (int i = 0; i < vValues.size(); ++i) {
\n+
1188 Vtr::Index vValue = vValues[i];
\n+
1189
\n+
1190 dst[vValue].Clear();
\n+
1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n+
1192 }
\n+
1193 continue;
\n+
1194 }
\n+
1195
\n+
1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);
\n+
1197 if (fvarVertMatchesVertex) {
\n+
1198
\n+
1199 // Assign the mask weights to the common buffer and compute the mask:
\n+
1200 //
\n+
1201 Weight * vWeights = weightBuffer,
\n+
1202 * eWeights = vWeights + 1,
\n+
1203 * fWeights = eWeights + vEdges.size();
\n+
1204
\n+
1205 Mask vMask(vWeights, eWeights, fWeights);
\n+
1206
\n+
1207 vHood.SetIndex(vert, vert);
\n+
1208
\n+
1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));
\n+
1210
\n+
1211 //
\n+
1212 // Apply mask to corresponding FVar values for neighboring vertices:
\n+
1213 //
\n+
1214 Vtr::Index vValue = vValues[0];
\n+
1215
\n+
1216 dst[vValue].Clear();
\n+
1217 if (vMask.GetNumFaceWeights() > 0) {
\n+
1218 assert(!vMask.AreFaceWeightsForFaceCenters());
\n+
1219
\n+
1220 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n+
1221 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n+
1222
\n+
1223 for (int i = 0; i < vFaces.size(); ++i) {
\n+
1224 ConstIndexArray faceValues = fvarChannel.getFaceValues(vFaces[i]);
\n+
1225 LocalIndex vOppInFace = vInFace[i] + 2;
\n+
1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues.size();
\n+
1227
\n+
1228 Index vValueOppositeFace = faceValues[vOppInFace];
\n+
1229
\n+
1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);
\n+
1231 }
\n+
1232 }
\n+
1233 if (vMask.GetNumEdgeWeights() > 0) {
\n+
1234 Index * vEdgeValues = vEdgeBuffer;
\n+
1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);
\n+
1236
\n+
1237 for (int i = 0; i < vEdges.size(); ++i) {
\n+
1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);
\n+
1239 }
\n+
1240 }
\n+
1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);
\n+
1242 } else {
\n+
1243 //
\n+
1244 // Sibling FVar values associated with a vertex will be either a corner or a crease:
\n+
1245 //
\n+
1246 for (int i = 0; i < vValues.size(); ++i) {
\n+
1247 Vtr::Index vValue = vValues[i];
\n+
1248
\n+
1249 dst[vValue].Clear();
\n+
1250 if (fvarChannel.getValueTag(vValue).isCorner()) {
\n+
1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n+
1252 } else {
\n+
1253 Index vEndValues[2];
\n+
1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);
\n+
1255
\n+
1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);
\n+
1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);
\n+
1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);
\n+
1259 }
\n+
1260 }
\n+
1261 }
\n+
1262 }
\n+
1263}
\n+
1264
\n+
\n+
1265class PrimvarRefiner : public PrimvarRefinerReal<float> {
\n+
1266public:
\n+
\n+\n+
1268 : PrimvarRefinerReal<float>(refiner) { }
\n+
\n+
1269};
\n+
\n+
1270
\n+
1271} // end namespace Far
\n+
1272
\n+
1273} // end namespace OPENSUBDIV_VERSION
\n+
1274using namespace OPENSUBDIV_VERSION;
\n+
1275} // end namespace OpenSubdiv
\n+
1276
\n+
1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n \n+\n+
void Error(ErrorType err, const char *format,...)
Sends an OSD error with a message (internal use only)
\n+
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n+
Vtr::ConstLocalIndexArray ConstLocalIndexArray
Definition types.h:48
\n+
@ FAR_RUNTIME_ERROR
Issue a generic runtime error, but continue execution.
Definition error.h:40
\n \n-
Object used to compute and query ptex face indices.
Definition ptexIndices.h:46
\n-
int GetFaceId(Index f) const
Returns the ptex face index given a coarse face 'f' or -1.
\n-
PtexIndices(TopologyRefiner const &refiner)
Constructor.
\n-
void GetAdjacency(TopologyRefiner const &refiner, int face, int quadrant, int adjFaces[4], int adjEdges[4]) const
Returns ptex face adjacency information for a given coarse face.
\n-
int GetNumFaces() const
Returns the number of ptex faces in the mesh.
\n-\n-
Stores topology data for a specified set of refinement options.
\n+\n+
bool IndexIsValid(Index index)
Definition types.h:58
\n+\n+\n+\n+
Applies refinement operations to generic primvar data.
\n+
void Limit(T const &src, U &dstPos) const
Apply limit weights to a primvar buffer.
\n+\n+
void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const
\n+
void InterpolateFaceUniform(int level, T const &src, U &dst) const
Refine uniform (per-face) primvar data between levels.
\n+\n+
void InterpolateVarying(int level, T const &src, U &dst) const
Apply only varying interpolation weights to a primvar buffer for a single level of refinement.
\n+
void Interpolate(int level, T const &src, U &dst) const
Apply vertex interpolation weights to a primvar buffer for a single level of refinement.
\n+
void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0) const
Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varyin...
\n+\n+
void LimitFaceVarying(T const &src, U &dst, int channel=0) const
\n+\n+\n+
Stores topology data for a specified set of refinement options.
\n+\n+\n+
Scheme is a class template which provides all implementation for the subdivision schemes supported by...
Definition scheme.h:66
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-ptexIndices.h\n+primvarRefiner.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2015 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,90 +23,1388 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_PTEX_INDICES_H\n-25#define OPENSUBDIV3_FAR_PTEX_INDICES_H\n+24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n+25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n 26\n 27#include \"../version.h\"\n 28\n-29#include \"../far/topologyRefiner.h\"\n-30#include \"../far/types.h\"\n-31\n-32#include \n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38\n-_\b4_\b6class _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs {\n-47\n-48public:\n+29#include \"../sdc/types.h\"\n+30#include \"../sdc/options.h\"\n+31#include \"../sdc/bilinearScheme.h\"\n+32#include \"../sdc/catmarkScheme.h\"\n+33#include \"../sdc/loopScheme.h\"\n+34#include \"../vtr/level.h\"\n+35#include \"../vtr/fvarLevel.h\"\n+36#include \"../vtr/refinement.h\"\n+37#include \"../vtr/fvarRefinement.h\"\n+38#include \"../vtr/stackBuffer.h\"\n+39#include \"../vtr/componentInterfaces.h\"\n+40#include \"../far/types.h\"\n+41#include \"../far/error.h\"\n+42#include \"../far/topologyLevel.h\"\n+43#include \"../far/topologyRefiner.h\"\n+44\n+45#include \n+46\n+47namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+48namespace OPENSUBDIV_VERSION {\n 49\n-_\b5_\b1 _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner);\n-52\n-_\b5_\b4 _\b~_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs();\n-55\n+50namespace Far {\n+51\n+55template \n+_\b5_\b6class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n 57\n-60\n-_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const;\n-64\n-_\b6_\b7 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd(_\bI_\bn_\bd_\be_\bx f) const;\n-68\n-_\b8_\b3 void _\bG_\be_\bt_\bA_\bd_\bj_\ba_\bc_\be_\bn_\bc_\by(\n-84 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n-85 int face, int quadrant,\n-86 int adjFaces[4], int adjEdges[4]) const;\n-87\n-89\n-90private:\n-91\n-92 void initializePtexIndices(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner);\n-93\n-94private:\n-95\n-96 std::vector _ptexIndices;\n-97};\n-98\n-99\n-100} // end namespace Far\n-101\n-102} // end namespace OPENSUBDIV_VERSION\n-103using namespace OPENSUBDIV_VERSION;\n-104} // end namespace OpenSubdiv\n-105\n-106#endif /* OPENSUBDIV3_FAR_PTEX_INDICES_H */\n+58public:\n+_\b5_\b9 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner) : _refiner(refiner) { }\n+_\b6_\b0 _\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl() { }\n+61\n+_\b6_\b2 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br() const { return _refiner; }\n+63\n+65\n+100\n+_\b1_\b1_\b3 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U &\n+dst) const;\n+114\n+_\b1_\b3_\b0 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const &\n+src, U & dst) const;\n+131\n+_\b1_\b4_\b8 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const\n+& src, U & dst) const;\n+149\n+_\b1_\b6_\b1 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const\n+& src, U & dst, int channel = 0) const;\n+162\n+163\n+_\b1_\b7_\b5 template void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos) const;\n+176\n+177 template \n+_\b1_\b7_\b8 void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;\n+179\n+_\b1_\b8_\b0 template void _\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst,\n+int channel = 0) const;\n+181\n+183\n+184private:\n+185 typedef REAL Weight;\n+186\n+187 // Non-copyable:\n+188 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const & src) : _refiner(src._refiner)\n+{ }\n+189 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl & operator=(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const &) { return *this;\n+}\n+190\n+191 template void interpFromFaces\n+(int, T const &, U &) const;\n+192 template void interpFromEdges\n+(int, T const &, U &) const;\n+193 template void interpFromVerts\n+(int, T const &, U &) const;\n+194\n+195 template void\n+interpFVarFromFaces(int, T const &, U &, int) const;\n+196 template void\n+interpFVarFromEdges(int, T const &, U &, int) const;\n+197 template void\n+interpFVarFromVerts(int, T const &, U &, int) const;\n+198\n+199 template \n+200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;\n+201\n+202 template \n+203 void limitFVar(T const & src, U & dst, int channel) const;\n+204\n+205private:\n+206 TopologyRefiner const & _refiner;\n+207\n+208private:\n+209 //\n+210 // Local class to fulfill interface for in the Scheme mask\n+queries:\n+211 //\n+212 class Mask {\n+213 public:\n+214 typedef REAL Weight; // Also part of the expected interface\n+215\n+216 public:\n+217 Mask(Weight* v, Weight* e, Weight* f) :\n+218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),\n+219 _vertCount(0), _edgeCount(0), _faceCount(0),\n+220 _faceWeightsForFaceCenters(false)\n+221 { }\n+222\n+223 ~Mask() { }\n+224\n+225 public: // Generic interface expected of :\n+226 int GetNumVertexWeights() const { return _vertCount; }\n+227 int GetNumEdgeWeights() const { return _edgeCount; }\n+228 int GetNumFaceWeights() const { return _faceCount; }\n+229\n+230 void SetNumVertexWeights(int count) { _vertCount = count; }\n+231 void SetNumEdgeWeights( int count) { _edgeCount = count; }\n+232 void SetNumFaceWeights( int count) { _faceCount = count; }\n+233\n+234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }\n+235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }\n+236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }\n+237\n+238 Weight& VertexWeight(int index) { return _vertWeights[index]; }\n+239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }\n+240 Weight& FaceWeight( int index) { return _faceWeights[index]; }\n+241\n+242 bool AreFaceWeightsForFaceCenters() const { return\n+_faceWeightsForFaceCenters; }\n+243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters =\n+on; }\n+244\n+245 private:\n+246 Weight* _vertWeights;\n+247 Weight* _edgeWeights;\n+248 Weight* _faceWeights;\n+249\n+250 int _vertCount;\n+251 int _edgeCount;\n+252 int _faceCount;\n+253\n+254 bool _faceWeightsForFaceCenters;\n+255 };\n+256};\n+257\n+258\n+259//\n+260// Public entry points to the methods. Queries of the scheme type and its\n+261// use as a template parameter in subsequent implementation will be factored\n+262// out of a later release:\n+263//\n+264template \n+265template \n+266inline void\n+_\b2_\b6_\b7_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U & dst)\n+const {\n+268\n+269 assert(level>0 && level<=(int)_refiner._refinements.size());\n+270\n+271 switch (_refiner._subdivType) {\n+272 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+273 interpFromFaces(level, src, dst);\n+274 interpFromEdges(level, src, dst);\n+275 interpFromVerts(level, src, dst);\n+276 break;\n+277 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+278 interpFromFaces(level, src, dst);\n+279 interpFromEdges(level, src, dst);\n+280 interpFromVerts(level, src, dst);\n+281 break;\n+282 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+283 interpFromFaces(level, src, dst);\n+284 interpFromEdges(level, src, dst);\n+285 interpFromVerts(level, src, dst);\n+286 break;\n+287 }\n+288}\n+289\n+290template \n+291template \n+292inline void\n+_\b2_\b9_\b3_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U\n+& dst, int channel) const {\n+294\n+295 assert(level>0 && level<=(int)_refiner._refinements.size());\n+296\n+297 switch (_refiner._subdivType) {\n+298 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+299 interpFVarFromFaces(level, src, dst, channel);\n+300 interpFVarFromEdges(level, src, dst, channel);\n+301 interpFVarFromVerts(level, src, dst, channel);\n+302 break;\n+303 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+304 interpFVarFromFaces(level, src, dst, channel);\n+305 interpFVarFromEdges(level, src, dst, channel);\n+306 interpFVarFromVerts(level, src, dst, channel);\n+307 break;\n+308 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+309 interpFVarFromFaces(level, src, dst, channel);\n+310 interpFVarFromEdges(level, src, dst, channel);\n+311 interpFVarFromVerts(level, src, dst, channel);\n+312 break;\n+313 }\n+314}\n+315\n+316template \n+317template \n+318inline void\n+_\b3_\b1_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dst) const {\n+320\n+321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+322 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+323 \"Failure in PrimvarRefiner::Limit() -- \"\n+324 \"last level of refinement does not include full topology.\");\n+325 return;\n+326 }\n+327\n+328 switch (_refiner._subdivType) {\n+329 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+330 limit(src, dst, (U*)0, (U*)0);\n+331 break;\n+332 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+333 limit(src, dst, (U*)0, (U*)0);\n+334 break;\n+335 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+336 limit(src, dst, (U*)0, (U*)0);\n+337 break;\n+338 }\n+339}\n+340\n+341template \n+342template \n+343inline void\n+_\b3_\b4_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2\n+& dstTan2) const {\n+345\n+346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+347 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+348 \"Failure in PrimvarRefiner::Limit() -- \"\n+349 \"last level of refinement does not include full topology.\");\n+350 return;\n+351 }\n+352\n+353 switch (_refiner._subdivType) {\n+354 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+355 limit(src, dstPos, &dstTan1, &dstTan2);\n+356 break;\n+357 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+358 limit(src, dstPos, &dstTan1, &dstTan2);\n+359 break;\n+360 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+361 limit(src, dstPos, &dstTan1, &dstTan2);\n+362 break;\n+363 }\n+364}\n+365\n+366template \n+367template \n+368inline void\n+_\b3_\b6_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst, int\n+channel) const {\n+370\n+371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n+0) {\n+372 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n+373 \"Failure in PrimvarRefiner::LimitFaceVarying() -- \"\n+374 \"last level of refinement does not include full topology.\");\n+375 return;\n+376 }\n+377\n+378 switch (_refiner._subdivType) {\n+379 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n+380 limitFVar(src, dst, channel);\n+381 break;\n+382 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n+383 limitFVar(src, dst, channel);\n+384 break;\n+385 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n+386 limitFVar(src, dst, channel);\n+387 break;\n+388 }\n+389}\n+390\n+391template \n+392template \n+393inline void\n+_\b3_\b9_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const & src, U\n+& dst) const {\n+395\n+396 assert(level>0 && level<=(int)_refiner._refinements.size());\n+397\n+398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+399 Vtr::internal::Level const & child = refinement.child();\n+400\n+401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {\n+402\n+403 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = refinement.getChildFaceParentFace(cFace);\n+404\n+405 dst[cFace] = src[pFace];\n+406 }\n+407}\n+408\n+409template \n+410template \n+411inline void\n+_\b4_\b1_\b2_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U &\n+dst) const {\n+413\n+414 assert(level>0 && level<=(int)_refiner._refinements.size());\n+415\n+416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+417 Vtr::internal::Level const & parent = refinement.parent();\n+418\n+419 //\n+420 // Group values to interpolate based on origin -- note that there may\n+421 // be none originating from faces:\n+422 //\n+423 if (refinement.getNumChildVerticesFromFaces() > 0) {\n+424\n+425 for (int face = 0; face < parent.getNumFaces(); ++face) {\n+426\n+427 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+428 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+429\n+430 // Apply the weights to the parent face's vertices:\n+431 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n+432\n+433 Weight fVaryingWeight = 1.0f / (Weight) fVerts._\bs_\bi_\bz_\be();\n+434\n+435 dst[cVert].Clear();\n+436 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n+437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);\n+438 }\n+439 }\n+440 }\n+441 }\n+442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n+443\n+444 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+445 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+446\n+447 // Apply the weights to the parent edges's vertices\n+448 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge);\n+449\n+450 dst[cVert].Clear();\n+451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);\n+452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);\n+453 }\n+454 }\n+455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n+456\n+457 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+458 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n+459\n+460 // Essentially copy the parent vertex:\n+461 dst[cVert].Clear();\n+462 dst[cVert].AddWithWeight(src[vert], 1.0f);\n+463 }\n+464 }\n+465}\n+466\n+467\n+468//\n+469// Internal implementation methods -- grouping vertices to be interpolated\n+470// based on the type of parent component from which they originated:\n+471//\n+472template \n+473template \n+474inline void\n+475_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs(int level, T const & src, U & dst)\n+const {\n+476\n+477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+478 Vtr::internal::Level const & parent = refinement.parent();\n+479\n+480 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n+481\n+482 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b> scheme(_refiner._subdivOptions);\n+483\n+484 Vtr::internal::StackBuffer fVertWeights(parent.getMaxValence());\n+485\n+486 for (int face = 0; face < parent.getNumFaces(); ++face) {\n+487\n+488 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+489 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+490 continue;\n+491\n+492 // Declare and compute mask weights for this vertex relative to its parent\n+face:\n+493 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n+494\n+495 Mask fMask(fVertWeights, 0, 0);\n+496 Vtr::internal::FaceInterface fHood(fVerts._\bs_\bi_\bz_\be());\n+497\n+498 scheme.ComputeFaceVertexMask(fHood, fMask);\n+499\n+500 // Apply the weights to the parent face's vertices:\n+501 dst[cVert].Clear();\n+502\n+503 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n+504\n+505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);\n+506 }\n+507 }\n+508}\n+509\n+510template \n+511template \n+512inline void\n+513PrimvarRefinerReal::interpFromEdges(int level, T const & src, U & dst)\n+const {\n+514\n+515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+516 Vtr::internal::Level const & parent = refinement.parent();\n+517 Vtr::internal::Level const & child = refinement.child();\n+518\n+519 Sdc::Scheme scheme(_refiner._subdivOptions);\n+520\n+521 Vtr::internal::EdgeInterface eHood(parent);\n+522\n+523 Weight eVertWeights[2];\n+524 Vtr::internal::StackBuffer eFaceWeights(parent.getMaxEdgeFaces\n+());\n+525\n+526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n+527\n+528 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+529 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+530 continue;\n+531\n+532 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+533 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge),\n+534 eFaces = parent.getEdgeFaces(edge);\n+535\n+536 Mask eMask(eVertWeights, 0, eFaceWeights);\n+537\n+538 eHood.SetIndex(edge);\n+539\n+540 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? _\bS_\bd_\bc_\b:_\b:\n+_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n+541 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n+542\n+543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n+544\n+545 // Apply the weights to the parent edges's vertices and (if applicable) to\n+546 // the child vertices of its incident faces:\n+547 dst[cVert].Clear();\n+548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);\n+549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);\n+550\n+551 if (eMask.GetNumFaceWeights() > 0) {\n+552\n+553 for (int i = 0; i < eFaces.size(); ++i) {\n+554\n+555 if (eMask.AreFaceWeightsForFaceCenters()) {\n+556 assert(refinement.getNumChildVerticesFromFaces() > 0);\n+557 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n+558\n+559 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);\n+561 } else {\n+562 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n+563 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parent.getFaceEdges(pFace),\n+564 pFaceVerts = parent.getFaceVertices(pFace);\n+565\n+566 int eInFace = 0;\n+567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n+568\n+569 int vInFace = eInFace + 2;\n+570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n+571\n+572 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertNext = pFaceVerts[vInFace];\n+573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);\n+574 }\n+575 }\n+576 }\n+577 }\n+578}\n+579\n+580template \n+581template \n+582inline void\n+583PrimvarRefinerReal::interpFromVerts(int level, T const & src, U & dst)\n+const {\n+584\n+585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+586 Vtr::internal::Level const & parent = refinement.parent();\n+587 Vtr::internal::Level const & child = refinement.child();\n+588\n+589 Sdc::Scheme scheme(_refiner._subdivOptions);\n+590\n+591 Vtr::internal::VertexInterface vHood(parent, child);\n+592\n+593 Vtr::internal::StackBuffer weightBuffer(2*parent.getMaxValence\n+());\n+594\n+595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n+596\n+597 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+598 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+599 continue;\n+600\n+601 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+602 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parent.getVertexEdges(vert),\n+603 vFaces = parent.getVertexFaces(vert);\n+604\n+605 Weight vVertWeight,\n+606 * vEdgeWeights = weightBuffer,\n+607 * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n+608\n+609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n+610\n+611 vHood.SetIndex(vert, cVert);\n+612\n+613 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parent.getVertexRule(vert);\n+614 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n+615\n+616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n+617\n+618 // Apply the weights to the parent vertex, the vertices opposite its\n+incident\n+619 // edges, and the child vertices of its incident faces:\n+620 //\n+621 // In order to improve numerical precision, it's better to apply smaller\n+weights\n+622 // first, so begin with the face-weights followed by the edge-weights and\n+the\n+623 // vertex weight last.\n+624 dst[cVert].Clear();\n+625\n+626 if (vMask.GetNumFaceWeights() > 0) {\n+627 assert(vMask.AreFaceWeightsForFaceCenters());\n+628\n+629 for (int i = 0; i < vFaces.size(); ++i) {\n+630\n+631 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n+632 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);\n+634 }\n+635 }\n+636 if (vMask.GetNumEdgeWeights() > 0) {\n+637\n+638 for (int i = 0; i < vEdges.size(); ++i) {\n+639\n+640 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(vEdges[i]);\n+641 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n+642\n+643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);\n+644 }\n+645 }\n+646 dst[cVert].AddWithWeight(src[vert], vVertWeight);\n+647 }\n+648}\n+649\n+650\n+651//\n+652// Internal face-varying implementation details:\n+653//\n+654template \n+655template \n+656inline void\n+657PrimvarRefinerReal::interpFVarFromFaces(int level, T const & src, U &\n+dst, int channel) const {\n+658\n+659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+660\n+661 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n+662\n+663 Sdc::Scheme scheme(_refiner._subdivOptions);\n+664\n+665 Vtr::internal::Level const & parentLevel = refinement.parent();\n+666 Vtr::internal::Level const & childLevel = refinement.child();\n+667\n+668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+670\n+671 Vtr::internal::StackBuffer fValueWeights\n+(parentLevel.getMaxValence());\n+672\n+673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {\n+674\n+675 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n+676 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+677 continue;\n+678\n+679 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = childFVar.getVertexValueOffset(cVert);\n+680\n+681 // The only difference for face-varying here is that we get the values\n+associated\n+682 // with each face-vertex directly from the FVarLevel, rather than using the\n+parent\n+683 // face-vertices directly. If any face-vertex has any sibling values, then\n+we may\n+684 // get the wrong one using the face-vertex index directly.\n+685\n+686 // Declare and compute mask weights for this vertex relative to its parent\n+face:\n+687 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fValues = parentFVar.getFaceValues(face);\n+688\n+689 Mask fMask(fValueWeights, 0, 0);\n+690 Vtr::internal::FaceInterface fHood(fValues.size());\n+691\n+692 scheme.ComputeFaceVertexMask(fHood, fMask);\n+693\n+694 // Apply the weights to the parent face's vertices:\n+695 dst[cVertValue].Clear();\n+696\n+697 for (int i = 0; i < fValues.size(); ++i) {\n+698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);\n+699 }\n+700 }\n+701}\n+702\n+703template \n+704template \n+705inline void\n+706PrimvarRefinerReal::interpFVarFromEdges(int level, T const & src, U &\n+dst, int channel) const {\n+707\n+708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+709\n+710 Sdc::Scheme scheme(_refiner._subdivOptions);\n+711\n+712 Vtr::internal::Level const & parentLevel = refinement.parent();\n+713 Vtr::internal::Level const & childLevel = refinement.child();\n+714\n+715 Vtr::internal::FVarRefinement const & refineFVar =\n+refinement.getFVarRefinement(channel);\n+716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+718\n+719 //\n+720 // Allocate and initialize (if linearly interpolated) interpolation weights\n+for\n+721 // the edge mask:\n+722 //\n+723 Weight eVertWeights[2];\n+724 Vtr::internal::StackBuffer eFaceWeights\n+(parentLevel.getMaxEdgeFaces());\n+725\n+726 Mask eMask(eVertWeights, 0, eFaceWeights);\n+727\n+728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n+_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n+729 if (isLinearFVar) {\n+730 eMask.SetNumVertexWeights(2);\n+731 eMask.SetNumEdgeWeights(0);\n+732 eMask.SetNumFaceWeights(0);\n+733\n+734 eVertWeights[0] = 0.5f;\n+735 eVertWeights[1] = 0.5f;\n+736 }\n+737\n+738 Vtr::internal::EdgeInterface eHood(parentLevel);\n+739\n+740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {\n+741\n+742 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n+743 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+744 continue;\n+745\n+746 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by cVertValues = childFVar.getVertexValues(cVert);\n+747\n+748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n+[0]);\n+749 if (fvarEdgeVertMatchesVertex) {\n+750 //\n+751 // If smoothly interpolated, compute new weights for the edge mask:\n+752 //\n+753 if (!isLinearFVar) {\n+754 eHood.SetIndex(edge);\n+755\n+756 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)\n+757 ? _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n+758 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n+759\n+760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n+761 }\n+762\n+763 // Apply the weights to the parent edge's vertices and (if applicable) to\n+764 // the child vertices of its incident faces:\n+765 //\n+766 // Even though the face-varying topology matches the vertex topology, we\n+need\n+767 // to be careful here when getting values corresponding to the two end-\n+vertices.\n+768 // While the edge may be continuous, the vertices at their ends may have\n+769 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n+side\"\n+770 // of the end-vertex) and so have sibling values associated with them. In\n+most\n+771 // cases the topology for an end-vertex will match and we can use it\n+directly,\n+772 // but we must still check and retrieve as needed.\n+773 //\n+774 // Indices for values corresponding to face-vertices are guaranteed to\n+match,\n+775 // so we can use the child-vertex indices directly.\n+776 //\n+777 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n+reference\n+778 // values in the \"src\" to account for the possible indirection that may\n+exist at\n+779 // level 0 -- where there may be fewer values than vertices and an\n+additional\n+780 // indirection is necessary. We can use a vertex index directly for \"dst\"\n+when\n+781 // it matches.\n+782 //\n+783 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n+784\n+785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);\n+786\n+787 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n+788\n+789 dst[cVertValue].Clear();\n+790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);\n+791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);\n+792\n+793 if (eMask.GetNumFaceWeights() > 0) {\n+794\n+795 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eFaces = parentLevel.getEdgeFaces(edge);\n+796\n+797 for (int i = 0; i < eFaces.size(); ++i) {\n+798 if (eMask.AreFaceWeightsForFaceCenters()) {\n+799\n+800 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n+801 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+802\n+803 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n+804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);\n+805 } else {\n+806 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n+807 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parentLevel.getFaceEdges(pFace),\n+808 pFaceVerts = parentLevel.getFaceVertices(pFace);\n+809\n+810 int eInFace = 0;\n+811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n+812\n+813 // Edge \"i\" spans vertices [i,i+1] so we want i+2...\n+814 int vInFace = eInFace + 2;\n+815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n+816\n+817 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pValueNext = parentFVar.getFaceValues(pFace)[vInFace];\n+818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);\n+819 }\n+820 }\n+821 }\n+822 } else {\n+823 //\n+824 // Mismatched edge-verts should just be linearly interpolated between the\n+pairs of\n+825 // values for each sibling of the child edge-vertex -- the question is:\n+which face\n+826 // holds that pair of values for a given sibling?\n+827 //\n+828 // In the manifold case, the sibling and edge-face indices will correspond.\n+We\n+829 // will eventually need to update this to account for > 3 incident faces.\n+830 //\n+831 for (int i = 0; i < cVertValues.size(); ++i) {\n+832 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n+833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);\n+834 assert(eFaceIndex == i);\n+835\n+836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);\n+837\n+838 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[i];\n+839\n+840 dst[cVertValue].Clear();\n+841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);\n+842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);\n+843 }\n+844 }\n+845 }\n+846}\n+847\n+848template \n+849template \n+850inline void\n+851PrimvarRefinerReal::interpFVarFromVerts(int level, T const & src, U &\n+dst, int channel) const {\n+852\n+853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n+(level-1);\n+854\n+855 Sdc::Scheme scheme(_refiner._subdivOptions);\n+856\n+857 Vtr::internal::Level const & parentLevel = refinement.parent();\n+858 Vtr::internal::Level const & childLevel = refinement.child();\n+859\n+860 Vtr::internal::FVarRefinement const & refineFVar =\n+refinement.getFVarRefinement(channel);\n+861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n+(channel);\n+862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n+(channel);\n+863\n+864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n+_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n+865\n+866 Vtr::internal::StackBuffer weightBuffer\n+(2*parentLevel.getMaxValence());\n+867\n+868 Vtr::internal::StackBuffer vEdgeValues\n+(parentLevel.getMaxValence());\n+869\n+870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);\n+871\n+872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {\n+873\n+874 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n+875 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n+876 continue;\n+877\n+878 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pVertValues = parentFVar.getVertexValues(vert),\n+879 cVertValues = childFVar.getVertexValues(cVert);\n+880\n+881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n+[0]);\n+882 if (isLinearFVar && fvarVertVertMatchesVertex) {\n+883 dst[cVertValues[0]].Clear();\n+884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);\n+885 continue;\n+886 }\n+887\n+888 if (fvarVertVertMatchesVertex) {\n+889 //\n+890 // Declare and compute mask weights for this vertex relative to its parent\n+edge:\n+891 //\n+892 // (We really need to encapsulate this somewhere else for use here and in\n+the\n+893 // general case)\n+894 //\n+895 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parentLevel.getVertexEdges(vert);\n+896\n+897 Weight vVertWeight;\n+898 Weight * vEdgeWeights = weightBuffer;\n+899 Weight * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n+900\n+901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n+902\n+903 vHood.SetIndex(vert, cVert);\n+904\n+905 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parentLevel.getVertexRule(vert);\n+906 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n+907\n+908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n+909\n+910 // Apply the weights to the parent vertex, the vertices opposite its\n+incident\n+911 // edges, and the child vertices of its incident faces:\n+912 //\n+913 // Even though the face-varying topology matches the vertex topology, we\n+need\n+914 // to be careful here when getting values corresponding to vertices at the\n+915 // ends of edges. While the edge may be continuous, the end vertex may have\n+916 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n+side\"\n+917 // of the end-vertex) and so have sibling values associated with them. In\n+most\n+918 // cases the topology for an end-vertex will match and we can use it\n+directly,\n+919 // but we must still check and retrieve as needed.\n+920 //\n+921 // Indices for values corresponding to face-vertices are guaranteed to\n+match,\n+922 // so we can use the child-vertex indices directly.\n+923 //\n+924 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n+reference\n+925 // values in the \"src\" to account for the possible indirection that may\n+exist at\n+926 // level 0 -- where there may be fewer values than vertices and an\n+additional\n+927 // indirection is necessary. We can use a vertex index directly for \"dst\"\n+when\n+928 // it matches.\n+929 //\n+930 // As with applying the mask to vertex data, in order to improve numerical\n+931 // precision, it's better to apply smaller weights first, so begin with the\n+932 // face-weights followed by the edge-weights and the vertex weight last.\n+933 //\n+934 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[0];\n+935 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n+936\n+937 dst[cVertValue].Clear();\n+938 if (vMask.GetNumFaceWeights() > 0) {\n+939 assert(vMask.AreFaceWeightsForFaceCenters());\n+940\n+941 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = parentLevel.getVertexFaces(vert);\n+942\n+943 for (int i = 0; i < vFaces.size(); ++i) {\n+944\n+945 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n+946 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n+947\n+948 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n+949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);\n+950 }\n+951 }\n+952 if (vMask.GetNumEdgeWeights() > 0) {\n+953\n+954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);\n+955\n+956 for (int i = 0; i < vEdges.size(); ++i) {\n+957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);\n+958 }\n+959 }\n+960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);\n+961 } else {\n+962 //\n+963 // Each FVar value associated with a vertex will be either a corner or a\n+crease,\n+964 // or potentially in transition from corner to crease:\n+965 // - if the CHILD is a corner, there can be no transition so we have a\n+corner\n+966 // - otherwise if the PARENT is a crease, both will be creases (no\n+transition)\n+967 // - otherwise the parent must be a corner and the child a crease\n+(transition)\n+968 //\n+969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags =\n+parentFVar.getVertexValueTags(vert);\n+970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags =\n+childFVar.getVertexValueTags(cVert);\n+971\n+972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size();\n+++cSiblingIndex) {\n+973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert,\n+cSiblingIndex);\n+974 assert(pSiblingIndex == cSiblingIndex);\n+975\n+976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;\n+977\n+978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;\n+979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;\n+980\n+981 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[pSibling];\n+982 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[cSibling];\n+983\n+984 dst[cVertValue].Clear();\n+985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {\n+986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);\n+987 } else {\n+988 //\n+989 // We have either a crease or a transition from corner to crease -- in\n+990 // either case, we need the end values for the full/fractional crease:\n+991 //\n+992 _\bI_\bn_\bd_\be_\bx pEndValues[2];\n+993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);\n+994\n+995 Weight vWeight = 0.75f;\n+996 Weight eWeight = 0.125f;\n+997\n+998 //\n+999 // If semi-sharp we need to apply fractional weighting -- if made sharp\n+because\n+1000 // of the other sibling (dependent-sharp) use the fractional weight from\n+that\n+1001 // other sibling (should only occur when there are 2):\n+1002 //\n+1003 if (pValueTags[pSibling].isSemiSharp()) {\n+1004 Weight wCorner = pValueTags[pSibling].isDepSharp()\n+1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)\n+1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);\n+1007 Weight wCrease = 1.0f - wCorner;\n+1008\n+1009 vWeight = wCrease * 0.75f + wCorner;\n+1010 eWeight = wCrease * 0.125f;\n+1011 }\n+1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);\n+1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);\n+1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);\n+1015 }\n+1016 }\n+1017 }\n+1018 }\n+1019}\n+1020\n+1021template \n+1022template \n+1023inline void\n+1024PrimvarRefinerReal::limit(T const & src, U & dstPos, U1 * dstTan1Ptr,\n+U2 * dstTan2Ptr) const {\n+1025\n+1026 Sdc::Scheme scheme(_refiner._subdivOptions);\n+1027\n+1028 Vtr::internal::Level const & level = _refiner.getLevel\n+(_refiner.GetMaxLevel());\n+1029\n+1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n+1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);\n+1032 int numMasks = 1 + (hasTangents ? 2 : 0);\n+1033\n+1034 Vtr::internal::StackBuffer indexBuffer(maxWeightsPerMask);\n+1035 Vtr::internal::StackBuffer weightBuffer(numMasks *\n+maxWeightsPerMask);\n+1036\n+1037 Weight * vPosWeights = weightBuffer,\n+1038 * ePosWeights = vPosWeights + 1,\n+1039 * fPosWeights = ePosWeights + level.getMaxValence();\n+1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,\n+1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,\n+1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;\n+1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,\n+1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,\n+1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;\n+1046\n+1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);\n+1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);\n+1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);\n+1050\n+1051 // This is a bit obscure -- assigning both parent and child as last level\n+-- but\n+1052 // this mask type was intended for another purpose. Consider one for the\n+limit:\n+1053 Vtr::internal::VertexInterface vHood(level, level);\n+1054\n+1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n+1056 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n+1057\n+1058 // Incomplete vertices (present in sparse refinement) do not have their\n+full\n+1059 // topological neighborhood to determine a proper limit -- just leave the\n+1060 // vertex at the refined location and continue to the next:\n+1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {\n+1062 dstPos[vert].Clear();\n+1063 dstPos[vert].AddWithWeight(src[vert], 1.0);\n+1064 if (hasTangents) {\n+1065 (*dstTan1Ptr)[vert].Clear();\n+1066 (*dstTan2Ptr)[vert].Clear();\n+1067 }\n+1068 continue;\n+1069 }\n+1070\n+1071 //\n+1072 // Limit masks require the subdivision Rule for the vertex in order to\n+deal\n+1073 // with infinitely sharp features correctly -- including boundaries and\n+corners.\n+1074 // The vertex neighborhood is minimally defined with vertex and edge\n+counts.\n+1075 //\n+1076 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be vRule = level.getVertexRule(vert);\n+1077\n+1078 // This is a bit obscure -- child vertex index will be ignored here\n+1079 vHood.SetIndex(vert, vert);\n+1080\n+1081 if (hasTangents) {\n+1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);\n+1083 } else {\n+1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);\n+1085 }\n+1086\n+1087 //\n+1088 // Gather the neighboring vertices of this vertex -- the vertices opposite\n+its\n+1089 // incident edges, and the opposite vertices of its incident faces:\n+1090 //\n+1091 _\bI_\bn_\bd_\be_\bx * eIndices = indexBuffer;\n+1092 _\bI_\bn_\bd_\be_\bx * fIndices = indexBuffer + vEdges._\bs_\bi_\bz_\be();\n+1093\n+1094 for (int i = 0; i < vEdges.size(); ++i) {\n+1095 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = level.getEdgeVertices(vEdges[i]);\n+1096\n+1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n+1098 }\n+1099 if (posMask.GetNumFaceWeights() || (hasTangents &&\n+tan1Mask.GetNumFaceWeights())) {\n+1100 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n+1101 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n+1102\n+1103 for (int i = 0; i < vFaces.size(); ++i) {\n+1104 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = level.getFaceVertices(vFaces[i]);\n+1105\n+1106 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = (vInFace[i] + 2);\n+1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)fVerts._\bs_\bi_\bz_\be();\n+1108\n+1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];\n+1110 }\n+1111 }\n+1112\n+1113 //\n+1114 // Combine the weights and indices for position and tangents. As with\n+applying\n+1115 // refinement masks to vertex data, in order to improve numerical\n+precision, it's\n+1116 // better to apply smaller weights first, so begin with the face-weights\n+followed\n+1117 // by the edge-weights and the vertex weight last.\n+1118 //\n+1119 dstPos[vert].Clear();\n+1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {\n+1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);\n+1122 }\n+1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {\n+1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);\n+1125 }\n+1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);\n+1127\n+1128 //\n+1129 // Apply the tangent masks -- both will have the same number of weights\n+and\n+1130 // indices (one tangent may be \"padded\" to accommodate the other), but\n+these\n+1131 // may differ from those of the position:\n+1132 //\n+1133 if (hasTangents) {\n+1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());\n+1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());\n+1136\n+1137 U1 & dstTan1 = *dstTan1Ptr;\n+1138 U2 & dstTan2 = *dstTan2Ptr;\n+1139\n+1140 dstTan1[vert].Clear();\n+1141 dstTan2[vert].Clear();\n+1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {\n+1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);\n+1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);\n+1145 }\n+1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {\n+1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);\n+1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);\n+1149 }\n+1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);\n+1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);\n+1152 }\n+1153 }\n+1154}\n+1155\n+1156template \n+1157template \n+1158inline void\n+1159PrimvarRefinerReal::limitFVar(T const & src, U & dst, int channel)\n+const {\n+1160\n+1161 Sdc::Scheme scheme(_refiner._subdivOptions);\n+1162\n+1163 Vtr::internal::Level const & level = _refiner.getLevel\n+(_refiner.GetMaxLevel());\n+1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel\n+(channel);\n+1165\n+1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n+1167\n+1168 Vtr::internal::StackBuffer weightBuffer(maxWeightsPerMask);\n+1169 Vtr::internal::StackBuffer vEdgeBuffer(level.getMaxValence());\n+1170\n+1171 // This is a bit obscure -- assign both parent and child as last level\n+1172 Vtr::internal::VertexInterface vHood(level, level);\n+1173\n+1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n+1175\n+1176 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n+1177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vValues = fvarChannel.getVertexValues(vert);\n+1178\n+1179 // Incomplete vertices (present in sparse refinement) do not have their\n+full\n+1180 // topological neighborhood to determine a proper limit -- just leave the\n+1181 // values (perhaps more than one per vertex) at the refined location.\n+1182 //\n+1183 // The same can be done if the face-varying channel is purely linear.\n+1184 //\n+1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size\n+() == 0));\n+1186 if (isIncomplete || fvarChannel.isLinear()) {\n+1187 for (int i = 0; i < vValues.size(); ++i) {\n+1188 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n+1189\n+1190 dst[vValue].Clear();\n+1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n+1192 }\n+1193 continue;\n+1194 }\n+1195\n+1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);\n+1197 if (fvarVertMatchesVertex) {\n+1198\n+1199 // Assign the mask weights to the common buffer and compute the mask:\n+1200 //\n+1201 Weight * vWeights = weightBuffer,\n+1202 * eWeights = vWeights + 1,\n+1203 * fWeights = eWeights + vEdges._\bs_\bi_\bz_\be();\n+1204\n+1205 Mask vMask(vWeights, eWeights, fWeights);\n+1206\n+1207 vHood.SetIndex(vert, vert);\n+1208\n+1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));\n+1210\n+1211 //\n+1212 // Apply mask to corresponding FVar values for neighboring vertices:\n+1213 //\n+1214 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[0];\n+1215\n+1216 dst[vValue].Clear();\n+1217 if (vMask.GetNumFaceWeights() > 0) {\n+1218 assert(!vMask.AreFaceWeightsForFaceCenters());\n+1219\n+1220 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n+1221 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n+1222\n+1223 for (int i = 0; i < vFaces.size(); ++i) {\n+1224 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by faceValues = fvarChannel.getFaceValues(vFaces[i]);\n+1225 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = vInFace[i] + 2;\n+1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues._\bs_\bi_\bz_\be();\n+1227\n+1228 _\bI_\bn_\bd_\be_\bx vValueOppositeFace = faceValues[vOppInFace];\n+1229\n+1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);\n+1231 }\n+1232 }\n+1233 if (vMask.GetNumEdgeWeights() > 0) {\n+1234 _\bI_\bn_\bd_\be_\bx * vEdgeValues = vEdgeBuffer;\n+1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);\n+1236\n+1237 for (int i = 0; i < vEdges.size(); ++i) {\n+1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);\n+1239 }\n+1240 }\n+1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);\n+1242 } else {\n+1243 //\n+1244 // Sibling FVar values associated with a vertex will be either a corner or\n+a crease:\n+1245 //\n+1246 for (int i = 0; i < vValues.size(); ++i) {\n+1247 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n+1248\n+1249 dst[vValue].Clear();\n+1250 if (fvarChannel.getValueTag(vValue).isCorner()) {\n+1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n+1252 } else {\n+1253 _\bI_\bn_\bd_\be_\bx vEndValues[2];\n+1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);\n+1255\n+1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);\n+1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);\n+1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);\n+1259 }\n+1260 }\n+1261 }\n+1262 }\n+1263}\n+1264\n+_\b1_\b2_\b6_\b5class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br : public _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n+1266public:\n+_\b1_\b2_\b6_\b7 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner)\n+1268 : _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(refiner) { }\n+1269};\n+1270\n+1271} // end namespace Far\n+1272\n+1273} // end namespace OPENSUBDIV_VERSION\n+1274using namespace OPENSUBDIV_VERSION;\n+1275} // end namespace OpenSubdiv\n+1276\n+1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n+Vtr::LocalIndex LocalIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bE_\br_\br_\bo_\br\n+void Error(ErrorType err, const char *format,...)\n+Sends an OSD error with a message (internal use only)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Vtr::ConstIndexArray ConstIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Vtr::ConstLocalIndexArray ConstLocalIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR\n+@ FAR_RUNTIME_ERROR\n+Issue a generic runtime error, but continue execution.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\be_\br_\br_\bo_\br_\b._\bh_\b:_\b4_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n Vtr::Index Index\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Object used to compute and query ptex face indices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\b:_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd\n-int GetFaceId(Index f) const\n-Returns the ptex face index given a coarse face 'f' or -1.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-PtexIndices(TopologyRefiner const &refiner)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bA_\bd_\bj_\ba_\bc_\be_\bn_\bc_\by\n-void GetAdjacency(TopologyRefiner const &refiner, int face, int quadrant, int\n-adjFaces[4], int adjEdges[4]) const\n-Returns ptex face adjacency information for a given coarse face.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n-int GetNumFaces() const\n-Returns the number of ptex faces in the mesh.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\b~_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-~PtexIndices()\n-Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+int Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+bool IndexIsValid(Index index)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR\n+@ SCHEME_BILINEAR\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK\n+@ SCHEME_CATMARK\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP\n+@ SCHEME_LOOP\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+Applies refinement operations to generic primvar data.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n+void Limit(T const &src, U &dstPos) const\n+Apply limit weights to a primvar buffer.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+PrimvarRefinerReal(TopologyRefiner const &refiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n+void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm\n+void InterpolateFaceUniform(int level, T const &src, U &dst) const\n+Refine uniform (per-face) primvar data between levels.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+TopologyRefiner const & GetTopologyRefiner() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void InterpolateVarying(int level, T const &src, U &dst) const\n+Apply only varying interpolation weights to a primvar buffer for a single level\n+of refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b4_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n+void Interpolate(int level, T const &src, U &dst) const\n+Apply vertex interpolation weights to a primvar buffer for a single level of\n+refinement.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0)\n+const\n+Apply face-varying interpolation weights to a primvar buffer associated with a\n+particular face-varyin...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n+~PrimvarRefinerReal()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void LimitFaceVarying(T const &src, U &dst, int channel=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+PrimvarRefiner(TopologyRefiner const &refiner)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b7\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n+Rule\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n+@ RULE_CREASE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be\n+Scheme is a class template which provides all implementation for the\n+subdivision schemes supported by...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b:_\b:_\bs_\bi_\bz_\be\n+size_type size() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b7_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh\n+ * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTableFactory.h File Reference\n+OpenSubdiv: opensubdiv/far/ptexIndices.h File Reference\n \n \n \n \n \n \n \n@@ -90,33 +90,28 @@\n \n \n \n
\n \n-
patchTableFactory.h File Reference
\n+
ptexIndices.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/topologyRefiner.h"
\n-#include "../far/patchTable.h"
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/types.h"
\n+#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n-\n-\n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  PatchTableFactory
 Factory for constructing a PatchTable from a TopologyRefiner. More...
 
struct  PatchTableFactory::Options
 Public options for the PatchTable factory. More...
 
struct  PatchTableFactory::PatchFaceTag
 Obsolete internal struct not intended for public use – due to be deprecated. More...
class  PtexIndices
 Object used to compute and query ptex face indices. More...
 
\n \n \n \n \n@@ -125,13 +120,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,26 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-patchTableFactory.h File Reference\n+ptexIndices.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-\u00a0 Factory for constructing a _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be from a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 Public options for the _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be factory. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n-\u00a0 Obsolete internal struct not intended for public use \u2013 due to be\n- deprecated. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+\u00a0 Object used to compute and query ptex face indices. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,5 +1,3 @@\n var a00725 = [\n- [\"PatchTableFactory\", \"a01017.html\", \"a01017\"],\n- [\"Options\", \"a01021.html\", \"a01021\"],\n- [\"PatchFaceTag\", \"a01025.html\", \"a01025\"]\n+ [\"PtexIndices\", \"a01041.html\", \"a01041\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00725_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00725_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTableFactory.h Source File\n+OpenSubdiv: opensubdiv/far/ptexIndices.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchTableFactory.h
\n+
ptexIndices.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,250 +118,81 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n-
27
\n-
28#include "../version.h"
\n-
29
\n-
30#include "../far/topologyRefiner.h"
\n-
31#include "../far/patchTable.h"
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
36namespace Far {
\n-
37
\n-
\n-\n-
41public:
\n-
42
\n-
\n-
45 struct Options {
\n-
46
\n-\n-
62
\n-
\n-
63 Options(unsigned int maxIsolation=10) :
\n-
64 generateAllLevels(false),
\n-\n-\n-
67 triangulateQuads(false),
\n-\n-
69 useInfSharpPatch(false),
\n-
70 maxIsolationLevel(maxIsolation & 0xf),
\n-\n-\n-\n-\n-
75 generateFVarTables(false),
\n-\n-\n-\n-\n-\n-\n-
82 { }
\n-
\n-
83
\n-\n-
86
\n-
88 void SetEndCapType(EndCapType e) { endCapType = e & 0x7; }
\n+
24#ifndef OPENSUBDIV3_FAR_PTEX_INDICES_H
\n+
25#define OPENSUBDIV3_FAR_PTEX_INDICES_H
\n+
26
\n+
27#include "../version.h"
\n+
28
\n+
29#include "../far/topologyRefiner.h"
\n+
30#include "../far/types.h"
\n+
31
\n+
32#include <vector>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38
\n+
\n+\n+
47
\n+
48public:
\n+
49
\n+\n+
52
\n+\n+
55
\n+
57
\n+
60
\n+
63 int GetNumFaces() const;
\n+
64
\n+
67 int GetFaceId(Index f) const;
\n+
68
\n+\n+
84 TopologyRefiner const &refiner,
\n+
85 int face, int quadrant,
\n+
86 int adjFaces[4], int adjEdges[4]) const;
\n+
87
\n
89
\n-
91 void SetMaxIsolationLevel(unsigned int level) { maxIsolationLevel = level & 0xf; }
\n-
92
\n-
94 template <typename REAL> void SetPatchPrecision();
\n+
90private:
\n+
91
\n+
92 void initializePtexIndices(TopologyRefiner const &refiner);
\n+
93
\n+
94private:
\n
95
\n-
97 template <typename REAL> void SetFVarPatchPrecision();
\n-
98
\n-
\n-\n-\n-
102
\n-
103 adaptiveOptions.useInfSharpPatch = useInfSharpPatch;
\n-\n-
105 adaptiveOptions.considerFVarChannels = generateFVarTables &&
\n-\n-
107 return adaptiveOptions;
\n-
108 }
\n-
\n-
109
\n-
110 unsigned int generateAllLevels : 1,
\n-\n-\n-\n-
114
\n-\n-\n-\n-
118
\n-
119 // end-capping
\n-\n-\n-
123
\n-
124 // varying
\n-\n-\n-
127
\n-
128 // face-varying
\n-\n-
130
\n-
131 // precision
\n-\n-\n-
134
\n-
135 // legacy behaviors (default to true)
\n-\n-\n-
138
\n-\n-
140 int const * fvarChannelIndices;
\n-
141 };
\n-
\n-
142
\n-
175 static PatchTable * Create(TopologyRefiner const & refiner,
\n-
176 Options options = Options(),
\n-
177 ConstIndexArray selectedFaces = ConstIndexArray());
\n-
178
\n-
179public:
\n-
180 // PatchFaceTag
\n-
181 //
\n-
182 // This simple struct was previously used within the factory to take inventory of
\n-
183 // various kinds of patches to fully allocate buffers prior to populating them. It
\n-
184 // was not intended to be exposed as part of the public interface.
\n-
185 //
\n-
186 // It is no longer used internally and is being kept here to respect preservation
\n-
187 // of the public interface, but it will be deprecated at the earliest opportunity.
\n-
188 //
\n-
191 //
\n-
\n-\n-
193 public:
\n-
194 unsigned int _hasPatch : 1;
\n-
195 unsigned int _isRegular : 1;
\n-
196 unsigned int _transitionMask : 4;
\n-
197 unsigned int _boundaryMask : 4;
\n-
198 unsigned int _boundaryIndex : 2;
\n-
199 unsigned int _boundaryCount : 3;
\n-
200 unsigned int _hasBoundaryEdge : 3;
\n-
201 unsigned int _isSingleCrease : 1;
\n-
202
\n-
203 void clear();
\n-
204 void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask);
\n-
205 void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask);
\n-
206 void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask);
\n-
207 };
\n+
96 std::vector<Index> _ptexIndices;
\n+
97};
\n
\n-
208 typedef std::vector<PatchFaceTag> PatchTagVector;
\n-
209};
\n-
\n-
210
\n-
211
\n-
\n-
212template <> inline void PatchTableFactory::Options::SetPatchPrecision<float>() {
\n-
213 patchPrecisionDouble = false;
\n-
214}
\n-
\n-
\n-
215template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<float>() {
\n-
216 fvarPatchPrecisionDouble = false;
\n-
217}
\n-
\n-
218
\n-
219template <> inline void PatchTableFactory::Options::SetPatchPrecision<double>() {
\n-
220 patchPrecisionDouble = true;
\n-
221}
\n-
222template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<double>() {
\n-
223 fvarPatchPrecisionDouble = true;
\n-
224}
\n-
225
\n-
226
\n-
227} // end namespace Far
\n-
228
\n-
229} // end namespace OPENSUBDIV_VERSION
\n-
230using namespace OPENSUBDIV_VERSION;
\n-
231
\n-
232} // end namespace OpenSubdiv
\n-
233
\n-
234
\n-
235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */
\n+
98
\n+
99
\n+
100} // end namespace Far
\n+
101
\n+
102} // end namespace OPENSUBDIV_VERSION
\n+
103using namespace OPENSUBDIV_VERSION;
\n+
104} // end namespace OpenSubdiv
\n+
105
\n+
106#endif /* OPENSUBDIV3_FAR_PTEX_INDICES_H */
\n \n-
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-
Factory for constructing a PatchTable from a TopologyRefiner.
\n-\n-
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n-\n-
unsigned int generateVaryingTables
Generate varying patch tables.
\n-
unsigned int generateLegacySharpCornerPatches
Generate sharp regular patches at smooth corners (legacy)
\n-\n-
TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const
Determine adaptive refinement options to match assigned patch options.
\n-
unsigned int maxIsolationLevel
Cap adaptive feature isolation to the given level (max. 10)
\n-\n-
unsigned int generateFVarLegacyLinearPatches
Generate all linear face-varying patches (legacy)
\n-
void SetPatchPrecision()
Set precision of vertex patches.
\n-
unsigned int fvarPatchPrecisionDouble
Generate double-precision stencils for face-varying patches.
\n-
void SetMaxIsolationLevel(unsigned int level)
Set maximum isolation level.
\n-\n-
int const * fvarChannelIndices
List containing the indices of the channels selected for the factory.
\n-\n-\n-\n-
unsigned int generateVaryingLocalPoints
Generate local points with varying patches.
\n-
unsigned int includeFVarBaseLevelIndices
Include base level in face-varying patch point indices (Uniform mode only)
\n-
unsigned int generateAllLevels
Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)
\n-
unsigned int patchPrecisionDouble
Generate double-precision stencils for vertex patches.
\n-
unsigned int generateFVarTables
Generate face-varying patch tables.
\n-
unsigned int includeBaseLevelIndices
Include base level in patch point indices (Uniform mode only)
\n-
void SetFVarPatchPrecision()
Set precision of face-varying patches.
\n-
int numFVarChannels
Number of channel indices and interpolation modes passed.
\n-
unsigned int triangulateQuads
Triangulate 'QUADS' primitives (Uniform mode only)
\n-
EndCapType
Choice for approximating irregular patches (end-caps)
\n-
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n-
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n-\n-
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n-
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n-\n-
Obsolete internal struct not intended for public use \u2013 due to be deprecated.
\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-\n-
Stores topology data for a specified set of refinement options.
\n-\n-\n-\n-\n-\n+\n+
Object used to compute and query ptex face indices.
Definition ptexIndices.h:46
\n+
int GetFaceId(Index f) const
Returns the ptex face index given a coarse face 'f' or -1.
\n+
PtexIndices(TopologyRefiner const &refiner)
Constructor.
\n+
void GetAdjacency(TopologyRefiner const &refiner, int face, int quadrant, int adjFaces[4], int adjEdges[4]) const
Returns ptex face adjacency information for a given coarse face.
\n+
int GetNumFaces() const
Returns the number of ptex faces in the mesh.
\n+\n+
Stores topology data for a specified set of refinement options.
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchTableFactory.h\n+ptexIndices.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,410 +23,90 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n-26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n-27\n-28#include \"../version.h\"\n-29\n-30#include \"../far/topologyRefiner.h\"\n-31#include \"../far/patchTable.h\"\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-36namespace Far {\n-37\n-_\b4_\b0class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n-41public:\n-42\n-_\b4_\b5 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n-46\n-_\b5_\b5 enum _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be {\n-_\b5_\b6 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE = 0,\n-_\b5_\b7 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS,\n-_\b5_\b8 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS,\n-_\b5_\b9 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n-60 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n-_\b6_\b1 };\n-62\n-_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs(unsigned int maxIsolation=10) :\n-64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs(false),\n-65 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(true),\n-66 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(false),\n-67 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs(false),\n-68 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh(false),\n-69 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh(false),\n-70 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(maxIsolation & 0xf),\n-71 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS),\n-72 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs(true),\n-73 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs(true),\n-74 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs(true),\n-75 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs(false),\n-76 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n-77 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n-78 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n-79 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n-80 _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(-1),\n-81 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(0)\n-82 { }\n-83\n-_\b8_\b5 _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be _\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be() const { return (_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be)_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be; }\n-86\n-_\b8_\b8 void _\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be e) { _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be = e & 0x7; }\n+24#ifndef OPENSUBDIV3_FAR_PTEX_INDICES_H\n+25#define OPENSUBDIV3_FAR_PTEX_INDICES_H\n+26\n+27#include \"../version.h\"\n+28\n+29#include \"../far/topologyRefiner.h\"\n+30#include \"../far/types.h\"\n+31\n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38\n+_\b4_\b6class _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs {\n+47\n+48public:\n+49\n+_\b5_\b1 _\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner);\n+52\n+_\b5_\b4 _\b~_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs();\n+55\n+57\n+60\n+_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs() const;\n+64\n+_\b6_\b7 int _\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd(_\bI_\bn_\bd_\be_\bx f) const;\n+68\n+_\b8_\b3 void _\bG_\be_\bt_\bA_\bd_\bj_\ba_\bc_\be_\bn_\bc_\by(\n+84 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner,\n+85 int face, int quadrant,\n+86 int adjFaces[4], int adjEdges[4]) const;\n+87\n 89\n-_\b9_\b1 void _\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(unsigned int level) { _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl = level &\n-0xf; }\n-92\n-_\b9_\b4 template void _\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+90private:\n+91\n+92 void initializePtexIndices(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const &refiner);\n+93\n+94private:\n 95\n-_\b9_\b7 template void _\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+96 std::vector _ptexIndices;\n+97};\n 98\n-_\b1_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const {\n-101 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs adaptiveOptions(_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl);\n-102\n-103 adaptiveOptions._\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh;\n-104 adaptiveOptions._\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh;\n-105 adaptiveOptions._\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs = _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs &&\n-106 !_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs;\n-107 return adaptiveOptions;\n-108 }\n-109\n-_\b1_\b1_\b0 unsigned int _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs : 1,\n-_\b1_\b1_\b1 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n-_\b1_\b1_\b2 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n-_\b1_\b1_\b3 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs : 1,\n-114\n-_\b1_\b1_\b5 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh : 1,\n-_\b1_\b1_\b6 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh : 1,\n-_\b1_\b1_\b7 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl : 4,\n-118\n-119 // end-capping\n-_\b1_\b2_\b0 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be : 3,\n-_\b1_\b2_\b1 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n-123\n-124 // varying\n-_\b1_\b2_\b5 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs : 1,\n-_\b1_\b2_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n-127\n-128 // face-varying\n-_\b1_\b2_\b9 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs : 1,\n-130\n-131 // precision\n-_\b1_\b3_\b2 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n-_\b1_\b3_\b3 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n-134\n-135 // legacy behaviors (default to true)\n-_\b1_\b3_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1,\n-_\b1_\b3_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1;\n-138\n-_\b1_\b3_\b9 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n-_\b1_\b4_\b0 int const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n-141 };\n-142\n-_\b1_\b7_\b5 static _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be * _\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n-176 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs(),\n-177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces = _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by());\n-178\n-179public:\n-180 // PatchFaceTag\n-181 //\n-182 // This simple struct was previously used within the factory to take\n-inventory of\n-183 // various kinds of patches to fully allocate buffers prior to populating\n-them. It\n-184 // was not intended to be exposed as part of the public interface.\n-185 //\n-186 // It is no longer used internally and is being kept here to respect\n-preservation\n-187 // of the public interface, but it will be deprecated at the earliest\n-opportunity.\n-188 //\n-191 //\n-_\b1_\b9_\b2 struct _\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg {\n-193 public:\n-_\b1_\b9_\b4 unsigned int _\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh : 1;\n-_\b1_\b9_\b5 unsigned int _\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br : 1;\n-_\b1_\b9_\b6 unsigned int _\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk : 4;\n-_\b1_\b9_\b7 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk : 4;\n-_\b1_\b9_\b8 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx : 2;\n-_\b1_\b9_\b9 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt : 3;\n-_\b2_\b0_\b0 unsigned int _\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be : 3;\n-_\b2_\b0_\b1 unsigned int _\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be : 1;\n-202\n-_\b2_\b0_\b3 void _\bc_\bl_\be_\ba_\br();\n-_\b2_\b0_\b4 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryEdgeMask);\n-_\b2_\b0_\b5 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n-_\b2_\b0_\b6 void _\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n-207 };\n-_\b2_\b0_\b8 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br;\n-209};\n-210\n-211\n-_\b2_\b1_\b2template <> inline void PatchTableFactory::Options::SetPatchPrecision\n-() {\n-213 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be = false;\n-214}\n-_\b2_\b1_\b5template <> inline void PatchTableFactory::Options::\n-SetFVarPatchPrecision() {\n-216 fvarPatchPrecisionDouble = false;\n-217}\n-218\n-219template <> inline void PatchTableFactory::Options::\n-SetPatchPrecision() {\n-220 patchPrecisionDouble = true;\n-221}\n-222template <> inline void PatchTableFactory::Options::\n-SetFVarPatchPrecision() {\n-223 fvarPatchPrecisionDouble = true;\n-224}\n-225\n-226\n-227} // end namespace Far\n-228\n-229} // end namespace OPENSUBDIV_VERSION\n-230using namespace OPENSUBDIV_VERSION;\n-231\n-232} // end namespace OpenSubdiv\n-233\n-234\n-235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */\n+99\n+100} // end namespace Far\n+101\n+102} // end namespace OPENSUBDIV_VERSION\n+103using namespace OPENSUBDIV_VERSION;\n+104} // end namespace OpenSubdiv\n+105\n+106#endif /* OPENSUBDIV3_FAR_PTEX_INDICES_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::ConstIndexArray ConstIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-Container for arrays of parametric patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n-Factory for constructing a PatchTable from a TopologyRefiner.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchFaceTag > PatchTagVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static PatchTable * Create(TopologyRefiner const &refiner, Options\n-options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())\n-Instantiates a PatchTable from a client-provided TopologyRefiner.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Public options for the PatchTable factory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs\n-unsigned int generateVaryingTables\n-Generate varying patch tables.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-unsigned int generateLegacySharpCornerPatches\n-Generate sharp regular patches at smooth corners (legacy)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs\n-unsigned int shareEndCapPatchPoints\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const\n-Determine adaptive refinement options to match assigned patch options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-unsigned int maxIsolationLevel\n-Cap adaptive feature isolation to the given level (max. 10)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-EndCapType GetEndCapType() const\n-Get endcap basis type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-unsigned int generateFVarLegacyLinearPatches\n-Generate all linear face-varying patches (legacy)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n-void SetPatchPrecision()\n-Set precision of vertex patches.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n-unsigned int fvarPatchPrecisionDouble\n-Generate double-precision stencils for face-varying patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n-void SetMaxIsolationLevel(unsigned int level)\n-Set maximum isolation level.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-unsigned int endCapType\n-EndCapType.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-int const * fvarChannelIndices\n-List containing the indices of the channels selected for the factory.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n-unsigned int useSingleCreasePatch\n-Use single crease patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n-unsigned int useInfSharpPatch\n-Use infinitely-sharp patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-void SetEndCapType(EndCapType e)\n-Set endcap basis type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n-unsigned int generateVaryingLocalPoints\n-Generate local points with varying patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-unsigned int includeFVarBaseLevelIndices\n-Include base level in face-varying patch point indices (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs\n-unsigned int generateAllLevels\n-Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n-unsigned int patchPrecisionDouble\n-Generate double-precision stencils for vertex patches.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs\n-unsigned int generateFVarTables\n-Generate face-varying patch tables.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-unsigned int includeBaseLevelIndices\n-Include base level in patch point indices (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n-void SetFVarPatchPrecision()\n-Set precision of face-varying patches.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int numFVarChannels\n-Number of channel indices and interpolation modes passed.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs\n-unsigned int triangulateQuads\n-Triangulate 'QUADS' primitives (Uniform mode only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n-EndCapType\n-Choice for approximating irregular patches (end-caps)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n-@ ENDCAP_LEGACY_GREGORY\n-legacy option for 2.x style Gregory patches (Catmark only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_GREGORY_BASIS\n-use Gregory patches (highest quality, recommended default)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE\n-@ ENDCAP_NONE\n-unspecified\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_BILINEAR_BASIS\n-use linear patches (simple quads or tris)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS\n-@ ENDCAP_BSPLINE_BASIS\n-use BSpline-like patches (same patch type as regular)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Options(unsigned int maxIsolation=10)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n-Obsolete internal struct not intended for public use \u00e2\u0080\u0093 due to be deprecated.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be\n-unsigned int _isSingleCrease\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n-unsigned int _isRegular\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx\n-unsigned int _boundaryIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n-void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk\n-unsigned int _transitionMask\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n-unsigned int _hasBoundaryEdge\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk\n-unsigned int _boundaryMask\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh\n-unsigned int _hasPatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n-void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\bc_\bl_\be_\ba_\br\n-void clear()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n-void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n-_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt\n-unsigned int _boundaryCount\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Object used to compute and query ptex face indices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh_\b:_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd\n+int GetFaceId(Index f) const\n+Returns the ptex face index given a coarse face 'f' or -1.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+PtexIndices(TopologyRefiner const &refiner)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bA_\bd_\bj_\ba_\bc_\be_\bn_\bc_\by\n+void GetAdjacency(TopologyRefiner const &refiner, int face, int quadrant, int\n+adjFaces[4], int adjEdges[4]) const\n+Returns ptex face adjacency information for a given coarse face.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\ba_\bc_\be_\bs\n+int GetNumFaces() const\n+Returns the number of ptex faces in the mesh.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b:_\b:_\b~_\bP_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+~PtexIndices()\n+Destructor.\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-Adaptive refinement options.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n-unsigned int useSingleCreasePatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n-unsigned int useInfSharpPatch\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-unsigned int considerFVarChannels\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bp_\bt_\be_\bx_\bI_\bn_\bd_\bi_\bc_\be_\bs_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/primvarRefiner.h File Reference\n+OpenSubdiv: opensubdiv/far/patchTableFactory.h File Reference\n \n \n \n \n \n \n \n@@ -90,43 +90,33 @@\n \n \n \n
\n \n-
primvarRefiner.h File Reference
\n+
patchTableFactory.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/types.h"
\n-#include "../sdc/options.h"
\n-#include "../sdc/bilinearScheme.h"
\n-#include "../sdc/catmarkScheme.h"
\n-#include "../sdc/loopScheme.h"
\n-#include "../vtr/level.h"
\n-#include "../vtr/fvarLevel.h"
\n-#include "../vtr/refinement.h"
\n-#include "../vtr/fvarRefinement.h"
\n-#include "../vtr/stackBuffer.h"
\n-#include "../vtr/componentInterfaces.h"
\n-#include "../far/types.h"
\n-#include "../far/error.h"
\n-#include "../far/topologyLevel.h"
\n-#include "../far/topologyRefiner.h"
\n-#include <cassert>
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/patchTable.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n+\n+\n+\n+\n \n

\n Classes

class  PrimvarRefinerReal< REAL >
 Applies refinement operations to generic primvar data. More...
class  PatchTableFactory
 Factory for constructing a PatchTable from a TopologyRefiner. More...
 
class  PrimvarRefiner
struct  PatchTableFactory::Options
 Public options for the PatchTable factory. More...
 
struct  PatchTableFactory::PatchFaceTag
 Obsolete internal struct not intended for public use – due to be deprecated. More...
 
\n \n \n \n \n@@ -135,13 +125,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,41 +1,32 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-primvarRefiner.h File Reference\n+patchTableFactory.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bb_\bi_\bl_\bi_\bn_\be_\ba_\br_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bl_\bo_\bo_\bp_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bl_\be_\bv_\be_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bL_\be_\bv_\be_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\br_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bf_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\bm_\be_\bn_\bt_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bs_\bt_\ba_\bc_\bk_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bv_\bt_\br_\b/_\bc_\bo_\bm_\bp_\bo_\bn_\be_\bn_\bt_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\b _\bR_\bE_\bA_\bL_\b _\b>\n-\u00a0 Applies refinement operations to generic primvar data. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+\u00a0 Factory for constructing a _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be from a _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 Public options for the _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be factory. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n+\u00a0 Obsolete internal struct not intended for public use \u2013 due to be\n+ deprecated. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,5 @@\n var a00728 = [\n- [\"PrimvarRefinerReal< REAL >\", \"a01029.html\", \"a01029\"],\n- [\"PrimvarRefiner\", \"a01037.html\", \"a01037\"]\n+ [\"PatchTableFactory\", \"a01017.html\", \"a01017\"],\n+ [\"Options\", \"a01021.html\", \"a01021\"],\n+ [\"PatchFaceTag\", \"a01025.html\", \"a01025\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00728_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00728_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/primvarRefiner.h Source File\n+OpenSubdiv: opensubdiv/far/patchTableFactory.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
primvarRefiner.h
\n+
patchTableFactory.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 DreamWorks Animation LLC.
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -118,1233 +118,250 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n-
25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H
\n-
26
\n-
27#include "../version.h"
\n-
28
\n-
29#include "../sdc/types.h"
\n-
30#include "../sdc/options.h"
\n-
31#include "../sdc/bilinearScheme.h"
\n-
32#include "../sdc/catmarkScheme.h"
\n-
33#include "../sdc/loopScheme.h"
\n-
34#include "../vtr/level.h"
\n-
35#include "../vtr/fvarLevel.h"
\n-
36#include "../vtr/refinement.h"
\n-
37#include "../vtr/fvarRefinement.h"
\n-
38#include "../vtr/stackBuffer.h"
\n-
39#include "../vtr/componentInterfaces.h"
\n-
40#include "../far/types.h"
\n-
41#include "../far/error.h"
\n-
42#include "../far/topologyLevel.h"
\n-
43#include "../far/topologyRefiner.h"
\n-
44
\n-
45#include <cassert>
\n+
24
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H
\n+
27
\n+
28#include "../version.h"
\n+
29
\n+
30#include "../far/topologyRefiner.h"
\n+
31#include "../far/patchTable.h"
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Far {
\n+
37
\n+
\n+\n+
41public:
\n+
42
\n+
\n+
45 struct Options {
\n
46
\n-
47namespace OpenSubdiv {
\n-
48namespace OPENSUBDIV_VERSION {
\n-
49
\n-
50namespace Far {
\n-
51
\n-
55template <typename REAL>
\n-
\n-\n-
57
\n-
58public:
\n-
59 PrimvarRefinerReal(TopologyRefiner const & refiner) : _refiner(refiner) { }
\n-\n-
61
\n-
62 TopologyRefiner const & GetTopologyRefiner() const { return _refiner; }
\n-
63
\n-
65
\n-
100
\n-
\n-
113 template <class T, class U> void Interpolate(int level, T const & src, U & dst) const;
\n+\n+
62
\n+
\n+
63 Options(unsigned int maxIsolation=10) :
\n+
64 generateAllLevels(false),
\n+\n+\n+
67 triangulateQuads(false),
\n+\n+
69 useInfSharpPatch(false),
\n+
70 maxIsolationLevel(maxIsolation & 0xf),
\n+\n+\n+\n+\n+
75 generateFVarTables(false),
\n+\n+\n+\n+\n+\n+\n+
82 { }
\n+
\n+
83
\n+\n+
86
\n+
88 void SetEndCapType(EndCapType e) { endCapType = e & 0x7; }
\n+
89
\n+
91 void SetMaxIsolationLevel(unsigned int level) { maxIsolationLevel = level & 0xf; }
\n+
92
\n+
94 template <typename REAL> void SetPatchPrecision();
\n+
95
\n+
97 template <typename REAL> void SetFVarPatchPrecision();
\n+
98
\n+
\n+\n+\n+
102
\n+
103 adaptiveOptions.useInfSharpPatch = useInfSharpPatch;
\n+\n+
105 adaptiveOptions.considerFVarChannels = generateFVarTables &&
\n+\n+
107 return adaptiveOptions;
\n+
108 }
\n+
\n+
109
\n+
110 unsigned int generateAllLevels : 1,
\n+\n+\n+\n
114
\n-
\n-
130 template <class T, class U> void InterpolateVarying(int level, T const & src, U & dst) const;
\n-
131
\n-
\n-
148 template <class T, class U> void InterpolateFaceUniform(int level, T const & src, U & dst) const;
\n-
149
\n-
\n-
161 template <class T, class U> void InterpolateFaceVarying(int level, T const & src, U & dst, int channel = 0) const;
\n-
162
\n-
163
\n-
\n-
175 template <class T, class U> void Limit(T const & src, U & dstPos) const;
\n-
176
\n-
177 template <class T, class U, class U1, class U2>
\n-
\n-
178 void Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;
\n-
179
\n-
\n-
180 template <class T, class U> void LimitFaceVarying(T const & src, U & dst, int channel = 0) const;
\n-
181
\n-
183
\n-
184private:
\n-
185 typedef REAL Weight;
\n-
186
\n-
187 // Non-copyable:
\n-
188 PrimvarRefinerReal(PrimvarRefinerReal const & src) : _refiner(src._refiner) { }
\n-
189 PrimvarRefinerReal & operator=(PrimvarRefinerReal const &) { return *this; }
\n-
190
\n-
191 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromFaces(int, T const &, U &) const;
\n-
192 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromEdges(int, T const &, U &) const;
\n-
193 template <Sdc::SchemeType SCHEME, class T, class U> void interpFromVerts(int, T const &, U &) const;
\n-
194
\n-
195 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromFaces(int, T const &, U &, int) const;
\n-
196 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromEdges(int, T const &, U &, int) const;
\n-
197 template <Sdc::SchemeType SCHEME, class T, class U> void interpFVarFromVerts(int, T const &, U &, int) const;
\n-
198
\n-
199 template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n-
200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;
\n-
201
\n-
202 template <Sdc::SchemeType SCHEME, class T, class U>
\n-
203 void limitFVar(T const & src, U & dst, int channel) const;
\n-
204
\n-
205private:
\n-
206 TopologyRefiner const & _refiner;
\n-
207
\n-
208private:
\n-
209 //
\n-
210 // Local class to fulfill interface for <typename MASK> in the Scheme mask queries:
\n-
211 //
\n-
212 class Mask {
\n-
213 public:
\n-
214 typedef REAL Weight; // Also part of the expected interface
\n-
215
\n-
216 public:
\n-
217 Mask(Weight* v, Weight* e, Weight* f) :
\n-
218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),
\n-
219 _vertCount(0), _edgeCount(0), _faceCount(0),
\n-
220 _faceWeightsForFaceCenters(false)
\n-
221 { }
\n-
222
\n-
223 ~Mask() { }
\n-
224
\n-
225 public: // Generic interface expected of <typename MASK>:
\n-
226 int GetNumVertexWeights() const { return _vertCount; }
\n-
227 int GetNumEdgeWeights() const { return _edgeCount; }
\n-
228 int GetNumFaceWeights() const { return _faceCount; }
\n-
229
\n-
230 void SetNumVertexWeights(int count) { _vertCount = count; }
\n-
231 void SetNumEdgeWeights( int count) { _edgeCount = count; }
\n-
232 void SetNumFaceWeights( int count) { _faceCount = count; }
\n+\n+\n+\n+
118
\n+
119 // end-capping
\n+\n+\n+
123
\n+
124 // varying
\n+\n+\n+
127
\n+
128 // face-varying
\n+\n+
130
\n+
131 // precision
\n+\n+\n+
134
\n+
135 // legacy behaviors (default to true)
\n+\n+\n+
138
\n+\n+
140 int const * fvarChannelIndices;
\n+
141 };
\n+
\n+
142
\n+
175 static PatchTable * Create(TopologyRefiner const & refiner,
\n+
176 Options options = Options(),
\n+
177 ConstIndexArray selectedFaces = ConstIndexArray());
\n+
178
\n+
179public:
\n+
180 // PatchFaceTag
\n+
181 //
\n+
182 // This simple struct was previously used within the factory to take inventory of
\n+
183 // various kinds of patches to fully allocate buffers prior to populating them. It
\n+
184 // was not intended to be exposed as part of the public interface.
\n+
185 //
\n+
186 // It is no longer used internally and is being kept here to respect preservation
\n+
187 // of the public interface, but it will be deprecated at the earliest opportunity.
\n+
188 //
\n+
191 //
\n+
\n+\n+
193 public:
\n+
194 unsigned int _hasPatch : 1;
\n+
195 unsigned int _isRegular : 1;
\n+
196 unsigned int _transitionMask : 4;
\n+
197 unsigned int _boundaryMask : 4;
\n+
198 unsigned int _boundaryIndex : 2;
\n+
199 unsigned int _boundaryCount : 3;
\n+
200 unsigned int _hasBoundaryEdge : 3;
\n+
201 unsigned int _isSingleCrease : 1;
\n+
202
\n+
203 void clear();
\n+
204 void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask);
\n+
205 void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask);
\n+
206 void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask);
\n+
207 };
\n+
\n+
208 typedef std::vector<PatchFaceTag> PatchTagVector;
\n+
209};
\n+
\n+
210
\n+
211
\n+
\n+
212template <> inline void PatchTableFactory::Options::SetPatchPrecision<float>() {
\n+
213 patchPrecisionDouble = false;
\n+
214}
\n+
\n+
\n+
215template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<float>() {
\n+
216 fvarPatchPrecisionDouble = false;
\n+
217}
\n+
\n+
218
\n+
219template <> inline void PatchTableFactory::Options::SetPatchPrecision<double>() {
\n+
220 patchPrecisionDouble = true;
\n+
221}
\n+
222template <> inline void PatchTableFactory::Options::SetFVarPatchPrecision<double>() {
\n+
223 fvarPatchPrecisionDouble = true;
\n+
224}
\n+
225
\n+
226
\n+
227} // end namespace Far
\n+
228
\n+
229} // end namespace OPENSUBDIV_VERSION
\n+
230using namespace OPENSUBDIV_VERSION;
\n+
231
\n+
232} // end namespace OpenSubdiv
\n
233
\n-
234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }
\n-
235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }
\n-
236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }
\n-
237
\n-
238 Weight& VertexWeight(int index) { return _vertWeights[index]; }
\n-
239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }
\n-
240 Weight& FaceWeight( int index) { return _faceWeights[index]; }
\n-
241
\n-
242 bool AreFaceWeightsForFaceCenters() const { return _faceWeightsForFaceCenters; }
\n-
243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters = on; }
\n-
244
\n-
245 private:
\n-
246 Weight* _vertWeights;
\n-
247 Weight* _edgeWeights;
\n-
248 Weight* _faceWeights;
\n-
249
\n-
250 int _vertCount;
\n-
251 int _edgeCount;
\n-
252 int _faceCount;
\n-
253
\n-
254 bool _faceWeightsForFaceCenters;
\n-
255 };
\n-
256};
\n-
257
\n-
258
\n-
259//
\n-
260// Public entry points to the methods. Queries of the scheme type and its
\n-
261// use as a template parameter in subsequent implementation will be factored
\n-
262// out of a later release:
\n-
263//
\n-
264template <typename REAL>
\n-
265template <class T, class U>
\n-
266inline void
\n-
\n-
267PrimvarRefinerReal<REAL>::Interpolate(int level, T const & src, U & dst) const {
\n-
268
\n-
269 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
270
\n-
271 switch (_refiner._subdivType) {
\n-\n-
273 interpFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
274 interpFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
275 interpFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst);
\n-
276 break;
\n-
277 case Sdc::SCHEME_LOOP:
\n-
278 interpFromFaces<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
279 interpFromEdges<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
280 interpFromVerts<Sdc::SCHEME_LOOP>(level, src, dst);
\n-
281 break;
\n-\n-
283 interpFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
284 interpFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
285 interpFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst);
\n-
286 break;
\n-
287 }
\n-
288}
\n-
\n-
289
\n-
290template <typename REAL>
\n-
291template <class T, class U>
\n-
292inline void
\n-
\n-
293PrimvarRefinerReal<REAL>::InterpolateFaceVarying(int level, T const & src, U & dst, int channel) const {
\n-
294
\n-
295 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
296
\n-
297 switch (_refiner._subdivType) {
\n-\n-
299 interpFVarFromFaces<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
300 interpFVarFromEdges<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
301 interpFVarFromVerts<Sdc::SCHEME_CATMARK>(level, src, dst, channel);
\n-
302 break;
\n-
303 case Sdc::SCHEME_LOOP:
\n-
304 interpFVarFromFaces<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
305 interpFVarFromEdges<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
306 interpFVarFromVerts<Sdc::SCHEME_LOOP>(level, src, dst, channel);
\n-
307 break;
\n-\n-
309 interpFVarFromFaces<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
310 interpFVarFromEdges<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
311 interpFVarFromVerts<Sdc::SCHEME_BILINEAR>(level, src, dst, channel);
\n-
312 break;
\n-
313 }
\n-
314}
\n-
\n-
315
\n-
316template <typename REAL>
\n-
317template <class T, class U>
\n-
318inline void
\n-
\n-
319PrimvarRefinerReal<REAL>::Limit(T const & src, U & dst) const {
\n-
320
\n-
321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
323 "Failure in PrimvarRefiner::Limit() -- "
\n-
324 "last level of refinement does not include full topology.");
\n-
325 return;
\n-
326 }
\n-
327
\n-
328 switch (_refiner._subdivType) {
\n-\n-
330 limit<Sdc::SCHEME_CATMARK>(src, dst, (U*)0, (U*)0);
\n-
331 break;
\n-
332 case Sdc::SCHEME_LOOP:
\n-
333 limit<Sdc::SCHEME_LOOP>(src, dst, (U*)0, (U*)0);
\n-
334 break;
\n-\n-
336 limit<Sdc::SCHEME_BILINEAR>(src, dst, (U*)0, (U*)0);
\n-
337 break;
\n-
338 }
\n-
339}
\n-
\n-
340
\n-
341template <typename REAL>
\n-
342template <class T, class U, class U1, class U2>
\n-
343inline void
\n-
\n-
344PrimvarRefinerReal<REAL>::Limit(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const {
\n-
345
\n-
346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
348 "Failure in PrimvarRefiner::Limit() -- "
\n-
349 "last level of refinement does not include full topology.");
\n-
350 return;
\n-
351 }
\n-
352
\n-
353 switch (_refiner._subdivType) {
\n-\n-
355 limit<Sdc::SCHEME_CATMARK>(src, dstPos, &dstTan1, &dstTan2);
\n-
356 break;
\n-
357 case Sdc::SCHEME_LOOP:
\n-
358 limit<Sdc::SCHEME_LOOP>(src, dstPos, &dstTan1, &dstTan2);
\n-
359 break;
\n-\n-
361 limit<Sdc::SCHEME_BILINEAR>(src, dstPos, &dstTan1, &dstTan2);
\n-
362 break;
\n-
363 }
\n-
364}
\n-
\n-
365
\n-
366template <typename REAL>
\n-
367template <class T, class U>
\n-
368inline void
\n-
\n-
369PrimvarRefinerReal<REAL>::LimitFaceVarying(T const & src, U & dst, int channel) const {
\n-
370
\n-
371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() == 0) {
\n-\n-
373 "Failure in PrimvarRefiner::LimitFaceVarying() -- "
\n-
374 "last level of refinement does not include full topology.");
\n-
375 return;
\n-
376 }
\n-
377
\n-
378 switch (_refiner._subdivType) {
\n-\n-
380 limitFVar<Sdc::SCHEME_CATMARK>(src, dst, channel);
\n-
381 break;
\n-
382 case Sdc::SCHEME_LOOP:
\n-
383 limitFVar<Sdc::SCHEME_LOOP>(src, dst, channel);
\n-
384 break;
\n-\n-
386 limitFVar<Sdc::SCHEME_BILINEAR>(src, dst, channel);
\n-
387 break;
\n-
388 }
\n-
389}
\n-
\n-
\n-
390
\n-
391template <typename REAL>
\n-
392template <class T, class U>
\n-
393inline void
\n-
\n-
394PrimvarRefinerReal<REAL>::InterpolateFaceUniform(int level, T const & src, U & dst) const {
\n-
395
\n-
396 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
397
\n-
398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
399 Vtr::internal::Level const & child = refinement.child();
\n-
400
\n-
401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {
\n-
402
\n-
403 Vtr::Index pFace = refinement.getChildFaceParentFace(cFace);
\n-
404
\n-
405 dst[cFace] = src[pFace];
\n-
406 }
\n-
407}
\n-
\n-
408
\n-
409template <typename REAL>
\n-
410template <class T, class U>
\n-
411inline void
\n-
\n-
412PrimvarRefinerReal<REAL>::InterpolateVarying(int level, T const & src, U & dst) const {
\n-
413
\n-
414 assert(level>0 && level<=(int)_refiner._refinements.size());
\n-
415
\n-
416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
417 Vtr::internal::Level const & parent = refinement.parent();
\n-
418
\n-
419 //
\n-
420 // Group values to interpolate based on origin -- note that there may
\n-
421 // be none originating from faces:
\n-
422 //
\n-
423 if (refinement.getNumChildVerticesFromFaces() > 0) {
\n-
424
\n-
425 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n-
426
\n-
427 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
428 if (Vtr::IndexIsValid(cVert)) {
\n-
429
\n-
430 // Apply the weights to the parent face's vertices:
\n-
431 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n-
432
\n-
433 Weight fVaryingWeight = 1.0f / (Weight) fVerts.size();
\n-
434
\n-
435 dst[cVert].Clear();
\n-
436 for (int i = 0; i < fVerts.size(); ++i) {
\n-
437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);
\n-
438 }
\n-
439 }
\n-
440 }
\n-
441 }
\n-
442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n-
443
\n-
444 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
445 if (Vtr::IndexIsValid(cVert)) {
\n-
446
\n-
447 // Apply the weights to the parent edges's vertices
\n-
448 ConstIndexArray eVerts = parent.getEdgeVertices(edge);
\n-
449
\n-
450 dst[cVert].Clear();
\n-
451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);
\n-
452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);
\n-
453 }
\n-
454 }
\n-
455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n-
456
\n-
457 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
458 if (Vtr::IndexIsValid(cVert)) {
\n-
459
\n-
460 // Essentially copy the parent vertex:
\n-
461 dst[cVert].Clear();
\n-
462 dst[cVert].AddWithWeight(src[vert], 1.0f);
\n-
463 }
\n-
464 }
\n-
465}
\n-
\n-
466
\n-
467
\n-
468//
\n-
469// Internal implementation methods -- grouping vertices to be interpolated
\n-
470// based on the type of parent component from which they originated:
\n-
471//
\n-
472template <typename REAL>
\n-
473template <Sdc::SchemeType SCHEME, class T, class U>
\n-
474inline void
\n-
475PrimvarRefinerReal<REAL>::interpFromFaces(int level, T const & src, U & dst) const {
\n-
476
\n-
477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
478 Vtr::internal::Level const & parent = refinement.parent();
\n-
479
\n-
480 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n-
481
\n-
482 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
483
\n-
484 Vtr::internal::StackBuffer<Weight,16> fVertWeights(parent.getMaxValence());
\n-
485
\n-
486 for (int face = 0; face < parent.getNumFaces(); ++face) {
\n-
487
\n-
488 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
489 if (!Vtr::IndexIsValid(cVert))
\n-
490 continue;
\n-
491
\n-
492 // Declare and compute mask weights for this vertex relative to its parent face:
\n-
493 ConstIndexArray fVerts = parent.getFaceVertices(face);
\n-
494
\n-
495 Mask fMask(fVertWeights, 0, 0);
\n-
496 Vtr::internal::FaceInterface fHood(fVerts.size());
\n-
497
\n-
498 scheme.ComputeFaceVertexMask(fHood, fMask);
\n-
499
\n-
500 // Apply the weights to the parent face's vertices:
\n-
501 dst[cVert].Clear();
\n-
502
\n-
503 for (int i = 0; i < fVerts.size(); ++i) {
\n-
504
\n-
505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);
\n-
506 }
\n-
507 }
\n-
508}
\n-
509
\n-
510template <typename REAL>
\n-
511template <Sdc::SchemeType SCHEME, class T, class U>
\n-
512inline void
\n-
513PrimvarRefinerReal<REAL>::interpFromEdges(int level, T const & src, U & dst) const {
\n-
514
\n-
515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
516 Vtr::internal::Level const & parent = refinement.parent();
\n-
517 Vtr::internal::Level const & child = refinement.child();
\n-
518
\n-
519 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
520
\n-
521 Vtr::internal::EdgeInterface eHood(parent);
\n-
522
\n-
523 Weight eVertWeights[2];
\n-
524 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parent.getMaxEdgeFaces());
\n-
525
\n-
526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {
\n-
527
\n-
528 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
529 if (!Vtr::IndexIsValid(cVert))
\n-
530 continue;
\n-
531
\n-
532 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
533 ConstIndexArray eVerts = parent.getEdgeVertices(edge),
\n-
534 eFaces = parent.getEdgeFaces(edge);
\n-
535
\n-
536 Mask eMask(eVertWeights, 0, eFaceWeights);
\n-
537
\n-
538 eHood.SetIndex(edge);
\n-
539
\n-
540 Sdc::Crease::Rule pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n-
541 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n-
542
\n-
543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n-
544
\n-
545 // Apply the weights to the parent edges's vertices and (if applicable) to
\n-
546 // the child vertices of its incident faces:
\n-
547 dst[cVert].Clear();
\n-
548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);
\n-
549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);
\n-
550
\n-
551 if (eMask.GetNumFaceWeights() > 0) {
\n-
552
\n-
553 for (int i = 0; i < eFaces.size(); ++i) {
\n-
554
\n-
555 if (eMask.AreFaceWeightsForFaceCenters()) {
\n-
556 assert(refinement.getNumChildVerticesFromFaces() > 0);
\n-
557 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n-
558
\n-
559 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);
\n-
561 } else {
\n-
562 Vtr::Index pFace = eFaces[i];
\n-
563 ConstIndexArray pFaceEdges = parent.getFaceEdges(pFace),
\n-
564 pFaceVerts = parent.getFaceVertices(pFace);
\n-
565
\n-
566 int eInFace = 0;
\n-
567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n-
568
\n-
569 int vInFace = eInFace + 2;
\n-
570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n-
571
\n-
572 Vtr::Index pVertNext = pFaceVerts[vInFace];
\n-
573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);
\n-
574 }
\n-
575 }
\n-
576 }
\n-
577 }
\n-
578}
\n-
579
\n-
580template <typename REAL>
\n-
581template <Sdc::SchemeType SCHEME, class T, class U>
\n-
582inline void
\n-
583PrimvarRefinerReal<REAL>::interpFromVerts(int level, T const & src, U & dst) const {
\n-
584
\n-
585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
586 Vtr::internal::Level const & parent = refinement.parent();
\n-
587 Vtr::internal::Level const & child = refinement.child();
\n-
588
\n-
589 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
590
\n-
591 Vtr::internal::VertexInterface vHood(parent, child);
\n-
592
\n-
593 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parent.getMaxValence());
\n-
594
\n-
595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {
\n-
596
\n-
597 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
598 if (!Vtr::IndexIsValid(cVert))
\n-
599 continue;
\n-
600
\n-
601 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
602 ConstIndexArray vEdges = parent.getVertexEdges(vert),
\n-
603 vFaces = parent.getVertexFaces(vert);
\n-
604
\n-
605 Weight vVertWeight,
\n-
606 * vEdgeWeights = weightBuffer,
\n-
607 * vFaceWeights = vEdgeWeights + vEdges.size();
\n-
608
\n-
609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n-
610
\n-
611 vHood.SetIndex(vert, cVert);
\n-
612
\n-
613 Sdc::Crease::Rule pRule = parent.getVertexRule(vert);
\n-
614 Sdc::Crease::Rule cRule = child.getVertexRule(cVert);
\n-
615
\n-
616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n-
617
\n-
618 // Apply the weights to the parent vertex, the vertices opposite its incident
\n-
619 // edges, and the child vertices of its incident faces:
\n-
620 //
\n-
621 // In order to improve numerical precision, it's better to apply smaller weights
\n-
622 // first, so begin with the face-weights followed by the edge-weights and the
\n-
623 // vertex weight last.
\n-
624 dst[cVert].Clear();
\n-
625
\n-
626 if (vMask.GetNumFaceWeights() > 0) {
\n-
627 assert(vMask.AreFaceWeightsForFaceCenters());
\n-
628
\n-
629 for (int i = 0; i < vFaces.size(); ++i) {
\n-
630
\n-
631 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n-
632 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);
\n-
634 }
\n-
635 }
\n-
636 if (vMask.GetNumEdgeWeights() > 0) {
\n-
637
\n-
638 for (int i = 0; i < vEdges.size(); ++i) {
\n-
639
\n-
640 ConstIndexArray eVerts = parent.getEdgeVertices(vEdges[i]);
\n-
641 Vtr::Index pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n-
642
\n-
643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);
\n-
644 }
\n-
645 }
\n-
646 dst[cVert].AddWithWeight(src[vert], vVertWeight);
\n-
647 }
\n-
648}
\n-
649
\n-
650
\n-
651//
\n-
652// Internal face-varying implementation details:
\n-
653//
\n-
654template <typename REAL>
\n-
655template <Sdc::SchemeType SCHEME, class T, class U>
\n-
656inline void
\n-
657PrimvarRefinerReal<REAL>::interpFVarFromFaces(int level, T const & src, U & dst, int channel) const {
\n-
658
\n-
659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
660
\n-
661 if (refinement.getNumChildVerticesFromFaces() == 0) return;
\n-
662
\n-
663 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
664
\n-
665 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
666 Vtr::internal::Level const & childLevel = refinement.child();
\n-
667
\n-
668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
670
\n-
671 Vtr::internal::StackBuffer<Weight,16> fValueWeights(parentLevel.getMaxValence());
\n-
672
\n-
673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {
\n-
674
\n-
675 Vtr::Index cVert = refinement.getFaceChildVertex(face);
\n-
676 if (!Vtr::IndexIsValid(cVert))
\n-
677 continue;
\n-
678
\n-
679 Vtr::Index cVertValue = childFVar.getVertexValueOffset(cVert);
\n-
680
\n-
681 // The only difference for face-varying here is that we get the values associated
\n-
682 // with each face-vertex directly from the FVarLevel, rather than using the parent
\n-
683 // face-vertices directly. If any face-vertex has any sibling values, then we may
\n-
684 // get the wrong one using the face-vertex index directly.
\n-
685
\n-
686 // Declare and compute mask weights for this vertex relative to its parent face:
\n-
687 ConstIndexArray fValues = parentFVar.getFaceValues(face);
\n-
688
\n-
689 Mask fMask(fValueWeights, 0, 0);
\n-
690 Vtr::internal::FaceInterface fHood(fValues.size());
\n-
691
\n-
692 scheme.ComputeFaceVertexMask(fHood, fMask);
\n-
693
\n-
694 // Apply the weights to the parent face's vertices:
\n-
695 dst[cVertValue].Clear();
\n-
696
\n-
697 for (int i = 0; i < fValues.size(); ++i) {
\n-
698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);
\n-
699 }
\n-
700 }
\n-
701}
\n-
702
\n-
703template <typename REAL>
\n-
704template <Sdc::SchemeType SCHEME, class T, class U>
\n-
705inline void
\n-
706PrimvarRefinerReal<REAL>::interpFVarFromEdges(int level, T const & src, U & dst, int channel) const {
\n-
707
\n-
708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
709
\n-
710 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
711
\n-
712 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
713 Vtr::internal::Level const & childLevel = refinement.child();
\n-
714
\n-
715 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n-
716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
718
\n-
719 //
\n-
720 // Allocate and initialize (if linearly interpolated) interpolation weights for
\n-
721 // the edge mask:
\n-
722 //
\n-
723 Weight eVertWeights[2];
\n-
724 Vtr::internal::StackBuffer<Weight,8> eFaceWeights(parentLevel.getMaxEdgeFaces());
\n-
725
\n-
726 Mask eMask(eVertWeights, 0, eFaceWeights);
\n-
727
\n-
728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n-
729 if (isLinearFVar) {
\n-
730 eMask.SetNumVertexWeights(2);
\n-
731 eMask.SetNumEdgeWeights(0);
\n-
732 eMask.SetNumFaceWeights(0);
\n-
733
\n-
734 eVertWeights[0] = 0.5f;
\n-
735 eVertWeights[1] = 0.5f;
\n-
736 }
\n-
737
\n-
738 Vtr::internal::EdgeInterface eHood(parentLevel);
\n-
739
\n-
740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {
\n-
741
\n-
742 Vtr::Index cVert = refinement.getEdgeChildVertex(edge);
\n-
743 if (!Vtr::IndexIsValid(cVert))
\n-
744 continue;
\n-
745
\n-
746 ConstIndexArray cVertValues = childFVar.getVertexValues(cVert);
\n-
747
\n-
748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n-
749 if (fvarEdgeVertMatchesVertex) {
\n-
750 //
\n-
751 // If smoothly interpolated, compute new weights for the edge mask:
\n-
752 //
\n-
753 if (!isLinearFVar) {
\n-
754 eHood.SetIndex(edge);
\n-
755
\n-
756 Sdc::Crease::Rule pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)
\n-
757 ? Sdc::Crease::RULE_CREASE : Sdc::Crease::RULE_SMOOTH;
\n-
758 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n-
759
\n-
760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);
\n-
761 }
\n-
762
\n-
763 // Apply the weights to the parent edge's vertices and (if applicable) to
\n-
764 // the child vertices of its incident faces:
\n-
765 //
\n-
766 // Even though the face-varying topology matches the vertex topology, we need
\n-
767 // to be careful here when getting values corresponding to the two end-vertices.
\n-
768 // While the edge may be continuous, the vertices at their ends may have
\n-
769 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n-
770 // of the end-vertex) and so have sibling values associated with them. In most
\n-
771 // cases the topology for an end-vertex will match and we can use it directly,
\n-
772 // but we must still check and retrieve as needed.
\n-
773 //
\n-
774 // Indices for values corresponding to face-vertices are guaranteed to match,
\n-
775 // so we can use the child-vertex indices directly.
\n-
776 //
\n-
777 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n-
778 // values in the "src" to account for the possible indirection that may exist at
\n-
779 // level 0 -- where there may be fewer values than vertices and an additional
\n-
780 // indirection is necessary. We can use a vertex index directly for "dst" when
\n-
781 // it matches.
\n-
782 //
\n-
783 Vtr::Index eVertValues[2];
\n-
784
\n-
785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);
\n-
786
\n-
787 Index cVertValue = cVertValues[0];
\n-
788
\n-
789 dst[cVertValue].Clear();
\n-
790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);
\n-
791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);
\n-
792
\n-
793 if (eMask.GetNumFaceWeights() > 0) {
\n-
794
\n-
795 ConstIndexArray eFaces = parentLevel.getEdgeFaces(edge);
\n-
796
\n-
797 for (int i = 0; i < eFaces.size(); ++i) {
\n-
798 if (eMask.AreFaceWeightsForFaceCenters()) {
\n-
799
\n-
800 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);
\n-
801 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
802
\n-
803 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n-
804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);
\n-
805 } else {
\n-
806 Vtr::Index pFace = eFaces[i];
\n-
807 ConstIndexArray pFaceEdges = parentLevel.getFaceEdges(pFace),
\n-
808 pFaceVerts = parentLevel.getFaceVertices(pFace);
\n-
809
\n-
810 int eInFace = 0;
\n-
811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;
\n-
812
\n-
813 // Edge "i" spans vertices [i,i+1] so we want i+2...
\n-
814 int vInFace = eInFace + 2;
\n-
815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts.size();
\n-
816
\n-
817 Vtr::Index pValueNext = parentFVar.getFaceValues(pFace)[vInFace];
\n-
818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);
\n-
819 }
\n-
820 }
\n-
821 }
\n-
822 } else {
\n-
823 //
\n-
824 // Mismatched edge-verts should just be linearly interpolated between the pairs of
\n-
825 // values for each sibling of the child edge-vertex -- the question is: which face
\n-
826 // holds that pair of values for a given sibling?
\n-
827 //
\n-
828 // In the manifold case, the sibling and edge-face indices will correspond. We
\n-
829 // will eventually need to update this to account for > 3 incident faces.
\n-
830 //
\n-
831 for (int i = 0; i < cVertValues.size(); ++i) {
\n-
832 Vtr::Index eVertValues[2];
\n-
833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);
\n-
834 assert(eFaceIndex == i);
\n-
835
\n-
836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);
\n-
837
\n-
838 Index cVertValue = cVertValues[i];
\n-
839
\n-
840 dst[cVertValue].Clear();
\n-
841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);
\n-
842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);
\n-
843 }
\n-
844 }
\n-
845 }
\n-
846}
\n-
847
\n-
848template <typename REAL>
\n-
849template <Sdc::SchemeType SCHEME, class T, class U>
\n-
850inline void
\n-
851PrimvarRefinerReal<REAL>::interpFVarFromVerts(int level, T const & src, U & dst, int channel) const {
\n-
852
\n-
853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement(level-1);
\n-
854
\n-
855 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
856
\n-
857 Vtr::internal::Level const & parentLevel = refinement.parent();
\n-
858 Vtr::internal::Level const & childLevel = refinement.child();
\n-
859
\n-
860 Vtr::internal::FVarRefinement const & refineFVar = refinement.getFVarRefinement(channel);
\n-
861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel(channel);
\n-
862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel(channel);
\n-
863
\n-
864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == Sdc::SCHEME_BILINEAR);
\n-
865
\n-
866 Vtr::internal::StackBuffer<Weight,32> weightBuffer(2*parentLevel.getMaxValence());
\n-
867
\n-
868 Vtr::internal::StackBuffer<Vtr::Index,16> vEdgeValues(parentLevel.getMaxValence());
\n-
869
\n-
870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);
\n-
871
\n-
872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {
\n-
873
\n-
874 Vtr::Index cVert = refinement.getVertexChildVertex(vert);
\n-
875 if (!Vtr::IndexIsValid(cVert))
\n-
876 continue;
\n-
877
\n-
878 ConstIndexArray pVertValues = parentFVar.getVertexValues(vert),
\n-
879 cVertValues = childFVar.getVertexValues(cVert);
\n-
880
\n-
881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues[0]);
\n-
882 if (isLinearFVar && fvarVertVertMatchesVertex) {
\n-
883 dst[cVertValues[0]].Clear();
\n-
884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);
\n-
885 continue;
\n-
886 }
\n-
887
\n-
888 if (fvarVertVertMatchesVertex) {
\n-
889 //
\n-
890 // Declare and compute mask weights for this vertex relative to its parent edge:
\n-
891 //
\n-
892 // (We really need to encapsulate this somewhere else for use here and in the
\n-
893 // general case)
\n-
894 //
\n-
895 ConstIndexArray vEdges = parentLevel.getVertexEdges(vert);
\n-
896
\n-
897 Weight vVertWeight;
\n-
898 Weight * vEdgeWeights = weightBuffer;
\n-
899 Weight * vFaceWeights = vEdgeWeights + vEdges.size();
\n-
900
\n-
901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);
\n-
902
\n-
903 vHood.SetIndex(vert, cVert);
\n-
904
\n-
905 Sdc::Crease::Rule pRule = parentLevel.getVertexRule(vert);
\n-
906 Sdc::Crease::Rule cRule = childLevel.getVertexRule(cVert);
\n-
907
\n-
908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);
\n-
909
\n-
910 // Apply the weights to the parent vertex, the vertices opposite its incident
\n-
911 // edges, and the child vertices of its incident faces:
\n-
912 //
\n-
913 // Even though the face-varying topology matches the vertex topology, we need
\n-
914 // to be careful here when getting values corresponding to vertices at the
\n-
915 // ends of edges. While the edge may be continuous, the end vertex may have
\n-
916 // discontinuities elsewhere in their neighborhood (i.e. on the "other side"
\n-
917 // of the end-vertex) and so have sibling values associated with them. In most
\n-
918 // cases the topology for an end-vertex will match and we can use it directly,
\n-
919 // but we must still check and retrieve as needed.
\n-
920 //
\n-
921 // Indices for values corresponding to face-vertices are guaranteed to match,
\n-
922 // so we can use the child-vertex indices directly.
\n-
923 //
\n-
924 // And by "directly", we always use getVertexValue(vertexIndex) to reference
\n-
925 // values in the "src" to account for the possible indirection that may exist at
\n-
926 // level 0 -- where there may be fewer values than vertices and an additional
\n-
927 // indirection is necessary. We can use a vertex index directly for "dst" when
\n-
928 // it matches.
\n-
929 //
\n-
930 // As with applying the mask to vertex data, in order to improve numerical
\n-
931 // precision, it's better to apply smaller weights first, so begin with the
\n-
932 // face-weights followed by the edge-weights and the vertex weight last.
\n-
933 //
\n-
934 Vtr::Index pVertValue = pVertValues[0];
\n-
935 Vtr::Index cVertValue = cVertValues[0];
\n-
936
\n-
937 dst[cVertValue].Clear();
\n-
938 if (vMask.GetNumFaceWeights() > 0) {
\n-
939 assert(vMask.AreFaceWeightsForFaceCenters());
\n-
940
\n-
941 ConstIndexArray vFaces = parentLevel.getVertexFaces(vert);
\n-
942
\n-
943 for (int i = 0; i < vFaces.size(); ++i) {
\n-
944
\n-
945 Vtr::Index cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);
\n-
946 assert(Vtr::IndexIsValid(cVertOfFace));
\n-
947
\n-
948 Vtr::Index cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);
\n-
949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);
\n-
950 }
\n-
951 }
\n-
952 if (vMask.GetNumEdgeWeights() > 0) {
\n-
953
\n-
954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);
\n-
955
\n-
956 for (int i = 0; i < vEdges.size(); ++i) {
\n-
957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);
\n-
958 }
\n-
959 }
\n-
960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);
\n-
961 } else {
\n-
962 //
\n-
963 // Each FVar value associated with a vertex will be either a corner or a crease,
\n-
964 // or potentially in transition from corner to crease:
\n-
965 // - if the CHILD is a corner, there can be no transition so we have a corner
\n-
966 // - otherwise if the PARENT is a crease, both will be creases (no transition)
\n-
967 // - otherwise the parent must be a corner and the child a crease (transition)
\n-
968 //
\n-
969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags = parentFVar.getVertexValueTags(vert);
\n-
970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags = childFVar.getVertexValueTags(cVert);
\n-
971
\n-
972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size(); ++cSiblingIndex) {
\n-
973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert, cSiblingIndex);
\n-
974 assert(pSiblingIndex == cSiblingIndex);
\n-
975
\n-
976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;
\n-
977
\n-
978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;
\n-
979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;
\n-
980
\n-
981 Vtr::Index pVertValue = pVertValues[pSibling];
\n-
982 Vtr::Index cVertValue = cVertValues[cSibling];
\n-
983
\n-
984 dst[cVertValue].Clear();
\n-
985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {
\n-
986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);
\n-
987 } else {
\n-
988 //
\n-
989 // We have either a crease or a transition from corner to crease -- in
\n-
990 // either case, we need the end values for the full/fractional crease:
\n-
991 //
\n-
992 Index pEndValues[2];
\n-
993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);
\n-
994
\n-
995 Weight vWeight = 0.75f;
\n-
996 Weight eWeight = 0.125f;
\n-
997
\n-
998 //
\n-
999 // If semi-sharp we need to apply fractional weighting -- if made sharp because
\n-
1000 // of the other sibling (dependent-sharp) use the fractional weight from that
\n-
1001 // other sibling (should only occur when there are 2):
\n-
1002 //
\n-
1003 if (pValueTags[pSibling].isSemiSharp()) {
\n-
1004 Weight wCorner = pValueTags[pSibling].isDepSharp()
\n-
1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)
\n-
1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);
\n-
1007 Weight wCrease = 1.0f - wCorner;
\n-
1008
\n-
1009 vWeight = wCrease * 0.75f + wCorner;
\n-
1010 eWeight = wCrease * 0.125f;
\n-
1011 }
\n-
1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);
\n-
1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);
\n-
1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);
\n-
1015 }
\n-
1016 }
\n-
1017 }
\n-
1018 }
\n-
1019}
\n-
1020
\n-
1021template <typename REAL>
\n-
1022template <Sdc::SchemeType SCHEME, class T, class U, class U1, class U2>
\n-
1023inline void
\n-
1024PrimvarRefinerReal<REAL>::limit(T const & src, U & dstPos, U1 * dstTan1Ptr, U2 * dstTan2Ptr) const {
\n-
1025
\n-
1026 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
1027
\n-
1028 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n-
1029
\n-
1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n-
1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);
\n-
1032 int numMasks = 1 + (hasTangents ? 2 : 0);
\n-
1033
\n-
1034 Vtr::internal::StackBuffer<Index,33> indexBuffer(maxWeightsPerMask);
\n-
1035 Vtr::internal::StackBuffer<Weight,99> weightBuffer(numMasks * maxWeightsPerMask);
\n-
1036
\n-
1037 Weight * vPosWeights = weightBuffer,
\n-
1038 * ePosWeights = vPosWeights + 1,
\n-
1039 * fPosWeights = ePosWeights + level.getMaxValence();
\n-
1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,
\n-
1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,
\n-
1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;
\n-
1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,
\n-
1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,
\n-
1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;
\n-
1046
\n-
1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);
\n-
1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);
\n-
1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);
\n-
1050
\n-
1051 // This is a bit obscure -- assigning both parent and child as last level -- but
\n-
1052 // this mask type was intended for another purpose. Consider one for the limit:
\n-
1053 Vtr::internal::VertexInterface vHood(level, level);
\n-
1054
\n-
1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n-
1056 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n-
1057
\n-
1058 // Incomplete vertices (present in sparse refinement) do not have their full
\n-
1059 // topological neighborhood to determine a proper limit -- just leave the
\n-
1060 // vertex at the refined location and continue to the next:
\n-
1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {
\n-
1062 dstPos[vert].Clear();
\n-
1063 dstPos[vert].AddWithWeight(src[vert], 1.0);
\n-
1064 if (hasTangents) {
\n-
1065 (*dstTan1Ptr)[vert].Clear();
\n-
1066 (*dstTan2Ptr)[vert].Clear();
\n-
1067 }
\n-
1068 continue;
\n-
1069 }
\n-
1070
\n-
1071 //
\n-
1072 // Limit masks require the subdivision Rule for the vertex in order to deal
\n-
1073 // with infinitely sharp features correctly -- including boundaries and corners.
\n-
1074 // The vertex neighborhood is minimally defined with vertex and edge counts.
\n-
1075 //
\n-
1076 Sdc::Crease::Rule vRule = level.getVertexRule(vert);
\n-
1077
\n-
1078 // This is a bit obscure -- child vertex index will be ignored here
\n-
1079 vHood.SetIndex(vert, vert);
\n-
1080
\n-
1081 if (hasTangents) {
\n-
1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);
\n-
1083 } else {
\n-
1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);
\n-
1085 }
\n-
1086
\n-
1087 //
\n-
1088 // Gather the neighboring vertices of this vertex -- the vertices opposite its
\n-
1089 // incident edges, and the opposite vertices of its incident faces:
\n-
1090 //
\n-
1091 Index * eIndices = indexBuffer;
\n-
1092 Index * fIndices = indexBuffer + vEdges.size();
\n-
1093
\n-
1094 for (int i = 0; i < vEdges.size(); ++i) {
\n-
1095 ConstIndexArray eVerts = level.getEdgeVertices(vEdges[i]);
\n-
1096
\n-
1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];
\n-
1098 }
\n-
1099 if (posMask.GetNumFaceWeights() || (hasTangents && tan1Mask.GetNumFaceWeights())) {
\n-
1100 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n-
1101 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n-
1102
\n-
1103 for (int i = 0; i < vFaces.size(); ++i) {
\n-
1104 ConstIndexArray fVerts = level.getFaceVertices(vFaces[i]);
\n-
1105
\n-
1106 LocalIndex vOppInFace = (vInFace[i] + 2);
\n-
1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (LocalIndex)fVerts.size();
\n-
1108
\n-
1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];
\n-
1110 }
\n-
1111 }
\n-
1112
\n-
1113 //
\n-
1114 // Combine the weights and indices for position and tangents. As with applying
\n-
1115 // refinement masks to vertex data, in order to improve numerical precision, it's
\n-
1116 // better to apply smaller weights first, so begin with the face-weights followed
\n-
1117 // by the edge-weights and the vertex weight last.
\n-
1118 //
\n-
1119 dstPos[vert].Clear();
\n-
1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {
\n-
1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);
\n-
1122 }
\n-
1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {
\n-
1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);
\n-
1125 }
\n-
1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);
\n-
1127
\n-
1128 //
\n-
1129 // Apply the tangent masks -- both will have the same number of weights and
\n-
1130 // indices (one tangent may be "padded" to accommodate the other), but these
\n-
1131 // may differ from those of the position:
\n-
1132 //
\n-
1133 if (hasTangents) {
\n-
1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());
\n-
1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());
\n-
1136
\n-
1137 U1 & dstTan1 = *dstTan1Ptr;
\n-
1138 U2 & dstTan2 = *dstTan2Ptr;
\n-
1139
\n-
1140 dstTan1[vert].Clear();
\n-
1141 dstTan2[vert].Clear();
\n-
1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {
\n-
1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);
\n-
1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);
\n-
1145 }
\n-
1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {
\n-
1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);
\n-
1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);
\n-
1149 }
\n-
1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);
\n-
1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);
\n-
1152 }
\n-
1153 }
\n-
1154}
\n-
1155
\n-
1156template <typename REAL>
\n-
1157template <Sdc::SchemeType SCHEME, class T, class U>
\n-
1158inline void
\n-
1159PrimvarRefinerReal<REAL>::limitFVar(T const & src, U & dst, int channel) const {
\n-
1160
\n-
1161 Sdc::Scheme<SCHEME> scheme(_refiner._subdivOptions);
\n-
1162
\n-
1163 Vtr::internal::Level const & level = _refiner.getLevel(_refiner.GetMaxLevel());
\n-
1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel(channel);
\n-
1165
\n-
1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();
\n-
1167
\n-
1168 Vtr::internal::StackBuffer<Weight,33> weightBuffer(maxWeightsPerMask);
\n-
1169 Vtr::internal::StackBuffer<Index,16> vEdgeBuffer(level.getMaxValence());
\n-
1170
\n-
1171 // This is a bit obscure -- assign both parent and child as last level
\n-
1172 Vtr::internal::VertexInterface vHood(level, level);
\n-
1173
\n-
1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {
\n-
1175
\n-
1176 ConstIndexArray vEdges = level.getVertexEdges(vert);
\n-
1177 ConstIndexArray vValues = fvarChannel.getVertexValues(vert);
\n-
1178
\n-
1179 // Incomplete vertices (present in sparse refinement) do not have their full
\n-
1180 // topological neighborhood to determine a proper limit -- just leave the
\n-
1181 // values (perhaps more than one per vertex) at the refined location.
\n-
1182 //
\n-
1183 // The same can be done if the face-varying channel is purely linear.
\n-
1184 //
\n-
1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0));
\n-
1186 if (isIncomplete || fvarChannel.isLinear()) {
\n-
1187 for (int i = 0; i < vValues.size(); ++i) {
\n-
1188 Vtr::Index vValue = vValues[i];
\n-
1189
\n-
1190 dst[vValue].Clear();
\n-
1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n-
1192 }
\n-
1193 continue;
\n-
1194 }
\n-
1195
\n-
1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);
\n-
1197 if (fvarVertMatchesVertex) {
\n-
1198
\n-
1199 // Assign the mask weights to the common buffer and compute the mask:
\n-
1200 //
\n-
1201 Weight * vWeights = weightBuffer,
\n-
1202 * eWeights = vWeights + 1,
\n-
1203 * fWeights = eWeights + vEdges.size();
\n-
1204
\n-
1205 Mask vMask(vWeights, eWeights, fWeights);
\n-
1206
\n-
1207 vHood.SetIndex(vert, vert);
\n-
1208
\n-
1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));
\n-
1210
\n-
1211 //
\n-
1212 // Apply mask to corresponding FVar values for neighboring vertices:
\n-
1213 //
\n-
1214 Vtr::Index vValue = vValues[0];
\n-
1215
\n-
1216 dst[vValue].Clear();
\n-
1217 if (vMask.GetNumFaceWeights() > 0) {
\n-
1218 assert(!vMask.AreFaceWeightsForFaceCenters());
\n-
1219
\n-
1220 ConstIndexArray vFaces = level.getVertexFaces(vert);
\n-
1221 ConstLocalIndexArray vInFace = level.getVertexFaceLocalIndices(vert);
\n-
1222
\n-
1223 for (int i = 0; i < vFaces.size(); ++i) {
\n-
1224 ConstIndexArray faceValues = fvarChannel.getFaceValues(vFaces[i]);
\n-
1225 LocalIndex vOppInFace = vInFace[i] + 2;
\n-
1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues.size();
\n-
1227
\n-
1228 Index vValueOppositeFace = faceValues[vOppInFace];
\n-
1229
\n-
1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);
\n-
1231 }
\n-
1232 }
\n-
1233 if (vMask.GetNumEdgeWeights() > 0) {
\n-
1234 Index * vEdgeValues = vEdgeBuffer;
\n-
1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);
\n-
1236
\n-
1237 for (int i = 0; i < vEdges.size(); ++i) {
\n-
1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);
\n-
1239 }
\n-
1240 }
\n-
1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);
\n-
1242 } else {
\n-
1243 //
\n-
1244 // Sibling FVar values associated with a vertex will be either a corner or a crease:
\n-
1245 //
\n-
1246 for (int i = 0; i < vValues.size(); ++i) {
\n-
1247 Vtr::Index vValue = vValues[i];
\n-
1248
\n-
1249 dst[vValue].Clear();
\n-
1250 if (fvarChannel.getValueTag(vValue).isCorner()) {
\n-
1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);
\n-
1252 } else {
\n-
1253 Index vEndValues[2];
\n-
1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);
\n-
1255
\n-
1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);
\n-
1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);
\n-
1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);
\n-
1259 }
\n-
1260 }
\n-
1261 }
\n-
1262 }
\n-
1263}
\n-
1264
\n-
\n-
1265class PrimvarRefiner : public PrimvarRefinerReal<float> {
\n-
1266public:
\n-
\n-\n-
1268 : PrimvarRefinerReal<float>(refiner) { }
\n-
\n-
1269};
\n-
\n-
1270
\n-
1271} // end namespace Far
\n-
1272
\n-
1273} // end namespace OPENSUBDIV_VERSION
\n-
1274using namespace OPENSUBDIV_VERSION;
\n-
1275} // end namespace OpenSubdiv
\n-
1276
\n-
1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
234
\n+
235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */
\n \n-\n-
void Error(ErrorType err, const char *format,...)
Sends an OSD error with a message (internal use only)
\n
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
Vtr::ConstLocalIndexArray ConstLocalIndexArray
Definition types.h:48
\n-
@ FAR_RUNTIME_ERROR
Issue a generic runtime error, but continue execution.
Definition error.h:40
\n-\n-\n-
bool IndexIsValid(Index index)
Definition types.h:58
\n-\n-\n-\n-
Applies refinement operations to generic primvar data.
\n-
void Limit(T const &src, U &dstPos) const
Apply limit weights to a primvar buffer.
\n-\n-
void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const
\n-
void InterpolateFaceUniform(int level, T const &src, U &dst) const
Refine uniform (per-face) primvar data between levels.
\n-\n-
void InterpolateVarying(int level, T const &src, U &dst) const
Apply only varying interpolation weights to a primvar buffer for a single level of refinement.
\n-
void Interpolate(int level, T const &src, U &dst) const
Apply vertex interpolation weights to a primvar buffer for a single level of refinement.
\n-
void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0) const
Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varyin...
\n-\n-
void LimitFaceVarying(T const &src, U &dst, int channel=0) const
\n-\n-\n-
Stores topology data for a specified set of refinement options.
\n-\n-\n-
Scheme is a class template which provides all implementation for the subdivision schemes supported by...
Definition scheme.h:66
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Factory for constructing a PatchTable from a TopologyRefiner.
\n+\n+
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n+\n+
unsigned int generateVaryingTables
Generate varying patch tables.
\n+
unsigned int generateLegacySharpCornerPatches
Generate sharp regular patches at smooth corners (legacy)
\n+\n+
TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const
Determine adaptive refinement options to match assigned patch options.
\n+
unsigned int maxIsolationLevel
Cap adaptive feature isolation to the given level (max. 10)
\n+\n+
unsigned int generateFVarLegacyLinearPatches
Generate all linear face-varying patches (legacy)
\n+
void SetPatchPrecision()
Set precision of vertex patches.
\n+
unsigned int fvarPatchPrecisionDouble
Generate double-precision stencils for face-varying patches.
\n+
void SetMaxIsolationLevel(unsigned int level)
Set maximum isolation level.
\n+\n+
int const * fvarChannelIndices
List containing the indices of the channels selected for the factory.
\n+\n+\n+\n+
unsigned int generateVaryingLocalPoints
Generate local points with varying patches.
\n+
unsigned int includeFVarBaseLevelIndices
Include base level in face-varying patch point indices (Uniform mode only)
\n+
unsigned int generateAllLevels
Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)
\n+
unsigned int patchPrecisionDouble
Generate double-precision stencils for vertex patches.
\n+
unsigned int generateFVarTables
Generate face-varying patch tables.
\n+
unsigned int includeBaseLevelIndices
Include base level in patch point indices (Uniform mode only)
\n+
void SetFVarPatchPrecision()
Set precision of face-varying patches.
\n+
int numFVarChannels
Number of channel indices and interpolation modes passed.
\n+
unsigned int triangulateQuads
Triangulate 'QUADS' primitives (Uniform mode only)
\n+
EndCapType
Choice for approximating irregular patches (end-caps)
\n+
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n+
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n+\n+
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n+
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n+\n+
Obsolete internal struct not intended for public use \u2013 due to be deprecated.
\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+\n+
Stores topology data for a specified set of refinement options.
\n+\n+\n+\n+\n \n-\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-us-ascii\n+utf-8\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-primvarRefiner.h\n+patchTableFactory.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 DreamWorks Animation LLC.\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -23,1388 +23,410 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n-25#define OPENSUBDIV3_FAR_PRIMVAR_REFINER_H\n-26\n-27#include \"../version.h\"\n-28\n-29#include \"../sdc/types.h\"\n-30#include \"../sdc/options.h\"\n-31#include \"../sdc/bilinearScheme.h\"\n-32#include \"../sdc/catmarkScheme.h\"\n-33#include \"../sdc/loopScheme.h\"\n-34#include \"../vtr/level.h\"\n-35#include \"../vtr/fvarLevel.h\"\n-36#include \"../vtr/refinement.h\"\n-37#include \"../vtr/fvarRefinement.h\"\n-38#include \"../vtr/stackBuffer.h\"\n-39#include \"../vtr/componentInterfaces.h\"\n-40#include \"../far/types.h\"\n-41#include \"../far/error.h\"\n-42#include \"../far/topologyLevel.h\"\n-43#include \"../far/topologyRefiner.h\"\n-44\n-45#include \n+24\n+25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n+26#define OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H\n+27\n+28#include \"../version.h\"\n+29\n+30#include \"../far/topologyRefiner.h\"\n+31#include \"../far/patchTable.h\"\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Far {\n+37\n+_\b4_\b0class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by {\n+41public:\n+42\n+_\b4_\b5 struct _\bO_\bp_\bt_\bi_\bo_\bn_\bs {\n 46\n-47namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-48namespace OPENSUBDIV_VERSION {\n-49\n-50namespace Far {\n-51\n-55template \n-_\b5_\b6class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n-57\n-58public:\n-_\b5_\b9 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner) : _refiner(refiner) { }\n-_\b6_\b0 _\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl() { }\n-61\n-_\b6_\b2 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & _\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br() const { return _refiner; }\n-63\n-65\n-100\n-_\b1_\b1_\b3 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U &\n-dst) const;\n+_\b5_\b5 enum _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be {\n+_\b5_\b6 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE = 0,\n+_\b5_\b7 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS,\n+_\b5_\b8 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS,\n+_\b5_\b9 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n+60 _\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n+_\b6_\b1 };\n+62\n+_\b6_\b3 _\bO_\bp_\bt_\bi_\bo_\bn_\bs(unsigned int maxIsolation=10) :\n+64 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs(false),\n+65 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(true),\n+66 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(false),\n+67 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs(false),\n+68 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh(false),\n+69 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh(false),\n+70 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(maxIsolation & 0xf),\n+71 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS),\n+72 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs(true),\n+73 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs(true),\n+74 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs(true),\n+75 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs(false),\n+76 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n+77 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be(false),\n+78 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n+79 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs(true),\n+80 _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs(-1),\n+81 _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs(0)\n+82 { }\n+83\n+_\b8_\b5 _\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be _\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be() const { return (_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be)_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be; }\n+86\n+_\b8_\b8 void _\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be(_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be e) { _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be = e & 0x7; }\n+89\n+_\b9_\b1 void _\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl(unsigned int level) { _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl = level &\n+0xf; }\n+92\n+_\b9_\b4 template void _\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+95\n+_\b9_\b7 template void _\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn();\n+98\n+_\b1_\b0_\b0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs _\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs() const {\n+101 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs adaptiveOptions(_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl);\n+102\n+103 adaptiveOptions._\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh;\n+104 adaptiveOptions._\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh = _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh;\n+105 adaptiveOptions._\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs = _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs &&\n+106 !_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs;\n+107 return adaptiveOptions;\n+108 }\n+109\n+_\b1_\b1_\b0 unsigned int _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs : 1,\n+_\b1_\b1_\b1 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n+_\b1_\b1_\b2 _\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs : 1,\n+_\b1_\b1_\b3 _\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs : 1,\n 114\n-_\b1_\b3_\b0 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const &\n-src, U & dst) const;\n-131\n-_\b1_\b4_\b8 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const\n-& src, U & dst) const;\n-149\n-_\b1_\b6_\b1 template void _\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const\n-& src, U & dst, int channel = 0) const;\n-162\n-163\n-_\b1_\b7_\b5 template void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos) const;\n-176\n-177 template \n-_\b1_\b7_\b8 void _\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2 & dstTan2) const;\n-179\n-_\b1_\b8_\b0 template void _\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst,\n-int channel = 0) const;\n-181\n-183\n-184private:\n-185 typedef REAL Weight;\n-186\n-187 // Non-copyable:\n-188 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const & src) : _refiner(src._refiner)\n-{ }\n-189 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl & operator=(_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl const &) { return *this;\n-}\n-190\n-191 template void interpFromFaces\n-(int, T const &, U &) const;\n-192 template void interpFromEdges\n-(int, T const &, U &) const;\n-193 template void interpFromVerts\n-(int, T const &, U &) const;\n-194\n-195 template void\n-interpFVarFromFaces(int, T const &, U &, int) const;\n-196 template void\n-interpFVarFromEdges(int, T const &, U &, int) const;\n-197 template void\n-interpFVarFromVerts(int, T const &, U &, int) const;\n-198\n-199 template \n-200 void limit(T const & src, U & pos, U1 * tan1, U2 * tan2) const;\n-201\n-202 template \n-203 void limitFVar(T const & src, U & dst, int channel) const;\n-204\n-205private:\n-206 TopologyRefiner const & _refiner;\n-207\n-208private:\n-209 //\n-210 // Local class to fulfill interface for in the Scheme mask\n-queries:\n-211 //\n-212 class Mask {\n-213 public:\n-214 typedef REAL Weight; // Also part of the expected interface\n-215\n-216 public:\n-217 Mask(Weight* v, Weight* e, Weight* f) :\n-218 _vertWeights(v), _edgeWeights(e), _faceWeights(f),\n-219 _vertCount(0), _edgeCount(0), _faceCount(0),\n-220 _faceWeightsForFaceCenters(false)\n-221 { }\n-222\n-223 ~Mask() { }\n-224\n-225 public: // Generic interface expected of :\n-226 int GetNumVertexWeights() const { return _vertCount; }\n-227 int GetNumEdgeWeights() const { return _edgeCount; }\n-228 int GetNumFaceWeights() const { return _faceCount; }\n-229\n-230 void SetNumVertexWeights(int count) { _vertCount = count; }\n-231 void SetNumEdgeWeights( int count) { _edgeCount = count; }\n-232 void SetNumFaceWeights( int count) { _faceCount = count; }\n+_\b1_\b1_\b5 _\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh : 1,\n+_\b1_\b1_\b6 _\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh : 1,\n+_\b1_\b1_\b7 _\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl : 4,\n+118\n+119 // end-capping\n+_\b1_\b2_\b0 _\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be : 3,\n+_\b1_\b2_\b1 _\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n+123\n+124 // varying\n+_\b1_\b2_\b5 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs : 1,\n+_\b1_\b2_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs : 1,\n+127\n+128 // face-varying\n+_\b1_\b2_\b9 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs : 1,\n+130\n+131 // precision\n+_\b1_\b3_\b2 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n+_\b1_\b3_\b3 _\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be : 1,\n+134\n+135 // legacy behaviors (default to true)\n+_\b1_\b3_\b6 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1,\n+_\b1_\b3_\b7 _\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs : 1;\n+138\n+_\b1_\b3_\b9 int _\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs;\n+_\b1_\b4_\b0 int const * _\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs;\n+141 };\n+142\n+_\b1_\b7_\b5 static _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be * _\bC_\br_\be_\ba_\bt_\be(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner,\n+176 _\bO_\bp_\bt_\bi_\bo_\bn_\bs options = _\bO_\bp_\bt_\bi_\bo_\bn_\bs(),\n+177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by selectedFaces = _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by());\n+178\n+179public:\n+180 // PatchFaceTag\n+181 //\n+182 // This simple struct was previously used within the factory to take\n+inventory of\n+183 // various kinds of patches to fully allocate buffers prior to populating\n+them. It\n+184 // was not intended to be exposed as part of the public interface.\n+185 //\n+186 // It is no longer used internally and is being kept here to respect\n+preservation\n+187 // of the public interface, but it will be deprecated at the earliest\n+opportunity.\n+188 //\n+191 //\n+_\b1_\b9_\b2 struct _\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg {\n+193 public:\n+_\b1_\b9_\b4 unsigned int _\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh : 1;\n+_\b1_\b9_\b5 unsigned int _\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br : 1;\n+_\b1_\b9_\b6 unsigned int _\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk : 4;\n+_\b1_\b9_\b7 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk : 4;\n+_\b1_\b9_\b8 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx : 2;\n+_\b1_\b9_\b9 unsigned int _\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt : 3;\n+_\b2_\b0_\b0 unsigned int _\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be : 3;\n+_\b2_\b0_\b1 unsigned int _\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be : 1;\n+202\n+_\b2_\b0_\b3 void _\bc_\bl_\be_\ba_\br();\n+_\b2_\b0_\b4 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryEdgeMask);\n+_\b2_\b0_\b5 void _\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n+_\b2_\b0_\b6 void _\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk(int boundaryVertexMask);\n+207 };\n+_\b2_\b0_\b8 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br;\n+209};\n+210\n+211\n+_\b2_\b1_\b2template <> inline void PatchTableFactory::Options::SetPatchPrecision\n+() {\n+213 _\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be = false;\n+214}\n+_\b2_\b1_\b5template <> inline void PatchTableFactory::Options::\n+SetFVarPatchPrecision() {\n+216 fvarPatchPrecisionDouble = false;\n+217}\n+218\n+219template <> inline void PatchTableFactory::Options::\n+SetPatchPrecision() {\n+220 patchPrecisionDouble = true;\n+221}\n+222template <> inline void PatchTableFactory::Options::\n+SetFVarPatchPrecision() {\n+223 fvarPatchPrecisionDouble = true;\n+224}\n+225\n+226\n+227} // end namespace Far\n+228\n+229} // end namespace OPENSUBDIV_VERSION\n+230using namespace OPENSUBDIV_VERSION;\n+231\n+232} // end namespace OpenSubdiv\n 233\n-234 Weight const& VertexWeight(int index) const { return _vertWeights[index]; }\n-235 Weight const& EdgeWeight( int index) const { return _edgeWeights[index]; }\n-236 Weight const& FaceWeight( int index) const { return _faceWeights[index]; }\n-237\n-238 Weight& VertexWeight(int index) { return _vertWeights[index]; }\n-239 Weight& EdgeWeight( int index) { return _edgeWeights[index]; }\n-240 Weight& FaceWeight( int index) { return _faceWeights[index]; }\n-241\n-242 bool AreFaceWeightsForFaceCenters() const { return\n-_faceWeightsForFaceCenters; }\n-243 void SetFaceWeightsForFaceCenters(bool on) { _faceWeightsForFaceCenters =\n-on; }\n-244\n-245 private:\n-246 Weight* _vertWeights;\n-247 Weight* _edgeWeights;\n-248 Weight* _faceWeights;\n-249\n-250 int _vertCount;\n-251 int _edgeCount;\n-252 int _faceCount;\n-253\n-254 bool _faceWeightsForFaceCenters;\n-255 };\n-256};\n-257\n-258\n-259//\n-260// Public entry points to the methods. Queries of the scheme type and its\n-261// use as a template parameter in subsequent implementation will be factored\n-262// out of a later release:\n-263//\n-264template \n-265template \n-266inline void\n-_\b2_\b6_\b7_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be(int level, T const & src, U & dst)\n-const {\n-268\n-269 assert(level>0 && level<=(int)_refiner._refinements.size());\n-270\n-271 switch (_refiner._subdivType) {\n-272 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-273 interpFromFaces(level, src, dst);\n-274 interpFromEdges(level, src, dst);\n-275 interpFromVerts(level, src, dst);\n-276 break;\n-277 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-278 interpFromFaces(level, src, dst);\n-279 interpFromEdges(level, src, dst);\n-280 interpFromVerts(level, src, dst);\n-281 break;\n-282 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-283 interpFromFaces(level, src, dst);\n-284 interpFromEdges(level, src, dst);\n-285 interpFromVerts(level, src, dst);\n-286 break;\n-287 }\n-288}\n-289\n-290template \n-291template \n-292inline void\n-_\b2_\b9_\b3_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U\n-& dst, int channel) const {\n-294\n-295 assert(level>0 && level<=(int)_refiner._refinements.size());\n-296\n-297 switch (_refiner._subdivType) {\n-298 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-299 interpFVarFromFaces(level, src, dst, channel);\n-300 interpFVarFromEdges(level, src, dst, channel);\n-301 interpFVarFromVerts(level, src, dst, channel);\n-302 break;\n-303 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-304 interpFVarFromFaces(level, src, dst, channel);\n-305 interpFVarFromEdges(level, src, dst, channel);\n-306 interpFVarFromVerts(level, src, dst, channel);\n-307 break;\n-308 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-309 interpFVarFromFaces(level, src, dst, channel);\n-310 interpFVarFromEdges(level, src, dst, channel);\n-311 interpFVarFromVerts(level, src, dst, channel);\n-312 break;\n-313 }\n-314}\n-315\n-316template \n-317template \n-318inline void\n-_\b3_\b1_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dst) const {\n-320\n-321 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-322 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-323 \"Failure in PrimvarRefiner::Limit() -- \"\n-324 \"last level of refinement does not include full topology.\");\n-325 return;\n-326 }\n-327\n-328 switch (_refiner._subdivType) {\n-329 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-330 limit(src, dst, (U*)0, (U*)0);\n-331 break;\n-332 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-333 limit(src, dst, (U*)0, (U*)0);\n-334 break;\n-335 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-336 limit(src, dst, (U*)0, (U*)0);\n-337 break;\n-338 }\n-339}\n-340\n-341template \n-342template \n-343inline void\n-_\b3_\b4_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt(T const & src, U & dstPos, U1 & dstTan1, U2\n-& dstTan2) const {\n-345\n-346 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-347 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-348 \"Failure in PrimvarRefiner::Limit() -- \"\n-349 \"last level of refinement does not include full topology.\");\n-350 return;\n-351 }\n-352\n-353 switch (_refiner._subdivType) {\n-354 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-355 limit(src, dstPos, &dstTan1, &dstTan2);\n-356 break;\n-357 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-358 limit(src, dstPos, &dstTan1, &dstTan2);\n-359 break;\n-360 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-361 limit(src, dstPos, &dstTan1, &dstTan2);\n-362 break;\n-363 }\n-364}\n-365\n-366template \n-367template \n-368inline void\n-_\b3_\b6_\b9_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const & src, U & dst, int\n-channel) const {\n-370\n-371 if (_refiner.getLevel(_refiner.GetMaxLevel()).getNumVertexEdgesTotal() ==\n-0) {\n-372 _\bE_\br_\br_\bo_\br(_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR,\n-373 \"Failure in PrimvarRefiner::LimitFaceVarying() -- \"\n-374 \"last level of refinement does not include full topology.\");\n-375 return;\n-376 }\n-377\n-378 switch (_refiner._subdivType) {\n-379 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK:\n-380 limitFVar(src, dst, channel);\n-381 break;\n-382 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP:\n-383 limitFVar(src, dst, channel);\n-384 break;\n-385 case _\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR:\n-386 limitFVar(src, dst, channel);\n-387 break;\n-388 }\n-389}\n-390\n-391template \n-392template \n-393inline void\n-_\b3_\b9_\b4_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm(int level, T const & src, U\n-& dst) const {\n-395\n-396 assert(level>0 && level<=(int)_refiner._refinements.size());\n-397\n-398 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-399 Vtr::internal::Level const & child = refinement.child();\n-400\n-401 for (int cFace = 0; cFace < child.getNumFaces(); ++cFace) {\n-402\n-403 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = refinement.getChildFaceParentFace(cFace);\n-404\n-405 dst[cFace] = src[pFace];\n-406 }\n-407}\n-408\n-409template \n-410template \n-411inline void\n-_\b4_\b1_\b2_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int level, T const & src, U &\n-dst) const {\n-413\n-414 assert(level>0 && level<=(int)_refiner._refinements.size());\n-415\n-416 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-417 Vtr::internal::Level const & parent = refinement.parent();\n-418\n-419 //\n-420 // Group values to interpolate based on origin -- note that there may\n-421 // be none originating from faces:\n-422 //\n-423 if (refinement.getNumChildVerticesFromFaces() > 0) {\n-424\n-425 for (int face = 0; face < parent.getNumFaces(); ++face) {\n-426\n-427 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-428 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-429\n-430 // Apply the weights to the parent face's vertices:\n-431 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n-432\n-433 Weight fVaryingWeight = 1.0f / (Weight) fVerts._\bs_\bi_\bz_\be();\n-434\n-435 dst[cVert].Clear();\n-436 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n-437 dst[cVert].AddWithWeight(src[fVerts[i]], fVaryingWeight);\n-438 }\n-439 }\n-440 }\n-441 }\n-442 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n-443\n-444 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-445 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-446\n-447 // Apply the weights to the parent edges's vertices\n-448 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge);\n-449\n-450 dst[cVert].Clear();\n-451 dst[cVert].AddWithWeight(src[eVerts[0]], 0.5f);\n-452 dst[cVert].AddWithWeight(src[eVerts[1]], 0.5f);\n-453 }\n-454 }\n-455 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n-456\n-457 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-458 if (_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert)) {\n-459\n-460 // Essentially copy the parent vertex:\n-461 dst[cVert].Clear();\n-462 dst[cVert].AddWithWeight(src[vert], 1.0f);\n-463 }\n-464 }\n-465}\n-466\n-467\n-468//\n-469// Internal implementation methods -- grouping vertices to be interpolated\n-470// based on the type of parent component from which they originated:\n-471//\n-472template \n-473template \n-474inline void\n-475_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b>_\b:_\b:_\bi_\bn_\bt_\be_\br_\bp_\bF_\br_\bo_\bm_\bF_\ba_\bc_\be_\bs(int level, T const & src, U & dst)\n-const {\n-476\n-477 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-478 Vtr::internal::Level const & parent = refinement.parent();\n-479\n-480 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n-481\n-482 _\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b> scheme(_refiner._subdivOptions);\n-483\n-484 Vtr::internal::StackBuffer fVertWeights(parent.getMaxValence());\n-485\n-486 for (int face = 0; face < parent.getNumFaces(); ++face) {\n-487\n-488 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-489 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-490 continue;\n-491\n-492 // Declare and compute mask weights for this vertex relative to its parent\n-face:\n-493 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = parent.getFaceVertices(face);\n-494\n-495 Mask fMask(fVertWeights, 0, 0);\n-496 Vtr::internal::FaceInterface fHood(fVerts._\bs_\bi_\bz_\be());\n-497\n-498 scheme.ComputeFaceVertexMask(fHood, fMask);\n-499\n-500 // Apply the weights to the parent face's vertices:\n-501 dst[cVert].Clear();\n-502\n-503 for (int i = 0; i < fVerts._\bs_\bi_\bz_\be(); ++i) {\n-504\n-505 dst[cVert].AddWithWeight(src[fVerts[i]], fVertWeights[i]);\n-506 }\n-507 }\n-508}\n-509\n-510template \n-511template \n-512inline void\n-513PrimvarRefinerReal::interpFromEdges(int level, T const & src, U & dst)\n-const {\n-514\n-515 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-516 Vtr::internal::Level const & parent = refinement.parent();\n-517 Vtr::internal::Level const & child = refinement.child();\n-518\n-519 Sdc::Scheme scheme(_refiner._subdivOptions);\n-520\n-521 Vtr::internal::EdgeInterface eHood(parent);\n-522\n-523 Weight eVertWeights[2];\n-524 Vtr::internal::StackBuffer eFaceWeights(parent.getMaxEdgeFaces\n-());\n-525\n-526 for (int edge = 0; edge < parent.getNumEdges(); ++edge) {\n-527\n-528 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-529 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-530 continue;\n-531\n-532 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-533 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(edge),\n-534 eFaces = parent.getEdgeFaces(edge);\n-535\n-536 Mask eMask(eVertWeights, 0, eFaceWeights);\n-537\n-538 eHood.SetIndex(edge);\n-539\n-540 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parent.getEdgeSharpness(edge) > 0.0f) ? _\bS_\bd_\bc_\b:_\b:\n-_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n-541 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n-542\n-543 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n-544\n-545 // Apply the weights to the parent edges's vertices and (if applicable) to\n-546 // the child vertices of its incident faces:\n-547 dst[cVert].Clear();\n-548 dst[cVert].AddWithWeight(src[eVerts[0]], eVertWeights[0]);\n-549 dst[cVert].AddWithWeight(src[eVerts[1]], eVertWeights[1]);\n-550\n-551 if (eMask.GetNumFaceWeights() > 0) {\n-552\n-553 for (int i = 0; i < eFaces.size(); ++i) {\n-554\n-555 if (eMask.AreFaceWeightsForFaceCenters()) {\n-556 assert(refinement.getNumChildVerticesFromFaces() > 0);\n-557 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n-558\n-559 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-560 dst[cVert].AddWithWeight(dst[cVertOfFace], eFaceWeights[i]);\n-561 } else {\n-562 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n-563 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parent.getFaceEdges(pFace),\n-564 pFaceVerts = parent.getFaceVertices(pFace);\n-565\n-566 int eInFace = 0;\n-567 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n-568\n-569 int vInFace = eInFace + 2;\n-570 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n-571\n-572 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertNext = pFaceVerts[vInFace];\n-573 dst[cVert].AddWithWeight(src[pVertNext], eFaceWeights[i]);\n-574 }\n-575 }\n-576 }\n-577 }\n-578}\n-579\n-580template \n-581template \n-582inline void\n-583PrimvarRefinerReal::interpFromVerts(int level, T const & src, U & dst)\n-const {\n-584\n-585 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-586 Vtr::internal::Level const & parent = refinement.parent();\n-587 Vtr::internal::Level const & child = refinement.child();\n-588\n-589 Sdc::Scheme scheme(_refiner._subdivOptions);\n-590\n-591 Vtr::internal::VertexInterface vHood(parent, child);\n-592\n-593 Vtr::internal::StackBuffer weightBuffer(2*parent.getMaxValence\n-());\n-594\n-595 for (int vert = 0; vert < parent.getNumVertices(); ++vert) {\n-596\n-597 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-598 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-599 continue;\n-600\n-601 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-602 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parent.getVertexEdges(vert),\n-603 vFaces = parent.getVertexFaces(vert);\n-604\n-605 Weight vVertWeight,\n-606 * vEdgeWeights = weightBuffer,\n-607 * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n-608\n-609 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n-610\n-611 vHood.SetIndex(vert, cVert);\n-612\n-613 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parent.getVertexRule(vert);\n-614 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = child.getVertexRule(cVert);\n-615\n-616 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n-617\n-618 // Apply the weights to the parent vertex, the vertices opposite its\n-incident\n-619 // edges, and the child vertices of its incident faces:\n-620 //\n-621 // In order to improve numerical precision, it's better to apply smaller\n-weights\n-622 // first, so begin with the face-weights followed by the edge-weights and\n-the\n-623 // vertex weight last.\n-624 dst[cVert].Clear();\n-625\n-626 if (vMask.GetNumFaceWeights() > 0) {\n-627 assert(vMask.AreFaceWeightsForFaceCenters());\n-628\n-629 for (int i = 0; i < vFaces.size(); ++i) {\n-630\n-631 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n-632 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-633 dst[cVert].AddWithWeight(dst[cVertOfFace], vFaceWeights[i]);\n-634 }\n-635 }\n-636 if (vMask.GetNumEdgeWeights() > 0) {\n-637\n-638 for (int i = 0; i < vEdges.size(); ++i) {\n-639\n-640 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = parent.getEdgeVertices(vEdges[i]);\n-641 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertOppositeEdge = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n-642\n-643 dst[cVert].AddWithWeight(src[pVertOppositeEdge], vEdgeWeights[i]);\n-644 }\n-645 }\n-646 dst[cVert].AddWithWeight(src[vert], vVertWeight);\n-647 }\n-648}\n-649\n-650\n-651//\n-652// Internal face-varying implementation details:\n-653//\n-654template \n-655template \n-656inline void\n-657PrimvarRefinerReal::interpFVarFromFaces(int level, T const & src, U &\n-dst, int channel) const {\n-658\n-659 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-660\n-661 if (refinement.getNumChildVerticesFromFaces() == 0) return;\n-662\n-663 Sdc::Scheme scheme(_refiner._subdivOptions);\n-664\n-665 Vtr::internal::Level const & parentLevel = refinement.parent();\n-666 Vtr::internal::Level const & childLevel = refinement.child();\n-667\n-668 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-669 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-670\n-671 Vtr::internal::StackBuffer fValueWeights\n-(parentLevel.getMaxValence());\n-672\n-673 for (int face = 0; face < parentLevel.getNumFaces(); ++face) {\n-674\n-675 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getFaceChildVertex(face);\n-676 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-677 continue;\n-678\n-679 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = childFVar.getVertexValueOffset(cVert);\n-680\n-681 // The only difference for face-varying here is that we get the values\n-associated\n-682 // with each face-vertex directly from the FVarLevel, rather than using the\n-parent\n-683 // face-vertices directly. If any face-vertex has any sibling values, then\n-we may\n-684 // get the wrong one using the face-vertex index directly.\n-685\n-686 // Declare and compute mask weights for this vertex relative to its parent\n-face:\n-687 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fValues = parentFVar.getFaceValues(face);\n-688\n-689 Mask fMask(fValueWeights, 0, 0);\n-690 Vtr::internal::FaceInterface fHood(fValues.size());\n-691\n-692 scheme.ComputeFaceVertexMask(fHood, fMask);\n-693\n-694 // Apply the weights to the parent face's vertices:\n-695 dst[cVertValue].Clear();\n-696\n-697 for (int i = 0; i < fValues.size(); ++i) {\n-698 dst[cVertValue].AddWithWeight(src[fValues[i]], fValueWeights[i]);\n-699 }\n-700 }\n-701}\n-702\n-703template \n-704template \n-705inline void\n-706PrimvarRefinerReal::interpFVarFromEdges(int level, T const & src, U &\n-dst, int channel) const {\n-707\n-708 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-709\n-710 Sdc::Scheme scheme(_refiner._subdivOptions);\n-711\n-712 Vtr::internal::Level const & parentLevel = refinement.parent();\n-713 Vtr::internal::Level const & childLevel = refinement.child();\n-714\n-715 Vtr::internal::FVarRefinement const & refineFVar =\n-refinement.getFVarRefinement(channel);\n-716 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-717 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-718\n-719 //\n-720 // Allocate and initialize (if linearly interpolated) interpolation weights\n-for\n-721 // the edge mask:\n-722 //\n-723 Weight eVertWeights[2];\n-724 Vtr::internal::StackBuffer eFaceWeights\n-(parentLevel.getMaxEdgeFaces());\n-725\n-726 Mask eMask(eVertWeights, 0, eFaceWeights);\n-727\n-728 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n-_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n-729 if (isLinearFVar) {\n-730 eMask.SetNumVertexWeights(2);\n-731 eMask.SetNumEdgeWeights(0);\n-732 eMask.SetNumFaceWeights(0);\n-733\n-734 eVertWeights[0] = 0.5f;\n-735 eVertWeights[1] = 0.5f;\n-736 }\n-737\n-738 Vtr::internal::EdgeInterface eHood(parentLevel);\n-739\n-740 for (int edge = 0; edge < parentLevel.getNumEdges(); ++edge) {\n-741\n-742 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getEdgeChildVertex(edge);\n-743 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-744 continue;\n-745\n-746 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by cVertValues = childFVar.getVertexValues(cVert);\n-747\n-748 bool fvarEdgeVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n-[0]);\n-749 if (fvarEdgeVertMatchesVertex) {\n-750 //\n-751 // If smoothly interpolated, compute new weights for the edge mask:\n-752 //\n-753 if (!isLinearFVar) {\n-754 eHood.SetIndex(edge);\n-755\n-756 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = (parentLevel.getEdgeSharpness(edge) > 0.0f)\n-757 ? _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE : Sdc::Crease::RULE_SMOOTH;\n-758 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n-759\n-760 scheme.ComputeEdgeVertexMask(eHood, eMask, pRule, cRule);\n-761 }\n-762\n-763 // Apply the weights to the parent edge's vertices and (if applicable) to\n-764 // the child vertices of its incident faces:\n-765 //\n-766 // Even though the face-varying topology matches the vertex topology, we\n-need\n-767 // to be careful here when getting values corresponding to the two end-\n-vertices.\n-768 // While the edge may be continuous, the vertices at their ends may have\n-769 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n-side\"\n-770 // of the end-vertex) and so have sibling values associated with them. In\n-most\n-771 // cases the topology for an end-vertex will match and we can use it\n-directly,\n-772 // but we must still check and retrieve as needed.\n-773 //\n-774 // Indices for values corresponding to face-vertices are guaranteed to\n-match,\n-775 // so we can use the child-vertex indices directly.\n-776 //\n-777 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n-reference\n-778 // values in the \"src\" to account for the possible indirection that may\n-exist at\n-779 // level 0 -- where there may be fewer values than vertices and an\n-additional\n-780 // indirection is necessary. We can use a vertex index directly for \"dst\"\n-when\n-781 // it matches.\n-782 //\n-783 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n-784\n-785 parentFVar.getEdgeFaceValues(edge, 0, eVertValues);\n-786\n-787 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n-788\n-789 dst[cVertValue].Clear();\n-790 dst[cVertValue].AddWithWeight(src[eVertValues[0]], eVertWeights[0]);\n-791 dst[cVertValue].AddWithWeight(src[eVertValues[1]], eVertWeights[1]);\n-792\n-793 if (eMask.GetNumFaceWeights() > 0) {\n-794\n-795 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eFaces = parentLevel.getEdgeFaces(edge);\n-796\n-797 for (int i = 0; i < eFaces.size(); ++i) {\n-798 if (eMask.AreFaceWeightsForFaceCenters()) {\n-799\n-800 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(eFaces[i]);\n-801 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-802\n-803 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n-804 dst[cVertValue].AddWithWeight(dst[cValueOfFace], eFaceWeights[i]);\n-805 } else {\n-806 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pFace = eFaces[i];\n-807 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pFaceEdges = parentLevel.getFaceEdges(pFace),\n-808 pFaceVerts = parentLevel.getFaceVertices(pFace);\n-809\n-810 int eInFace = 0;\n-811 for ( ; pFaceEdges[eInFace] != edge; ++eInFace ) ;\n-812\n-813 // Edge \"i\" spans vertices [i,i+1] so we want i+2...\n-814 int vInFace = eInFace + 2;\n-815 if (vInFace >= pFaceVerts.size()) vInFace -= pFaceVerts._\bs_\bi_\bz_\be();\n-816\n-817 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pValueNext = parentFVar.getFaceValues(pFace)[vInFace];\n-818 dst[cVertValue].AddWithWeight(src[pValueNext], eFaceWeights[i]);\n-819 }\n-820 }\n-821 }\n-822 } else {\n-823 //\n-824 // Mismatched edge-verts should just be linearly interpolated between the\n-pairs of\n-825 // values for each sibling of the child edge-vertex -- the question is:\n-which face\n-826 // holds that pair of values for a given sibling?\n-827 //\n-828 // In the manifold case, the sibling and edge-face indices will correspond.\n-We\n-829 // will eventually need to update this to account for > 3 incident faces.\n-830 //\n-831 for (int i = 0; i < cVertValues.size(); ++i) {\n-832 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx eVertValues[2];\n-833 int eFaceIndex = refineFVar.getChildValueParentSource(cVert, i);\n-834 assert(eFaceIndex == i);\n-835\n-836 parentFVar.getEdgeFaceValues(edge, eFaceIndex, eVertValues);\n-837\n-838 _\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[i];\n-839\n-840 dst[cVertValue].Clear();\n-841 dst[cVertValue].AddWithWeight(src[eVertValues[0]], 0.5);\n-842 dst[cVertValue].AddWithWeight(src[eVertValues[1]], 0.5);\n-843 }\n-844 }\n-845 }\n-846}\n-847\n-848template \n-849template \n-850inline void\n-851PrimvarRefinerReal::interpFVarFromVerts(int level, T const & src, U &\n-dst, int channel) const {\n-852\n-853 Vtr::internal::Refinement const & refinement = _refiner.getRefinement\n-(level-1);\n-854\n-855 Sdc::Scheme scheme(_refiner._subdivOptions);\n-856\n-857 Vtr::internal::Level const & parentLevel = refinement.parent();\n-858 Vtr::internal::Level const & childLevel = refinement.child();\n-859\n-860 Vtr::internal::FVarRefinement const & refineFVar =\n-refinement.getFVarRefinement(channel);\n-861 Vtr::internal::FVarLevel const & parentFVar = parentLevel.getFVarLevel\n-(channel);\n-862 Vtr::internal::FVarLevel const & childFVar = childLevel.getFVarLevel\n-(channel);\n-863\n-864 bool isLinearFVar = parentFVar.isLinear() || (_refiner._subdivType == _\bS_\bd_\bc_\b:_\b:\n-_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR);\n-865\n-866 Vtr::internal::StackBuffer weightBuffer\n-(2*parentLevel.getMaxValence());\n-867\n-868 Vtr::internal::StackBuffer vEdgeValues\n-(parentLevel.getMaxValence());\n-869\n-870 Vtr::internal::VertexInterface vHood(parentLevel, childLevel);\n-871\n-872 for (int vert = 0; vert < parentLevel.getNumVertices(); ++vert) {\n-873\n-874 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVert = refinement.getVertexChildVertex(vert);\n-875 if (!_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVert))\n-876 continue;\n-877\n-878 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by pVertValues = parentFVar.getVertexValues(vert),\n-879 cVertValues = childFVar.getVertexValues(cVert);\n-880\n-881 bool fvarVertVertMatchesVertex = childFVar.valueTopologyMatches(cVertValues\n-[0]);\n-882 if (isLinearFVar && fvarVertVertMatchesVertex) {\n-883 dst[cVertValues[0]].Clear();\n-884 dst[cVertValues[0]].AddWithWeight(src[pVertValues[0]], 1.0f);\n-885 continue;\n-886 }\n-887\n-888 if (fvarVertVertMatchesVertex) {\n-889 //\n-890 // Declare and compute mask weights for this vertex relative to its parent\n-edge:\n-891 //\n-892 // (We really need to encapsulate this somewhere else for use here and in\n-the\n-893 // general case)\n-894 //\n-895 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = parentLevel.getVertexEdges(vert);\n-896\n-897 Weight vVertWeight;\n-898 Weight * vEdgeWeights = weightBuffer;\n-899 Weight * vFaceWeights = vEdgeWeights + vEdges._\bs_\bi_\bz_\be();\n-900\n-901 Mask vMask(&vVertWeight, vEdgeWeights, vFaceWeights);\n-902\n-903 vHood.SetIndex(vert, cVert);\n-904\n-905 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be pRule = parentLevel.getVertexRule(vert);\n-906 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be cRule = childLevel.getVertexRule(cVert);\n-907\n-908 scheme.ComputeVertexVertexMask(vHood, vMask, pRule, cRule);\n-909\n-910 // Apply the weights to the parent vertex, the vertices opposite its\n-incident\n-911 // edges, and the child vertices of its incident faces:\n-912 //\n-913 // Even though the face-varying topology matches the vertex topology, we\n-need\n-914 // to be careful here when getting values corresponding to vertices at the\n-915 // ends of edges. While the edge may be continuous, the end vertex may have\n-916 // discontinuities elsewhere in their neighborhood (i.e. on the \"other\n-side\"\n-917 // of the end-vertex) and so have sibling values associated with them. In\n-most\n-918 // cases the topology for an end-vertex will match and we can use it\n-directly,\n-919 // but we must still check and retrieve as needed.\n-920 //\n-921 // Indices for values corresponding to face-vertices are guaranteed to\n-match,\n-922 // so we can use the child-vertex indices directly.\n-923 //\n-924 // And by \"directly\", we always use getVertexValue(vertexIndex) to\n-reference\n-925 // values in the \"src\" to account for the possible indirection that may\n-exist at\n-926 // level 0 -- where there may be fewer values than vertices and an\n-additional\n-927 // indirection is necessary. We can use a vertex index directly for \"dst\"\n-when\n-928 // it matches.\n-929 //\n-930 // As with applying the mask to vertex data, in order to improve numerical\n-931 // precision, it's better to apply smaller weights first, so begin with the\n-932 // face-weights followed by the edge-weights and the vertex weight last.\n-933 //\n-934 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[0];\n-935 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[0];\n-936\n-937 dst[cVertValue].Clear();\n-938 if (vMask.GetNumFaceWeights() > 0) {\n-939 assert(vMask.AreFaceWeightsForFaceCenters());\n-940\n-941 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = parentLevel.getVertexFaces(vert);\n-942\n-943 for (int i = 0; i < vFaces.size(); ++i) {\n-944\n-945 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertOfFace = refinement.getFaceChildVertex(vFaces[i]);\n-946 assert(_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd(cVertOfFace));\n-947\n-948 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cValueOfFace = childFVar.getVertexValueOffset(cVertOfFace);\n-949 dst[cVertValue].AddWithWeight(dst[cValueOfFace], vFaceWeights[i]);\n-950 }\n-951 }\n-952 if (vMask.GetNumEdgeWeights() > 0) {\n-953\n-954 parentFVar.getVertexEdgeValues(vert, vEdgeValues);\n-955\n-956 for (int i = 0; i < vEdges.size(); ++i) {\n-957 dst[cVertValue].AddWithWeight(src[vEdgeValues[i]], vEdgeWeights[i]);\n-958 }\n-959 }\n-960 dst[cVertValue].AddWithWeight(src[pVertValue], vVertWeight);\n-961 } else {\n-962 //\n-963 // Each FVar value associated with a vertex will be either a corner or a\n-crease,\n-964 // or potentially in transition from corner to crease:\n-965 // - if the CHILD is a corner, there can be no transition so we have a\n-corner\n-966 // - otherwise if the PARENT is a crease, both will be creases (no\n-transition)\n-967 // - otherwise the parent must be a corner and the child a crease\n-(transition)\n-968 //\n-969 Vtr::internal::FVarLevel::ConstValueTagArray pValueTags =\n-parentFVar.getVertexValueTags(vert);\n-970 Vtr::internal::FVarLevel::ConstValueTagArray cValueTags =\n-childFVar.getVertexValueTags(cVert);\n-971\n-972 for (int cSiblingIndex = 0; cSiblingIndex < cVertValues.size();\n-++cSiblingIndex) {\n-973 int pSiblingIndex = refineFVar.getChildValueParentSource(cVert,\n-cSiblingIndex);\n-974 assert(pSiblingIndex == cSiblingIndex);\n-975\n-976 typedef Vtr::internal::FVarLevel::Sibling SiblingIntType;\n-977\n-978 SiblingIntType cSibling = (SiblingIntType) cSiblingIndex;\n-979 SiblingIntType pSibling = (SiblingIntType) pSiblingIndex;\n-980\n-981 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx pVertValue = pVertValues[pSibling];\n-982 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx cVertValue = cVertValues[cSibling];\n-983\n-984 dst[cVertValue].Clear();\n-985 if (isLinearFVar || cValueTags[cSibling].isCorner()) {\n-986 dst[cVertValue].AddWithWeight(src[pVertValue], 1.0f);\n-987 } else {\n-988 //\n-989 // We have either a crease or a transition from corner to crease -- in\n-990 // either case, we need the end values for the full/fractional crease:\n-991 //\n-992 _\bI_\bn_\bd_\be_\bx pEndValues[2];\n-993 parentFVar.getVertexCreaseEndValues(vert, pSibling, pEndValues);\n-994\n-995 Weight vWeight = 0.75f;\n-996 Weight eWeight = 0.125f;\n-997\n-998 //\n-999 // If semi-sharp we need to apply fractional weighting -- if made sharp\n-because\n-1000 // of the other sibling (dependent-sharp) use the fractional weight from\n-that\n-1001 // other sibling (should only occur when there are 2):\n-1002 //\n-1003 if (pValueTags[pSibling].isSemiSharp()) {\n-1004 Weight wCorner = pValueTags[pSibling].isDepSharp()\n-1005 ? refineFVar.getFractionalWeight(vert, !pSibling, cVert, !cSibling)\n-1006 : refineFVar.getFractionalWeight(vert, pSibling, cVert, cSibling);\n-1007 Weight wCrease = 1.0f - wCorner;\n-1008\n-1009 vWeight = wCrease * 0.75f + wCorner;\n-1010 eWeight = wCrease * 0.125f;\n-1011 }\n-1012 dst[cVertValue].AddWithWeight(src[pEndValues[0]], eWeight);\n-1013 dst[cVertValue].AddWithWeight(src[pEndValues[1]], eWeight);\n-1014 dst[cVertValue].AddWithWeight(src[pVertValue], vWeight);\n-1015 }\n-1016 }\n-1017 }\n-1018 }\n-1019}\n-1020\n-1021template \n-1022template \n-1023inline void\n-1024PrimvarRefinerReal::limit(T const & src, U & dstPos, U1 * dstTan1Ptr,\n-U2 * dstTan2Ptr) const {\n-1025\n-1026 Sdc::Scheme scheme(_refiner._subdivOptions);\n-1027\n-1028 Vtr::internal::Level const & level = _refiner.getLevel\n-(_refiner.GetMaxLevel());\n-1029\n-1030 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n-1031 bool hasTangents = (dstTan1Ptr && dstTan2Ptr);\n-1032 int numMasks = 1 + (hasTangents ? 2 : 0);\n-1033\n-1034 Vtr::internal::StackBuffer indexBuffer(maxWeightsPerMask);\n-1035 Vtr::internal::StackBuffer weightBuffer(numMasks *\n-maxWeightsPerMask);\n-1036\n-1037 Weight * vPosWeights = weightBuffer,\n-1038 * ePosWeights = vPosWeights + 1,\n-1039 * fPosWeights = ePosWeights + level.getMaxValence();\n-1040 Weight * vTan1Weights = vPosWeights + maxWeightsPerMask,\n-1041 * eTan1Weights = ePosWeights + maxWeightsPerMask,\n-1042 * fTan1Weights = fPosWeights + maxWeightsPerMask;\n-1043 Weight * vTan2Weights = vTan1Weights + maxWeightsPerMask,\n-1044 * eTan2Weights = eTan1Weights + maxWeightsPerMask,\n-1045 * fTan2Weights = fTan1Weights + maxWeightsPerMask;\n-1046\n-1047 Mask posMask( vPosWeights, ePosWeights, fPosWeights);\n-1048 Mask tan1Mask(vTan1Weights, eTan1Weights, fTan1Weights);\n-1049 Mask tan2Mask(vTan2Weights, eTan2Weights, fTan2Weights);\n-1050\n-1051 // This is a bit obscure -- assigning both parent and child as last level\n--- but\n-1052 // this mask type was intended for another purpose. Consider one for the\n-limit:\n-1053 Vtr::internal::VertexInterface vHood(level, level);\n-1054\n-1055 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n-1056 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n-1057\n-1058 // Incomplete vertices (present in sparse refinement) do not have their\n-full\n-1059 // topological neighborhood to determine a proper limit -- just leave the\n-1060 // vertex at the refined location and continue to the next:\n-1061 if (level.getVertexTag(vert)._incomplete || (vEdges.size() == 0)) {\n-1062 dstPos[vert].Clear();\n-1063 dstPos[vert].AddWithWeight(src[vert], 1.0);\n-1064 if (hasTangents) {\n-1065 (*dstTan1Ptr)[vert].Clear();\n-1066 (*dstTan2Ptr)[vert].Clear();\n-1067 }\n-1068 continue;\n-1069 }\n-1070\n-1071 //\n-1072 // Limit masks require the subdivision Rule for the vertex in order to\n-deal\n-1073 // with infinitely sharp features correctly -- including boundaries and\n-corners.\n-1074 // The vertex neighborhood is minimally defined with vertex and edge\n-counts.\n-1075 //\n-1076 _\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be vRule = level.getVertexRule(vert);\n-1077\n-1078 // This is a bit obscure -- child vertex index will be ignored here\n-1079 vHood.SetIndex(vert, vert);\n-1080\n-1081 if (hasTangents) {\n-1082 scheme.ComputeVertexLimitMask(vHood, posMask, tan1Mask, tan2Mask, vRule);\n-1083 } else {\n-1084 scheme.ComputeVertexLimitMask(vHood, posMask, vRule);\n-1085 }\n-1086\n-1087 //\n-1088 // Gather the neighboring vertices of this vertex -- the vertices opposite\n-its\n-1089 // incident edges, and the opposite vertices of its incident faces:\n-1090 //\n-1091 _\bI_\bn_\bd_\be_\bx * eIndices = indexBuffer;\n-1092 _\bI_\bn_\bd_\be_\bx * fIndices = indexBuffer + vEdges._\bs_\bi_\bz_\be();\n-1093\n-1094 for (int i = 0; i < vEdges.size(); ++i) {\n-1095 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by eVerts = level.getEdgeVertices(vEdges[i]);\n-1096\n-1097 eIndices[i] = (eVerts[0] == vert) ? eVerts[1] : eVerts[0];\n-1098 }\n-1099 if (posMask.GetNumFaceWeights() || (hasTangents &&\n-tan1Mask.GetNumFaceWeights())) {\n-1100 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n-1101 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n-1102\n-1103 for (int i = 0; i < vFaces.size(); ++i) {\n-1104 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by fVerts = level.getFaceVertices(vFaces[i]);\n-1105\n-1106 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = (vInFace[i] + 2);\n-1107 if (vOppInFace >= fVerts.size()) vOppInFace -= (_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx)fVerts._\bs_\bi_\bz_\be();\n-1108\n-1109 fIndices[i] = level.getFaceVertices(vFaces[i])[vOppInFace];\n-1110 }\n-1111 }\n-1112\n-1113 //\n-1114 // Combine the weights and indices for position and tangents. As with\n-applying\n-1115 // refinement masks to vertex data, in order to improve numerical\n-precision, it's\n-1116 // better to apply smaller weights first, so begin with the face-weights\n-followed\n-1117 // by the edge-weights and the vertex weight last.\n-1118 //\n-1119 dstPos[vert].Clear();\n-1120 for (int i = 0; i < posMask.GetNumFaceWeights(); ++i) {\n-1121 dstPos[vert].AddWithWeight(src[fIndices[i]], fPosWeights[i]);\n-1122 }\n-1123 for (int i = 0; i < posMask.GetNumEdgeWeights(); ++i) {\n-1124 dstPos[vert].AddWithWeight(src[eIndices[i]], ePosWeights[i]);\n-1125 }\n-1126 dstPos[vert].AddWithWeight(src[vert], vPosWeights[0]);\n-1127\n-1128 //\n-1129 // Apply the tangent masks -- both will have the same number of weights\n-and\n-1130 // indices (one tangent may be \"padded\" to accommodate the other), but\n-these\n-1131 // may differ from those of the position:\n-1132 //\n-1133 if (hasTangents) {\n-1134 assert(tan1Mask.GetNumFaceWeights() == tan2Mask.GetNumFaceWeights());\n-1135 assert(tan1Mask.GetNumEdgeWeights() == tan2Mask.GetNumEdgeWeights());\n-1136\n-1137 U1 & dstTan1 = *dstTan1Ptr;\n-1138 U2 & dstTan2 = *dstTan2Ptr;\n-1139\n-1140 dstTan1[vert].Clear();\n-1141 dstTan2[vert].Clear();\n-1142 for (int i = 0; i < tan1Mask.GetNumFaceWeights(); ++i) {\n-1143 dstTan1[vert].AddWithWeight(src[fIndices[i]], fTan1Weights[i]);\n-1144 dstTan2[vert].AddWithWeight(src[fIndices[i]], fTan2Weights[i]);\n-1145 }\n-1146 for (int i = 0; i < tan1Mask.GetNumEdgeWeights(); ++i) {\n-1147 dstTan1[vert].AddWithWeight(src[eIndices[i]], eTan1Weights[i]);\n-1148 dstTan2[vert].AddWithWeight(src[eIndices[i]], eTan2Weights[i]);\n-1149 }\n-1150 dstTan1[vert].AddWithWeight(src[vert], vTan1Weights[0]);\n-1151 dstTan2[vert].AddWithWeight(src[vert], vTan2Weights[0]);\n-1152 }\n-1153 }\n-1154}\n-1155\n-1156template \n-1157template \n-1158inline void\n-1159PrimvarRefinerReal::limitFVar(T const & src, U & dst, int channel)\n-const {\n-1160\n-1161 Sdc::Scheme scheme(_refiner._subdivOptions);\n-1162\n-1163 Vtr::internal::Level const & level = _refiner.getLevel\n-(_refiner.GetMaxLevel());\n-1164 Vtr::internal::FVarLevel const & fvarChannel = level.getFVarLevel\n-(channel);\n-1165\n-1166 int maxWeightsPerMask = 1 + 2 * level.getMaxValence();\n-1167\n-1168 Vtr::internal::StackBuffer weightBuffer(maxWeightsPerMask);\n-1169 Vtr::internal::StackBuffer vEdgeBuffer(level.getMaxValence());\n-1170\n-1171 // This is a bit obscure -- assign both parent and child as last level\n-1172 Vtr::internal::VertexInterface vHood(level, level);\n-1173\n-1174 for (int vert = 0; vert < level.getNumVertices(); ++vert) {\n-1175\n-1176 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vEdges = level.getVertexEdges(vert);\n-1177 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vValues = fvarChannel.getVertexValues(vert);\n-1178\n-1179 // Incomplete vertices (present in sparse refinement) do not have their\n-full\n-1180 // topological neighborhood to determine a proper limit -- just leave the\n-1181 // values (perhaps more than one per vertex) at the refined location.\n-1182 //\n-1183 // The same can be done if the face-varying channel is purely linear.\n-1184 //\n-1185 bool isIncomplete = (level.getVertexTag(vert)._incomplete || (vEdges.size\n-() == 0));\n-1186 if (isIncomplete || fvarChannel.isLinear()) {\n-1187 for (int i = 0; i < vValues.size(); ++i) {\n-1188 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n-1189\n-1190 dst[vValue].Clear();\n-1191 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n-1192 }\n-1193 continue;\n-1194 }\n-1195\n-1196 bool fvarVertMatchesVertex = fvarChannel.valueTopologyMatches(vValues[0]);\n-1197 if (fvarVertMatchesVertex) {\n-1198\n-1199 // Assign the mask weights to the common buffer and compute the mask:\n-1200 //\n-1201 Weight * vWeights = weightBuffer,\n-1202 * eWeights = vWeights + 1,\n-1203 * fWeights = eWeights + vEdges._\bs_\bi_\bz_\be();\n-1204\n-1205 Mask vMask(vWeights, eWeights, fWeights);\n-1206\n-1207 vHood.SetIndex(vert, vert);\n-1208\n-1209 scheme.ComputeVertexLimitMask(vHood, vMask, level.getVertexRule(vert));\n-1210\n-1211 //\n-1212 // Apply mask to corresponding FVar values for neighboring vertices:\n-1213 //\n-1214 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[0];\n-1215\n-1216 dst[vValue].Clear();\n-1217 if (vMask.GetNumFaceWeights() > 0) {\n-1218 assert(!vMask.AreFaceWeightsForFaceCenters());\n-1219\n-1220 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vFaces = level.getVertexFaces(vert);\n-1221 _\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by vInFace = level.getVertexFaceLocalIndices(vert);\n-1222\n-1223 for (int i = 0; i < vFaces.size(); ++i) {\n-1224 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by faceValues = fvarChannel.getFaceValues(vFaces[i]);\n-1225 _\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx vOppInFace = vInFace[i] + 2;\n-1226 if (vOppInFace >= faceValues.size()) vOppInFace -= faceValues._\bs_\bi_\bz_\be();\n-1227\n-1228 _\bI_\bn_\bd_\be_\bx vValueOppositeFace = faceValues[vOppInFace];\n-1229\n-1230 dst[vValue].AddWithWeight(src[vValueOppositeFace], fWeights[i]);\n-1231 }\n-1232 }\n-1233 if (vMask.GetNumEdgeWeights() > 0) {\n-1234 _\bI_\bn_\bd_\be_\bx * vEdgeValues = vEdgeBuffer;\n-1235 fvarChannel.getVertexEdgeValues(vert, vEdgeValues);\n-1236\n-1237 for (int i = 0; i < vEdges.size(); ++i) {\n-1238 dst[vValue].AddWithWeight(src[vEdgeValues[i]], eWeights[i]);\n-1239 }\n-1240 }\n-1241 dst[vValue].AddWithWeight(src[vValue], vWeights[0]);\n-1242 } else {\n-1243 //\n-1244 // Sibling FVar values associated with a vertex will be either a corner or\n-a crease:\n-1245 //\n-1246 for (int i = 0; i < vValues.size(); ++i) {\n-1247 _\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx vValue = vValues[i];\n-1248\n-1249 dst[vValue].Clear();\n-1250 if (fvarChannel.getValueTag(vValue).isCorner()) {\n-1251 dst[vValue].AddWithWeight(src[vValue], 1.0f);\n-1252 } else {\n-1253 _\bI_\bn_\bd_\be_\bx vEndValues[2];\n-1254 fvarChannel.getVertexCreaseEndValues(vert, i, vEndValues);\n-1255\n-1256 dst[vValue].AddWithWeight(src[vEndValues[0]], 1.0f/6.0f);\n-1257 dst[vValue].AddWithWeight(src[vEndValues[1]], 1.0f/6.0f);\n-1258 dst[vValue].AddWithWeight(src[vValue], 2.0f/3.0f);\n-1259 }\n-1260 }\n-1261 }\n-1262 }\n-1263}\n-1264\n-_\b1_\b2_\b6_\b5class _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br : public _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl {\n-1266public:\n-_\b1_\b2_\b6_\b7 _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br(_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br const & refiner)\n-1268 : _\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl(refiner) { }\n-1269};\n-1270\n-1271} // end namespace Far\n-1272\n-1273} // end namespace OPENSUBDIV_VERSION\n-1274using namespace OPENSUBDIV_VERSION;\n-1275} // end namespace OpenSubdiv\n-1276\n-1277#endif /* OPENSUBDIV3_FAR_PRIMVAR_REFINER_H */\n+234\n+235#endif /* OPENSUBDIV3_FAR_PATCH_TABLE_FACTORY_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx\n-Vtr::LocalIndex LocalIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bE_\br_\br_\bo_\br\n-void Error(ErrorType err, const char *format,...)\n-Sends an OSD error with a message (internal use only)\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n Vtr::ConstIndexArray ConstIndexArray\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bL_\bo_\bc_\ba_\bl_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::ConstLocalIndexArray ConstLocalIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bF_\bA_\bR_\b__\bR_\bU_\bN_\bT_\bI_\bM_\bE_\b__\bE_\bR_\bR_\bO_\bR\n-@ FAR_RUNTIME_ERROR\n-Issue a generic runtime error, but continue execution.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\be_\br_\br_\bo_\br_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-int Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n-bool IndexIsValid(Index index)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR\n-@ SCHEME_BILINEAR\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK\n-@ SCHEME_CATMARK\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bL_\bO_\bO_\bP\n-@ SCHEME_LOOP\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-Applies refinement operations to generic primvar data.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n-void Limit(T const &src, U &dstPos) const\n-Apply limit weights to a primvar buffer.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-PrimvarRefinerReal(TopologyRefiner const &refiner)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt\n-void Limit(T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-void InterpolateFaceUniform(int level, T const &src, U &dst) const\n-Refine uniform (per-face) primvar data between levels.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n-TopologyRefiner const & GetTopologyRefiner() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void InterpolateVarying(int level, T const &src, U &dst) const\n-Apply only varying interpolation weights to a primvar buffer for a single level\n-of refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b4_\b1_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be\n-void Interpolate(int level, T const &src, U &dst) const\n-Apply vertex interpolation weights to a primvar buffer for a single level of\n-refinement.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\be_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void InterpolateFaceVarying(int level, T const &src, U &dst, int channel=0)\n-const\n-Apply face-varying interpolation weights to a primvar buffer associated with a\n-particular face-varyin...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b2_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\b~_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl\n-~PrimvarRefinerReal()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\bR_\be_\ba_\bl_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void LimitFaceVarying(T const &src, U &dst, int channel=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b3_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bP_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br\n-PrimvarRefiner(TopologyRefiner const &refiner)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+Container for arrays of parametric patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by\n+Factory for constructing a PatchTable from a TopologyRefiner.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bg_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchFaceTag > PatchTagVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static PatchTable * Create(TopologyRefiner const &refiner, Options\n+options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())\n+Instantiates a PatchTable from a client-provided TopologyRefiner.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Public options for the PatchTable factory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bT_\ba_\bb_\bl_\be_\bs\n+unsigned int generateVaryingTables\n+Generate varying patch tables.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bL_\be_\bg_\ba_\bc_\by_\bS_\bh_\ba_\br_\bp_\bC_\bo_\br_\bn_\be_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+unsigned int generateLegacySharpCornerPatches\n+Generate sharp regular patches at smooth corners (legacy)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bs_\bh_\ba_\br_\be_\bE_\bn_\bd_\bC_\ba_\bp_\bP_\ba_\bt_\bc_\bh_\bP_\bo_\bi_\bn_\bt_\bs\n+unsigned int shareEndCapPatchPoints\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bG_\be_\bt_\bR_\be_\bf_\bi_\bn_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+TopologyRefiner::AdaptiveOptions GetRefineAdaptiveOptions() const\n+Determine adaptive refinement options to match assigned patch options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bm_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n+unsigned int maxIsolationLevel\n+Cap adaptive feature isolation to the given level (max. 10)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+EndCapType GetEndCapType() const\n+Get endcap basis type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bL_\be_\bg_\ba_\bc_\by_\bL_\bi_\bn_\be_\ba_\br_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+unsigned int generateFVarLegacyLinearPatches\n+Generate all linear face-varying patches (legacy)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n+void SetPatchPrecision()\n+Set precision of vertex patches.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n+unsigned int fvarPatchPrecisionDouble\n+Generate double-precision stencils for face-varying patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bM_\ba_\bx_\bI_\bs_\bo_\bl_\ba_\bt_\bi_\bo_\bn_\bL_\be_\bv_\be_\bl\n+void SetMaxIsolationLevel(unsigned int level)\n+Set maximum isolation level.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\be_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+unsigned int endCapType\n+EndCapType.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bf_\bv_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+int const * fvarChannelIndices\n+List containing the indices of the channels selected for the factory.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n+unsigned int useSingleCreasePatch\n+Use single crease patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n+unsigned int useInfSharpPatch\n+Use infinitely-sharp patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bS_\be_\bt_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+void SetEndCapType(EndCapType e)\n+Set endcap basis type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n+unsigned int generateVaryingLocalPoints\n+Generate local points with varying patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bF_\bV_\ba_\br_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+unsigned int includeFVarBaseLevelIndices\n+Include base level in face-varying patch point indices (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bA_\bl_\bl_\bL_\be_\bv_\be_\bl_\bs\n+unsigned int generateAllLevels\n+Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bp_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bD_\bo_\bu_\bb_\bl_\be\n+unsigned int patchPrecisionDouble\n+Generate double-precision stencils for vertex patches.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bg_\be_\bn_\be_\br_\ba_\bt_\be_\bF_\bV_\ba_\br_\bT_\ba_\bb_\bl_\be_\bs\n+unsigned int generateFVarTables\n+Generate face-varying patch tables.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bi_\bn_\bc_\bl_\bu_\bd_\be_\bB_\ba_\bs_\be_\bL_\be_\bv_\be_\bl_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+unsigned int includeBaseLevelIndices\n+Include base level in patch point indices (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bS_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn\n+void SetFVarPatchPrecision()\n+Set precision of face-varying patches.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bn_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int numFVarChannels\n+Number of channel indices and interpolation modes passed.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bt_\br_\bi_\ba_\bn_\bg_\bu_\bl_\ba_\bt_\be_\bQ_\bu_\ba_\bd_\bs\n+unsigned int triangulateQuads\n+Triangulate 'QUADS' primitives (Uniform mode only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bn_\bd_\bC_\ba_\bp_\bT_\by_\bp_\be\n+EndCapType\n+Choice for approximating irregular patches (end-caps)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bL_\bE_\bG_\bA_\bC_\bY_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY\n+@ ENDCAP_LEGACY_GREGORY\n+legacy option for 2.x style Gregory patches (Catmark only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_GREGORY_BASIS\n+use Gregory patches (highest quality, recommended default)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bN_\bO_\bN_\bE\n+@ ENDCAP_NONE\n+unspecified\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bI_\bL_\bI_\bN_\bE_\bA_\bR_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_BILINEAR_BASIS\n+use linear patches (simple quads or tris)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bE_\bN_\bD_\bC_\bA_\bP_\b__\bB_\bS_\bP_\bL_\bI_\bN_\bE_\b__\bB_\bA_\bS_\bI_\bS\n+@ ENDCAP_BSPLINE_BASIS\n+use BSpline-like patches (same patch type as regular)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Options(unsigned int maxIsolation=10)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg\n+Obsolete internal struct not intended for public use \u00e2\u0080\u0093 due to be deprecated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bi_\bs_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be\n+unsigned int _isSingleCrease\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bi_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n+unsigned int _isRegular\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bd_\be_\bx\n+unsigned int _boundaryIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bV_\be_\br_\bt_\be_\bx_\bM_\ba_\bs_\bk\n+void assignBoundaryPropertiesFromVertexMask(int boundaryVertexMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bt_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bM_\ba_\bs_\bk\n+unsigned int _transitionMask\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bh_\ba_\bs_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n+unsigned int _hasBoundaryEdge\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b2_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bM_\ba_\bs_\bk\n+unsigned int _boundaryMask\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\b__\bh_\ba_\bs_\bP_\ba_\bt_\bc_\bh\n+unsigned int _hasPatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n+void assignTransitionPropertiesFromEdgeMask(int boundaryVertexMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:_\bc_\bl_\be_\ba_\br\n+void clear()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\ba_\bs_\bs_\bi_\bg_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bP_\br_\bo_\bp_\be_\br_\bt_\bi_\be_\bs_\bF_\br_\bo_\bm_\bE_\bd_\bg_\be_\bM_\ba_\bs_\bk\n+void assignBoundaryPropertiesFromEdgeMask(int boundaryEdgeMask)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bF_\ba_\bc_\be_\bT_\ba_\bg_\b:_\b:\n+_\b__\bb_\bo_\bu_\bn_\bd_\ba_\br_\by_\bC_\bo_\bu_\bn_\bt\n+unsigned int _boundaryCount\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh_\b:_\b1_\b9_\b9\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n Stores topology data for a specified set of refinement options.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n-Rule\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n-@ RULE_CREASE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be\n-Scheme is a class template which provides all implementation for the\n-subdivision schemes supported by...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bc_\bh_\be_\bm_\be_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+Adaptive refinement options.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh\n+unsigned int useSingleCreasePatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bu_\bs_\be_\bI_\bn_\bf_\bS_\bh_\ba_\br_\bp_\bP_\ba_\bt_\bc_\bh\n+unsigned int useInfSharpPatch\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bc_\bo_\bn_\bs_\bi_\bd_\be_\br_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+unsigned int considerFVarChannels\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh_\b:_\b1_\b8_\b0\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b:_\b:_\bs_\bi_\bz_\be\n-size_type size() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b7_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\br_\bi_\bm_\bv_\ba_\br_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00731.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00731.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTable.h File Reference\n+OpenSubdiv: opensubdiv/far/patchMap.h File Reference\n \n \n \n \n \n \n \n@@ -90,33 +90,29 @@\n \n \n \n
\n \n-
patchTable.h File Reference
\n+
patchMap.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchDescriptor.h"
\n-#include "../far/patchParam.h"
\n-#include "../far/stencilTable.h"
\n-#include "../sdc/options.h"
\n-#include <vector>
\n+#include "../far/patchTable.h"
\n+#include <cassert>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n+\n \n

\n Classes

class  PatchTable
 Container for arrays of parametric patches. More...
class  PatchMap
 An quadtree-based map connecting coarse faces to their sub-patches. More...
 
class  PatchTable::PatchHandle
 Handle that can be used as unique patch identifier within PatchTable. More...
struct  PatchMap::QuadNode::Child
 
\n \n \n \n \n@@ -125,13 +121,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,32 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-patchTable.h File Reference\n+patchMap.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-\u00a0 Container for arrays of parametric patches. _\bM_\bo_\br_\be_\b._\b._\b.\n+ class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n+\u00a0 An quadtree-based map connecting coarse faces to their sub-patches.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be\n-\u00a0 Handle that can be used as unique patch identifier within _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00731.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00731.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var a00731 = [\n- [\"PatchTable\", \"a00993.html\", \"a00993\"],\n- [\"PatchHandle\", \"a00997.html\", \"a00997\"]\n+ [\"PatchMap\", \"a00977.html\", \"a00977\"],\n+ [\"Child\", \"a00985.html\", \"a00985\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00731_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00731_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchTable.h Source File\n+OpenSubdiv: opensubdiv/far/patchMap.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchTable.h
\n+
patchMap.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,798 +119,222 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_TABLE_H
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_MAP_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_MAP_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../far/patchDescriptor.h"
\n-
31#include "../far/patchParam.h"
\n-
32#include "../far/stencilTable.h"
\n+
30#include "../far/patchTable.h"
\n+
31
\n+
32#include <cassert>
\n
33
\n-
34#include "../sdc/options.h"
\n-
35
\n-
36#include <vector>
\n-
37
\n-
38namespace OpenSubdiv {
\n-
39namespace OPENSUBDIV_VERSION {
\n-
40
\n-
41namespace Far {
\n-
42
\n-
\n-\n-
56
\n-
57public:
\n-
58
\n-
\n-\n-
61 // XXXX manuelk members will eventually be made private
\n-
62 public:
\n-
63
\n-
64 friend class PatchTable;
\n-
65 friend class PatchMap;
\n-
66
\n-
67 Index arrayIndex, // Array index of the patch
\n-
68 patchIndex, // Absolute Index of the patch
\n-
69 vertIndex; // Relative offset to the first CV of the patch in array
\n-
70 };
\n-
\n-
71
\n-
72public:
\n-
73
\n-
75 PatchTable(PatchTable const & src);
\n-
76
\n-\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38
\n+
\n+
49class PatchMap {
\n+
50public:
\n+
51
\n+\n+
53
\n+
58 PatchMap( PatchTable const & patchTable );
\n+
59
\n+
74 Handle const * FindPatch( int patchFaceId, double u, double v ) const;
\n+
75
\n+
76private:
\n+
77 void initializeHandles(PatchTable const & patchTable);
\n+
78 void initializeQuadtree(PatchTable const & patchTable);
\n
79
\n-
81 bool IsFeatureAdaptive() const;
\n-
82
\n-
\n-\n-
85 return (int)_patchVerts.size();
\n-
86 }
\n+
80private:
\n+
81 // Quadtree node with 4 children, tree is just a vector of nodes
\n+
82 struct QuadNode {
\n+
83 QuadNode() { std::memset(this, 0, sizeof(QuadNode)); }
\n+
84
\n+
\n+
85 struct Child {
\n+
86 unsigned int isSet : 1; // true if the child has been set
\n+
87 unsigned int isLeaf : 1; // true if the child is a QuadNode
\n+
88 unsigned int index : 30; // child index (either QuadNode or Handle)
\n+
89 };
\n
\n-
87
\n-
89 int GetNumPatchesTotal() const;
\n
90
\n-
92 int GetMaxValence() const { return _maxValence; }
\n+
91 // sets all the children to point to the patch of given index
\n+
92 void SetChildren(int index);
\n
93
\n-
95 int GetNumPtexFaces() const { return _numPtexFaces; }
\n+
94 // sets the child in "quadrant" to point to the node or patch of the given index
\n+
95 void SetChild(int quadrant, int index, bool isLeaf);
\n
96
\n-
97
\n-
99
\n-
105
\n-\n-
108
\n-\n-
111
\n-
113 PatchParam GetPatchParam(PatchHandle const & handle) const;
\n-
114
\n-
116 ConstIndexArray GetPatchVertices(int array, int patch) const;
\n-
117
\n-
119 PatchParam GetPatchParam(int array, int patch) const;
\n-
121
\n-
122
\n-
124
\n-
130
\n-
132 int GetNumPatchArrays() const;
\n-
133
\n-
135 int GetNumPatches(int array) const;
\n-
136
\n-
138 int GetNumControlVertices(int array) const;
\n-
139
\n-\n-
142
\n-\n-
145
\n-
147 ConstPatchParamArray const GetPatchParams(int array) const;
\n-
149
\n+
97 Child children[4];
\n+
98 };
\n+
99 typedef std::vector<QuadNode> QuadTree;
\n+
100
\n+
101 // Internal methods supporting quadtree construction and queries
\n+
102 void assignRootNode(QuadNode * node, int index);
\n+
103 QuadNode * assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quad, int index);
\n+
104
\n+
105 template <class T>
\n+
106 static int transformUVToQuadQuadrant(T const & median, T & u, T & v);
\n+
107 template <class T>
\n+
108 static int transformUVToTriQuadrant(T const & median, T & u, T & v, bool & rotated);
\n+
109
\n+
110private:
\n+
111 bool _patchesAreTriangular; // tri and quad assembly and search requirements differ
\n+
112
\n+
113 int _minPatchFace; // minimum patch face index supported by the map
\n+
114 int _maxPatchFace; // maximum patch face index supported by the map
\n+
115 int _maxDepth; // maximum depth of a patch in the tree
\n+
116
\n+
117 std::vector<Handle> _handles; // all the patches in the PatchTable
\n+
118 std::vector<QuadNode> _quadtree; // quadtree nodes
\n+
119};
\n+
\n+
120
\n+
121//
\n+
122// Given a median value for both U and V, these methods transform a (u,v) pair
\n+
123// into the quadrant that contains them and returns the quadrant index.
\n+
124//
\n+
125// Quadrant indexing for tri and quad patches -- consistent with PatchParam's
\n+
126// usage of UV bits:
\n+
127//
\n+
128// (0,1) o-----o-----o (1,1) (0,1) o (1,0) o-----o-----o (0,0)
\n+
129// | | | |\\ \\ 1 |\\ 0 |
\n+
130// | 2 | 3 | | \\ \\ | \\ |
\n+
131// | | | | 2 \\ \\| 3 \\|
\n+
132// o-----o-----o o-----o o-----o
\n+
133// | | | |\\ 3 |\\ \\ 2 |
\n+
134// | 0 | 1 | | \\ | \\ \\ |
\n+
135// | | | | 0 \\| 1 \\ \\|
\n+
136// (0,0) o-----o-----o (1,0) (0,0) o-----o-----o (1,0) o (0,1)
\n+
137//
\n+
138// The triangular case also takes and returns/affects the rotation of the
\n+
139// quadrant being searched and identified (quadrant 3 imparts a rotation).
\n+
140//
\n+
141template <class T>
\n+
142inline int
\n+
143PatchMap::transformUVToQuadQuadrant(T const & median, T & u, T & v) {
\n+
144
\n+
145 int uHalf = (u >= median);
\n+
146 if (uHalf) u -= median;
\n+
147
\n+
148 int vHalf = (v >= median);
\n+
149 if (vHalf) v -= median;
\n
150
\n-
152
\n-
159
\n-
161 int GetNumLocalPoints() const;
\n-
162
\n-\n-
165
\n-
167 template <typename REAL>
\n-\n-
169
\n-
172 template <typename REAL> bool LocalPointStencilPrecisionMatchesType() const;
\n-
173
\n-
186 template <class T> void
\n-
187 ComputeLocalPointValues(T const *src, T *dst) const;
\n-
188
\n-
189
\n-\n-
192
\n-\n-
195
\n-
197 template <typename REAL>
\n-\n-
199
\n-
202 template <typename REAL> bool LocalPointVaryingStencilPrecisionMatchesType() const;
\n+
151 return (vHalf << 1) | uHalf;
\n+
152}
\n+
153
\n+
154template <class T>
\n+
155int inline
\n+
156PatchMap::transformUVToTriQuadrant(T const & median, T & u, T & v, bool & rotated) {
\n+
157
\n+
158 if (!rotated) {
\n+
159 if (u >= median) {
\n+
160 u -= median;
\n+
161 return 1;
\n+
162 }
\n+
163 if (v >= median) {
\n+
164 v -= median;
\n+
165 return 2;
\n+
166 }
\n+
167 if ((u + v) >= median) {
\n+
168 rotated = true;
\n+
169 return 3;
\n+
170 }
\n+
171 return 0;
\n+
172 } else {
\n+
173 if (u < median) {
\n+
174 v -= median;
\n+
175 return 1;
\n+
176 }
\n+
177 if (v < median) {
\n+
178 u -= median;
\n+
179 return 2;
\n+
180 }
\n+
181 u -= median;
\n+
182 v -= median;
\n+
183 if ((u + v) < median) {
\n+
184 rotated = false;
\n+
185 return 3;
\n+
186 }
\n+
187 return 0;
\n+
188 }
\n+
189}
\n+
190
\n+
192inline PatchMap::Handle const *
\n+
\n+
193PatchMap::FindPatch( int faceid, double u, double v ) const {
\n+
194
\n+
195 //
\n+
196 // Reject patch faces not supported by this map, or those corresponding
\n+
197 // to holes or otherwise unassigned (the root node for a patch will
\n+
198 // have all or no quadrants set):
\n+
199 //
\n+
200 if ((faceid < _minPatchFace) || (faceid > _maxPatchFace)) return 0;
\n+
201
\n+
202 QuadNode const * node = &_quadtree[faceid - _minPatchFace];
\n
203
\n-
216 template <class T> void
\n-
217 ComputeLocalPointValuesVarying(T const *src, T *dst) const;
\n-
218
\n+
204 if (!node->children[0].isSet) return 0;
\n+
205
\n+
206 //
\n+
207 // Search the tree for the sub-patch containing the given (u,v)
\n+
208 //
\n+
209 assert( (u>=0.0) && (u<=1.0) && (v>=0.0) && (v<=1.0) );
\n+
210
\n+
211 double median = 0.5;
\n+
212 bool triRotated = false;
\n+
213
\n+
214 for (int depth = 0; depth <= _maxDepth; ++depth, median *= 0.5) {
\n+
215
\n+
216 int quadrant = _patchesAreTriangular
\n+
217 ? transformUVToTriQuadrant(median, u, v, triRotated)
\n+
218 : transformUVToQuadQuadrant(median, u, v);
\n
219
\n-
221 int GetNumLocalPointsFaceVarying(int channel = 0) const;
\n+
220 // holes should have been rejected at the root node of the face
\n+
221 assert(node->children[quadrant].isSet);
\n
222
\n-
224 StencilTable const *GetLocalPointFaceVaryingStencilTable(int channel = 0) const;
\n-
225
\n-
227 template <typename REAL>
\n-\n-
229
\n-
232 template <typename REAL> bool LocalPointFaceVaryingStencilPrecisionMatchesType() const;
\n-
233
\n-
248 template <class T> void
\n-
249 ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel = 0) const;
\n-
251
\n-
252
\n-
254
\n-
255
\n-\n-
260
\n-\n-
263
\n-
264 typedef std::vector<Index> VertexValenceTable;
\n-
265
\n-
\n-\n-
268 return _vertexValenceTable;
\n-
269 }
\n-
\n-
271
\n-
272
\n-
274
\n-
280
\n-\n-
284
\n-
287 float GetSingleCreasePatchSharpnessValue(int array, int patch) const;
\n-
289
\n-
290
\n-
292
\n-
298
\n-\n-
301
\n-\n-
304
\n-
306 ConstIndexArray GetPatchVaryingVertices(int array, int patch) const;
\n-
307
\n-\n-
310
\n-\n-
314
\n-
315
\n-
317
\n-
323
\n-\n-
326
\n-\n-
329
\n-\n-
332
\n-\n-
335
\n-
337 ConstIndexArray GetPatchFVarValues(PatchHandle const & handle, int channel = 0) const;
\n-
338
\n-
340 ConstIndexArray GetPatchFVarValues(int array, int patch, int channel = 0) const;
\n-
341
\n-
343 ConstIndexArray GetPatchArrayFVarValues(int array, int channel = 0) const;
\n-
344
\n-
346 ConstIndexArray GetFVarValues(int channel = 0) const;
\n-
347
\n-
349 int GetFVarValueStride(int channel = 0) const;
\n-
350
\n-
352 PatchParam GetPatchFVarPatchParam(PatchHandle const & handle, int channel = 0) const;
\n-
353
\n-
355 PatchParam GetPatchFVarPatchParam(int array, int patch, int channel = 0) const;
\n-
356
\n-
358 ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel = 0) const;
\n-
359
\n-\n-
362
\n-\n-
366
\n-
367
\n-
369
\n-
374
\n-
375 typedef std::vector<Index> PatchVertsTable;
\n-
376
\n-
378 PatchVertsTable const & GetPatchControlVerticesTable() const { return _patchVerts; }
\n-
379
\n-
381 PatchParamTable const & GetPatchParamTable() const { return _paramTable; }
\n-
382
\n-
384 std::vector<Index> const &GetSharpnessIndexTable() const { return _sharpnessIndices; }
\n-
385
\n-
387 std::vector<float> const &GetSharpnessValues() const { return _sharpnessValues; }
\n-
388
\n-
389 typedef std::vector<unsigned int> QuadOffsetsTable;
\n-
390
\n-
\n-\n-
393 return _quadOffsetsTable;
\n-
394 }
\n-
\n-
396
\n-
398 void print() const;
\n-
399
\n-
400public:
\n-
401
\n-
403
\n-
405
\n-
428 template <typename REAL>
\n-
429 void EvaluateBasis(PatchHandle const & handle, REAL u, REAL v,
\n-
430 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n-
431 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;
\n-
432
\n-
435 void EvaluateBasis(PatchHandle const & handle, float u, float v,
\n-
436 float wP[], float wDu[] = 0, float wDv[] = 0,
\n-
437 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;
\n-
438
\n-
441 void EvaluateBasis(PatchHandle const & handle, double u, double v,
\n-
442 double wP[], double wDu[] = 0, double wDv[] = 0,
\n-
443 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;
\n-
444
\n-
467 template <typename REAL>
\n-
468 void EvaluateBasisVarying(PatchHandle const & handle, REAL u, REAL v,
\n-
469 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n-
470 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;
\n-
471
\n-
474 void EvaluateBasisVarying(PatchHandle const & handle, float u, float v,
\n-
475 float wP[], float wDu[] = 0, float wDv[] = 0,
\n-
476 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;
\n-
477
\n-
480 void EvaluateBasisVarying(PatchHandle const & handle, double u, double v,
\n-
481 double wP[], double wDu[] = 0, double wDv[] = 0,
\n-
482 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;
\n-
483
\n-
508 template <typename REAL>
\n-
509 void EvaluateBasisFaceVarying(PatchHandle const & handle, REAL u, REAL v,
\n-
510 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n-
511 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0,
\n-
512 int channel = 0) const;
\n-
513
\n-
516 void EvaluateBasisFaceVarying(PatchHandle const & handle, float u, float v,
\n-
517 float wP[], float wDu[] = 0, float wDv[] = 0,
\n-
518 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0,
\n-
519 int channel = 0) const;
\n-
520
\n-
523 void EvaluateBasisFaceVarying(PatchHandle const & handle, double u, double v,
\n-
524 double wP[], double wDu[] = 0, double wDv[] = 0,
\n-
525 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0,
\n-
526 int channel = 0) const;
\n-
528
\n-
529protected:
\n-
530
\n-
531 friend class PatchTableBuilder;
\n-
532
\n-
533 // Factory constructor
\n-
534 PatchTable(int maxvalence);
\n-
535
\n-
536 Index getPatchIndex(int array, int patch) const;
\n-
537
\n-\n-
539
\n-\n-
541 float * getSharpnessValues(Index arrayIndex);
\n-
542
\n-
543private:
\n-
544
\n-
545 //
\n-
546 // Patch arrays
\n-
547 //
\n-
548 struct PatchArray {
\n-
549 PatchArray(PatchDescriptor d, int np, Index v, Index p, Index qo) :
\n-
550 desc(d), numPatches(np), vertIndex(v),
\n-
551 patchIndex(p), quadOffsetIndex (qo) { }
\n-
552
\n-
553 void print() const;
\n-
554
\n-
555 PatchDescriptor desc; // type of patches in the array
\n-
556
\n-
557 int numPatches; // number of patches in the array
\n-
558
\n-
559 Index vertIndex, // index to the first control vertex
\n-
560 patchIndex, // absolute index of the first patch in the array
\n-
561 quadOffsetIndex; // index of the first quad offset entry
\n-
562 };
\n-
563
\n-
564 typedef std::vector<PatchArray> PatchArrayVector;
\n-
565
\n-
566 PatchArray & getPatchArray(Index arrayIndex);
\n-
567 PatchArray const & getPatchArray(Index arrayIndex) const;
\n-
568
\n-
569 void reservePatchArrays(int numPatchArrays);
\n-
570 void pushPatchArray(PatchDescriptor desc, int npatches,
\n-
571 Index * vidx, Index * pidx, Index * qoidx=0);
\n-
572
\n-
573 IndexArray getPatchArrayVertices(int arrayIndex);
\n-
574
\n-
575 Index findPatchArray(PatchDescriptor desc);
\n-
576
\n-
577
\n-
578 //
\n-
579 // Varying patch arrays
\n-
580 //
\n-
581 IndexArray getPatchArrayVaryingVertices(int arrayIndex);
\n-
582
\n-
583 void allocateVaryingVertices(
\n-
584 PatchDescriptor desc, int numPatches);
\n-
585 void populateVaryingVertices();
\n-
586
\n-
587 //
\n-
588 // Face-varying patch channels
\n-
589 //
\n-
590
\n-
591 //
\n-
592 // FVarPatchChannel
\n-
593 //
\n-
594 // Stores a record for each patch in the primitive :
\n-
595 //
\n-
596 // - Each patch in the PatchTable has a corresponding patch in each
\n-
597 // face-varying patch channel. Patch vertex indices are sorted in the same
\n-
598 // patch-type order as PatchTable::PTables. Face-varying data for a patch
\n-
599 // can therefore be quickly accessed by using the patch primitive ID as
\n-
600 // index into patchValueOffsets to locate the face-varying control vertex
\n-
601 // indices.
\n-
602 //
\n-
603 // - Face-varying channels can have a different interpolation modes
\n-
604 //
\n-
605 // - Unlike "vertex" patches, there are no transition masks required
\n-
606 // for face-varying patches.
\n-
607 //
\n-
608 // - Face-varying patches still require boundary edge masks.
\n-
609 //
\n-
610 // - currently most patches with sharp boundaries but smooth interiors have
\n-
611 // to be isolated to level 10 : we need a special type of bicubic patch
\n-
612 // similar to single-crease to resolve this condition without requiring
\n-
613 // isolation if possible
\n-
614 //
\n-
615 struct FVarPatchChannel {
\n-\n-
617
\n-
618 PatchDescriptor regDesc;
\n-
619 PatchDescriptor irregDesc;
\n-
620
\n-
621 int stride;
\n-
622
\n-
623 std::vector<Index> patchValues;
\n-
624 std::vector<PatchParam> patchParam;
\n-
625 };
\n-
626 typedef std::vector<FVarPatchChannel> FVarPatchChannelVector;
\n-
627
\n-
628 FVarPatchChannel & getFVarPatchChannel(int channel);
\n-
629 FVarPatchChannel const & getFVarPatchChannel(int channel) const;
\n-
630
\n-
631 void allocateFVarPatchChannels(int numChannels);
\n-
632 void allocateFVarPatchChannelValues(
\n-
633 PatchDescriptor regDesc, PatchDescriptor irregDesc,
\n-
634 int numPatches, int channel);
\n-
635
\n-
636 // deprecated
\n-
637 void setFVarPatchChannelLinearInterpolation(
\n-
638 Sdc::Options::FVarLinearInterpolation interpolation, int channel);
\n-
639
\n-
640 IndexArray getFVarValues(int channel);
\n-
641 ConstIndexArray getPatchFVarValues(int patch, int channel) const;
\n-
642
\n-
643 PatchParamArray getFVarPatchParams(int channel);
\n-
644 PatchParam getPatchFVarPatchParam(int patch, int channel) const;
\n-
645
\n-
646private:
\n-
647 //
\n-
648 // Simple private class to hold stencil table pointers of varying precision,
\n-
649 // where the discriminant of the precision is external.
\n-
650 //
\n-
651 // NOTE that this is a simple pointer container and NOT a smart pointer that
\n-
652 // manages the ownership of the object referred to by it.
\n-
653 //
\n-
654 class StencilTablePtr {
\n-
655 private:
\n-
656 typedef StencilTableReal<float> float_type;
\n-
657 typedef StencilTableReal<double> double_type;
\n-
658
\n-
659 union {
\n-
660 float_type * _fPtr;
\n-
661 double_type * _dPtr;
\n-
662 };
\n-
663
\n-
664 public:
\n-
665 StencilTablePtr() { _fPtr = 0; }
\n-
666 StencilTablePtr(float_type * ptr) { _fPtr = ptr; }
\n-
667 StencilTablePtr(double_type * ptr) { _dPtr = ptr; }
\n-
668
\n-
669 operator bool() const { return _fPtr != 0; }
\n-
670
\n-
671 void Set() { _fPtr = 0; }
\n-
672 void Set(float_type * ptr) { _fPtr = ptr; }
\n-
673 void Set(double_type * ptr) { _dPtr = ptr; }
\n-
674
\n-
675 template <typename REAL> StencilTableReal<REAL> * Get() const;
\n-
676 };
\n-
677
\n-
678private:
\n-
679
\n-
680 //
\n-
681 // Topology
\n-
682 //
\n-
683
\n-
684 int _maxValence, // highest vertex valence found in the mesh
\n-
685 _numPtexFaces; // total number of ptex faces
\n-
686
\n-
687 PatchArrayVector _patchArrays; // Vector of descriptors for arrays of patches
\n-
688
\n-
689 std::vector<Index> _patchVerts; // Indices of the control vertices of the patches
\n-
690
\n-
691 PatchParamTable _paramTable; // PatchParam bitfields (one per patch)
\n-
692
\n-
693 //
\n-
694 // Extraordinary vertex closed-form evaluation / endcap basis conversion
\n-
695 //
\n-
696 // XXXtakahito: these data will probably be replaced with mask coefficient or something
\n-
697 // SchemeWorker populates.
\n-
698 //
\n-
699 QuadOffsetsTable _quadOffsetsTable; // Quad offsets (for Gregory patches)
\n-
700 VertexValenceTable _vertexValenceTable; // Vertex valence table (for Gregory patches)
\n-
701
\n-
702 StencilTablePtr _localPointStencils; // local point conversion stencils
\n-
703 StencilTablePtr _localPointVaryingStencils; // local point varying stencils
\n-
704
\n-
705 //
\n-
706 // Varying data
\n-
707 //
\n-
708 PatchDescriptor _varyingDesc;
\n-
709
\n-
710 std::vector<Index> _varyingVerts;
\n-
711
\n-
712 //
\n-
713 // Face-varying data
\n-
714 //
\n-
715 FVarPatchChannelVector _fvarChannels;
\n-
716
\n-
717 std::vector<StencilTablePtr> _localPointFaceVaryingStencils;
\n-
718
\n-
719 //
\n-
720 // 'single-crease' patch sharpness tables
\n-
721 //
\n-
722 std::vector<Index> _sharpnessIndices; // Indices of single-crease sharpness (one per patch)
\n-
723 std::vector<float> _sharpnessValues; // Sharpness values.
\n-
724
\n-
725 //
\n-
726 // Construction history -- relevant to at least one public query:
\n-
727 //
\n-
728 unsigned int _isUniformLinear : 1;
\n-
729
\n-
730 //
\n-
731 // Precision -- only applies to local-point stencil tables
\n-
732 //
\n-
733 unsigned int _vertexPrecisionIsDouble : 1;
\n-
734 unsigned int _varyingPrecisionIsDouble : 1;
\n-
735 unsigned int _faceVaryingPrecisionIsDouble : 1;
\n-
736};
\n-
\n-
737
\n-
738
\n-
739//
\n-
740// Template specializations for float/double -- to be defined before used:
\n-
741//
\n-
742template <> inline StencilTableReal<float> *
\n-
743PatchTable::StencilTablePtr::Get<float>() const { return _fPtr; }
\n-
744
\n-
745template <> inline StencilTableReal<double> *
\n-
746PatchTable::StencilTablePtr::Get<double>() const { return _dPtr; }
\n-
747
\n-
\n-
748template <> inline bool
\n-
749PatchTable::LocalPointStencilPrecisionMatchesType<float>() const {
\n-
750 return !_vertexPrecisionIsDouble;
\n-
751}
\n-
\n-
\n-
752template <> inline bool
\n-
753PatchTable::LocalPointVaryingStencilPrecisionMatchesType<float>() const {
\n-
754 return !_varyingPrecisionIsDouble;
\n-
755}
\n-
\n-
\n-
756template <> inline bool
\n-
757PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType<float>() const {
\n-
758 return !_faceVaryingPrecisionIsDouble;
\n-
759}
\n-
\n-
760
\n-
\n-
761template <> inline bool
\n-
762PatchTable::LocalPointStencilPrecisionMatchesType<double>() const {
\n-
763 return _vertexPrecisionIsDouble;
\n-
764}
\n-
\n-
\n-
765template <> inline bool
\n-
766PatchTable::LocalPointVaryingStencilPrecisionMatchesType<double>() const {
\n-
767 return _varyingPrecisionIsDouble;
\n-
768}
\n-
\n-
\n-
769template <> inline bool
\n-
770PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType<double>() const {
\n-
771 return _faceVaryingPrecisionIsDouble;
\n-
772}
\n-
\n-
773
\n-
774//
\n-
775// StencilTable access -- backward compatible and generic:
\n-
776//
\n-
777inline StencilTable const *
\n-
\n-\n-
779 assert(LocalPointStencilPrecisionMatchesType<float>());
\n-
780 return static_cast<StencilTable const *>(_localPointStencils.Get<float>());
\n-
781}
\n-
\n-
782inline StencilTable const *
\n-
\n-\n-
784 assert(LocalPointVaryingStencilPrecisionMatchesType<float>());
\n-
785 return static_cast<StencilTable const *>(
\n-
786 _localPointVaryingStencils.Get<float>());
\n-
787}
\n-
\n-
788inline StencilTable const *
\n-
\n-\n-
790 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<float>());
\n-
791 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n-
792 return static_cast<StencilTable const *>(
\n-
793 _localPointFaceVaryingStencils[channel].Get<float>());
\n-
794 }
\n-
795 return NULL;
\n-
796}
\n-
\n-
797
\n-
798template <typename REAL>
\n-
799inline StencilTableReal<REAL> const *
\n-
\n-\n-
801 assert(LocalPointStencilPrecisionMatchesType<REAL>());
\n-
802 return _localPointStencils.Get<REAL>();
\n-
803}
\n-
\n-
804template <typename REAL>
\n-
805inline StencilTableReal<REAL> const *
\n-
\n-\n-
807 assert(LocalPointVaryingStencilPrecisionMatchesType<REAL>());
\n-
808 return _localPointVaryingStencils.Get<REAL>();
\n-
809}
\n-
\n-
810template <typename REAL>
\n-
811inline StencilTableReal<REAL> const *
\n-
\n-\n-
813 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<REAL>());
\n-
814 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n-
815 return _localPointFaceVaryingStencils[channel].Get<REAL>();
\n-
816 }
\n-
817 return NULL;
\n-
818}
\n-
\n-
819
\n-
820
\n-
821//
\n-
822// Computation of local point values:
\n-
823//
\n-
824template <class T>
\n-
825inline void
\n-
\n-
826PatchTable::ComputeLocalPointValues(T const *src, T *dst) const {
\n-
827 assert(LocalPointStencilPrecisionMatchesType<float>());
\n-
828 if (_localPointStencils) {
\n-
829 _localPointStencils.Get<float>()->UpdateValues(src, dst);
\n-
830 }
\n-
831}
\n-
\n-
832
\n-
833template <class T>
\n-
834inline void
\n-
\n-\n-
836 assert(LocalPointVaryingStencilPrecisionMatchesType<float>());
\n-
837 if (_localPointVaryingStencils) {
\n-
838 _localPointVaryingStencils.Get<float>()->UpdateValues(src, dst);
\n-
839 }
\n-
840}
\n-
\n-
841
\n-
842template <class T>
\n-
843inline void
\n-
\n-
844PatchTable::ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel) const {
\n-
845 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<float>());
\n-
846 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n-
847 if (_localPointFaceVaryingStencils[channel]) {
\n-
848 _localPointFaceVaryingStencils[channel].Get<float>()->UpdateValues(src, dst);
\n-
849 }
\n-
850 }
\n-
851}
\n-
\n-
852
\n-
853
\n-
854//
\n-
855// Basis evaluation overloads
\n-
856//
\n-
857inline void
\n-
\n-
858PatchTable::EvaluateBasis(PatchHandle const & handle, float u, float v,
\n-
859 float wP[], float wDu[], float wDv[],
\n-
860 float wDuu[], float wDuv[], float wDvv[]) const {
\n-
861
\n-
862 EvaluateBasis<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n-
863}
\n-
\n-
864inline void
\n-
\n-
865PatchTable::EvaluateBasis(PatchHandle const & handle, double u, double v,
\n-
866 double wP[], double wDu[], double wDv[],
\n-
867 double wDuu[], double wDuv[], double wDvv[]) const {
\n-
868
\n-
869 EvaluateBasis<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n-
870}
\n-
\n-
871
\n-
872inline void
\n-
\n-
873PatchTable::EvaluateBasisVarying(PatchHandle const & handle, float u, float v,
\n-
874 float wP[], float wDu[], float wDv[],
\n-
875 float wDuu[], float wDuv[], float wDvv[]) const {
\n-
876
\n-
877 EvaluateBasisVarying<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n-
878}
\n-
\n-
879inline void
\n-
\n-
880PatchTable::EvaluateBasisVarying(PatchHandle const & handle, double u, double v,
\n-
881 double wP[], double wDu[], double wDv[],
\n-
882 double wDuu[], double wDuv[], double wDvv[]) const {
\n-
883
\n-
884 EvaluateBasisVarying<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n-
885}
\n-
\n-
886
\n-
887inline void
\n-
\n-
888PatchTable::EvaluateBasisFaceVarying(PatchHandle const & handle, float u, float v,
\n-
889 float wP[], float wDu[], float wDv[],
\n-
890 float wDuu[], float wDuv[], float wDvv[], int channel) const {
\n-
891
\n-
892 EvaluateBasisFaceVarying<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv, channel);
\n-
893}
\n-
\n-
894inline void
\n-
\n-
895PatchTable::EvaluateBasisFaceVarying(PatchHandle const & handle, double u, double v,
\n-
896 double wP[], double wDu[], double wDv[],
\n-
897 double wDuu[], double wDuv[], double wDvv[], int channel) const {
\n-
898
\n-
899 EvaluateBasisFaceVarying<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv, channel);
\n-
900}
\n-
\n-
901
\n-
902} // end namespace Far
\n-
903
\n-
904} // end namespace OPENSUBDIV_VERSION
\n-
905using namespace OPENSUBDIV_VERSION;
\n-
906
\n-
907} // end namespace OpenSubdiv
\n-
908
\n-
909#endif /* OPENSUBDIV3_FAR_PATCH_TABLE */
\n+
223 if (node->children[quadrant].isLeaf) {
\n+
224 return &_handles[node->children[quadrant].index];
\n+
225 } else {
\n+
226 node = &_quadtree[node->children[quadrant].index];
\n+
227 }
\n+
228 }
\n+
229 assert(0);
\n+
230 return 0;
\n+
231}
\n+
\n+
232
\n+
233} // end namespace Far
\n+
234
\n+
235} // end namespace OPENSUBDIV_VERSION
\n+
236using namespace OPENSUBDIV_VERSION;
\n+
237
\n+
238} // end namespace OpenSubdiv
\n+
239
\n+
240#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */
\n \n-
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n-
std::vector< PatchParam > PatchParamTable
Definition patchParam.h:243
\n-\n-\n-
Vtr::Array< PatchParam > PatchParamArray
Definition patchParam.h:245
\n-
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-\n-
An quadtree-based map connecting coarse faces to their sub-patches.
Definition patchMap.h:49
\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-
ConstIndexArray GetPatchArrayVaryingVertices(int array) const
Returns the varying vertex indices for the patches in array.
\n-\n-
PatchVertsTable const & GetPatchControlVerticesTable() const
Get the table of patch control vertices.
Definition patchTable.h:378
\n-
void ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel=0) const
Updates local point face-varying values.
Definition patchTable.h:844
\n-
ConstIndexArray GetVaryingVertices() const
Returns an array of varying vertex indices for the patches.
\n-
void ComputeLocalPointValuesVarying(T const *src, T *dst) const
Updates local point varying values.
Definition patchTable.h:835
\n-
ConstIndexArray GetPatchVaryingVertices(PatchHandle const &handle) const
Returns the varying vertex indices for a given patch.
\n-
bool IsFeatureAdaptive() const
True if the patches are of feature adaptive types.
\n-
int GetMaxValence() const
Returns max vertex valence.
Definition patchTable.h:92
\n-
StencilTableReal< REAL > const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
\n-
StencilTable const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
Definition patchTable.h:778
\n-
PatchParamArray getPatchParams(int arrayIndex)
\n-
ConstIndexArray GetPatchArrayFVarValues(int array, int channel=0) const
Returns the value indices for the patches in array in channel.
\n-
std::vector< float > const & GetSharpnessValues() const
Returns sharpness values table.
Definition patchTable.h:387
\n-\n-
PatchParam GetPatchFVarPatchParam(int array, int patch, int channel=0) const
Returns the face-varying params for a given patch channel.
\n-
ConstIndexArray GetPatchVaryingVertices(int array, int patch) const
Returns the varying vertex indices for a given patch.
\n-
PatchTable(PatchTable const &src)
Copy constructor.
\n-
int GetNumPatchArrays() const
Returns the number of patch arrays in the table.
\n-
ConstIndexArray GetPatchVertices(PatchHandle const &handle) const
Returns the control vertex indices for the patch identified by handle.
\n-\n-
bool LocalPointFaceVaryingStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point face-varying values matches the gi...
\n-
PatchParamTable const & GetPatchParamTable() const
Returns the PatchParamTable (PatchParams order matches patch array sorting)
Definition patchTable.h:381
\n-
VertexValenceTable const & GetVertexValenceTable() const
Returns the 'VertexValences' table (vertex neighborhoods table)
Definition patchTable.h:267
\n-
StencilTable const * GetLocalPointFaceVaryingStencilTable(int channel=0) const
Returns the stencil table to compute local point face-varying values.
Definition patchTable.h:789
\n-
int GetNumControlVertices(int array) const
Returns the number of control vertices in array.
\n-\n-
void EvaluateBasisFaceVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0, int channel=0) const
Evaluate basis functions for a face-varying value and derivatives at a given (u,v) parametric locatio...
\n-
ConstQuadOffsetsArray GetPatchQuadOffsets(PatchHandle const &handle) const
Returns the 'QuadOffsets' for the Gregory patch identified by handle.
\n-
PatchDescriptor GetFVarPatchDescriptorIrregular(int channel=0) const
Returns the irregular patch descriptor for channel.
\n-
float GetSingleCreasePatchSharpnessValue(int array, int patch) const
Returns the crease sharpness for the patch in array if it is a single-crease patch,...
\n-\n-
void ComputeLocalPointValues(T const *src, T *dst) const
Updates local point vertex values.
Definition patchTable.h:826
\n-
float GetSingleCreasePatchSharpnessValue(PatchHandle const &handle) const
Returns the crease sharpness for the patch identified by handle if it is a single-crease patch,...
\n-
PatchParam GetPatchParam(int array, int patch) const
Returns the PatchParam for patch in array.
\n-
ConstIndexArray GetPatchFVarValues(int array, int patch, int channel=0) const
Returns the value indices for a given patch in channel.
\n-
PatchDescriptor GetFVarPatchDescriptorRegular(int channel=0) const
Returns the regular patch descriptor for channel.
\n-
PatchDescriptor GetPatchDescriptor(PatchHandle const &handle) const
Returns the PatchDescriptor for the patch identified by handle.
\n-\n-
QuadOffsetsTable const & GetQuadOffsetsTable() const
Returns the quad-offsets table.
Definition patchTable.h:392
\n-
int GetNumPatches(int array) const
Returns the number of patches in array.
\n-
PatchDescriptor GetVaryingPatchDescriptor() const
Returns the varying patch descriptor.
\n-
ConstIndexArray GetPatchFVarValues(PatchHandle const &handle, int channel=0) const
Returns the value indices for a given patch in channel.
\n-
ConstPatchParamArray const GetPatchParams(int array) const
Returns the PatchParams for the patches in array.
\n-
int GetNumControlVerticesTotal() const
Returns the total number of control vertex indices in the table.
Definition patchTable.h:84
\n-
int GetNumFVarChannels() const
Returns the number of face-varying channels.
\n-
ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel=0) const
Returns the face-varying for a given patch in array in channel.
\n-
Index getPatchIndex(int array, int patch) const
\n-
int GetNumLocalPoints() const
Returns the number of local vertex points.
\n-
bool LocalPointVaryingStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point varying values matches the given f...
\n-
ConstIndexArray GetPatchArrayVertices(int array) const
Returns the control vertex indices for the patches in array.
\n-
int GetNumPtexFaces() const
Returns the total number of ptex faces in the mesh.
Definition patchTable.h:95
\n-
ConstIndexArray GetFVarValues(int channel=0) const
Returns an array of value indices for the patches in channel.
\n-
Vtr::ConstArray< unsigned int > ConstQuadOffsetsArray
Accessors for the gregory patch evaluation buffers. These methods will be deprecated.
Definition patchTable.h:259
\n-
void EvaluateBasis(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const
Evaluate basis functions for position and derivatives at a given (u,v) parametric location of a patch...
\n-
StencilTableReal< REAL > const * GetLocalPointFaceVaryingStencilTable(int channel=0) const
Returns the stencil table to compute local point face-varying values.
\n-
int GetNumPatchesTotal() const
Returns the total number of patches stored in the table.
\n-
PatchParam GetPatchParam(PatchHandle const &handle) const
Returns a PatchParam for the patch identified by handle.
\n-\n-
Sdc::Options::FVarLinearInterpolation GetFVarChannelLinearInterpolation(int channel=0) const
Deprecated.
\n-
std::vector< Index > const & GetSharpnessIndexTable() const
Returns a sharpness index table for each patch (if exists)
Definition patchTable.h:384
\n-
PatchDescriptor GetPatchArrayDescriptor(int array) const
Returns the PatchDescriptor for the patches in array.
\n-\n-
void EvaluateBasisVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const
Evaluate basis functions for a varying value and derivatives at a given (u,v) parametric location of ...
\n-
StencilTable const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
Definition patchTable.h:783
\n-
std::vector< unsigned int > QuadOffsetsTable
Definition patchTable.h:389
\n-
ConstIndexArray GetPatchVertices(int array, int patch) const
Returns the control vertex indices for patch in array.
\n-
PatchParam GetPatchFVarPatchParam(PatchHandle const &handle, int channel=0) const
Returns the value indices for a given patch in channel.
\n-
int GetFVarValueStride(int channel=0) const
Returns the stride between patches in the value index array of channel.
\n-
ConstPatchParamArray GetFVarPatchParams(int channel=0) const
Returns an array of face-varying patch param for channel.
\n-
PatchDescriptor GetFVarPatchDescriptor(int channel=0) const
Returns the default/irregular patch descriptor for channel.
\n-
int GetNumLocalPointsVarying() const
Returns the number of local varying points.
\n-
bool LocalPointStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point vertex values matches the given fl...
\n-
StencilTableReal< REAL > const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
\n-
int GetNumLocalPointsFaceVarying(int channel=0) const
Returns the number of local face-varying points for channel.
\n-
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n-\n-\n-\n-\n-
Stencil table class wrapping the template for compatibility.
\n-\n-\n-\n+
An quadtree-based map connecting coarse faces to their sub-patches.
Definition patchMap.h:49
\n+
PatchMap(PatchTable const &patchTable)
Constructor.
\n+
Handle const * FindPatch(int patchFaceId, double u, double v) const
Returns a handle to the sub-patch of the face at the given (u,v). Note that the patch face ID corresp...
Definition patchMap.h:193
\n+\n+\n+\n+\n+\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchTable.h\n+patchMap.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,1002 +24,238 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_H\n-26#define OPENSUBDIV3_FAR_PATCH_TABLE_H\n+25#ifndef OPENSUBDIV3_FAR_PATCH_MAP_H\n+26#define OPENSUBDIV3_FAR_PATCH_MAP_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../far/patchDescriptor.h\"\n-31#include \"../far/patchParam.h\"\n-32#include \"../far/stencilTable.h\"\n+30#include \"../far/patchTable.h\"\n+31\n+32#include \n 33\n-34#include \"../sdc/options.h\"\n-35\n-36#include \n-37\n-38namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-39namespace OPENSUBDIV_VERSION {\n-40\n-41namespace Far {\n-42\n-_\b5_\b5class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be {\n-56\n-57public:\n-58\n-_\b6_\b0 class _\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be {\n-61 // XXXX manuelk members will eventually be made private\n-62 public:\n-63\n-_\b6_\b4 friend class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be;\n-_\b6_\b5 friend class _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp;\n-66\n-_\b6_\b7 _\bI_\bn_\bd_\be_\bx _\ba_\br_\br_\ba_\by_\bI_\bn_\bd_\be_\bx, // Array index of the patch\n-_\b6_\b8 _\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx, // Absolute Index of the patch\n-_\b6_\b9 _\bv_\be_\br_\bt_\bI_\bn_\bd_\be_\bx; // Relative offset to the first CV of the patch in array\n-70 };\n-71\n-72public:\n-73\n-_\b7_\b5 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & src);\n-76\n-_\b7_\b8 _\b~_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38\n+_\b4_\b9class _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp {\n+50public:\n+51\n+_\b5_\b2 typedef _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be _\bH_\ba_\bn_\bd_\bl_\be;\n+53\n+_\b5_\b8 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp( _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable );\n+59\n+74 _\bH_\ba_\bn_\bd_\bl_\be const * _\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh( int patchFaceId, double u, double v ) const;\n+75\n+76private:\n+77 void initializeHandles(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable);\n+78 void initializeQuadtree(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable);\n 79\n-_\b8_\b1 bool _\bI_\bs_\bF_\be_\ba_\bt_\bu_\br_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be() const;\n-82\n-_\b8_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl() const {\n-85 return (int)_patchVerts.size();\n-86 }\n-87\n-_\b8_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bT_\bo_\bt_\ba_\bl() const;\n+80private:\n+81 // Quadtree node with 4 children, tree is just a vector of nodes\n+82 struct QuadNode {\n+83 QuadNode() { std::memset(this, 0, sizeof(QuadNode)); }\n+84\n+_\b8_\b5 struct _\bC_\bh_\bi_\bl_\bd {\n+_\b8_\b6 unsigned int _\bi_\bs_\bS_\be_\bt : 1; // true if the child has been set\n+_\b8_\b7 unsigned int _\bi_\bs_\bL_\be_\ba_\bf : 1; // true if the child is a QuadNode\n+_\b8_\b8 unsigned int _\bi_\bn_\bd_\be_\bx : 30; // child index (either QuadNode or Handle)\n+89 };\n 90\n-_\b9_\b2 int _\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() const { return _maxValence; }\n+91 // sets all the children to point to the patch of given index\n+92 void SetChildren(int index);\n 93\n-_\b9_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs() const { return _numPtexFaces; }\n+94 // sets the child in \"quadrant\" to point to the node or patch of the given\n+index\n+95 void SetChild(int quadrant, int index, bool isLeaf);\n 96\n-97\n-99\n-105\n-_\b1_\b0_\b7 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n-108\n-_\b1_\b1_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n-111\n-_\b1_\b1_\b3 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n-114\n-_\b1_\b1_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array, int patch) const;\n-117\n-_\b1_\b1_\b9 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(int array, int patch) const;\n-121\n-122\n-124\n-130\n-_\b1_\b3_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const;\n-133\n-_\b1_\b3_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs(int array) const;\n-136\n-_\b1_\b3_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n-139\n-_\b1_\b4_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int array) const;\n-142\n-_\b1_\b4_\b4 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n-145\n-_\b1_\b4_\b7 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by const _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int array) const;\n-149\n+97 _\bC_\bh_\bi_\bl_\bd children[4];\n+98 };\n+99 typedef std::vector QuadTree;\n+100\n+101 // Internal methods supporting quadtree construction and queries\n+102 void assignRootNode(QuadNode * node, int index);\n+103 QuadNode * assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quad,\n+int index);\n+104\n+105 template \n+106 static int transformUVToQuadQuadrant(T const & median, T & u, T & v);\n+107 template \n+108 static int transformUVToTriQuadrant(T const & median, T & u, T & v, bool &\n+rotated);\n+109\n+110private:\n+111 bool _patchesAreTriangular; // tri and quad assembly and search\n+requirements differ\n+112\n+113 int _minPatchFace; // minimum patch face index supported by the map\n+114 int _maxPatchFace; // maximum patch face index supported by the map\n+115 int _maxDepth; // maximum depth of a patch in the tree\n+116\n+117 std::vector _handles; // all the patches in the PatchTable\n+118 std::vector _quadtree; // quadtree nodes\n+119};\n+120\n+121//\n+122// Given a median value for both U and V, these methods transform a (u,v)\n+pair\n+123// into the quadrant that contains them and returns the quadrant index.\n+124//\n+125// Quadrant indexing for tri and quad patches -- consistent with\n+PatchParam's\n+126// usage of UV bits:\n+127//\n+128// (0,1) o-----o-----o (1,1) (0,1) o (1,0) o-----o-----o (0,0)\n+129// | | | |\\ \\ 1 |\\ 0 |\n+130// | 2 | 3 | | \\ \\ | \\ |\n+131// | | | | 2 \\ \\| 3 \\|\n+132// o-----o-----o o-----o o-----o\n+133// | | | |\\ 3 |\\ \\ 2 |\n+134// | 0 | 1 | | \\ | \\ \\ |\n+135// | | | | 0 \\| 1 \\ \\|\n+136// (0,0) o-----o-----o (1,0) (0,0) o-----o-----o (1,0) o (0,1)\n+137//\n+138// The triangular case also takes and returns/affects the rotation of the\n+139// quadrant being searched and identified (quadrant 3 imparts a rotation).\n+140//\n+141template \n+142inline int\n+143PatchMap::transformUVToQuadQuadrant(T const & median, T & u, T & v) {\n+144\n+145 int uHalf = (u >= median);\n+146 if (uHalf) u -= median;\n+147\n+148 int vHalf = (v >= median);\n+149 if (vHalf) v -= median;\n 150\n-152\n-159\n-_\b1_\b6_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs() const;\n-162\n-164 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n-165\n-167 template \n-_\b1_\b6_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n-169\n-_\b1_\b7_\b2 template bool _\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be()\n-const;\n-173\n-186 template void\n-187 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs(T const *src, T *dst) const;\n-188\n-189\n-_\b1_\b9_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg() const;\n-192\n-194 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n-195\n-197 template \n-_\b1_\b9_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n-199\n-_\b2_\b0_\b2 template bool _\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n-() const;\n+151 return (vHalf << 1) | uHalf;\n+152}\n+153\n+154template \n+155int inline\n+156PatchMap::transformUVToTriQuadrant(T const & median, T & u, T & v, bool &\n+rotated) {\n+157\n+158 if (!rotated) {\n+159 if (u >= median) {\n+160 u -= median;\n+161 return 1;\n+162 }\n+163 if (v >= median) {\n+164 v -= median;\n+165 return 2;\n+166 }\n+167 if ((u + v) >= median) {\n+168 rotated = true;\n+169 return 3;\n+170 }\n+171 return 0;\n+172 } else {\n+173 if (u < median) {\n+174 v -= median;\n+175 return 1;\n+176 }\n+177 if (v < median) {\n+178 u -= median;\n+179 return 2;\n+180 }\n+181 u -= median;\n+182 v -= median;\n+183 if ((u + v) < median) {\n+184 rotated = false;\n+185 return 3;\n+186 }\n+187 return 0;\n+188 }\n+189}\n+190\n+192inline _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bH_\ba_\bn_\bd_\bl_\be const *\n+_\b1_\b9_\b3_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh( int faceid, double u, double v ) const {\n+194\n+195 //\n+196 // Reject patch faces not supported by this map, or those corresponding\n+197 // to holes or otherwise unassigned (the root node for a patch will\n+198 // have all or no quadrants set):\n+199 //\n+200 if ((faceid < _minPatchFace) || (faceid > _maxPatchFace)) return 0;\n+201\n+202 QuadNode const * node = &_quadtree[faceid - _minPatchFace];\n 203\n-216 template void\n-217 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst) const;\n-218\n+204 if (!node->children[0].isSet) return 0;\n+205\n+206 //\n+207 // Search the tree for the sub-patch containing the given (u,v)\n+208 //\n+209 assert( (u>=0.0) && (u<=1.0) && (v>=0.0) && (v<=1.0) );\n+210\n+211 double median = 0.5;\n+212 bool triRotated = false;\n+213\n+214 for (int depth = 0; depth <= _maxDepth; ++depth, median *= 0.5) {\n+215\n+216 int quadrant = _patchesAreTriangular\n+217 ? transformUVToTriQuadrant(median, u, v, triRotated)\n+218 : transformUVToQuadQuadrant(median, u, v);\n 219\n-_\b2_\b2_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int channel = 0) const;\n+220 // holes should have been rejected at the root node of the face\n+221 assert(node->children[quadrant].isSet);\n 222\n-224 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel = 0)\n-const;\n-225\n-227 template \n-_\b2_\b2_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int\n-channel = 0) const;\n-229\n-_\b2_\b3_\b2 template bool\n-_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be() const;\n-233\n-248 template void\n-249 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst, int channel = 0)\n-const;\n-251\n-252\n-254\n-255\n-_\b2_\b5_\b9 typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bu_\bn_\bs_\bi_\bg_\bn_\be_\bd_\b _\bi_\bn_\bt_\b> _\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by;\n-260\n-_\b2_\b6_\b2 _\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle)\n-const;\n-263\n-_\b2_\b6_\b4 typedef std::vector _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be;\n-265\n-_\b2_\b6_\b7 _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be() const {\n-268 return _vertexValenceTable;\n-269 }\n-271\n-272\n-274\n-280\n-_\b2_\b8_\b3 float _\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n-284\n-_\b2_\b8_\b7 float _\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be(int array, int patch) const;\n-289\n-290\n-292\n-298\n-_\b3_\b0_\b0 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() const;\n-301\n-_\b3_\b0_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n-304\n-_\b3_\b0_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array, int patch) const;\n-307\n-_\b3_\b0_\b9 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n-310\n-_\b3_\b1_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n-314\n-315\n-317\n-323\n-_\b3_\b2_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const;\n-326\n-_\b3_\b2_\b8 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bR_\be_\bg_\bu_\bl_\ba_\br(int channel = 0) const;\n-329\n-_\b3_\b3_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bI_\br_\br_\be_\bg_\bu_\bl_\ba_\br(int channel = 0) const;\n-332\n-_\b3_\b3_\b4 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int channel = 0) const;\n-335\n-_\b3_\b3_\b7 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, int channel\n-= 0) const;\n-338\n-_\b3_\b4_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int array, int patch, int channel = 0)\n-const;\n-341\n-_\b3_\b4_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int array, int channel = 0) const;\n-344\n-_\b3_\b4_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int channel = 0) const;\n-347\n-_\b3_\b4_\b9 int _\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bS_\bt_\br_\bi_\bd_\be(int channel = 0) const;\n-350\n-_\b3_\b5_\b2 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, int channel =\n-0) const;\n-353\n-_\b3_\b5_\b5 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(int array, int patch, int channel = 0)\n-const;\n-356\n-_\b3_\b5_\b8 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int array, int channel =\n-0) const;\n-359\n-_\b3_\b6_\b1 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int channel = 0) const;\n-362\n-_\b3_\b6_\b4 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn(int\n-channel = 0) const;\n-366\n-367\n-369\n-374\n-_\b3_\b7_\b5 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be;\n-376\n-_\b3_\b7_\b8 _\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\ba_\bb_\bl_\be() const { return\n-_patchVerts; }\n-379\n-_\b3_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be() const { return _paramTable; }\n-382\n-_\b3_\b8_\b4 std::vector const &_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\be_\bx_\bT_\ba_\bb_\bl_\be() const { return\n-_sharpnessIndices; }\n-385\n-_\b3_\b8_\b7 std::vector const &_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs() const { return\n-_sharpnessValues; }\n-388\n-_\b3_\b8_\b9 typedef std::vector _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be;\n-390\n-_\b3_\b9_\b2 _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be() const {\n-393 return _quadOffsetsTable;\n-394 }\n-396\n-_\b3_\b9_\b8 void _\bp_\br_\bi_\bn_\bt() const;\n-399\n-400public:\n-401\n-403\n-405\n-428 template \n-_\b4_\b2_\b9 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n-430 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n-431 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;\n-432\n-435 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n-436 float wP[], float wDu[] = 0, float wDv[] = 0,\n-437 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;\n-438\n-441 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n-442 double wP[], double wDu[] = 0, double wDv[] = 0,\n-443 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;\n-444\n-467 template \n-_\b4_\b6_\b8 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n-469 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n-470 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;\n-471\n-474 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n-475 float wP[], float wDu[] = 0, float wDv[] = 0,\n-476 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;\n-477\n-480 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n-481 double wP[], double wDu[] = 0, double wDv[] = 0,\n-482 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;\n-483\n-508 template \n-_\b5_\b0_\b9 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n-510 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n-511 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0,\n-512 int channel = 0) const;\n-513\n-516 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n-517 float wP[], float wDu[] = 0, float wDv[] = 0,\n-518 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0,\n-519 int channel = 0) const;\n-520\n-523 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double\n-v,\n-524 double wP[], double wDu[] = 0, double wDv[] = 0,\n-525 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0,\n-526 int channel = 0) const;\n-528\n-529protected:\n-530\n-_\b5_\b3_\b1 friend class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br;\n-532\n-533 // Factory constructor\n-_\b5_\b3_\b4 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be(int maxvalence);\n-535\n-_\b5_\b3_\b6 _\bI_\bn_\bd_\be_\bx _\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx(int array, int patch) const;\n-537\n-_\b5_\b3_\b8 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int arrayIndex);\n-539\n-_\b5_\b4_\b0 _\bI_\bn_\bd_\be_\bx * _\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx arrayIndex);\n-_\b5_\b4_\b1 float * _\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs(_\bI_\bn_\bd_\be_\bx arrayIndex);\n-542\n-543private:\n-544\n-545 //\n-546 // Patch arrays\n-547 //\n-548 struct PatchArray {\n-549 PatchArray(_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br d, int np, _\bI_\bn_\bd_\be_\bx v, _\bI_\bn_\bd_\be_\bx p, _\bI_\bn_\bd_\be_\bx qo) :\n-550 desc(d), numPatches(np), vertIndex(v),\n-551 patchIndex(p), quadOffsetIndex (qo) { }\n-552\n-553 void print() const;\n-554\n-555 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br desc; // type of patches in the array\n-556\n-557 int numPatches; // number of patches in the array\n-558\n-559 _\bI_\bn_\bd_\be_\bx vertIndex, // index to the first control vertex\n-560 patchIndex, // absolute index of the first patch in the array\n-561 quadOffsetIndex; // index of the first quad offset entry\n-562 };\n-563\n-564 typedef std::vector PatchArrayVector;\n-565\n-566 PatchArray & getPatchArray(_\bI_\bn_\bd_\be_\bx arrayIndex);\n-567 PatchArray const & getPatchArray(_\bI_\bn_\bd_\be_\bx arrayIndex) const;\n-568\n-569 void reservePatchArrays(int numPatchArrays);\n-570 void pushPatchArray(PatchDescriptor desc, int npatches,\n-571 _\bI_\bn_\bd_\be_\bx * vidx, _\bI_\bn_\bd_\be_\bx * pidx, _\bI_\bn_\bd_\be_\bx * qoidx=0);\n-572\n-573 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchArrayVertices(int arrayIndex);\n-574\n-575 _\bI_\bn_\bd_\be_\bx findPatchArray(PatchDescriptor desc);\n-576\n-577\n-578 //\n-579 // Varying patch arrays\n-580 //\n-581 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchArrayVaryingVertices(int arrayIndex);\n-582\n-583 void allocateVaryingVertices(\n-584 PatchDescriptor desc, int numPatches);\n-585 void populateVaryingVertices();\n-586\n-587 //\n-588 // Face-varying patch channels\n-589 //\n-590\n-591 //\n-592 // FVarPatchChannel\n-593 //\n-594 // Stores a record for each patch in the primitive :\n-595 //\n-596 // - Each patch in the PatchTable has a corresponding patch in each\n-597 // face-varying patch channel. Patch vertex indices are sorted in the same\n-598 // patch-type order as PatchTable::PTables. Face-varying data for a patch\n-599 // can therefore be quickly accessed by using the patch primitive ID as\n-600 // index into patchValueOffsets to locate the face-varying control vertex\n-601 // indices.\n-602 //\n-603 // - Face-varying channels can have a different interpolation modes\n-604 //\n-605 // - Unlike \"vertex\" patches, there are no transition masks required\n-606 // for face-varying patches.\n-607 //\n-608 // - Face-varying patches still require boundary edge masks.\n-609 //\n-610 // - currently most patches with sharp boundaries but smooth interiors have\n-611 // to be isolated to level 10 : we need a special type of bicubic patch\n-612 // similar to single-crease to resolve this condition without requiring\n-613 // isolation if possible\n-614 //\n-615 struct FVarPatchChannel {\n-616 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn interpolation;\n-617\n-618 PatchDescriptor regDesc;\n-619 PatchDescriptor irregDesc;\n-620\n-621 int stride;\n-622\n-623 std::vector patchValues;\n-624 std::vector patchParam;\n-625 };\n-626 typedef std::vector FVarPatchChannelVector;\n-627\n-628 FVarPatchChannel & getFVarPatchChannel(int channel);\n-629 FVarPatchChannel const & getFVarPatchChannel(int channel) const;\n-630\n-631 void allocateFVarPatchChannels(int numChannels);\n-632 void allocateFVarPatchChannelValues(\n-633 PatchDescriptor regDesc, PatchDescriptor irregDesc,\n-634 int numPatches, int channel);\n-635\n-636 // deprecated\n-637 void setFVarPatchChannelLinearInterpolation(\n-638 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn interpolation, int channel);\n-639\n-640 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFVarValues(int channel);\n-641 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchFVarValues(int patch, int channel) const;\n-642\n-643 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by getFVarPatchParams(int channel);\n-644 PatchParam getPatchFVarPatchParam(int patch, int channel) const;\n-645\n-646private:\n-647 //\n-648 // Simple private class to hold stencil table pointers of varying\n-precision,\n-649 // where the discriminant of the precision is external.\n-650 //\n-651 // NOTE that this is a simple pointer container and NOT a smart pointer\n-that\n-652 // manages the ownership of the object referred to by it.\n-653 //\n-654 class StencilTablePtr {\n-655 private:\n-656 typedef StencilTableReal float_type;\n-657 typedef StencilTableReal double_type;\n-658\n-659 union {\n-660 float_type * _fPtr;\n-661 double_type * _dPtr;\n-662 };\n-663\n-664 public:\n-665 StencilTablePtr() { _fPtr = 0; }\n-666 StencilTablePtr(float_type * ptr) { _fPtr = ptr; }\n-667 StencilTablePtr(double_type * ptr) { _dPtr = ptr; }\n-668\n-669 operator bool() const { return _fPtr != 0; }\n-670\n-671 void Set() { _fPtr = 0; }\n-672 void Set(float_type * ptr) { _fPtr = ptr; }\n-673 void Set(double_type * ptr) { _dPtr = ptr; }\n-674\n-675 template StencilTableReal * Get() const;\n-676 };\n-677\n-678private:\n-679\n-680 //\n-681 // Topology\n-682 //\n-683\n-684 int _maxValence, // highest vertex valence found in the mesh\n-685 _numPtexFaces; // total number of ptex faces\n-686\n-687 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _patchArrays; // Vector of descriptors for arrays of\n-patches\n-688\n-689 std::vector _patchVerts; // Indices of the control vertices of the\n-patches\n-690\n-691 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be _paramTable; // PatchParam bitfields (one per patch)\n-692\n-693 //\n-694 // Extraordinary vertex closed-form evaluation / endcap basis conversion\n-695 //\n-696 // XXXtakahito: these data will probably be replaced with mask coefficient\n-or something\n-697 // SchemeWorker populates.\n-698 //\n-699 _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be _quadOffsetsTable; // Quad offsets (for Gregory patches)\n-700 _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be _vertexValenceTable; // Vertex valence table (for\n-Gregory patches)\n-701\n-702 StencilTablePtr _localPointStencils; // local point conversion stencils\n-703 StencilTablePtr _localPointVaryingStencils; // local point varying stencils\n-704\n-705 //\n-706 // Varying data\n-707 //\n-708 PatchDescriptor _varyingDesc;\n-709\n-710 std::vector _varyingVerts;\n-711\n-712 //\n-713 // Face-varying data\n-714 //\n-715 FVarPatchChannelVector _fvarChannels;\n-716\n-717 std::vector _localPointFaceVaryingStencils;\n-718\n-719 //\n-720 // 'single-crease' patch sharpness tables\n-721 //\n-722 std::vector _sharpnessIndices; // Indices of single-crease sharpness\n-(one per patch)\n-723 std::vector _sharpnessValues; // Sharpness values.\n-724\n-725 //\n-726 // Construction history -- relevant to at least one public query:\n-727 //\n-728 unsigned int _isUniformLinear : 1;\n-729\n-730 //\n-731 // Precision -- only applies to local-point stencil tables\n-732 //\n-733 unsigned int _vertexPrecisionIsDouble : 1;\n-734 unsigned int _varyingPrecisionIsDouble : 1;\n-735 unsigned int _faceVaryingPrecisionIsDouble : 1;\n-736};\n-737\n-738\n-739//\n-740// Template specializations for float/double -- to be defined before used:\n-741//\n-742template <> inline StencilTableReal *\n-743PatchTable::StencilTablePtr::Get() const { return _fPtr; }\n-744\n-745template <> inline StencilTableReal *\n-746PatchTable::StencilTablePtr::Get() const { return _dPtr; }\n-747\n-_\b7_\b4_\b8template <> inline bool\n-749PatchTable::LocalPointStencilPrecisionMatchesType() const {\n-750 return !_vertexPrecisionIsDouble;\n-751}\n-_\b7_\b5_\b2template <> inline bool\n-753PatchTable::LocalPointVaryingStencilPrecisionMatchesType() const {\n-754 return !_varyingPrecisionIsDouble;\n-755}\n-_\b7_\b5_\b6template <> inline bool\n-757PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType() const\n-{\n-758 return !_faceVaryingPrecisionIsDouble;\n-759}\n-760\n-_\b7_\b6_\b1template <> inline bool\n-762PatchTable::LocalPointStencilPrecisionMatchesType() const {\n-763 return _vertexPrecisionIsDouble;\n-764}\n-_\b7_\b6_\b5template <> inline bool\n-766PatchTable::LocalPointVaryingStencilPrecisionMatchesType() const {\n-767 return _varyingPrecisionIsDouble;\n-768}\n-_\b7_\b6_\b9template <> inline bool\n-770PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType() const\n-{\n-771 return _faceVaryingPrecisionIsDouble;\n-772}\n-773\n-774//\n-775// StencilTable access -- backward compatible and generic:\n-776//\n-777inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n-_\b7_\b7_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n-779 assert(LocalPointStencilPrecisionMatchesType());\n-780 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(_localPointStencils.Get());\n-781}\n-782inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n-_\b7_\b8_\b3_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n-784 assert(LocalPointVaryingStencilPrecisionMatchesType());\n-785 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-786 _localPointVaryingStencils.Get());\n-787}\n-788inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n-_\b7_\b8_\b9_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel) const {\n-790 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n-791 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n-792 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n-793 _localPointFaceVaryingStencils[channel].Get());\n-794 }\n-795 return NULL;\n-796}\n-797\n-798template \n-799inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n-_\b8_\b0_\b0_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n-801 assert(LocalPointStencilPrecisionMatchesType());\n-802 return _localPointStencils.Get();\n-803}\n-804template \n-805inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n-_\b8_\b0_\b6_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n-807 assert(LocalPointVaryingStencilPrecisionMatchesType());\n-808 return _localPointVaryingStencils.Get();\n-809}\n-810template \n-811inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n-_\b8_\b1_\b2_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel) const {\n-813 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n-814 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n-815 return _localPointFaceVaryingStencils[channel].Get();\n-816 }\n-817 return NULL;\n-818}\n-819\n-820\n-821//\n-822// Computation of local point values:\n-823//\n-824template \n-825inline void\n-_\b8_\b2_\b6_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs(T const *src, T *dst) const {\n-827 assert(LocalPointStencilPrecisionMatchesType());\n-828 if (_localPointStencils) {\n-829 _localPointStencils.Get()->UpdateValues(src, dst);\n-830 }\n-831}\n-832\n-833template \n-834inline void\n-_\b8_\b3_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst) const {\n-836 assert(LocalPointVaryingStencilPrecisionMatchesType());\n-837 if (_localPointVaryingStencils) {\n-838 _localPointVaryingStencils.Get()->UpdateValues(src, dst);\n-839 }\n-840}\n-841\n-842template \n-843inline void\n-_\b8_\b4_\b4_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst, int\n-channel) const {\n-845 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n-846 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n-847 if (_localPointFaceVaryingStencils[channel]) {\n-848 _localPointFaceVaryingStencils[channel].Get()->UpdateValues(src,\n-dst);\n-849 }\n-850 }\n-851}\n-852\n-853\n-854//\n-855// Basis evaluation overloads\n-856//\n-857inline void\n-_\b8_\b5_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n-859 float wP[], float wDu[], float wDv[],\n-860 float wDuu[], float wDuv[], float wDvv[]) const {\n-861\n-862 EvaluateBasis(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n-863}\n-864inline void\n-_\b8_\b6_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n-866 double wP[], double wDu[], double wDv[],\n-867 double wDuu[], double wDuv[], double wDvv[]) const {\n-868\n-869 EvaluateBasis(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n-870}\n-871\n-872inline void\n-_\b8_\b7_\b3_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float\n-v,\n-874 float wP[], float wDu[], float wDv[],\n-875 float wDuu[], float wDuv[], float wDvv[]) const {\n-876\n-877 EvaluateBasisVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n-878}\n-879inline void\n-_\b8_\b8_\b0_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u,\n-double v,\n-881 double wP[], double wDu[], double wDv[],\n-882 double wDuu[], double wDuv[], double wDvv[]) const {\n-883\n-884 EvaluateBasisVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n-885}\n-886\n-887inline void\n-_\b8_\b8_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u,\n-float v,\n-889 float wP[], float wDu[], float wDv[],\n-890 float wDuu[], float wDuv[], float wDvv[], int channel) const {\n-891\n-892 EvaluateBasisFaceVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv,\n-wDvv, channel);\n-893}\n-894inline void\n-_\b8_\b9_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u,\n-double v,\n-896 double wP[], double wDu[], double wDv[],\n-897 double wDuu[], double wDuv[], double wDvv[], int channel) const {\n-898\n-899 EvaluateBasisFaceVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv,\n-wDvv, channel);\n-900}\n-901\n-902} // end namespace Far\n-903\n-904} // end namespace OPENSUBDIV_VERSION\n-905using namespace OPENSUBDIV_VERSION;\n-906\n-907} // end namespace OpenSubdiv\n-908\n-909#endif /* OPENSUBDIV3_FAR_PATCH_TABLE */\n+223 if (node->children[quadrant].isLeaf) {\n+224 return &_handles[node->children[quadrant].index];\n+225 } else {\n+226 node = &_quadtree[node->children[quadrant].index];\n+227 }\n+228 }\n+229 assert(0);\n+230 return 0;\n+231}\n+232\n+233} // end namespace Far\n+234\n+235} // end namespace OPENSUBDIV_VERSION\n+236using namespace OPENSUBDIV_VERSION;\n+237\n+238} // end namespace OpenSubdiv\n+239\n+240#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::ConstIndexArray ConstIndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n-std::vector< PatchParam > PatchParamTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n-Vtr::IndexArray IndexArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n-Vtr::Array< PatchParam > PatchParamArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchArray > PatchArrayVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-Describes the type of a patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b4\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n An quadtree-based map connecting coarse faces to their sub-patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-Patch parameterization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n+PatchMap(PatchTable const &patchTable)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh\n+Handle const * FindPatch(int patchFaceId, double u, double v) const\n+Returns a handle to the sub-patch of the face at the given (u,v). Note that the\n+patch face ID corresp...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b1_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bH_\ba_\bn_\bd_\bl_\be\n+PatchTable::PatchHandle Handle\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bs_\bL_\be_\ba_\bf\n+unsigned int isLeaf\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bn_\bd_\be_\bx\n+unsigned int index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bs_\bS_\be_\bt\n+unsigned int isSet\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b6\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n Container for arrays of parametric patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchArrayVaryingVertices(int array) const\n-Returns the varying vertex indices for the patches in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs\n-float * getSharpnessValues(Index arrayIndex)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\ba_\bb_\bl_\be\n-PatchVertsTable const & GetPatchControlVerticesTable() const\n-Get the table of patch control vertices.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel=0)\n-const\n-Updates local point face-varying values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetVaryingVertices() const\n-Returns an array of varying vertex indices for the patches.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void ComputeLocalPointValuesVarying(T const *src, T *dst) const\n-Updates local point varying values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchVaryingVertices(PatchHandle const &handle) const\n-Returns the varying vertex indices for a given patch.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bI_\bs_\bF_\be_\ba_\bt_\bu_\br_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n-bool IsFeatureAdaptive() const\n-True if the patches are of feature adaptive types.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n-int GetMaxValence() const\n-Returns max vertex valence.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTableReal< REAL > const * GetLocalPointStencilTable() const\n-Returns the stencil table to compute local point vertex values.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable const * GetLocalPointStencilTable() const\n-Returns the stencil table to compute local point vertex values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n-PatchParamArray getPatchParams(int arrayIndex)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-ConstIndexArray GetPatchArrayFVarValues(int array, int channel=0) const\n-Returns the value indices for the patches in array in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs\n-std::vector< float > const & GetSharpnessValues() const\n-Returns sharpness values table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be\n-std::vector< Index > VertexValenceTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-PatchParam GetPatchFVarPatchParam(int array, int patch, int channel=0) const\n-Returns the face-varying params for a given patch channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchVaryingVertices(int array, int patch) const\n-Returns the varying vertex indices for a given patch.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-PatchTable(PatchTable const &src)\n-Copy constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-int GetNumPatchArrays() const\n-Returns the number of patch arrays in the table.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchVertices(PatchHandle const &handle) const\n-Returns the control vertex indices for the patch identified by handle.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-PatchTable(int maxvalence)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n-bool LocalPointFaceVaryingStencilPrecisionMatchesType() const\n-Tests if the precision of the stencil table to compute local point face-varying\n-values matches the gi...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n-PatchParamTable const & GetPatchParamTable() const\n-Returns the PatchParamTable (PatchParams order matches patch array sorting)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be\n-VertexValenceTable const & GetVertexValenceTable() const\n-Returns the 'VertexValences' table (vertex neighborhoods table)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable const * GetLocalPointFaceVaryingStencilTable(int channel=0) const\n-Returns the stencil table to compute local point face-varying values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumControlVertices(int array) const\n-Returns the number of control vertices in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-~PatchTable()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void EvaluateBasisFaceVarying(PatchHandle const &handle, REAL u, REAL v, REAL\n-wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0,\n-int channel=0) const\n-Evaluate basis functions for a face-varying value and derivatives at a given\n-(u,v) parametric locatio...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs\n-ConstQuadOffsetsArray GetPatchQuadOffsets(PatchHandle const &handle) const\n-Returns the 'QuadOffsets' for the Gregory patch identified by handle.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bI_\br_\br_\be_\bg_\bu_\bl_\ba_\br\n-PatchDescriptor GetFVarPatchDescriptorIrregular(int channel=0) const\n-Returns the irregular patch descriptor for channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be\n-float GetSingleCreasePatchSharpnessValue(int array, int patch) const\n-Returns the crease sharpness for the patch in array if it is a single-crease\n-patch,...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\bi_\bc_\be_\bs\n-Index * getSharpnessIndices(Index arrayIndex)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs\n-void ComputeLocalPointValues(T const *src, T *dst) const\n-Updates local point vertex values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be\n-float GetSingleCreasePatchSharpnessValue(PatchHandle const &handle) const\n-Returns the crease sharpness for the patch identified by handle if it is a\n-single-crease patch,...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-PatchParam GetPatchParam(int array, int patch) const\n-Returns the PatchParam for patch in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-ConstIndexArray GetPatchFVarValues(int array, int patch, int channel=0) const\n-Returns the value indices for a given patch in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bR_\be_\bg_\bu_\bl_\ba_\br\n-PatchDescriptor GetFVarPatchDescriptorRegular(int channel=0) const\n-Returns the regular patch descriptor for channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor GetPatchDescriptor(PatchHandle const &handle) const\n-Returns the PatchDescriptor for the patch identified by handle.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be\n-std::vector< Index > PatchVertsTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be\n-QuadOffsetsTable const & GetQuadOffsetsTable() const\n-Returns the quad-offsets table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-int GetNumPatches(int array) const\n-Returns the number of patches in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor GetVaryingPatchDescriptor() const\n-Returns the varying patch descriptor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-ConstIndexArray GetPatchFVarValues(PatchHandle const &handle, int channel=0)\n-const\n-Returns the value indices for a given patch in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n-ConstPatchParamArray const GetPatchParams(int array) const\n-Returns the PatchParams for the patches in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumControlVerticesTotal() const\n-Returns the total number of control vertex indices in the table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-Returns the number of face-varying channels.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n-ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel=0)\n-const\n-Returns the face-varying for a given patch in array in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx\n-Index getPatchIndex(int array, int patch) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n-int GetNumLocalPoints() const\n-Returns the number of local vertex points.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n-bool LocalPointVaryingStencilPrecisionMatchesType() const\n-Tests if the precision of the stencil table to compute local point varying\n-values matches the given f...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchArrayVertices(int array) const\n-Returns the control vertex indices for the patches in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n-int GetNumPtexFaces() const\n-Returns the total number of ptex faces in the mesh.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n-ConstIndexArray GetFVarValues(int channel=0) const\n-Returns an array of value indices for the patches in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by\n-Vtr::ConstArray< unsigned int > ConstQuadOffsetsArray\n-Accessors for the gregory patch evaluation buffers. These methods will be\n-deprecated.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs\n-void EvaluateBasis(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL\n-wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const\n-Evaluate basis functions for position and derivatives at a given (u,v)\n-parametric location of a patch...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTableReal< REAL > const * GetLocalPointFaceVaryingStencilTable(int\n-channel=0) const\n-Returns the stencil table to compute local point face-varying values.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bT_\bo_\bt_\ba_\bl\n-int GetNumPatchesTotal() const\n-Returns the total number of patches stored in the table.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-PatchParam GetPatchParam(PatchHandle const &handle) const\n-Returns a PatchParam for the patch identified by handle.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt\n-void print() const\n-debug helper\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-Sdc::Options::FVarLinearInterpolation GetFVarChannelLinearInterpolation(int\n-channel=0) const\n-Deprecated.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\be_\bx_\bT_\ba_\bb_\bl_\be\n-std::vector< Index > const & GetSharpnessIndexTable() const\n-Returns a sharpness index table for each patch (if exists)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor GetPatchArrayDescriptor(int array) const\n-Returns the PatchDescriptor for the patches in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br\n-friend class PatchTableBuilder\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-void EvaluateBasisVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[],\n-REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const\n-Evaluate basis functions for a varying value and derivatives at a given (u,v)\n-parametric location of ...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTable const * GetLocalPointVaryingStencilTable() const\n-Returns the stencil table to compute local point varying values.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be\n-std::vector< unsigned int > QuadOffsetsTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-ConstIndexArray GetPatchVertices(int array, int patch) const\n-Returns the control vertex indices for patch in array.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-PatchParam GetPatchFVarPatchParam(PatchHandle const &handle, int channel=0)\n-const\n-Returns the value indices for a given patch in channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bS_\bt_\br_\bi_\bd_\be\n-int GetFVarValueStride(int channel=0) const\n-Returns the stride between patches in the value index array of channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n-ConstPatchParamArray GetFVarPatchParams(int channel=0) const\n-Returns an array of face-varying patch param for channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor GetFVarPatchDescriptor(int channel=0) const\n-Returns the default/irregular patch descriptor for channel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-int GetNumLocalPointsVarying() const\n-Returns the number of local varying points.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n-bool LocalPointStencilPrecisionMatchesType() const\n-Tests if the precision of the stencil table to compute local point vertex\n-values matches the given fl...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-StencilTableReal< REAL > const * GetLocalPointVaryingStencilTable() const\n-Returns the stencil table to compute local point varying values.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-int GetNumLocalPointsFaceVarying(int channel=0) const\n-Returns the number of local face-varying points for channel.\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be\n Handle that can be used as unique patch identifier within PatchTable.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx\n-Index patchIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\ba_\br_\br_\ba_\by_\bI_\bn_\bd_\be_\bx\n-Index arrayIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\be_\bx\n-Index vertIndex\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n-Table of subdivision stencils.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-FVarLinearInterpolation\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b1_\b0_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00734.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00734.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchMap.h File Reference\n+OpenSubdiv: opensubdiv/far/patchTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,29 +90,33 @@\n \n \n \n
\n \n-
patchMap.h File Reference
\n+
patchTable.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n-#include <cassert>
\n+#include "../far/patchDescriptor.h"
\n+#include "../far/patchParam.h"
\n+#include "../far/stencilTable.h"
\n+#include "../sdc/options.h"
\n+#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n+\n \n

\n Classes

class  PatchMap
 An quadtree-based map connecting coarse faces to their sub-patches. More...
class  PatchTable
 Container for arrays of parametric patches. More...
 
struct  PatchMap::QuadNode::Child
class  PatchTable::PatchHandle
 Handle that can be used as unique patch identifier within PatchTable. More...
 
\n \n \n \n \n@@ -121,13 +125,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,32 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-patchMap.h File Reference\n+patchTable.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n-\u00a0 An quadtree-based map connecting coarse faces to their sub-patches.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+\u00a0 Container for arrays of parametric patches. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd\n+class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be\n+\u00a0 Handle that can be used as unique patch identifier within _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00734.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00734.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var a00734 = [\n- [\"PatchMap\", \"a00977.html\", \"a00977\"],\n- [\"Child\", \"a00985.html\", \"a00985\"]\n+ [\"PatchTable\", \"a00993.html\", \"a00993\"],\n+ [\"PatchHandle\", \"a00997.html\", \"a00997\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00734_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00734_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchMap.h Source File\n+OpenSubdiv: opensubdiv/far/patchTable.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchMap.h
\n+
patchTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,222 +119,798 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_MAP_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_MAP_H
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_TABLE_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../far/patchTable.h"
\n-
31
\n-
32#include <cassert>
\n+
30#include "../far/patchDescriptor.h"
\n+
31#include "../far/patchParam.h"
\n+
32#include "../far/stencilTable.h"
\n
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38
\n-
\n-
49class PatchMap {
\n-
50public:
\n-
51
\n-\n-
53
\n-
58 PatchMap( PatchTable const & patchTable );
\n-
59
\n-
74 Handle const * FindPatch( int patchFaceId, double u, double v ) const;
\n-
75
\n-
76private:
\n-
77 void initializeHandles(PatchTable const & patchTable);
\n-
78 void initializeQuadtree(PatchTable const & patchTable);
\n+
34#include "../sdc/options.h"
\n+
35
\n+
36#include <vector>
\n+
37
\n+
38namespace OpenSubdiv {
\n+
39namespace OPENSUBDIV_VERSION {
\n+
40
\n+
41namespace Far {
\n+
42
\n+
\n+\n+
56
\n+
57public:
\n+
58
\n+
\n+\n+
61 // XXXX manuelk members will eventually be made private
\n+
62 public:
\n+
63
\n+
64 friend class PatchTable;
\n+
65 friend class PatchMap;
\n+
66
\n+
67 Index arrayIndex, // Array index of the patch
\n+
68 patchIndex, // Absolute Index of the patch
\n+
69 vertIndex; // Relative offset to the first CV of the patch in array
\n+
70 };
\n+
\n+
71
\n+
72public:
\n+
73
\n+
75 PatchTable(PatchTable const & src);
\n+
76
\n+\n
79
\n-
80private:
\n-
81 // Quadtree node with 4 children, tree is just a vector of nodes
\n-
82 struct QuadNode {
\n-
83 QuadNode() { std::memset(this, 0, sizeof(QuadNode)); }
\n-
84
\n-
\n-
85 struct Child {
\n-
86 unsigned int isSet : 1; // true if the child has been set
\n-
87 unsigned int isLeaf : 1; // true if the child is a QuadNode
\n-
88 unsigned int index : 30; // child index (either QuadNode or Handle)
\n-
89 };
\n+
81 bool IsFeatureAdaptive() const;
\n+
82
\n+
\n+\n+
85 return (int)_patchVerts.size();
\n+
86 }
\n
\n+
87
\n+
89 int GetNumPatchesTotal() const;
\n
90
\n-
91 // sets all the children to point to the patch of given index
\n-
92 void SetChildren(int index);
\n+
92 int GetMaxValence() const { return _maxValence; }
\n
93
\n-
94 // sets the child in "quadrant" to point to the node or patch of the given index
\n-
95 void SetChild(int quadrant, int index, bool isLeaf);
\n+
95 int GetNumPtexFaces() const { return _numPtexFaces; }
\n
96
\n-
97 Child children[4];
\n-
98 };
\n-
99 typedef std::vector<QuadNode> QuadTree;
\n-
100
\n-
101 // Internal methods supporting quadtree construction and queries
\n-
102 void assignRootNode(QuadNode * node, int index);
\n-
103 QuadNode * assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quad, int index);
\n-
104
\n-
105 template <class T>
\n-
106 static int transformUVToQuadQuadrant(T const & median, T & u, T & v);
\n-
107 template <class T>
\n-
108 static int transformUVToTriQuadrant(T const & median, T & u, T & v, bool & rotated);
\n-
109
\n-
110private:
\n-
111 bool _patchesAreTriangular; // tri and quad assembly and search requirements differ
\n-
112
\n-
113 int _minPatchFace; // minimum patch face index supported by the map
\n-
114 int _maxPatchFace; // maximum patch face index supported by the map
\n-
115 int _maxDepth; // maximum depth of a patch in the tree
\n-
116
\n-
117 std::vector<Handle> _handles; // all the patches in the PatchTable
\n-
118 std::vector<QuadNode> _quadtree; // quadtree nodes
\n-
119};
\n-
\n-
120
\n-
121//
\n-
122// Given a median value for both U and V, these methods transform a (u,v) pair
\n-
123// into the quadrant that contains them and returns the quadrant index.
\n-
124//
\n-
125// Quadrant indexing for tri and quad patches -- consistent with PatchParam's
\n-
126// usage of UV bits:
\n-
127//
\n-
128// (0,1) o-----o-----o (1,1) (0,1) o (1,0) o-----o-----o (0,0)
\n-
129// | | | |\\ \\ 1 |\\ 0 |
\n-
130// | 2 | 3 | | \\ \\ | \\ |
\n-
131// | | | | 2 \\ \\| 3 \\|
\n-
132// o-----o-----o o-----o o-----o
\n-
133// | | | |\\ 3 |\\ \\ 2 |
\n-
134// | 0 | 1 | | \\ | \\ \\ |
\n-
135// | | | | 0 \\| 1 \\ \\|
\n-
136// (0,0) o-----o-----o (1,0) (0,0) o-----o-----o (1,0) o (0,1)
\n-
137//
\n-
138// The triangular case also takes and returns/affects the rotation of the
\n-
139// quadrant being searched and identified (quadrant 3 imparts a rotation).
\n-
140//
\n-
141template <class T>
\n-
142inline int
\n-
143PatchMap::transformUVToQuadQuadrant(T const & median, T & u, T & v) {
\n-
144
\n-
145 int uHalf = (u >= median);
\n-
146 if (uHalf) u -= median;
\n-
147
\n-
148 int vHalf = (v >= median);
\n-
149 if (vHalf) v -= median;
\n+
97
\n+
99
\n+
105
\n+\n+
108
\n+\n+
111
\n+
113 PatchParam GetPatchParam(PatchHandle const & handle) const;
\n+
114
\n+
116 ConstIndexArray GetPatchVertices(int array, int patch) const;
\n+
117
\n+
119 PatchParam GetPatchParam(int array, int patch) const;
\n+
121
\n+
122
\n+
124
\n+
130
\n+
132 int GetNumPatchArrays() const;
\n+
133
\n+
135 int GetNumPatches(int array) const;
\n+
136
\n+
138 int GetNumControlVertices(int array) const;
\n+
139
\n+\n+
142
\n+\n+
145
\n+
147 ConstPatchParamArray const GetPatchParams(int array) const;
\n+
149
\n
150
\n-
151 return (vHalf << 1) | uHalf;
\n-
152}
\n-
153
\n-
154template <class T>
\n-
155int inline
\n-
156PatchMap::transformUVToTriQuadrant(T const & median, T & u, T & v, bool & rotated) {
\n-
157
\n-
158 if (!rotated) {
\n-
159 if (u >= median) {
\n-
160 u -= median;
\n-
161 return 1;
\n-
162 }
\n-
163 if (v >= median) {
\n-
164 v -= median;
\n-
165 return 2;
\n-
166 }
\n-
167 if ((u + v) >= median) {
\n-
168 rotated = true;
\n-
169 return 3;
\n-
170 }
\n-
171 return 0;
\n-
172 } else {
\n-
173 if (u < median) {
\n-
174 v -= median;
\n-
175 return 1;
\n-
176 }
\n-
177 if (v < median) {
\n-
178 u -= median;
\n-
179 return 2;
\n-
180 }
\n-
181 u -= median;
\n-
182 v -= median;
\n-
183 if ((u + v) < median) {
\n-
184 rotated = false;
\n-
185 return 3;
\n-
186 }
\n-
187 return 0;
\n-
188 }
\n-
189}
\n-
190
\n-
192inline PatchMap::Handle const *
\n-
\n-
193PatchMap::FindPatch( int faceid, double u, double v ) const {
\n-
194
\n-
195 //
\n-
196 // Reject patch faces not supported by this map, or those corresponding
\n-
197 // to holes or otherwise unassigned (the root node for a patch will
\n-
198 // have all or no quadrants set):
\n-
199 //
\n-
200 if ((faceid < _minPatchFace) || (faceid > _maxPatchFace)) return 0;
\n-
201
\n-
202 QuadNode const * node = &_quadtree[faceid - _minPatchFace];
\n+
152
\n+
159
\n+
161 int GetNumLocalPoints() const;
\n+
162
\n+\n+
165
\n+
167 template <typename REAL>
\n+\n+
169
\n+
172 template <typename REAL> bool LocalPointStencilPrecisionMatchesType() const;
\n+
173
\n+
186 template <class T> void
\n+
187 ComputeLocalPointValues(T const *src, T *dst) const;
\n+
188
\n+
189
\n+\n+
192
\n+\n+
195
\n+
197 template <typename REAL>
\n+\n+
199
\n+
202 template <typename REAL> bool LocalPointVaryingStencilPrecisionMatchesType() const;
\n
203
\n-
204 if (!node->children[0].isSet) return 0;
\n-
205
\n-
206 //
\n-
207 // Search the tree for the sub-patch containing the given (u,v)
\n-
208 //
\n-
209 assert( (u>=0.0) && (u<=1.0) && (v>=0.0) && (v<=1.0) );
\n-
210
\n-
211 double median = 0.5;
\n-
212 bool triRotated = false;
\n-
213
\n-
214 for (int depth = 0; depth <= _maxDepth; ++depth, median *= 0.5) {
\n-
215
\n-
216 int quadrant = _patchesAreTriangular
\n-
217 ? transformUVToTriQuadrant(median, u, v, triRotated)
\n-
218 : transformUVToQuadQuadrant(median, u, v);
\n+
216 template <class T> void
\n+
217 ComputeLocalPointValuesVarying(T const *src, T *dst) const;
\n+
218
\n
219
\n-
220 // holes should have been rejected at the root node of the face
\n-
221 assert(node->children[quadrant].isSet);
\n+
221 int GetNumLocalPointsFaceVarying(int channel = 0) const;
\n
222
\n-
223 if (node->children[quadrant].isLeaf) {
\n-
224 return &_handles[node->children[quadrant].index];
\n-
225 } else {
\n-
226 node = &_quadtree[node->children[quadrant].index];
\n-
227 }
\n-
228 }
\n-
229 assert(0);
\n-
230 return 0;
\n-
231}
\n-
\n-
232
\n-
233} // end namespace Far
\n-
234
\n-
235} // end namespace OPENSUBDIV_VERSION
\n-
236using namespace OPENSUBDIV_VERSION;
\n-
237
\n-
238} // end namespace OpenSubdiv
\n-
239
\n-
240#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */
\n+
224 StencilTable const *GetLocalPointFaceVaryingStencilTable(int channel = 0) const;
\n+
225
\n+
227 template <typename REAL>
\n+\n+
229
\n+
232 template <typename REAL> bool LocalPointFaceVaryingStencilPrecisionMatchesType() const;
\n+
233
\n+
248 template <class T> void
\n+
249 ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel = 0) const;
\n+
251
\n+
252
\n+
254
\n+
255
\n+\n+
260
\n+\n+
263
\n+
264 typedef std::vector<Index> VertexValenceTable;
\n+
265
\n+
\n+\n+
268 return _vertexValenceTable;
\n+
269 }
\n+
\n+
271
\n+
272
\n+
274
\n+
280
\n+\n+
284
\n+
287 float GetSingleCreasePatchSharpnessValue(int array, int patch) const;
\n+
289
\n+
290
\n+
292
\n+
298
\n+\n+
301
\n+\n+
304
\n+
306 ConstIndexArray GetPatchVaryingVertices(int array, int patch) const;
\n+
307
\n+\n+
310
\n+\n+
314
\n+
315
\n+
317
\n+
323
\n+\n+
326
\n+\n+
329
\n+\n+
332
\n+\n+
335
\n+
337 ConstIndexArray GetPatchFVarValues(PatchHandle const & handle, int channel = 0) const;
\n+
338
\n+
340 ConstIndexArray GetPatchFVarValues(int array, int patch, int channel = 0) const;
\n+
341
\n+
343 ConstIndexArray GetPatchArrayFVarValues(int array, int channel = 0) const;
\n+
344
\n+
346 ConstIndexArray GetFVarValues(int channel = 0) const;
\n+
347
\n+
349 int GetFVarValueStride(int channel = 0) const;
\n+
350
\n+
352 PatchParam GetPatchFVarPatchParam(PatchHandle const & handle, int channel = 0) const;
\n+
353
\n+
355 PatchParam GetPatchFVarPatchParam(int array, int patch, int channel = 0) const;
\n+
356
\n+
358 ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel = 0) const;
\n+
359
\n+\n+
362
\n+\n+
366
\n+
367
\n+
369
\n+
374
\n+
375 typedef std::vector<Index> PatchVertsTable;
\n+
376
\n+
378 PatchVertsTable const & GetPatchControlVerticesTable() const { return _patchVerts; }
\n+
379
\n+
381 PatchParamTable const & GetPatchParamTable() const { return _paramTable; }
\n+
382
\n+
384 std::vector<Index> const &GetSharpnessIndexTable() const { return _sharpnessIndices; }
\n+
385
\n+
387 std::vector<float> const &GetSharpnessValues() const { return _sharpnessValues; }
\n+
388
\n+
389 typedef std::vector<unsigned int> QuadOffsetsTable;
\n+
390
\n+
\n+\n+
393 return _quadOffsetsTable;
\n+
394 }
\n+
\n+
396
\n+
398 void print() const;
\n+
399
\n+
400public:
\n+
401
\n+
403
\n+
405
\n+
428 template <typename REAL>
\n+
429 void EvaluateBasis(PatchHandle const & handle, REAL u, REAL v,
\n+
430 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n+
431 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;
\n+
432
\n+
435 void EvaluateBasis(PatchHandle const & handle, float u, float v,
\n+
436 float wP[], float wDu[] = 0, float wDv[] = 0,
\n+
437 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;
\n+
438
\n+
441 void EvaluateBasis(PatchHandle const & handle, double u, double v,
\n+
442 double wP[], double wDu[] = 0, double wDv[] = 0,
\n+
443 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;
\n+
444
\n+
467 template <typename REAL>
\n+
468 void EvaluateBasisVarying(PatchHandle const & handle, REAL u, REAL v,
\n+
469 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n+
470 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;
\n+
471
\n+
474 void EvaluateBasisVarying(PatchHandle const & handle, float u, float v,
\n+
475 float wP[], float wDu[] = 0, float wDv[] = 0,
\n+
476 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;
\n+
477
\n+
480 void EvaluateBasisVarying(PatchHandle const & handle, double u, double v,
\n+
481 double wP[], double wDu[] = 0, double wDv[] = 0,
\n+
482 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;
\n+
483
\n+
508 template <typename REAL>
\n+
509 void EvaluateBasisFaceVarying(PatchHandle const & handle, REAL u, REAL v,
\n+
510 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,
\n+
511 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0,
\n+
512 int channel = 0) const;
\n+
513
\n+
516 void EvaluateBasisFaceVarying(PatchHandle const & handle, float u, float v,
\n+
517 float wP[], float wDu[] = 0, float wDv[] = 0,
\n+
518 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0,
\n+
519 int channel = 0) const;
\n+
520
\n+
523 void EvaluateBasisFaceVarying(PatchHandle const & handle, double u, double v,
\n+
524 double wP[], double wDu[] = 0, double wDv[] = 0,
\n+
525 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0,
\n+
526 int channel = 0) const;
\n+
528
\n+
529protected:
\n+
530
\n+
531 friend class PatchTableBuilder;
\n+
532
\n+
533 // Factory constructor
\n+
534 PatchTable(int maxvalence);
\n+
535
\n+
536 Index getPatchIndex(int array, int patch) const;
\n+
537
\n+\n+
539
\n+\n+
541 float * getSharpnessValues(Index arrayIndex);
\n+
542
\n+
543private:
\n+
544
\n+
545 //
\n+
546 // Patch arrays
\n+
547 //
\n+
548 struct PatchArray {
\n+
549 PatchArray(PatchDescriptor d, int np, Index v, Index p, Index qo) :
\n+
550 desc(d), numPatches(np), vertIndex(v),
\n+
551 patchIndex(p), quadOffsetIndex (qo) { }
\n+
552
\n+
553 void print() const;
\n+
554
\n+
555 PatchDescriptor desc; // type of patches in the array
\n+
556
\n+
557 int numPatches; // number of patches in the array
\n+
558
\n+
559 Index vertIndex, // index to the first control vertex
\n+
560 patchIndex, // absolute index of the first patch in the array
\n+
561 quadOffsetIndex; // index of the first quad offset entry
\n+
562 };
\n+
563
\n+
564 typedef std::vector<PatchArray> PatchArrayVector;
\n+
565
\n+
566 PatchArray & getPatchArray(Index arrayIndex);
\n+
567 PatchArray const & getPatchArray(Index arrayIndex) const;
\n+
568
\n+
569 void reservePatchArrays(int numPatchArrays);
\n+
570 void pushPatchArray(PatchDescriptor desc, int npatches,
\n+
571 Index * vidx, Index * pidx, Index * qoidx=0);
\n+
572
\n+
573 IndexArray getPatchArrayVertices(int arrayIndex);
\n+
574
\n+
575 Index findPatchArray(PatchDescriptor desc);
\n+
576
\n+
577
\n+
578 //
\n+
579 // Varying patch arrays
\n+
580 //
\n+
581 IndexArray getPatchArrayVaryingVertices(int arrayIndex);
\n+
582
\n+
583 void allocateVaryingVertices(
\n+
584 PatchDescriptor desc, int numPatches);
\n+
585 void populateVaryingVertices();
\n+
586
\n+
587 //
\n+
588 // Face-varying patch channels
\n+
589 //
\n+
590
\n+
591 //
\n+
592 // FVarPatchChannel
\n+
593 //
\n+
594 // Stores a record for each patch in the primitive :
\n+
595 //
\n+
596 // - Each patch in the PatchTable has a corresponding patch in each
\n+
597 // face-varying patch channel. Patch vertex indices are sorted in the same
\n+
598 // patch-type order as PatchTable::PTables. Face-varying data for a patch
\n+
599 // can therefore be quickly accessed by using the patch primitive ID as
\n+
600 // index into patchValueOffsets to locate the face-varying control vertex
\n+
601 // indices.
\n+
602 //
\n+
603 // - Face-varying channels can have a different interpolation modes
\n+
604 //
\n+
605 // - Unlike "vertex" patches, there are no transition masks required
\n+
606 // for face-varying patches.
\n+
607 //
\n+
608 // - Face-varying patches still require boundary edge masks.
\n+
609 //
\n+
610 // - currently most patches with sharp boundaries but smooth interiors have
\n+
611 // to be isolated to level 10 : we need a special type of bicubic patch
\n+
612 // similar to single-crease to resolve this condition without requiring
\n+
613 // isolation if possible
\n+
614 //
\n+
615 struct FVarPatchChannel {
\n+\n+
617
\n+
618 PatchDescriptor regDesc;
\n+
619 PatchDescriptor irregDesc;
\n+
620
\n+
621 int stride;
\n+
622
\n+
623 std::vector<Index> patchValues;
\n+
624 std::vector<PatchParam> patchParam;
\n+
625 };
\n+
626 typedef std::vector<FVarPatchChannel> FVarPatchChannelVector;
\n+
627
\n+
628 FVarPatchChannel & getFVarPatchChannel(int channel);
\n+
629 FVarPatchChannel const & getFVarPatchChannel(int channel) const;
\n+
630
\n+
631 void allocateFVarPatchChannels(int numChannels);
\n+
632 void allocateFVarPatchChannelValues(
\n+
633 PatchDescriptor regDesc, PatchDescriptor irregDesc,
\n+
634 int numPatches, int channel);
\n+
635
\n+
636 // deprecated
\n+
637 void setFVarPatchChannelLinearInterpolation(
\n+
638 Sdc::Options::FVarLinearInterpolation interpolation, int channel);
\n+
639
\n+
640 IndexArray getFVarValues(int channel);
\n+
641 ConstIndexArray getPatchFVarValues(int patch, int channel) const;
\n+
642
\n+
643 PatchParamArray getFVarPatchParams(int channel);
\n+
644 PatchParam getPatchFVarPatchParam(int patch, int channel) const;
\n+
645
\n+
646private:
\n+
647 //
\n+
648 // Simple private class to hold stencil table pointers of varying precision,
\n+
649 // where the discriminant of the precision is external.
\n+
650 //
\n+
651 // NOTE that this is a simple pointer container and NOT a smart pointer that
\n+
652 // manages the ownership of the object referred to by it.
\n+
653 //
\n+
654 class StencilTablePtr {
\n+
655 private:
\n+
656 typedef StencilTableReal<float> float_type;
\n+
657 typedef StencilTableReal<double> double_type;
\n+
658
\n+
659 union {
\n+
660 float_type * _fPtr;
\n+
661 double_type * _dPtr;
\n+
662 };
\n+
663
\n+
664 public:
\n+
665 StencilTablePtr() { _fPtr = 0; }
\n+
666 StencilTablePtr(float_type * ptr) { _fPtr = ptr; }
\n+
667 StencilTablePtr(double_type * ptr) { _dPtr = ptr; }
\n+
668
\n+
669 operator bool() const { return _fPtr != 0; }
\n+
670
\n+
671 void Set() { _fPtr = 0; }
\n+
672 void Set(float_type * ptr) { _fPtr = ptr; }
\n+
673 void Set(double_type * ptr) { _dPtr = ptr; }
\n+
674
\n+
675 template <typename REAL> StencilTableReal<REAL> * Get() const;
\n+
676 };
\n+
677
\n+
678private:
\n+
679
\n+
680 //
\n+
681 // Topology
\n+
682 //
\n+
683
\n+
684 int _maxValence, // highest vertex valence found in the mesh
\n+
685 _numPtexFaces; // total number of ptex faces
\n+
686
\n+
687 PatchArrayVector _patchArrays; // Vector of descriptors for arrays of patches
\n+
688
\n+
689 std::vector<Index> _patchVerts; // Indices of the control vertices of the patches
\n+
690
\n+
691 PatchParamTable _paramTable; // PatchParam bitfields (one per patch)
\n+
692
\n+
693 //
\n+
694 // Extraordinary vertex closed-form evaluation / endcap basis conversion
\n+
695 //
\n+
696 // XXXtakahito: these data will probably be replaced with mask coefficient or something
\n+
697 // SchemeWorker populates.
\n+
698 //
\n+
699 QuadOffsetsTable _quadOffsetsTable; // Quad offsets (for Gregory patches)
\n+
700 VertexValenceTable _vertexValenceTable; // Vertex valence table (for Gregory patches)
\n+
701
\n+
702 StencilTablePtr _localPointStencils; // local point conversion stencils
\n+
703 StencilTablePtr _localPointVaryingStencils; // local point varying stencils
\n+
704
\n+
705 //
\n+
706 // Varying data
\n+
707 //
\n+
708 PatchDescriptor _varyingDesc;
\n+
709
\n+
710 std::vector<Index> _varyingVerts;
\n+
711
\n+
712 //
\n+
713 // Face-varying data
\n+
714 //
\n+
715 FVarPatchChannelVector _fvarChannels;
\n+
716
\n+
717 std::vector<StencilTablePtr> _localPointFaceVaryingStencils;
\n+
718
\n+
719 //
\n+
720 // 'single-crease' patch sharpness tables
\n+
721 //
\n+
722 std::vector<Index> _sharpnessIndices; // Indices of single-crease sharpness (one per patch)
\n+
723 std::vector<float> _sharpnessValues; // Sharpness values.
\n+
724
\n+
725 //
\n+
726 // Construction history -- relevant to at least one public query:
\n+
727 //
\n+
728 unsigned int _isUniformLinear : 1;
\n+
729
\n+
730 //
\n+
731 // Precision -- only applies to local-point stencil tables
\n+
732 //
\n+
733 unsigned int _vertexPrecisionIsDouble : 1;
\n+
734 unsigned int _varyingPrecisionIsDouble : 1;
\n+
735 unsigned int _faceVaryingPrecisionIsDouble : 1;
\n+
736};
\n+
\n+
737
\n+
738
\n+
739//
\n+
740// Template specializations for float/double -- to be defined before used:
\n+
741//
\n+
742template <> inline StencilTableReal<float> *
\n+
743PatchTable::StencilTablePtr::Get<float>() const { return _fPtr; }
\n+
744
\n+
745template <> inline StencilTableReal<double> *
\n+
746PatchTable::StencilTablePtr::Get<double>() const { return _dPtr; }
\n+
747
\n+
\n+
748template <> inline bool
\n+
749PatchTable::LocalPointStencilPrecisionMatchesType<float>() const {
\n+
750 return !_vertexPrecisionIsDouble;
\n+
751}
\n+
\n+
\n+
752template <> inline bool
\n+
753PatchTable::LocalPointVaryingStencilPrecisionMatchesType<float>() const {
\n+
754 return !_varyingPrecisionIsDouble;
\n+
755}
\n+
\n+
\n+
756template <> inline bool
\n+
757PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType<float>() const {
\n+
758 return !_faceVaryingPrecisionIsDouble;
\n+
759}
\n+
\n+
760
\n+
\n+
761template <> inline bool
\n+
762PatchTable::LocalPointStencilPrecisionMatchesType<double>() const {
\n+
763 return _vertexPrecisionIsDouble;
\n+
764}
\n+
\n+
\n+
765template <> inline bool
\n+
766PatchTable::LocalPointVaryingStencilPrecisionMatchesType<double>() const {
\n+
767 return _varyingPrecisionIsDouble;
\n+
768}
\n+
\n+
\n+
769template <> inline bool
\n+
770PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType<double>() const {
\n+
771 return _faceVaryingPrecisionIsDouble;
\n+
772}
\n+
\n+
773
\n+
774//
\n+
775// StencilTable access -- backward compatible and generic:
\n+
776//
\n+
777inline StencilTable const *
\n+
\n+\n+
779 assert(LocalPointStencilPrecisionMatchesType<float>());
\n+
780 return static_cast<StencilTable const *>(_localPointStencils.Get<float>());
\n+
781}
\n+
\n+
782inline StencilTable const *
\n+
\n+\n+
784 assert(LocalPointVaryingStencilPrecisionMatchesType<float>());
\n+
785 return static_cast<StencilTable const *>(
\n+
786 _localPointVaryingStencils.Get<float>());
\n+
787}
\n+
\n+
788inline StencilTable const *
\n+
\n+\n+
790 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<float>());
\n+
791 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n+
792 return static_cast<StencilTable const *>(
\n+
793 _localPointFaceVaryingStencils[channel].Get<float>());
\n+
794 }
\n+
795 return NULL;
\n+
796}
\n+
\n+
797
\n+
798template <typename REAL>
\n+
799inline StencilTableReal<REAL> const *
\n+
\n+\n+
801 assert(LocalPointStencilPrecisionMatchesType<REAL>());
\n+
802 return _localPointStencils.Get<REAL>();
\n+
803}
\n+
\n+
804template <typename REAL>
\n+
805inline StencilTableReal<REAL> const *
\n+
\n+\n+
807 assert(LocalPointVaryingStencilPrecisionMatchesType<REAL>());
\n+
808 return _localPointVaryingStencils.Get<REAL>();
\n+
809}
\n+
\n+
810template <typename REAL>
\n+
811inline StencilTableReal<REAL> const *
\n+
\n+\n+
813 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<REAL>());
\n+
814 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n+
815 return _localPointFaceVaryingStencils[channel].Get<REAL>();
\n+
816 }
\n+
817 return NULL;
\n+
818}
\n+
\n+
819
\n+
820
\n+
821//
\n+
822// Computation of local point values:
\n+
823//
\n+
824template <class T>
\n+
825inline void
\n+
\n+
826PatchTable::ComputeLocalPointValues(T const *src, T *dst) const {
\n+
827 assert(LocalPointStencilPrecisionMatchesType<float>());
\n+
828 if (_localPointStencils) {
\n+
829 _localPointStencils.Get<float>()->UpdateValues(src, dst);
\n+
830 }
\n+
831}
\n+
\n+
832
\n+
833template <class T>
\n+
834inline void
\n+
\n+\n+
836 assert(LocalPointVaryingStencilPrecisionMatchesType<float>());
\n+
837 if (_localPointVaryingStencils) {
\n+
838 _localPointVaryingStencils.Get<float>()->UpdateValues(src, dst);
\n+
839 }
\n+
840}
\n+
\n+
841
\n+
842template <class T>
\n+
843inline void
\n+
\n+
844PatchTable::ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel) const {
\n+
845 assert(LocalPointFaceVaryingStencilPrecisionMatchesType<float>());
\n+
846 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {
\n+
847 if (_localPointFaceVaryingStencils[channel]) {
\n+
848 _localPointFaceVaryingStencils[channel].Get<float>()->UpdateValues(src, dst);
\n+
849 }
\n+
850 }
\n+
851}
\n+
\n+
852
\n+
853
\n+
854//
\n+
855// Basis evaluation overloads
\n+
856//
\n+
857inline void
\n+
\n+
858PatchTable::EvaluateBasis(PatchHandle const & handle, float u, float v,
\n+
859 float wP[], float wDu[], float wDv[],
\n+
860 float wDuu[], float wDuv[], float wDvv[]) const {
\n+
861
\n+
862 EvaluateBasis<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n+
863}
\n+
\n+
864inline void
\n+
\n+
865PatchTable::EvaluateBasis(PatchHandle const & handle, double u, double v,
\n+
866 double wP[], double wDu[], double wDv[],
\n+
867 double wDuu[], double wDuv[], double wDvv[]) const {
\n+
868
\n+
869 EvaluateBasis<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n+
870}
\n+
\n+
871
\n+
872inline void
\n+
\n+
873PatchTable::EvaluateBasisVarying(PatchHandle const & handle, float u, float v,
\n+
874 float wP[], float wDu[], float wDv[],
\n+
875 float wDuu[], float wDuv[], float wDvv[]) const {
\n+
876
\n+
877 EvaluateBasisVarying<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n+
878}
\n+
\n+
879inline void
\n+
\n+
880PatchTable::EvaluateBasisVarying(PatchHandle const & handle, double u, double v,
\n+
881 double wP[], double wDu[], double wDv[],
\n+
882 double wDuu[], double wDuv[], double wDvv[]) const {
\n+
883
\n+
884 EvaluateBasisVarying<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);
\n+
885}
\n+
\n+
886
\n+
887inline void
\n+
\n+
888PatchTable::EvaluateBasisFaceVarying(PatchHandle const & handle, float u, float v,
\n+
889 float wP[], float wDu[], float wDv[],
\n+
890 float wDuu[], float wDuv[], float wDvv[], int channel) const {
\n+
891
\n+
892 EvaluateBasisFaceVarying<float>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv, channel);
\n+
893}
\n+
\n+
894inline void
\n+
\n+
895PatchTable::EvaluateBasisFaceVarying(PatchHandle const & handle, double u, double v,
\n+
896 double wP[], double wDu[], double wDv[],
\n+
897 double wDuu[], double wDuv[], double wDvv[], int channel) const {
\n+
898
\n+
899 EvaluateBasisFaceVarying<double>(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv, channel);
\n+
900}
\n+
\n+
901
\n+
902} // end namespace Far
\n+
903
\n+
904} // end namespace OPENSUBDIV_VERSION
\n+
905using namespace OPENSUBDIV_VERSION;
\n+
906
\n+
907} // end namespace OpenSubdiv
\n+
908
\n+
909#endif /* OPENSUBDIV3_FAR_PATCH_TABLE */
\n \n-
An quadtree-based map connecting coarse faces to their sub-patches.
Definition patchMap.h:49
\n-
PatchMap(PatchTable const &patchTable)
Constructor.
\n-
Handle const * FindPatch(int patchFaceId, double u, double v) const
Returns a handle to the sub-patch of the face at the given (u,v). Note that the patch face ID corresp...
Definition patchMap.h:193
\n-\n-\n-\n-\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n+
Vtr::ConstIndexArray ConstIndexArray
Definition types.h:47
\n+
std::vector< PatchParam > PatchParamTable
Definition patchParam.h:243
\n+\n+\n+
Vtr::Array< PatchParam > PatchParamArray
Definition patchParam.h:245
\n+
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n+\n+
An quadtree-based map connecting coarse faces to their sub-patches.
Definition patchMap.h:49
\n+\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
ConstIndexArray GetPatchArrayVaryingVertices(int array) const
Returns the varying vertex indices for the patches in array.
\n+\n+
PatchVertsTable const & GetPatchControlVerticesTable() const
Get the table of patch control vertices.
Definition patchTable.h:378
\n+
void ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel=0) const
Updates local point face-varying values.
Definition patchTable.h:844
\n+
ConstIndexArray GetVaryingVertices() const
Returns an array of varying vertex indices for the patches.
\n+
void ComputeLocalPointValuesVarying(T const *src, T *dst) const
Updates local point varying values.
Definition patchTable.h:835
\n+
ConstIndexArray GetPatchVaryingVertices(PatchHandle const &handle) const
Returns the varying vertex indices for a given patch.
\n+
bool IsFeatureAdaptive() const
True if the patches are of feature adaptive types.
\n+
int GetMaxValence() const
Returns max vertex valence.
Definition patchTable.h:92
\n+
StencilTableReal< REAL > const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
\n+
StencilTable const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
Definition patchTable.h:778
\n+
PatchParamArray getPatchParams(int arrayIndex)
\n+
ConstIndexArray GetPatchArrayFVarValues(int array, int channel=0) const
Returns the value indices for the patches in array in channel.
\n+
std::vector< float > const & GetSharpnessValues() const
Returns sharpness values table.
Definition patchTable.h:387
\n+\n+
PatchParam GetPatchFVarPatchParam(int array, int patch, int channel=0) const
Returns the face-varying params for a given patch channel.
\n+
ConstIndexArray GetPatchVaryingVertices(int array, int patch) const
Returns the varying vertex indices for a given patch.
\n+
PatchTable(PatchTable const &src)
Copy constructor.
\n+
int GetNumPatchArrays() const
Returns the number of patch arrays in the table.
\n+
ConstIndexArray GetPatchVertices(PatchHandle const &handle) const
Returns the control vertex indices for the patch identified by handle.
\n+\n+
bool LocalPointFaceVaryingStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point face-varying values matches the gi...
\n+
PatchParamTable const & GetPatchParamTable() const
Returns the PatchParamTable (PatchParams order matches patch array sorting)
Definition patchTable.h:381
\n+
VertexValenceTable const & GetVertexValenceTable() const
Returns the 'VertexValences' table (vertex neighborhoods table)
Definition patchTable.h:267
\n+
StencilTable const * GetLocalPointFaceVaryingStencilTable(int channel=0) const
Returns the stencil table to compute local point face-varying values.
Definition patchTable.h:789
\n+
int GetNumControlVertices(int array) const
Returns the number of control vertices in array.
\n+\n+
void EvaluateBasisFaceVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0, int channel=0) const
Evaluate basis functions for a face-varying value and derivatives at a given (u,v) parametric locatio...
\n+
ConstQuadOffsetsArray GetPatchQuadOffsets(PatchHandle const &handle) const
Returns the 'QuadOffsets' for the Gregory patch identified by handle.
\n+
PatchDescriptor GetFVarPatchDescriptorIrregular(int channel=0) const
Returns the irregular patch descriptor for channel.
\n+
float GetSingleCreasePatchSharpnessValue(int array, int patch) const
Returns the crease sharpness for the patch in array if it is a single-crease patch,...
\n+\n+
void ComputeLocalPointValues(T const *src, T *dst) const
Updates local point vertex values.
Definition patchTable.h:826
\n+
float GetSingleCreasePatchSharpnessValue(PatchHandle const &handle) const
Returns the crease sharpness for the patch identified by handle if it is a single-crease patch,...
\n+
PatchParam GetPatchParam(int array, int patch) const
Returns the PatchParam for patch in array.
\n+
ConstIndexArray GetPatchFVarValues(int array, int patch, int channel=0) const
Returns the value indices for a given patch in channel.
\n+
PatchDescriptor GetFVarPatchDescriptorRegular(int channel=0) const
Returns the regular patch descriptor for channel.
\n+
PatchDescriptor GetPatchDescriptor(PatchHandle const &handle) const
Returns the PatchDescriptor for the patch identified by handle.
\n+\n+
QuadOffsetsTable const & GetQuadOffsetsTable() const
Returns the quad-offsets table.
Definition patchTable.h:392
\n+
int GetNumPatches(int array) const
Returns the number of patches in array.
\n+
PatchDescriptor GetVaryingPatchDescriptor() const
Returns the varying patch descriptor.
\n+
ConstIndexArray GetPatchFVarValues(PatchHandle const &handle, int channel=0) const
Returns the value indices for a given patch in channel.
\n+
ConstPatchParamArray const GetPatchParams(int array) const
Returns the PatchParams for the patches in array.
\n+
int GetNumControlVerticesTotal() const
Returns the total number of control vertex indices in the table.
Definition patchTable.h:84
\n+
int GetNumFVarChannels() const
Returns the number of face-varying channels.
\n+
ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel=0) const
Returns the face-varying for a given patch in array in channel.
\n+
Index getPatchIndex(int array, int patch) const
\n+
int GetNumLocalPoints() const
Returns the number of local vertex points.
\n+
bool LocalPointVaryingStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point varying values matches the given f...
\n+
ConstIndexArray GetPatchArrayVertices(int array) const
Returns the control vertex indices for the patches in array.
\n+
int GetNumPtexFaces() const
Returns the total number of ptex faces in the mesh.
Definition patchTable.h:95
\n+
ConstIndexArray GetFVarValues(int channel=0) const
Returns an array of value indices for the patches in channel.
\n+
Vtr::ConstArray< unsigned int > ConstQuadOffsetsArray
Accessors for the gregory patch evaluation buffers. These methods will be deprecated.
Definition patchTable.h:259
\n+
void EvaluateBasis(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const
Evaluate basis functions for position and derivatives at a given (u,v) parametric location of a patch...
\n+
StencilTableReal< REAL > const * GetLocalPointFaceVaryingStencilTable(int channel=0) const
Returns the stencil table to compute local point face-varying values.
\n+
int GetNumPatchesTotal() const
Returns the total number of patches stored in the table.
\n+
PatchParam GetPatchParam(PatchHandle const &handle) const
Returns a PatchParam for the patch identified by handle.
\n+\n+
Sdc::Options::FVarLinearInterpolation GetFVarChannelLinearInterpolation(int channel=0) const
Deprecated.
\n+
std::vector< Index > const & GetSharpnessIndexTable() const
Returns a sharpness index table for each patch (if exists)
Definition patchTable.h:384
\n+
PatchDescriptor GetPatchArrayDescriptor(int array) const
Returns the PatchDescriptor for the patches in array.
\n+\n+
void EvaluateBasisVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const
Evaluate basis functions for a varying value and derivatives at a given (u,v) parametric location of ...
\n+
StencilTable const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
Definition patchTable.h:783
\n+
std::vector< unsigned int > QuadOffsetsTable
Definition patchTable.h:389
\n+
ConstIndexArray GetPatchVertices(int array, int patch) const
Returns the control vertex indices for patch in array.
\n+
PatchParam GetPatchFVarPatchParam(PatchHandle const &handle, int channel=0) const
Returns the value indices for a given patch in channel.
\n+
int GetFVarValueStride(int channel=0) const
Returns the stride between patches in the value index array of channel.
\n+
ConstPatchParamArray GetFVarPatchParams(int channel=0) const
Returns an array of face-varying patch param for channel.
\n+
PatchDescriptor GetFVarPatchDescriptor(int channel=0) const
Returns the default/irregular patch descriptor for channel.
\n+
int GetNumLocalPointsVarying() const
Returns the number of local varying points.
\n+
bool LocalPointStencilPrecisionMatchesType() const
Tests if the precision of the stencil table to compute local point vertex values matches the given fl...
\n+
StencilTableReal< REAL > const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
\n+
int GetNumLocalPointsFaceVarying(int channel=0) const
Returns the number of local face-varying points for channel.
\n+
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n+\n+\n+\n+\n+
Stencil table class wrapping the template for compatibility.
\n+\n+\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchMap.h\n+patchTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,238 +24,1002 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_MAP_H\n-26#define OPENSUBDIV3_FAR_PATCH_MAP_H\n+25#ifndef OPENSUBDIV3_FAR_PATCH_TABLE_H\n+26#define OPENSUBDIV3_FAR_PATCH_TABLE_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../far/patchTable.h\"\n-31\n-32#include \n+30#include \"../far/patchDescriptor.h\"\n+31#include \"../far/patchParam.h\"\n+32#include \"../far/stencilTable.h\"\n 33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38\n-_\b4_\b9class _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp {\n-50public:\n-51\n-_\b5_\b2 typedef _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be _\bH_\ba_\bn_\bd_\bl_\be;\n-53\n-_\b5_\b8 _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp( _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable );\n-59\n-74 _\bH_\ba_\bn_\bd_\bl_\be const * _\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh( int patchFaceId, double u, double v ) const;\n-75\n-76private:\n-77 void initializeHandles(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable);\n-78 void initializeQuadtree(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & patchTable);\n+34#include \"../sdc/options.h\"\n+35\n+36#include \n+37\n+38namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+39namespace OPENSUBDIV_VERSION {\n+40\n+41namespace Far {\n+42\n+_\b5_\b5class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be {\n+56\n+57public:\n+58\n+_\b6_\b0 class _\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be {\n+61 // XXXX manuelk members will eventually be made private\n+62 public:\n+63\n+_\b6_\b4 friend class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be;\n+_\b6_\b5 friend class _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp;\n+66\n+_\b6_\b7 _\bI_\bn_\bd_\be_\bx _\ba_\br_\br_\ba_\by_\bI_\bn_\bd_\be_\bx, // Array index of the patch\n+_\b6_\b8 _\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx, // Absolute Index of the patch\n+_\b6_\b9 _\bv_\be_\br_\bt_\bI_\bn_\bd_\be_\bx; // Relative offset to the first CV of the patch in array\n+70 };\n+71\n+72public:\n+73\n+_\b7_\b5 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be(_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const & src);\n+76\n+_\b7_\b8 _\b~_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n 79\n-80private:\n-81 // Quadtree node with 4 children, tree is just a vector of nodes\n-82 struct QuadNode {\n-83 QuadNode() { std::memset(this, 0, sizeof(QuadNode)); }\n-84\n-_\b8_\b5 struct _\bC_\bh_\bi_\bl_\bd {\n-_\b8_\b6 unsigned int _\bi_\bs_\bS_\be_\bt : 1; // true if the child has been set\n-_\b8_\b7 unsigned int _\bi_\bs_\bL_\be_\ba_\bf : 1; // true if the child is a QuadNode\n-_\b8_\b8 unsigned int _\bi_\bn_\bd_\be_\bx : 30; // child index (either QuadNode or Handle)\n-89 };\n+_\b8_\b1 bool _\bI_\bs_\bF_\be_\ba_\bt_\bu_\br_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be() const;\n+82\n+_\b8_\b4 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl() const {\n+85 return (int)_patchVerts.size();\n+86 }\n+87\n+_\b8_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bT_\bo_\bt_\ba_\bl() const;\n 90\n-91 // sets all the children to point to the patch of given index\n-92 void SetChildren(int index);\n+_\b9_\b2 int _\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() const { return _maxValence; }\n 93\n-94 // sets the child in \"quadrant\" to point to the node or patch of the given\n-index\n-95 void SetChild(int quadrant, int index, bool isLeaf);\n+_\b9_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs() const { return _numPtexFaces; }\n 96\n-97 _\bC_\bh_\bi_\bl_\bd children[4];\n-98 };\n-99 typedef std::vector QuadTree;\n-100\n-101 // Internal methods supporting quadtree construction and queries\n-102 void assignRootNode(QuadNode * node, int index);\n-103 QuadNode * assignLeafOrChildNode(QuadNode * node, bool isLeaf, int quad,\n-int index);\n-104\n-105 template \n-106 static int transformUVToQuadQuadrant(T const & median, T & u, T & v);\n-107 template \n-108 static int transformUVToTriQuadrant(T const & median, T & u, T & v, bool &\n-rotated);\n-109\n-110private:\n-111 bool _patchesAreTriangular; // tri and quad assembly and search\n-requirements differ\n-112\n-113 int _minPatchFace; // minimum patch face index supported by the map\n-114 int _maxPatchFace; // maximum patch face index supported by the map\n-115 int _maxDepth; // maximum depth of a patch in the tree\n-116\n-117 std::vector _handles; // all the patches in the PatchTable\n-118 std::vector _quadtree; // quadtree nodes\n-119};\n-120\n-121//\n-122// Given a median value for both U and V, these methods transform a (u,v)\n-pair\n-123// into the quadrant that contains them and returns the quadrant index.\n-124//\n-125// Quadrant indexing for tri and quad patches -- consistent with\n-PatchParam's\n-126// usage of UV bits:\n-127//\n-128// (0,1) o-----o-----o (1,1) (0,1) o (1,0) o-----o-----o (0,0)\n-129// | | | |\\ \\ 1 |\\ 0 |\n-130// | 2 | 3 | | \\ \\ | \\ |\n-131// | | | | 2 \\ \\| 3 \\|\n-132// o-----o-----o o-----o o-----o\n-133// | | | |\\ 3 |\\ \\ 2 |\n-134// | 0 | 1 | | \\ | \\ \\ |\n-135// | | | | 0 \\| 1 \\ \\|\n-136// (0,0) o-----o-----o (1,0) (0,0) o-----o-----o (1,0) o (0,1)\n-137//\n-138// The triangular case also takes and returns/affects the rotation of the\n-139// quadrant being searched and identified (quadrant 3 imparts a rotation).\n-140//\n-141template \n-142inline int\n-143PatchMap::transformUVToQuadQuadrant(T const & median, T & u, T & v) {\n-144\n-145 int uHalf = (u >= median);\n-146 if (uHalf) u -= median;\n-147\n-148 int vHalf = (v >= median);\n-149 if (vHalf) v -= median;\n+97\n+99\n+105\n+_\b1_\b0_\b7 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n+108\n+_\b1_\b1_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n+111\n+_\b1_\b1_\b3 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n+114\n+_\b1_\b1_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array, int patch) const;\n+117\n+_\b1_\b1_\b9 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(int array, int patch) const;\n+121\n+122\n+124\n+130\n+_\b1_\b3_\b2 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const;\n+133\n+_\b1_\b3_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs(int array) const;\n+136\n+_\b1_\b3_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n+139\n+_\b1_\b4_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int array) const;\n+142\n+_\b1_\b4_\b4 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n+145\n+_\b1_\b4_\b7 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by const _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int array) const;\n+149\n 150\n-151 return (vHalf << 1) | uHalf;\n-152}\n-153\n-154template \n-155int inline\n-156PatchMap::transformUVToTriQuadrant(T const & median, T & u, T & v, bool &\n-rotated) {\n-157\n-158 if (!rotated) {\n-159 if (u >= median) {\n-160 u -= median;\n-161 return 1;\n-162 }\n-163 if (v >= median) {\n-164 v -= median;\n-165 return 2;\n-166 }\n-167 if ((u + v) >= median) {\n-168 rotated = true;\n-169 return 3;\n-170 }\n-171 return 0;\n-172 } else {\n-173 if (u < median) {\n-174 v -= median;\n-175 return 1;\n-176 }\n-177 if (v < median) {\n-178 u -= median;\n-179 return 2;\n-180 }\n-181 u -= median;\n-182 v -= median;\n-183 if ((u + v) < median) {\n-184 rotated = false;\n-185 return 3;\n-186 }\n-187 return 0;\n-188 }\n-189}\n-190\n-192inline _\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bH_\ba_\bn_\bd_\bl_\be const *\n-_\b1_\b9_\b3_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh( int faceid, double u, double v ) const {\n-194\n-195 //\n-196 // Reject patch faces not supported by this map, or those corresponding\n-197 // to holes or otherwise unassigned (the root node for a patch will\n-198 // have all or no quadrants set):\n-199 //\n-200 if ((faceid < _minPatchFace) || (faceid > _maxPatchFace)) return 0;\n-201\n-202 QuadNode const * node = &_quadtree[faceid - _minPatchFace];\n+152\n+159\n+_\b1_\b6_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs() const;\n+162\n+164 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n+165\n+167 template \n+_\b1_\b6_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n+169\n+_\b1_\b7_\b2 template bool _\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be()\n+const;\n+173\n+186 template void\n+187 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs(T const *src, T *dst) const;\n+188\n+189\n+_\b1_\b9_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg() const;\n+192\n+194 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n+195\n+197 template \n+_\b1_\b9_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const;\n+199\n+_\b2_\b0_\b2 template bool _\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n+() const;\n 203\n-204 if (!node->children[0].isSet) return 0;\n-205\n-206 //\n-207 // Search the tree for the sub-patch containing the given (u,v)\n-208 //\n-209 assert( (u>=0.0) && (u<=1.0) && (v>=0.0) && (v<=1.0) );\n-210\n-211 double median = 0.5;\n-212 bool triRotated = false;\n-213\n-214 for (int depth = 0; depth <= _maxDepth; ++depth, median *= 0.5) {\n-215\n-216 int quadrant = _patchesAreTriangular\n-217 ? transformUVToTriQuadrant(median, u, v, triRotated)\n-218 : transformUVToQuadQuadrant(median, u, v);\n+216 template void\n+217 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst) const;\n+218\n 219\n-220 // holes should have been rejected at the root node of the face\n-221 assert(node->children[quadrant].isSet);\n+_\b2_\b2_\b1 int _\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(int channel = 0) const;\n 222\n-223 if (node->children[quadrant].isLeaf) {\n-224 return &_handles[node->children[quadrant].index];\n-225 } else {\n-226 node = &_quadtree[node->children[quadrant].index];\n-227 }\n-228 }\n-229 assert(0);\n-230 return 0;\n-231}\n-232\n-233} // end namespace Far\n-234\n-235} // end namespace OPENSUBDIV_VERSION\n-236using namespace OPENSUBDIV_VERSION;\n-237\n-238} // end namespace OpenSubdiv\n-239\n-240#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */\n+224 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel = 0)\n+const;\n+225\n+227 template \n+_\b2_\b2_\b8 _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const * _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int\n+channel = 0) const;\n+229\n+_\b2_\b3_\b2 template bool\n+_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be() const;\n+233\n+248 template void\n+249 _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst, int channel = 0)\n+const;\n+251\n+252\n+254\n+255\n+_\b2_\b5_\b9 typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bu_\bn_\bs_\bi_\bg_\bn_\be_\bd_\b _\bi_\bn_\bt_\b> _\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by;\n+260\n+_\b2_\b6_\b2 _\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle)\n+const;\n+263\n+_\b2_\b6_\b4 typedef std::vector _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be;\n+265\n+_\b2_\b6_\b7 _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be() const {\n+268 return _vertexValenceTable;\n+269 }\n+271\n+272\n+274\n+280\n+_\b2_\b8_\b3 float _\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n+284\n+_\b2_\b8_\b7 float _\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be(int array, int patch) const;\n+289\n+290\n+292\n+298\n+_\b3_\b0_\b0 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() const;\n+301\n+_\b3_\b0_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle) const;\n+304\n+_\b3_\b0_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array, int patch) const;\n+307\n+_\b3_\b0_\b9 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(int array) const;\n+310\n+_\b3_\b1_\b2 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+314\n+315\n+317\n+323\n+_\b3_\b2_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const;\n+326\n+_\b3_\b2_\b8 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bR_\be_\bg_\bu_\bl_\ba_\br(int channel = 0) const;\n+329\n+_\b3_\b3_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bI_\br_\br_\be_\bg_\bu_\bl_\ba_\br(int channel = 0) const;\n+332\n+_\b3_\b3_\b4 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int channel = 0) const;\n+335\n+_\b3_\b3_\b7 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, int channel\n+= 0) const;\n+338\n+_\b3_\b4_\b0 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int array, int patch, int channel = 0)\n+const;\n+341\n+_\b3_\b4_\b3 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int array, int channel = 0) const;\n+344\n+_\b3_\b4_\b6 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs(int channel = 0) const;\n+347\n+_\b3_\b4_\b9 int _\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bS_\bt_\br_\bi_\bd_\be(int channel = 0) const;\n+350\n+_\b3_\b5_\b2 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, int channel =\n+0) const;\n+353\n+_\b3_\b5_\b5 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm(int array, int patch, int channel = 0)\n+const;\n+356\n+_\b3_\b5_\b8 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int array, int channel =\n+0) const;\n+359\n+_\b3_\b6_\b1 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int channel = 0) const;\n+362\n+_\b3_\b6_\b4 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn _\bG_\be_\bt_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn(int\n+channel = 0) const;\n+366\n+367\n+369\n+374\n+_\b3_\b7_\b5 typedef std::vector _\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be;\n+376\n+_\b3_\b7_\b8 _\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\ba_\bb_\bl_\be() const { return\n+_patchVerts; }\n+379\n+_\b3_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be() const { return _paramTable; }\n+382\n+_\b3_\b8_\b4 std::vector const &_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\be_\bx_\bT_\ba_\bb_\bl_\be() const { return\n+_sharpnessIndices; }\n+385\n+_\b3_\b8_\b7 std::vector const &_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs() const { return\n+_sharpnessValues; }\n+388\n+_\b3_\b8_\b9 typedef std::vector _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be;\n+390\n+_\b3_\b9_\b2 _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be const & _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be() const {\n+393 return _quadOffsetsTable;\n+394 }\n+396\n+_\b3_\b9_\b8 void _\bp_\br_\bi_\bn_\bt() const;\n+399\n+400public:\n+401\n+403\n+405\n+428 template \n+_\b4_\b2_\b9 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n+430 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n+431 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;\n+432\n+435 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n+436 float wP[], float wDu[] = 0, float wDv[] = 0,\n+437 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;\n+438\n+441 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n+442 double wP[], double wDu[] = 0, double wDv[] = 0,\n+443 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;\n+444\n+467 template \n+_\b4_\b6_\b8 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n+469 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n+470 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0) const;\n+471\n+474 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n+475 float wP[], float wDu[] = 0, float wDv[] = 0,\n+476 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0) const;\n+477\n+480 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n+481 double wP[], double wDu[] = 0, double wDv[] = 0,\n+482 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0) const;\n+483\n+508 template \n+_\b5_\b0_\b9 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, REAL u, REAL v,\n+510 REAL wP[], REAL wDu[] = 0, REAL wDv[] = 0,\n+511 REAL wDuu[] = 0, REAL wDuv[] = 0, REAL wDvv[] = 0,\n+512 int channel = 0) const;\n+513\n+516 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n+517 float wP[], float wDu[] = 0, float wDv[] = 0,\n+518 float wDuu[] = 0, float wDuv[] = 0, float wDvv[] = 0,\n+519 int channel = 0) const;\n+520\n+523 void _\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double\n+v,\n+524 double wP[], double wDu[] = 0, double wDv[] = 0,\n+525 double wDuu[] = 0, double wDuv[] = 0, double wDvv[] = 0,\n+526 int channel = 0) const;\n+528\n+529protected:\n+530\n+_\b5_\b3_\b1 friend class _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br;\n+532\n+533 // Factory constructor\n+_\b5_\b3_\b4 _\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be(int maxvalence);\n+535\n+_\b5_\b3_\b6 _\bI_\bn_\bd_\be_\bx _\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx(int array, int patch) const;\n+537\n+_\b5_\b3_\b8 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by _\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs(int arrayIndex);\n+539\n+_\b5_\b4_\b0 _\bI_\bn_\bd_\be_\bx * _\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\bi_\bc_\be_\bs(_\bI_\bn_\bd_\be_\bx arrayIndex);\n+_\b5_\b4_\b1 float * _\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs(_\bI_\bn_\bd_\be_\bx arrayIndex);\n+542\n+543private:\n+544\n+545 //\n+546 // Patch arrays\n+547 //\n+548 struct PatchArray {\n+549 PatchArray(_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br d, int np, _\bI_\bn_\bd_\be_\bx v, _\bI_\bn_\bd_\be_\bx p, _\bI_\bn_\bd_\be_\bx qo) :\n+550 desc(d), numPatches(np), vertIndex(v),\n+551 patchIndex(p), quadOffsetIndex (qo) { }\n+552\n+553 void print() const;\n+554\n+555 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br desc; // type of patches in the array\n+556\n+557 int numPatches; // number of patches in the array\n+558\n+559 _\bI_\bn_\bd_\be_\bx vertIndex, // index to the first control vertex\n+560 patchIndex, // absolute index of the first patch in the array\n+561 quadOffsetIndex; // index of the first quad offset entry\n+562 };\n+563\n+564 typedef std::vector PatchArrayVector;\n+565\n+566 PatchArray & getPatchArray(_\bI_\bn_\bd_\be_\bx arrayIndex);\n+567 PatchArray const & getPatchArray(_\bI_\bn_\bd_\be_\bx arrayIndex) const;\n+568\n+569 void reservePatchArrays(int numPatchArrays);\n+570 void pushPatchArray(PatchDescriptor desc, int npatches,\n+571 _\bI_\bn_\bd_\be_\bx * vidx, _\bI_\bn_\bd_\be_\bx * pidx, _\bI_\bn_\bd_\be_\bx * qoidx=0);\n+572\n+573 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchArrayVertices(int arrayIndex);\n+574\n+575 _\bI_\bn_\bd_\be_\bx findPatchArray(PatchDescriptor desc);\n+576\n+577\n+578 //\n+579 // Varying patch arrays\n+580 //\n+581 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchArrayVaryingVertices(int arrayIndex);\n+582\n+583 void allocateVaryingVertices(\n+584 PatchDescriptor desc, int numPatches);\n+585 void populateVaryingVertices();\n+586\n+587 //\n+588 // Face-varying patch channels\n+589 //\n+590\n+591 //\n+592 // FVarPatchChannel\n+593 //\n+594 // Stores a record for each patch in the primitive :\n+595 //\n+596 // - Each patch in the PatchTable has a corresponding patch in each\n+597 // face-varying patch channel. Patch vertex indices are sorted in the same\n+598 // patch-type order as PatchTable::PTables. Face-varying data for a patch\n+599 // can therefore be quickly accessed by using the patch primitive ID as\n+600 // index into patchValueOffsets to locate the face-varying control vertex\n+601 // indices.\n+602 //\n+603 // - Face-varying channels can have a different interpolation modes\n+604 //\n+605 // - Unlike \"vertex\" patches, there are no transition masks required\n+606 // for face-varying patches.\n+607 //\n+608 // - Face-varying patches still require boundary edge masks.\n+609 //\n+610 // - currently most patches with sharp boundaries but smooth interiors have\n+611 // to be isolated to level 10 : we need a special type of bicubic patch\n+612 // similar to single-crease to resolve this condition without requiring\n+613 // isolation if possible\n+614 //\n+615 struct FVarPatchChannel {\n+616 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn interpolation;\n+617\n+618 PatchDescriptor regDesc;\n+619 PatchDescriptor irregDesc;\n+620\n+621 int stride;\n+622\n+623 std::vector patchValues;\n+624 std::vector patchParam;\n+625 };\n+626 typedef std::vector FVarPatchChannelVector;\n+627\n+628 FVarPatchChannel & getFVarPatchChannel(int channel);\n+629 FVarPatchChannel const & getFVarPatchChannel(int channel) const;\n+630\n+631 void allocateFVarPatchChannels(int numChannels);\n+632 void allocateFVarPatchChannelValues(\n+633 PatchDescriptor regDesc, PatchDescriptor irregDesc,\n+634 int numPatches, int channel);\n+635\n+636 // deprecated\n+637 void setFVarPatchChannelLinearInterpolation(\n+638 _\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn interpolation, int channel);\n+639\n+640 _\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getFVarValues(int channel);\n+641 _\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by getPatchFVarValues(int patch, int channel) const;\n+642\n+643 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by getFVarPatchParams(int channel);\n+644 PatchParam getPatchFVarPatchParam(int patch, int channel) const;\n+645\n+646private:\n+647 //\n+648 // Simple private class to hold stencil table pointers of varying\n+precision,\n+649 // where the discriminant of the precision is external.\n+650 //\n+651 // NOTE that this is a simple pointer container and NOT a smart pointer\n+that\n+652 // manages the ownership of the object referred to by it.\n+653 //\n+654 class StencilTablePtr {\n+655 private:\n+656 typedef StencilTableReal float_type;\n+657 typedef StencilTableReal double_type;\n+658\n+659 union {\n+660 float_type * _fPtr;\n+661 double_type * _dPtr;\n+662 };\n+663\n+664 public:\n+665 StencilTablePtr() { _fPtr = 0; }\n+666 StencilTablePtr(float_type * ptr) { _fPtr = ptr; }\n+667 StencilTablePtr(double_type * ptr) { _dPtr = ptr; }\n+668\n+669 operator bool() const { return _fPtr != 0; }\n+670\n+671 void Set() { _fPtr = 0; }\n+672 void Set(float_type * ptr) { _fPtr = ptr; }\n+673 void Set(double_type * ptr) { _dPtr = ptr; }\n+674\n+675 template StencilTableReal * Get() const;\n+676 };\n+677\n+678private:\n+679\n+680 //\n+681 // Topology\n+682 //\n+683\n+684 int _maxValence, // highest vertex valence found in the mesh\n+685 _numPtexFaces; // total number of ptex faces\n+686\n+687 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _patchArrays; // Vector of descriptors for arrays of\n+patches\n+688\n+689 std::vector _patchVerts; // Indices of the control vertices of the\n+patches\n+690\n+691 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be _paramTable; // PatchParam bitfields (one per patch)\n+692\n+693 //\n+694 // Extraordinary vertex closed-form evaluation / endcap basis conversion\n+695 //\n+696 // XXXtakahito: these data will probably be replaced with mask coefficient\n+or something\n+697 // SchemeWorker populates.\n+698 //\n+699 _\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be _quadOffsetsTable; // Quad offsets (for Gregory patches)\n+700 _\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be _vertexValenceTable; // Vertex valence table (for\n+Gregory patches)\n+701\n+702 StencilTablePtr _localPointStencils; // local point conversion stencils\n+703 StencilTablePtr _localPointVaryingStencils; // local point varying stencils\n+704\n+705 //\n+706 // Varying data\n+707 //\n+708 PatchDescriptor _varyingDesc;\n+709\n+710 std::vector _varyingVerts;\n+711\n+712 //\n+713 // Face-varying data\n+714 //\n+715 FVarPatchChannelVector _fvarChannels;\n+716\n+717 std::vector _localPointFaceVaryingStencils;\n+718\n+719 //\n+720 // 'single-crease' patch sharpness tables\n+721 //\n+722 std::vector _sharpnessIndices; // Indices of single-crease sharpness\n+(one per patch)\n+723 std::vector _sharpnessValues; // Sharpness values.\n+724\n+725 //\n+726 // Construction history -- relevant to at least one public query:\n+727 //\n+728 unsigned int _isUniformLinear : 1;\n+729\n+730 //\n+731 // Precision -- only applies to local-point stencil tables\n+732 //\n+733 unsigned int _vertexPrecisionIsDouble : 1;\n+734 unsigned int _varyingPrecisionIsDouble : 1;\n+735 unsigned int _faceVaryingPrecisionIsDouble : 1;\n+736};\n+737\n+738\n+739//\n+740// Template specializations for float/double -- to be defined before used:\n+741//\n+742template <> inline StencilTableReal *\n+743PatchTable::StencilTablePtr::Get() const { return _fPtr; }\n+744\n+745template <> inline StencilTableReal *\n+746PatchTable::StencilTablePtr::Get() const { return _dPtr; }\n+747\n+_\b7_\b4_\b8template <> inline bool\n+749PatchTable::LocalPointStencilPrecisionMatchesType() const {\n+750 return !_vertexPrecisionIsDouble;\n+751}\n+_\b7_\b5_\b2template <> inline bool\n+753PatchTable::LocalPointVaryingStencilPrecisionMatchesType() const {\n+754 return !_varyingPrecisionIsDouble;\n+755}\n+_\b7_\b5_\b6template <> inline bool\n+757PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType() const\n+{\n+758 return !_faceVaryingPrecisionIsDouble;\n+759}\n+760\n+_\b7_\b6_\b1template <> inline bool\n+762PatchTable::LocalPointStencilPrecisionMatchesType() const {\n+763 return _vertexPrecisionIsDouble;\n+764}\n+_\b7_\b6_\b5template <> inline bool\n+766PatchTable::LocalPointVaryingStencilPrecisionMatchesType() const {\n+767 return _varyingPrecisionIsDouble;\n+768}\n+_\b7_\b6_\b9template <> inline bool\n+770PatchTable::LocalPointFaceVaryingStencilPrecisionMatchesType() const\n+{\n+771 return _faceVaryingPrecisionIsDouble;\n+772}\n+773\n+774//\n+775// StencilTable access -- backward compatible and generic:\n+776//\n+777inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n+_\b7_\b7_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n+779 assert(LocalPointStencilPrecisionMatchesType());\n+780 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(_localPointStencils.Get());\n+781}\n+782inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n+_\b7_\b8_\b3_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n+784 assert(LocalPointVaryingStencilPrecisionMatchesType());\n+785 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+786 _localPointVaryingStencils.Get());\n+787}\n+788inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *\n+_\b7_\b8_\b9_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel) const {\n+790 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n+791 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n+792 return static_cast<_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *>(\n+793 _localPointFaceVaryingStencils[channel].Get());\n+794 }\n+795 return NULL;\n+796}\n+797\n+798template \n+799inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n+_\b8_\b0_\b0_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n+801 assert(LocalPointStencilPrecisionMatchesType());\n+802 return _localPointStencils.Get();\n+803}\n+804template \n+805inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n+_\b8_\b0_\b6_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be() const {\n+807 assert(LocalPointVaryingStencilPrecisionMatchesType());\n+808 return _localPointVaryingStencils.Get();\n+809}\n+810template \n+811inline _\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl_\b<_\bR_\bE_\bA_\bL_\b> const *\n+_\b8_\b1_\b2_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(int channel) const {\n+813 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n+814 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n+815 return _localPointFaceVaryingStencils[channel].Get();\n+816 }\n+817 return NULL;\n+818}\n+819\n+820\n+821//\n+822// Computation of local point values:\n+823//\n+824template \n+825inline void\n+_\b8_\b2_\b6_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs(T const *src, T *dst) const {\n+827 assert(LocalPointStencilPrecisionMatchesType());\n+828 if (_localPointStencils) {\n+829 _localPointStencils.Get()->UpdateValues(src, dst);\n+830 }\n+831}\n+832\n+833template \n+834inline void\n+_\b8_\b3_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst) const {\n+836 assert(LocalPointVaryingStencilPrecisionMatchesType());\n+837 if (_localPointVaryingStencils) {\n+838 _localPointVaryingStencils.Get()->UpdateValues(src, dst);\n+839 }\n+840}\n+841\n+842template \n+843inline void\n+_\b8_\b4_\b4_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(T const *src, T *dst, int\n+channel) const {\n+845 assert(LocalPointFaceVaryingStencilPrecisionMatchesType());\n+846 if (channel >= 0 && channel < (int)_localPointFaceVaryingStencils.size()) {\n+847 if (_localPointFaceVaryingStencils[channel]) {\n+848 _localPointFaceVaryingStencils[channel].Get()->UpdateValues(src,\n+dst);\n+849 }\n+850 }\n+851}\n+852\n+853\n+854//\n+855// Basis evaluation overloads\n+856//\n+857inline void\n+_\b8_\b5_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float v,\n+859 float wP[], float wDu[], float wDv[],\n+860 float wDuu[], float wDuv[], float wDvv[]) const {\n+861\n+862 EvaluateBasis(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n+863}\n+864inline void\n+_\b8_\b6_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u, double v,\n+866 double wP[], double wDu[], double wDv[],\n+867 double wDuu[], double wDuv[], double wDvv[]) const {\n+868\n+869 EvaluateBasis(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n+870}\n+871\n+872inline void\n+_\b8_\b7_\b3_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u, float\n+v,\n+874 float wP[], float wDu[], float wDv[],\n+875 float wDuu[], float wDuv[], float wDvv[]) const {\n+876\n+877 EvaluateBasisVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n+878}\n+879inline void\n+_\b8_\b8_\b0_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u,\n+double v,\n+881 double wP[], double wDu[], double wDv[],\n+882 double wDuu[], double wDuv[], double wDvv[]) const {\n+883\n+884 EvaluateBasisVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv, wDvv);\n+885}\n+886\n+887inline void\n+_\b8_\b8_\b8_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, float u,\n+float v,\n+889 float wP[], float wDu[], float wDv[],\n+890 float wDuu[], float wDuv[], float wDvv[], int channel) const {\n+891\n+892 EvaluateBasisFaceVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv,\n+wDvv, channel);\n+893}\n+894inline void\n+_\b8_\b9_\b5_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be const & handle, double u,\n+double v,\n+896 double wP[], double wDu[], double wDv[],\n+897 double wDuu[], double wDuv[], double wDvv[], int channel) const {\n+898\n+899 EvaluateBasisFaceVarying(handle, u, v, wP, wDu, wDv, wDuu, wDuv,\n+wDvv, channel);\n+900}\n+901\n+902} // end namespace Far\n+903\n+904} // end namespace OPENSUBDIV_VERSION\n+905using namespace OPENSUBDIV_VERSION;\n+906\n+907} // end namespace OpenSubdiv\n+908\n+909#endif /* OPENSUBDIV3_FAR_PATCH_TABLE */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Vtr::ConstIndexArray ConstIndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n+std::vector< PatchParam > PatchParamTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx_\bA_\br_\br_\ba_\by\n+Vtr::IndexArray IndexArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n+Vtr::Array< PatchParam > PatchParamArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchArray > PatchArrayVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+Describes the type of a patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b4\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n An quadtree-based map connecting coarse faces to their sub-patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp\n-PatchMap(PatchTable const &patchTable)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bF_\bi_\bn_\bd_\bP_\ba_\bt_\bc_\bh\n-Handle const * FindPatch(int patchFaceId, double u, double v) const\n-Returns a handle to the sub-patch of the face at the given (u,v). Note that the\n-patch face ID corresp...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b1_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bH_\ba_\bn_\bd_\bl_\be\n-PatchTable::PatchHandle Handle\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bs_\bL_\be_\ba_\bf\n-unsigned int isLeaf\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bn_\bd_\be_\bx\n-unsigned int index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b:_\b:_\bQ_\bu_\ba_\bd_\bN_\bo_\bd_\be_\b:_\b:_\bC_\bh_\bi_\bl_\bd_\b:_\b:_\bi_\bs_\bS_\be_\bt\n-unsigned int isSet\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+Patch parameterization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b5_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n Container for arrays of parametric patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchArrayVaryingVertices(int array) const\n+Returns the varying vertex indices for the patches in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs\n+float * getSharpnessValues(Index arrayIndex)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\ba_\bb_\bl_\be\n+PatchVertsTable const & GetPatchControlVerticesTable() const\n+Get the table of patch control vertices.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void ComputeLocalPointValuesFaceVarying(T const *src, T *dst, int channel=0)\n+const\n+Updates local point face-varying values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetVaryingVertices() const\n+Returns an array of varying vertex indices for the patches.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void ComputeLocalPointValuesVarying(T const *src, T *dst) const\n+Updates local point varying values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchVaryingVertices(PatchHandle const &handle) const\n+Returns the varying vertex indices for a given patch.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bI_\bs_\bF_\be_\ba_\bt_\bu_\br_\be_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n+bool IsFeatureAdaptive() const\n+True if the patches are of feature adaptive types.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bM_\ba_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n+int GetMaxValence() const\n+Returns max vertex valence.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTableReal< REAL > const * GetLocalPointStencilTable() const\n+Returns the stencil table to compute local point vertex values.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable const * GetLocalPointStencilTable() const\n+Returns the stencil table to compute local point vertex values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n+PatchParamArray getPatchParams(int arrayIndex)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+ConstIndexArray GetPatchArrayFVarValues(int array, int channel=0) const\n+Returns the value indices for the patches in array in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be_\bs\n+std::vector< float > const & GetSharpnessValues() const\n+Returns sharpness values table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be\n+std::vector< Index > VertexValenceTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+PatchParam GetPatchFVarPatchParam(int array, int patch, int channel=0) const\n+Returns the face-varying params for a given patch channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\ba_\br_\by_\bi_\bn_\bg_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchVaryingVertices(int array, int patch) const\n+Returns the varying vertex indices for a given patch.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+PatchTable(PatchTable const &src)\n+Copy constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+int GetNumPatchArrays() const\n+Returns the number of patch arrays in the table.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchVertices(PatchHandle const &handle) const\n+Returns the control vertex indices for the patch identified by handle.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+PatchTable(int maxvalence)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n+bool LocalPointFaceVaryingStencilPrecisionMatchesType() const\n+Tests if the precision of the stencil table to compute local point face-varying\n+values matches the gi...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n+PatchParamTable const & GetPatchParamTable() const\n+Returns the PatchParamTable (PatchParams order matches patch array sorting)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bT_\ba_\bb_\bl_\be\n+VertexValenceTable const & GetVertexValenceTable() const\n+Returns the 'VertexValences' table (vertex neighborhoods table)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable const * GetLocalPointFaceVaryingStencilTable(int channel=0) const\n+Returns the stencil table to compute local point face-varying values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumControlVertices(int array) const\n+Returns the number of control vertices in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+~PatchTable()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void EvaluateBasisFaceVarying(PatchHandle const &handle, REAL u, REAL v, REAL\n+wP[], REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0,\n+int channel=0) const\n+Evaluate basis functions for a face-varying value and derivatives at a given\n+(u,v) parametric locatio...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs\n+ConstQuadOffsetsArray GetPatchQuadOffsets(PatchHandle const &handle) const\n+Returns the 'QuadOffsets' for the Gregory patch identified by handle.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bI_\br_\br_\be_\bg_\bu_\bl_\ba_\br\n+PatchDescriptor GetFVarPatchDescriptorIrregular(int channel=0) const\n+Returns the irregular patch descriptor for channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be\n+float GetSingleCreasePatchSharpnessValue(int array, int patch) const\n+Returns the crease sharpness for the patch in array if it is a single-crease\n+patch,...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\bi_\bc_\be_\bs\n+Index * getSharpnessIndices(Index arrayIndex)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\bl_\bu_\be_\bs\n+void ComputeLocalPointValues(T const *src, T *dst) const\n+Updates local point vertex values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bS_\bi_\bn_\bg_\bl_\be_\bC_\br_\be_\ba_\bs_\be_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bV_\ba_\bl_\bu_\be\n+float GetSingleCreasePatchSharpnessValue(PatchHandle const &handle) const\n+Returns the crease sharpness for the patch identified by handle if it is a\n+single-crease patch,...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+PatchParam GetPatchParam(int array, int patch) const\n+Returns the PatchParam for patch in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+ConstIndexArray GetPatchFVarValues(int array, int patch, int channel=0) const\n+Returns the value indices for a given patch in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bR_\be_\bg_\bu_\bl_\ba_\br\n+PatchDescriptor GetFVarPatchDescriptorRegular(int channel=0) const\n+Returns the regular patch descriptor for channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor GetPatchDescriptor(PatchHandle const &handle) const\n+Returns the PatchDescriptor for the patch identified by handle.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bs_\bT_\ba_\bb_\bl_\be\n+std::vector< Index > PatchVertsTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be\n+QuadOffsetsTable const & GetQuadOffsetsTable() const\n+Returns the quad-offsets table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+int GetNumPatches(int array) const\n+Returns the number of patches in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor GetVaryingPatchDescriptor() const\n+Returns the varying patch descriptor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+ConstIndexArray GetPatchFVarValues(PatchHandle const &handle, int channel=0)\n+const\n+Returns the value indices for a given patch in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n+ConstPatchParamArray const GetPatchParams(int array) const\n+Returns the PatchParams for the patches in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs_\bT_\bo_\bt_\ba_\bl\n+int GetNumControlVerticesTotal() const\n+Returns the total number of control vertex indices in the table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int GetNumFVarChannels() const\n+Returns the number of face-varying channels.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n+ConstPatchParamArray GetPatchArrayFVarPatchParams(int array, int channel=0)\n+const\n+Returns the face-varying for a given patch in array in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bg_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx\n+Index getPatchIndex(int array, int patch) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs\n+int GetNumLocalPoints() const\n+Returns the number of local vertex points.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n+bool LocalPointVaryingStencilPrecisionMatchesType() const\n+Tests if the precision of the stencil table to compute local point varying\n+values matches the given f...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchArrayVertices(int array) const\n+Returns the control vertex indices for the patches in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\bt_\be_\bx_\bF_\ba_\bc_\be_\bs\n+int GetNumPtexFaces() const\n+Returns the total number of ptex faces in the mesh.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bs\n+ConstIndexArray GetFVarValues(int channel=0) const\n+Returns an array of value indices for the patches in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bA_\br_\br_\ba_\by\n+Vtr::ConstArray< unsigned int > ConstQuadOffsetsArray\n+Accessors for the gregory patch evaluation buffers. These methods will be\n+deprecated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs\n+void EvaluateBasis(PatchHandle const &handle, REAL u, REAL v, REAL wP[], REAL\n+wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const\n+Evaluate basis functions for position and derivatives at a given (u,v)\n+parametric location of a patch...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTableReal< REAL > const * GetLocalPointFaceVaryingStencilTable(int\n+channel=0) const\n+Returns the stencil table to compute local point face-varying values.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bT_\bo_\bt_\ba_\bl\n+int GetNumPatchesTotal() const\n+Returns the total number of patches stored in the table.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+PatchParam GetPatchParam(PatchHandle const &handle) const\n+Returns a PatchParam for the patch identified by handle.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bp_\br_\bi_\bn_\bt\n+void print() const\n+debug helper\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+Sdc::Options::FVarLinearInterpolation GetFVarChannelLinearInterpolation(int\n+channel=0) const\n+Deprecated.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bI_\bn_\bd_\be_\bx_\bT_\ba_\bb_\bl_\be\n+std::vector< Index > const & GetSharpnessIndexTable() const\n+Returns a sharpness index table for each patch (if exists)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor GetPatchArrayDescriptor(int array) const\n+Returns the PatchDescriptor for the patches in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\bB_\bu_\bi_\bl_\bd_\be_\br\n+friend class PatchTableBuilder\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\be_\bB_\ba_\bs_\bi_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+void EvaluateBasisVarying(PatchHandle const &handle, REAL u, REAL v, REAL wP[],\n+REAL wDu[]=0, REAL wDv[]=0, REAL wDuu[]=0, REAL wDuv[]=0, REAL wDvv[]=0) const\n+Evaluate basis functions for a varying value and derivatives at a given (u,v)\n+parametric location of ...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTable const * GetLocalPointVaryingStencilTable() const\n+Returns the stencil table to compute local point varying values.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bT_\ba_\bb_\bl_\be\n+std::vector< unsigned int > QuadOffsetsTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b3_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+ConstIndexArray GetPatchVertices(int array, int patch) const\n+Returns the control vertex indices for patch in array.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+PatchParam GetPatchFVarPatchParam(PatchHandle const &handle, int channel=0)\n+const\n+Returns the value indices for a given patch in channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bV_\ba_\bl_\bu_\be_\bS_\bt_\br_\bi_\bd_\be\n+int GetFVarValueStride(int channel=0) const\n+Returns the stride between patches in the value index array of channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bs\n+ConstPatchParamArray GetFVarPatchParams(int channel=0) const\n+Returns an array of face-varying patch param for channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor GetFVarPatchDescriptor(int channel=0) const\n+Returns the default/irregular patch descriptor for channel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+int GetNumLocalPointsVarying() const\n+Returns the number of local varying points.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bP_\br_\be_\bc_\bi_\bs_\bi_\bo_\bn_\bM_\ba_\bt_\bc_\bh_\be_\bs_\bT_\by_\bp_\be\n+bool LocalPointStencilPrecisionMatchesType() const\n+Tests if the precision of the stencil table to compute local point vertex\n+values matches the given fl...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+StencilTableReal< REAL > const * GetLocalPointVaryingStencilTable() const\n+Returns the stencil table to compute local point varying values.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bL_\bo_\bc_\ba_\bl_\bP_\bo_\bi_\bn_\bt_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+int GetNumLocalPointsFaceVarying(int channel=0) const\n+Returns the number of local face-varying points for channel.\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be\n Handle that can be used as unique patch identifier within PatchTable.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bp_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx\n+Index patchIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\ba_\br_\br_\ba_\by_\bI_\bn_\bd_\be_\bx\n+Index arrayIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bH_\ba_\bn_\bd_\bl_\be_\b:_\b:_\bv_\be_\br_\bt_\bI_\bn_\bd_\be_\bx\n+Index vertIndex\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bR_\be_\ba_\bl\n+Table of subdivision stencils.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b1_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bF_\bV_\ba_\br_\bL_\bi_\bn_\be_\ba_\br_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+FVarLinearInterpolation\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b1_\b0_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bM_\ba_\bp_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00737.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00737.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchDescriptor.h File Reference\n+OpenSubdiv: opensubdiv/far/patchParam.h File Reference\n \n \n \n \n \n \n \n@@ -91,48 +91,50 @@\n \n \n
\n \n-
patchDescriptor.h File Reference
\n+
patchParam.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../far/types.h"
\n-#include "../sdc/types.h"
\n-#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n

\n Classes

class  PatchDescriptor
 Describes the type of a patch. More...
struct  PatchParam
 Patch parameterization. More...
 
\n \n \n \n \n \n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
\n \n-\n-\n+\n+\n+\n+\n+\n+\n

\n Typedefs

typedef Vtr::ConstArray< PatchDescriptorConstPatchDescriptorArray
 
typedef std::vector< PatchParamPatchParamTable
 
typedef Vtr::Array< PatchParamPatchParamArray
 
typedef Vtr::ConstArray< PatchParamConstPatchParamArray
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,29 +1,31 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-patchDescriptor.h File Reference\n+patchParam.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-\u00a0 Describes the type of a patch. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+\u00a0 Patch parameterization. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n-typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br >\u00a0 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by\n+ typedef std::vector< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n+\u00a0\n+ typedef _\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n+\u00a0\n+typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00737.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00737.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,6 @@\n var a00737 = [\n- [\"PatchDescriptor\", \"a00973.html\", \"a00973\"],\n- [\"ConstPatchDescriptorArray\", \"a00737.html#ad258c2d8f7871bc0d40cf3a9ded6e08a\", null]\n+ [\"PatchParam\", \"a00989.html\", \"a00989\"],\n+ [\"ConstPatchParamArray\", \"a00737.html#a3139c7c52ddf26b2403e8e95ff63eeb3\", null],\n+ [\"PatchParamArray\", \"a00737.html#abe07210a029a01571c54276ae28b4d88\", null],\n+ [\"PatchParamTable\", \"a00737.html#a46ea68db89cc3d55c4191ef7648281ce\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00737_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00737_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchDescriptor.h Source File\n+OpenSubdiv: opensubdiv/far/patchParam.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchDescriptor.h
\n+
patchParam.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,226 +119,214 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_PARAM_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_PARAM_H
\n
27
\n
28#include "../version.h"
\n
29
\n
30#include "../far/types.h"
\n-
31#include "../sdc/types.h"
\n-
32
\n-
33#include <vector>
\n+
31
\n+
32namespace OpenSubdiv {
\n+
33namespace OPENSUBDIV_VERSION {
\n
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Far {
\n-
39
\n-
\n-\n-
45
\n-
46public:
\n-
47
\n-
\n-
48 enum Type {
\n-\n-
50
\n-\n-\n-
53
\n-\n-\n-
56
\n-\n-
58
\n-\n-\n-\n-\n-\n-
64 };
\n-
\n-
65
\n-
66public:
\n-
67
\n-
\n-\n-
70 _type(NON_PATCH) { }
\n-
\n-
71
\n-
\n-
73 PatchDescriptor(int type) :
\n-
74 _type(type) { }
\n-
\n-
75
\n-
\n-\n-
78 _type(d.GetType()) { }
\n-
\n-
79
\n-
\n-\n-
82 _type = d.GetType();
\n-
83 return *this;
\n-
84 }
\n-
\n-
85
\n-
\n-
87 Type GetType() const {
\n-
88 return (Type)_type;
\n-
89 }
\n-
\n-
90
\n-
\n-
92 static inline bool IsAdaptive(Type type) {
\n-
93 return type > TRIANGLES;
\n-
94 }
\n-
\n-
95
\n-
\n-
97 bool IsAdaptive() const {
\n-
98 return IsAdaptive( this->GetType() );
\n-
99 }
\n-
\n-
100
\n-
103 static inline short GetNumControlVertices( Type t );
\n-
104
\n-
106 static inline short GetNumFVarControlVertices( Type t );
\n-
107
\n-
\n-
110 short GetNumControlVertices() const {
\n-
111 return GetNumControlVertices( this->GetType() );
\n-
112 }
\n-
\n-
113
\n-
\n-\n-
116 return GetNumFVarControlVertices( this->GetType() );
\n-
117 }
\n-
\n-
118
\n-
120 static short GetRegularPatchSize() { return 16; }
\n-
121
\n-
123 static short GetGregoryPatchSize() { return 4; }
\n-
124
\n-
126 static short GetGregoryBasisPatchSize() { return 20; }
\n-
127
\n-
128
\n-\n-
132
\n-
134 inline bool operator < ( PatchDescriptor const other ) const;
\n-
135
\n-
137 inline bool operator == ( PatchDescriptor const other ) const;
\n-
138
\n-
139 // debug helper
\n-
140 void print() const;
\n-
141
\n-
142private:
\n-
143 unsigned int _type;
\n-
144};
\n-
\n-
145
\n-\n-
147
\n-
148// Returns the number of control vertices expected for a patch of this type
\n-
149inline short
\n-
\n-\n-
151 switch (type) {
\n-
152 case REGULAR : return GetRegularPatchSize();
\n-
153 case LOOP : return 12;
\n-
154 case QUADS : return 4;
\n-
155 case GREGORY :
\n-\n-\n-
158 case GREGORY_TRIANGLE : return 18;
\n-
159 case TRIANGLES : return 3;
\n-
160 case LINES : return 2;
\n-
161 case POINTS : return 1;
\n-
162 default : return -1;
\n-
163 }
\n-
164}
\n-
\n-
165
\n-
166// Returns the number of face-varying control vertices expected for a patch of this type
\n-
167inline short
\n-\n-
171
\n-
172// Allows ordering of patches by type
\n-
\n-
173inline bool
\n-\n-
175 return (_type < other._type);
\n-
176}
\n-
\n-
177
\n-
178// True if the descriptors are identical
\n-
179inline bool
\n-
\n-\n-
181 return _type == other._type;
\n-
182}
\n-
\n-
183
\n-
184
\n-
185
\n-
186} // end namespace Far
\n-
187
\n-
188} // end namespace OPENSUBDIV_VERSION
\n-
189using namespace OPENSUBDIV_VERSION;
\n-
190
\n-
191} // end namespace OpenSubdiv
\n+
35namespace Far {
\n+
36
\n+
101
\n+
\n+\n+
168 void Set(Index faceid, short u, short v,
\n+
169 unsigned short depth, bool nonquad,
\n+
170 unsigned short boundary, unsigned short transition,
\n+
171 bool regular = false);
\n+
172
\n+
174 void Clear() { field0 = field1 = 0; }
\n+
175
\n+
177 Index GetFaceId() const { return Index(unpack(field0,28,0)); }
\n+
178
\n+
181 unsigned short GetU() const { return (unsigned short)unpack(field1,10,22); }
\n+
182
\n+
185 unsigned short GetV() const { return (unsigned short)unpack(field1,10,12); }
\n+
186
\n+
188 unsigned short GetTransition() const { return (unsigned short)unpack(field0,4,28); }
\n+
189
\n+
191 unsigned short GetBoundary() const { return (unsigned short)unpack(field1,5,7); }
\n
192
\n-
193#endif /* OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H */
\n+
194 bool NonQuadRoot() const { return (unpack(field1,1,4) != 0); }
\n+
195
\n+
197 unsigned short GetDepth() const { return (unsigned short)unpack(field1,4,0); }
\n+
198
\n+
200 float GetParamFraction() const;
\n+
201
\n+
208 template <typename REAL>
\n+
209 void Normalize( REAL & u, REAL & v ) const;
\n+
210 template <typename REAL>
\n+
211 void NormalizeTriangle( REAL & u, REAL & v ) const;
\n+
212
\n+
219 template <typename REAL>
\n+
220 void Unnormalize( REAL & u, REAL & v ) const;
\n+
221 template <typename REAL>
\n+
222 void UnnormalizeTriangle( REAL & u, REAL & v ) const;
\n+
223
\n+
225 bool IsTriangleRotated() const;
\n+
226
\n+
228 bool IsRegular() const { return (unpack(field1,1,5) != 0); }
\n+
229
\n+
230 unsigned int field0:32;
\n+
231 unsigned int field1:32;
\n+
232
\n+
233private:
\n+
234 unsigned int pack(unsigned int value, int width, int offset) const {
\n+
235 return (unsigned int)((value & ((1<<width)-1)) << offset);
\n+
236 }
\n+
237
\n+
238 unsigned int unpack(unsigned int value, int width, int offset) const {
\n+
239 return (unsigned int)((value >> offset) & ((1<<width)-1));
\n+
240 }
\n+
241};
\n+
\n+
242
\n+
243typedef std::vector<PatchParam> PatchParamTable;
\n+
244
\n+\n+\n+
247
\n+
248inline void
\n+
\n+
249PatchParam::Set(Index faceid, short u, short v,
\n+
250 unsigned short depth, bool nonquad,
\n+
251 unsigned short boundary, unsigned short transition,
\n+
252 bool regular) {
\n+
253 field0 = pack(faceid, 28, 0) |
\n+
254 pack(transition, 4, 28);
\n+
255
\n+
256 field1 = pack(u, 10, 22) |
\n+
257 pack(v, 10, 12) |
\n+
258 pack(boundary, 5, 7) |
\n+
259 pack(regular, 1, 5) |
\n+
260 pack(nonquad, 1, 4) |
\n+
261 pack(depth, 4, 0);
\n+
262}
\n+
\n+
263
\n+
264inline float
\n+
\n+\n+
266 return 1.0f / (float)(1 << (GetDepth() - NonQuadRoot()));
\n+
267}
\n+
\n+
268
\n+
269template <typename REAL>
\n+
270inline void
\n+
\n+
271PatchParam::Normalize( REAL & u, REAL & v ) const {
\n+
272
\n+
273 REAL fracInv = (REAL)(1.0f / GetParamFraction());
\n+
274
\n+
275 u = u * fracInv - (REAL)GetU();
\n+
276 v = v * fracInv - (REAL)GetV();
\n+
277}
\n+
\n+
278
\n+
279template <typename REAL>
\n+
280inline void
\n+
\n+
281PatchParam::Unnormalize( REAL & u, REAL & v ) const {
\n+
282
\n+
283 REAL frac = (REAL)GetParamFraction();
\n+
284
\n+
285 u = (u + (REAL)GetU()) * frac;
\n+
286 v = (v + (REAL)GetV()) * frac;
\n+
287}
\n+
\n+
288
\n+
289inline bool
\n+
\n+\n+
291
\n+
292 return (GetU() + GetV()) >= (1 << GetDepth());
\n+
293}
\n+
\n+
294
\n+
295template <typename REAL>
\n+
296inline void
\n+
\n+
297PatchParam::NormalizeTriangle( REAL & u, REAL & v ) const {
\n+
298
\n+
299 if (IsTriangleRotated()) {
\n+
300 REAL fracInv = (REAL)(1.0f / GetParamFraction());
\n+
301
\n+
302 int depthFactor = 1 << GetDepth();
\n+
303 u = (REAL)(depthFactor - GetU()) - (u * fracInv);
\n+
304 v = (REAL)(depthFactor - GetV()) - (v * fracInv);
\n+
305 } else {
\n+
306 Normalize(u, v);
\n+
307 }
\n+
308}
\n+
\n+
309
\n+
310template <typename REAL>
\n+
311inline void
\n+
\n+
312PatchParam::UnnormalizeTriangle( REAL & u, REAL & v ) const {
\n+
313
\n+
314 if (IsTriangleRotated()) {
\n+
315 REAL frac = GetParamFraction();
\n+
316
\n+
317 int depthFactor = 1 << GetDepth();
\n+
318 u = ((REAL)(depthFactor - GetU()) - u) * frac;
\n+
319 v = ((REAL)(depthFactor - GetV()) - v) * frac;
\n+
320 } else {
\n+
321 Unnormalize(u, v);
\n+
322 }
\n+
323}
\n+
\n+
324
\n+
325} // end namespace Far
\n+
326
\n+
327} // end namespace OPENSUBDIV_VERSION
\n+
328using namespace OPENSUBDIV_VERSION;
\n+
329
\n+
330} // end namespace OpenSubdiv
\n+
331
\n+
332#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */
\n \n-
Vtr::ConstArray< PatchDescriptor > ConstPatchDescriptorArray
\n-
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n-\n-\n-\n-\n-\n-
@ LOOP
regular triangular patch for the Loop scheme
\n-\n-\n-\n-\n-\n-\n-
@ REGULAR
regular B-Spline patch for the Catmark scheme
\n-
bool IsAdaptive() const
Returns true if the type is an adaptive patch.
\n-
Type GetType() const
Returns the type of the patch.
\n-
static short GetGregoryBasisPatchSize()
Number of control vertices of Gregory patch basis (20)
\n-
short GetNumControlVertices() const
Returns the number of control vertices expected for a patch of the type described.
\n-
PatchDescriptor(PatchDescriptor const &d)
Copy Constructor.
\n-
bool operator==(PatchDescriptor const other) const
True if the descriptors are identical.
\n-
static short GetRegularPatchSize()
Number of control vertices of Regular Patches in table.
\n-\n-\n-
PatchDescriptor & operator=(PatchDescriptor const &d)
Assignment operator.
\n-
static bool IsAdaptive(Type type)
Returns true if the type is an adaptive (non-linear) patch.
\n-
bool operator<(PatchDescriptor const other) const
Allows ordering of patches by type.
\n-
static short GetGregoryPatchSize()
Number of control vertices of Gregory (and Gregory Boundary) Patches in table.
\n-\n-
static Vtr::ConstArray< PatchDescriptor > GetAdaptivePatchDescriptors(Sdc::SchemeType type)
Returns a vector of all the legal patch descriptors for the given adaptive subdivision scheme.
\n-\n+
Vtr::ConstArray< PatchParam > ConstPatchParamArray
Definition patchParam.h:246
\n+
std::vector< PatchParam > PatchParamTable
Definition patchParam.h:243
\n+\n+
Vtr::Array< PatchParam > PatchParamArray
Definition patchParam.h:245
\n+\n+
bool IsTriangleRotated() const
Returns if a triangular patch is parametrically rotated 180 degrees.
Definition patchParam.h:290
\n+
bool IsRegular() const
Returns whether the patch is regular.
Definition patchParam.h:228
\n+
void NormalizeTriangle(REAL &u, REAL &v) const
Definition patchParam.h:297
\n+
unsigned short GetBoundary() const
Returns the boundary edge encoding for the patch.
Definition patchParam.h:191
\n+
unsigned short GetTransition() const
Returns the transition edge encoding for the patch.
Definition patchParam.h:188
\n+
float GetParamFraction() const
Returns the fraction of unit parametric space covered by this face.
Definition patchParam.h:265
\n+
unsigned short GetU() const
Returns the log2 value of the u parameter at the first corner of the patch.
Definition patchParam.h:181
\n+
Index GetFaceId() const
Returns the faceid.
Definition patchParam.h:177
\n+
unsigned short GetDepth() const
Returns the level of subdivision of the patch.
Definition patchParam.h:197
\n+
bool NonQuadRoot() const
True if the parent base face is a non-quad.
Definition patchParam.h:194
\n+
void Set(Index faceid, short u, short v, unsigned short depth, bool nonquad, unsigned short boundary, unsigned short transition, bool regular=false)
Sets the values of the bit fields.
Definition patchParam.h:249
\n+\n+\n+
void Unnormalize(REAL &u, REAL &v) const
A (u,v) pair in a normalized parametric space is mapped back into the fraction of parametric space co...
Definition patchParam.h:281
\n+
void UnnormalizeTriangle(REAL &u, REAL &v) const
Definition patchParam.h:312
\n+
unsigned short GetV() const
Returns the log2 value of the v parameter at the first corner of the patch.
Definition patchParam.h:185
\n+\n+
void Normalize(REAL &u, REAL &v) const
A (u,v) pair in the fraction of parametric space covered by this face is mapped into a normalized par...
Definition patchParam.h:271
\n \n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchDescriptor.h\n+patchParam.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,280 +24,262 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H\n-26#define OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H\n+25#ifndef OPENSUBDIV3_FAR_PATCH_PARAM_H\n+26#define OPENSUBDIV3_FAR_PATCH_PARAM_H\n 27\n 28#include \"../version.h\"\n 29\n 30#include \"../far/types.h\"\n-31#include \"../sdc/types.h\"\n-32\n-33#include \n+31\n+32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+33namespace OPENSUBDIV_VERSION {\n 34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Far {\n-39\n-_\b4_\b4class _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n-45\n-46public:\n-47\n-_\b4_\b8 enum _\bT_\by_\bp_\be {\n-_\b4_\b9 _\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH = 0,\n-50\n-_\b5_\b1 _\bP_\bO_\bI_\bN_\bT_\bS,\n-_\b5_\b2 _\bL_\bI_\bN_\bE_\bS,\n-53\n-_\b5_\b4 _\bQ_\bU_\bA_\bD_\bS,\n-_\b5_\b5 _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS,\n-56\n-_\b5_\b7 _\bL_\bO_\bO_\bP,\n-58\n-_\b5_\b9 _\bR_\bE_\bG_\bU_\bL_\bA_\bR,\n-_\b6_\b0 _\bG_\bR_\bE_\bG_\bO_\bR_\bY,\n-_\b6_\b1 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY,\n-_\b6_\b2 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n-63 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE\n-_\b6_\b4 };\n-65\n-66public:\n-67\n-_\b6_\b9 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() :\n-70 _type(_\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH) { }\n-71\n-_\b7_\b3 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int type) :\n-74 _type(type) { }\n-75\n-_\b7_\b7 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & d ) :\n-78 _type(d._\bG_\be_\bt_\bT_\by_\bp_\be()) { }\n-79\n-_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & d ) {\n-82 _type = d._\bG_\be_\bt_\bT_\by_\bp_\be();\n-83 return *this;\n-84 }\n-85\n-_\b8_\b7 _\bT_\by_\bp_\be _\bG_\be_\bt_\bT_\by_\bp_\be() const {\n-88 return (_\bT_\by_\bp_\be)_type;\n-89 }\n-90\n-_\b9_\b2 static inline bool _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be(_\bT_\by_\bp_\be type) {\n-93 return type > _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS;\n-94 }\n-95\n-_\b9_\b7 bool _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be() const {\n-98 return _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n-99 }\n-100\n-103 static inline short _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be t );\n-104\n-106 static inline short _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be t );\n-107\n-_\b1_\b1_\b0 short _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n-111 return _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n-112 }\n-113\n-_\b1_\b1_\b5 short _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n-116 return _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n-117 }\n-118\n-_\b1_\b2_\b0 static short _\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 16; }\n-121\n-_\b1_\b2_\b3 static short _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 4; }\n-124\n-_\b1_\b2_\b6 static short _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 20; }\n-127\n-128\n-_\b1_\b3_\b1 static _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b> _\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bs(_\bS_\bd_\bc_\b:_\b:\n-_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be type);\n-132\n-134 inline bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const;\n-135\n-137 inline bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const;\n-138\n-139 // debug helper\n-_\b1_\b4_\b0 void _\bp_\br_\bi_\bn_\bt() const;\n-141\n-142private:\n-143 unsigned int _type;\n-144};\n-145\n-_\b1_\b4_\b6typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b> _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by;\n-147\n-148// Returns the number of control vertices expected for a patch of this type\n-149inline short\n-_\b1_\b5_\b0_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be type ) {\n-151 switch (type) {\n-152 case _\bR_\bE_\bG_\bU_\bL_\bA_\bR : return _\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n-153 case _\bL_\bO_\bO_\bP : return 12;\n-154 case _\bQ_\bU_\bA_\bD_\bS : return 4;\n-155 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY :\n-156 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY : return _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n-157 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS : return _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n-158 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE : return 18;\n-159 case _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS : return 3;\n-160 case _\bL_\bI_\bN_\bE_\bS : return 2;\n-161 case _\bP_\bO_\bI_\bN_\bT_\bS : return 1;\n-162 default : return -1;\n-163 }\n-164}\n-165\n-166// Returns the number of face-varying control vertices expected for a patch\n-of this type\n-167inline short\n-_\b1_\b6_\b8_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be type ) {\n-169 return _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(type);\n-170}\n-171\n-172// Allows ordering of patches by type\n-_\b1_\b7_\b3inline bool\n-174_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const {\n-175 return (_type < other._type);\n-176}\n-177\n-178// True if the descriptors are identical\n-179inline bool\n-_\b1_\b8_\b0_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const {\n-181 return _type == other._type;\n-182}\n-183\n-184\n-185\n-186} // end namespace Far\n-187\n-188} // end namespace OPENSUBDIV_VERSION\n-189using namespace OPENSUBDIV_VERSION;\n-190\n-191} // end namespace OpenSubdiv\n+35namespace Far {\n+36\n+101\n+_\b1_\b5_\b2struct _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm {\n+168 void _\bS_\be_\bt(_\bI_\bn_\bd_\be_\bx faceid, short u, short v,\n+169 unsigned short depth, bool nonquad,\n+170 unsigned short boundary, unsigned short transition,\n+171 bool regular = false);\n+172\n+_\b1_\b7_\b4 void _\bC_\bl_\be_\ba_\br() { _\bf_\bi_\be_\bl_\bd_\b0 = _\bf_\bi_\be_\bl_\bd_\b1 = 0; }\n+175\n+_\b1_\b7_\b7 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd() const { return _\bI_\bn_\bd_\be_\bx(unpack(_\bf_\bi_\be_\bl_\bd_\b0,28,0)); }\n+178\n+_\b1_\b8_\b1 unsigned short _\bG_\be_\bt_\bU() const { return (unsigned short)unpack(_\bf_\bi_\be_\bl_\bd_\b1,10,22);\n+}\n+182\n+_\b1_\b8_\b5 unsigned short _\bG_\be_\bt_\bV() const { return (unsigned short)unpack(_\bf_\bi_\be_\bl_\bd_\b1,10,12);\n+}\n+186\n+_\b1_\b8_\b8 unsigned short _\bG_\be_\bt_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn() const { return (unsigned short)unpack\n+(_\bf_\bi_\be_\bl_\bd_\b0,4,28); }\n+189\n+_\b1_\b9_\b1 unsigned short _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const { return (unsigned short)unpack\n+(_\bf_\bi_\be_\bl_\bd_\b1,5,7); }\n 192\n-193#endif /* OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H */\n+_\b1_\b9_\b4 bool _\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt() const { return (unpack(_\bf_\bi_\be_\bl_\bd_\b1,1,4) != 0); }\n+195\n+_\b1_\b9_\b7 unsigned short _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh() const { return (unsigned short)unpack\n+(_\bf_\bi_\be_\bl_\bd_\b1,4,0); }\n+198\n+200 float _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn() const;\n+201\n+208 template \n+209 void _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const;\n+210 template \n+211 void _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const;\n+212\n+219 template \n+220 void _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const;\n+221 template \n+222 void _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const;\n+223\n+225 bool _\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd() const;\n+226\n+_\b2_\b2_\b8 bool _\bI_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br() const { return (unpack(_\bf_\bi_\be_\bl_\bd_\b1,1,5) != 0); }\n+229\n+_\b2_\b3_\b0 unsigned int _\bf_\bi_\be_\bl_\bd_\b0:32;\n+_\b2_\b3_\b1 unsigned int _\bf_\bi_\be_\bl_\bd_\b1:32;\n+232\n+233private:\n+234 unsigned int pack(unsigned int value, int width, int offset) const {\n+235 return (unsigned int)((value & ((1<> offset) & ((1< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be;\n+244\n+_\b2_\b4_\b5typedef _\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b> _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by;\n+_\b2_\b4_\b6typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b> _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by;\n+247\n+248inline void\n+_\b2_\b4_\b9_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bS_\be_\bt(_\bI_\bn_\bd_\be_\bx faceid, short u, short v,\n+250 unsigned short depth, bool nonquad,\n+251 unsigned short boundary, unsigned short transition,\n+252 bool regular) {\n+253 _\bf_\bi_\be_\bl_\bd_\b0 = pack(faceid, 28, 0) |\n+254 pack(transition, 4, 28);\n+255\n+256 _\bf_\bi_\be_\bl_\bd_\b1 = pack(u, 10, 22) |\n+257 pack(v, 10, 12) |\n+258 pack(boundary, 5, 7) |\n+259 pack(regular, 1, 5) |\n+260 pack(nonquad, 1, 4) |\n+261 pack(depth, 4, 0);\n+262}\n+263\n+264inline float\n+_\b2_\b6_\b5_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn( ) const {\n+266 return 1.0f / (float)(1 << (_\bG_\be_\bt_\bD_\be_\bp_\bt_\bh() - _\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt()));\n+267}\n+268\n+269template \n+270inline void\n+_\b2_\b7_\b1_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const {\n+272\n+273 REAL fracInv = (REAL)(1.0f / _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn());\n+274\n+275 u = u * fracInv - (REAL)_\bG_\be_\bt_\bU();\n+276 v = v * fracInv - (REAL)_\bG_\be_\bt_\bV();\n+277}\n+278\n+279template \n+280inline void\n+_\b2_\b8_\b1_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const {\n+282\n+283 REAL frac = (REAL)_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn();\n+284\n+285 u = (u + (REAL)_\bG_\be_\bt_\bU()) * frac;\n+286 v = (v + (REAL)_\bG_\be_\bt_\bV()) * frac;\n+287}\n+288\n+289inline bool\n+_\b2_\b9_\b0_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd() const {\n+291\n+292 return (_\bG_\be_\bt_\bU() + _\bG_\be_\bt_\bV()) >= (1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh());\n+293}\n+294\n+295template \n+296inline void\n+_\b2_\b9_\b7_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const {\n+298\n+299 if (_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd()) {\n+300 REAL fracInv = (REAL)(1.0f / _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn());\n+301\n+302 int depthFactor = 1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh();\n+303 u = (REAL)(depthFactor - _\bG_\be_\bt_\bU()) - (u * fracInv);\n+304 v = (REAL)(depthFactor - _\bG_\be_\bt_\bV()) - (v * fracInv);\n+305 } else {\n+306 _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be(u, v);\n+307 }\n+308}\n+309\n+310template \n+311inline void\n+_\b3_\b1_\b2_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const {\n+313\n+314 if (_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd()) {\n+315 REAL frac = _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn();\n+316\n+317 int depthFactor = 1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh();\n+318 u = ((REAL)(depthFactor - _\bG_\be_\bt_\bU()) - u) * frac;\n+319 v = ((REAL)(depthFactor - _\bG_\be_\bt_\bV()) - v) * frac;\n+320 } else {\n+321 _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be(u, v);\n+322 }\n+323}\n+324\n+325} // end namespace Far\n+326\n+327} // end namespace OPENSUBDIV_VERSION\n+328using namespace OPENSUBDIV_VERSION;\n+329\n+330} // end namespace OpenSubdiv\n+331\n+332#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by\n-Vtr::ConstArray< PatchDescriptor > ConstPatchDescriptorArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n-SchemeType\n-Enumerated type for all subdivision schemes supported by OpenSubdiv.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-Describes the type of a patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bL_\bI_\bN_\bE_\bS\n-@ LINES\n-lines (useful for cage drawing)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bQ_\bU_\bA_\bD_\bS\n-@ QUADS\n-4-sided quadrilateral (bilinear)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH\n-@ NON_PATCH\n-undefined\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bL_\bO_\bO_\bP\n-@ LOOP\n-regular triangular patch for the Loop scheme\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE\n-@ GREGORY_TRIANGLE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS\n-@ TRIANGLES\n-3-sided triangle\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n-@ GREGORY_BOUNDARY\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n-@ GREGORY_BASIS\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\bO_\bI_\bN_\bT_\bS\n-@ POINTS\n-points (useful for cage drawing)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY\n-@ GREGORY\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bR_\bE_\bG_\bU_\bL_\bA_\bR\n-@ REGULAR\n-regular B-Spline patch for the Catmark scheme\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n-bool IsAdaptive() const\n-Returns true if the type is an adaptive patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bT_\by_\bp_\be\n-Type GetType() const\n-Returns the type of the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n-static short GetGregoryBasisPatchSize()\n-Number of control vertices of Gregory patch basis (20)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-short GetNumControlVertices() const\n-Returns the number of control vertices expected for a patch of the type\n-described.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor(PatchDescriptor const &d)\n-Copy Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-bool operator==(PatchDescriptor const other) const\n-True if the descriptors are identical.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n-static short GetRegularPatchSize()\n-Number of control vertices of Regular Patches in table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-short GetNumFVarControlVertices() const\n-Deprecated.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor(int type)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n-PatchDescriptor & operator=(PatchDescriptor const &d)\n-Assignment operator.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n-static bool IsAdaptive(Type type)\n-Returns true if the type is an adaptive (non-linear) patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<\n-bool operator<(PatchDescriptor const other) const\n-Allows ordering of patches by type.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n-static short GetGregoryPatchSize()\n-Number of control vertices of Gregory (and Gregory Boundary) Patches in table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bp_\br_\bi_\bn_\bt\n-void print() const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n-_\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bs\n-static Vtr::ConstArray< PatchDescriptor > GetAdaptivePatchDescriptors(Sdc::\n-SchemeType type)\n-Returns a vector of all the legal patch descriptors for the given adaptive\n-subdivision scheme.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-PatchDescriptor()\n-Default constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n+Vtr::ConstArray< PatchParam > ConstPatchParamArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n+std::vector< PatchParam > PatchParamTable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n+Vtr::Index Index\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n+Vtr::Array< PatchParam > PatchParamArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+Patch parameterization.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd\n+bool IsTriangleRotated() const\n+Returns if a triangular patch is parametrically rotated 180 degrees.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b9_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n+bool IsRegular() const\n+Returns whether the patch is regular.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n+void NormalizeTriangle(REAL &u, REAL &v) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n+unsigned short GetBoundary() const\n+Returns the boundary edge encoding for the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn\n+unsigned short GetTransition() const\n+Returns the transition edge encoding for the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn\n+float GetParamFraction() const\n+Returns the fraction of unit parametric space covered by this face.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bU\n+unsigned short GetU() const\n+Returns the log2 value of the u parameter at the first corner of the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd\n+Index GetFaceId() const\n+Returns the faceid.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bD_\be_\bp_\bt_\bh\n+unsigned short GetDepth() const\n+Returns the level of subdivision of the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt\n+bool NonQuadRoot() const\n+True if the parent base face is a non-quad.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bS_\be_\bt\n+void Set(Index faceid, short u, short v, unsigned short depth, bool nonquad,\n+unsigned short boundary, unsigned short transition, bool regular=false)\n+Sets the values of the bit fields.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bC_\bl_\be_\ba_\br\n+void Clear()\n+Resets everything to 0.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b1\n+unsigned int field1\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be\n+void Unnormalize(REAL &u, REAL &v) const\n+A (u,v) pair in a normalized parametric space is mapped back into the fraction\n+of parametric space co...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n+void UnnormalizeTriangle(REAL &u, REAL &v) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b3_\b1_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bV\n+unsigned short GetV() const\n+Returns the log2 value of the v parameter at the first corner of the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b0\n+unsigned int field0\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b3_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be\n+void Normalize(REAL &u, REAL &v) const\n+A (u,v) pair in the fraction of parametric space covered by this face is mapped\n+into a normalized par...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b7_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b1_\b0_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00740.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00740.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchParam.h File Reference\n+OpenSubdiv: opensubdiv/far/patchDescriptor.h File Reference\n \n \n \n \n \n \n \n@@ -91,50 +91,48 @@\n \n \n
\n \n-
patchParam.h File Reference
\n+
patchDescriptor.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../far/types.h"
\n+#include "../sdc/types.h"
\n+#include <vector>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n

\n Classes

struct  PatchParam
 Patch parameterization. More...
class  PatchDescriptor
 Describes the type of a patch. More...
 
\n \n \n \n \n \n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
\n \n-\n-\n-\n-\n-\n-\n+\n+\n

\n Typedefs

typedef std::vector< PatchParamPatchParamTable
 
typedef Vtr::Array< PatchParamPatchParamArray
 
typedef Vtr::ConstArray< PatchParamConstPatchParamArray
 
typedef Vtr::ConstArray< PatchDescriptorConstPatchDescriptorArray
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,31 +1,29 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-patchParam.h File Reference\n+patchDescriptor.h File Reference\n #include \"../version.h\"\n #include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-\u00a0 Patch parameterization. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+\u00a0 Describes the type of a patch. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n- typedef std::vector< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n-\u00a0\n- typedef _\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n-\u00a0\n-typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm >\u00a0 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n+typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by< _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br >\u00a0 _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00740.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00740.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,6 +1,4 @@\n var a00740 = [\n- [\"PatchParam\", \"a00989.html\", \"a00989\"],\n- [\"ConstPatchParamArray\", \"a00740.html#a3139c7c52ddf26b2403e8e95ff63eeb3\", null],\n- [\"PatchParamArray\", \"a00740.html#abe07210a029a01571c54276ae28b4d88\", null],\n- [\"PatchParamTable\", \"a00740.html#a46ea68db89cc3d55c4191ef7648281ce\", null]\n+ [\"PatchDescriptor\", \"a00973.html\", \"a00973\"],\n+ [\"ConstPatchDescriptorArray\", \"a00740.html#ad258c2d8f7871bc0d40cf3a9ded6e08a\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00740_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00740_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/patchParam.h Source File\n+OpenSubdiv: opensubdiv/far/patchDescriptor.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
patchParam.h
\n+
patchDescriptor.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,214 +119,226 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_FAR_PATCH_PARAM_H
\n-
26#define OPENSUBDIV3_FAR_PATCH_PARAM_H
\n+
25#ifndef OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H
\n+
26#define OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H
\n
27
\n
28#include "../version.h"
\n
29
\n
30#include "../far/types.h"
\n-
31
\n-
32namespace OpenSubdiv {
\n-
33namespace OPENSUBDIV_VERSION {
\n+
31#include "../sdc/types.h"
\n+
32
\n+
33#include <vector>
\n
34
\n-
35namespace Far {
\n-
36
\n-
101
\n-
\n-\n-
168 void Set(Index faceid, short u, short v,
\n-
169 unsigned short depth, bool nonquad,
\n-
170 unsigned short boundary, unsigned short transition,
\n-
171 bool regular = false);
\n-
172
\n-
174 void Clear() { field0 = field1 = 0; }
\n-
175
\n-
177 Index GetFaceId() const { return Index(unpack(field0,28,0)); }
\n-
178
\n-
181 unsigned short GetU() const { return (unsigned short)unpack(field1,10,22); }
\n-
182
\n-
185 unsigned short GetV() const { return (unsigned short)unpack(field1,10,12); }
\n-
186
\n-
188 unsigned short GetTransition() const { return (unsigned short)unpack(field0,4,28); }
\n-
189
\n-
191 unsigned short GetBoundary() const { return (unsigned short)unpack(field1,5,7); }
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Far {
\n+
39
\n+
\n+\n+
45
\n+
46public:
\n+
47
\n+
\n+
48 enum Type {
\n+\n+
50
\n+\n+\n+
53
\n+\n+\n+
56
\n+\n+
58
\n+\n+\n+\n+\n+\n+
64 };
\n+
\n+
65
\n+
66public:
\n+
67
\n+
\n+\n+
70 _type(NON_PATCH) { }
\n+
\n+
71
\n+
\n+
73 PatchDescriptor(int type) :
\n+
74 _type(type) { }
\n+
\n+
75
\n+
\n+\n+
78 _type(d.GetType()) { }
\n+
\n+
79
\n+
\n+\n+
82 _type = d.GetType();
\n+
83 return *this;
\n+
84 }
\n+
\n+
85
\n+
\n+
87 Type GetType() const {
\n+
88 return (Type)_type;
\n+
89 }
\n+
\n+
90
\n+
\n+
92 static inline bool IsAdaptive(Type type) {
\n+
93 return type > TRIANGLES;
\n+
94 }
\n+
\n+
95
\n+
\n+
97 bool IsAdaptive() const {
\n+
98 return IsAdaptive( this->GetType() );
\n+
99 }
\n+
\n+
100
\n+
103 static inline short GetNumControlVertices( Type t );
\n+
104
\n+
106 static inline short GetNumFVarControlVertices( Type t );
\n+
107
\n+
\n+
110 short GetNumControlVertices() const {
\n+
111 return GetNumControlVertices( this->GetType() );
\n+
112 }
\n+
\n+
113
\n+
\n+\n+
116 return GetNumFVarControlVertices( this->GetType() );
\n+
117 }
\n+
\n+
118
\n+
120 static short GetRegularPatchSize() { return 16; }
\n+
121
\n+
123 static short GetGregoryPatchSize() { return 4; }
\n+
124
\n+
126 static short GetGregoryBasisPatchSize() { return 20; }
\n+
127
\n+
128
\n+\n+
132
\n+
134 inline bool operator < ( PatchDescriptor const other ) const;
\n+
135
\n+
137 inline bool operator == ( PatchDescriptor const other ) const;
\n+
138
\n+
139 // debug helper
\n+
140 void print() const;
\n+
141
\n+
142private:
\n+
143 unsigned int _type;
\n+
144};
\n+
\n+
145
\n+\n+
147
\n+
148// Returns the number of control vertices expected for a patch of this type
\n+
149inline short
\n+
\n+\n+
151 switch (type) {
\n+
152 case REGULAR : return GetRegularPatchSize();
\n+
153 case LOOP : return 12;
\n+
154 case QUADS : return 4;
\n+
155 case GREGORY :
\n+\n+\n+
158 case GREGORY_TRIANGLE : return 18;
\n+
159 case TRIANGLES : return 3;
\n+
160 case LINES : return 2;
\n+
161 case POINTS : return 1;
\n+
162 default : return -1;
\n+
163 }
\n+
164}
\n+
\n+
165
\n+
166// Returns the number of face-varying control vertices expected for a patch of this type
\n+
167inline short
\n+\n+
171
\n+
172// Allows ordering of patches by type
\n+
\n+
173inline bool
\n+\n+
175 return (_type < other._type);
\n+
176}
\n+
\n+
177
\n+
178// True if the descriptors are identical
\n+
179inline bool
\n+
\n+\n+
181 return _type == other._type;
\n+
182}
\n+
\n+
183
\n+
184
\n+
185
\n+
186} // end namespace Far
\n+
187
\n+
188} // end namespace OPENSUBDIV_VERSION
\n+
189using namespace OPENSUBDIV_VERSION;
\n+
190
\n+
191} // end namespace OpenSubdiv
\n
192
\n-
194 bool NonQuadRoot() const { return (unpack(field1,1,4) != 0); }
\n-
195
\n-
197 unsigned short GetDepth() const { return (unsigned short)unpack(field1,4,0); }
\n-
198
\n-
200 float GetParamFraction() const;
\n-
201
\n-
208 template <typename REAL>
\n-
209 void Normalize( REAL & u, REAL & v ) const;
\n-
210 template <typename REAL>
\n-
211 void NormalizeTriangle( REAL & u, REAL & v ) const;
\n-
212
\n-
219 template <typename REAL>
\n-
220 void Unnormalize( REAL & u, REAL & v ) const;
\n-
221 template <typename REAL>
\n-
222 void UnnormalizeTriangle( REAL & u, REAL & v ) const;
\n-
223
\n-
225 bool IsTriangleRotated() const;
\n-
226
\n-
228 bool IsRegular() const { return (unpack(field1,1,5) != 0); }
\n-
229
\n-
230 unsigned int field0:32;
\n-
231 unsigned int field1:32;
\n-
232
\n-
233private:
\n-
234 unsigned int pack(unsigned int value, int width, int offset) const {
\n-
235 return (unsigned int)((value & ((1<<width)-1)) << offset);
\n-
236 }
\n-
237
\n-
238 unsigned int unpack(unsigned int value, int width, int offset) const {
\n-
239 return (unsigned int)((value >> offset) & ((1<<width)-1));
\n-
240 }
\n-
241};
\n-
\n-
242
\n-
243typedef std::vector<PatchParam> PatchParamTable;
\n-
244
\n-\n-\n-
247
\n-
248inline void
\n-
\n-
249PatchParam::Set(Index faceid, short u, short v,
\n-
250 unsigned short depth, bool nonquad,
\n-
251 unsigned short boundary, unsigned short transition,
\n-
252 bool regular) {
\n-
253 field0 = pack(faceid, 28, 0) |
\n-
254 pack(transition, 4, 28);
\n-
255
\n-
256 field1 = pack(u, 10, 22) |
\n-
257 pack(v, 10, 12) |
\n-
258 pack(boundary, 5, 7) |
\n-
259 pack(regular, 1, 5) |
\n-
260 pack(nonquad, 1, 4) |
\n-
261 pack(depth, 4, 0);
\n-
262}
\n-
\n-
263
\n-
264inline float
\n-
\n-\n-
266 return 1.0f / (float)(1 << (GetDepth() - NonQuadRoot()));
\n-
267}
\n-
\n-
268
\n-
269template <typename REAL>
\n-
270inline void
\n-
\n-
271PatchParam::Normalize( REAL & u, REAL & v ) const {
\n-
272
\n-
273 REAL fracInv = (REAL)(1.0f / GetParamFraction());
\n-
274
\n-
275 u = u * fracInv - (REAL)GetU();
\n-
276 v = v * fracInv - (REAL)GetV();
\n-
277}
\n-
\n-
278
\n-
279template <typename REAL>
\n-
280inline void
\n-
\n-
281PatchParam::Unnormalize( REAL & u, REAL & v ) const {
\n-
282
\n-
283 REAL frac = (REAL)GetParamFraction();
\n-
284
\n-
285 u = (u + (REAL)GetU()) * frac;
\n-
286 v = (v + (REAL)GetV()) * frac;
\n-
287}
\n-
\n-
288
\n-
289inline bool
\n-
\n-\n-
291
\n-
292 return (GetU() + GetV()) >= (1 << GetDepth());
\n-
293}
\n-
\n-
294
\n-
295template <typename REAL>
\n-
296inline void
\n-
\n-
297PatchParam::NormalizeTriangle( REAL & u, REAL & v ) const {
\n-
298
\n-
299 if (IsTriangleRotated()) {
\n-
300 REAL fracInv = (REAL)(1.0f / GetParamFraction());
\n-
301
\n-
302 int depthFactor = 1 << GetDepth();
\n-
303 u = (REAL)(depthFactor - GetU()) - (u * fracInv);
\n-
304 v = (REAL)(depthFactor - GetV()) - (v * fracInv);
\n-
305 } else {
\n-
306 Normalize(u, v);
\n-
307 }
\n-
308}
\n-
\n-
309
\n-
310template <typename REAL>
\n-
311inline void
\n-
\n-
312PatchParam::UnnormalizeTriangle( REAL & u, REAL & v ) const {
\n-
313
\n-
314 if (IsTriangleRotated()) {
\n-
315 REAL frac = GetParamFraction();
\n-
316
\n-
317 int depthFactor = 1 << GetDepth();
\n-
318 u = ((REAL)(depthFactor - GetU()) - u) * frac;
\n-
319 v = ((REAL)(depthFactor - GetV()) - v) * frac;
\n-
320 } else {
\n-
321 Unnormalize(u, v);
\n-
322 }
\n-
323}
\n-
\n-
324
\n-
325} // end namespace Far
\n-
326
\n-
327} // end namespace OPENSUBDIV_VERSION
\n-
328using namespace OPENSUBDIV_VERSION;
\n-
329
\n-
330} // end namespace OpenSubdiv
\n-
331
\n-
332#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */
\n+
193#endif /* OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H */
\n \n-
Vtr::ConstArray< PatchParam > ConstPatchParamArray
Definition patchParam.h:246
\n-
std::vector< PatchParam > PatchParamTable
Definition patchParam.h:243
\n-\n-
Vtr::Array< PatchParam > PatchParamArray
Definition patchParam.h:245
\n-\n-
bool IsTriangleRotated() const
Returns if a triangular patch is parametrically rotated 180 degrees.
Definition patchParam.h:290
\n-
bool IsRegular() const
Returns whether the patch is regular.
Definition patchParam.h:228
\n-
void NormalizeTriangle(REAL &u, REAL &v) const
Definition patchParam.h:297
\n-
unsigned short GetBoundary() const
Returns the boundary edge encoding for the patch.
Definition patchParam.h:191
\n-
unsigned short GetTransition() const
Returns the transition edge encoding for the patch.
Definition patchParam.h:188
\n-
float GetParamFraction() const
Returns the fraction of unit parametric space covered by this face.
Definition patchParam.h:265
\n-
unsigned short GetU() const
Returns the log2 value of the u parameter at the first corner of the patch.
Definition patchParam.h:181
\n-
Index GetFaceId() const
Returns the faceid.
Definition patchParam.h:177
\n-
unsigned short GetDepth() const
Returns the level of subdivision of the patch.
Definition patchParam.h:197
\n-
bool NonQuadRoot() const
True if the parent base face is a non-quad.
Definition patchParam.h:194
\n-
void Set(Index faceid, short u, short v, unsigned short depth, bool nonquad, unsigned short boundary, unsigned short transition, bool regular=false)
Sets the values of the bit fields.
Definition patchParam.h:249
\n-\n-\n-
void Unnormalize(REAL &u, REAL &v) const
A (u,v) pair in a normalized parametric space is mapped back into the fraction of parametric space co...
Definition patchParam.h:281
\n-
void UnnormalizeTriangle(REAL &u, REAL &v) const
Definition patchParam.h:312
\n-
unsigned short GetV() const
Returns the log2 value of the v parameter at the first corner of the patch.
Definition patchParam.h:185
\n-\n-
void Normalize(REAL &u, REAL &v) const
A (u,v) pair in the fraction of parametric space covered by this face is mapped into a normalized par...
Definition patchParam.h:271
\n+
Vtr::ConstArray< PatchDescriptor > ConstPatchDescriptorArray
\n+
SchemeType
Enumerated type for all subdivision schemes supported by OpenSubdiv.
Definition types.h:37
\n+\n+\n+\n+\n+\n+
@ LOOP
regular triangular patch for the Loop scheme
\n+\n+\n+\n+\n+\n+\n+
@ REGULAR
regular B-Spline patch for the Catmark scheme
\n+
bool IsAdaptive() const
Returns true if the type is an adaptive patch.
\n+
Type GetType() const
Returns the type of the patch.
\n+
static short GetGregoryBasisPatchSize()
Number of control vertices of Gregory patch basis (20)
\n+
short GetNumControlVertices() const
Returns the number of control vertices expected for a patch of the type described.
\n+
PatchDescriptor(PatchDescriptor const &d)
Copy Constructor.
\n+
bool operator==(PatchDescriptor const other) const
True if the descriptors are identical.
\n+
static short GetRegularPatchSize()
Number of control vertices of Regular Patches in table.
\n+\n+\n+
PatchDescriptor & operator=(PatchDescriptor const &d)
Assignment operator.
\n+
static bool IsAdaptive(Type type)
Returns true if the type is an adaptive (non-linear) patch.
\n+
bool operator<(PatchDescriptor const other) const
Allows ordering of patches by type.
\n+
static short GetGregoryPatchSize()
Number of control vertices of Gregory (and Gregory Boundary) Patches in table.
\n+\n+
static Vtr::ConstArray< PatchDescriptor > GetAdaptivePatchDescriptors(Sdc::SchemeType type)
Returns a vector of all the legal patch descriptors for the given adaptive subdivision scheme.
\n+\n \n-\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-patchParam.h\n+patchDescriptor.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,262 +24,280 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_FAR_PATCH_PARAM_H\n-26#define OPENSUBDIV3_FAR_PATCH_PARAM_H\n+25#ifndef OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H\n+26#define OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H\n 27\n 28#include \"../version.h\"\n 29\n 30#include \"../far/types.h\"\n-31\n-32namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-33namespace OPENSUBDIV_VERSION {\n+31#include \"../sdc/types.h\"\n+32\n+33#include \n 34\n-35namespace Far {\n-36\n-101\n-_\b1_\b5_\b2struct _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm {\n-168 void _\bS_\be_\bt(_\bI_\bn_\bd_\be_\bx faceid, short u, short v,\n-169 unsigned short depth, bool nonquad,\n-170 unsigned short boundary, unsigned short transition,\n-171 bool regular = false);\n-172\n-_\b1_\b7_\b4 void _\bC_\bl_\be_\ba_\br() { _\bf_\bi_\be_\bl_\bd_\b0 = _\bf_\bi_\be_\bl_\bd_\b1 = 0; }\n-175\n-_\b1_\b7_\b7 _\bI_\bn_\bd_\be_\bx _\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd() const { return _\bI_\bn_\bd_\be_\bx(unpack(_\bf_\bi_\be_\bl_\bd_\b0,28,0)); }\n-178\n-_\b1_\b8_\b1 unsigned short _\bG_\be_\bt_\bU() const { return (unsigned short)unpack(_\bf_\bi_\be_\bl_\bd_\b1,10,22);\n-}\n-182\n-_\b1_\b8_\b5 unsigned short _\bG_\be_\bt_\bV() const { return (unsigned short)unpack(_\bf_\bi_\be_\bl_\bd_\b1,10,12);\n-}\n-186\n-_\b1_\b8_\b8 unsigned short _\bG_\be_\bt_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn() const { return (unsigned short)unpack\n-(_\bf_\bi_\be_\bl_\bd_\b0,4,28); }\n-189\n-_\b1_\b9_\b1 unsigned short _\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by() const { return (unsigned short)unpack\n-(_\bf_\bi_\be_\bl_\bd_\b1,5,7); }\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Far {\n+39\n+_\b4_\b4class _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n+45\n+46public:\n+47\n+_\b4_\b8 enum _\bT_\by_\bp_\be {\n+_\b4_\b9 _\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH = 0,\n+50\n+_\b5_\b1 _\bP_\bO_\bI_\bN_\bT_\bS,\n+_\b5_\b2 _\bL_\bI_\bN_\bE_\bS,\n+53\n+_\b5_\b4 _\bQ_\bU_\bA_\bD_\bS,\n+_\b5_\b5 _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS,\n+56\n+_\b5_\b7 _\bL_\bO_\bO_\bP,\n+58\n+_\b5_\b9 _\bR_\bE_\bG_\bU_\bL_\bA_\bR,\n+_\b6_\b0 _\bG_\bR_\bE_\bG_\bO_\bR_\bY,\n+_\b6_\b1 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY,\n+_\b6_\b2 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS,\n+63 _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE\n+_\b6_\b4 };\n+65\n+66public:\n+67\n+_\b6_\b9 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() :\n+70 _type(_\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH) { }\n+71\n+_\b7_\b3 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int type) :\n+74 _type(type) { }\n+75\n+_\b7_\b7 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & d ) :\n+78 _type(d._\bG_\be_\bt_\bT_\by_\bp_\be()) { }\n+79\n+_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br & _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const & d ) {\n+82 _type = d._\bG_\be_\bt_\bT_\by_\bp_\be();\n+83 return *this;\n+84 }\n+85\n+_\b8_\b7 _\bT_\by_\bp_\be _\bG_\be_\bt_\bT_\by_\bp_\be() const {\n+88 return (_\bT_\by_\bp_\be)_type;\n+89 }\n+90\n+_\b9_\b2 static inline bool _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be(_\bT_\by_\bp_\be type) {\n+93 return type > _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS;\n+94 }\n+95\n+_\b9_\b7 bool _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be() const {\n+98 return _\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n+99 }\n+100\n+103 static inline short _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be t );\n+104\n+106 static inline short _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be t );\n+107\n+_\b1_\b1_\b0 short _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n+111 return _\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n+112 }\n+113\n+_\b1_\b1_\b5 short _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const {\n+116 return _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( this->_\bG_\be_\bt_\bT_\by_\bp_\be() );\n+117 }\n+118\n+_\b1_\b2_\b0 static short _\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 16; }\n+121\n+_\b1_\b2_\b3 static short _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 4; }\n+124\n+_\b1_\b2_\b6 static short _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be() { return 20; }\n+127\n+128\n+_\b1_\b3_\b1 static _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b> _\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bs(_\bS_\bd_\bc_\b:_\b:\n+_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be type);\n+132\n+134 inline bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const;\n+135\n+137 inline bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const;\n+138\n+139 // debug helper\n+_\b1_\b4_\b0 void _\bp_\br_\bi_\bn_\bt() const;\n+141\n+142private:\n+143 unsigned int _type;\n+144};\n+145\n+_\b1_\b4_\b6typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b> _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by;\n+147\n+148// Returns the number of control vertices expected for a patch of this type\n+149inline short\n+_\b1_\b5_\b0_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be type ) {\n+151 switch (type) {\n+152 case _\bR_\bE_\bG_\bU_\bL_\bA_\bR : return _\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n+153 case _\bL_\bO_\bO_\bP : return 12;\n+154 case _\bQ_\bU_\bA_\bD_\bS : return 4;\n+155 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY :\n+156 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY : return _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n+157 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS : return _\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be();\n+158 case _\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE : return 18;\n+159 case _\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS : return 3;\n+160 case _\bL_\bI_\bN_\bE_\bS : return 2;\n+161 case _\bP_\bO_\bI_\bN_\bT_\bS : return 1;\n+162 default : return -1;\n+163 }\n+164}\n+165\n+166// Returns the number of face-varying control vertices expected for a patch\n+of this type\n+167inline short\n+_\b1_\b6_\b8_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs( _\bT_\by_\bp_\be type ) {\n+169 return _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs(type);\n+170}\n+171\n+172// Allows ordering of patches by type\n+_\b1_\b7_\b3inline bool\n+174_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b<_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const {\n+175 return (_type < other._type);\n+176}\n+177\n+178// True if the descriptors are identical\n+179inline bool\n+_\b1_\b8_\b0_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b ( _\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const other ) const {\n+181 return _type == other._type;\n+182}\n+183\n+184\n+185\n+186} // end namespace Far\n+187\n+188} // end namespace OPENSUBDIV_VERSION\n+189using namespace OPENSUBDIV_VERSION;\n+190\n+191} // end namespace OpenSubdiv\n 192\n-_\b1_\b9_\b4 bool _\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt() const { return (unpack(_\bf_\bi_\be_\bl_\bd_\b1,1,4) != 0); }\n-195\n-_\b1_\b9_\b7 unsigned short _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh() const { return (unsigned short)unpack\n-(_\bf_\bi_\be_\bl_\bd_\b1,4,0); }\n-198\n-200 float _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn() const;\n-201\n-208 template \n-209 void _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const;\n-210 template \n-211 void _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const;\n-212\n-219 template \n-220 void _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const;\n-221 template \n-222 void _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const;\n-223\n-225 bool _\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd() const;\n-226\n-_\b2_\b2_\b8 bool _\bI_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br() const { return (unpack(_\bf_\bi_\be_\bl_\bd_\b1,1,5) != 0); }\n-229\n-_\b2_\b3_\b0 unsigned int _\bf_\bi_\be_\bl_\bd_\b0:32;\n-_\b2_\b3_\b1 unsigned int _\bf_\bi_\be_\bl_\bd_\b1:32;\n-232\n-233private:\n-234 unsigned int pack(unsigned int value, int width, int offset) const {\n-235 return (unsigned int)((value & ((1<> offset) & ((1< _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be;\n-244\n-_\b2_\b4_\b5typedef _\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b> _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by;\n-_\b2_\b4_\b6typedef _\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by_\b<_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b> _\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by;\n-247\n-248inline void\n-_\b2_\b4_\b9_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bS_\be_\bt(_\bI_\bn_\bd_\be_\bx faceid, short u, short v,\n-250 unsigned short depth, bool nonquad,\n-251 unsigned short boundary, unsigned short transition,\n-252 bool regular) {\n-253 _\bf_\bi_\be_\bl_\bd_\b0 = pack(faceid, 28, 0) |\n-254 pack(transition, 4, 28);\n-255\n-256 _\bf_\bi_\be_\bl_\bd_\b1 = pack(u, 10, 22) |\n-257 pack(v, 10, 12) |\n-258 pack(boundary, 5, 7) |\n-259 pack(regular, 1, 5) |\n-260 pack(nonquad, 1, 4) |\n-261 pack(depth, 4, 0);\n-262}\n-263\n-264inline float\n-_\b2_\b6_\b5_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn( ) const {\n-266 return 1.0f / (float)(1 << (_\bG_\be_\bt_\bD_\be_\bp_\bt_\bh() - _\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt()));\n-267}\n-268\n-269template \n-270inline void\n-_\b2_\b7_\b1_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const {\n-272\n-273 REAL fracInv = (REAL)(1.0f / _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn());\n-274\n-275 u = u * fracInv - (REAL)_\bG_\be_\bt_\bU();\n-276 v = v * fracInv - (REAL)_\bG_\be_\bt_\bV();\n-277}\n-278\n-279template \n-280inline void\n-_\b2_\b8_\b1_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be( REAL & u, REAL & v ) const {\n-282\n-283 REAL frac = (REAL)_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn();\n-284\n-285 u = (u + (REAL)_\bG_\be_\bt_\bU()) * frac;\n-286 v = (v + (REAL)_\bG_\be_\bt_\bV()) * frac;\n-287}\n-288\n-289inline bool\n-_\b2_\b9_\b0_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd() const {\n-291\n-292 return (_\bG_\be_\bt_\bU() + _\bG_\be_\bt_\bV()) >= (1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh());\n-293}\n-294\n-295template \n-296inline void\n-_\b2_\b9_\b7_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const {\n-298\n-299 if (_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd()) {\n-300 REAL fracInv = (REAL)(1.0f / _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn());\n-301\n-302 int depthFactor = 1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh();\n-303 u = (REAL)(depthFactor - _\bG_\be_\bt_\bU()) - (u * fracInv);\n-304 v = (REAL)(depthFactor - _\bG_\be_\bt_\bV()) - (v * fracInv);\n-305 } else {\n-306 _\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be(u, v);\n-307 }\n-308}\n-309\n-310template \n-311inline void\n-_\b3_\b1_\b2_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be( REAL & u, REAL & v ) const {\n-313\n-314 if (_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd()) {\n-315 REAL frac = _\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn();\n-316\n-317 int depthFactor = 1 << _\bG_\be_\bt_\bD_\be_\bp_\bt_\bh();\n-318 u = ((REAL)(depthFactor - _\bG_\be_\bt_\bU()) - u) * frac;\n-319 v = ((REAL)(depthFactor - _\bG_\be_\bt_\bV()) - v) * frac;\n-320 } else {\n-321 _\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be(u, v);\n-322 }\n-323}\n-324\n-325} // end namespace Far\n-326\n-327} // end namespace OPENSUBDIV_VERSION\n-328using namespace OPENSUBDIV_VERSION;\n-329\n-330} // end namespace OpenSubdiv\n-331\n-332#endif /* OPENSUBDIV3_FAR_PATCH_PARAM */\n+193#endif /* OPENSUBDIV3_FAR_PATCH_DESCRIPTOR_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n-Vtr::ConstArray< PatchParam > ConstPatchParamArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bT_\ba_\bb_\bl_\be\n-std::vector< PatchParam > PatchParamTable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bI_\bn_\bd_\be_\bx\n-Vtr::Index Index\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bA_\br_\br_\ba_\by\n-Vtr::Array< PatchParam > PatchParamArray\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-Patch parameterization.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be_\bR_\bo_\bt_\ba_\bt_\be_\bd\n-bool IsTriangleRotated() const\n-Returns if a triangular patch is parametrically rotated 180 degrees.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b9_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bI_\bs_\bR_\be_\bg_\bu_\bl_\ba_\br\n-bool IsRegular() const\n-Returns whether the patch is regular.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n-void NormalizeTriangle(REAL &u, REAL &v) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by\n-unsigned short GetBoundary() const\n-Returns the boundary edge encoding for the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bT_\br_\ba_\bn_\bs_\bi_\bt_\bi_\bo_\bn\n-unsigned short GetTransition() const\n-Returns the transition edge encoding for the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bP_\ba_\br_\ba_\bm_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn\n-float GetParamFraction() const\n-Returns the fraction of unit parametric space covered by this face.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bU\n-unsigned short GetU() const\n-Returns the log2 value of the u parameter at the first corner of the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bF_\ba_\bc_\be_\bI_\bd\n-Index GetFaceId() const\n-Returns the faceid.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bD_\be_\bp_\bt_\bh\n-unsigned short GetDepth() const\n-Returns the level of subdivision of the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\bn_\bQ_\bu_\ba_\bd_\bR_\bo_\bo_\bt\n-bool NonQuadRoot() const\n-True if the parent base face is a non-quad.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b9_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bS_\be_\bt\n-void Set(Index faceid, short u, short v, unsigned short depth, bool nonquad,\n-unsigned short boundary, unsigned short transition, bool regular=false)\n-Sets the values of the bit fields.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bC_\bl_\be_\ba_\br\n-void Clear()\n-Resets everything to 0.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b1\n-unsigned int field1\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be\n-void Unnormalize(REAL &u, REAL &v) const\n-A (u,v) pair in a normalized parametric space is mapped back into the fraction\n-of parametric space co...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bU_\bn_\bn_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be_\bT_\br_\bi_\ba_\bn_\bg_\bl_\be\n-void UnnormalizeTriangle(REAL &u, REAL &v) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b3_\b1_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bG_\be_\bt_\bV\n-unsigned short GetV() const\n-Returns the log2 value of the v parameter at the first corner of the patch.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b1_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bf_\bi_\be_\bl_\bd_\b0\n-unsigned int field0\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b3_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b:_\b:_\bN_\bo_\br_\bm_\ba_\bl_\bi_\bz_\be\n-void Normalize(REAL &u, REAL &v) const\n-A (u,v) pair in the fraction of parametric space covered by this face is mapped\n-into a normalized par...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh_\b:_\b2_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bA_\br_\br_\ba_\by\n+Vtr::ConstArray< PatchDescriptor > ConstPatchDescriptorArray\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\bT_\by_\bp_\be\n+SchemeType\n+Enumerated type for all subdivision schemes supported by OpenSubdiv.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+Describes the type of a patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bL_\bI_\bN_\bE_\bS\n+@ LINES\n+lines (useful for cage drawing)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bQ_\bU_\bA_\bD_\bS\n+@ QUADS\n+4-sided quadrilateral (bilinear)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bN_\bO_\bN_\b__\bP_\bA_\bT_\bC_\bH\n+@ NON_PATCH\n+undefined\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bL_\bO_\bO_\bP\n+@ LOOP\n+regular triangular patch for the Loop scheme\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE\n+@ GREGORY_TRIANGLE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\bR_\bI_\bA_\bN_\bG_\bL_\bE_\bS\n+@ TRIANGLES\n+3-sided triangle\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n+@ GREGORY_BOUNDARY\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bA_\bS_\bI_\bS\n+@ GREGORY_BASIS\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\bO_\bI_\bN_\bT_\bS\n+@ POINTS\n+points (useful for cage drawing)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY\n+@ GREGORY\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bR_\bE_\bG_\bU_\bL_\bA_\bR\n+@ REGULAR\n+regular B-Spline patch for the Catmark scheme\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n+bool IsAdaptive() const\n+Returns true if the type is an adaptive patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bT_\by_\bp_\be\n+Type GetType() const\n+Returns the type of the patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bB_\ba_\bs_\bi_\bs_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n+static short GetGregoryBasisPatchSize()\n+Number of control vertices of Gregory patch basis (20)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+short GetNumControlVertices() const\n+Returns the number of control vertices expected for a patch of the type\n+described.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor(PatchDescriptor const &d)\n+Copy Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n+bool operator==(PatchDescriptor const other) const\n+True if the descriptors are identical.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n+static short GetRegularPatchSize()\n+Number of control vertices of Regular Patches in table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bo_\bn_\bt_\br_\bo_\bl_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+short GetNumFVarControlVertices() const\n+Deprecated.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor(int type)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=\n+PatchDescriptor & operator=(PatchDescriptor const &d)\n+Assignment operator.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be\n+static bool IsAdaptive(Type type)\n+Returns true if the type is an adaptive (non-linear) patch.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b<\n+bool operator<(PatchDescriptor const other) const\n+Allows ordering of patches by type.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bS_\bi_\bz_\be\n+static short GetGregoryPatchSize()\n+Number of control vertices of Gregory (and Gregory Boundary) Patches in table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bp_\br_\bi_\bn_\bt\n+void print() const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:\n+_\bG_\be_\bt_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\bs\n+static Vtr::ConstArray< PatchDescriptor > GetAdaptivePatchDescriptors(Sdc::\n+SchemeType type)\n+Returns a vector of all the legal patch descriptors for the given adaptive\n+subdivision scheme.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+PatchDescriptor()\n+Default constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b9\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bC_\bo_\bn_\bs_\bt_\bA_\br_\br_\ba_\by\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br_\b:_\b:_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\ba_\br_\br_\ba_\by_\b._\bh_\b:_\b1_\b0_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\b._\bh\n+ * _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00755.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00755.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
level.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n-#include "../sdc/crease.h"
\n+#include "../sdc/crease.h"
\n #include "../sdc/options.h"
\n #include "../vtr/types.h"
\n #include <algorithm>
\n #include <vector>
\n #include <cassert>
\n #include <cstring>
\n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00755_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00755_source.html", "unified_diff": "@@ -981,15 +981,15 @@\n \n
ConstArray< LocalIndex > ConstLocalIndexArray
Definition types.h:83
\n
Array< LocalIndex > LocalIndexArray
Definition types.h:82
\n \n
ConstArray< Index > ConstIndexArray
Definition types.h:80
\n \n \n-\n+\n
\n \n \n
\n
    \n
  • opensubdiv
  • vtr
  • level.h
  • \n
  • Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by \"doxygen\"/ 1.9.8
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00758.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00758.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
    fvarRefinement.h File Reference
    \n
\n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n-#include "../sdc/crease.h"
\n+#include "../sdc/crease.h"
\n #include "../vtr/types.h"
\n #include "../vtr/refinement.h"
\n #include "../vtr/fvarLevel.h"
\n #include <vector>
\n #include <cassert>
\n #include <cstring>
\n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00761.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00761.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
fvarLevel.h File Reference
\n
\n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n-#include "../sdc/crease.h"
\n+#include "../sdc/crease.h"
\n #include "../sdc/options.h"
\n #include "../vtr/types.h"
\n #include "../vtr/level.h"
\n #include <vector>
\n #include <cassert>
\n #include <cstring>
\n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00761_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00761_source.html", "unified_diff": "@@ -541,16 +541,16 @@\n \n
ConstArray< LocalIndex > ConstLocalIndexArray
Definition types.h:83
\n
Array< LocalIndex > LocalIndexArray
Definition types.h:82
\n \n
ConstArray< Index > ConstIndexArray
Definition types.h:80
\n \n \n-\n-\n+\n+\n
\n \n \n
\n
    \n
  • opensubdiv
  • vtr
  • fvarLevel.h
  • \n
  • Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by \"doxygen\"/ 1.9.8
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00764.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00764.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
    componentInterfaces.h File Reference
    \n
\n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n-#include "../sdc/crease.h"
\n+#include "../sdc/crease.h"
\n #include "../vtr/types.h"
\n #include "../vtr/stackBuffer.h"
\n #include <vector>
\n
\n

Go to the source code of this file.

\n \n \n \n

\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00770.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00770.html", "unified_diff": "@@ -96,15 +96,15 @@\n Namespaces \n
scheme.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../sdc/types.h"
\n #include "../sdc/options.h"
\n-#include "../sdc/crease.h"
\n+#include "../sdc/crease.h"
\n #include <cassert>
\n #include <cstdlib>
\n #include <vector>
\n
\n

Go to the source code of this file.

\n \n \n \n

\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00770_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00770_source.html", "has_internal_linenos": true, "unified_diff": "@@ -7138,16 +7138,16 @@\n 0001be10: 7465 6420 746f 2073 656d 692d 7368 6172 ted to semi-shar\n 0001be20: 7020 6372 6561 7369 6e67 20e2 8093 2077 p creasing ... w\n 0001be30: 686f 7365 2069 6d70 6c65 6d65 6e74 6174 hose implementat\n 0001be40: 696f 6e20 6973 2069 6e64 6570 656e 6465 ion is independe\n 0001be50: 6e74 206f 2e2e 2e3c 2f64 6976 3e3c 6469 nt o...\n 0001be70: 3c62 3e44 6566 696e 6974 696f 6e3c 2f62 Definition crease.h:6\n 0001beb0: 323c 2f61 3e3c 2f64 6976 3e3c 2f64 6976 2.
Rule
<\n 0001bfc0: 623e 4465 6669 6e69 7469 6f6e 3c2f 623e b>Definition
\n-0001bfd0: 203c 6120 6872 6566 3d22 6130 3037 3832 crease.h:82\n 0001c000: 3c2f 613e 3c2f 6469 763e 3c2f 6469 763e \n 0001c010: 0a3c 6469 7620 636c 6173 733d 2274 7463 .
@ RULE_D\n 0001c140: 4152 543c 2f64 6976 3e3c 6469 7620 636c ART
D\n 0001c160: 6566 696e 6974 696f 6e3c 2f62 3e20 3c61 efinition crease.h:85
.
@ RULE_SM\n 0001c2e0: 4f4f 5448 3c2f 6469 763e 3c64 6976 2063 OOTH
\n 0001c300: 4465 6669 6e69 7469 6f6e 3c2f 623e 203c Definition <\n-0001c310: 6120 6872 6566 3d22 6130 3037 3832 5f73 a href=\"a00782_s\n+0001c310: 6120 6872 6566 3d22 6130 3037 3739 5f73 a href=\"a00779_s\n 0001c320: 6f75 7263 652e 6874 6d6c 236c 3030 3038 ource.html#l0008\n 0001c330: 3422 3e63 7265 6173 652e 683a 3834 3c2f 4\">crease.h:84
.<\n 0001c350: 6469 7620 636c 6173 733d 2274 7463 2220 div class=\"ttc\" \n 0001c360: 6964 3d22 6161 3031 3333 335f 6874 6d6c id=\"aa01333_html\n 0001c370: 5f61 3131 6663 6435 3165 6638 3631 3138 _a11fcd51ef86118\n 0001c380: 6636 3565 3630 3363 3134 3734 3337 3761 f65e603c1474377a\n@@ -7237,15 +7237,15 @@\n 0001c440: 3a3a 5364 633a 3a43 7265 6173 653a 3a52 ::Sdc::Crease::R\n 0001c450: 554c 455f 4352 4541 5345 3c2f 613e 3c2f ULE_CREASE
@ RULE_C\n 0001c480: 5245 4153 453c 2f64 6976 3e3c 6469 7620 REASE
Definition \n-0001c4b0: 3c61 2068 7265 663d 2261 3030 3738 325f crease.h:86<\n 0001c4e0: 2f61 3e3c 2f64 6976 3e3c 2f64 6976 3e0a /a>
.\n 0001c4f0: 3c64 6976 2063 6c61 7373 3d22 7474 6322
\n 0001c600: 3c2f 6469 763e 3c64 6976 2063 6c61 7373
@ RULE\n 0001c620: 5f55 4e4b 4e4f 574e 3c2f 6469 763e 3c64 _UNKNOWN
Definition
crease.h:\n 0001c680: 3833 3c2f 613e 3c2f 6469 763e 3c2f 6469 83
.
Definitio\n 0001c820: 6e3c 2f62 3e20 3c61 2068 7265 663d 2261 n crease\n 0001c850: 2e68 3a32 3238 3c2f 613e 3c2f 6469 763e .h:228
\n 0001c860: 3c2f 6469 763e 0a3c 6469 7620 636c 6173
.
\n 0001cab0: 3c64 6976 2063 6c61 7373 3d22 7474 6465
bool IsUnifo\n 0001cad0: 726d 2829 2063 6f6e 7374 3c2f 6469 763e rm() const
\n 0001cae0: 3c64 6976 2063 6c61 7373 3d22 7474 6465
Definition\n 0001cb00: 3c2f 623e 203c 6120 6872 6566 3d22 6130 crease.\n 0001cb30: 683a 3935 3c2f 613e 3c2f 6469 763e 3c2f h:95
.
\n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/catmarkScheme.h File Reference\n+OpenSubdiv: opensubdiv/sdc/crease.h File Reference\n \n \n \n \n \n \n \n@@ -88,38 +88,43 @@\n
\n
\n
\n \n \n
\n \n-
catmarkScheme.h File Reference
\n+
crease.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/scheme.h"
\n-#include <cassert>
\n-#include <cmath>
\n+#include "../sdc/options.h"
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+\n+

\n+Classes

class  Crease
 Types, constants and utilities related to semi-sharp creasing – whose implementation is independent of the subdivision scheme. More...
 
\n \n \n \n \n \n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Sdc
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,22 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-catmarkScheme.h File Reference\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+crease.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bs_\bc_\bh_\be_\bm_\be_\b._\bh\"\n-#include \n-#include \n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bC_\br_\be_\ba_\bs_\be\n+\u00a0 Types, constants and utilities related to semi-sharp creasing \u2013 whose\n+ implementation is independent of the subdivision scheme. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bc_\br_\be_\ba_\bs_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00779_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00779_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/catmarkScheme.h Source File\n+OpenSubdiv: opensubdiv/sdc/crease.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
catmarkScheme.h
\n+
crease.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,566 +118,221 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n-
25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n+
24#ifndef OPENSUBDIV3_SDC_CREASE_H
\n+
25#define OPENSUBDIV3_SDC_CREASE_H
\n
26
\n
27#include "../version.h"
\n
28
\n-
29#include "../sdc/scheme.h"
\n+
29#include "../sdc/options.h"
\n
30
\n-
31#include <cassert>
\n-
32#include <cmath>
\n+
31namespace OpenSubdiv {
\n+
32namespace OPENSUBDIV_VERSION {
\n
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Sdc {
\n-
38
\n-
39//
\n-
40// Specializations for Scheme<SCHEME_CATMARK>:
\n-
41//
\n-
42
\n-
43//
\n-
44// Catmark traits:
\n-
45//
\n-
46template <>
\n-\n-
48
\n-
49template <>
\n-\n-
51
\n-
52template <>
\n-\n-
54
\n-
55template <>
\n-\n-
57
\n-
58
\n-
59//
\n-
60// Masks for edge-vertices: the hard Crease mask does not need to be specialized
\n-
61// (simply the midpoint), so all that is left is the Smooth case:
\n-
62//
\n-
63// The Smooth mask is complicated by the need to support the "triangle subdivision"
\n-
64// option, which applies different weighting in the presence of triangles. It is
\n-
65// up for debate as to whether this is useful or not -- we may be able to deprecate
\n-
66// this option.
\n-
67//
\n-
68template <>
\n-
69template <typename EDGE, typename MASK>
\n-
70inline void
\n-
\n-
71Scheme<SCHEME_CATMARK>::assignSmoothMaskForEdge(EDGE const& edge, MASK& mask) const {
\n-
72
\n-
73 typedef typename MASK::Weight Weight;
\n-
74
\n-
75 int faceCount = edge.GetNumFaces();
\n-
76
\n-
77 mask.SetNumVertexWeights(2);
\n-
78 mask.SetNumEdgeWeights(0);
\n-
79 mask.SetNumFaceWeights(faceCount);
\n-
80 mask.SetFaceWeightsForFaceCenters(true);
\n-
81
\n-
82 //
\n-
83 // Determine if we need to inspect incident faces and apply alternate weighting for
\n-
84 // triangles -- and if so, determine which of the two are triangles.
\n-
85 //
\n-
86 bool face0IsTri = false;
\n-
87 bool face1IsTri = false;
\n-
88 bool useTriangleOption = (_options.GetTriangleSubdivision() == Options::TRI_SUB_SMOOTH);
\n-
89 if (useTriangleOption) {
\n-
90 if (faceCount == 2) {
\n-
91 //
\n-
92 // Ideally we want to avoid this inspection when we have already subdivided at
\n-
93 // least once -- need something in the Edge interface to help avoid this, e.g.
\n-
94 // an IsRegular() query, the subdivision level...
\n-
95 //
\n-
96 int vertsPerFace[2];
\n-
97 edge.GetNumVerticesPerFace(vertsPerFace);
\n+
34namespace Sdc {
\n+
35
\n+
61
\n+
\n+
62class Crease {
\n+
63public:
\n+
65
\n+
67 static float const SHARPNESS_SMOOTH; // = 0.0f, do we really need this?
\n+
68 static float const SHARPNESS_INFINITE; // = 10.0f;
\n+
69
\n+
70 static bool IsSmooth(float sharpness) { return sharpness <= SHARPNESS_SMOOTH; }
\n+
71 static bool IsSharp(float sharpness) { return sharpness > SHARPNESS_SMOOTH; }
\n+
72 static bool IsInfinite(float sharpness) { return sharpness >= SHARPNESS_INFINITE; }
\n+
73 static bool IsSemiSharp(float sharpness) { return (SHARPNESS_SMOOTH < sharpness) && (sharpness < SHARPNESS_INFINITE); }
\n+
75
\n+
\n+
82 enum Rule {
\n+\n+
84 RULE_SMOOTH = (1 << 0),
\n+
85 RULE_DART = (1 << 1),
\n+
86 RULE_CREASE = (1 << 2),
\n+
87 RULE_CORNER = (1 << 3)
\n+
88 };
\n+
\n+
89
\n+
90public:
\n+
91 Crease() : _options() { }
\n+
92 Crease(Options const& options) : _options(options) { }
\n+
93 ~Crease() { }
\n+
94
\n+
95 bool IsUniform() const { return _options.GetCreasingMethod() == Options::CREASE_UNIFORM; }
\n+
96
\n
98
\n-
99 face0IsTri = (vertsPerFace[0] == 3);
\n-
100 face1IsTri = (vertsPerFace[1] == 3);
\n-
101 useTriangleOption = face0IsTri || face1IsTri;
\n-
102 } else {
\n-
103 useTriangleOption = false;
\n-
104 }
\n-
105 }
\n+
104 float SharpenBoundaryEdge(float edgeSharpness) const;
\n+
105 float SharpenBoundaryVertex(float edgeSharpness) const;
\n
106
\n-
107 if (! useTriangleOption) {
\n-
108 mask.VertexWeight(0) = 0.25f;
\n-
109 mask.VertexWeight(1) = 0.25f;
\n-
110
\n-
111 if (faceCount == 2) {
\n-
112 mask.FaceWeight(0) = 0.25f;
\n-
113 mask.FaceWeight(1) = 0.25f;
\n-
114 } else {
\n-
115 Weight fWeight = 0.5f / (Weight)faceCount;
\n-
116 for (int i = 0; i < faceCount; ++i) {
\n-
117 mask.FaceWeight(i) = fWeight;
\n-
118 }
\n-
119 }
\n-
120 } else {
\n-
121 //
\n-
122 // This mimics the implementation in Hbr in terms of order of operations.
\n-
123 //
\n-
124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;
\n+
107 // For future consideration
\n+
108 //float SharpenNonManifoldEdge(float edgeSharpness) const;
\n+
109 //float SharpenNonManifoldVertex(float edgeSharpness) const;
\n+
111
\n+
113
\n+
124 float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const;
\n
125
\n-
126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n-
127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n-
128
\n-
129 Weight fWeight = 0.5f * (f0Weight + f1Weight);
\n-
130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);
\n+
126 float SubdivideVertexSharpness(float vertexSharpness) const;
\n+
127
\n+
128 float SubdivideEdgeSharpnessAtVertex(float edgeSharpness,
\n+
129 int incidentEdgeCountAtEndVertex,
\n+
130 float const* edgeSharpnessAroundEndVertex) const;
\n
131
\n-
132 mask.VertexWeight(0) = vWeight;
\n-
133 mask.VertexWeight(1) = vWeight;
\n-
134
\n-
135 mask.FaceWeight(0) = fWeight;
\n-
136 mask.FaceWeight(1) = fWeight;
\n-
137 }
\n-
138}
\n-
\n-
139
\n-
140
\n-
141//
\n-
142// Masks for vertex-vertices: the hard Corner mask does not need to be specialized
\n-
143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is smooth):
\n-
144//
\n-
145template <>
\n-
146template <typename VERTEX, typename MASK>
\n-
147inline void
\n-
\n-\n-
149 int const creaseEnds[2]) const {
\n-
150 typedef typename MASK::Weight Weight;
\n-
151
\n-
152 int valence = vertex.GetNumEdges();
\n-
153
\n-
154 mask.SetNumVertexWeights(1);
\n-
155 mask.SetNumEdgeWeights(valence);
\n-
156 mask.SetNumFaceWeights(0);
\n-
157 mask.SetFaceWeightsForFaceCenters(false);
\n-
158
\n-
159 Weight vWeight = 0.75f;
\n-
160 Weight eWeight = 0.125f;
\n-
161
\n-
162 mask.VertexWeight(0) = vWeight;
\n-
163 for (int i = 0; i < valence; ++i) {
\n-
164 mask.EdgeWeight(i) = 0.0f;
\n-
165 }
\n-
166 mask.EdgeWeight(creaseEnds[0]) = eWeight;
\n-
167 mask.EdgeWeight(creaseEnds[1]) = eWeight;
\n-
168}
\n-
\n-
169
\n-
170template <>
\n-
171template <typename VERTEX, typename MASK>
\n-
172inline void
\n-
\n-
173Scheme<SCHEME_CATMARK>::assignSmoothMaskForVertex(VERTEX const& vertex, MASK& mask) const {
\n-
174
\n-
175 typedef typename MASK::Weight Weight;
\n+
132 void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex,
\n+
133 float const* incidentEdgeSharpnessAroundVertex,
\n+
134 float* childEdgesSharpnessAroundVertex) const;
\n+
136
\n+
138
\n+
144 Rule DetermineVertexVertexRule(float vertexSharpness,
\n+
145 int incidentEdgeCount,
\n+
146 float const* incidentEdgeSharpness) const;
\n+
147 Rule DetermineVertexVertexRule(float vertexSharpness,
\n+
148 int sharpEdgeCount) const;
\n+
150
\n+
162 float ComputeFractionalWeightAtVertex(float vertexSharpness,
\n+
163 float childVertexSharpness,
\n+
164 int incidentEdgeCount,
\n+
165 float const* incidentEdgeSharpness,
\n+
166 float const* childEdgesSharpness) const;
\n+
167
\n+
168 void GetSharpEdgePairOfCrease(float const * incidentEdgeSharpness,
\n+
169 int incidentEdgeCount,
\n+
170 int sharpEdgePair[2]) const;
\n+
171
\n+
172 // Would these really help? Maybe only need Rules for the vertex-vertex case...
\n+
173 //
\n+
174 // Rule DetermineEdgeVertexRule(float parentEdgeSharpness) const;
\n+
175 // Rule DetermineEdgeVertexRule(float childEdge1Sharpness, float childEdge2Sharpness) const;
\n
176
\n-
177 //
\n-
178 // A Smooth vertex must be manifold and interior -- manifold boundary vertices will be
\n-
179 // Creases and non-manifold vertices of any kind will be Corners or Creases. If smooth
\n-
180 // rules for non-manifold vertices are ever defined, this will need adjusting:
\n-
181 //
\n-
182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());
\n+
177protected:
\n+
178 float decrementSharpness(float sharpness) const;
\n+
179
\n+
180private:
\n+
181 Options _options;
\n+
182};
\n+
\n
183
\n-
184 int valence = vertex.GetNumFaces();
\n-
185
\n-
186 mask.SetNumVertexWeights(1);
\n-
187 mask.SetNumEdgeWeights(valence);
\n-
188 mask.SetNumFaceWeights(valence);
\n-
189 mask.SetFaceWeightsForFaceCenters(true);
\n+
184
\n+
185//
\n+
186// Inline declarations:
\n+
187//
\n+
188inline float
\n+
\n+
189Crease::SharpenBoundaryEdge(float /* edgeSharpness */) const {
\n
190
\n-
191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;
\n-
192 Weight fWeight = 1.0f / (Weight)(valence * valence);
\n-
193 Weight eWeight = fWeight;
\n-
194
\n-
195 mask.VertexWeight(0) = vWeight;
\n-
196 for (int i = 0; i < valence; ++i) {
\n-
197 mask.EdgeWeight(i) = eWeight;
\n-
198 mask.FaceWeight(i) = fWeight;
\n-
199 }
\n-
200}
\n-
\n+
191 //
\n+
192 // Despite the presence of the BOUNDARY_NONE option, boundary edges are always sharpened.
\n+
193 // Much of the code relies on sharpness to indicate boundaries to avoid the more complex
\n+
194 // topological inspection
\n+
195 //
\n+
196 return SHARPNESS_INFINITE;
\n+
197}
\n+
\n+
198
\n+
199inline float
\n+
\n+
200Crease::SharpenBoundaryVertex(float vertexSharpness) const {
\n
201
\n-
202//
\n-
203// Limit masks for position:
\n-
204//
\n-
205template <>
\n-
206template <typename VERTEX, typename MASK>
\n-
207inline void
\n-
\n-
208Scheme<SCHEME_CATMARK>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n-
209
\n-
210 posMask.SetNumVertexWeights(1);
\n-
211 posMask.SetNumEdgeWeights(0);
\n-
212 posMask.SetNumFaceWeights(0);
\n-
213 posMask.SetFaceWeightsForFaceCenters(false);
\n-
214
\n-
215 posMask.VertexWeight(0) = 1.0f;
\n-
216}
\n+\n+
203 SHARPNESS_INFINITE : vertexSharpness;
\n+
204}
\n+
\n+
205
\n+
206inline float
\n+
\n+
207Crease::decrementSharpness(float sharpness) const {
\n+
208
\n+
209 if (IsSmooth(sharpness)) return Crease::SHARPNESS_SMOOTH; // redundant but most common
\n+
210 if (IsInfinite(sharpness)) return Crease::SHARPNESS_INFINITE;
\n+
211 if (sharpness > 1.0f) return (sharpness - 1.0f);
\n+\n+
213}
\n
\n+
214
\n+
215inline float
\n+
\n+
216Crease::SubdivideUniformSharpness(float vertexOrEdgeSharpness) const {
\n
217
\n-
218template <>
\n-
219template <typename VERTEX, typename MASK>
\n-
220inline void
\n-
\n-
221Scheme<SCHEME_CATMARK>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n-
222 int const creaseEnds[2]) const {
\n+
218 return decrementSharpness(vertexOrEdgeSharpness);
\n+
219}
\n+
\n+
220
\n+
221inline float
\n+
\n+
222Crease::SubdivideVertexSharpness(float vertexSharpness) const {
\n
223
\n-
224 typedef typename MASK::Weight Weight;
\n-
225
\n-
226 int valence = vertex.GetNumEdges();
\n-
227
\n-
228 posMask.SetNumVertexWeights(1);
\n-
229 posMask.SetNumEdgeWeights(valence);
\n-
230 posMask.SetNumFaceWeights(0);
\n-
231 posMask.SetFaceWeightsForFaceCenters(false);
\n-
232
\n-
233 Weight vWeight = (Weight)(2.0 / 3.0);
\n-
234 Weight eWeight = (Weight)(1.0 / 6.0);
\n-
235
\n-
236 posMask.VertexWeight(0) = vWeight;
\n-
237 for (int i = 0; i < valence; ++i) {
\n-
238 posMask.EdgeWeight(i) = 0.0f;
\n-
239 }
\n-
240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;
\n-
241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;
\n-
242}
\n-
\n-
243
\n-
244template <>
\n-
245template <typename VERTEX, typename MASK>
\n-
246inline void
\n-
\n-
247Scheme<SCHEME_CATMARK>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n-
248
\n-
249 typedef typename MASK::Weight Weight;
\n-
250
\n-
251 int valence = vertex.GetNumFaces();
\n-
252 if (valence == 2) {
\n-
253 assignCornerLimitMask(vertex, posMask);
\n-
254 return;
\n-
255 }
\n-
256
\n-
257 posMask.SetNumVertexWeights(1);
\n-
258 posMask.SetNumEdgeWeights(valence);
\n-
259 posMask.SetNumFaceWeights(valence);
\n-
260 posMask.SetFaceWeightsForFaceCenters(false);
\n-
261
\n-
262 // Specialize for the regular case:
\n-
263 if (valence == 4) {
\n-
264 Weight fWeight = (Weight)(1.0 / 36.0);
\n-
265 Weight eWeight = (Weight)(1.0 / 9.0);
\n-
266 Weight vWeight = (Weight)(4.0 / 9.0);
\n-
267
\n-
268 posMask.VertexWeight(0) = vWeight;
\n-
269
\n-
270 posMask.EdgeWeight(0) = eWeight;
\n-
271 posMask.EdgeWeight(1) = eWeight;
\n-
272 posMask.EdgeWeight(2) = eWeight;
\n-
273 posMask.EdgeWeight(3) = eWeight;
\n-
274
\n-
275 posMask.FaceWeight(0) = fWeight;
\n-
276 posMask.FaceWeight(1) = fWeight;
\n-
277 posMask.FaceWeight(2) = fWeight;
\n-
278 posMask.FaceWeight(3) = fWeight;
\n-
279 } else {
\n-
280 Weight Valence = (Weight) valence;
\n-
281
\n-
282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));
\n-
283 Weight eWeight = 4.0f * fWeight;
\n-
284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);
\n-
285
\n-
286 posMask.VertexWeight(0) = vWeight;
\n-
287 for (int i = 0; i < valence; ++i) {
\n-
288 posMask.EdgeWeight(i) = eWeight;
\n-
289 posMask.FaceWeight(i) = fWeight;
\n-
290 }
\n-
291 }
\n-
292}
\n-
\n-
293
\n-
294//
\n-
295// Limit masks for tangents -- these are stubs for now, or have a temporary
\n-
296// implementation
\n-
297//
\n-
298template <>
\n-
299template <typename VERTEX, typename MASK>
\n-
300inline void
\n-
\n-\n-
302 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
303
\n-
304 int valence = vertex.GetNumEdges();
\n-
305
\n-
306 tan1Mask.SetNumVertexWeights(1);
\n-
307 tan1Mask.SetNumEdgeWeights(valence);
\n-
308 tan1Mask.SetNumFaceWeights(0);
\n-
309 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
310
\n-
311 tan2Mask.SetNumVertexWeights(1);
\n-
312 tan2Mask.SetNumEdgeWeights(valence);
\n-
313 tan2Mask.SetNumFaceWeights(0);
\n-
314 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
315
\n-
316 // Should be at least 2 edges -- be sure to clear weights for any more:
\n-
317 tan1Mask.VertexWeight(0) = -1.0f;
\n-
318 tan1Mask.EdgeWeight(0) = 1.0f;
\n-
319 tan1Mask.EdgeWeight(1) = 0.0f;
\n-
320
\n-
321 tan2Mask.VertexWeight(0) = -1.0f;
\n-
322 tan2Mask.EdgeWeight(0) = 0.0f;
\n-
323 tan2Mask.EdgeWeight(1) = 1.0f;
\n-
324
\n-
325 for (int i = 2; i < valence; ++i) {
\n-
326 tan1Mask.EdgeWeight(i) = 0.0f;
\n-
327 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
328 }
\n-
329}
\n-
\n-
330
\n-
331template <>
\n-
332template <typename VERTEX, typename MASK>
\n-
333inline void
\n-
\n-\n-
335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {
\n-
336
\n-
337 typedef typename MASK::Weight Weight;
\n-
338
\n-
339 //
\n-
340 // First, the tangent along the crease:
\n-
341 // The first crease edge is considered the "leading" edge of the span
\n-
342 // of surface for which we are evaluating tangents and the second edge the
\n-
343 // "trailing edge". By convention, the tangent along the crease is oriented
\n-
344 // in the direction of the leading edge.
\n-
345 //
\n-
346 int numEdges = vertex.GetNumEdges();
\n-
347 int numFaces = vertex.GetNumFaces();
\n-
348
\n-
349 tan1Mask.SetNumVertexWeights(1);
\n-
350 tan1Mask.SetNumEdgeWeights(numEdges);
\n-
351 tan1Mask.SetNumFaceWeights(numFaces);
\n-
352 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
353
\n-
354 tan1Mask.VertexWeight(0) = 0.0f;
\n-
355 for (int i = 0; i < numEdges; ++i) {
\n-
356 tan1Mask.EdgeWeight(i) = 0.0f;
\n-
357 }
\n-
358 for (int i = 0; i < numFaces; ++i) {
\n-
359 tan1Mask.FaceWeight(i) = 0.0f;
\n-
360 }
\n-
361
\n-
362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;
\n-
363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;
\n-
364
\n-
365 //
\n-
366 // Second, the tangent across the interior faces:
\n-
367 // Note this is ambiguous for an interior vertex. We currently return
\n-
368 // the tangent for the surface in the counter-clockwise span between the
\n-
369 // leading and trailing edges that form the crease. Given the expected
\n-
370 // computation of a surface normal as Tan1 X Tan2, this tangent should be
\n-
371 // oriented "inward" from the crease/boundary -- across the surface rather
\n-
372 // than outward and away from it.
\n-
373 //
\n-
374 tan2Mask.SetNumVertexWeights(1);
\n-
375 tan2Mask.SetNumEdgeWeights(numEdges);
\n-
376 tan2Mask.SetNumFaceWeights(numFaces);
\n-
377 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
378
\n-
379 // Prepend weights of 0 preceding the crease:
\n-
380 for (int i = 0; i < creaseEnds[0]; ++i) {
\n-
381 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
382 tan2Mask.FaceWeight(i) = 0.0f;
\n-
383 }
\n-
384
\n-
385 // Assign weights to crease edge and interior points:
\n-
386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;
\n-
387 if (interiorEdgeCount == 1) {
\n-
388 // The regular case -- uniform B-spline cross-tangent:
\n-
389
\n-
390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);
\n-
391
\n-
392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);
\n-
393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);
\n-
394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);
\n-
395
\n-
396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);
\n-
397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);
\n-
398 } else if (interiorEdgeCount > 1) {
\n-
399 // The irregular case -- formulae from Biermann et al:
\n-
400
\n-
401 double k = (double) (interiorEdgeCount + 1);
\n-
402 double theta = M_PI / k;
\n-
403
\n-
404 double cosTheta = std::cos(theta);
\n-
405 double sinTheta = std::sin(theta);
\n-
406
\n-
407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):
\n-
408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));
\n-
409 double R = (cosTheta + 1.0f) / sinTheta;
\n-
410
\n-
411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);
\n-
412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);
\n-
413
\n-
414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);
\n-
415
\n-
416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);
\n-
417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);
\n-
418
\n-
419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);
\n-
420
\n-
421 double sinThetaI = 0.0f;
\n-
422 double sinThetaIplus1 = sinTheta;
\n-
423 for (int i = 1; i < k; ++i) {
\n-
424 sinThetaI = sinThetaIplus1;
\n-
425 sinThetaIplus1 = std::sin((i+1)*theta);
\n-
426
\n-
427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) * commonDenom);
\n-
428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI + sinThetaIplus1) * commonDenom);
\n-
429 }
\n-
430 } else {
\n-
431 // Special case for a single face -- simple average of boundary edges:
\n-
432
\n-
433 tan2Mask.VertexWeight(0) = -6.0f;
\n-
434
\n-
435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;
\n-
436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;
\n-
437
\n-
438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;
\n-
439 }
\n-
440
\n-
441 // Append weights of 0 following the crease:
\n-
442 for (int i = creaseEnds[1]; i < numFaces; ++i) {
\n-
443 tan2Mask.FaceWeight(i) = 0.0f;
\n-
444 }
\n-
445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {
\n-
446 tan2Mask.EdgeWeight(i) = 0.0f;
\n-
447 }
\n-
448}
\n-
\n-
449
\n-
450template <>
\n-
451template <typename VERTEX, typename MASK>
\n-
452inline void
\n-
\n-\n-
454 MASK& tan1Mask, MASK& tan2Mask) const {
\n-
455
\n-
456 typedef typename MASK::Weight Weight;
\n-
457
\n-
458 int valence = vertex.GetNumFaces();
\n-
459 if (valence == 2) {
\n-
460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n-
461 return;
\n-
462 }
\n-
463
\n-
464 // Compute tan1 initially -- tan2 is simply a rotation:
\n-
465 tan1Mask.SetNumVertexWeights(1);
\n-
466 tan1Mask.SetNumEdgeWeights(valence);
\n-
467 tan1Mask.SetNumFaceWeights(valence);
\n-
468 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n-
469
\n-
470 tan1Mask.VertexWeight(0) = 0.0f;
\n-
471
\n-
472 if (valence == 4) {
\n-
473 tan1Mask.EdgeWeight(0) = 4.0f;
\n-
474 tan1Mask.EdgeWeight(1) = 0.0f;
\n-
475 tan1Mask.EdgeWeight(2) = -4.0f;
\n-
476 tan1Mask.EdgeWeight(3) = 0.0f;
\n-
477
\n-
478 tan1Mask.FaceWeight(0) = 1.0f;
\n-
479 tan1Mask.FaceWeight(1) = -1.0f;
\n-
480 tan1Mask.FaceWeight(2) = -1.0f;
\n-
481 tan1Mask.FaceWeight(3) = 1.0f;
\n-
482 } else {
\n-
483 double theta = 2.0f * M_PI / (double)valence;
\n-
484
\n-
485 double cosTheta = std::cos(theta);
\n-
486 double cosHalfTheta = std::cos(theta * 0.5f);
\n-
487
\n-
488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *
\n-
489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));
\n-
490
\n-
491 double edgeWeightScale = 4.0f;
\n-
492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);
\n-
493
\n-
494 for (int i = 0; i < valence; ++i) {
\n-
495 double cosThetaI = std::cos( i * theta);
\n-
496 double cosThetaIplus1 = std::cos((i+1)* theta);
\n-
497
\n-
498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);
\n-
499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI + cosThetaIplus1));
\n-
500 }
\n-
501 }
\n-
502
\n-
503 // Now rotate/copy tan1 weights to tan2:
\n-
504 tan2Mask.SetNumVertexWeights(1);
\n-
505 tan2Mask.SetNumEdgeWeights(valence);
\n-
506 tan2Mask.SetNumFaceWeights(valence);
\n-
507 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n-
508
\n-
509 tan2Mask.VertexWeight(0) = 0.0f;
\n-
510 if (valence == 4) {
\n-
511 tan2Mask.EdgeWeight(0) = 0.0f;
\n-
512 tan2Mask.EdgeWeight(1) = 4.0f;
\n-
513 tan2Mask.EdgeWeight(2) = 0.0f;
\n-
514 tan2Mask.EdgeWeight(3) = -4.0f;
\n-
515
\n-
516 tan2Mask.FaceWeight(0) = 1.0f;
\n-
517 tan2Mask.FaceWeight(1) = 1.0f;
\n-
518 tan2Mask.FaceWeight(2) = -1.0f;
\n-
519 tan2Mask.FaceWeight(3) = -1.0f;
\n-
520 } else {
\n-
521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);
\n-
522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);
\n-
523 for (int i = 1; i < valence; ++i) {
\n-
524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);
\n-
525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);
\n-
526 }
\n-
527 }
\n-
528}
\n-
\n-
529
\n-
530} // end namespace sdc
\n-
531
\n-
532} // end namespace OPENSUBDIV_VERSION
\n-
533using namespace OPENSUBDIV_VERSION;
\n-
534} // end namespace OpenSubdiv
\n-
535
\n-
536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */
\n+
224 return decrementSharpness(vertexSharpness);
\n+
225}
\n+
\n+
226
\n+
227inline void
\n+
\n+
228Crease::GetSharpEdgePairOfCrease(float const * incidentEdgeSharpness, int incidentEdgeCount,
\n+
229 int sharpEdgePair[2]) const {
\n+
230
\n+
231 // Only to be called when a crease is present at a vertex -- exactly two sharp
\n+
232 // edges are expected here:
\n+
233 //
\n+
234 sharpEdgePair[0] = 0;
\n+
235 while (IsSmooth(incidentEdgeSharpness[sharpEdgePair[0]])) ++ sharpEdgePair[0];
\n+
236
\n+
237 sharpEdgePair[1] = incidentEdgeCount - 1;
\n+
238 while (IsSmooth(incidentEdgeSharpness[sharpEdgePair[1]])) -- sharpEdgePair[1];
\n+
239}
\n+
\n+
240
\n+
241} // end namespace sdc
\n+
242
\n+
243} // end namespace OPENSUBDIV_VERSION
\n+
244using namespace OPENSUBDIV_VERSION;
\n+
245} // end namespace OpenSubdiv
\n+
246
\n+
247#endif /* OPENSUBDIV3_SDC_CREASE_H */
\n \n-
Split
Enumerated type for all face splitting schemes.
Definition types.h:47
\n-
@ SPLIT_TO_QUADS
Used by Catmark and Bilinear.
Definition types.h:48
\n-
@ TRI_SUB_SMOOTH
"smooth triangle" weights (Catmark scheme only)
Definition options.h:74
\n-
void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const
\n-\n-
void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const creaseEnds[2]) const
\n-
void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2, int const creaseEnds[2]) const
\n-\n-
void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const
\n-\n-
void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const creaseEnds[2]) const
\n-
void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const
\n-\n-
void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n-
void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const
\n-
void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n+
Types, constants and utilities related to semi-sharp creasing \u2013 whose implementation is independent o...
Definition crease.h:62
\n+
float SubdivideVertexSharpness(float vertexSharpness) const
Definition crease.h:222
\n+
static bool IsInfinite(float sharpness)
Definition crease.h:72
\n+\n+\n+\n+\n+\n+\n+
float SharpenBoundaryVertex(float edgeSharpness) const
Definition crease.h:200
\n+\n+
void GetSharpEdgePairOfCrease(float const *incidentEdgeSharpness, int incidentEdgeCount, int sharpEdgePair[2]) const
Definition crease.h:228
\n+\n+
Rule DetermineVertexVertexRule(float vertexSharpness, int incidentEdgeCount, float const *incidentEdgeSharpness) const
\n+
float decrementSharpness(float sharpness) const
Definition crease.h:207
\n+
static bool IsSmooth(float sharpness)
Definition crease.h:70
\n+
Rule DetermineVertexVertexRule(float vertexSharpness, int sharpEdgeCount) const
\n+\n+
static bool IsSemiSharp(float sharpness)
Definition crease.h:73
\n+\n+
void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex, float const *incidentEdgeSharpnessAroundVertex, float *childEdgesSharpnessAroundVertex) const
\n+
float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const
Definition crease.h:216
\n+\n+
float SharpenBoundaryEdge(float edgeSharpness) const
Definition crease.h:189
\n+
float ComputeFractionalWeightAtVertex(float vertexSharpness, float childVertexSharpness, int incidentEdgeCount, float const *incidentEdgeSharpness, float const *childEdgesSharpness) const
Transitional weighting: When the rules applicable to a parent vertex and its child differ,...
\n+
float SubdivideEdgeSharpnessAtVertex(float edgeSharpness, int incidentEdgeCountAtEndVertex, float const *edgeSharpnessAroundEndVertex) const
\n+
static bool IsSharp(float sharpness)
Definition crease.h:71
\n+\n+
All supported options applying to subdivision scheme.
Definition options.h:51
\n+\n+
CreasingMethod GetCreasingMethod() const
Get edge crease rule.
Definition options.h:101
\n+
VtxBoundaryInterpolation GetVtxBoundaryInterpolation() const
Get vertex boundary interpolation rule.
Definition options.h:89
\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-us-ascii\n+utf-8\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-catmarkScheme.h\n+crease.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,592 +23,289 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n-25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n+24#ifndef OPENSUBDIV3_SDC_CREASE_H\n+25#define OPENSUBDIV3_SDC_CREASE_H\n 26\n 27#include \"../version.h\"\n 28\n-29#include \"../sdc/scheme.h\"\n+29#include \"../sdc/options.h\"\n 30\n-31#include \n-32#include \n+31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+32namespace OPENSUBDIV_VERSION {\n 33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Sdc {\n-38\n-39//\n-40// Specializations for Scheme:\n-41//\n-42\n-43//\n-44// Catmark traits:\n-45//\n-46template <>\n-_\b4_\b7inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n-_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS; }\n-48\n-49template <>\n-_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n-51\n-52template <>\n-_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n-54\n-55template <>\n-_\b5_\b6inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 1; }\n-57\n-58\n-59//\n-60// Masks for edge-vertices: the hard Crease mask does not need to be\n-specialized\n-61// (simply the midpoint), so all that is left is the Smooth case:\n-62//\n-63// The Smooth mask is complicated by the need to support the \"triangle\n-subdivision\"\n-64// option, which applies different weighting in the presence of triangles. It\n-is\n-65// up for debate as to whether this is useful or not -- we may be able to\n-deprecate\n-66// this option.\n-67//\n-68template <>\n-69template \n-70inline void\n-_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be(EDGE const& edge, MASK& mask)\n-const {\n-72\n-73 typedef typename MASK::Weight Weight;\n-74\n-75 int faceCount = edge.GetNumFaces();\n-76\n-77 mask.SetNumVertexWeights(2);\n-78 mask.SetNumEdgeWeights(0);\n-79 mask.SetNumFaceWeights(faceCount);\n-80 mask.SetFaceWeightsForFaceCenters(true);\n-81\n-82 //\n-83 // Determine if we need to inspect incident faces and apply alternate\n-weighting for\n-84 // triangles -- and if so, determine which of the two are triangles.\n-85 //\n-86 bool face0IsTri = false;\n-87 bool face1IsTri = false;\n-88 bool useTriangleOption = (_options.GetTriangleSubdivision() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH);\n-89 if (useTriangleOption) {\n-90 if (faceCount == 2) {\n-91 //\n-92 // Ideally we want to avoid this inspection when we have already subdivided\n-at\n-93 // least once -- need something in the Edge interface to help avoid this,\n-e.g.\n-94 // an IsRegular() query, the subdivision level...\n-95 //\n-96 int vertsPerFace[2];\n-97 edge.GetNumVerticesPerFace(vertsPerFace);\n+34namespace Sdc {\n+35\n+61\n+_\b6_\b2class _\bC_\br_\be_\ba_\bs_\be {\n+63public:\n+65\n+_\b6_\b7 static float const _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; // = 0.0f, do we really need this?\n+_\b6_\b8 static float const _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE; // = 10.0f;\n+69\n+_\b7_\b0 static bool _\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(float sharpness) { return sharpness <=\n+_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; }\n+_\b7_\b1 static bool _\bI_\bs_\bS_\bh_\ba_\br_\bp(float sharpness) { return sharpness > _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH;\n+}\n+_\b7_\b2 static bool _\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be(float sharpness) { return sharpness >=\n+_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE; }\n+_\b7_\b3 static bool _\bI_\bs_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(float sharpness) { return (_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH <\n+sharpness) && (sharpness < _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE); }\n+75\n+_\b8_\b2 enum _\bR_\bu_\bl_\be {\n+_\b8_\b3 _\bR_\bU_\bL_\bE_\b__\bU_\bN_\bK_\bN_\bO_\bW_\bN = 0,\n+_\b8_\b4 _\bR_\bU_\bL_\bE_\b__\bS_\bM_\bO_\bO_\bT_\bH = (1 << 0),\n+_\b8_\b5 _\bR_\bU_\bL_\bE_\b__\bD_\bA_\bR_\bT = (1 << 1),\n+_\b8_\b6 _\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE = (1 << 2),\n+87 _\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR = (1 << 3)\n+_\b8_\b8 };\n+89\n+90public:\n+_\b9_\b1 _\bC_\br_\be_\ba_\bs_\be() : _options() { }\n+_\b9_\b2 _\bC_\br_\be_\ba_\bs_\be(_\bO_\bp_\bt_\bi_\bo_\bn_\bs const& options) : _options(options) { }\n+_\b9_\b3 _\b~_\bC_\br_\be_\ba_\bs_\be() { }\n+94\n+_\b9_\b5 bool _\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm() const { return _options._\bG_\be_\bt_\bC_\br_\be_\ba_\bs_\bi_\bn_\bg_\bM_\be_\bt_\bh_\bo_\bd() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bC_\bR_\bE_\bA_\bS_\bE_\b__\bU_\bN_\bI_\bF_\bO_\bR_\bM; }\n+96\n 98\n-99 face0IsTri = (vertsPerFace[0] == 3);\n-100 face1IsTri = (vertsPerFace[1] == 3);\n-101 useTriangleOption = face0IsTri || face1IsTri;\n-102 } else {\n-103 useTriangleOption = false;\n-104 }\n-105 }\n+104 float _\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be(float edgeSharpness) const;\n+105 float _\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx(float edgeSharpness) const;\n 106\n-107 if (! useTriangleOption) {\n-108 mask.VertexWeight(0) = 0.25f;\n-109 mask.VertexWeight(1) = 0.25f;\n-110\n-111 if (faceCount == 2) {\n-112 mask.FaceWeight(0) = 0.25f;\n-113 mask.FaceWeight(1) = 0.25f;\n-114 } else {\n-115 Weight fWeight = 0.5f / (Weight)faceCount;\n-116 for (int i = 0; i < faceCount; ++i) {\n-117 mask.FaceWeight(i) = fWeight;\n-118 }\n-119 }\n-120 } else {\n-121 //\n-122 // This mimics the implementation in Hbr in terms of order of operations.\n-123 //\n-124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;\n+107 // For future consideration\n+108 //float SharpenNonManifoldEdge(float edgeSharpness) const;\n+109 //float SharpenNonManifoldVertex(float edgeSharpness) const;\n+111\n+113\n+124 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexOrEdgeSharpness) const;\n 125\n-126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n-127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n-128\n-129 Weight fWeight = 0.5f * (f0Weight + f1Weight);\n-130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);\n+126 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexSharpness) const;\n+127\n+_\b1_\b2_\b8 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bA_\bt_\bV_\be_\br_\bt_\be_\bx(float edgeSharpness,\n+129 int incidentEdgeCountAtEndVertex,\n+130 float const* edgeSharpnessAroundEndVertex) const;\n 131\n-132 mask.VertexWeight(0) = vWeight;\n-133 mask.VertexWeight(1) = vWeight;\n-134\n-135 mask.FaceWeight(0) = fWeight;\n-136 mask.FaceWeight(1) = fWeight;\n-137 }\n-138}\n-139\n-140\n-141//\n-142// Masks for vertex-vertices: the hard Corner mask does not need to be\n-specialized\n-143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is\n-smooth):\n-144//\n-145template <>\n-146template \n-147inline void\n-_\b1_\b4_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n-MASK& mask,\n-149 int const creaseEnds[2]) const {\n-150 typedef typename MASK::Weight Weight;\n-151\n-152 int valence = vertex.GetNumEdges();\n-153\n-154 mask.SetNumVertexWeights(1);\n-155 mask.SetNumEdgeWeights(valence);\n-156 mask.SetNumFaceWeights(0);\n-157 mask.SetFaceWeightsForFaceCenters(false);\n-158\n-159 Weight vWeight = 0.75f;\n-160 Weight eWeight = 0.125f;\n-161\n-162 mask.VertexWeight(0) = vWeight;\n-163 for (int i = 0; i < valence; ++i) {\n-164 mask.EdgeWeight(i) = 0.0f;\n-165 }\n-166 mask.EdgeWeight(creaseEnds[0]) = eWeight;\n-167 mask.EdgeWeight(creaseEnds[1]) = eWeight;\n-168}\n-169\n-170template <>\n-171template \n-172inline void\n-_\b1_\b7_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n-MASK& mask) const {\n-174\n-175 typedef typename MASK::Weight Weight;\n+_\b1_\b3_\b2 void _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\be_\bs_\bA_\br_\bo_\bu_\bn_\bd_\bV_\be_\br_\bt_\be_\bx(int incidentEdgeCountAtVertex,\n+133 float const* incidentEdgeSharpnessAroundVertex,\n+134 float* childEdgesSharpnessAroundVertex) const;\n+136\n+138\n+_\b1_\b4_\b4 _\bR_\bu_\bl_\be _\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(float vertexSharpness,\n+145 int incidentEdgeCount,\n+146 float const* incidentEdgeSharpness) const;\n+_\b1_\b4_\b7 _\bR_\bu_\bl_\be _\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(float vertexSharpness,\n+148 int sharpEdgeCount) const;\n+150\n+_\b1_\b6_\b2 float _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn_\ba_\bl_\bW_\be_\bi_\bg_\bh_\bt_\bA_\bt_\bV_\be_\br_\bt_\be_\bx(float vertexSharpness,\n+163 float childVertexSharpness,\n+164 int incidentEdgeCount,\n+165 float const* incidentEdgeSharpness,\n+166 float const* childEdgesSharpness) const;\n+167\n+168 void _\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be(float const * incidentEdgeSharpness,\n+169 int incidentEdgeCount,\n+170 int sharpEdgePair[2]) const;\n+171\n+172 // Would these really help? Maybe only need Rules for the vertex-vertex\n+case...\n+173 //\n+174 // Rule DetermineEdgeVertexRule(float parentEdgeSharpness) const;\n+175 // Rule DetermineEdgeVertexRule(float childEdge1Sharpness, float\n+childEdge2Sharpness) const;\n 176\n-177 //\n-178 // A Smooth vertex must be manifold and interior -- manifold boundary\n-vertices will be\n-179 // Creases and non-manifold vertices of any kind will be Corners or\n-Creases. If smooth\n-180 // rules for non-manifold vertices are ever defined, this will need\n-adjusting:\n-181 //\n-182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());\n+177protected:\n+178 float _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness) const;\n+179\n+180private:\n+181 _\bO_\bp_\bt_\bi_\bo_\bn_\bs _options;\n+182};\n 183\n-184 int valence = vertex.GetNumFaces();\n-185\n-186 mask.SetNumVertexWeights(1);\n-187 mask.SetNumEdgeWeights(valence);\n-188 mask.SetNumFaceWeights(valence);\n-189 mask.SetFaceWeightsForFaceCenters(true);\n+184\n+185//\n+186// Inline declarations:\n+187//\n+188inline float\n+_\b1_\b8_\b9_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be(float /* edgeSharpness */) const {\n 190\n-191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;\n-192 Weight fWeight = 1.0f / (Weight)(valence * valence);\n-193 Weight eWeight = fWeight;\n-194\n-195 mask.VertexWeight(0) = vWeight;\n-196 for (int i = 0; i < valence; ++i) {\n-197 mask.EdgeWeight(i) = eWeight;\n-198 mask.FaceWeight(i) = fWeight;\n-199 }\n-200}\n+191 //\n+192 // Despite the presence of the BOUNDARY_NONE option, boundary edges are\n+always sharpened.\n+193 // Much of the code relies on sharpness to indicate boundaries to avoid the\n+more complex\n+194 // topological inspection\n+195 //\n+196 return _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE;\n+197}\n+198\n+199inline float\n+_\b2_\b0_\b0_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx(float vertexSharpness) const {\n 201\n-202//\n-203// Limit masks for position:\n-204//\n-205template <>\n-206template \n-207inline void\n-_\b2_\b0_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n-MASK& posMask) const {\n-209\n-210 posMask.SetNumVertexWeights(1);\n-211 posMask.SetNumEdgeWeights(0);\n-212 posMask.SetNumFaceWeights(0);\n-213 posMask.SetFaceWeightsForFaceCenters(false);\n+202 return (_options._\bG_\be_\bt_\bV_\bt_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bV_\bT_\bX_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY_\b__\bE_\bD_\bG_\bE_\b__\bA_\bN_\bD_\b__\bC_\bO_\bR_\bN_\bE_\bR) ?\n+203 _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE : vertexSharpness;\n+204}\n+205\n+206inline float\n+_\b2_\b0_\b7_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness) const {\n+208\n+209 if (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(sharpness)) return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; // redundant but\n+most common\n+210 if (_\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be(sharpness)) return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE;\n+211 if (sharpness > 1.0f) return (sharpness - 1.0f);\n+212 return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH;\n+213}\n 214\n-215 posMask.VertexWeight(0) = 1.0f;\n-216}\n+215inline float\n+_\b2_\b1_\b6_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexOrEdgeSharpness) const {\n 217\n-218template <>\n-219template \n-220inline void\n-_\b2_\b2_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask,\n-222 int const creaseEnds[2]) const {\n+218 return _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(vertexOrEdgeSharpness);\n+219}\n+220\n+221inline float\n+_\b2_\b2_\b2_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexSharpness) const {\n 223\n-224 typedef typename MASK::Weight Weight;\n-225\n-226 int valence = vertex.GetNumEdges();\n-227\n-228 posMask.SetNumVertexWeights(1);\n-229 posMask.SetNumEdgeWeights(valence);\n-230 posMask.SetNumFaceWeights(0);\n-231 posMask.SetFaceWeightsForFaceCenters(false);\n-232\n-233 Weight vWeight = (Weight)(2.0 / 3.0);\n-234 Weight eWeight = (Weight)(1.0 / 6.0);\n-235\n-236 posMask.VertexWeight(0) = vWeight;\n-237 for (int i = 0; i < valence; ++i) {\n-238 posMask.EdgeWeight(i) = 0.0f;\n-239 }\n-240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;\n-241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;\n-242}\n-243\n-244template <>\n-245template \n-246inline void\n-_\b2_\b4_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n-posMask) const {\n-248\n-249 typedef typename MASK::Weight Weight;\n-250\n-251 int valence = vertex.GetNumFaces();\n-252 if (valence == 2) {\n-253 assignCornerLimitMask(vertex, posMask);\n-254 return;\n-255 }\n-256\n-257 posMask.SetNumVertexWeights(1);\n-258 posMask.SetNumEdgeWeights(valence);\n-259 posMask.SetNumFaceWeights(valence);\n-260 posMask.SetFaceWeightsForFaceCenters(false);\n-261\n-262 // Specialize for the regular case:\n-263 if (valence == 4) {\n-264 Weight fWeight = (Weight)(1.0 / 36.0);\n-265 Weight eWeight = (Weight)(1.0 / 9.0);\n-266 Weight vWeight = (Weight)(4.0 / 9.0);\n-267\n-268 posMask.VertexWeight(0) = vWeight;\n-269\n-270 posMask.EdgeWeight(0) = eWeight;\n-271 posMask.EdgeWeight(1) = eWeight;\n-272 posMask.EdgeWeight(2) = eWeight;\n-273 posMask.EdgeWeight(3) = eWeight;\n-274\n-275 posMask.FaceWeight(0) = fWeight;\n-276 posMask.FaceWeight(1) = fWeight;\n-277 posMask.FaceWeight(2) = fWeight;\n-278 posMask.FaceWeight(3) = fWeight;\n-279 } else {\n-280 Weight Valence = (Weight) valence;\n-281\n-282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));\n-283 Weight eWeight = 4.0f * fWeight;\n-284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);\n-285\n-286 posMask.VertexWeight(0) = vWeight;\n-287 for (int i = 0; i < valence; ++i) {\n-288 posMask.EdgeWeight(i) = eWeight;\n-289 posMask.FaceWeight(i) = fWeight;\n-290 }\n-291 }\n-292}\n-293\n-294//\n-295// Limit masks for tangents -- these are stubs for now, or have a temporary\n-296// implementation\n-297//\n-298template <>\n-299template \n-300inline void\n-_\b3_\b0_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-302 MASK& tan1Mask, MASK& tan2Mask) const {\n-303\n-304 int valence = vertex.GetNumEdges();\n-305\n-306 tan1Mask.SetNumVertexWeights(1);\n-307 tan1Mask.SetNumEdgeWeights(valence);\n-308 tan1Mask.SetNumFaceWeights(0);\n-309 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-310\n-311 tan2Mask.SetNumVertexWeights(1);\n-312 tan2Mask.SetNumEdgeWeights(valence);\n-313 tan2Mask.SetNumFaceWeights(0);\n-314 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-315\n-316 // Should be at least 2 edges -- be sure to clear weights for any more:\n-317 tan1Mask.VertexWeight(0) = -1.0f;\n-318 tan1Mask.EdgeWeight(0) = 1.0f;\n-319 tan1Mask.EdgeWeight(1) = 0.0f;\n-320\n-321 tan2Mask.VertexWeight(0) = -1.0f;\n-322 tan2Mask.EdgeWeight(0) = 0.0f;\n-323 tan2Mask.EdgeWeight(1) = 1.0f;\n-324\n-325 for (int i = 2; i < valence; ++i) {\n-326 tan1Mask.EdgeWeight(i) = 0.0f;\n-327 tan2Mask.EdgeWeight(i) = 0.0f;\n-328 }\n-329}\n-330\n-331template <>\n-332template \n-333inline void\n-_\b3_\b3_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {\n-336\n-337 typedef typename MASK::Weight Weight;\n-338\n-339 //\n-340 // First, the tangent along the crease:\n-341 // The first crease edge is considered the \"leading\" edge of the span\n-342 // of surface for which we are evaluating tangents and the second edge the\n-343 // \"trailing edge\". By convention, the tangent along the crease is oriented\n-344 // in the direction of the leading edge.\n-345 //\n-346 int numEdges = vertex.GetNumEdges();\n-347 int numFaces = vertex.GetNumFaces();\n-348\n-349 tan1Mask.SetNumVertexWeights(1);\n-350 tan1Mask.SetNumEdgeWeights(numEdges);\n-351 tan1Mask.SetNumFaceWeights(numFaces);\n-352 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-353\n-354 tan1Mask.VertexWeight(0) = 0.0f;\n-355 for (int i = 0; i < numEdges; ++i) {\n-356 tan1Mask.EdgeWeight(i) = 0.0f;\n-357 }\n-358 for (int i = 0; i < numFaces; ++i) {\n-359 tan1Mask.FaceWeight(i) = 0.0f;\n-360 }\n-361\n-362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;\n-363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;\n-364\n-365 //\n-366 // Second, the tangent across the interior faces:\n-367 // Note this is ambiguous for an interior vertex. We currently return\n-368 // the tangent for the surface in the counter-clockwise span between the\n-369 // leading and trailing edges that form the crease. Given the expected\n-370 // computation of a surface normal as Tan1 X Tan2, this tangent should be\n-371 // oriented \"inward\" from the crease/boundary -- across the surface rather\n-372 // than outward and away from it.\n-373 //\n-374 tan2Mask.SetNumVertexWeights(1);\n-375 tan2Mask.SetNumEdgeWeights(numEdges);\n-376 tan2Mask.SetNumFaceWeights(numFaces);\n-377 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-378\n-379 // Prepend weights of 0 preceding the crease:\n-380 for (int i = 0; i < creaseEnds[0]; ++i) {\n-381 tan2Mask.EdgeWeight(i) = 0.0f;\n-382 tan2Mask.FaceWeight(i) = 0.0f;\n-383 }\n-384\n-385 // Assign weights to crease edge and interior points:\n-386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;\n-387 if (interiorEdgeCount == 1) {\n-388 // The regular case -- uniform B-spline cross-tangent:\n-389\n-390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);\n-391\n-392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);\n-393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);\n-394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);\n-395\n-396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);\n-397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);\n-398 } else if (interiorEdgeCount > 1) {\n-399 // The irregular case -- formulae from Biermann et al:\n-400\n-401 double k = (double) (interiorEdgeCount + 1);\n-402 double theta = M_PI / k;\n-403\n-404 double cosTheta = std::cos(theta);\n-405 double sinTheta = std::sin(theta);\n-406\n-407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):\n-408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));\n-409 double R = (cosTheta + 1.0f) / sinTheta;\n-410\n-411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);\n-412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);\n-413\n-414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);\n-415\n-416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);\n-417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);\n-418\n-419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);\n-420\n-421 double sinThetaI = 0.0f;\n-422 double sinThetaIplus1 = sinTheta;\n-423 for (int i = 1; i < k; ++i) {\n-424 sinThetaI = sinThetaIplus1;\n-425 sinThetaIplus1 = std::sin((i+1)*theta);\n-426\n-427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) *\n-commonDenom);\n-428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI +\n-sinThetaIplus1) * commonDenom);\n-429 }\n-430 } else {\n-431 // Special case for a single face -- simple average of boundary edges:\n-432\n-433 tan2Mask.VertexWeight(0) = -6.0f;\n-434\n-435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;\n-436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;\n-437\n-438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;\n-439 }\n-440\n-441 // Append weights of 0 following the crease:\n-442 for (int i = creaseEnds[1]; i < numFaces; ++i) {\n-443 tan2Mask.FaceWeight(i) = 0.0f;\n-444 }\n-445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {\n-446 tan2Mask.EdgeWeight(i) = 0.0f;\n-447 }\n-448}\n-449\n-450template <>\n-451template \n-452inline void\n-_\b4_\b5_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n-454 MASK& tan1Mask, MASK& tan2Mask) const {\n-455\n-456 typedef typename MASK::Weight Weight;\n-457\n-458 int valence = vertex.GetNumFaces();\n-459 if (valence == 2) {\n-460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n-461 return;\n-462 }\n-463\n-464 // Compute tan1 initially -- tan2 is simply a rotation:\n-465 tan1Mask.SetNumVertexWeights(1);\n-466 tan1Mask.SetNumEdgeWeights(valence);\n-467 tan1Mask.SetNumFaceWeights(valence);\n-468 tan1Mask.SetFaceWeightsForFaceCenters(false);\n-469\n-470 tan1Mask.VertexWeight(0) = 0.0f;\n-471\n-472 if (valence == 4) {\n-473 tan1Mask.EdgeWeight(0) = 4.0f;\n-474 tan1Mask.EdgeWeight(1) = 0.0f;\n-475 tan1Mask.EdgeWeight(2) = -4.0f;\n-476 tan1Mask.EdgeWeight(3) = 0.0f;\n-477\n-478 tan1Mask.FaceWeight(0) = 1.0f;\n-479 tan1Mask.FaceWeight(1) = -1.0f;\n-480 tan1Mask.FaceWeight(2) = -1.0f;\n-481 tan1Mask.FaceWeight(3) = 1.0f;\n-482 } else {\n-483 double theta = 2.0f * M_PI / (double)valence;\n-484\n-485 double cosTheta = std::cos(theta);\n-486 double cosHalfTheta = std::cos(theta * 0.5f);\n-487\n-488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *\n-489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));\n-490\n-491 double edgeWeightScale = 4.0f;\n-492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);\n-493\n-494 for (int i = 0; i < valence; ++i) {\n-495 double cosThetaI = std::cos( i * theta);\n-496 double cosThetaIplus1 = std::cos((i+1)* theta);\n-497\n-498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);\n-499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI +\n-cosThetaIplus1));\n-500 }\n-501 }\n-502\n-503 // Now rotate/copy tan1 weights to tan2:\n-504 tan2Mask.SetNumVertexWeights(1);\n-505 tan2Mask.SetNumEdgeWeights(valence);\n-506 tan2Mask.SetNumFaceWeights(valence);\n-507 tan2Mask.SetFaceWeightsForFaceCenters(false);\n-508\n-509 tan2Mask.VertexWeight(0) = 0.0f;\n-510 if (valence == 4) {\n-511 tan2Mask.EdgeWeight(0) = 0.0f;\n-512 tan2Mask.EdgeWeight(1) = 4.0f;\n-513 tan2Mask.EdgeWeight(2) = 0.0f;\n-514 tan2Mask.EdgeWeight(3) = -4.0f;\n-515\n-516 tan2Mask.FaceWeight(0) = 1.0f;\n-517 tan2Mask.FaceWeight(1) = 1.0f;\n-518 tan2Mask.FaceWeight(2) = -1.0f;\n-519 tan2Mask.FaceWeight(3) = -1.0f;\n-520 } else {\n-521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);\n-522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);\n-523 for (int i = 1; i < valence; ++i) {\n-524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);\n-525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);\n-526 }\n-527 }\n-528}\n-529\n-530} // end namespace sdc\n-531\n-532} // end namespace OPENSUBDIV_VERSION\n-533using namespace OPENSUBDIV_VERSION;\n-534} // end namespace OpenSubdiv\n-535\n-536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */\n+224 return _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(vertexSharpness);\n+225}\n+226\n+227inline void\n+_\b2_\b2_\b8_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be(float const * incidentEdgeSharpness, int\n+incidentEdgeCount,\n+229 int sharpEdgePair[2]) const {\n+230\n+231 // Only to be called when a crease is present at a vertex -- exactly two\n+sharp\n+232 // edges are expected here:\n+233 //\n+234 sharpEdgePair[0] = 0;\n+235 while (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(incidentEdgeSharpness[sharpEdgePair[0]])) ++ sharpEdgePair\n+[0];\n+236\n+237 sharpEdgePair[1] = incidentEdgeCount - 1;\n+238 while (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(incidentEdgeSharpness[sharpEdgePair[1]])) -- sharpEdgePair\n+[1];\n+239}\n+240\n+241} // end namespace sdc\n+242\n+243} // end namespace OPENSUBDIV_VERSION\n+244using namespace OPENSUBDIV_VERSION;\n+245} // end namespace OpenSubdiv\n+246\n+247#endif /* OPENSUBDIV3_SDC_CREASE_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bp_\bl_\bi_\bt\n-Split\n-Enumerated type for all face splitting schemes.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS\n-@ SPLIT_TO_QUADS\n-Used by Catmark and Bilinear.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH\n-@ TRI_SUB_SMOOTH\n-\"smooth triangle\" weights (Catmark scheme only)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be\n-void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be\n-static Split GetTopologicalSplitType()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n-void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const\n-creaseEnds[2]) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n-void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n-&tan2, int const creaseEnds[2]) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n-static int GetRegularFaceSize()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n-void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be\n-static int GetLocalNeighborhoodSize()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n-void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const\n-creaseEnds[2]) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n-void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n-static int GetRegularVertexValence()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n-void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n-&tan2) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n-void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n-void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n-&tan2) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n+Types, constants and utilities related to semi-sharp creasing \u00e2\u0080\u0093 whose\n+implementation is independent o...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float SubdivideVertexSharpness(float vertexSharpness) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b2_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be\n+static bool IsInfinite(float sharpness)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n+Rule\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR\n+@ RULE_CORNER\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bD_\bA_\bR_\bT\n+@ RULE_DART\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bS_\bM_\bO_\bO_\bT_\bH\n+@ RULE_SMOOTH\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n+@ RULE_CREASE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bU_\bN_\bK_\bN_\bO_\bW_\bN\n+@ RULE_UNKNOWN\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx\n+float SharpenBoundaryVertex(float edgeSharpness) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH\n+static float const SHARPNESS_SMOOTH\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be\n+void GetSharpEdgePairOfCrease(float const *incidentEdgeSharpness, int\n+incidentEdgeCount, int sharpEdgePair[2]) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b2_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE\n+static float const SHARPNESS_INFINITE\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n+Rule DetermineVertexVertexRule(float vertexSharpness, int incidentEdgeCount,\n+float const *incidentEdgeSharpness) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float decrementSharpness(float sharpness) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh\n+static bool IsSmooth(float sharpness)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n+Rule DetermineVertexVertexRule(float vertexSharpness, int sharpEdgeCount) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm\n+bool IsUniform() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n+static bool IsSemiSharp(float sharpness)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n+Crease(Options const &options)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:\n+_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\be_\bs_\bA_\br_\bo_\bu_\bn_\bd_\bV_\be_\br_\bt_\be_\bx\n+void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex, float\n+const *incidentEdgeSharpnessAroundVertex, float\n+*childEdgesSharpnessAroundVertex) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n+float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n+Crease()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n+float SharpenBoundaryEdge(float edgeSharpness) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b1_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn_\ba_\bl_\bW_\be_\bi_\bg_\bh_\bt_\bA_\bt_\bV_\be_\br_\bt_\be_\bx\n+float ComputeFractionalWeightAtVertex(float vertexSharpness, float\n+childVertexSharpness, int incidentEdgeCount, float const\n+*incidentEdgeSharpness, float const *childEdgesSharpness) const\n+Transitional weighting: When the rules applicable to a parent vertex and its\n+child differ,...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bA_\bt_\bV_\be_\br_\bt_\be_\bx\n+float SubdivideEdgeSharpnessAtVertex(float edgeSharpness, int\n+incidentEdgeCountAtEndVertex, float const *edgeSharpnessAroundEndVertex) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\bh_\ba_\br_\bp\n+static bool IsSharp(float sharpness)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\b~_\bC_\br_\be_\ba_\bs_\be\n+~Crease()\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+All supported options applying to subdivision scheme.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bC_\bR_\bE_\bA_\bS_\bE_\b__\bU_\bN_\bI_\bF_\bO_\bR_\bM\n+@ CREASE_UNIFORM\n+Catmark rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bC_\br_\be_\ba_\bs_\bi_\bn_\bg_\bM_\be_\bt_\bh_\bo_\bd\n+CreasingMethod GetCreasingMethod() const\n+Get edge crease rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b1_\b0_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bV_\bt_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n+VtxBoundaryInterpolation GetVtxBoundaryInterpolation() const\n+Get vertex boundary interpolation rule.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bV_\bT_\bX_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY_\b__\bE_\bD_\bG_\bE_\b__\bA_\bN_\bD_\b__\bC_\bO_\bR_\bN_\bE_\bR\n+@ VTX_BOUNDARY_EDGE_AND_CORNER\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b7\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n+ * _\bc_\br_\be_\ba_\bs_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00782.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00782.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/crease.h File Reference\n+OpenSubdiv: opensubdiv/sdc/catmarkScheme.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,38 @@\n \n \n \n \n \n
\n \n-
crease.h File Reference
\n+
catmarkScheme.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../sdc/options.h"
\n+#include "../sdc/scheme.h"
\n+#include <cassert>
\n+#include <cmath>
\n
\n

Go to the source code of this file.

\n \n-\n-\n-\n-\n-

\n-Classes

class  Crease
 Types, constants and utilities related to semi-sharp creasing – whose implementation is independent of the subdivision scheme. More...
 
\n \n \n \n \n \n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Sdc
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,22 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-crease.h File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+catmarkScheme.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bs_\bc_\bh_\be_\bm_\be_\b._\bh\"\n+#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\br_\be_\ba_\bs_\be\n-\u00a0 Types, constants and utilities related to semi-sharp creasing \u2013 whose\n- implementation is independent of the subdivision scheme. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\br_\be_\ba_\bs_\be_\b._\bh\n+ * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00782_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00782_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/sdc/crease.h Source File\n+OpenSubdiv: opensubdiv/sdc/catmarkScheme.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
crease.h
\n+
catmarkScheme.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2014 DreamWorks Animation LLC.
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -118,221 +118,566 @@\n
17//
\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n-
24#ifndef OPENSUBDIV3_SDC_CREASE_H
\n-
25#define OPENSUBDIV3_SDC_CREASE_H
\n+
24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n+
25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H
\n
26
\n
27#include "../version.h"
\n
28
\n-
29#include "../sdc/options.h"
\n+
29#include "../sdc/scheme.h"
\n
30
\n-
31namespace OpenSubdiv {
\n-
32namespace OPENSUBDIV_VERSION {
\n+
31#include <cassert>
\n+
32#include <cmath>
\n
33
\n-
34namespace Sdc {
\n-
35
\n-
61
\n-
\n-
62class Crease {
\n-
63public:
\n-
65
\n-
67 static float const SHARPNESS_SMOOTH; // = 0.0f, do we really need this?
\n-
68 static float const SHARPNESS_INFINITE; // = 10.0f;
\n-
69
\n-
70 static bool IsSmooth(float sharpness) { return sharpness <= SHARPNESS_SMOOTH; }
\n-
71 static bool IsSharp(float sharpness) { return sharpness > SHARPNESS_SMOOTH; }
\n-
72 static bool IsInfinite(float sharpness) { return sharpness >= SHARPNESS_INFINITE; }
\n-
73 static bool IsSemiSharp(float sharpness) { return (SHARPNESS_SMOOTH < sharpness) && (sharpness < SHARPNESS_INFINITE); }
\n-
75
\n-
\n-
82 enum Rule {
\n-\n-
84 RULE_SMOOTH = (1 << 0),
\n-
85 RULE_DART = (1 << 1),
\n-
86 RULE_CREASE = (1 << 2),
\n-
87 RULE_CORNER = (1 << 3)
\n-
88 };
\n-
\n-
89
\n-
90public:
\n-
91 Crease() : _options() { }
\n-
92 Crease(Options const& options) : _options(options) { }
\n-
93 ~Crease() { }
\n-
94
\n-
95 bool IsUniform() const { return _options.GetCreasingMethod() == Options::CREASE_UNIFORM; }
\n-
96
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Sdc {
\n+
38
\n+
39//
\n+
40// Specializations for Scheme<SCHEME_CATMARK>:
\n+
41//
\n+
42
\n+
43//
\n+
44// Catmark traits:
\n+
45//
\n+
46template <>
\n+\n+
48
\n+
49template <>
\n+\n+
51
\n+
52template <>
\n+\n+
54
\n+
55template <>
\n+\n+
57
\n+
58
\n+
59//
\n+
60// Masks for edge-vertices: the hard Crease mask does not need to be specialized
\n+
61// (simply the midpoint), so all that is left is the Smooth case:
\n+
62//
\n+
63// The Smooth mask is complicated by the need to support the "triangle subdivision"
\n+
64// option, which applies different weighting in the presence of triangles. It is
\n+
65// up for debate as to whether this is useful or not -- we may be able to deprecate
\n+
66// this option.
\n+
67//
\n+
68template <>
\n+
69template <typename EDGE, typename MASK>
\n+
70inline void
\n+
\n+
71Scheme<SCHEME_CATMARK>::assignSmoothMaskForEdge(EDGE const& edge, MASK& mask) const {
\n+
72
\n+
73 typedef typename MASK::Weight Weight;
\n+
74
\n+
75 int faceCount = edge.GetNumFaces();
\n+
76
\n+
77 mask.SetNumVertexWeights(2);
\n+
78 mask.SetNumEdgeWeights(0);
\n+
79 mask.SetNumFaceWeights(faceCount);
\n+
80 mask.SetFaceWeightsForFaceCenters(true);
\n+
81
\n+
82 //
\n+
83 // Determine if we need to inspect incident faces and apply alternate weighting for
\n+
84 // triangles -- and if so, determine which of the two are triangles.
\n+
85 //
\n+
86 bool face0IsTri = false;
\n+
87 bool face1IsTri = false;
\n+
88 bool useTriangleOption = (_options.GetTriangleSubdivision() == Options::TRI_SUB_SMOOTH);
\n+
89 if (useTriangleOption) {
\n+
90 if (faceCount == 2) {
\n+
91 //
\n+
92 // Ideally we want to avoid this inspection when we have already subdivided at
\n+
93 // least once -- need something in the Edge interface to help avoid this, e.g.
\n+
94 // an IsRegular() query, the subdivision level...
\n+
95 //
\n+
96 int vertsPerFace[2];
\n+
97 edge.GetNumVerticesPerFace(vertsPerFace);
\n
98
\n-
104 float SharpenBoundaryEdge(float edgeSharpness) const;
\n-
105 float SharpenBoundaryVertex(float edgeSharpness) const;
\n+
99 face0IsTri = (vertsPerFace[0] == 3);
\n+
100 face1IsTri = (vertsPerFace[1] == 3);
\n+
101 useTriangleOption = face0IsTri || face1IsTri;
\n+
102 } else {
\n+
103 useTriangleOption = false;
\n+
104 }
\n+
105 }
\n
106
\n-
107 // For future consideration
\n-
108 //float SharpenNonManifoldEdge(float edgeSharpness) const;
\n-
109 //float SharpenNonManifoldVertex(float edgeSharpness) const;
\n-
111
\n-
113
\n-
124 float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const;
\n+
107 if (! useTriangleOption) {
\n+
108 mask.VertexWeight(0) = 0.25f;
\n+
109 mask.VertexWeight(1) = 0.25f;
\n+
110
\n+
111 if (faceCount == 2) {
\n+
112 mask.FaceWeight(0) = 0.25f;
\n+
113 mask.FaceWeight(1) = 0.25f;
\n+
114 } else {
\n+
115 Weight fWeight = 0.5f / (Weight)faceCount;
\n+
116 for (int i = 0; i < faceCount; ++i) {
\n+
117 mask.FaceWeight(i) = fWeight;
\n+
118 }
\n+
119 }
\n+
120 } else {
\n+
121 //
\n+
122 // This mimics the implementation in Hbr in terms of order of operations.
\n+
123 //
\n+
124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;
\n
125
\n-
126 float SubdivideVertexSharpness(float vertexSharpness) const;
\n-
127
\n-
128 float SubdivideEdgeSharpnessAtVertex(float edgeSharpness,
\n-
129 int incidentEdgeCountAtEndVertex,
\n-
130 float const* edgeSharpnessAroundEndVertex) const;
\n+
126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n+
127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;
\n+
128
\n+
129 Weight fWeight = 0.5f * (f0Weight + f1Weight);
\n+
130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);
\n
131
\n-
132 void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex,
\n-
133 float const* incidentEdgeSharpnessAroundVertex,
\n-
134 float* childEdgesSharpnessAroundVertex) const;
\n-
136
\n-
138
\n-
144 Rule DetermineVertexVertexRule(float vertexSharpness,
\n-
145 int incidentEdgeCount,
\n-
146 float const* incidentEdgeSharpness) const;
\n-
147 Rule DetermineVertexVertexRule(float vertexSharpness,
\n-
148 int sharpEdgeCount) const;
\n-
150
\n-
162 float ComputeFractionalWeightAtVertex(float vertexSharpness,
\n-
163 float childVertexSharpness,
\n-
164 int incidentEdgeCount,
\n-
165 float const* incidentEdgeSharpness,
\n-
166 float const* childEdgesSharpness) const;
\n-
167
\n-
168 void GetSharpEdgePairOfCrease(float const * incidentEdgeSharpness,
\n-
169 int incidentEdgeCount,
\n-
170 int sharpEdgePair[2]) const;
\n-
171
\n-
172 // Would these really help? Maybe only need Rules for the vertex-vertex case...
\n-
173 //
\n-
174 // Rule DetermineEdgeVertexRule(float parentEdgeSharpness) const;
\n-
175 // Rule DetermineEdgeVertexRule(float childEdge1Sharpness, float childEdge2Sharpness) const;
\n+
132 mask.VertexWeight(0) = vWeight;
\n+
133 mask.VertexWeight(1) = vWeight;
\n+
134
\n+
135 mask.FaceWeight(0) = fWeight;
\n+
136 mask.FaceWeight(1) = fWeight;
\n+
137 }
\n+
138}
\n+
\n+
139
\n+
140
\n+
141//
\n+
142// Masks for vertex-vertices: the hard Corner mask does not need to be specialized
\n+
143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is smooth):
\n+
144//
\n+
145template <>
\n+
146template <typename VERTEX, typename MASK>
\n+
147inline void
\n+
\n+\n+
149 int const creaseEnds[2]) const {
\n+
150 typedef typename MASK::Weight Weight;
\n+
151
\n+
152 int valence = vertex.GetNumEdges();
\n+
153
\n+
154 mask.SetNumVertexWeights(1);
\n+
155 mask.SetNumEdgeWeights(valence);
\n+
156 mask.SetNumFaceWeights(0);
\n+
157 mask.SetFaceWeightsForFaceCenters(false);
\n+
158
\n+
159 Weight vWeight = 0.75f;
\n+
160 Weight eWeight = 0.125f;
\n+
161
\n+
162 mask.VertexWeight(0) = vWeight;
\n+
163 for (int i = 0; i < valence; ++i) {
\n+
164 mask.EdgeWeight(i) = 0.0f;
\n+
165 }
\n+
166 mask.EdgeWeight(creaseEnds[0]) = eWeight;
\n+
167 mask.EdgeWeight(creaseEnds[1]) = eWeight;
\n+
168}
\n+
\n+
169
\n+
170template <>
\n+
171template <typename VERTEX, typename MASK>
\n+
172inline void
\n+
\n+
173Scheme<SCHEME_CATMARK>::assignSmoothMaskForVertex(VERTEX const& vertex, MASK& mask) const {
\n+
174
\n+
175 typedef typename MASK::Weight Weight;
\n
176
\n-
177protected:
\n-
178 float decrementSharpness(float sharpness) const;
\n-
179
\n-
180private:
\n-
181 Options _options;
\n-
182};
\n-
\n+
177 //
\n+
178 // A Smooth vertex must be manifold and interior -- manifold boundary vertices will be
\n+
179 // Creases and non-manifold vertices of any kind will be Corners or Creases. If smooth
\n+
180 // rules for non-manifold vertices are ever defined, this will need adjusting:
\n+
181 //
\n+
182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());
\n
183
\n-
184
\n-
185//
\n-
186// Inline declarations:
\n-
187//
\n-
188inline float
\n-
\n-
189Crease::SharpenBoundaryEdge(float /* edgeSharpness */) const {
\n+
184 int valence = vertex.GetNumFaces();
\n+
185
\n+
186 mask.SetNumVertexWeights(1);
\n+
187 mask.SetNumEdgeWeights(valence);
\n+
188 mask.SetNumFaceWeights(valence);
\n+
189 mask.SetFaceWeightsForFaceCenters(true);
\n
190
\n-
191 //
\n-
192 // Despite the presence of the BOUNDARY_NONE option, boundary edges are always sharpened.
\n-
193 // Much of the code relies on sharpness to indicate boundaries to avoid the more complex
\n-
194 // topological inspection
\n-
195 //
\n-
196 return SHARPNESS_INFINITE;
\n-
197}
\n-
\n-
198
\n-
199inline float
\n-
\n-
200Crease::SharpenBoundaryVertex(float vertexSharpness) const {
\n-
201
\n-\n-
203 SHARPNESS_INFINITE : vertexSharpness;
\n-
204}
\n-
\n-
205
\n-
206inline float
\n-
\n-
207Crease::decrementSharpness(float sharpness) const {
\n-
208
\n-
209 if (IsSmooth(sharpness)) return Crease::SHARPNESS_SMOOTH; // redundant but most common
\n-
210 if (IsInfinite(sharpness)) return Crease::SHARPNESS_INFINITE;
\n-
211 if (sharpness > 1.0f) return (sharpness - 1.0f);
\n-\n-
213}
\n+
191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;
\n+
192 Weight fWeight = 1.0f / (Weight)(valence * valence);
\n+
193 Weight eWeight = fWeight;
\n+
194
\n+
195 mask.VertexWeight(0) = vWeight;
\n+
196 for (int i = 0; i < valence; ++i) {
\n+
197 mask.EdgeWeight(i) = eWeight;
\n+
198 mask.FaceWeight(i) = fWeight;
\n+
199 }
\n+
200}
\n
\n+
201
\n+
202//
\n+
203// Limit masks for position:
\n+
204//
\n+
205template <>
\n+
206template <typename VERTEX, typename MASK>
\n+
207inline void
\n+
\n+
208Scheme<SCHEME_CATMARK>::assignCornerLimitMask(VERTEX const& /* vertex */, MASK& posMask) const {
\n+
209
\n+
210 posMask.SetNumVertexWeights(1);
\n+
211 posMask.SetNumEdgeWeights(0);
\n+
212 posMask.SetNumFaceWeights(0);
\n+
213 posMask.SetFaceWeightsForFaceCenters(false);
\n
214
\n-
215inline float
\n-
\n-
216Crease::SubdivideUniformSharpness(float vertexOrEdgeSharpness) const {
\n-
217
\n-
218 return decrementSharpness(vertexOrEdgeSharpness);
\n-
219}
\n+
215 posMask.VertexWeight(0) = 1.0f;
\n+
216}
\n
\n-
220
\n-
221inline float
\n-
\n-
222Crease::SubdivideVertexSharpness(float vertexSharpness) const {
\n+
217
\n+
218template <>
\n+
219template <typename VERTEX, typename MASK>
\n+
220inline void
\n+
\n+
221Scheme<SCHEME_CATMARK>::assignCreaseLimitMask(VERTEX const& vertex, MASK& posMask,
\n+
222 int const creaseEnds[2]) const {
\n
223
\n-
224 return decrementSharpness(vertexSharpness);
\n-
225}
\n-
\n-
226
\n-
227inline void
\n-
\n-
228Crease::GetSharpEdgePairOfCrease(float const * incidentEdgeSharpness, int incidentEdgeCount,
\n-
229 int sharpEdgePair[2]) const {
\n-
230
\n-
231 // Only to be called when a crease is present at a vertex -- exactly two sharp
\n-
232 // edges are expected here:
\n-
233 //
\n-
234 sharpEdgePair[0] = 0;
\n-
235 while (IsSmooth(incidentEdgeSharpness[sharpEdgePair[0]])) ++ sharpEdgePair[0];
\n-
236
\n-
237 sharpEdgePair[1] = incidentEdgeCount - 1;
\n-
238 while (IsSmooth(incidentEdgeSharpness[sharpEdgePair[1]])) -- sharpEdgePair[1];
\n-
239}
\n-
\n-
240
\n-
241} // end namespace sdc
\n-
242
\n-
243} // end namespace OPENSUBDIV_VERSION
\n-
244using namespace OPENSUBDIV_VERSION;
\n-
245} // end namespace OpenSubdiv
\n-
246
\n-
247#endif /* OPENSUBDIV3_SDC_CREASE_H */
\n+
224 typedef typename MASK::Weight Weight;
\n+
225
\n+
226 int valence = vertex.GetNumEdges();
\n+
227
\n+
228 posMask.SetNumVertexWeights(1);
\n+
229 posMask.SetNumEdgeWeights(valence);
\n+
230 posMask.SetNumFaceWeights(0);
\n+
231 posMask.SetFaceWeightsForFaceCenters(false);
\n+
232
\n+
233 Weight vWeight = (Weight)(2.0 / 3.0);
\n+
234 Weight eWeight = (Weight)(1.0 / 6.0);
\n+
235
\n+
236 posMask.VertexWeight(0) = vWeight;
\n+
237 for (int i = 0; i < valence; ++i) {
\n+
238 posMask.EdgeWeight(i) = 0.0f;
\n+
239 }
\n+
240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;
\n+
241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;
\n+
242}
\n+
\n+
243
\n+
244template <>
\n+
245template <typename VERTEX, typename MASK>
\n+
246inline void
\n+
\n+
247Scheme<SCHEME_CATMARK>::assignSmoothLimitMask(VERTEX const& vertex, MASK& posMask) const {
\n+
248
\n+
249 typedef typename MASK::Weight Weight;
\n+
250
\n+
251 int valence = vertex.GetNumFaces();
\n+
252 if (valence == 2) {
\n+
253 assignCornerLimitMask(vertex, posMask);
\n+
254 return;
\n+
255 }
\n+
256
\n+
257 posMask.SetNumVertexWeights(1);
\n+
258 posMask.SetNumEdgeWeights(valence);
\n+
259 posMask.SetNumFaceWeights(valence);
\n+
260 posMask.SetFaceWeightsForFaceCenters(false);
\n+
261
\n+
262 // Specialize for the regular case:
\n+
263 if (valence == 4) {
\n+
264 Weight fWeight = (Weight)(1.0 / 36.0);
\n+
265 Weight eWeight = (Weight)(1.0 / 9.0);
\n+
266 Weight vWeight = (Weight)(4.0 / 9.0);
\n+
267
\n+
268 posMask.VertexWeight(0) = vWeight;
\n+
269
\n+
270 posMask.EdgeWeight(0) = eWeight;
\n+
271 posMask.EdgeWeight(1) = eWeight;
\n+
272 posMask.EdgeWeight(2) = eWeight;
\n+
273 posMask.EdgeWeight(3) = eWeight;
\n+
274
\n+
275 posMask.FaceWeight(0) = fWeight;
\n+
276 posMask.FaceWeight(1) = fWeight;
\n+
277 posMask.FaceWeight(2) = fWeight;
\n+
278 posMask.FaceWeight(3) = fWeight;
\n+
279 } else {
\n+
280 Weight Valence = (Weight) valence;
\n+
281
\n+
282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));
\n+
283 Weight eWeight = 4.0f * fWeight;
\n+
284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);
\n+
285
\n+
286 posMask.VertexWeight(0) = vWeight;
\n+
287 for (int i = 0; i < valence; ++i) {
\n+
288 posMask.EdgeWeight(i) = eWeight;
\n+
289 posMask.FaceWeight(i) = fWeight;
\n+
290 }
\n+
291 }
\n+
292}
\n+
\n+
293
\n+
294//
\n+
295// Limit masks for tangents -- these are stubs for now, or have a temporary
\n+
296// implementation
\n+
297//
\n+
298template <>
\n+
299template <typename VERTEX, typename MASK>
\n+
300inline void
\n+
\n+\n+
302 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
303
\n+
304 int valence = vertex.GetNumEdges();
\n+
305
\n+
306 tan1Mask.SetNumVertexWeights(1);
\n+
307 tan1Mask.SetNumEdgeWeights(valence);
\n+
308 tan1Mask.SetNumFaceWeights(0);
\n+
309 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
310
\n+
311 tan2Mask.SetNumVertexWeights(1);
\n+
312 tan2Mask.SetNumEdgeWeights(valence);
\n+
313 tan2Mask.SetNumFaceWeights(0);
\n+
314 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
315
\n+
316 // Should be at least 2 edges -- be sure to clear weights for any more:
\n+
317 tan1Mask.VertexWeight(0) = -1.0f;
\n+
318 tan1Mask.EdgeWeight(0) = 1.0f;
\n+
319 tan1Mask.EdgeWeight(1) = 0.0f;
\n+
320
\n+
321 tan2Mask.VertexWeight(0) = -1.0f;
\n+
322 tan2Mask.EdgeWeight(0) = 0.0f;
\n+
323 tan2Mask.EdgeWeight(1) = 1.0f;
\n+
324
\n+
325 for (int i = 2; i < valence; ++i) {
\n+
326 tan1Mask.EdgeWeight(i) = 0.0f;
\n+
327 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
328 }
\n+
329}
\n+
\n+
330
\n+
331template <>
\n+
332template <typename VERTEX, typename MASK>
\n+
333inline void
\n+
\n+\n+
335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {
\n+
336
\n+
337 typedef typename MASK::Weight Weight;
\n+
338
\n+
339 //
\n+
340 // First, the tangent along the crease:
\n+
341 // The first crease edge is considered the "leading" edge of the span
\n+
342 // of surface for which we are evaluating tangents and the second edge the
\n+
343 // "trailing edge". By convention, the tangent along the crease is oriented
\n+
344 // in the direction of the leading edge.
\n+
345 //
\n+
346 int numEdges = vertex.GetNumEdges();
\n+
347 int numFaces = vertex.GetNumFaces();
\n+
348
\n+
349 tan1Mask.SetNumVertexWeights(1);
\n+
350 tan1Mask.SetNumEdgeWeights(numEdges);
\n+
351 tan1Mask.SetNumFaceWeights(numFaces);
\n+
352 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
353
\n+
354 tan1Mask.VertexWeight(0) = 0.0f;
\n+
355 for (int i = 0; i < numEdges; ++i) {
\n+
356 tan1Mask.EdgeWeight(i) = 0.0f;
\n+
357 }
\n+
358 for (int i = 0; i < numFaces; ++i) {
\n+
359 tan1Mask.FaceWeight(i) = 0.0f;
\n+
360 }
\n+
361
\n+
362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;
\n+
363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;
\n+
364
\n+
365 //
\n+
366 // Second, the tangent across the interior faces:
\n+
367 // Note this is ambiguous for an interior vertex. We currently return
\n+
368 // the tangent for the surface in the counter-clockwise span between the
\n+
369 // leading and trailing edges that form the crease. Given the expected
\n+
370 // computation of a surface normal as Tan1 X Tan2, this tangent should be
\n+
371 // oriented "inward" from the crease/boundary -- across the surface rather
\n+
372 // than outward and away from it.
\n+
373 //
\n+
374 tan2Mask.SetNumVertexWeights(1);
\n+
375 tan2Mask.SetNumEdgeWeights(numEdges);
\n+
376 tan2Mask.SetNumFaceWeights(numFaces);
\n+
377 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
378
\n+
379 // Prepend weights of 0 preceding the crease:
\n+
380 for (int i = 0; i < creaseEnds[0]; ++i) {
\n+
381 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
382 tan2Mask.FaceWeight(i) = 0.0f;
\n+
383 }
\n+
384
\n+
385 // Assign weights to crease edge and interior points:
\n+
386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;
\n+
387 if (interiorEdgeCount == 1) {
\n+
388 // The regular case -- uniform B-spline cross-tangent:
\n+
389
\n+
390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);
\n+
391
\n+
392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);
\n+
393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);
\n+
394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);
\n+
395
\n+
396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);
\n+
397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);
\n+
398 } else if (interiorEdgeCount > 1) {
\n+
399 // The irregular case -- formulae from Biermann et al:
\n+
400
\n+
401 double k = (double) (interiorEdgeCount + 1);
\n+
402 double theta = M_PI / k;
\n+
403
\n+
404 double cosTheta = std::cos(theta);
\n+
405 double sinTheta = std::sin(theta);
\n+
406
\n+
407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):
\n+
408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));
\n+
409 double R = (cosTheta + 1.0f) / sinTheta;
\n+
410
\n+
411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);
\n+
412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);
\n+
413
\n+
414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);
\n+
415
\n+
416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);
\n+
417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);
\n+
418
\n+
419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);
\n+
420
\n+
421 double sinThetaI = 0.0f;
\n+
422 double sinThetaIplus1 = sinTheta;
\n+
423 for (int i = 1; i < k; ++i) {
\n+
424 sinThetaI = sinThetaIplus1;
\n+
425 sinThetaIplus1 = std::sin((i+1)*theta);
\n+
426
\n+
427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) * commonDenom);
\n+
428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI + sinThetaIplus1) * commonDenom);
\n+
429 }
\n+
430 } else {
\n+
431 // Special case for a single face -- simple average of boundary edges:
\n+
432
\n+
433 tan2Mask.VertexWeight(0) = -6.0f;
\n+
434
\n+
435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;
\n+
436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;
\n+
437
\n+
438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;
\n+
439 }
\n+
440
\n+
441 // Append weights of 0 following the crease:
\n+
442 for (int i = creaseEnds[1]; i < numFaces; ++i) {
\n+
443 tan2Mask.FaceWeight(i) = 0.0f;
\n+
444 }
\n+
445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {
\n+
446 tan2Mask.EdgeWeight(i) = 0.0f;
\n+
447 }
\n+
448}
\n+
\n+
449
\n+
450template <>
\n+
451template <typename VERTEX, typename MASK>
\n+
452inline void
\n+
\n+\n+
454 MASK& tan1Mask, MASK& tan2Mask) const {
\n+
455
\n+
456 typedef typename MASK::Weight Weight;
\n+
457
\n+
458 int valence = vertex.GetNumFaces();
\n+
459 if (valence == 2) {
\n+
460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);
\n+
461 return;
\n+
462 }
\n+
463
\n+
464 // Compute tan1 initially -- tan2 is simply a rotation:
\n+
465 tan1Mask.SetNumVertexWeights(1);
\n+
466 tan1Mask.SetNumEdgeWeights(valence);
\n+
467 tan1Mask.SetNumFaceWeights(valence);
\n+
468 tan1Mask.SetFaceWeightsForFaceCenters(false);
\n+
469
\n+
470 tan1Mask.VertexWeight(0) = 0.0f;
\n+
471
\n+
472 if (valence == 4) {
\n+
473 tan1Mask.EdgeWeight(0) = 4.0f;
\n+
474 tan1Mask.EdgeWeight(1) = 0.0f;
\n+
475 tan1Mask.EdgeWeight(2) = -4.0f;
\n+
476 tan1Mask.EdgeWeight(3) = 0.0f;
\n+
477
\n+
478 tan1Mask.FaceWeight(0) = 1.0f;
\n+
479 tan1Mask.FaceWeight(1) = -1.0f;
\n+
480 tan1Mask.FaceWeight(2) = -1.0f;
\n+
481 tan1Mask.FaceWeight(3) = 1.0f;
\n+
482 } else {
\n+
483 double theta = 2.0f * M_PI / (double)valence;
\n+
484
\n+
485 double cosTheta = std::cos(theta);
\n+
486 double cosHalfTheta = std::cos(theta * 0.5f);
\n+
487
\n+
488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *
\n+
489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));
\n+
490
\n+
491 double edgeWeightScale = 4.0f;
\n+
492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);
\n+
493
\n+
494 for (int i = 0; i < valence; ++i) {
\n+
495 double cosThetaI = std::cos( i * theta);
\n+
496 double cosThetaIplus1 = std::cos((i+1)* theta);
\n+
497
\n+
498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);
\n+
499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI + cosThetaIplus1));
\n+
500 }
\n+
501 }
\n+
502
\n+
503 // Now rotate/copy tan1 weights to tan2:
\n+
504 tan2Mask.SetNumVertexWeights(1);
\n+
505 tan2Mask.SetNumEdgeWeights(valence);
\n+
506 tan2Mask.SetNumFaceWeights(valence);
\n+
507 tan2Mask.SetFaceWeightsForFaceCenters(false);
\n+
508
\n+
509 tan2Mask.VertexWeight(0) = 0.0f;
\n+
510 if (valence == 4) {
\n+
511 tan2Mask.EdgeWeight(0) = 0.0f;
\n+
512 tan2Mask.EdgeWeight(1) = 4.0f;
\n+
513 tan2Mask.EdgeWeight(2) = 0.0f;
\n+
514 tan2Mask.EdgeWeight(3) = -4.0f;
\n+
515
\n+
516 tan2Mask.FaceWeight(0) = 1.0f;
\n+
517 tan2Mask.FaceWeight(1) = 1.0f;
\n+
518 tan2Mask.FaceWeight(2) = -1.0f;
\n+
519 tan2Mask.FaceWeight(3) = -1.0f;
\n+
520 } else {
\n+
521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);
\n+
522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);
\n+
523 for (int i = 1; i < valence; ++i) {
\n+
524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);
\n+
525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);
\n+
526 }
\n+
527 }
\n+
528}
\n+
\n+
529
\n+
530} // end namespace sdc
\n+
531
\n+
532} // end namespace OPENSUBDIV_VERSION
\n+
533using namespace OPENSUBDIV_VERSION;
\n+
534} // end namespace OpenSubdiv
\n+
535
\n+
536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */
\n \n-
Types, constants and utilities related to semi-sharp creasing \u2013 whose implementation is independent o...
Definition crease.h:62
\n-
float SubdivideVertexSharpness(float vertexSharpness) const
Definition crease.h:222
\n-
static bool IsInfinite(float sharpness)
Definition crease.h:72
\n-\n-\n-\n-\n-\n-\n-
float SharpenBoundaryVertex(float edgeSharpness) const
Definition crease.h:200
\n-\n-
void GetSharpEdgePairOfCrease(float const *incidentEdgeSharpness, int incidentEdgeCount, int sharpEdgePair[2]) const
Definition crease.h:228
\n-\n-
Rule DetermineVertexVertexRule(float vertexSharpness, int incidentEdgeCount, float const *incidentEdgeSharpness) const
\n-
float decrementSharpness(float sharpness) const
Definition crease.h:207
\n-
static bool IsSmooth(float sharpness)
Definition crease.h:70
\n-
Rule DetermineVertexVertexRule(float vertexSharpness, int sharpEdgeCount) const
\n-\n-
static bool IsSemiSharp(float sharpness)
Definition crease.h:73
\n-\n-
void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex, float const *incidentEdgeSharpnessAroundVertex, float *childEdgesSharpnessAroundVertex) const
\n-
float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const
Definition crease.h:216
\n-\n-
float SharpenBoundaryEdge(float edgeSharpness) const
Definition crease.h:189
\n-
float ComputeFractionalWeightAtVertex(float vertexSharpness, float childVertexSharpness, int incidentEdgeCount, float const *incidentEdgeSharpness, float const *childEdgesSharpness) const
Transitional weighting: When the rules applicable to a parent vertex and its child differ,...
\n-
float SubdivideEdgeSharpnessAtVertex(float edgeSharpness, int incidentEdgeCountAtEndVertex, float const *edgeSharpnessAroundEndVertex) const
\n-
static bool IsSharp(float sharpness)
Definition crease.h:71
\n-\n-
All supported options applying to subdivision scheme.
Definition options.h:51
\n-\n-
CreasingMethod GetCreasingMethod() const
Get edge crease rule.
Definition options.h:101
\n-
VtxBoundaryInterpolation GetVtxBoundaryInterpolation() const
Get vertex boundary interpolation rule.
Definition options.h:89
\n-\n+
Split
Enumerated type for all face splitting schemes.
Definition types.h:47
\n+
@ SPLIT_TO_QUADS
Used by Catmark and Bilinear.
Definition types.h:48
\n+
@ TRI_SUB_SMOOTH
"smooth triangle" weights (Catmark scheme only)
Definition options.h:74
\n+
void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const
\n+\n+
void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const creaseEnds[2]) const
\n+
void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2, int const creaseEnds[2]) const
\n+\n+
void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const
\n+\n+
void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const creaseEnds[2]) const
\n+
void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const
\n+\n+
void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n+
void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const
\n+
void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2) const
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "encoding", "source2": "encoding", "unified_diff": "@@ -1 +1 @@\n-utf-8\n+us-ascii\n"}, {"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-crease.h\n+catmarkScheme.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2014 DreamWorks Animation LLC.\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -23,289 +23,592 @@\n 17//\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n-24#ifndef OPENSUBDIV3_SDC_CREASE_H\n-25#define OPENSUBDIV3_SDC_CREASE_H\n+24#ifndef OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n+25#define OPENSUBDIV3_SDC_CATMARK_SCHEME_H\n 26\n 27#include \"../version.h\"\n 28\n-29#include \"../sdc/options.h\"\n+29#include \"../sdc/scheme.h\"\n 30\n-31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-32namespace OPENSUBDIV_VERSION {\n+31#include \n+32#include \n 33\n-34namespace Sdc {\n-35\n-61\n-_\b6_\b2class _\bC_\br_\be_\ba_\bs_\be {\n-63public:\n-65\n-_\b6_\b7 static float const _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; // = 0.0f, do we really need this?\n-_\b6_\b8 static float const _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE; // = 10.0f;\n-69\n-_\b7_\b0 static bool _\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(float sharpness) { return sharpness <=\n-_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; }\n-_\b7_\b1 static bool _\bI_\bs_\bS_\bh_\ba_\br_\bp(float sharpness) { return sharpness > _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH;\n-}\n-_\b7_\b2 static bool _\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be(float sharpness) { return sharpness >=\n-_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE; }\n-_\b7_\b3 static bool _\bI_\bs_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp(float sharpness) { return (_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH <\n-sharpness) && (sharpness < _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE); }\n-75\n-_\b8_\b2 enum _\bR_\bu_\bl_\be {\n-_\b8_\b3 _\bR_\bU_\bL_\bE_\b__\bU_\bN_\bK_\bN_\bO_\bW_\bN = 0,\n-_\b8_\b4 _\bR_\bU_\bL_\bE_\b__\bS_\bM_\bO_\bO_\bT_\bH = (1 << 0),\n-_\b8_\b5 _\bR_\bU_\bL_\bE_\b__\bD_\bA_\bR_\bT = (1 << 1),\n-_\b8_\b6 _\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE = (1 << 2),\n-87 _\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR = (1 << 3)\n-_\b8_\b8 };\n-89\n-90public:\n-_\b9_\b1 _\bC_\br_\be_\ba_\bs_\be() : _options() { }\n-_\b9_\b2 _\bC_\br_\be_\ba_\bs_\be(_\bO_\bp_\bt_\bi_\bo_\bn_\bs const& options) : _options(options) { }\n-_\b9_\b3 _\b~_\bC_\br_\be_\ba_\bs_\be() { }\n-94\n-_\b9_\b5 bool _\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm() const { return _options._\bG_\be_\bt_\bC_\br_\be_\ba_\bs_\bi_\bn_\bg_\bM_\be_\bt_\bh_\bo_\bd() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bC_\bR_\bE_\bA_\bS_\bE_\b__\bU_\bN_\bI_\bF_\bO_\bR_\bM; }\n-96\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Sdc {\n+38\n+39//\n+40// Specializations for Scheme:\n+41//\n+42\n+43//\n+44// Catmark traits:\n+45//\n+46template <>\n+_\b4_\b7inline _\bS_\bp_\bl_\bi_\bt _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be() { return\n+_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS; }\n+48\n+49template <>\n+_\b5_\b0inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be() { return 4; }\n+51\n+52template <>\n+_\b5_\b3inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be() { return 4; }\n+54\n+55template <>\n+_\b5_\b6inline int _\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be() { return 1; }\n+57\n+58\n+59//\n+60// Masks for edge-vertices: the hard Crease mask does not need to be\n+specialized\n+61// (simply the midpoint), so all that is left is the Smooth case:\n+62//\n+63// The Smooth mask is complicated by the need to support the \"triangle\n+subdivision\"\n+64// option, which applies different weighting in the presence of triangles. It\n+is\n+65// up for debate as to whether this is useful or not -- we may be able to\n+deprecate\n+66// this option.\n+67//\n+68template <>\n+69template \n+70inline void\n+_\b7_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be(EDGE const& edge, MASK& mask)\n+const {\n+72\n+73 typedef typename MASK::Weight Weight;\n+74\n+75 int faceCount = edge.GetNumFaces();\n+76\n+77 mask.SetNumVertexWeights(2);\n+78 mask.SetNumEdgeWeights(0);\n+79 mask.SetNumFaceWeights(faceCount);\n+80 mask.SetFaceWeightsForFaceCenters(true);\n+81\n+82 //\n+83 // Determine if we need to inspect incident faces and apply alternate\n+weighting for\n+84 // triangles -- and if so, determine which of the two are triangles.\n+85 //\n+86 bool face0IsTri = false;\n+87 bool face1IsTri = false;\n+88 bool useTriangleOption = (_options.GetTriangleSubdivision() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n+_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH);\n+89 if (useTriangleOption) {\n+90 if (faceCount == 2) {\n+91 //\n+92 // Ideally we want to avoid this inspection when we have already subdivided\n+at\n+93 // least once -- need something in the Edge interface to help avoid this,\n+e.g.\n+94 // an IsRegular() query, the subdivision level...\n+95 //\n+96 int vertsPerFace[2];\n+97 edge.GetNumVerticesPerFace(vertsPerFace);\n 98\n-104 float _\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be(float edgeSharpness) const;\n-105 float _\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx(float edgeSharpness) const;\n+99 face0IsTri = (vertsPerFace[0] == 3);\n+100 face1IsTri = (vertsPerFace[1] == 3);\n+101 useTriangleOption = face0IsTri || face1IsTri;\n+102 } else {\n+103 useTriangleOption = false;\n+104 }\n+105 }\n 106\n-107 // For future consideration\n-108 //float SharpenNonManifoldEdge(float edgeSharpness) const;\n-109 //float SharpenNonManifoldVertex(float edgeSharpness) const;\n-111\n-113\n-124 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexOrEdgeSharpness) const;\n+107 if (! useTriangleOption) {\n+108 mask.VertexWeight(0) = 0.25f;\n+109 mask.VertexWeight(1) = 0.25f;\n+110\n+111 if (faceCount == 2) {\n+112 mask.FaceWeight(0) = 0.25f;\n+113 mask.FaceWeight(1) = 0.25f;\n+114 } else {\n+115 Weight fWeight = 0.5f / (Weight)faceCount;\n+116 for (int i = 0; i < faceCount; ++i) {\n+117 mask.FaceWeight(i) = fWeight;\n+118 }\n+119 }\n+120 } else {\n+121 //\n+122 // This mimics the implementation in Hbr in terms of order of operations.\n+123 //\n+124 const Weight CATMARK_SMOOTH_TRI_EDGE_WEIGHT = (Weight) 0.470;\n 125\n-126 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexSharpness) const;\n-127\n-_\b1_\b2_\b8 float _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bA_\bt_\bV_\be_\br_\bt_\be_\bx(float edgeSharpness,\n-129 int incidentEdgeCountAtEndVertex,\n-130 float const* edgeSharpnessAroundEndVertex) const;\n+126 Weight f0Weight = face0IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n+127 Weight f1Weight = face1IsTri ? CATMARK_SMOOTH_TRI_EDGE_WEIGHT : 0.25f;\n+128\n+129 Weight fWeight = 0.5f * (f0Weight + f1Weight);\n+130 Weight vWeight = 0.5f * (1.0f - 2.0f * fWeight);\n 131\n-_\b1_\b3_\b2 void _\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\be_\bs_\bA_\br_\bo_\bu_\bn_\bd_\bV_\be_\br_\bt_\be_\bx(int incidentEdgeCountAtVertex,\n-133 float const* incidentEdgeSharpnessAroundVertex,\n-134 float* childEdgesSharpnessAroundVertex) const;\n-136\n-138\n-_\b1_\b4_\b4 _\bR_\bu_\bl_\be _\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(float vertexSharpness,\n-145 int incidentEdgeCount,\n-146 float const* incidentEdgeSharpness) const;\n-_\b1_\b4_\b7 _\bR_\bu_\bl_\be _\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be(float vertexSharpness,\n-148 int sharpEdgeCount) const;\n-150\n-_\b1_\b6_\b2 float _\bC_\bo_\bm_\bp_\bu_\bt_\be_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn_\ba_\bl_\bW_\be_\bi_\bg_\bh_\bt_\bA_\bt_\bV_\be_\br_\bt_\be_\bx(float vertexSharpness,\n-163 float childVertexSharpness,\n-164 int incidentEdgeCount,\n-165 float const* incidentEdgeSharpness,\n-166 float const* childEdgesSharpness) const;\n-167\n-168 void _\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be(float const * incidentEdgeSharpness,\n-169 int incidentEdgeCount,\n-170 int sharpEdgePair[2]) const;\n-171\n-172 // Would these really help? Maybe only need Rules for the vertex-vertex\n-case...\n-173 //\n-174 // Rule DetermineEdgeVertexRule(float parentEdgeSharpness) const;\n-175 // Rule DetermineEdgeVertexRule(float childEdge1Sharpness, float\n-childEdge2Sharpness) const;\n+132 mask.VertexWeight(0) = vWeight;\n+133 mask.VertexWeight(1) = vWeight;\n+134\n+135 mask.FaceWeight(0) = fWeight;\n+136 mask.FaceWeight(1) = fWeight;\n+137 }\n+138}\n+139\n+140\n+141//\n+142// Masks for vertex-vertices: the hard Corner mask does not need to be\n+specialized\n+143// (simply the vertex itself), leaving the Crease and Smooth cases (Dart is\n+smooth):\n+144//\n+145template <>\n+146template \n+147inline void\n+_\b1_\b4_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n+MASK& mask,\n+149 int const creaseEnds[2]) const {\n+150 typedef typename MASK::Weight Weight;\n+151\n+152 int valence = vertex.GetNumEdges();\n+153\n+154 mask.SetNumVertexWeights(1);\n+155 mask.SetNumEdgeWeights(valence);\n+156 mask.SetNumFaceWeights(0);\n+157 mask.SetFaceWeightsForFaceCenters(false);\n+158\n+159 Weight vWeight = 0.75f;\n+160 Weight eWeight = 0.125f;\n+161\n+162 mask.VertexWeight(0) = vWeight;\n+163 for (int i = 0; i < valence; ++i) {\n+164 mask.EdgeWeight(i) = 0.0f;\n+165 }\n+166 mask.EdgeWeight(creaseEnds[0]) = eWeight;\n+167 mask.EdgeWeight(creaseEnds[1]) = eWeight;\n+168}\n+169\n+170template <>\n+171template \n+172inline void\n+_\b1_\b7_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx(VERTEX const& vertex,\n+MASK& mask) const {\n+174\n+175 typedef typename MASK::Weight Weight;\n 176\n-177protected:\n-178 float _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness) const;\n-179\n-180private:\n-181 _\bO_\bp_\bt_\bi_\bo_\bn_\bs _options;\n-182};\n+177 //\n+178 // A Smooth vertex must be manifold and interior -- manifold boundary\n+vertices will be\n+179 // Creases and non-manifold vertices of any kind will be Corners or\n+Creases. If smooth\n+180 // rules for non-manifold vertices are ever defined, this will need\n+adjusting:\n+181 //\n+182 assert(vertex.GetNumFaces() == vertex.GetNumEdges());\n 183\n-184\n-185//\n-186// Inline declarations:\n-187//\n-188inline float\n-_\b1_\b8_\b9_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be(float /* edgeSharpness */) const {\n+184 int valence = vertex.GetNumFaces();\n+185\n+186 mask.SetNumVertexWeights(1);\n+187 mask.SetNumEdgeWeights(valence);\n+188 mask.SetNumFaceWeights(valence);\n+189 mask.SetFaceWeightsForFaceCenters(true);\n 190\n-191 //\n-192 // Despite the presence of the BOUNDARY_NONE option, boundary edges are\n-always sharpened.\n-193 // Much of the code relies on sharpness to indicate boundaries to avoid the\n-more complex\n-194 // topological inspection\n-195 //\n-196 return _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE;\n-197}\n-198\n-199inline float\n-_\b2_\b0_\b0_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx(float vertexSharpness) const {\n+191 Weight vWeight = (Weight)(valence - 2) / (Weight)valence;\n+192 Weight fWeight = 1.0f / (Weight)(valence * valence);\n+193 Weight eWeight = fWeight;\n+194\n+195 mask.VertexWeight(0) = vWeight;\n+196 for (int i = 0; i < valence; ++i) {\n+197 mask.EdgeWeight(i) = eWeight;\n+198 mask.FaceWeight(i) = fWeight;\n+199 }\n+200}\n 201\n-202 return (_options._\bG_\be_\bt_\bV_\bt_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn() == _\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:\n-_\bV_\bT_\bX_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY_\b__\bE_\bD_\bG_\bE_\b__\bA_\bN_\bD_\b__\bC_\bO_\bR_\bN_\bE_\bR) ?\n-203 _\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE : vertexSharpness;\n-204}\n-205\n-206inline float\n-_\b2_\b0_\b7_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float sharpness) const {\n-208\n-209 if (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(sharpness)) return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH; // redundant but\n-most common\n-210 if (_\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be(sharpness)) return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE;\n-211 if (sharpness > 1.0f) return (sharpness - 1.0f);\n-212 return _\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH;\n-213}\n+202//\n+203// Limit masks for position:\n+204//\n+205template <>\n+206template \n+207inline void\n+_\b2_\b0_\b8_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& /* vertex */,\n+MASK& posMask) const {\n+209\n+210 posMask.SetNumVertexWeights(1);\n+211 posMask.SetNumEdgeWeights(0);\n+212 posMask.SetNumFaceWeights(0);\n+213 posMask.SetFaceWeightsForFaceCenters(false);\n 214\n-215inline float\n-_\b2_\b1_\b6_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexOrEdgeSharpness) const {\n+215 posMask.VertexWeight(0) = 1.0f;\n+216}\n 217\n-218 return _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(vertexOrEdgeSharpness);\n-219}\n-220\n-221inline float\n-_\b2_\b2_\b2_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(float vertexSharpness) const {\n+218template <>\n+219template \n+220inline void\n+_\b2_\b2_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask,\n+222 int const creaseEnds[2]) const {\n 223\n-224 return _\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs(vertexSharpness);\n-225}\n-226\n-227inline void\n-_\b2_\b2_\b8_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be(float const * incidentEdgeSharpness, int\n-incidentEdgeCount,\n-229 int sharpEdgePair[2]) const {\n-230\n-231 // Only to be called when a crease is present at a vertex -- exactly two\n-sharp\n-232 // edges are expected here:\n-233 //\n-234 sharpEdgePair[0] = 0;\n-235 while (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(incidentEdgeSharpness[sharpEdgePair[0]])) ++ sharpEdgePair\n-[0];\n-236\n-237 sharpEdgePair[1] = incidentEdgeCount - 1;\n-238 while (_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh(incidentEdgeSharpness[sharpEdgePair[1]])) -- sharpEdgePair\n-[1];\n-239}\n-240\n-241} // end namespace sdc\n-242\n-243} // end namespace OPENSUBDIV_VERSION\n-244using namespace OPENSUBDIV_VERSION;\n-245} // end namespace OpenSubdiv\n-246\n-247#endif /* OPENSUBDIV3_SDC_CREASE_H */\n+224 typedef typename MASK::Weight Weight;\n+225\n+226 int valence = vertex.GetNumEdges();\n+227\n+228 posMask.SetNumVertexWeights(1);\n+229 posMask.SetNumEdgeWeights(valence);\n+230 posMask.SetNumFaceWeights(0);\n+231 posMask.SetFaceWeightsForFaceCenters(false);\n+232\n+233 Weight vWeight = (Weight)(2.0 / 3.0);\n+234 Weight eWeight = (Weight)(1.0 / 6.0);\n+235\n+236 posMask.VertexWeight(0) = vWeight;\n+237 for (int i = 0; i < valence; ++i) {\n+238 posMask.EdgeWeight(i) = 0.0f;\n+239 }\n+240 posMask.EdgeWeight(creaseEnds[0]) = eWeight;\n+241 posMask.EdgeWeight(creaseEnds[1]) = eWeight;\n+242}\n+243\n+244template <>\n+245template \n+246inline void\n+_\b2_\b4_\b7_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk(VERTEX const& vertex, MASK&\n+posMask) const {\n+248\n+249 typedef typename MASK::Weight Weight;\n+250\n+251 int valence = vertex.GetNumFaces();\n+252 if (valence == 2) {\n+253 assignCornerLimitMask(vertex, posMask);\n+254 return;\n+255 }\n+256\n+257 posMask.SetNumVertexWeights(1);\n+258 posMask.SetNumEdgeWeights(valence);\n+259 posMask.SetNumFaceWeights(valence);\n+260 posMask.SetFaceWeightsForFaceCenters(false);\n+261\n+262 // Specialize for the regular case:\n+263 if (valence == 4) {\n+264 Weight fWeight = (Weight)(1.0 / 36.0);\n+265 Weight eWeight = (Weight)(1.0 / 9.0);\n+266 Weight vWeight = (Weight)(4.0 / 9.0);\n+267\n+268 posMask.VertexWeight(0) = vWeight;\n+269\n+270 posMask.EdgeWeight(0) = eWeight;\n+271 posMask.EdgeWeight(1) = eWeight;\n+272 posMask.EdgeWeight(2) = eWeight;\n+273 posMask.EdgeWeight(3) = eWeight;\n+274\n+275 posMask.FaceWeight(0) = fWeight;\n+276 posMask.FaceWeight(1) = fWeight;\n+277 posMask.FaceWeight(2) = fWeight;\n+278 posMask.FaceWeight(3) = fWeight;\n+279 } else {\n+280 Weight Valence = (Weight) valence;\n+281\n+282 Weight fWeight = 1.0f / (Valence * (Valence + 5.0f));\n+283 Weight eWeight = 4.0f * fWeight;\n+284 Weight vWeight = 1.0f - Valence * (eWeight + fWeight);\n+285\n+286 posMask.VertexWeight(0) = vWeight;\n+287 for (int i = 0; i < valence; ++i) {\n+288 posMask.EdgeWeight(i) = eWeight;\n+289 posMask.FaceWeight(i) = fWeight;\n+290 }\n+291 }\n+292}\n+293\n+294//\n+295// Limit masks for tangents -- these are stubs for now, or have a temporary\n+296// implementation\n+297//\n+298template <>\n+299template \n+300inline void\n+_\b3_\b0_\b1_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+302 MASK& tan1Mask, MASK& tan2Mask) const {\n+303\n+304 int valence = vertex.GetNumEdges();\n+305\n+306 tan1Mask.SetNumVertexWeights(1);\n+307 tan1Mask.SetNumEdgeWeights(valence);\n+308 tan1Mask.SetNumFaceWeights(0);\n+309 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+310\n+311 tan2Mask.SetNumVertexWeights(1);\n+312 tan2Mask.SetNumEdgeWeights(valence);\n+313 tan2Mask.SetNumFaceWeights(0);\n+314 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+315\n+316 // Should be at least 2 edges -- be sure to clear weights for any more:\n+317 tan1Mask.VertexWeight(0) = -1.0f;\n+318 tan1Mask.EdgeWeight(0) = 1.0f;\n+319 tan1Mask.EdgeWeight(1) = 0.0f;\n+320\n+321 tan2Mask.VertexWeight(0) = -1.0f;\n+322 tan2Mask.EdgeWeight(0) = 0.0f;\n+323 tan2Mask.EdgeWeight(1) = 1.0f;\n+324\n+325 for (int i = 2; i < valence; ++i) {\n+326 tan1Mask.EdgeWeight(i) = 0.0f;\n+327 tan2Mask.EdgeWeight(i) = 0.0f;\n+328 }\n+329}\n+330\n+331template <>\n+332template \n+333inline void\n+_\b3_\b3_\b4_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+335 MASK& tan1Mask, MASK& tan2Mask, int const creaseEnds[2]) const {\n+336\n+337 typedef typename MASK::Weight Weight;\n+338\n+339 //\n+340 // First, the tangent along the crease:\n+341 // The first crease edge is considered the \"leading\" edge of the span\n+342 // of surface for which we are evaluating tangents and the second edge the\n+343 // \"trailing edge\". By convention, the tangent along the crease is oriented\n+344 // in the direction of the leading edge.\n+345 //\n+346 int numEdges = vertex.GetNumEdges();\n+347 int numFaces = vertex.GetNumFaces();\n+348\n+349 tan1Mask.SetNumVertexWeights(1);\n+350 tan1Mask.SetNumEdgeWeights(numEdges);\n+351 tan1Mask.SetNumFaceWeights(numFaces);\n+352 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+353\n+354 tan1Mask.VertexWeight(0) = 0.0f;\n+355 for (int i = 0; i < numEdges; ++i) {\n+356 tan1Mask.EdgeWeight(i) = 0.0f;\n+357 }\n+358 for (int i = 0; i < numFaces; ++i) {\n+359 tan1Mask.FaceWeight(i) = 0.0f;\n+360 }\n+361\n+362 tan1Mask.EdgeWeight(creaseEnds[0]) = 0.5f;\n+363 tan1Mask.EdgeWeight(creaseEnds[1]) = -0.5f;\n+364\n+365 //\n+366 // Second, the tangent across the interior faces:\n+367 // Note this is ambiguous for an interior vertex. We currently return\n+368 // the tangent for the surface in the counter-clockwise span between the\n+369 // leading and trailing edges that form the crease. Given the expected\n+370 // computation of a surface normal as Tan1 X Tan2, this tangent should be\n+371 // oriented \"inward\" from the crease/boundary -- across the surface rather\n+372 // than outward and away from it.\n+373 //\n+374 tan2Mask.SetNumVertexWeights(1);\n+375 tan2Mask.SetNumEdgeWeights(numEdges);\n+376 tan2Mask.SetNumFaceWeights(numFaces);\n+377 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+378\n+379 // Prepend weights of 0 preceding the crease:\n+380 for (int i = 0; i < creaseEnds[0]; ++i) {\n+381 tan2Mask.EdgeWeight(i) = 0.0f;\n+382 tan2Mask.FaceWeight(i) = 0.0f;\n+383 }\n+384\n+385 // Assign weights to crease edge and interior points:\n+386 int interiorEdgeCount = creaseEnds[1] - creaseEnds[0] - 1;\n+387 if (interiorEdgeCount == 1) {\n+388 // The regular case -- uniform B-spline cross-tangent:\n+389\n+390 tan2Mask.VertexWeight(0) = (Weight)(-4.0 / 6.0);\n+391\n+392 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight)(-1.0 / 6.0);\n+393 tan2Mask.EdgeWeight(creaseEnds[0] + 1) = (Weight)( 4.0 / 6.0);\n+394 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight)(-1.0 / 6.0);\n+395\n+396 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight)(1.0 / 6.0);\n+397 tan2Mask.FaceWeight(creaseEnds[0] + 1) = (Weight)(1.0 / 6.0);\n+398 } else if (interiorEdgeCount > 1) {\n+399 // The irregular case -- formulae from Biermann et al:\n+400\n+401 double k = (double) (interiorEdgeCount + 1);\n+402 double theta = M_PI / k;\n+403\n+404 double cosTheta = std::cos(theta);\n+405 double sinTheta = std::sin(theta);\n+406\n+407 // Loop/Schaefer use a different divisor here (3*k + cos(theta)):\n+408 double commonDenom = 1.0f / (k * (3.0f + cosTheta));\n+409 double R = (cosTheta + 1.0f) / sinTheta;\n+410\n+411 double vertexWeight = 4.0f * R * (cosTheta - 1.0f);\n+412 double creaseWeight = -R * (1.0f + 2.0f * cosTheta);\n+413\n+414 tan2Mask.VertexWeight(0) = (Weight) (vertexWeight * commonDenom);\n+415\n+416 tan2Mask.EdgeWeight(creaseEnds[0]) = (Weight) (creaseWeight * commonDenom);\n+417 tan2Mask.EdgeWeight(creaseEnds[1]) = (Weight) (creaseWeight * commonDenom);\n+418\n+419 tan2Mask.FaceWeight(creaseEnds[0]) = (Weight) (sinTheta * commonDenom);\n+420\n+421 double sinThetaI = 0.0f;\n+422 double sinThetaIplus1 = sinTheta;\n+423 for (int i = 1; i < k; ++i) {\n+424 sinThetaI = sinThetaIplus1;\n+425 sinThetaIplus1 = std::sin((i+1)*theta);\n+426\n+427 tan2Mask.EdgeWeight(creaseEnds[0] + i) = (Weight) ((4.0f * sinThetaI) *\n+commonDenom);\n+428 tan2Mask.FaceWeight(creaseEnds[0] + i) = (Weight) ((sinThetaI +\n+sinThetaIplus1) * commonDenom);\n+429 }\n+430 } else {\n+431 // Special case for a single face -- simple average of boundary edges:\n+432\n+433 tan2Mask.VertexWeight(0) = -6.0f;\n+434\n+435 tan2Mask.EdgeWeight(creaseEnds[0]) = 3.0f;\n+436 tan2Mask.EdgeWeight(creaseEnds[1]) = 3.0f;\n+437\n+438 tan2Mask.FaceWeight(creaseEnds[0]) = 0.0f;\n+439 }\n+440\n+441 // Append weights of 0 following the crease:\n+442 for (int i = creaseEnds[1]; i < numFaces; ++i) {\n+443 tan2Mask.FaceWeight(i) = 0.0f;\n+444 }\n+445 for (int i = creaseEnds[1] + 1; i < numEdges; ++i) {\n+446 tan2Mask.EdgeWeight(i) = 0.0f;\n+447 }\n+448}\n+449\n+450template <>\n+451template \n+452inline void\n+_\b4_\b5_\b3_\bS_\bc_\bh_\be_\bm_\be_\b<_\bS_\bC_\bH_\bE_\bM_\bE_\b__\bC_\bA_\bT_\bM_\bA_\bR_\bK_\b>_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs(VERTEX const& vertex,\n+454 MASK& tan1Mask, MASK& tan2Mask) const {\n+455\n+456 typedef typename MASK::Weight Weight;\n+457\n+458 int valence = vertex.GetNumFaces();\n+459 if (valence == 2) {\n+460 assignCornerLimitTangentMasks(vertex, tan1Mask, tan2Mask);\n+461 return;\n+462 }\n+463\n+464 // Compute tan1 initially -- tan2 is simply a rotation:\n+465 tan1Mask.SetNumVertexWeights(1);\n+466 tan1Mask.SetNumEdgeWeights(valence);\n+467 tan1Mask.SetNumFaceWeights(valence);\n+468 tan1Mask.SetFaceWeightsForFaceCenters(false);\n+469\n+470 tan1Mask.VertexWeight(0) = 0.0f;\n+471\n+472 if (valence == 4) {\n+473 tan1Mask.EdgeWeight(0) = 4.0f;\n+474 tan1Mask.EdgeWeight(1) = 0.0f;\n+475 tan1Mask.EdgeWeight(2) = -4.0f;\n+476 tan1Mask.EdgeWeight(3) = 0.0f;\n+477\n+478 tan1Mask.FaceWeight(0) = 1.0f;\n+479 tan1Mask.FaceWeight(1) = -1.0f;\n+480 tan1Mask.FaceWeight(2) = -1.0f;\n+481 tan1Mask.FaceWeight(3) = 1.0f;\n+482 } else {\n+483 double theta = 2.0f * M_PI / (double)valence;\n+484\n+485 double cosTheta = std::cos(theta);\n+486 double cosHalfTheta = std::cos(theta * 0.5f);\n+487\n+488 double lambda = (5.0 / 16.0) + (1.0 / 16.0) *\n+489 (cosTheta + cosHalfTheta * std::sqrt(2.0f * (9.0f + cosTheta)));\n+490\n+491 double edgeWeightScale = 4.0f;\n+492 double faceWeightScale = 1.0f / (4.0f * lambda - 1.0f);\n+493\n+494 for (int i = 0; i < valence; ++i) {\n+495 double cosThetaI = std::cos( i * theta);\n+496 double cosThetaIplus1 = std::cos((i+1)* theta);\n+497\n+498 tan1Mask.EdgeWeight(i) = (Weight) (edgeWeightScale * cosThetaI);\n+499 tan1Mask.FaceWeight(i) = (Weight) (faceWeightScale * (cosThetaI +\n+cosThetaIplus1));\n+500 }\n+501 }\n+502\n+503 // Now rotate/copy tan1 weights to tan2:\n+504 tan2Mask.SetNumVertexWeights(1);\n+505 tan2Mask.SetNumEdgeWeights(valence);\n+506 tan2Mask.SetNumFaceWeights(valence);\n+507 tan2Mask.SetFaceWeightsForFaceCenters(false);\n+508\n+509 tan2Mask.VertexWeight(0) = 0.0f;\n+510 if (valence == 4) {\n+511 tan2Mask.EdgeWeight(0) = 0.0f;\n+512 tan2Mask.EdgeWeight(1) = 4.0f;\n+513 tan2Mask.EdgeWeight(2) = 0.0f;\n+514 tan2Mask.EdgeWeight(3) = -4.0f;\n+515\n+516 tan2Mask.FaceWeight(0) = 1.0f;\n+517 tan2Mask.FaceWeight(1) = 1.0f;\n+518 tan2Mask.FaceWeight(2) = -1.0f;\n+519 tan2Mask.FaceWeight(3) = -1.0f;\n+520 } else {\n+521 tan2Mask.EdgeWeight(0) = tan1Mask.EdgeWeight(valence-1);\n+522 tan2Mask.FaceWeight(0) = tan1Mask.FaceWeight(valence-1);\n+523 for (int i = 1; i < valence; ++i) {\n+524 tan2Mask.EdgeWeight(i) = tan1Mask.EdgeWeight(i-1);\n+525 tan2Mask.FaceWeight(i) = tan1Mask.FaceWeight(i-1);\n+526 }\n+527 }\n+528}\n+529\n+530} // end namespace sdc\n+531\n+532} // end namespace OPENSUBDIV_VERSION\n+533using namespace OPENSUBDIV_VERSION;\n+534} // end namespace OpenSubdiv\n+535\n+536#endif /* OPENSUBDIV3_SDC_CATMARK_SCHEME_H */\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n-Types, constants and utilities related to semi-sharp creasing \u00e2\u0080\u0093 whose\n-implementation is independent o...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float SubdivideVertexSharpness(float vertexSharpness) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b2_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bI_\bn_\bf_\bi_\bn_\bi_\bt_\be\n-static bool IsInfinite(float sharpness)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bu_\bl_\be\n-Rule\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bO_\bR_\bN_\bE_\bR\n-@ RULE_CORNER\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bD_\bA_\bR_\bT\n-@ RULE_DART\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bS_\bM_\bO_\bO_\bT_\bH\n-@ RULE_SMOOTH\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bC_\bR_\bE_\bA_\bS_\bE\n-@ RULE_CREASE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bR_\bU_\bL_\bE_\b__\bU_\bN_\bK_\bN_\bO_\bW_\bN\n-@ RULE_UNKNOWN\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bV_\be_\br_\bt_\be_\bx\n-float SharpenBoundaryVertex(float edgeSharpness) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bS_\bM_\bO_\bO_\bT_\bH\n-static float const SHARPNESS_SMOOTH\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bG_\be_\bt_\bS_\bh_\ba_\br_\bp_\bE_\bd_\bg_\be_\bP_\ba_\bi_\br_\bO_\bf_\bC_\br_\be_\ba_\bs_\be\n-void GetSharpEdgePairOfCrease(float const *incidentEdgeSharpness, int\n-incidentEdgeCount, int sharpEdgePair[2]) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b2_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bH_\bA_\bR_\bP_\bN_\bE_\bS_\bS_\b__\bI_\bN_\bF_\bI_\bN_\bI_\bT_\bE\n-static float const SHARPNESS_INFINITE\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n-Rule DetermineVertexVertexRule(float vertexSharpness, int incidentEdgeCount,\n-float const *incidentEdgeSharpness) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bd_\be_\bc_\br_\be_\bm_\be_\bn_\bt_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float decrementSharpness(float sharpness) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\bm_\bo_\bo_\bt_\bh\n-static bool IsSmooth(float sharpness)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bD_\be_\bt_\be_\br_\bm_\bi_\bn_\be_\bV_\be_\br_\bt_\be_\bx_\bV_\be_\br_\bt_\be_\bx_\bR_\bu_\bl_\be\n-Rule DetermineVertexVertexRule(float vertexSharpness, int sharpEdgeCount) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bU_\bn_\bi_\bf_\bo_\br_\bm\n-bool IsUniform() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\be_\bm_\bi_\bS_\bh_\ba_\br_\bp\n-static bool IsSemiSharp(float sharpness)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n-Crease(Options const &options)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:\n-_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\be_\bs_\bA_\br_\bo_\bu_\bn_\bd_\bV_\be_\br_\bt_\be_\bx\n-void SubdivideEdgeSharpnessesAroundVertex(int incidentEdgeCountAtVertex, float\n-const *incidentEdgeSharpnessAroundVertex, float\n-*childEdgesSharpnessAroundVertex) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs\n-float SubdivideUniformSharpness(float vertexOrEdgeSharpness) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b2_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\br_\be_\ba_\bs_\be\n-Crease()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bh_\ba_\br_\bp_\be_\bn_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bE_\bd_\bg_\be\n-float SharpenBoundaryEdge(float edgeSharpness) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b1_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bF_\br_\ba_\bc_\bt_\bi_\bo_\bn_\ba_\bl_\bW_\be_\bi_\bg_\bh_\bt_\bA_\bt_\bV_\be_\br_\bt_\be_\bx\n-float ComputeFractionalWeightAtVertex(float vertexSharpness, float\n-childVertexSharpness, int incidentEdgeCount, float const\n-*incidentEdgeSharpness, float const *childEdgesSharpness) const\n-Transitional weighting: When the rules applicable to a parent vertex and its\n-child differ,...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bS_\bu_\bb_\bd_\bi_\bv_\bi_\bd_\be_\bE_\bd_\bg_\be_\bS_\bh_\ba_\br_\bp_\bn_\be_\bs_\bs_\bA_\bt_\bV_\be_\br_\bt_\be_\bx\n-float SubdivideEdgeSharpnessAtVertex(float edgeSharpness, int\n-incidentEdgeCountAtEndVertex, float const *edgeSharpnessAroundEndVertex) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\bI_\bs_\bS_\bh_\ba_\br_\bp\n-static bool IsSharp(float sharpness)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bC_\br_\be_\ba_\bs_\be_\b:_\b:_\b~_\bC_\br_\be_\ba_\bs_\be\n-~Crease()\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\br_\be_\ba_\bs_\be_\b._\bh_\b:_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-All supported options applying to subdivision scheme.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bC_\bR_\bE_\bA_\bS_\bE_\b__\bU_\bN_\bI_\bF_\bO_\bR_\bM\n-@ CREASE_UNIFORM\n-Catmark rule.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bC_\br_\be_\ba_\bs_\bi_\bn_\bg_\bM_\be_\bt_\bh_\bo_\bd\n-CreasingMethod GetCreasingMethod() const\n-Get edge crease rule.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b1_\b0_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bG_\be_\bt_\bV_\bt_\bx_\bB_\bo_\bu_\bn_\bd_\ba_\br_\by_\bI_\bn_\bt_\be_\br_\bp_\bo_\bl_\ba_\bt_\bi_\bo_\bn\n-VtxBoundaryInterpolation GetVtxBoundaryInterpolation() const\n-Get vertex boundary interpolation rule.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bV_\bT_\bX_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY_\b__\bE_\bD_\bG_\bE_\b__\bA_\bN_\bD_\b__\bC_\bO_\bR_\bN_\bE_\bR\n-@ VTX_BOUNDARY_EDGE_AND_CORNER\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b5_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bp_\bl_\bi_\bt\n+Split\n+Enumerated type for all face splitting schemes.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bP_\bL_\bI_\bT_\b__\bT_\bO_\b__\bQ_\bU_\bA_\bD_\bS\n+@ SPLIT_TO_QUADS\n+Used by Catmark and Bilinear.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs_\b:_\b:_\bT_\bR_\bI_\b__\bS_\bU_\bB_\b__\bS_\bM_\bO_\bO_\bT_\bH\n+@ TRI_SUB_SMOOTH\n+\"smooth triangle\" weights (Catmark scheme only)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bE_\bd_\bg_\be\n+void assignSmoothMaskForEdge(EDGE const &edge, MASK &mask) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bT_\bo_\bp_\bo_\bl_\bo_\bg_\bi_\bc_\ba_\bl_\bS_\bp_\bl_\bi_\bt_\bT_\by_\bp_\be\n+static Split GetTopologicalSplitType()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n+void assignCreaseMaskForVertex(VERTEX const &edge, MASK &mask, int const\n+creaseEnds[2]) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n+void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n+&tan2, int const creaseEnds[2]) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bF_\ba_\bc_\be_\bS_\bi_\bz_\be\n+static int GetRegularFaceSize()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n+void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bN_\be_\bi_\bg_\bh_\bb_\bo_\br_\bh_\bo_\bo_\bd_\bS_\bi_\bz_\be\n+static int GetLocalNeighborhoodSize()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\br_\be_\ba_\bs_\be_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n+void assignCreaseLimitMask(VERTEX const &vertex, MASK &pos, int const\n+creaseEnds[2]) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bM_\ba_\bs_\bk_\bF_\bo_\br_\bV_\be_\br_\bt_\be_\bx\n+void assignSmoothMaskForVertex(VERTEX const &edge, MASK &mask) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\bG_\be_\bt_\bR_\be_\bg_\bu_\bl_\ba_\br_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be\n+static int GetRegularVertexValence()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bS_\bm_\bo_\bo_\bt_\bh_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n+void assignSmoothLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n+&tan2) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bM_\ba_\bs_\bk\n+void assignCornerLimitMask(VERTEX const &vertex, MASK &pos) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bS_\bd_\bc_\b:_\b:_\bS_\bc_\bh_\be_\bm_\be_\b:_\b:_\ba_\bs_\bs_\bi_\bg_\bn_\bC_\bo_\br_\bn_\be_\br_\bL_\bi_\bm_\bi_\bt_\bT_\ba_\bn_\bg_\be_\bn_\bt_\bM_\ba_\bs_\bk_\bs\n+void assignCornerLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK\n+&tan2) const\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bs_\bd_\bc\n- * _\bc_\br_\be_\ba_\bs_\be_\b._\bh\n+ * _\bc_\ba_\bt_\bm_\ba_\br_\bk_\bS_\bc_\bh_\be_\bm_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00785_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00785_source.html", "unified_diff": "@@ -280,15 +280,15 @@\n
161using namespace OPENSUBDIV_VERSION;
\n
162} // end namespace OpenSubdiv
\n
163
\n
164#endif /* OPENSUBDIV3_SDC_BILINEAR_SCHEME_H */
\n \n
Split
Enumerated type for all face splitting schemes.
Definition types.h:47
\n
@ SPLIT_TO_QUADS
Used by Catmark and Bilinear.
Definition types.h:48
\n-\n+\n \n
void ComputeVertexVertexMask(VERTEX const &vertexNeighborhood, MASK &vertexVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Vertex-vertex masks If known, a single Rule or pair of Rules can be specified (indicating a crease tr...
Definition scheme.h:512
\n
void assignCreaseLimitTangentMasks(VERTEX const &vertex, MASK &tan1, MASK &tan2, int const creaseEnds[2]) const
\n \n
void ComputeEdgeVertexMask(EDGE const &edgeNeighborhood, MASK &edgeVertexMask, Crease::Rule parentRule=Crease::RULE_UNKNOWN, Crease::Rule childRule=Crease::RULE_UNKNOWN) const
Edge-vertex masks If known, the Rule for the edge and/or the derived vertex can be specified to accel...
Definition scheme.h:392
\n
void assignSmoothLimitMask(VERTEX const &vertex, MASK &pos) const
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00788_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00788_source.html", "unified_diff": "@@ -209,15 +209,15 @@\n
114} // end namespace OPENSUBDIV_VERSION
\n
115using namespace OPENSUBDIV_VERSION;
\n
116
\n
117} // end namespace OpenSubdiv
\n
118
\n
119#endif // OPENSUBDIV3_OSD_CUDA_PATCH_TABLE_H
\n \n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n
void * GetFVarPatchArrayBuffer(int fvarChannel) const
Returns the cuda memory of the array of Osd::PatchArray buffer.
\n \n
static CudaPatchTable * Create(Far::PatchTable const *patchTable, void *deviceContext=NULL)
Creator. Returns NULL if error.
\n \n
void * GetVaryingPatchIndexBuffer() const
Returns the cuda memory of the array of varying control vertices.
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00791.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00791.html", "unified_diff": "@@ -95,15 +95,15 @@\n Classes |\n Namespaces
\n
cudaEvaluator.h File Reference
\n \n
\n
#include "../version.h"
\n #include <vector>
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../osd/bufferDescriptor.h"
\n #include "../osd/types.h"
\n
\n

Go to the source code of this file.

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00791_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00791_source.html", "unified_diff": "@@ -641,17 +641,17 @@\n
1268using namespace OPENSUBDIV_VERSION;
\n
1269
\n
1270} // end namespace OpenSubdiv
\n
1271
\n
1272
\n
1273#endif // OPENSUBDIV3_OSD_CUDA_EVALUATOR_H
\n \n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n \n \n \n \n \n \n
CudaStencilTable(Far::LimitStencilTable const *limitStencilTable)
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00800_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00800_source.html", "unified_diff": "@@ -201,15 +201,15 @@\n
114} // end namespace OPENSUBDIV_VERSION
\n
115using namespace OPENSUBDIV_VERSION;
\n
116
\n
117} // end namespace OpenSubdiv
\n
118
\n
119#endif // OPENSUBDIV3_OSD_CL_PATCH_TABLE_H
\n \n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n \n \n \n
cl_mem GetPatchParamBuffer() const
Returns the CL memory of the array of Osd::PatchParam buffer.
\n \n
cl_mem GetFVarPatchArrayBuffer(int fvarChannel=0) const
Returns the CL memory of the array of Osd::PatchArray buffer.
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlCommon.h File Reference\n \n \n \n \n \n \n \n@@ -90,47 +90,40 @@\n \n \n \n
\n \n-
clEvaluator.h File Reference
\n+
mtlCommon.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/opencl.h"
\n-#include "../osd/types.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n

\n Classes

class  CudaStencilTable
\n \n-\n-\n-\n-\n+\n \n

\n Classes

class  CLStencilTable
 OpenCL stencil table. More...
 
class  CLEvaluator
class  MTLContext
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,23 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-clEvaluator.h File Reference\n+mtlCommon.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 OpenCL stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+class \u00a0 _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00803 = [\n- [\"CLStencilTable\", \"a01145.html\", \"a01145\"],\n- [\"CLEvaluator\", \"a01149.html\", \"a01149\"]\n+ [\"MTLContext\", \"a01285.html\", \"a01285\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00803_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00803_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/clEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlCommon.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
clEvaluator.h
\n+
mtlCommon.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,1283 +119,53 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
26#define OPENSUBDIV3_OSD_MTL_COMMON_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/opencl.h"
\n-
31#include "../osd/types.h"
\n-
32#include "../osd/bufferDescriptor.h"
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38 class PatchTable;
\n-
39 class StencilTable;
\n-
40 class LimitStencilTable;
\n-
41}
\n-
42
\n-
43namespace Osd {
\n-
44
\n-
\n-\n-
53public:
\n-
54 template <typename DEVICE_CONTEXT>
\n-
\n-
55 static CLStencilTable *Create(Far::StencilTable const *stencilTable,
\n-
56 DEVICE_CONTEXT context) {
\n-
57 return new CLStencilTable(stencilTable, context->GetContext());
\n-
58 }
\n-
\n-
59
\n-
60 template <typename DEVICE_CONTEXT>
\n-
\n-\n-
62 Far::LimitStencilTable const *limitStencilTable,
\n-
63 DEVICE_CONTEXT context) {
\n-
64 return new CLStencilTable(limitStencilTable, context->GetContext());
\n-
65 }
\n-
\n-
66
\n-
67 CLStencilTable(Far::StencilTable const *stencilTable,
\n-
68 cl_context clContext);
\n-
69 CLStencilTable(Far::LimitStencilTable const *limitStencilTable,
\n-
70 cl_context clContext);
\n-\n-
72
\n-
73 // interfaces needed for CLComputeKernel
\n-
74 cl_mem GetSizesBuffer() const { return _sizes; }
\n-
75 cl_mem GetOffsetsBuffer() const { return _offsets; }
\n-
76 cl_mem GetIndicesBuffer() const { return _indices; }
\n-
77 cl_mem GetWeightsBuffer() const { return _weights; }
\n-
78 cl_mem GetDuWeightsBuffer() const { return _duWeights; }
\n-
79 cl_mem GetDvWeightsBuffer() const { return _dvWeights; }
\n-
80 cl_mem GetDuuWeightsBuffer() const { return _duuWeights; }
\n-
81 cl_mem GetDuvWeightsBuffer() const { return _duvWeights; }
\n-
82 cl_mem GetDvvWeightsBuffer() const { return _dvvWeights; }
\n-
83 int GetNumStencils() const { return _numStencils; }
\n-
84
\n-
85private:
\n-
86 cl_mem _sizes;
\n-
87 cl_mem _offsets;
\n-
88 cl_mem _indices;
\n-
89 cl_mem _weights;
\n-
90 cl_mem _duWeights;
\n-
91 cl_mem _dvWeights;
\n-
92 cl_mem _duuWeights;
\n-
93 cl_mem _duvWeights;
\n-
94 cl_mem _dvvWeights;
\n-
95 int _numStencils;
\n-
96};
\n-
\n-
97
\n-
98// ---------------------------------------------------------------------------
\n-
99
\n-
\n-\n-
101public:
\n-
102 typedef bool Instantiatable;
\n-
103
\n-
105 template <typename DEVICE_CONTEXT>
\n-
\n-
106 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n-
107 BufferDescriptor const &dstDesc,
\n-
108 BufferDescriptor const &duDesc,
\n-
109 BufferDescriptor const &dvDesc,
\n-
110 DEVICE_CONTEXT deviceContext) {
\n-
111 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
112 deviceContext->GetContext(),
\n-
113 deviceContext->GetCommandQueue());
\n-
114 }
\n-
\n-
115
\n-
\n-
116 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n-
117 BufferDescriptor const &dstDesc,
\n-
118 BufferDescriptor const &duDesc,
\n-
119 BufferDescriptor const &dvDesc,
\n-
120 cl_context clContext,
\n-
121 cl_command_queue clCommandQueue) {
\n-
122 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n-
123 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc))
\n-
124 return instance;
\n-
125 delete instance;
\n-
126 return NULL;
\n-
127 }
\n-
\n-
128
\n-
130 template <typename DEVICE_CONTEXT>
\n-
\n-
131 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n-
132 BufferDescriptor const &dstDesc,
\n-
133 BufferDescriptor const &duDesc,
\n-
134 BufferDescriptor const &dvDesc,
\n-
135 BufferDescriptor const &duuDesc,
\n-
136 BufferDescriptor const &duvDesc,
\n-
137 BufferDescriptor const &dvvDesc,
\n-
138 DEVICE_CONTEXT deviceContext) {
\n-
139 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
140 duuDesc, duvDesc, dvvDesc,
\n-
141 deviceContext->GetContext(),
\n-
142 deviceContext->GetCommandQueue());
\n-
143 }
\n-
\n-
144
\n-
\n-
145 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n-
146 BufferDescriptor const &dstDesc,
\n-
147 BufferDescriptor const &duDesc,
\n-
148 BufferDescriptor const &dvDesc,
\n-
149 BufferDescriptor const &duuDesc,
\n-
150 BufferDescriptor const &duvDesc,
\n-
151 BufferDescriptor const &dvvDesc,
\n-
152 cl_context clContext,
\n-
153 cl_command_queue clCommandQueue) {
\n-
154 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n-
155 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n-
156 duuDesc, duvDesc, dvvDesc))
\n-
157 return instance;
\n-
158 delete instance;
\n-
159 return NULL;
\n-
160 }
\n-
\n-
161
\n-
163 CLEvaluator(cl_context context, cl_command_queue queue);
\n-
164
\n-\n-
167
\n-
173
\n-
217 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
218 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
219 static bool EvalStencils(
\n-
220 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
221 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
222 STENCIL_TABLE const *stencilTable,
\n-
223 CLEvaluator const *instance,
\n-
224 DEVICE_CONTEXT deviceContext,
\n-
225 unsigned int numStartEvents=0,
\n-
226 const cl_event* startEvents=NULL,
\n-
227 cl_event* endEvent=NULL) {
\n-
228
\n-
229 if (instance) {
\n-
230 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
231 dstBuffer, dstDesc,
\n-
232 stencilTable,
\n-
233 numStartEvents, startEvents, endEvent);
\n-
234 } else {
\n-
235 // Create an instance on demand (slow)
\n-
236 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
239 deviceContext);
\n-
240 if (instance) {
\n-
241 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
242 dstBuffer, dstDesc,
\n-
243 stencilTable,
\n-
244 numStartEvents, startEvents, endEvent);
\n-
245 delete instance;
\n-
246 return r;
\n-
247 }
\n-
248 return false;
\n-
249 }
\n-
250 }
\n-
\n-
251
\n-
307 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
308 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
309 static bool EvalStencils(
\n-
310 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
311 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
312 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
313 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
314 STENCIL_TABLE const *stencilTable,
\n-
315 CLEvaluator const *instance,
\n-
316 DEVICE_CONTEXT deviceContext,
\n-
317 unsigned int numStartEvents=0,
\n-
318 const cl_event* startEvents=NULL,
\n-
319 cl_event* endEvent=NULL) {
\n-
320
\n-
321 if (instance) {
\n-
322 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
323 dstBuffer, dstDesc,
\n-
324 duBuffer, duDesc,
\n-
325 dvBuffer, dvDesc,
\n-
326 stencilTable,
\n-
327 numStartEvents, startEvents, endEvent);
\n-
328 } else {
\n-
329 // Create an instance on demand (slow)
\n-
330 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
331 deviceContext);
\n-
332 if (instance) {
\n-
333 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
334 dstBuffer, dstDesc,
\n-
335 duBuffer, duDesc,
\n-
336 dvBuffer, dvDesc,
\n-
337 stencilTable,
\n-
338 numStartEvents, startEvents, endEvent);
\n-
339 delete instance;
\n-
340 return r;
\n-
341 }
\n-
342 return false;
\n-
343 }
\n-
344 }
\n-
\n-
345
\n-
419 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
420 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n-
\n-
421 static bool EvalStencils(
\n-
422 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
423 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
424 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
425 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
426 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
427 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
428 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
429 STENCIL_TABLE const *stencilTable,
\n-
430 CLEvaluator const *instance,
\n-
431 DEVICE_CONTEXT deviceContext,
\n-
432 unsigned int numStartEvents=0,
\n-
433 const cl_event* startEvents=NULL,
\n-
434 cl_event* endEvent=NULL) {
\n-
435
\n-
436 if (instance) {
\n-
437 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
438 dstBuffer, dstDesc,
\n-
439 duBuffer, duDesc,
\n-
440 dvBuffer, dvDesc,
\n-
441 duuBuffer, duuDesc,
\n-
442 duvBuffer, duvDesc,
\n-
443 dvvBuffer, dvvDesc,
\n-
444 stencilTable,
\n-
445 numStartEvents, startEvents, endEvent);
\n-
446 } else {
\n-
447 // Create an instance on demand (slow)
\n-
448 instance = Create(srcDesc, dstDesc,
\n-
449 duDesc, dvDesc,
\n-
450 duuDesc, duvDesc, dvvDesc,
\n-
451 deviceContext);
\n-
452 if (instance) {
\n-
453 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
454 dstBuffer, dstDesc,
\n-
455 duBuffer, duDesc,
\n-
456 dvBuffer, dvDesc,
\n-
457 duuBuffer, duuDesc,
\n-
458 duvBuffer, duvDesc,
\n-
459 dvvBuffer, dvvDesc,
\n-
460 stencilTable,
\n-
461 numStartEvents, startEvents, endEvent);
\n-
462 delete instance;
\n-
463 return r;
\n-
464 }
\n-
465 return false;
\n-
466 }
\n-
467 }
\n-
\n-
468
\n-
499 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
501 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
502 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
503 STENCIL_TABLE const *stencilTable,
\n-
504 unsigned int numStartEvents=0,
\n-
505 const cl_event* startEvents=NULL,
\n-
506 cl_event* endEvent=NULL) const {
\n-
507 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
509 stencilTable->GetSizesBuffer(),
\n-
510 stencilTable->GetOffsetsBuffer(),
\n-
511 stencilTable->GetIndicesBuffer(),
\n-
512 stencilTable->GetWeightsBuffer(),
\n-
513 0,
\n-
514 stencilTable->GetNumStencils(),
\n-
515 numStartEvents, startEvents, endEvent);
\n-
516 }
\n-
\n-
517
\n-
560 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
562 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
563 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
564 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
565 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
566 STENCIL_TABLE const *stencilTable,
\n-
567 unsigned int numStartEvents=0,
\n-
568 const cl_event* startEvents=NULL,
\n-
569 cl_event* endEvent=NULL) const {
\n-
570 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
574 stencilTable->GetSizesBuffer(),
\n-
575 stencilTable->GetOffsetsBuffer(),
\n-
576 stencilTable->GetIndicesBuffer(),
\n-
577 stencilTable->GetWeightsBuffer(),
\n-
578 stencilTable->GetDuWeightsBuffer(),
\n-
579 stencilTable->GetDvWeightsBuffer(),
\n-
580 0,
\n-
581 stencilTable->GetNumStencils(),
\n-
582 numStartEvents, startEvents, endEvent);
\n-
583 }
\n-
\n-
584
\n-
645 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
647 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
648 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
649 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
650 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
651 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
652 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
653 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
654 STENCIL_TABLE const *stencilTable,
\n-
655 unsigned int numStartEvents=0,
\n-
656 const cl_event* startEvents=NULL,
\n-
657 cl_event* endEvent=NULL) const {
\n-
658 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
665 stencilTable->GetSizesBuffer(),
\n-
666 stencilTable->GetOffsetsBuffer(),
\n-
667 stencilTable->GetIndicesBuffer(),
\n-
668 stencilTable->GetWeightsBuffer(),
\n-
669 stencilTable->GetDuWeightsBuffer(),
\n-
670 stencilTable->GetDvWeightsBuffer(),
\n-
671 stencilTable->GetDuuWeightsBuffer(),
\n-
672 stencilTable->GetDuvWeightsBuffer(),
\n-
673 stencilTable->GetDvvWeightsBuffer(),
\n-
674 0,
\n-
675 stencilTable->GetNumStencils(),
\n-
676 numStartEvents, startEvents, endEvent);
\n-
677 }
\n-
\n-
678
\n-
681 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
682 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
683 cl_mem sizes,
\n-
684 cl_mem offsets,
\n-
685 cl_mem indices,
\n-
686 cl_mem weights,
\n-
687 int start,
\n-
688 int end,
\n-
689 unsigned int numStartEvents=0,
\n-
690 const cl_event* startEvents=NULL,
\n-
691 cl_event* endEvent=NULL) const;
\n-
692
\n-
741 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
742 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
743 cl_mem du, BufferDescriptor const &duDesc,
\n-
744 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
745 cl_mem sizes,
\n-
746 cl_mem offsets,
\n-
747 cl_mem indices,
\n-
748 cl_mem weights,
\n-
749 cl_mem duWeights,
\n-
750 cl_mem dvWeights,
\n-
751 int start,
\n-
752 int end,
\n-
753 unsigned int numStartEvents=0,
\n-
754 const cl_event* startEvents=NULL,
\n-
755 cl_event* endEvent=NULL) const;
\n-
756
\n-
823 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n-
824 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
825 cl_mem du, BufferDescriptor const &duDesc,
\n-
826 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
827 cl_mem duu, BufferDescriptor const &duuDesc,
\n-
828 cl_mem duv, BufferDescriptor const &duvDesc,
\n-
829 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n-
830 cl_mem sizes,
\n-
831 cl_mem offsets,
\n-
832 cl_mem indices,
\n-
833 cl_mem weights,
\n-
834 cl_mem duWeights,
\n-
835 cl_mem dvWeights,
\n-
836 cl_mem duuWeights,
\n-
837 cl_mem duvWeights,
\n-
838 cl_mem dvvWeights,
\n-
839 int start,
\n-
840 int end,
\n-
841 unsigned int numStartEvents=0,
\n-
842 const cl_event* startEvents=NULL,
\n-
843 cl_event* endEvent=NULL) const;
\n-
844
\n-
850
\n-
899 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
900 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
901 typename DEVICE_CONTEXT>
\n-
\n-
902 static bool EvalPatches(
\n-
903 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
904 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
905 int numPatchCoords,
\n-
906 PATCHCOORD_BUFFER *patchCoords,
\n-
907 PATCH_TABLE *patchTable,
\n-
908 CLEvaluator const *instance,
\n-
909 DEVICE_CONTEXT deviceContext,
\n-
910 unsigned int numStartEvents=0,
\n-
911 const cl_event* startEvents=NULL,
\n-
912 cl_event* endEvent=NULL) {
\n-
913
\n-
914 if (instance) {
\n-
915 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
916 dstBuffer, dstDesc,
\n-
917 numPatchCoords, patchCoords,
\n-
918 patchTable,
\n-
919 numStartEvents, startEvents, endEvent);
\n-
920 } else {
\n-
921 // Create an instance on demand (slow)
\n-
922 (void)deviceContext; // unused
\n-
923 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
926 deviceContext);
\n-
927 if (instance) {
\n-
928 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
929 dstBuffer, dstDesc,
\n-
930 numPatchCoords, patchCoords,
\n-
931 patchTable,
\n-
932 numStartEvents, startEvents, endEvent);
\n-
933 delete instance;
\n-
934 return r;
\n-
935 }
\n-
936 return false;
\n-
937 }
\n-
938 }
\n-
\n-
939
\n-
1000 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1001 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1002 typename DEVICE_CONTEXT>
\n-
\n-
1003 static bool EvalPatches(
\n-
1004 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1005 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1006 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1007 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1008 int numPatchCoords,
\n-
1009 PATCHCOORD_BUFFER *patchCoords,
\n-
1010 PATCH_TABLE *patchTable,
\n-
1011 CLEvaluator const *instance,
\n-
1012 DEVICE_CONTEXT deviceContext,
\n-
1013 unsigned int numStartEvents=0,
\n-
1014 const cl_event* startEvents=NULL,
\n-
1015 cl_event* endEvent=NULL) {
\n-
1016
\n-
1017 if (instance) {
\n-
1018 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
1019 dstBuffer, dstDesc,
\n-
1020 duBuffer, duDesc,
\n-
1021 dvBuffer, dvDesc,
\n-
1022 numPatchCoords, patchCoords,
\n-
1023 patchTable,
\n-
1024 numStartEvents, startEvents, endEvent);
\n-
1025 } else {
\n-
1026 // Create an instance on demand (slow)
\n-
1027 (void)deviceContext; // unused
\n-
1028 instance = Create(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);
\n-
1029 if (instance) {
\n-
1030 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
1031 dstBuffer, dstDesc,
\n-
1032 duBuffer, duDesc,
\n-
1033 dvBuffer, dvDesc,
\n-
1034 numPatchCoords, patchCoords,
\n-
1035 patchTable,
\n-
1036 numStartEvents, startEvents, endEvent);
\n-
1037 delete instance;
\n-
1038 return r;
\n-
1039 }
\n-
1040 return false;
\n-
1041 }
\n-
1042 }
\n-
\n-
1043
\n-
1122 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1123 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1124 typename DEVICE_CONTEXT>
\n-
\n-
1125 static bool EvalPatches(
\n-
1126 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1127 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1128 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1129 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1130 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1131 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1132 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1133 int numPatchCoords,
\n-
1134 PATCHCOORD_BUFFER *patchCoords,
\n-
1135 PATCH_TABLE *patchTable,
\n-
1136 CLEvaluator const *instance,
\n-
1137 DEVICE_CONTEXT deviceContext,
\n-
1138 unsigned int numStartEvents=0,
\n-
1139 const cl_event* startEvents=NULL,
\n-
1140 cl_event* endEvent=NULL) {
\n-
1141
\n-
1142 if (instance) {
\n-
1143 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
1144 dstBuffer, dstDesc,
\n-
1145 duBuffer, duDesc,
\n-
1146 dvBuffer, dvDesc,
\n-
1147 duuBuffer, duuDesc,
\n-
1148 duvBuffer, duvDesc,
\n-
1149 dvvBuffer, dvvDesc,
\n-
1150 numPatchCoords, patchCoords,
\n-
1151 patchTable,
\n-
1152 numStartEvents, startEvents, endEvent);
\n-
1153 } else {
\n-
1154 // Create an instance on demand (slow)
\n-
1155 (void)deviceContext; // unused
\n-
1156 instance = Create(srcDesc, dstDesc,
\n-
1157 duDesc, dvDesc,
\n-
1158 duuDesc, duvDesc, dvvDesc,
\n-
1159 deviceContext);
\n-
1160 if (instance) {
\n-
1161 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
1162 dstBuffer, dstDesc,
\n-
1163 duBuffer, duDesc,
\n-
1164 dvBuffer, dvDesc,
\n-
1165 duuBuffer, duuDesc,
\n-
1166 duvBuffer, duvDesc,
\n-
1167 dvvBuffer, dvvDesc,
\n-
1168 numPatchCoords, patchCoords,
\n-
1169 patchTable,
\n-
1170 numStartEvents, startEvents, endEvent);
\n-
1171 delete instance;
\n-
1172 return r;
\n-
1173 }
\n-
1174 return false;
\n-
1175 }
\n-
1176 }
\n-
\n-
1177
\n-
1215 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1216 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1218 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1219 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1220 int numPatchCoords,
\n-
1221 PATCHCOORD_BUFFER *patchCoords,
\n-
1222 PATCH_TABLE *patchTable,
\n-
1223 unsigned int numStartEvents=0,
\n-
1224 const cl_event* startEvents=NULL,
\n-
1225 cl_event* endEvent=NULL) const {
\n-
1226
\n-
1227 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1229 0, BufferDescriptor(),
\n-
1230 0, BufferDescriptor(),
\n-
1231 numPatchCoords,
\n-
1232 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1233 patchTable->GetPatchArrayBuffer(),
\n-
1234 patchTable->GetPatchIndexBuffer(),
\n-
1235 patchTable->GetPatchParamBuffer(),
\n-
1236 numStartEvents, startEvents, endEvent);
\n-
1237 }
\n-
\n-
1238
\n-
1286 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1287 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1289 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1290 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1291 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1292 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1293 int numPatchCoords,
\n-
1294 PATCHCOORD_BUFFER *patchCoords,
\n-
1295 PATCH_TABLE *patchTable,
\n-
1296 unsigned int numStartEvents=0,
\n-
1297 const cl_event* startEvents=NULL,
\n-
1298 cl_event* endEvent=NULL) const {
\n-
1299
\n-
1300 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1304 numPatchCoords,
\n-
1305 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1306 patchTable->GetPatchArrayBuffer(),
\n-
1307 patchTable->GetPatchIndexBuffer(),
\n-
1308 patchTable->GetPatchParamBuffer(),
\n-
1309 numStartEvents, startEvents, endEvent);
\n-
1310 }
\n-
\n-
1311
\n-
1377 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1378 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1380 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1381 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1382 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1383 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1384 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1385 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1386 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1387 int numPatchCoords,
\n-
1388 PATCHCOORD_BUFFER *patchCoords,
\n-
1389 PATCH_TABLE *patchTable,
\n-
1390 unsigned int numStartEvents=0,
\n-
1391 const cl_event* startEvents=NULL,
\n-
1392 cl_event* endEvent=NULL) const {
\n-
1393
\n-
1394 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
1401 numPatchCoords,
\n-
1402 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1403 patchTable->GetPatchArrayBuffer(),
\n-
1404 patchTable->GetPatchIndexBuffer(),
\n-
1405 patchTable->GetPatchParamBuffer(),
\n-
1406 numStartEvents, startEvents, endEvent);
\n-
1407 }
\n-
\n-
1408
\n-
1409 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n-
1410 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
1411 cl_mem du, BufferDescriptor const &duDesc,
\n-
1412 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
1413 int numPatchCoords,
\n-
1414 cl_mem patchCoordsBuffer,
\n-
1415 cl_mem patchArrayBuffer,
\n-
1416 cl_mem patchIndexBuffer,
\n-
1417 cl_mem patchParamsBuffer,
\n-
1418 unsigned int numStartEvents=0,
\n-
1419 const cl_event* startEvents=NULL,
\n-
1420 cl_event* endEvent=NULL) const;
\n-
1421
\n-
1422 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n-
1423 cl_mem dst, BufferDescriptor const &dstDesc,
\n-
1424 cl_mem du, BufferDescriptor const &duDesc,
\n-
1425 cl_mem dv, BufferDescriptor const &dvDesc,
\n-
1426 cl_mem duu, BufferDescriptor const &duuDesc,
\n-
1427 cl_mem duv, BufferDescriptor const &duvDesc,
\n-
1428 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n-
1429 int numPatchCoords,
\n-
1430 cl_mem patchCoordsBuffer,
\n-
1431 cl_mem patchArrayBuffer,
\n-
1432 cl_mem patchIndexBuffer,
\n-
1433 cl_mem patchParamsBuffer,
\n-
1434 unsigned int numStartEvents=0,
\n-
1435 const cl_event* startEvents=NULL,
\n-
1436 cl_event* endEvent=NULL) const;
\n-
1437
\n-
1486 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1487 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1488 typename DEVICE_CONTEXT>
\n-
\n-\n-
1490 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1491 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1492 int numPatchCoords,
\n-
1493 PATCHCOORD_BUFFER *patchCoords,
\n-
1494 PATCH_TABLE *patchTable,
\n-
1495 CLEvaluator const *instance,
\n-
1496 DEVICE_CONTEXT deviceContext,
\n-
1497 unsigned int numStartEvents=0,
\n-
1498 const cl_event* startEvents=NULL,
\n-
1499 cl_event* endEvent=NULL) {
\n-
1500
\n-
1501 if (instance) {
\n-
1502 return instance->EvalPatchesVarying(
\n-
1503 srcBuffer, srcDesc,
\n-
1504 dstBuffer, dstDesc,
\n-
1505 numPatchCoords, patchCoords,
\n-
1506 patchTable,
\n-
1507 numStartEvents, startEvents, endEvent);
\n-
1508 } else {
\n-
1509 // Create an instance on demand (slow)
\n-
1510 (void)deviceContext; // unused
\n-
1511 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
1514 deviceContext);
\n-
1515 if (instance) {
\n-
1516 bool r = instance->EvalPatchesVarying(
\n-
1517 srcBuffer, srcDesc,
\n-
1518 dstBuffer, dstDesc,
\n-
1519 numPatchCoords, patchCoords,
\n-
1520 patchTable,
\n-
1521 numStartEvents, startEvents, endEvent);
\n-
1522 delete instance;
\n-
1523 return r;
\n-
1524 }
\n-
1525 return false;
\n-
1526 }
\n-
1527 }
\n-
\n-
1528
\n-
1566 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1567 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1569 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1570 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1571 int numPatchCoords,
\n-
1572 PATCHCOORD_BUFFER *patchCoords,
\n-
1573 PATCH_TABLE *patchTable,
\n-
1574 unsigned int numStartEvents=0,
\n-
1575 const cl_event* startEvents=NULL,
\n-
1576 cl_event* endEvent=NULL) const {
\n-
1577
\n-
1578 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1580 0, BufferDescriptor(),
\n-
1581 0, BufferDescriptor(),
\n-
1582 numPatchCoords,
\n-
1583 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1584 patchTable->GetVaryingPatchArrayBuffer(),
\n-
1585 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1586 patchTable->GetPatchParamBuffer(),
\n-
1587 numStartEvents, startEvents, endEvent);
\n-
1588 }
\n-
\n-
1589
\n-
1650 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1651 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1652 typename DEVICE_CONTEXT>
\n-
\n-\n-
1654 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1655 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1656 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1657 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1658 int numPatchCoords,
\n-
1659 PATCHCOORD_BUFFER *patchCoords,
\n-
1660 PATCH_TABLE *patchTable,
\n-
1661 CLEvaluator const *instance,
\n-
1662 DEVICE_CONTEXT deviceContext,
\n-
1663 unsigned int numStartEvents=0,
\n-
1664 const cl_event* startEvents=NULL,
\n-
1665 cl_event* endEvent=NULL) {
\n-
1666
\n-
1667 if (instance) {
\n-
1668 return instance->EvalPatchesVarying(
\n-
1669 srcBuffer, srcDesc,
\n-
1670 dstBuffer, dstDesc,
\n-
1671 duBuffer, duDesc,
\n-
1672 dvBuffer, dvDesc,
\n-
1673 numPatchCoords, patchCoords,
\n-
1674 patchTable,
\n-
1675 numStartEvents, startEvents, endEvent);
\n-
1676 } else {
\n-
1677 // Create an instance on demand (slow)
\n-
1678 (void)deviceContext; // unused
\n-
1679 instance = Create(srcDesc, dstDesc,
\n-
1680 duDesc, dvDesc,
\n-
1681 deviceContext);
\n-
1682 if (instance) {
\n-
1683 bool r = instance->EvalPatchesVarying(
\n-
1684 srcBuffer, srcDesc,
\n-
1685 dstBuffer, dstDesc,
\n-
1686 duBuffer, duDesc,
\n-
1687 dvBuffer, dvDesc,
\n-
1688 numPatchCoords, patchCoords,
\n-
1689 patchTable,
\n-
1690 numStartEvents, startEvents, endEvent);
\n-
1691 delete instance;
\n-
1692 return r;
\n-
1693 }
\n-
1694 return false;
\n-
1695 }
\n-
1696 }
\n-
\n-
1697
\n-
1747 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1748 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1750 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1751 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1752 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1753 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1754 int numPatchCoords,
\n-
1755 PATCHCOORD_BUFFER *patchCoords,
\n-
1756 PATCH_TABLE *patchTable,
\n-
1757 unsigned int numStartEvents=0,
\n-
1758 const cl_event* startEvents=NULL,
\n-
1759 cl_event* endEvent=NULL) const {
\n-
1760
\n-
1761 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1765 numPatchCoords,
\n-
1766 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
1767 patchTable->GetVaryingPatchArrayBuffer(),
\n-
1768 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1769 patchTable->GetPatchParamBuffer(),
\n-
1770 numStartEvents, startEvents, endEvent);
\n-
1771 }
\n-
\n-
1772
\n-
1851 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1852 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
1853 typename DEVICE_CONTEXT>
\n-
\n-\n-
1855 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1856 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1857 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1858 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1859 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1860 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1861 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1862 int numPatchCoords,
\n-
1863 PATCHCOORD_BUFFER *patchCoords,
\n-
1864 PATCH_TABLE *patchTable,
\n-
1865 CLEvaluator const *instance,
\n-
1866 DEVICE_CONTEXT deviceContext,
\n-
1867 unsigned int numStartEvents=0,
\n-
1868 const cl_event* startEvents=NULL,
\n-
1869 cl_event* endEvent=NULL) {
\n-
1870
\n-
1871 if (instance) {
\n-
1872 return instance->EvalPatchesVarying(
\n-
1873 srcBuffer, srcDesc,
\n-
1874 dstBuffer, dstDesc,
\n-
1875 duBuffer, duDesc,
\n-
1876 dvBuffer, dvDesc,
\n-
1877 duuBuffer, duuDesc,
\n-
1878 duvBuffer, duvDesc,
\n-
1879 dvvBuffer, dvvDesc,
\n-
1880 numPatchCoords, patchCoords,
\n-
1881 patchTable,
\n-
1882 numStartEvents, startEvents, endEvent);
\n-
1883 } else {
\n-
1884 // Create an instance on demand (slow)
\n-
1885 (void)deviceContext; // unused
\n-
1886 instance = Create(srcDesc, dstDesc,
\n-
1887 duDesc, dvDesc,
\n-
1888 duuDesc, duvDesc, dvvDesc,
\n-
1889 deviceContext);
\n-
1890 if (instance) {
\n-
1891 bool r = instance->EvalPatchesVarying(
\n-
1892 srcBuffer, srcDesc,
\n-
1893 dstBuffer, dstDesc,
\n-
1894 duBuffer, duDesc,
\n-
1895 dvBuffer, dvDesc,
\n-
1896 duuBuffer, duuDesc,
\n-
1897 duvBuffer, duvDesc,
\n-
1898 dvvBuffer, dvvDesc,
\n-
1899 numPatchCoords, patchCoords,
\n-
1900 patchTable,
\n-
1901 numStartEvents, startEvents, endEvent);
\n-
1902 delete instance;
\n-
1903 return r;
\n-
1904 }
\n-
1905 return false;
\n-
1906 }
\n-
1907 }
\n-
\n-
1908
\n-
1976 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1977 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1979 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1980 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1981 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1982 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1983 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1984 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1985 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1986 int numPatchCoords,
\n-
1987 PATCHCOORD_BUFFER *patchCoords,
\n-
1988 PATCH_TABLE *patchTable,
\n-
1989 unsigned int numStartEvents=0,
\n-
1990 const cl_event* startEvents=NULL,
\n-
1991 cl_event* endEvent=NULL) const {
\n-
1992
\n-
1993 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
2000 numPatchCoords,
\n-
2001 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2002 patchTable->GetVaryingPatchArrayBuffer(),
\n-
2003 patchTable->GetVaryingPatchIndexBuffer(),
\n-
2004 patchTable->GetPatchParamBuffer(),
\n-
2005 numStartEvents, startEvents, endEvent);
\n-
2006 }
\n-
\n-
2007
\n-
2058 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2059 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2060 typename DEVICE_CONTEXT>
\n-
\n-\n-
2062 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2063 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2064 int numPatchCoords,
\n-
2065 PATCHCOORD_BUFFER *patchCoords,
\n-
2066 PATCH_TABLE *patchTable,
\n-
2067 int fvarChannel,
\n-
2068 CLEvaluator const *instance,
\n-
2069 DEVICE_CONTEXT deviceContext,
\n-
2070 unsigned int numStartEvents=0,
\n-
2071 const cl_event* startEvents=NULL,
\n-
2072 cl_event* endEvent=NULL) {
\n-
2073
\n-
2074 if (instance) {
\n-
2075 return instance->EvalPatchesFaceVarying(
\n-
2076 srcBuffer, srcDesc,
\n-
2077 dstBuffer, dstDesc,
\n-
2078 numPatchCoords, patchCoords,
\n-
2079 patchTable, fvarChannel,
\n-
2080 numStartEvents, startEvents, endEvent);
\n-
2081 } else {
\n-
2082 // Create an instance on demand (slow)
\n-
2083 (void)deviceContext; // unused
\n-
2084 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
2087 deviceContext);
\n-
2088 if (instance) {
\n-
2089 bool r = instance->EvalPatchesFaceVarying(
\n-
2090 srcBuffer, srcDesc,
\n-
2091 dstBuffer, dstDesc,
\n-
2092 numPatchCoords, patchCoords,
\n-
2093 patchTable, fvarChannel,
\n-
2094 numStartEvents, startEvents, endEvent);
\n-
2095 delete instance;
\n-
2096 return r;
\n-
2097 }
\n-
2098 return false;
\n-
2099 }
\n-
2100 }
\n-
\n-
2101
\n-
2141 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2142 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2144 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2145 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2146 int numPatchCoords,
\n-
2147 PATCHCOORD_BUFFER *patchCoords,
\n-
2148 PATCH_TABLE *patchTable,
\n-
2149 int fvarChannel = 0,
\n-
2150 unsigned int numStartEvents=0,
\n-
2151 const cl_event* startEvents=NULL,
\n-
2152 cl_event* endEvent=NULL) const {
\n-
2153
\n-
2154 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2156 0, BufferDescriptor(),
\n-
2157 0, BufferDescriptor(),
\n-
2158 numPatchCoords,
\n-
2159 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2163 numStartEvents, startEvents, endEvent);
\n-
2164 }
\n-
\n-
2165
\n-
2228 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2229 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2230 typename DEVICE_CONTEXT>
\n-
\n-\n-
2232 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2233 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2234 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2235 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2236 int numPatchCoords,
\n-
2237 PATCHCOORD_BUFFER *patchCoords,
\n-
2238 PATCH_TABLE *patchTable,
\n-
2239 int fvarChannel,
\n-
2240 CLEvaluator const *instance,
\n-
2241 DEVICE_CONTEXT deviceContext,
\n-
2242 unsigned int numStartEvents=0,
\n-
2243 const cl_event* startEvents=NULL,
\n-
2244 cl_event* endEvent=NULL) {
\n-
2245
\n-
2246 if (instance) {
\n-
2247 return instance->EvalPatchesFaceVarying(
\n-
2248 srcBuffer, srcDesc,
\n-
2249 dstBuffer, dstDesc,
\n-
2250 duBuffer, duDesc,
\n-
2251 dvBuffer, dvDesc,
\n-
2252 numPatchCoords, patchCoords,
\n-
2253 patchTable, fvarChannel,
\n-
2254 numStartEvents, startEvents, endEvent);
\n-
2255 } else {
\n-
2256 // Create an instance on demand (slow)
\n-
2257 (void)deviceContext; // unused
\n-
2258 instance = Create(srcDesc, dstDesc,
\n-
2259 duDesc, dvDesc, deviceContext);
\n-
2260 if (instance) {
\n-
2261 bool r = instance->EvalPatchesFaceVarying(
\n-
2262 srcBuffer, srcDesc,
\n-
2263 dstBuffer, dstDesc,
\n-
2264 duBuffer, duDesc,
\n-
2265 dvBuffer, dvDesc,
\n-
2266 numPatchCoords, patchCoords,
\n-
2267 patchTable, fvarChannel,
\n-
2268 numStartEvents, startEvents, endEvent);
\n-
2269 delete instance;
\n-
2270 return r;
\n-
2271 }
\n-
2272 return false;
\n-
2273 }
\n-
2274 }
\n-
\n-
2275
\n-
2327 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2328 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2330 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2331 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2332 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2333 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2334 int numPatchCoords,
\n-
2335 PATCHCOORD_BUFFER *patchCoords,
\n-
2336 PATCH_TABLE *patchTable,
\n-
2337 int fvarChannel = 0,
\n-
2338 unsigned int numStartEvents=0,
\n-
2339 const cl_event* startEvents=NULL,
\n-
2340 cl_event* endEvent=NULL) const {
\n-
2341
\n-
2342 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
2346 numPatchCoords,
\n-
2347 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2351 numStartEvents, startEvents, endEvent);
\n-
2352 }
\n-
\n-
2353
\n-
2434 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2435 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n-
2436 typename DEVICE_CONTEXT>
\n-
\n-\n-
2438 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2439 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2440 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2441 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2442 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
2443 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
2444 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
2445 int numPatchCoords,
\n-
2446 PATCHCOORD_BUFFER *patchCoords,
\n-
2447 PATCH_TABLE *patchTable,
\n-
2448 int fvarChannel,
\n-
2449 CLEvaluator const *instance,
\n-
2450 DEVICE_CONTEXT deviceContext,
\n-
2451 unsigned int numStartEvents=0,
\n-
2452 const cl_event* startEvents=NULL,
\n-
2453 cl_event* endEvent=NULL) {
\n-
2454
\n-
2455 if (instance) {
\n-
2456 return instance->EvalPatchesFaceVarying(
\n-
2457 srcBuffer, srcDesc,
\n-
2458 dstBuffer, dstDesc,
\n-
2459 duBuffer, duDesc,
\n-
2460 dvBuffer, dvDesc,
\n-
2461 duuBuffer, duuDesc,
\n-
2462 duvBuffer, duvDesc,
\n-
2463 dvvBuffer, dvvDesc,
\n-
2464 numPatchCoords, patchCoords,
\n-
2465 patchTable, fvarChannel,
\n-
2466 numStartEvents, startEvents, endEvent);
\n-
2467 } else {
\n-
2468 // Create an instance on demand (slow)
\n-
2469 (void)deviceContext; // unused
\n-
2470 instance = Create(srcDesc, dstDesc,
\n-
2471 duDesc, dvDesc,
\n-
2472 duuDesc, duvDesc, dvvDesc,
\n-
2473 deviceContext);
\n-
2474 if (instance) {
\n-
2475 bool r = instance->EvalPatchesFaceVarying(
\n-
2476 srcBuffer, srcDesc,
\n-
2477 dstBuffer, dstDesc,
\n-
2478 duBuffer, duDesc,
\n-
2479 dvBuffer, dvDesc,
\n-
2480 duuBuffer, duuDesc,
\n-
2481 duvBuffer, duvDesc,
\n-
2482 dvvBuffer, dvvDesc,
\n-
2483 numPatchCoords, patchCoords,
\n-
2484 patchTable, fvarChannel,
\n-
2485 numStartEvents, startEvents, endEvent);
\n-
2486 delete instance;
\n-
2487 return r;
\n-
2488 }
\n-
2489 return false;
\n-
2490 }
\n-
2491 }
\n-
\n-
2492
\n-
2562 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2563 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2565 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2566 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2567 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2568 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2569 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
2570 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
2571 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
2572 int numPatchCoords,
\n-
2573 PATCHCOORD_BUFFER *patchCoords,
\n-
2574 PATCH_TABLE *patchTable,
\n-
2575 int fvarChannel = 0,
\n-
2576 unsigned int numStartEvents=0,
\n-
2577 const cl_event* startEvents=NULL,
\n-
2578 cl_event* endEvent=NULL) const {
\n-
2579
\n-
2580 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n-
2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n-
2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n-
2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n-
2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n-
2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n-
2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n-
2587 numPatchCoords,
\n-
2588 patchCoords->BindCLBuffer(_clCommandQueue),
\n-
2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n-
2592 numStartEvents, startEvents, endEvent);
\n-
2593 }
\n-
\n-
2594
\n-
2600
\n-
2603 bool Compile(BufferDescriptor const &srcDesc,
\n-
2604 BufferDescriptor const &dstDesc,
\n-
2605 BufferDescriptor const &duDesc = BufferDescriptor(),
\n-
2606 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n-
2607 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n-
2608 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n-
2609 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n-
2610
\n-
2612 template <typename DEVICE_CONTEXT>
\n-
\n-
2613 static void Synchronize(DEVICE_CONTEXT deviceContext) {
\n-
2614 Synchronize(deviceContext->GetCommandQueue());
\n-
2615 }
\n-
\n-
2616
\n-
2617 static void Synchronize(cl_command_queue queue);
\n-
2618
\n-
2619private:
\n-
2620 cl_context _clContext;
\n-
2621 cl_command_queue _clCommandQueue;
\n-
2622 cl_program _program;
\n-
2623 cl_kernel _stencilKernel;
\n-
2624 cl_kernel _stencilDerivKernel;
\n-
2625 cl_kernel _patchKernel;
\n-
2626};
\n-
\n-
2627
\n-
2628} // end namespace Osd
\n-
2629
\n-
2630} // end namespace OPENSUBDIV_VERSION
\n-
2631using namespace OPENSUBDIV_VERSION;
\n-
2632
\n-
2633} // end namespace OpenSubdiv
\n-
2634
\n-
2635
\n-
2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
30#include <cstddef>
\n+
31
\n+
32@protocol MTLDevice;
\n+
33@protocol MTLCommandQueue;
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n+
37
\n+
38namespace Osd {
\n+
39
\n+
\n+\n+
41public:
\n+
42 id<MTLDevice> device = nullptr;
\n+
43 id<MTLCommandQueue> commandQueue = nullptr;
\n+
44};
\n+
\n+
45
\n+
46} // end namespace Osd
\n+
47
\n+
48} // end namespace OPENSUBDIV_VERSION
\n+
49using namespace OPENSUBDIV_VERSION;
\n+
50
\n+
51} // end namespace OpenSubdiv
\n+
52
\n+
53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H
\n \n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-\n-
CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)
\n-\n-
static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:61
\n-\n-\n-\n-\n-\n-\n-\n-\n-
static CLStencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:55
\n-
CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
\n-\n-\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static void Synchronize(cl_command_queue queue)
\n-\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n-
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem duvWeights, cl_mem dvvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static void Synchronize(DEVICE_CONTEXT deviceContext)
Wait the OpenCL kernels finish.
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
CLEvaluator(cl_context context, cl_command_queue queue)
Constructor.
\n-
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-clEvaluator.h\n+mtlCommon.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,1553 +24,50 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H\n+26#define OPENSUBDIV3_OSD_MTL_COMMON_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/opencl.h\"\n-31#include \"../osd/types.h\"\n-32#include \"../osd/bufferDescriptor.h\"\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38 class PatchTable;\n-39 class StencilTable;\n-40 class LimitStencilTable;\n-41}\n-42\n-43namespace Osd {\n-44\n-_\b5_\b2class _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n-53public:\n-54 template \n-_\b5_\b5 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-56 DEVICE_CONTEXT context) {\n-57 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetContext());\n-58 }\n-59\n-60 template \n-_\b6_\b1 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(\n-62 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n-63 DEVICE_CONTEXT context) {\n-64 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable, context->GetContext());\n-65 }\n-66\n-_\b6_\b7 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-68 cl_context clContext);\n-_\b6_\b9 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n-70 cl_context clContext);\n-_\b7_\b1 _\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n-72\n-73 // interfaces needed for CLComputeKernel\n-_\b7_\b4 cl_mem _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n-_\b7_\b5 cl_mem _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n-_\b7_\b6 cl_mem _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n-_\b7_\b7 cl_mem _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n-_\b7_\b8 cl_mem _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n-_\b7_\b9 cl_mem _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n-_\b8_\b0 cl_mem _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n-_\b8_\b1 cl_mem _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n-_\b8_\b2 cl_mem _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n-_\b8_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n-84\n-85private:\n-86 cl_mem _sizes;\n-87 cl_mem _offsets;\n-88 cl_mem _indices;\n-89 cl_mem _weights;\n-90 cl_mem _duWeights;\n-91 cl_mem _dvWeights;\n-92 cl_mem _duuWeights;\n-93 cl_mem _duvWeights;\n-94 cl_mem _dvvWeights;\n-95 int _numStencils;\n-96};\n-97\n-98// --------------------------------------------------------------------------\n--\n-99\n-_\b1_\b0_\b0class _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-101public:\n-_\b1_\b0_\b2 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n-103\n-105 template \n-_\b1_\b0_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-110 DEVICE_CONTEXT deviceContext) {\n-111 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-112 deviceContext->GetContext(),\n-113 deviceContext->GetCommandQueue());\n-114 }\n-115\n-_\b1_\b1_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-118 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-119 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-120 cl_context clContext,\n-121 cl_command_queue clCommandQueue) {\n-122 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n-123 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc))\n-124 return instance;\n-125 delete instance;\n-126 return NULL;\n-127 }\n-128\n-130 template \n-_\b1_\b3_\b1 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-132 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-133 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-134 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-135 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-136 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-137 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-138 DEVICE_CONTEXT deviceContext) {\n-139 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-140 duuDesc, duvDesc, dvvDesc,\n-141 deviceContext->GetContext(),\n-142 deviceContext->GetCommandQueue());\n-143 }\n-144\n-_\b1_\b4_\b5 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-146 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-147 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-148 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-149 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-150 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-151 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-152 cl_context clContext,\n-153 cl_command_queue clCommandQueue) {\n-154 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n-155 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-156 duuDesc, duvDesc, dvvDesc))\n-157 return instance;\n-158 delete instance;\n-159 return NULL;\n-160 }\n-161\n-_\b1_\b6_\b3 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(cl_context context, cl_command_queue queue);\n-164\n-_\b1_\b6_\b6 _\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-167\n-173\n-217 template \n-_\b2_\b1_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-220 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-221 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-222 STENCIL_TABLE const *stencilTable,\n-223 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-224 DEVICE_CONTEXT deviceContext,\n-225 unsigned int numStartEvents=0,\n-226 const cl_event* startEvents=NULL,\n-227 cl_event* endEvent=NULL) {\n-228\n-229 if (instance) {\n-230 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-231 dstBuffer, dstDesc,\n-232 stencilTable,\n-233 numStartEvents, startEvents, endEvent);\n-234 } else {\n-235 // Create an instance on demand (slow)\n-236 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-237 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-238 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-239 deviceContext);\n-240 if (instance) {\n-241 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-242 dstBuffer, dstDesc,\n-243 stencilTable,\n-244 numStartEvents, startEvents, endEvent);\n-245 delete instance;\n-246 return r;\n-247 }\n-248 return false;\n-249 }\n-250 }\n-251\n-307 template \n-_\b3_\b0_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-310 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-311 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-312 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-313 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-314 STENCIL_TABLE const *stencilTable,\n-315 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-316 DEVICE_CONTEXT deviceContext,\n-317 unsigned int numStartEvents=0,\n-318 const cl_event* startEvents=NULL,\n-319 cl_event* endEvent=NULL) {\n-320\n-321 if (instance) {\n-322 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-323 dstBuffer, dstDesc,\n-324 duBuffer, duDesc,\n-325 dvBuffer, dvDesc,\n-326 stencilTable,\n-327 numStartEvents, startEvents, endEvent);\n-328 } else {\n-329 // Create an instance on demand (slow)\n-330 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-331 deviceContext);\n-332 if (instance) {\n-333 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-334 dstBuffer, dstDesc,\n-335 duBuffer, duDesc,\n-336 dvBuffer, dvDesc,\n-337 stencilTable,\n-338 numStartEvents, startEvents, endEvent);\n-339 delete instance;\n-340 return r;\n-341 }\n-342 return false;\n-343 }\n-344 }\n-345\n-419 template \n-_\b4_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-422 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-423 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-424 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-425 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-426 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-427 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-428 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-429 STENCIL_TABLE const *stencilTable,\n-430 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-431 DEVICE_CONTEXT deviceContext,\n-432 unsigned int numStartEvents=0,\n-433 const cl_event* startEvents=NULL,\n-434 cl_event* endEvent=NULL) {\n-435\n-436 if (instance) {\n-437 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-438 dstBuffer, dstDesc,\n-439 duBuffer, duDesc,\n-440 dvBuffer, dvDesc,\n-441 duuBuffer, duuDesc,\n-442 duvBuffer, duvDesc,\n-443 dvvBuffer, dvvDesc,\n-444 stencilTable,\n-445 numStartEvents, startEvents, endEvent);\n-446 } else {\n-447 // Create an instance on demand (slow)\n-448 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-449 duDesc, dvDesc,\n-450 duuDesc, duvDesc, dvvDesc,\n-451 deviceContext);\n-452 if (instance) {\n-453 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-454 dstBuffer, dstDesc,\n-455 duBuffer, duDesc,\n-456 dvBuffer, dvDesc,\n-457 duuBuffer, duuDesc,\n-458 duvBuffer, duvDesc,\n-459 dvvBuffer, dvvDesc,\n-460 stencilTable,\n-461 numStartEvents, startEvents, endEvent);\n-462 delete instance;\n-463 return r;\n-464 }\n-465 return false;\n-466 }\n-467 }\n-468\n-499 template \n-_\b5_\b0_\b0 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-501 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-502 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-503 STENCIL_TABLE const *stencilTable,\n-504 unsigned int numStartEvents=0,\n-505 const cl_event* startEvents=NULL,\n-506 cl_event* endEvent=NULL) const {\n-507 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-509 stencilTable->GetSizesBuffer(),\n-510 stencilTable->GetOffsetsBuffer(),\n-511 stencilTable->GetIndicesBuffer(),\n-512 stencilTable->GetWeightsBuffer(),\n-513 0,\n-514 stencilTable->GetNumStencils(),\n-515 numStartEvents, startEvents, endEvent);\n-516 }\n-517\n-560 template \n-_\b5_\b6_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-562 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-563 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-564 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-565 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-566 STENCIL_TABLE const *stencilTable,\n-567 unsigned int numStartEvents=0,\n-568 const cl_event* startEvents=NULL,\n-569 cl_event* endEvent=NULL) const {\n-570 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-574 stencilTable->GetSizesBuffer(),\n-575 stencilTable->GetOffsetsBuffer(),\n-576 stencilTable->GetIndicesBuffer(),\n-577 stencilTable->GetWeightsBuffer(),\n-578 stencilTable->GetDuWeightsBuffer(),\n-579 stencilTable->GetDvWeightsBuffer(),\n-580 0,\n-581 stencilTable->GetNumStencils(),\n-582 numStartEvents, startEvents, endEvent);\n-583 }\n-584\n-645 template \n-_\b6_\b4_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-647 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-648 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-649 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-650 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-651 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-652 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-653 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-654 STENCIL_TABLE const *stencilTable,\n-655 unsigned int numStartEvents=0,\n-656 const cl_event* startEvents=NULL,\n-657 cl_event* endEvent=NULL) const {\n-658 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-665 stencilTable->GetSizesBuffer(),\n-666 stencilTable->GetOffsetsBuffer(),\n-667 stencilTable->GetIndicesBuffer(),\n-668 stencilTable->GetWeightsBuffer(),\n-669 stencilTable->GetDuWeightsBuffer(),\n-670 stencilTable->GetDvWeightsBuffer(),\n-671 stencilTable->GetDuuWeightsBuffer(),\n-672 stencilTable->GetDuvWeightsBuffer(),\n-673 stencilTable->GetDvvWeightsBuffer(),\n-674 0,\n-675 stencilTable->GetNumStencils(),\n-676 numStartEvents, startEvents, endEvent);\n-677 }\n-678\n-_\b6_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-682 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-683 cl_mem sizes,\n-684 cl_mem offsets,\n-685 cl_mem indices,\n-686 cl_mem weights,\n-687 int start,\n-688 int end,\n-689 unsigned int numStartEvents=0,\n-690 const cl_event* startEvents=NULL,\n-691 cl_event* endEvent=NULL) const;\n-692\n-_\b7_\b4_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-742 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-743 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-744 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-745 cl_mem sizes,\n-746 cl_mem offsets,\n-747 cl_mem indices,\n-748 cl_mem weights,\n-749 cl_mem duWeights,\n-750 cl_mem dvWeights,\n-751 int start,\n-752 int end,\n-753 unsigned int numStartEvents=0,\n-754 const cl_event* startEvents=NULL,\n-755 cl_event* endEvent=NULL) const;\n-756\n-_\b8_\b2_\b3 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-824 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-825 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-826 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-827 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-828 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-829 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-830 cl_mem sizes,\n-831 cl_mem offsets,\n-832 cl_mem indices,\n-833 cl_mem weights,\n-834 cl_mem duWeights,\n-835 cl_mem dvWeights,\n-836 cl_mem duuWeights,\n-837 cl_mem duvWeights,\n-838 cl_mem dvvWeights,\n-839 int start,\n-840 int end,\n-841 unsigned int numStartEvents=0,\n-842 const cl_event* startEvents=NULL,\n-843 cl_event* endEvent=NULL) const;\n-844\n-850\n-899 template \n-_\b9_\b0_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-903 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-904 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-905 int numPatchCoords,\n-906 PATCHCOORD_BUFFER *patchCoords,\n-907 PATCH_TABLE *patchTable,\n-908 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-909 DEVICE_CONTEXT deviceContext,\n-910 unsigned int numStartEvents=0,\n-911 const cl_event* startEvents=NULL,\n-912 cl_event* endEvent=NULL) {\n-913\n-914 if (instance) {\n-915 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-916 dstBuffer, dstDesc,\n-917 numPatchCoords, patchCoords,\n-918 patchTable,\n-919 numStartEvents, startEvents, endEvent);\n-920 } else {\n-921 // Create an instance on demand (slow)\n-922 (void)deviceContext; // unused\n-923 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-924 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-925 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-926 deviceContext);\n-927 if (instance) {\n-928 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-929 dstBuffer, dstDesc,\n-930 numPatchCoords, patchCoords,\n-931 patchTable,\n-932 numStartEvents, startEvents, endEvent);\n-933 delete instance;\n-934 return r;\n-935 }\n-936 return false;\n-937 }\n-938 }\n-939\n-1000 template \n-_\b1_\b0_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1004 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1005 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1006 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1007 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1008 int numPatchCoords,\n-1009 PATCHCOORD_BUFFER *patchCoords,\n-1010 PATCH_TABLE *patchTable,\n-1011 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1012 DEVICE_CONTEXT deviceContext,\n-1013 unsigned int numStartEvents=0,\n-1014 const cl_event* startEvents=NULL,\n-1015 cl_event* endEvent=NULL) {\n-1016\n-1017 if (instance) {\n-1018 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1019 dstBuffer, dstDesc,\n-1020 duBuffer, duDesc,\n-1021 dvBuffer, dvDesc,\n-1022 numPatchCoords, patchCoords,\n-1023 patchTable,\n-1024 numStartEvents, startEvents, endEvent);\n-1025 } else {\n-1026 // Create an instance on demand (slow)\n-1027 (void)deviceContext; // unused\n-1028 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);\n-1029 if (instance) {\n-1030 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1031 dstBuffer, dstDesc,\n-1032 duBuffer, duDesc,\n-1033 dvBuffer, dvDesc,\n-1034 numPatchCoords, patchCoords,\n-1035 patchTable,\n-1036 numStartEvents, startEvents, endEvent);\n-1037 delete instance;\n-1038 return r;\n-1039 }\n-1040 return false;\n-1041 }\n-1042 }\n-1043\n-1122 template \n-_\b1_\b1_\b2_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1126 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1127 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1128 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1129 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1130 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1131 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1132 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1133 int numPatchCoords,\n-1134 PATCHCOORD_BUFFER *patchCoords,\n-1135 PATCH_TABLE *patchTable,\n-1136 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1137 DEVICE_CONTEXT deviceContext,\n-1138 unsigned int numStartEvents=0,\n-1139 const cl_event* startEvents=NULL,\n-1140 cl_event* endEvent=NULL) {\n-1141\n-1142 if (instance) {\n-1143 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1144 dstBuffer, dstDesc,\n-1145 duBuffer, duDesc,\n-1146 dvBuffer, dvDesc,\n-1147 duuBuffer, duuDesc,\n-1148 duvBuffer, duvDesc,\n-1149 dvvBuffer, dvvDesc,\n-1150 numPatchCoords, patchCoords,\n-1151 patchTable,\n-1152 numStartEvents, startEvents, endEvent);\n-1153 } else {\n-1154 // Create an instance on demand (slow)\n-1155 (void)deviceContext; // unused\n-1156 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1157 duDesc, dvDesc,\n-1158 duuDesc, duvDesc, dvvDesc,\n-1159 deviceContext);\n-1160 if (instance) {\n-1161 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-1162 dstBuffer, dstDesc,\n-1163 duBuffer, duDesc,\n-1164 dvBuffer, dvDesc,\n-1165 duuBuffer, duuDesc,\n-1166 duvBuffer, duvDesc,\n-1167 dvvBuffer, dvvDesc,\n-1168 numPatchCoords, patchCoords,\n-1169 patchTable,\n-1170 numStartEvents, startEvents, endEvent);\n-1171 delete instance;\n-1172 return r;\n-1173 }\n-1174 return false;\n-1175 }\n-1176 }\n-1177\n-1215 template \n-_\b1_\b2_\b1_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1218 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1219 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1220 int numPatchCoords,\n-1221 PATCHCOORD_BUFFER *patchCoords,\n-1222 PATCH_TABLE *patchTable,\n-1223 unsigned int numStartEvents=0,\n-1224 const cl_event* startEvents=NULL,\n-1225 cl_event* endEvent=NULL) const {\n-1226\n-1227 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1229 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1230 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1231 numPatchCoords,\n-1232 patchCoords->BindCLBuffer(_clCommandQueue),\n-1233 patchTable->GetPatchArrayBuffer(),\n-1234 patchTable->GetPatchIndexBuffer(),\n-1235 patchTable->GetPatchParamBuffer(),\n-1236 numStartEvents, startEvents, endEvent);\n-1237 }\n-1238\n-1286 template \n-_\b1_\b2_\b8_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1289 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1290 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1291 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1292 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1293 int numPatchCoords,\n-1294 PATCHCOORD_BUFFER *patchCoords,\n-1295 PATCH_TABLE *patchTable,\n-1296 unsigned int numStartEvents=0,\n-1297 const cl_event* startEvents=NULL,\n-1298 cl_event* endEvent=NULL) const {\n-1299\n-1300 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1304 numPatchCoords,\n-1305 patchCoords->BindCLBuffer(_clCommandQueue),\n-1306 patchTable->GetPatchArrayBuffer(),\n-1307 patchTable->GetPatchIndexBuffer(),\n-1308 patchTable->GetPatchParamBuffer(),\n-1309 numStartEvents, startEvents, endEvent);\n-1310 }\n-1311\n-1377 template \n-_\b1_\b3_\b7_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1380 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1381 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1382 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1383 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1384 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1385 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1386 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1387 int numPatchCoords,\n-1388 PATCHCOORD_BUFFER *patchCoords,\n-1389 PATCH_TABLE *patchTable,\n-1390 unsigned int numStartEvents=0,\n-1391 const cl_event* startEvents=NULL,\n-1392 cl_event* endEvent=NULL) const {\n-1393\n-1394 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-1401 numPatchCoords,\n-1402 patchCoords->BindCLBuffer(_clCommandQueue),\n-1403 patchTable->GetPatchArrayBuffer(),\n-1404 patchTable->GetPatchIndexBuffer(),\n-1405 patchTable->GetPatchParamBuffer(),\n-1406 numStartEvents, startEvents, endEvent);\n-1407 }\n-1408\n-_\b1_\b4_\b0_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1410 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1411 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1412 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1413 int numPatchCoords,\n-1414 cl_mem patchCoordsBuffer,\n-1415 cl_mem patchArrayBuffer,\n-1416 cl_mem patchIndexBuffer,\n-1417 cl_mem patchParamsBuffer,\n-1418 unsigned int numStartEvents=0,\n-1419 const cl_event* startEvents=NULL,\n-1420 cl_event* endEvent=NULL) const;\n-1421\n-_\b1_\b4_\b2_\b2 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1423 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1424 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1425 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1426 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1427 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1428 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1429 int numPatchCoords,\n-1430 cl_mem patchCoordsBuffer,\n-1431 cl_mem patchArrayBuffer,\n-1432 cl_mem patchIndexBuffer,\n-1433 cl_mem patchParamsBuffer,\n-1434 unsigned int numStartEvents=0,\n-1435 const cl_event* startEvents=NULL,\n-1436 cl_event* endEvent=NULL) const;\n-1437\n-1486 template \n-_\b1_\b4_\b8_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1490 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1491 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1492 int numPatchCoords,\n-1493 PATCHCOORD_BUFFER *patchCoords,\n-1494 PATCH_TABLE *patchTable,\n-1495 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1496 DEVICE_CONTEXT deviceContext,\n-1497 unsigned int numStartEvents=0,\n-1498 const cl_event* startEvents=NULL,\n-1499 cl_event* endEvent=NULL) {\n-1500\n-1501 if (instance) {\n-1502 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1503 srcBuffer, srcDesc,\n-1504 dstBuffer, dstDesc,\n-1505 numPatchCoords, patchCoords,\n-1506 patchTable,\n-1507 numStartEvents, startEvents, endEvent);\n-1508 } else {\n-1509 // Create an instance on demand (slow)\n-1510 (void)deviceContext; // unused\n-1511 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1512 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1513 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1514 deviceContext);\n-1515 if (instance) {\n-1516 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1517 srcBuffer, srcDesc,\n-1518 dstBuffer, dstDesc,\n-1519 numPatchCoords, patchCoords,\n-1520 patchTable,\n-1521 numStartEvents, startEvents, endEvent);\n-1522 delete instance;\n-1523 return r;\n-1524 }\n-1525 return false;\n-1526 }\n-1527 }\n-1528\n-1566 template \n-_\b1_\b5_\b6_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1569 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1570 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1571 int numPatchCoords,\n-1572 PATCHCOORD_BUFFER *patchCoords,\n-1573 PATCH_TABLE *patchTable,\n-1574 unsigned int numStartEvents=0,\n-1575 const cl_event* startEvents=NULL,\n-1576 cl_event* endEvent=NULL) const {\n-1577\n-1578 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1580 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1581 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1582 numPatchCoords,\n-1583 patchCoords->BindCLBuffer(_clCommandQueue),\n-1584 patchTable->GetVaryingPatchArrayBuffer(),\n-1585 patchTable->GetVaryingPatchIndexBuffer(),\n-1586 patchTable->GetPatchParamBuffer(),\n-1587 numStartEvents, startEvents, endEvent);\n-1588 }\n-1589\n-1650 template \n-_\b1_\b6_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1654 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1655 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1656 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1657 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1658 int numPatchCoords,\n-1659 PATCHCOORD_BUFFER *patchCoords,\n-1660 PATCH_TABLE *patchTable,\n-1661 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1662 DEVICE_CONTEXT deviceContext,\n-1663 unsigned int numStartEvents=0,\n-1664 const cl_event* startEvents=NULL,\n-1665 cl_event* endEvent=NULL) {\n-1666\n-1667 if (instance) {\n-1668 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1669 srcBuffer, srcDesc,\n-1670 dstBuffer, dstDesc,\n-1671 duBuffer, duDesc,\n-1672 dvBuffer, dvDesc,\n-1673 numPatchCoords, patchCoords,\n-1674 patchTable,\n-1675 numStartEvents, startEvents, endEvent);\n-1676 } else {\n-1677 // Create an instance on demand (slow)\n-1678 (void)deviceContext; // unused\n-1679 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1680 duDesc, dvDesc,\n-1681 deviceContext);\n-1682 if (instance) {\n-1683 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1684 srcBuffer, srcDesc,\n-1685 dstBuffer, dstDesc,\n-1686 duBuffer, duDesc,\n-1687 dvBuffer, dvDesc,\n-1688 numPatchCoords, patchCoords,\n-1689 patchTable,\n-1690 numStartEvents, startEvents, endEvent);\n-1691 delete instance;\n-1692 return r;\n-1693 }\n-1694 return false;\n-1695 }\n-1696 }\n-1697\n-1747 template \n-_\b1_\b7_\b4_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1750 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1751 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1752 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1753 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1754 int numPatchCoords,\n-1755 PATCHCOORD_BUFFER *patchCoords,\n-1756 PATCH_TABLE *patchTable,\n-1757 unsigned int numStartEvents=0,\n-1758 const cl_event* startEvents=NULL,\n-1759 cl_event* endEvent=NULL) const {\n-1760\n-1761 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1765 numPatchCoords,\n-1766 patchCoords->BindCLBuffer(_clCommandQueue),\n-1767 patchTable->GetVaryingPatchArrayBuffer(),\n-1768 patchTable->GetVaryingPatchIndexBuffer(),\n-1769 patchTable->GetPatchParamBuffer(),\n-1770 numStartEvents, startEvents, endEvent);\n-1771 }\n-1772\n-1851 template \n-_\b1_\b8_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1855 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1856 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1857 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1858 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1859 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1860 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1861 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1862 int numPatchCoords,\n-1863 PATCHCOORD_BUFFER *patchCoords,\n-1864 PATCH_TABLE *patchTable,\n-1865 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1866 DEVICE_CONTEXT deviceContext,\n-1867 unsigned int numStartEvents=0,\n-1868 const cl_event* startEvents=NULL,\n-1869 cl_event* endEvent=NULL) {\n-1870\n-1871 if (instance) {\n-1872 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1873 srcBuffer, srcDesc,\n-1874 dstBuffer, dstDesc,\n-1875 duBuffer, duDesc,\n-1876 dvBuffer, dvDesc,\n-1877 duuBuffer, duuDesc,\n-1878 duvBuffer, duvDesc,\n-1879 dvvBuffer, dvvDesc,\n-1880 numPatchCoords, patchCoords,\n-1881 patchTable,\n-1882 numStartEvents, startEvents, endEvent);\n-1883 } else {\n-1884 // Create an instance on demand (slow)\n-1885 (void)deviceContext; // unused\n-1886 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1887 duDesc, dvDesc,\n-1888 duuDesc, duvDesc, dvvDesc,\n-1889 deviceContext);\n-1890 if (instance) {\n-1891 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1892 srcBuffer, srcDesc,\n-1893 dstBuffer, dstDesc,\n-1894 duBuffer, duDesc,\n-1895 dvBuffer, dvDesc,\n-1896 duuBuffer, duuDesc,\n-1897 duvBuffer, duvDesc,\n-1898 dvvBuffer, dvvDesc,\n-1899 numPatchCoords, patchCoords,\n-1900 patchTable,\n-1901 numStartEvents, startEvents, endEvent);\n-1902 delete instance;\n-1903 return r;\n-1904 }\n-1905 return false;\n-1906 }\n-1907 }\n-1908\n-1976 template \n-_\b1_\b9_\b7_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1979 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1980 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1981 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1982 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1983 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1984 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1985 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1986 int numPatchCoords,\n-1987 PATCHCOORD_BUFFER *patchCoords,\n-1988 PATCH_TABLE *patchTable,\n-1989 unsigned int numStartEvents=0,\n-1990 const cl_event* startEvents=NULL,\n-1991 cl_event* endEvent=NULL) const {\n-1992\n-1993 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-2000 numPatchCoords,\n-2001 patchCoords->BindCLBuffer(_clCommandQueue),\n-2002 patchTable->GetVaryingPatchArrayBuffer(),\n-2003 patchTable->GetVaryingPatchIndexBuffer(),\n-2004 patchTable->GetPatchParamBuffer(),\n-2005 numStartEvents, startEvents, endEvent);\n-2006 }\n-2007\n-2058 template \n-_\b2_\b0_\b6_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2062 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2063 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2064 int numPatchCoords,\n-2065 PATCHCOORD_BUFFER *patchCoords,\n-2066 PATCH_TABLE *patchTable,\n-2067 int fvarChannel,\n-2068 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2069 DEVICE_CONTEXT deviceContext,\n-2070 unsigned int numStartEvents=0,\n-2071 const cl_event* startEvents=NULL,\n-2072 cl_event* endEvent=NULL) {\n-2073\n-2074 if (instance) {\n-2075 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2076 srcBuffer, srcDesc,\n-2077 dstBuffer, dstDesc,\n-2078 numPatchCoords, patchCoords,\n-2079 patchTable, fvarChannel,\n-2080 numStartEvents, startEvents, endEvent);\n-2081 } else {\n-2082 // Create an instance on demand (slow)\n-2083 (void)deviceContext; // unused\n-2084 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2087 deviceContext);\n-2088 if (instance) {\n-2089 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2090 srcBuffer, srcDesc,\n-2091 dstBuffer, dstDesc,\n-2092 numPatchCoords, patchCoords,\n-2093 patchTable, fvarChannel,\n-2094 numStartEvents, startEvents, endEvent);\n-2095 delete instance;\n-2096 return r;\n-2097 }\n-2098 return false;\n-2099 }\n-2100 }\n-2101\n-2141 template \n-_\b2_\b1_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2144 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2145 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2146 int numPatchCoords,\n-2147 PATCHCOORD_BUFFER *patchCoords,\n-2148 PATCH_TABLE *patchTable,\n-2149 int fvarChannel = 0,\n-2150 unsigned int numStartEvents=0,\n-2151 const cl_event* startEvents=NULL,\n-2152 cl_event* endEvent=NULL) const {\n-2153\n-2154 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2156 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2157 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2158 numPatchCoords,\n-2159 patchCoords->BindCLBuffer(_clCommandQueue),\n-2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2163 numStartEvents, startEvents, endEvent);\n-2164 }\n-2165\n-2228 template \n-_\b2_\b2_\b3_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2232 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2233 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2234 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2235 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2236 int numPatchCoords,\n-2237 PATCHCOORD_BUFFER *patchCoords,\n-2238 PATCH_TABLE *patchTable,\n-2239 int fvarChannel,\n-2240 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2241 DEVICE_CONTEXT deviceContext,\n-2242 unsigned int numStartEvents=0,\n-2243 const cl_event* startEvents=NULL,\n-2244 cl_event* endEvent=NULL) {\n-2245\n-2246 if (instance) {\n-2247 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2248 srcBuffer, srcDesc,\n-2249 dstBuffer, dstDesc,\n-2250 duBuffer, duDesc,\n-2251 dvBuffer, dvDesc,\n-2252 numPatchCoords, patchCoords,\n-2253 patchTable, fvarChannel,\n-2254 numStartEvents, startEvents, endEvent);\n-2255 } else {\n-2256 // Create an instance on demand (slow)\n-2257 (void)deviceContext; // unused\n-2258 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2259 duDesc, dvDesc, deviceContext);\n-2260 if (instance) {\n-2261 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2262 srcBuffer, srcDesc,\n-2263 dstBuffer, dstDesc,\n-2264 duBuffer, duDesc,\n-2265 dvBuffer, dvDesc,\n-2266 numPatchCoords, patchCoords,\n-2267 patchTable, fvarChannel,\n-2268 numStartEvents, startEvents, endEvent);\n-2269 delete instance;\n-2270 return r;\n-2271 }\n-2272 return false;\n-2273 }\n-2274 }\n-2275\n-2327 template \n-_\b2_\b3_\b2_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2330 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2331 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2332 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2333 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2334 int numPatchCoords,\n-2335 PATCHCOORD_BUFFER *patchCoords,\n-2336 PATCH_TABLE *patchTable,\n-2337 int fvarChannel = 0,\n-2338 unsigned int numStartEvents=0,\n-2339 const cl_event* startEvents=NULL,\n-2340 cl_event* endEvent=NULL) const {\n-2341\n-2342 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-2346 numPatchCoords,\n-2347 patchCoords->BindCLBuffer(_clCommandQueue),\n-2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2351 numStartEvents, startEvents, endEvent);\n-2352 }\n-2353\n-2434 template \n-_\b2_\b4_\b3_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2438 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2439 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2440 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2441 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2442 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2443 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2444 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2445 int numPatchCoords,\n-2446 PATCHCOORD_BUFFER *patchCoords,\n-2447 PATCH_TABLE *patchTable,\n-2448 int fvarChannel,\n-2449 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-2450 DEVICE_CONTEXT deviceContext,\n-2451 unsigned int numStartEvents=0,\n-2452 const cl_event* startEvents=NULL,\n-2453 cl_event* endEvent=NULL) {\n-2454\n-2455 if (instance) {\n-2456 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2457 srcBuffer, srcDesc,\n-2458 dstBuffer, dstDesc,\n-2459 duBuffer, duDesc,\n-2460 dvBuffer, dvDesc,\n-2461 duuBuffer, duuDesc,\n-2462 duvBuffer, duvDesc,\n-2463 dvvBuffer, dvvDesc,\n-2464 numPatchCoords, patchCoords,\n-2465 patchTable, fvarChannel,\n-2466 numStartEvents, startEvents, endEvent);\n-2467 } else {\n-2468 // Create an instance on demand (slow)\n-2469 (void)deviceContext; // unused\n-2470 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-2471 duDesc, dvDesc,\n-2472 duuDesc, duvDesc, dvvDesc,\n-2473 deviceContext);\n-2474 if (instance) {\n-2475 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2476 srcBuffer, srcDesc,\n-2477 dstBuffer, dstDesc,\n-2478 duBuffer, duDesc,\n-2479 dvBuffer, dvDesc,\n-2480 duuBuffer, duuDesc,\n-2481 duvBuffer, duvDesc,\n-2482 dvvBuffer, dvvDesc,\n-2483 numPatchCoords, patchCoords,\n-2484 patchTable, fvarChannel,\n-2485 numStartEvents, startEvents, endEvent);\n-2486 delete instance;\n-2487 return r;\n-2488 }\n-2489 return false;\n-2490 }\n-2491 }\n-2492\n-2562 template \n-_\b2_\b5_\b6_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2565 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2566 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2567 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2568 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2569 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2570 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2571 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2572 int numPatchCoords,\n-2573 PATCHCOORD_BUFFER *patchCoords,\n-2574 PATCH_TABLE *patchTable,\n-2575 int fvarChannel = 0,\n-2576 unsigned int numStartEvents=0,\n-2577 const cl_event* startEvents=NULL,\n-2578 cl_event* endEvent=NULL) const {\n-2579\n-2580 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n-2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n-2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n-2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n-2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n-2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n-2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n-2587 numPatchCoords,\n-2588 patchCoords->BindCLBuffer(_clCommandQueue),\n-2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n-2592 numStartEvents, startEvents, endEvent);\n-2593 }\n-2594\n-2600\n-_\b2_\b6_\b0_\b3 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2604 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2605 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2606 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2607 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2608 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2609 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-2610\n-2612 template \n-_\b2_\b6_\b1_\b3 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(DEVICE_CONTEXT deviceContext) {\n-2614 _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(deviceContext->GetCommandQueue());\n-2615 }\n-2616\n-_\b2_\b6_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(cl_command_queue queue);\n-2618\n-2619private:\n-2620 cl_context _clContext;\n-2621 cl_command_queue _clCommandQueue;\n-2622 cl_program _program;\n-2623 cl_kernel _stencilKernel;\n-2624 cl_kernel _stencilDerivKernel;\n-2625 cl_kernel _patchKernel;\n-2626};\n-2627\n-2628} // end namespace Osd\n-2629\n-2630} // end namespace OPENSUBDIV_VERSION\n-2631using namespace OPENSUBDIV_VERSION;\n-2632\n-2633} // end namespace OpenSubdiv\n-2634\n-2635\n-2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+30#include \n+31\n+32@protocol MTLDevice;\n+33@protocol MTLCommandQueue;\n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n+37\n+38namespace Osd {\n+39\n+_\b4_\b0class _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt {\n+41public:\n+_\b4_\b2 id _\bd_\be_\bv_\bi_\bc_\be = nullptr;\n+_\b4_\b3 id _\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be = nullptr;\n+44};\n+45\n+46} // end namespace Osd\n+47\n+48} // end namespace OPENSUBDIV_VERSION\n+49using namespace OPENSUBDIV_VERSION;\n+50\n+51} // end namespace OpenSubdiv\n+52\n+53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor is a struct which describes buffer elements in interleaved\n-data buffers....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-OpenCL stencil table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDvvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetOffsetsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetIndicesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetSizesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetDuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-~CLStencilTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLStencilTable * Create(Far::StencilTable const *stencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context\n-clContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-cl_mem GetWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator\n-const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0,\n-const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(cl_command_queue queue)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-~CLEvaluator()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem\n-indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int\n-end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Dispatch the CL compute kernel asynchronously. returns false if the kernel\n-hasn't been compiled yet.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-cl_context clContext, cl_command_queue clCommandQueue)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b2_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem\n-patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem\n-patchParamsBuffer, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0,\n-const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n-bool Instantiatable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-DEVICE_CONTEXT deviceContext)\n-Generic creator template.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n-BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)\n-Generic creator template.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n-&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer,\n-cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n-cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n-&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n-BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n-cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem\n-duvWeights, cl_mem dvvWeights, int start, int end, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Dispatch the CL compute kernel asynchronously. returns false if the kernel\n-hasn't been compiled yet.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b5_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned\n-int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n-DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(DEVICE_CONTEXT deviceContext)\n-Wait the OpenCL kernels finish.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b6_\b1_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n-DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n-*startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b2_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n-BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n-cl_mem weights, int start, int end, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b2_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b4_\b3_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n-const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n-BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n-BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue\n-clCommandQueue)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n-unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n-*endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n-numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n-*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n-cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n-*stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-CLEvaluator(cl_context context, cl_command_queue queue)\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n-bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n-BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n-&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n-BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n-&dvvDesc=BufferDescriptor())\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n-cl_event *endEvent=NULL) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be\n+id< MTLCommandQueue > commandQueue\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bd_\be_\bv_\bi_\bc_\be\n+id< MTLDevice > device\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b2\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlCommon.h File Reference\n+OpenSubdiv: opensubdiv/osd/clEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,40 +90,47 @@\n \n \n \n
\n \n-
mtlCommon.h File Reference
\n+
clEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include <cstddef>
\n+#include "../osd/opencl.h"
\n+#include "../osd/types.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n+\n+\n+\n+\n \n

\n Classes

class  MTLContext
class  CLStencilTable
 OpenCL stencil table. More...
 
class  CLEvaluator
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,23 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlCommon.h File Reference\n+clEvaluator.h File Reference\n #include \"../version.h\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bc_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n+class \u00a0 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 OpenCL stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n+ * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00806 = [\n- [\"MTLContext\", \"a01285.html\", \"a01285\"]\n+ [\"CLStencilTable\", \"a01145.html\", \"a01145\"],\n+ [\"CLEvaluator\", \"a01149.html\", \"a01149\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00806_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00806_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlCommon.h Source File\n+OpenSubdiv: opensubdiv/osd/clEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlCommon.h
\n+
clEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,53 +119,1283 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H
\n-
26#define OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include <cstddef>
\n-
31
\n-
32@protocol MTLDevice;
\n-
33@protocol MTLCommandQueue;
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Osd {
\n-
39
\n-
\n-\n-
41public:
\n-
42 id<MTLDevice> device = nullptr;
\n-
43 id<MTLCommandQueue> commandQueue = nullptr;
\n-
44};
\n-
\n-
45
\n-
46} // end namespace Osd
\n-
47
\n-
48} // end namespace OPENSUBDIV_VERSION
\n-
49using namespace OPENSUBDIV_VERSION;
\n-
50
\n-
51} // end namespace OpenSubdiv
\n-
52
\n-
53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H
\n+
30#include "../osd/opencl.h"
\n+
31#include "../osd/types.h"
\n+
32#include "../osd/bufferDescriptor.h"
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38 class PatchTable;
\n+
39 class StencilTable;
\n+
40 class LimitStencilTable;
\n+
41}
\n+
42
\n+
43namespace Osd {
\n+
44
\n+
\n+\n+
53public:
\n+
54 template <typename DEVICE_CONTEXT>
\n+
\n+
55 static CLStencilTable *Create(Far::StencilTable const *stencilTable,
\n+
56 DEVICE_CONTEXT context) {
\n+
57 return new CLStencilTable(stencilTable, context->GetContext());
\n+
58 }
\n+
\n+
59
\n+
60 template <typename DEVICE_CONTEXT>
\n+
\n+\n+
62 Far::LimitStencilTable const *limitStencilTable,
\n+
63 DEVICE_CONTEXT context) {
\n+
64 return new CLStencilTable(limitStencilTable, context->GetContext());
\n+
65 }
\n+
\n+
66
\n+
67 CLStencilTable(Far::StencilTable const *stencilTable,
\n+
68 cl_context clContext);
\n+
69 CLStencilTable(Far::LimitStencilTable const *limitStencilTable,
\n+
70 cl_context clContext);
\n+\n+
72
\n+
73 // interfaces needed for CLComputeKernel
\n+
74 cl_mem GetSizesBuffer() const { return _sizes; }
\n+
75 cl_mem GetOffsetsBuffer() const { return _offsets; }
\n+
76 cl_mem GetIndicesBuffer() const { return _indices; }
\n+
77 cl_mem GetWeightsBuffer() const { return _weights; }
\n+
78 cl_mem GetDuWeightsBuffer() const { return _duWeights; }
\n+
79 cl_mem GetDvWeightsBuffer() const { return _dvWeights; }
\n+
80 cl_mem GetDuuWeightsBuffer() const { return _duuWeights; }
\n+
81 cl_mem GetDuvWeightsBuffer() const { return _duvWeights; }
\n+
82 cl_mem GetDvvWeightsBuffer() const { return _dvvWeights; }
\n+
83 int GetNumStencils() const { return _numStencils; }
\n+
84
\n+
85private:
\n+
86 cl_mem _sizes;
\n+
87 cl_mem _offsets;
\n+
88 cl_mem _indices;
\n+
89 cl_mem _weights;
\n+
90 cl_mem _duWeights;
\n+
91 cl_mem _dvWeights;
\n+
92 cl_mem _duuWeights;
\n+
93 cl_mem _duvWeights;
\n+
94 cl_mem _dvvWeights;
\n+
95 int _numStencils;
\n+
96};
\n+
\n+
97
\n+
98// ---------------------------------------------------------------------------
\n+
99
\n+
\n+\n+
101public:
\n+
102 typedef bool Instantiatable;
\n+
103
\n+
105 template <typename DEVICE_CONTEXT>
\n+
\n+
106 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n+
107 BufferDescriptor const &dstDesc,
\n+
108 BufferDescriptor const &duDesc,
\n+
109 BufferDescriptor const &dvDesc,
\n+
110 DEVICE_CONTEXT deviceContext) {
\n+
111 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
112 deviceContext->GetContext(),
\n+
113 deviceContext->GetCommandQueue());
\n+
114 }
\n+
\n+
115
\n+
\n+
116 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n+
117 BufferDescriptor const &dstDesc,
\n+
118 BufferDescriptor const &duDesc,
\n+
119 BufferDescriptor const &dvDesc,
\n+
120 cl_context clContext,
\n+
121 cl_command_queue clCommandQueue) {
\n+
122 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n+
123 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc))
\n+
124 return instance;
\n+
125 delete instance;
\n+
126 return NULL;
\n+
127 }
\n+
\n+
128
\n+
130 template <typename DEVICE_CONTEXT>
\n+
\n+
131 static CLEvaluator *Create(BufferDescriptor const &srcDesc,
\n+
132 BufferDescriptor const &dstDesc,
\n+
133 BufferDescriptor const &duDesc,
\n+
134 BufferDescriptor const &dvDesc,
\n+
135 BufferDescriptor const &duuDesc,
\n+
136 BufferDescriptor const &duvDesc,
\n+
137 BufferDescriptor const &dvvDesc,
\n+
138 DEVICE_CONTEXT deviceContext) {
\n+
139 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
140 duuDesc, duvDesc, dvvDesc,
\n+
141 deviceContext->GetContext(),
\n+
142 deviceContext->GetCommandQueue());
\n+
143 }
\n+
\n+
144
\n+
\n+
145 static CLEvaluator * Create(BufferDescriptor const &srcDesc,
\n+
146 BufferDescriptor const &dstDesc,
\n+
147 BufferDescriptor const &duDesc,
\n+
148 BufferDescriptor const &dvDesc,
\n+
149 BufferDescriptor const &duuDesc,
\n+
150 BufferDescriptor const &duvDesc,
\n+
151 BufferDescriptor const &dvvDesc,
\n+
152 cl_context clContext,
\n+
153 cl_command_queue clCommandQueue) {
\n+
154 CLEvaluator *instance = new CLEvaluator(clContext, clCommandQueue);
\n+
155 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n+
156 duuDesc, duvDesc, dvvDesc))
\n+
157 return instance;
\n+
158 delete instance;
\n+
159 return NULL;
\n+
160 }
\n+
\n+
161
\n+
163 CLEvaluator(cl_context context, cl_command_queue queue);
\n+
164
\n+\n+
167
\n+
173
\n+
217 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
218 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
219 static bool EvalStencils(
\n+
220 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
221 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
222 STENCIL_TABLE const *stencilTable,
\n+
223 CLEvaluator const *instance,
\n+
224 DEVICE_CONTEXT deviceContext,
\n+
225 unsigned int numStartEvents=0,
\n+
226 const cl_event* startEvents=NULL,
\n+
227 cl_event* endEvent=NULL) {
\n+
228
\n+
229 if (instance) {
\n+
230 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
231 dstBuffer, dstDesc,
\n+
232 stencilTable,
\n+
233 numStartEvents, startEvents, endEvent);
\n+
234 } else {
\n+
235 // Create an instance on demand (slow)
\n+
236 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
239 deviceContext);
\n+
240 if (instance) {
\n+
241 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
242 dstBuffer, dstDesc,
\n+
243 stencilTable,
\n+
244 numStartEvents, startEvents, endEvent);
\n+
245 delete instance;
\n+
246 return r;
\n+
247 }
\n+
248 return false;
\n+
249 }
\n+
250 }
\n+
\n+
251
\n+
307 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
308 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
309 static bool EvalStencils(
\n+
310 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
311 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
312 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
313 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
314 STENCIL_TABLE const *stencilTable,
\n+
315 CLEvaluator const *instance,
\n+
316 DEVICE_CONTEXT deviceContext,
\n+
317 unsigned int numStartEvents=0,
\n+
318 const cl_event* startEvents=NULL,
\n+
319 cl_event* endEvent=NULL) {
\n+
320
\n+
321 if (instance) {
\n+
322 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
323 dstBuffer, dstDesc,
\n+
324 duBuffer, duDesc,
\n+
325 dvBuffer, dvDesc,
\n+
326 stencilTable,
\n+
327 numStartEvents, startEvents, endEvent);
\n+
328 } else {
\n+
329 // Create an instance on demand (slow)
\n+
330 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
331 deviceContext);
\n+
332 if (instance) {
\n+
333 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
334 dstBuffer, dstDesc,
\n+
335 duBuffer, duDesc,
\n+
336 dvBuffer, dvDesc,
\n+
337 stencilTable,
\n+
338 numStartEvents, startEvents, endEvent);
\n+
339 delete instance;
\n+
340 return r;
\n+
341 }
\n+
342 return false;
\n+
343 }
\n+
344 }
\n+
\n+
345
\n+
419 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
420 typename STENCIL_TABLE, typename DEVICE_CONTEXT>
\n+
\n+
421 static bool EvalStencils(
\n+
422 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
423 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
424 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
425 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
426 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
427 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
428 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
429 STENCIL_TABLE const *stencilTable,
\n+
430 CLEvaluator const *instance,
\n+
431 DEVICE_CONTEXT deviceContext,
\n+
432 unsigned int numStartEvents=0,
\n+
433 const cl_event* startEvents=NULL,
\n+
434 cl_event* endEvent=NULL) {
\n+
435
\n+
436 if (instance) {
\n+
437 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
438 dstBuffer, dstDesc,
\n+
439 duBuffer, duDesc,
\n+
440 dvBuffer, dvDesc,
\n+
441 duuBuffer, duuDesc,
\n+
442 duvBuffer, duvDesc,
\n+
443 dvvBuffer, dvvDesc,
\n+
444 stencilTable,
\n+
445 numStartEvents, startEvents, endEvent);
\n+
446 } else {
\n+
447 // Create an instance on demand (slow)
\n+
448 instance = Create(srcDesc, dstDesc,
\n+
449 duDesc, dvDesc,
\n+
450 duuDesc, duvDesc, dvvDesc,
\n+
451 deviceContext);
\n+
452 if (instance) {
\n+
453 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
454 dstBuffer, dstDesc,
\n+
455 duBuffer, duDesc,
\n+
456 dvBuffer, dvDesc,
\n+
457 duuBuffer, duuDesc,
\n+
458 duvBuffer, duvDesc,
\n+
459 dvvBuffer, dvvDesc,
\n+
460 stencilTable,
\n+
461 numStartEvents, startEvents, endEvent);
\n+
462 delete instance;
\n+
463 return r;
\n+
464 }
\n+
465 return false;
\n+
466 }
\n+
467 }
\n+
\n+
468
\n+
499 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
501 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
502 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
503 STENCIL_TABLE const *stencilTable,
\n+
504 unsigned int numStartEvents=0,
\n+
505 const cl_event* startEvents=NULL,
\n+
506 cl_event* endEvent=NULL) const {
\n+
507 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
509 stencilTable->GetSizesBuffer(),
\n+
510 stencilTable->GetOffsetsBuffer(),
\n+
511 stencilTable->GetIndicesBuffer(),
\n+
512 stencilTable->GetWeightsBuffer(),
\n+
513 0,
\n+
514 stencilTable->GetNumStencils(),
\n+
515 numStartEvents, startEvents, endEvent);
\n+
516 }
\n+
\n+
517
\n+
560 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
562 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
563 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
564 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
565 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
566 STENCIL_TABLE const *stencilTable,
\n+
567 unsigned int numStartEvents=0,
\n+
568 const cl_event* startEvents=NULL,
\n+
569 cl_event* endEvent=NULL) const {
\n+
570 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
574 stencilTable->GetSizesBuffer(),
\n+
575 stencilTable->GetOffsetsBuffer(),
\n+
576 stencilTable->GetIndicesBuffer(),
\n+
577 stencilTable->GetWeightsBuffer(),
\n+
578 stencilTable->GetDuWeightsBuffer(),
\n+
579 stencilTable->GetDvWeightsBuffer(),
\n+
580 0,
\n+
581 stencilTable->GetNumStencils(),
\n+
582 numStartEvents, startEvents, endEvent);
\n+
583 }
\n+
\n+
584
\n+
645 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
647 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
648 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
649 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
650 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
651 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
652 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
653 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
654 STENCIL_TABLE const *stencilTable,
\n+
655 unsigned int numStartEvents=0,
\n+
656 const cl_event* startEvents=NULL,
\n+
657 cl_event* endEvent=NULL) const {
\n+
658 return EvalStencils(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
665 stencilTable->GetSizesBuffer(),
\n+
666 stencilTable->GetOffsetsBuffer(),
\n+
667 stencilTable->GetIndicesBuffer(),
\n+
668 stencilTable->GetWeightsBuffer(),
\n+
669 stencilTable->GetDuWeightsBuffer(),
\n+
670 stencilTable->GetDvWeightsBuffer(),
\n+
671 stencilTable->GetDuuWeightsBuffer(),
\n+
672 stencilTable->GetDuvWeightsBuffer(),
\n+
673 stencilTable->GetDvvWeightsBuffer(),
\n+
674 0,
\n+
675 stencilTable->GetNumStencils(),
\n+
676 numStartEvents, startEvents, endEvent);
\n+
677 }
\n+
\n+
678
\n+
681 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
682 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
683 cl_mem sizes,
\n+
684 cl_mem offsets,
\n+
685 cl_mem indices,
\n+
686 cl_mem weights,
\n+
687 int start,
\n+
688 int end,
\n+
689 unsigned int numStartEvents=0,
\n+
690 const cl_event* startEvents=NULL,
\n+
691 cl_event* endEvent=NULL) const;
\n+
692
\n+
741 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
742 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
743 cl_mem du, BufferDescriptor const &duDesc,
\n+
744 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
745 cl_mem sizes,
\n+
746 cl_mem offsets,
\n+
747 cl_mem indices,
\n+
748 cl_mem weights,
\n+
749 cl_mem duWeights,
\n+
750 cl_mem dvWeights,
\n+
751 int start,
\n+
752 int end,
\n+
753 unsigned int numStartEvents=0,
\n+
754 const cl_event* startEvents=NULL,
\n+
755 cl_event* endEvent=NULL) const;
\n+
756
\n+
823 bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc,
\n+
824 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
825 cl_mem du, BufferDescriptor const &duDesc,
\n+
826 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
827 cl_mem duu, BufferDescriptor const &duuDesc,
\n+
828 cl_mem duv, BufferDescriptor const &duvDesc,
\n+
829 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n+
830 cl_mem sizes,
\n+
831 cl_mem offsets,
\n+
832 cl_mem indices,
\n+
833 cl_mem weights,
\n+
834 cl_mem duWeights,
\n+
835 cl_mem dvWeights,
\n+
836 cl_mem duuWeights,
\n+
837 cl_mem duvWeights,
\n+
838 cl_mem dvvWeights,
\n+
839 int start,
\n+
840 int end,
\n+
841 unsigned int numStartEvents=0,
\n+
842 const cl_event* startEvents=NULL,
\n+
843 cl_event* endEvent=NULL) const;
\n+
844
\n+
850
\n+
899 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
900 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
901 typename DEVICE_CONTEXT>
\n+
\n+
902 static bool EvalPatches(
\n+
903 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
904 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
905 int numPatchCoords,
\n+
906 PATCHCOORD_BUFFER *patchCoords,
\n+
907 PATCH_TABLE *patchTable,
\n+
908 CLEvaluator const *instance,
\n+
909 DEVICE_CONTEXT deviceContext,
\n+
910 unsigned int numStartEvents=0,
\n+
911 const cl_event* startEvents=NULL,
\n+
912 cl_event* endEvent=NULL) {
\n+
913
\n+
914 if (instance) {
\n+
915 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
916 dstBuffer, dstDesc,
\n+
917 numPatchCoords, patchCoords,
\n+
918 patchTable,
\n+
919 numStartEvents, startEvents, endEvent);
\n+
920 } else {
\n+
921 // Create an instance on demand (slow)
\n+
922 (void)deviceContext; // unused
\n+
923 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
926 deviceContext);
\n+
927 if (instance) {
\n+
928 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
929 dstBuffer, dstDesc,
\n+
930 numPatchCoords, patchCoords,
\n+
931 patchTable,
\n+
932 numStartEvents, startEvents, endEvent);
\n+
933 delete instance;
\n+
934 return r;
\n+
935 }
\n+
936 return false;
\n+
937 }
\n+
938 }
\n+
\n+
939
\n+
1000 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1001 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1002 typename DEVICE_CONTEXT>
\n+
\n+
1003 static bool EvalPatches(
\n+
1004 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1005 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1006 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1007 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1008 int numPatchCoords,
\n+
1009 PATCHCOORD_BUFFER *patchCoords,
\n+
1010 PATCH_TABLE *patchTable,
\n+
1011 CLEvaluator const *instance,
\n+
1012 DEVICE_CONTEXT deviceContext,
\n+
1013 unsigned int numStartEvents=0,
\n+
1014 const cl_event* startEvents=NULL,
\n+
1015 cl_event* endEvent=NULL) {
\n+
1016
\n+
1017 if (instance) {
\n+
1018 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
1019 dstBuffer, dstDesc,
\n+
1020 duBuffer, duDesc,
\n+
1021 dvBuffer, dvDesc,
\n+
1022 numPatchCoords, patchCoords,
\n+
1023 patchTable,
\n+
1024 numStartEvents, startEvents, endEvent);
\n+
1025 } else {
\n+
1026 // Create an instance on demand (slow)
\n+
1027 (void)deviceContext; // unused
\n+
1028 instance = Create(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);
\n+
1029 if (instance) {
\n+
1030 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
1031 dstBuffer, dstDesc,
\n+
1032 duBuffer, duDesc,
\n+
1033 dvBuffer, dvDesc,
\n+
1034 numPatchCoords, patchCoords,
\n+
1035 patchTable,
\n+
1036 numStartEvents, startEvents, endEvent);
\n+
1037 delete instance;
\n+
1038 return r;
\n+
1039 }
\n+
1040 return false;
\n+
1041 }
\n+
1042 }
\n+
\n+
1043
\n+
1122 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1123 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1124 typename DEVICE_CONTEXT>
\n+
\n+
1125 static bool EvalPatches(
\n+
1126 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1127 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1128 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1129 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1130 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1131 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1132 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1133 int numPatchCoords,
\n+
1134 PATCHCOORD_BUFFER *patchCoords,
\n+
1135 PATCH_TABLE *patchTable,
\n+
1136 CLEvaluator const *instance,
\n+
1137 DEVICE_CONTEXT deviceContext,
\n+
1138 unsigned int numStartEvents=0,
\n+
1139 const cl_event* startEvents=NULL,
\n+
1140 cl_event* endEvent=NULL) {
\n+
1141
\n+
1142 if (instance) {
\n+
1143 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
1144 dstBuffer, dstDesc,
\n+
1145 duBuffer, duDesc,
\n+
1146 dvBuffer, dvDesc,
\n+
1147 duuBuffer, duuDesc,
\n+
1148 duvBuffer, duvDesc,
\n+
1149 dvvBuffer, dvvDesc,
\n+
1150 numPatchCoords, patchCoords,
\n+
1151 patchTable,
\n+
1152 numStartEvents, startEvents, endEvent);
\n+
1153 } else {
\n+
1154 // Create an instance on demand (slow)
\n+
1155 (void)deviceContext; // unused
\n+
1156 instance = Create(srcDesc, dstDesc,
\n+
1157 duDesc, dvDesc,
\n+
1158 duuDesc, duvDesc, dvvDesc,
\n+
1159 deviceContext);
\n+
1160 if (instance) {
\n+
1161 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
1162 dstBuffer, dstDesc,
\n+
1163 duBuffer, duDesc,
\n+
1164 dvBuffer, dvDesc,
\n+
1165 duuBuffer, duuDesc,
\n+
1166 duvBuffer, duvDesc,
\n+
1167 dvvBuffer, dvvDesc,
\n+
1168 numPatchCoords, patchCoords,
\n+
1169 patchTable,
\n+
1170 numStartEvents, startEvents, endEvent);
\n+
1171 delete instance;
\n+
1172 return r;
\n+
1173 }
\n+
1174 return false;
\n+
1175 }
\n+
1176 }
\n+
\n+
1177
\n+
1215 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1216 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1218 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1219 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1220 int numPatchCoords,
\n+
1221 PATCHCOORD_BUFFER *patchCoords,
\n+
1222 PATCH_TABLE *patchTable,
\n+
1223 unsigned int numStartEvents=0,
\n+
1224 const cl_event* startEvents=NULL,
\n+
1225 cl_event* endEvent=NULL) const {
\n+
1226
\n+
1227 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1229 0, BufferDescriptor(),
\n+
1230 0, BufferDescriptor(),
\n+
1231 numPatchCoords,
\n+
1232 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1233 patchTable->GetPatchArrayBuffer(),
\n+
1234 patchTable->GetPatchIndexBuffer(),
\n+
1235 patchTable->GetPatchParamBuffer(),
\n+
1236 numStartEvents, startEvents, endEvent);
\n+
1237 }
\n+
\n+
1238
\n+
1286 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1287 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1289 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1290 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1291 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1292 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1293 int numPatchCoords,
\n+
1294 PATCHCOORD_BUFFER *patchCoords,
\n+
1295 PATCH_TABLE *patchTable,
\n+
1296 unsigned int numStartEvents=0,
\n+
1297 const cl_event* startEvents=NULL,
\n+
1298 cl_event* endEvent=NULL) const {
\n+
1299
\n+
1300 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1304 numPatchCoords,
\n+
1305 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1306 patchTable->GetPatchArrayBuffer(),
\n+
1307 patchTable->GetPatchIndexBuffer(),
\n+
1308 patchTable->GetPatchParamBuffer(),
\n+
1309 numStartEvents, startEvents, endEvent);
\n+
1310 }
\n+
\n+
1311
\n+
1377 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1378 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1380 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1381 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1382 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1383 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1384 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1385 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1386 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1387 int numPatchCoords,
\n+
1388 PATCHCOORD_BUFFER *patchCoords,
\n+
1389 PATCH_TABLE *patchTable,
\n+
1390 unsigned int numStartEvents=0,
\n+
1391 const cl_event* startEvents=NULL,
\n+
1392 cl_event* endEvent=NULL) const {
\n+
1393
\n+
1394 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
1401 numPatchCoords,
\n+
1402 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1403 patchTable->GetPatchArrayBuffer(),
\n+
1404 patchTable->GetPatchIndexBuffer(),
\n+
1405 patchTable->GetPatchParamBuffer(),
\n+
1406 numStartEvents, startEvents, endEvent);
\n+
1407 }
\n+
\n+
1408
\n+
1409 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n+
1410 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
1411 cl_mem du, BufferDescriptor const &duDesc,
\n+
1412 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
1413 int numPatchCoords,
\n+
1414 cl_mem patchCoordsBuffer,
\n+
1415 cl_mem patchArrayBuffer,
\n+
1416 cl_mem patchIndexBuffer,
\n+
1417 cl_mem patchParamsBuffer,
\n+
1418 unsigned int numStartEvents=0,
\n+
1419 const cl_event* startEvents=NULL,
\n+
1420 cl_event* endEvent=NULL) const;
\n+
1421
\n+
1422 bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc,
\n+
1423 cl_mem dst, BufferDescriptor const &dstDesc,
\n+
1424 cl_mem du, BufferDescriptor const &duDesc,
\n+
1425 cl_mem dv, BufferDescriptor const &dvDesc,
\n+
1426 cl_mem duu, BufferDescriptor const &duuDesc,
\n+
1427 cl_mem duv, BufferDescriptor const &duvDesc,
\n+
1428 cl_mem dvv, BufferDescriptor const &dvvDesc,
\n+
1429 int numPatchCoords,
\n+
1430 cl_mem patchCoordsBuffer,
\n+
1431 cl_mem patchArrayBuffer,
\n+
1432 cl_mem patchIndexBuffer,
\n+
1433 cl_mem patchParamsBuffer,
\n+
1434 unsigned int numStartEvents=0,
\n+
1435 const cl_event* startEvents=NULL,
\n+
1436 cl_event* endEvent=NULL) const;
\n+
1437
\n+
1486 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1487 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1488 typename DEVICE_CONTEXT>
\n+
\n+\n+
1490 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1491 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1492 int numPatchCoords,
\n+
1493 PATCHCOORD_BUFFER *patchCoords,
\n+
1494 PATCH_TABLE *patchTable,
\n+
1495 CLEvaluator const *instance,
\n+
1496 DEVICE_CONTEXT deviceContext,
\n+
1497 unsigned int numStartEvents=0,
\n+
1498 const cl_event* startEvents=NULL,
\n+
1499 cl_event* endEvent=NULL) {
\n+
1500
\n+
1501 if (instance) {
\n+
1502 return instance->EvalPatchesVarying(
\n+
1503 srcBuffer, srcDesc,
\n+
1504 dstBuffer, dstDesc,
\n+
1505 numPatchCoords, patchCoords,
\n+
1506 patchTable,
\n+
1507 numStartEvents, startEvents, endEvent);
\n+
1508 } else {
\n+
1509 // Create an instance on demand (slow)
\n+
1510 (void)deviceContext; // unused
\n+
1511 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
1514 deviceContext);
\n+
1515 if (instance) {
\n+
1516 bool r = instance->EvalPatchesVarying(
\n+
1517 srcBuffer, srcDesc,
\n+
1518 dstBuffer, dstDesc,
\n+
1519 numPatchCoords, patchCoords,
\n+
1520 patchTable,
\n+
1521 numStartEvents, startEvents, endEvent);
\n+
1522 delete instance;
\n+
1523 return r;
\n+
1524 }
\n+
1525 return false;
\n+
1526 }
\n+
1527 }
\n+
\n+
1528
\n+
1566 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1567 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1569 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1570 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1571 int numPatchCoords,
\n+
1572 PATCHCOORD_BUFFER *patchCoords,
\n+
1573 PATCH_TABLE *patchTable,
\n+
1574 unsigned int numStartEvents=0,
\n+
1575 const cl_event* startEvents=NULL,
\n+
1576 cl_event* endEvent=NULL) const {
\n+
1577
\n+
1578 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1580 0, BufferDescriptor(),
\n+
1581 0, BufferDescriptor(),
\n+
1582 numPatchCoords,
\n+
1583 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1584 patchTable->GetVaryingPatchArrayBuffer(),
\n+
1585 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1586 patchTable->GetPatchParamBuffer(),
\n+
1587 numStartEvents, startEvents, endEvent);
\n+
1588 }
\n+
\n+
1589
\n+
1650 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1651 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1652 typename DEVICE_CONTEXT>
\n+
\n+\n+
1654 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1655 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1656 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1657 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1658 int numPatchCoords,
\n+
1659 PATCHCOORD_BUFFER *patchCoords,
\n+
1660 PATCH_TABLE *patchTable,
\n+
1661 CLEvaluator const *instance,
\n+
1662 DEVICE_CONTEXT deviceContext,
\n+
1663 unsigned int numStartEvents=0,
\n+
1664 const cl_event* startEvents=NULL,
\n+
1665 cl_event* endEvent=NULL) {
\n+
1666
\n+
1667 if (instance) {
\n+
1668 return instance->EvalPatchesVarying(
\n+
1669 srcBuffer, srcDesc,
\n+
1670 dstBuffer, dstDesc,
\n+
1671 duBuffer, duDesc,
\n+
1672 dvBuffer, dvDesc,
\n+
1673 numPatchCoords, patchCoords,
\n+
1674 patchTable,
\n+
1675 numStartEvents, startEvents, endEvent);
\n+
1676 } else {
\n+
1677 // Create an instance on demand (slow)
\n+
1678 (void)deviceContext; // unused
\n+
1679 instance = Create(srcDesc, dstDesc,
\n+
1680 duDesc, dvDesc,
\n+
1681 deviceContext);
\n+
1682 if (instance) {
\n+
1683 bool r = instance->EvalPatchesVarying(
\n+
1684 srcBuffer, srcDesc,
\n+
1685 dstBuffer, dstDesc,
\n+
1686 duBuffer, duDesc,
\n+
1687 dvBuffer, dvDesc,
\n+
1688 numPatchCoords, patchCoords,
\n+
1689 patchTable,
\n+
1690 numStartEvents, startEvents, endEvent);
\n+
1691 delete instance;
\n+
1692 return r;
\n+
1693 }
\n+
1694 return false;
\n+
1695 }
\n+
1696 }
\n+
\n+
1697
\n+
1747 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1748 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1750 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1751 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1752 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1753 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1754 int numPatchCoords,
\n+
1755 PATCHCOORD_BUFFER *patchCoords,
\n+
1756 PATCH_TABLE *patchTable,
\n+
1757 unsigned int numStartEvents=0,
\n+
1758 const cl_event* startEvents=NULL,
\n+
1759 cl_event* endEvent=NULL) const {
\n+
1760
\n+
1761 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1765 numPatchCoords,
\n+
1766 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
1767 patchTable->GetVaryingPatchArrayBuffer(),
\n+
1768 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1769 patchTable->GetPatchParamBuffer(),
\n+
1770 numStartEvents, startEvents, endEvent);
\n+
1771 }
\n+
\n+
1772
\n+
1851 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1852 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
1853 typename DEVICE_CONTEXT>
\n+
\n+\n+
1855 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1856 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1857 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1858 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1859 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1860 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1861 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1862 int numPatchCoords,
\n+
1863 PATCHCOORD_BUFFER *patchCoords,
\n+
1864 PATCH_TABLE *patchTable,
\n+
1865 CLEvaluator const *instance,
\n+
1866 DEVICE_CONTEXT deviceContext,
\n+
1867 unsigned int numStartEvents=0,
\n+
1868 const cl_event* startEvents=NULL,
\n+
1869 cl_event* endEvent=NULL) {
\n+
1870
\n+
1871 if (instance) {
\n+
1872 return instance->EvalPatchesVarying(
\n+
1873 srcBuffer, srcDesc,
\n+
1874 dstBuffer, dstDesc,
\n+
1875 duBuffer, duDesc,
\n+
1876 dvBuffer, dvDesc,
\n+
1877 duuBuffer, duuDesc,
\n+
1878 duvBuffer, duvDesc,
\n+
1879 dvvBuffer, dvvDesc,
\n+
1880 numPatchCoords, patchCoords,
\n+
1881 patchTable,
\n+
1882 numStartEvents, startEvents, endEvent);
\n+
1883 } else {
\n+
1884 // Create an instance on demand (slow)
\n+
1885 (void)deviceContext; // unused
\n+
1886 instance = Create(srcDesc, dstDesc,
\n+
1887 duDesc, dvDesc,
\n+
1888 duuDesc, duvDesc, dvvDesc,
\n+
1889 deviceContext);
\n+
1890 if (instance) {
\n+
1891 bool r = instance->EvalPatchesVarying(
\n+
1892 srcBuffer, srcDesc,
\n+
1893 dstBuffer, dstDesc,
\n+
1894 duBuffer, duDesc,
\n+
1895 dvBuffer, dvDesc,
\n+
1896 duuBuffer, duuDesc,
\n+
1897 duvBuffer, duvDesc,
\n+
1898 dvvBuffer, dvvDesc,
\n+
1899 numPatchCoords, patchCoords,
\n+
1900 patchTable,
\n+
1901 numStartEvents, startEvents, endEvent);
\n+
1902 delete instance;
\n+
1903 return r;
\n+
1904 }
\n+
1905 return false;
\n+
1906 }
\n+
1907 }
\n+
\n+
1908
\n+
1976 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1977 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1979 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1980 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1981 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1982 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1983 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1984 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1985 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1986 int numPatchCoords,
\n+
1987 PATCHCOORD_BUFFER *patchCoords,
\n+
1988 PATCH_TABLE *patchTable,
\n+
1989 unsigned int numStartEvents=0,
\n+
1990 const cl_event* startEvents=NULL,
\n+
1991 cl_event* endEvent=NULL) const {
\n+
1992
\n+
1993 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
2000 numPatchCoords,
\n+
2001 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2002 patchTable->GetVaryingPatchArrayBuffer(),
\n+
2003 patchTable->GetVaryingPatchIndexBuffer(),
\n+
2004 patchTable->GetPatchParamBuffer(),
\n+
2005 numStartEvents, startEvents, endEvent);
\n+
2006 }
\n+
\n+
2007
\n+
2058 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2059 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2060 typename DEVICE_CONTEXT>
\n+
\n+\n+
2062 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2063 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2064 int numPatchCoords,
\n+
2065 PATCHCOORD_BUFFER *patchCoords,
\n+
2066 PATCH_TABLE *patchTable,
\n+
2067 int fvarChannel,
\n+
2068 CLEvaluator const *instance,
\n+
2069 DEVICE_CONTEXT deviceContext,
\n+
2070 unsigned int numStartEvents=0,
\n+
2071 const cl_event* startEvents=NULL,
\n+
2072 cl_event* endEvent=NULL) {
\n+
2073
\n+
2074 if (instance) {
\n+
2075 return instance->EvalPatchesFaceVarying(
\n+
2076 srcBuffer, srcDesc,
\n+
2077 dstBuffer, dstDesc,
\n+
2078 numPatchCoords, patchCoords,
\n+
2079 patchTable, fvarChannel,
\n+
2080 numStartEvents, startEvents, endEvent);
\n+
2081 } else {
\n+
2082 // Create an instance on demand (slow)
\n+
2083 (void)deviceContext; // unused
\n+
2084 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
2087 deviceContext);
\n+
2088 if (instance) {
\n+
2089 bool r = instance->EvalPatchesFaceVarying(
\n+
2090 srcBuffer, srcDesc,
\n+
2091 dstBuffer, dstDesc,
\n+
2092 numPatchCoords, patchCoords,
\n+
2093 patchTable, fvarChannel,
\n+
2094 numStartEvents, startEvents, endEvent);
\n+
2095 delete instance;
\n+
2096 return r;
\n+
2097 }
\n+
2098 return false;
\n+
2099 }
\n+
2100 }
\n+
\n+
2101
\n+
2141 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2142 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2144 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2145 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2146 int numPatchCoords,
\n+
2147 PATCHCOORD_BUFFER *patchCoords,
\n+
2148 PATCH_TABLE *patchTable,
\n+
2149 int fvarChannel = 0,
\n+
2150 unsigned int numStartEvents=0,
\n+
2151 const cl_event* startEvents=NULL,
\n+
2152 cl_event* endEvent=NULL) const {
\n+
2153
\n+
2154 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2156 0, BufferDescriptor(),
\n+
2157 0, BufferDescriptor(),
\n+
2158 numPatchCoords,
\n+
2159 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2163 numStartEvents, startEvents, endEvent);
\n+
2164 }
\n+
\n+
2165
\n+
2228 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2229 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2230 typename DEVICE_CONTEXT>
\n+
\n+\n+
2232 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2233 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2234 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2235 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2236 int numPatchCoords,
\n+
2237 PATCHCOORD_BUFFER *patchCoords,
\n+
2238 PATCH_TABLE *patchTable,
\n+
2239 int fvarChannel,
\n+
2240 CLEvaluator const *instance,
\n+
2241 DEVICE_CONTEXT deviceContext,
\n+
2242 unsigned int numStartEvents=0,
\n+
2243 const cl_event* startEvents=NULL,
\n+
2244 cl_event* endEvent=NULL) {
\n+
2245
\n+
2246 if (instance) {
\n+
2247 return instance->EvalPatchesFaceVarying(
\n+
2248 srcBuffer, srcDesc,
\n+
2249 dstBuffer, dstDesc,
\n+
2250 duBuffer, duDesc,
\n+
2251 dvBuffer, dvDesc,
\n+
2252 numPatchCoords, patchCoords,
\n+
2253 patchTable, fvarChannel,
\n+
2254 numStartEvents, startEvents, endEvent);
\n+
2255 } else {
\n+
2256 // Create an instance on demand (slow)
\n+
2257 (void)deviceContext; // unused
\n+
2258 instance = Create(srcDesc, dstDesc,
\n+
2259 duDesc, dvDesc, deviceContext);
\n+
2260 if (instance) {
\n+
2261 bool r = instance->EvalPatchesFaceVarying(
\n+
2262 srcBuffer, srcDesc,
\n+
2263 dstBuffer, dstDesc,
\n+
2264 duBuffer, duDesc,
\n+
2265 dvBuffer, dvDesc,
\n+
2266 numPatchCoords, patchCoords,
\n+
2267 patchTable, fvarChannel,
\n+
2268 numStartEvents, startEvents, endEvent);
\n+
2269 delete instance;
\n+
2270 return r;
\n+
2271 }
\n+
2272 return false;
\n+
2273 }
\n+
2274 }
\n+
\n+
2275
\n+
2327 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2328 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2330 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2331 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2332 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2333 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2334 int numPatchCoords,
\n+
2335 PATCHCOORD_BUFFER *patchCoords,
\n+
2336 PATCH_TABLE *patchTable,
\n+
2337 int fvarChannel = 0,
\n+
2338 unsigned int numStartEvents=0,
\n+
2339 const cl_event* startEvents=NULL,
\n+
2340 cl_event* endEvent=NULL) const {
\n+
2341
\n+
2342 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
2346 numPatchCoords,
\n+
2347 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2351 numStartEvents, startEvents, endEvent);
\n+
2352 }
\n+
\n+
2353
\n+
2434 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2435 typename PATCHCOORD_BUFFER, typename PATCH_TABLE,
\n+
2436 typename DEVICE_CONTEXT>
\n+
\n+\n+
2438 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2439 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2440 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2441 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2442 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
2443 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
2444 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
2445 int numPatchCoords,
\n+
2446 PATCHCOORD_BUFFER *patchCoords,
\n+
2447 PATCH_TABLE *patchTable,
\n+
2448 int fvarChannel,
\n+
2449 CLEvaluator const *instance,
\n+
2450 DEVICE_CONTEXT deviceContext,
\n+
2451 unsigned int numStartEvents=0,
\n+
2452 const cl_event* startEvents=NULL,
\n+
2453 cl_event* endEvent=NULL) {
\n+
2454
\n+
2455 if (instance) {
\n+
2456 return instance->EvalPatchesFaceVarying(
\n+
2457 srcBuffer, srcDesc,
\n+
2458 dstBuffer, dstDesc,
\n+
2459 duBuffer, duDesc,
\n+
2460 dvBuffer, dvDesc,
\n+
2461 duuBuffer, duuDesc,
\n+
2462 duvBuffer, duvDesc,
\n+
2463 dvvBuffer, dvvDesc,
\n+
2464 numPatchCoords, patchCoords,
\n+
2465 patchTable, fvarChannel,
\n+
2466 numStartEvents, startEvents, endEvent);
\n+
2467 } else {
\n+
2468 // Create an instance on demand (slow)
\n+
2469 (void)deviceContext; // unused
\n+
2470 instance = Create(srcDesc, dstDesc,
\n+
2471 duDesc, dvDesc,
\n+
2472 duuDesc, duvDesc, dvvDesc,
\n+
2473 deviceContext);
\n+
2474 if (instance) {
\n+
2475 bool r = instance->EvalPatchesFaceVarying(
\n+
2476 srcBuffer, srcDesc,
\n+
2477 dstBuffer, dstDesc,
\n+
2478 duBuffer, duDesc,
\n+
2479 dvBuffer, dvDesc,
\n+
2480 duuBuffer, duuDesc,
\n+
2481 duvBuffer, duvDesc,
\n+
2482 dvvBuffer, dvvDesc,
\n+
2483 numPatchCoords, patchCoords,
\n+
2484 patchTable, fvarChannel,
\n+
2485 numStartEvents, startEvents, endEvent);
\n+
2486 delete instance;
\n+
2487 return r;
\n+
2488 }
\n+
2489 return false;
\n+
2490 }
\n+
2491 }
\n+
\n+
2492
\n+
2562 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2563 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2565 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2566 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2567 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2568 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2569 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
2570 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
2571 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
2572 int numPatchCoords,
\n+
2573 PATCHCOORD_BUFFER *patchCoords,
\n+
2574 PATCH_TABLE *patchTable,
\n+
2575 int fvarChannel = 0,
\n+
2576 unsigned int numStartEvents=0,
\n+
2577 const cl_event* startEvents=NULL,
\n+
2578 cl_event* endEvent=NULL) const {
\n+
2579
\n+
2580 return EvalPatches(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,
\n+
2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,
\n+
2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,
\n+
2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,
\n+
2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,
\n+
2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,
\n+
2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,
\n+
2587 numPatchCoords,
\n+
2588 patchCoords->BindCLBuffer(_clCommandQueue),
\n+
2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),
\n+
2592 numStartEvents, startEvents, endEvent);
\n+
2593 }
\n+
\n+
2594
\n+
2600
\n+
2603 bool Compile(BufferDescriptor const &srcDesc,
\n+
2604 BufferDescriptor const &dstDesc,
\n+
2605 BufferDescriptor const &duDesc = BufferDescriptor(),
\n+
2606 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n+
2607 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n+
2608 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n+
2609 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n+
2610
\n+
2612 template <typename DEVICE_CONTEXT>
\n+
\n+
2613 static void Synchronize(DEVICE_CONTEXT deviceContext) {
\n+
2614 Synchronize(deviceContext->GetCommandQueue());
\n+
2615 }
\n+
\n+
2616
\n+
2617 static void Synchronize(cl_command_queue queue);
\n+
2618
\n+
2619private:
\n+
2620 cl_context _clContext;
\n+
2621 cl_command_queue _clCommandQueue;
\n+
2622 cl_program _program;
\n+
2623 cl_kernel _stencilKernel;
\n+
2624 cl_kernel _stencilDerivKernel;
\n+
2625 cl_kernel _patchKernel;
\n+
2626};
\n+
\n+
2627
\n+
2628} // end namespace Osd
\n+
2629
\n+
2630} // end namespace OPENSUBDIV_VERSION
\n+
2631using namespace OPENSUBDIV_VERSION;
\n+
2632
\n+
2633} // end namespace OpenSubdiv
\n+
2634
\n+
2635
\n+
2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H
\n \n-\n-\n-\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+\n+
CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)
\n+\n+
static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:61
\n+\n+\n+\n+\n+\n+\n+\n+\n+
static CLStencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
Definition clEvaluator.h:55
\n+
CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
\n+\n+\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static void Synchronize(cl_command_queue queue)
\n+\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)
Generic creator template.
\n+
bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc, cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const &duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv, BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem duvWeights, cl_mem dvvWeights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Dispatch the CL compute kernel asynchronously. returns false if the kernel hasn't been compiled yet.
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static void Synchronize(DEVICE_CONTEXT deviceContext)
Wait the OpenCL kernels finish.
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst, BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices, cl_mem weights, int start, int end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue clCommandQueue)
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic stencil function.
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
CLEvaluator(cl_context context, cl_command_queue queue)
Constructor.
\n+
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlCommon.h\n+clEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,50 +24,1553 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_COMMON_H\n-26#define OPENSUBDIV3_OSD_MTL_COMMON_H\n+25#ifndef OPENSUBDIV3_OSD_CL_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_CL_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \n-31\n-32@protocol MTLDevice;\n-33@protocol MTLCommandQueue;\n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Osd {\n-39\n-_\b4_\b0class _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt {\n-41public:\n-_\b4_\b2 id _\bd_\be_\bv_\bi_\bc_\be = nullptr;\n-_\b4_\b3 id _\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be = nullptr;\n-44};\n-45\n-46} // end namespace Osd\n-47\n-48} // end namespace OPENSUBDIV_VERSION\n-49using namespace OPENSUBDIV_VERSION;\n-50\n-51} // end namespace OpenSubdiv\n-52\n-53#endif //OPENSUBDIV3_OSD_MTL_COMMON_H\n+30#include \"../osd/opencl.h\"\n+31#include \"../osd/types.h\"\n+32#include \"../osd/bufferDescriptor.h\"\n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38 class PatchTable;\n+39 class StencilTable;\n+40 class LimitStencilTable;\n+41}\n+42\n+43namespace Osd {\n+44\n+_\b5_\b2class _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n+53public:\n+54 template \n+_\b5_\b5 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+56 DEVICE_CONTEXT context) {\n+57 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetContext());\n+58 }\n+59\n+60 template \n+_\b6_\b1 static _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(\n+62 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n+63 DEVICE_CONTEXT context) {\n+64 return new _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(limitStencilTable, context->GetContext());\n+65 }\n+66\n+_\b6_\b7 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+68 cl_context clContext);\n+_\b6_\b9 _\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n+70 cl_context clContext);\n+_\b7_\b1 _\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n+72\n+73 // interfaces needed for CLComputeKernel\n+_\b7_\b4 cl_mem _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n+_\b7_\b5 cl_mem _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n+_\b7_\b6 cl_mem _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n+_\b7_\b7 cl_mem _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n+_\b7_\b8 cl_mem _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n+_\b7_\b9 cl_mem _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n+_\b8_\b0 cl_mem _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n+_\b8_\b1 cl_mem _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n+_\b8_\b2 cl_mem _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n+_\b8_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n+84\n+85private:\n+86 cl_mem _sizes;\n+87 cl_mem _offsets;\n+88 cl_mem _indices;\n+89 cl_mem _weights;\n+90 cl_mem _duWeights;\n+91 cl_mem _dvWeights;\n+92 cl_mem _duuWeights;\n+93 cl_mem _duvWeights;\n+94 cl_mem _dvvWeights;\n+95 int _numStencils;\n+96};\n+97\n+98// --------------------------------------------------------------------------\n+-\n+99\n+_\b1_\b0_\b0class _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+101public:\n+_\b1_\b0_\b2 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n+103\n+105 template \n+_\b1_\b0_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+110 DEVICE_CONTEXT deviceContext) {\n+111 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+112 deviceContext->GetContext(),\n+113 deviceContext->GetCommandQueue());\n+114 }\n+115\n+_\b1_\b1_\b6 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+118 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+119 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+120 cl_context clContext,\n+121 cl_command_queue clCommandQueue) {\n+122 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n+123 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc))\n+124 return instance;\n+125 delete instance;\n+126 return NULL;\n+127 }\n+128\n+130 template \n+_\b1_\b3_\b1 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *_\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+132 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+133 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+134 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+135 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+136 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+137 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+138 DEVICE_CONTEXT deviceContext) {\n+139 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+140 duuDesc, duvDesc, dvvDesc,\n+141 deviceContext->GetContext(),\n+142 deviceContext->GetCommandQueue());\n+143 }\n+144\n+_\b1_\b4_\b5 static _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+146 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+147 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+148 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+149 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+150 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+151 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+152 cl_context clContext,\n+153 cl_command_queue clCommandQueue) {\n+154 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(clContext, clCommandQueue);\n+155 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+156 duuDesc, duvDesc, dvvDesc))\n+157 return instance;\n+158 delete instance;\n+159 return NULL;\n+160 }\n+161\n+_\b1_\b6_\b3 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br(cl_context context, cl_command_queue queue);\n+164\n+_\b1_\b6_\b6 _\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+167\n+173\n+217 template \n+_\b2_\b1_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+220 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+221 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+222 STENCIL_TABLE const *stencilTable,\n+223 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+224 DEVICE_CONTEXT deviceContext,\n+225 unsigned int numStartEvents=0,\n+226 const cl_event* startEvents=NULL,\n+227 cl_event* endEvent=NULL) {\n+228\n+229 if (instance) {\n+230 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+231 dstBuffer, dstDesc,\n+232 stencilTable,\n+233 numStartEvents, startEvents, endEvent);\n+234 } else {\n+235 // Create an instance on demand (slow)\n+236 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+237 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+238 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+239 deviceContext);\n+240 if (instance) {\n+241 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+242 dstBuffer, dstDesc,\n+243 stencilTable,\n+244 numStartEvents, startEvents, endEvent);\n+245 delete instance;\n+246 return r;\n+247 }\n+248 return false;\n+249 }\n+250 }\n+251\n+307 template \n+_\b3_\b0_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+310 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+311 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+312 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+313 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+314 STENCIL_TABLE const *stencilTable,\n+315 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+316 DEVICE_CONTEXT deviceContext,\n+317 unsigned int numStartEvents=0,\n+318 const cl_event* startEvents=NULL,\n+319 cl_event* endEvent=NULL) {\n+320\n+321 if (instance) {\n+322 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+323 dstBuffer, dstDesc,\n+324 duBuffer, duDesc,\n+325 dvBuffer, dvDesc,\n+326 stencilTable,\n+327 numStartEvents, startEvents, endEvent);\n+328 } else {\n+329 // Create an instance on demand (slow)\n+330 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+331 deviceContext);\n+332 if (instance) {\n+333 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+334 dstBuffer, dstDesc,\n+335 duBuffer, duDesc,\n+336 dvBuffer, dvDesc,\n+337 stencilTable,\n+338 numStartEvents, startEvents, endEvent);\n+339 delete instance;\n+340 return r;\n+341 }\n+342 return false;\n+343 }\n+344 }\n+345\n+419 template \n+_\b4_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+422 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+423 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+424 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+425 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+426 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+427 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+428 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+429 STENCIL_TABLE const *stencilTable,\n+430 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+431 DEVICE_CONTEXT deviceContext,\n+432 unsigned int numStartEvents=0,\n+433 const cl_event* startEvents=NULL,\n+434 cl_event* endEvent=NULL) {\n+435\n+436 if (instance) {\n+437 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+438 dstBuffer, dstDesc,\n+439 duBuffer, duDesc,\n+440 dvBuffer, dvDesc,\n+441 duuBuffer, duuDesc,\n+442 duvBuffer, duvDesc,\n+443 dvvBuffer, dvvDesc,\n+444 stencilTable,\n+445 numStartEvents, startEvents, endEvent);\n+446 } else {\n+447 // Create an instance on demand (slow)\n+448 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+449 duDesc, dvDesc,\n+450 duuDesc, duvDesc, dvvDesc,\n+451 deviceContext);\n+452 if (instance) {\n+453 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+454 dstBuffer, dstDesc,\n+455 duBuffer, duDesc,\n+456 dvBuffer, dvDesc,\n+457 duuBuffer, duuDesc,\n+458 duvBuffer, duvDesc,\n+459 dvvBuffer, dvvDesc,\n+460 stencilTable,\n+461 numStartEvents, startEvents, endEvent);\n+462 delete instance;\n+463 return r;\n+464 }\n+465 return false;\n+466 }\n+467 }\n+468\n+499 template \n+_\b5_\b0_\b0 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+501 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+502 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+503 STENCIL_TABLE const *stencilTable,\n+504 unsigned int numStartEvents=0,\n+505 const cl_event* startEvents=NULL,\n+506 cl_event* endEvent=NULL) const {\n+507 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+508 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+509 stencilTable->GetSizesBuffer(),\n+510 stencilTable->GetOffsetsBuffer(),\n+511 stencilTable->GetIndicesBuffer(),\n+512 stencilTable->GetWeightsBuffer(),\n+513 0,\n+514 stencilTable->GetNumStencils(),\n+515 numStartEvents, startEvents, endEvent);\n+516 }\n+517\n+560 template \n+_\b5_\b6_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+562 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+563 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+564 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+565 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+566 STENCIL_TABLE const *stencilTable,\n+567 unsigned int numStartEvents=0,\n+568 const cl_event* startEvents=NULL,\n+569 cl_event* endEvent=NULL) const {\n+570 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+571 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+572 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+573 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+574 stencilTable->GetSizesBuffer(),\n+575 stencilTable->GetOffsetsBuffer(),\n+576 stencilTable->GetIndicesBuffer(),\n+577 stencilTable->GetWeightsBuffer(),\n+578 stencilTable->GetDuWeightsBuffer(),\n+579 stencilTable->GetDvWeightsBuffer(),\n+580 0,\n+581 stencilTable->GetNumStencils(),\n+582 numStartEvents, startEvents, endEvent);\n+583 }\n+584\n+645 template \n+_\b6_\b4_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+647 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+648 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+649 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+650 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+651 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+652 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+653 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+654 STENCIL_TABLE const *stencilTable,\n+655 unsigned int numStartEvents=0,\n+656 const cl_event* startEvents=NULL,\n+657 cl_event* endEvent=NULL) const {\n+658 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+659 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+660 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+661 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+662 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+663 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+664 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+665 stencilTable->GetSizesBuffer(),\n+666 stencilTable->GetOffsetsBuffer(),\n+667 stencilTable->GetIndicesBuffer(),\n+668 stencilTable->GetWeightsBuffer(),\n+669 stencilTable->GetDuWeightsBuffer(),\n+670 stencilTable->GetDvWeightsBuffer(),\n+671 stencilTable->GetDuuWeightsBuffer(),\n+672 stencilTable->GetDuvWeightsBuffer(),\n+673 stencilTable->GetDvvWeightsBuffer(),\n+674 0,\n+675 stencilTable->GetNumStencils(),\n+676 numStartEvents, startEvents, endEvent);\n+677 }\n+678\n+_\b6_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+682 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+683 cl_mem sizes,\n+684 cl_mem offsets,\n+685 cl_mem indices,\n+686 cl_mem weights,\n+687 int start,\n+688 int end,\n+689 unsigned int numStartEvents=0,\n+690 const cl_event* startEvents=NULL,\n+691 cl_event* endEvent=NULL) const;\n+692\n+_\b7_\b4_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+742 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+743 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+744 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+745 cl_mem sizes,\n+746 cl_mem offsets,\n+747 cl_mem indices,\n+748 cl_mem weights,\n+749 cl_mem duWeights,\n+750 cl_mem dvWeights,\n+751 int start,\n+752 int end,\n+753 unsigned int numStartEvents=0,\n+754 const cl_event* startEvents=NULL,\n+755 cl_event* endEvent=NULL) const;\n+756\n+_\b8_\b2_\b3 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+824 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+825 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+826 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+827 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+828 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+829 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+830 cl_mem sizes,\n+831 cl_mem offsets,\n+832 cl_mem indices,\n+833 cl_mem weights,\n+834 cl_mem duWeights,\n+835 cl_mem dvWeights,\n+836 cl_mem duuWeights,\n+837 cl_mem duvWeights,\n+838 cl_mem dvvWeights,\n+839 int start,\n+840 int end,\n+841 unsigned int numStartEvents=0,\n+842 const cl_event* startEvents=NULL,\n+843 cl_event* endEvent=NULL) const;\n+844\n+850\n+899 template \n+_\b9_\b0_\b2 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+903 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+904 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+905 int numPatchCoords,\n+906 PATCHCOORD_BUFFER *patchCoords,\n+907 PATCH_TABLE *patchTable,\n+908 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+909 DEVICE_CONTEXT deviceContext,\n+910 unsigned int numStartEvents=0,\n+911 const cl_event* startEvents=NULL,\n+912 cl_event* endEvent=NULL) {\n+913\n+914 if (instance) {\n+915 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+916 dstBuffer, dstDesc,\n+917 numPatchCoords, patchCoords,\n+918 patchTable,\n+919 numStartEvents, startEvents, endEvent);\n+920 } else {\n+921 // Create an instance on demand (slow)\n+922 (void)deviceContext; // unused\n+923 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+924 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+925 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+926 deviceContext);\n+927 if (instance) {\n+928 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+929 dstBuffer, dstDesc,\n+930 numPatchCoords, patchCoords,\n+931 patchTable,\n+932 numStartEvents, startEvents, endEvent);\n+933 delete instance;\n+934 return r;\n+935 }\n+936 return false;\n+937 }\n+938 }\n+939\n+1000 template \n+_\b1_\b0_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1004 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1005 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1006 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1007 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1008 int numPatchCoords,\n+1009 PATCHCOORD_BUFFER *patchCoords,\n+1010 PATCH_TABLE *patchTable,\n+1011 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1012 DEVICE_CONTEXT deviceContext,\n+1013 unsigned int numStartEvents=0,\n+1014 const cl_event* startEvents=NULL,\n+1015 cl_event* endEvent=NULL) {\n+1016\n+1017 if (instance) {\n+1018 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1019 dstBuffer, dstDesc,\n+1020 duBuffer, duDesc,\n+1021 dvBuffer, dvDesc,\n+1022 numPatchCoords, patchCoords,\n+1023 patchTable,\n+1024 numStartEvents, startEvents, endEvent);\n+1025 } else {\n+1026 // Create an instance on demand (slow)\n+1027 (void)deviceContext; // unused\n+1028 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc, deviceContext);\n+1029 if (instance) {\n+1030 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1031 dstBuffer, dstDesc,\n+1032 duBuffer, duDesc,\n+1033 dvBuffer, dvDesc,\n+1034 numPatchCoords, patchCoords,\n+1035 patchTable,\n+1036 numStartEvents, startEvents, endEvent);\n+1037 delete instance;\n+1038 return r;\n+1039 }\n+1040 return false;\n+1041 }\n+1042 }\n+1043\n+1122 template \n+_\b1_\b1_\b2_\b5 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1126 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1127 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1128 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1129 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1130 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1131 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1132 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1133 int numPatchCoords,\n+1134 PATCHCOORD_BUFFER *patchCoords,\n+1135 PATCH_TABLE *patchTable,\n+1136 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1137 DEVICE_CONTEXT deviceContext,\n+1138 unsigned int numStartEvents=0,\n+1139 const cl_event* startEvents=NULL,\n+1140 cl_event* endEvent=NULL) {\n+1141\n+1142 if (instance) {\n+1143 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1144 dstBuffer, dstDesc,\n+1145 duBuffer, duDesc,\n+1146 dvBuffer, dvDesc,\n+1147 duuBuffer, duuDesc,\n+1148 duvBuffer, duvDesc,\n+1149 dvvBuffer, dvvDesc,\n+1150 numPatchCoords, patchCoords,\n+1151 patchTable,\n+1152 numStartEvents, startEvents, endEvent);\n+1153 } else {\n+1154 // Create an instance on demand (slow)\n+1155 (void)deviceContext; // unused\n+1156 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1157 duDesc, dvDesc,\n+1158 duuDesc, duvDesc, dvvDesc,\n+1159 deviceContext);\n+1160 if (instance) {\n+1161 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+1162 dstBuffer, dstDesc,\n+1163 duBuffer, duDesc,\n+1164 dvBuffer, dvDesc,\n+1165 duuBuffer, duuDesc,\n+1166 duvBuffer, duvDesc,\n+1167 dvvBuffer, dvvDesc,\n+1168 numPatchCoords, patchCoords,\n+1169 patchTable,\n+1170 numStartEvents, startEvents, endEvent);\n+1171 delete instance;\n+1172 return r;\n+1173 }\n+1174 return false;\n+1175 }\n+1176 }\n+1177\n+1215 template \n+_\b1_\b2_\b1_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1218 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1219 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1220 int numPatchCoords,\n+1221 PATCHCOORD_BUFFER *patchCoords,\n+1222 PATCH_TABLE *patchTable,\n+1223 unsigned int numStartEvents=0,\n+1224 const cl_event* startEvents=NULL,\n+1225 cl_event* endEvent=NULL) const {\n+1226\n+1227 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1228 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1229 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1230 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1231 numPatchCoords,\n+1232 patchCoords->BindCLBuffer(_clCommandQueue),\n+1233 patchTable->GetPatchArrayBuffer(),\n+1234 patchTable->GetPatchIndexBuffer(),\n+1235 patchTable->GetPatchParamBuffer(),\n+1236 numStartEvents, startEvents, endEvent);\n+1237 }\n+1238\n+1286 template \n+_\b1_\b2_\b8_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1289 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1290 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1291 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1292 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1293 int numPatchCoords,\n+1294 PATCHCOORD_BUFFER *patchCoords,\n+1295 PATCH_TABLE *patchTable,\n+1296 unsigned int numStartEvents=0,\n+1297 const cl_event* startEvents=NULL,\n+1298 cl_event* endEvent=NULL) const {\n+1299\n+1300 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1301 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1302 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1303 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1304 numPatchCoords,\n+1305 patchCoords->BindCLBuffer(_clCommandQueue),\n+1306 patchTable->GetPatchArrayBuffer(),\n+1307 patchTable->GetPatchIndexBuffer(),\n+1308 patchTable->GetPatchParamBuffer(),\n+1309 numStartEvents, startEvents, endEvent);\n+1310 }\n+1311\n+1377 template \n+_\b1_\b3_\b7_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1380 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1381 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1382 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1383 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1384 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1385 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1386 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1387 int numPatchCoords,\n+1388 PATCHCOORD_BUFFER *patchCoords,\n+1389 PATCH_TABLE *patchTable,\n+1390 unsigned int numStartEvents=0,\n+1391 const cl_event* startEvents=NULL,\n+1392 cl_event* endEvent=NULL) const {\n+1393\n+1394 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1395 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1396 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1397 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1398 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+1399 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+1400 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+1401 numPatchCoords,\n+1402 patchCoords->BindCLBuffer(_clCommandQueue),\n+1403 patchTable->GetPatchArrayBuffer(),\n+1404 patchTable->GetPatchIndexBuffer(),\n+1405 patchTable->GetPatchParamBuffer(),\n+1406 numStartEvents, startEvents, endEvent);\n+1407 }\n+1408\n+_\b1_\b4_\b0_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1410 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1411 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1412 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1413 int numPatchCoords,\n+1414 cl_mem patchCoordsBuffer,\n+1415 cl_mem patchArrayBuffer,\n+1416 cl_mem patchIndexBuffer,\n+1417 cl_mem patchParamsBuffer,\n+1418 unsigned int numStartEvents=0,\n+1419 const cl_event* startEvents=NULL,\n+1420 cl_event* endEvent=NULL) const;\n+1421\n+_\b1_\b4_\b2_\b2 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(cl_mem src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1423 cl_mem dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1424 cl_mem du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1425 cl_mem dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1426 cl_mem duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1427 cl_mem duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1428 cl_mem dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1429 int numPatchCoords,\n+1430 cl_mem patchCoordsBuffer,\n+1431 cl_mem patchArrayBuffer,\n+1432 cl_mem patchIndexBuffer,\n+1433 cl_mem patchParamsBuffer,\n+1434 unsigned int numStartEvents=0,\n+1435 const cl_event* startEvents=NULL,\n+1436 cl_event* endEvent=NULL) const;\n+1437\n+1486 template \n+_\b1_\b4_\b8_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1490 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1491 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1492 int numPatchCoords,\n+1493 PATCHCOORD_BUFFER *patchCoords,\n+1494 PATCH_TABLE *patchTable,\n+1495 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1496 DEVICE_CONTEXT deviceContext,\n+1497 unsigned int numStartEvents=0,\n+1498 const cl_event* startEvents=NULL,\n+1499 cl_event* endEvent=NULL) {\n+1500\n+1501 if (instance) {\n+1502 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1503 srcBuffer, srcDesc,\n+1504 dstBuffer, dstDesc,\n+1505 numPatchCoords, patchCoords,\n+1506 patchTable,\n+1507 numStartEvents, startEvents, endEvent);\n+1508 } else {\n+1509 // Create an instance on demand (slow)\n+1510 (void)deviceContext; // unused\n+1511 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1512 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1513 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1514 deviceContext);\n+1515 if (instance) {\n+1516 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1517 srcBuffer, srcDesc,\n+1518 dstBuffer, dstDesc,\n+1519 numPatchCoords, patchCoords,\n+1520 patchTable,\n+1521 numStartEvents, startEvents, endEvent);\n+1522 delete instance;\n+1523 return r;\n+1524 }\n+1525 return false;\n+1526 }\n+1527 }\n+1528\n+1566 template \n+_\b1_\b5_\b6_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1569 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1570 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1571 int numPatchCoords,\n+1572 PATCHCOORD_BUFFER *patchCoords,\n+1573 PATCH_TABLE *patchTable,\n+1574 unsigned int numStartEvents=0,\n+1575 const cl_event* startEvents=NULL,\n+1576 cl_event* endEvent=NULL) const {\n+1577\n+1578 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1579 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1580 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1581 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1582 numPatchCoords,\n+1583 patchCoords->BindCLBuffer(_clCommandQueue),\n+1584 patchTable->GetVaryingPatchArrayBuffer(),\n+1585 patchTable->GetVaryingPatchIndexBuffer(),\n+1586 patchTable->GetPatchParamBuffer(),\n+1587 numStartEvents, startEvents, endEvent);\n+1588 }\n+1589\n+1650 template \n+_\b1_\b6_\b5_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1654 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1655 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1656 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1657 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1658 int numPatchCoords,\n+1659 PATCHCOORD_BUFFER *patchCoords,\n+1660 PATCH_TABLE *patchTable,\n+1661 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1662 DEVICE_CONTEXT deviceContext,\n+1663 unsigned int numStartEvents=0,\n+1664 const cl_event* startEvents=NULL,\n+1665 cl_event* endEvent=NULL) {\n+1666\n+1667 if (instance) {\n+1668 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1669 srcBuffer, srcDesc,\n+1670 dstBuffer, dstDesc,\n+1671 duBuffer, duDesc,\n+1672 dvBuffer, dvDesc,\n+1673 numPatchCoords, patchCoords,\n+1674 patchTable,\n+1675 numStartEvents, startEvents, endEvent);\n+1676 } else {\n+1677 // Create an instance on demand (slow)\n+1678 (void)deviceContext; // unused\n+1679 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1680 duDesc, dvDesc,\n+1681 deviceContext);\n+1682 if (instance) {\n+1683 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1684 srcBuffer, srcDesc,\n+1685 dstBuffer, dstDesc,\n+1686 duBuffer, duDesc,\n+1687 dvBuffer, dvDesc,\n+1688 numPatchCoords, patchCoords,\n+1689 patchTable,\n+1690 numStartEvents, startEvents, endEvent);\n+1691 delete instance;\n+1692 return r;\n+1693 }\n+1694 return false;\n+1695 }\n+1696 }\n+1697\n+1747 template \n+_\b1_\b7_\b4_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1750 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1751 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1752 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1753 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1754 int numPatchCoords,\n+1755 PATCHCOORD_BUFFER *patchCoords,\n+1756 PATCH_TABLE *patchTable,\n+1757 unsigned int numStartEvents=0,\n+1758 const cl_event* startEvents=NULL,\n+1759 cl_event* endEvent=NULL) const {\n+1760\n+1761 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1762 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1763 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1764 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1765 numPatchCoords,\n+1766 patchCoords->BindCLBuffer(_clCommandQueue),\n+1767 patchTable->GetVaryingPatchArrayBuffer(),\n+1768 patchTable->GetVaryingPatchIndexBuffer(),\n+1769 patchTable->GetPatchParamBuffer(),\n+1770 numStartEvents, startEvents, endEvent);\n+1771 }\n+1772\n+1851 template \n+_\b1_\b8_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1855 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1856 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1857 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1858 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1859 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1860 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1861 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1862 int numPatchCoords,\n+1863 PATCHCOORD_BUFFER *patchCoords,\n+1864 PATCH_TABLE *patchTable,\n+1865 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1866 DEVICE_CONTEXT deviceContext,\n+1867 unsigned int numStartEvents=0,\n+1868 const cl_event* startEvents=NULL,\n+1869 cl_event* endEvent=NULL) {\n+1870\n+1871 if (instance) {\n+1872 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1873 srcBuffer, srcDesc,\n+1874 dstBuffer, dstDesc,\n+1875 duBuffer, duDesc,\n+1876 dvBuffer, dvDesc,\n+1877 duuBuffer, duuDesc,\n+1878 duvBuffer, duvDesc,\n+1879 dvvBuffer, dvvDesc,\n+1880 numPatchCoords, patchCoords,\n+1881 patchTable,\n+1882 numStartEvents, startEvents, endEvent);\n+1883 } else {\n+1884 // Create an instance on demand (slow)\n+1885 (void)deviceContext; // unused\n+1886 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1887 duDesc, dvDesc,\n+1888 duuDesc, duvDesc, dvvDesc,\n+1889 deviceContext);\n+1890 if (instance) {\n+1891 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1892 srcBuffer, srcDesc,\n+1893 dstBuffer, dstDesc,\n+1894 duBuffer, duDesc,\n+1895 dvBuffer, dvDesc,\n+1896 duuBuffer, duuDesc,\n+1897 duvBuffer, duvDesc,\n+1898 dvvBuffer, dvvDesc,\n+1899 numPatchCoords, patchCoords,\n+1900 patchTable,\n+1901 numStartEvents, startEvents, endEvent);\n+1902 delete instance;\n+1903 return r;\n+1904 }\n+1905 return false;\n+1906 }\n+1907 }\n+1908\n+1976 template \n+_\b1_\b9_\b7_\b8 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1979 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1980 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1981 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1982 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1983 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1984 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1985 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1986 int numPatchCoords,\n+1987 PATCHCOORD_BUFFER *patchCoords,\n+1988 PATCH_TABLE *patchTable,\n+1989 unsigned int numStartEvents=0,\n+1990 const cl_event* startEvents=NULL,\n+1991 cl_event* endEvent=NULL) const {\n+1992\n+1993 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+1994 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+1995 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+1996 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+1997 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+1998 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+1999 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+2000 numPatchCoords,\n+2001 patchCoords->BindCLBuffer(_clCommandQueue),\n+2002 patchTable->GetVaryingPatchArrayBuffer(),\n+2003 patchTable->GetVaryingPatchIndexBuffer(),\n+2004 patchTable->GetPatchParamBuffer(),\n+2005 numStartEvents, startEvents, endEvent);\n+2006 }\n+2007\n+2058 template \n+_\b2_\b0_\b6_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2062 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2063 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2064 int numPatchCoords,\n+2065 PATCHCOORD_BUFFER *patchCoords,\n+2066 PATCH_TABLE *patchTable,\n+2067 int fvarChannel,\n+2068 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2069 DEVICE_CONTEXT deviceContext,\n+2070 unsigned int numStartEvents=0,\n+2071 const cl_event* startEvents=NULL,\n+2072 cl_event* endEvent=NULL) {\n+2073\n+2074 if (instance) {\n+2075 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2076 srcBuffer, srcDesc,\n+2077 dstBuffer, dstDesc,\n+2078 numPatchCoords, patchCoords,\n+2079 patchTable, fvarChannel,\n+2080 numStartEvents, startEvents, endEvent);\n+2081 } else {\n+2082 // Create an instance on demand (slow)\n+2083 (void)deviceContext; // unused\n+2084 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2087 deviceContext);\n+2088 if (instance) {\n+2089 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2090 srcBuffer, srcDesc,\n+2091 dstBuffer, dstDesc,\n+2092 numPatchCoords, patchCoords,\n+2093 patchTable, fvarChannel,\n+2094 numStartEvents, startEvents, endEvent);\n+2095 delete instance;\n+2096 return r;\n+2097 }\n+2098 return false;\n+2099 }\n+2100 }\n+2101\n+2141 template \n+_\b2_\b1_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2144 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2145 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2146 int numPatchCoords,\n+2147 PATCHCOORD_BUFFER *patchCoords,\n+2148 PATCH_TABLE *patchTable,\n+2149 int fvarChannel = 0,\n+2150 unsigned int numStartEvents=0,\n+2151 const cl_event* startEvents=NULL,\n+2152 cl_event* endEvent=NULL) const {\n+2153\n+2154 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2155 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2156 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2157 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2158 numPatchCoords,\n+2159 patchCoords->BindCLBuffer(_clCommandQueue),\n+2160 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2161 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2162 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2163 numStartEvents, startEvents, endEvent);\n+2164 }\n+2165\n+2228 template \n+_\b2_\b2_\b3_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2232 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2233 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2234 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2235 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2236 int numPatchCoords,\n+2237 PATCHCOORD_BUFFER *patchCoords,\n+2238 PATCH_TABLE *patchTable,\n+2239 int fvarChannel,\n+2240 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2241 DEVICE_CONTEXT deviceContext,\n+2242 unsigned int numStartEvents=0,\n+2243 const cl_event* startEvents=NULL,\n+2244 cl_event* endEvent=NULL) {\n+2245\n+2246 if (instance) {\n+2247 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2248 srcBuffer, srcDesc,\n+2249 dstBuffer, dstDesc,\n+2250 duBuffer, duDesc,\n+2251 dvBuffer, dvDesc,\n+2252 numPatchCoords, patchCoords,\n+2253 patchTable, fvarChannel,\n+2254 numStartEvents, startEvents, endEvent);\n+2255 } else {\n+2256 // Create an instance on demand (slow)\n+2257 (void)deviceContext; // unused\n+2258 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2259 duDesc, dvDesc, deviceContext);\n+2260 if (instance) {\n+2261 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2262 srcBuffer, srcDesc,\n+2263 dstBuffer, dstDesc,\n+2264 duBuffer, duDesc,\n+2265 dvBuffer, dvDesc,\n+2266 numPatchCoords, patchCoords,\n+2267 patchTable, fvarChannel,\n+2268 numStartEvents, startEvents, endEvent);\n+2269 delete instance;\n+2270 return r;\n+2271 }\n+2272 return false;\n+2273 }\n+2274 }\n+2275\n+2327 template \n+_\b2_\b3_\b2_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2330 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2331 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2332 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2333 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2334 int numPatchCoords,\n+2335 PATCHCOORD_BUFFER *patchCoords,\n+2336 PATCH_TABLE *patchTable,\n+2337 int fvarChannel = 0,\n+2338 unsigned int numStartEvents=0,\n+2339 const cl_event* startEvents=NULL,\n+2340 cl_event* endEvent=NULL) const {\n+2341\n+2342 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2343 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2344 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+2345 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+2346 numPatchCoords,\n+2347 patchCoords->BindCLBuffer(_clCommandQueue),\n+2348 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2349 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2350 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2351 numStartEvents, startEvents, endEvent);\n+2352 }\n+2353\n+2434 template \n+_\b2_\b4_\b3_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2438 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2439 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2440 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2441 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2442 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2443 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2444 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2445 int numPatchCoords,\n+2446 PATCHCOORD_BUFFER *patchCoords,\n+2447 PATCH_TABLE *patchTable,\n+2448 int fvarChannel,\n+2449 _\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+2450 DEVICE_CONTEXT deviceContext,\n+2451 unsigned int numStartEvents=0,\n+2452 const cl_event* startEvents=NULL,\n+2453 cl_event* endEvent=NULL) {\n+2454\n+2455 if (instance) {\n+2456 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2457 srcBuffer, srcDesc,\n+2458 dstBuffer, dstDesc,\n+2459 duBuffer, duDesc,\n+2460 dvBuffer, dvDesc,\n+2461 duuBuffer, duuDesc,\n+2462 duvBuffer, duvDesc,\n+2463 dvvBuffer, dvvDesc,\n+2464 numPatchCoords, patchCoords,\n+2465 patchTable, fvarChannel,\n+2466 numStartEvents, startEvents, endEvent);\n+2467 } else {\n+2468 // Create an instance on demand (slow)\n+2469 (void)deviceContext; // unused\n+2470 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+2471 duDesc, dvDesc,\n+2472 duuDesc, duvDesc, dvvDesc,\n+2473 deviceContext);\n+2474 if (instance) {\n+2475 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2476 srcBuffer, srcDesc,\n+2477 dstBuffer, dstDesc,\n+2478 duBuffer, duDesc,\n+2479 dvBuffer, dvDesc,\n+2480 duuBuffer, duuDesc,\n+2481 duvBuffer, duvDesc,\n+2482 dvvBuffer, dvvDesc,\n+2483 numPatchCoords, patchCoords,\n+2484 patchTable, fvarChannel,\n+2485 numStartEvents, startEvents, endEvent);\n+2486 delete instance;\n+2487 return r;\n+2488 }\n+2489 return false;\n+2490 }\n+2491 }\n+2492\n+2562 template \n+_\b2_\b5_\b6_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2565 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2566 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2567 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2568 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2569 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2570 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2571 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2572 int numPatchCoords,\n+2573 PATCHCOORD_BUFFER *patchCoords,\n+2574 PATCH_TABLE *patchTable,\n+2575 int fvarChannel = 0,\n+2576 unsigned int numStartEvents=0,\n+2577 const cl_event* startEvents=NULL,\n+2578 cl_event* endEvent=NULL) const {\n+2579\n+2580 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCLBuffer(_clCommandQueue), srcDesc,\n+2581 dstBuffer->BindCLBuffer(_clCommandQueue), dstDesc,\n+2582 duBuffer->BindCLBuffer(_clCommandQueue), duDesc,\n+2583 dvBuffer->BindCLBuffer(_clCommandQueue), dvDesc,\n+2584 duuBuffer->BindCLBuffer(_clCommandQueue), duuDesc,\n+2585 duvBuffer->BindCLBuffer(_clCommandQueue), duvDesc,\n+2586 dvvBuffer->BindCLBuffer(_clCommandQueue), dvvDesc,\n+2587 numPatchCoords,\n+2588 patchCoords->BindCLBuffer(_clCommandQueue),\n+2589 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+2590 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2591 patchTable->GetFVarPatchParamBuffer(fvarChannel),\n+2592 numStartEvents, startEvents, endEvent);\n+2593 }\n+2594\n+2600\n+_\b2_\b6_\b0_\b3 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2604 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2605 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2606 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2607 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2608 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2609 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+2610\n+2612 template \n+_\b2_\b6_\b1_\b3 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(DEVICE_CONTEXT deviceContext) {\n+2614 _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(deviceContext->GetCommandQueue());\n+2615 }\n+2616\n+_\b2_\b6_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(cl_command_queue queue);\n+2618\n+2619private:\n+2620 cl_context _clContext;\n+2621 cl_command_queue _clCommandQueue;\n+2622 cl_program _program;\n+2623 cl_kernel _stencilKernel;\n+2624 cl_kernel _stencilDerivKernel;\n+2625 cl_kernel _patchKernel;\n+2626};\n+2627\n+2628} // end namespace Osd\n+2629\n+2630} // end namespace OPENSUBDIV_VERSION\n+2631using namespace OPENSUBDIV_VERSION;\n+2632\n+2633} // end namespace OpenSubdiv\n+2634\n+2635\n+2636#endif // OPENSUBDIV3_OSD_CL_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bc_\bo_\bm_\bm_\ba_\bn_\bd_\bQ_\bu_\be_\bu_\be\n-id< MTLCommandQueue > commandQueue\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt_\b:_\b:_\bd_\be_\bv_\bi_\bc_\be\n-id< MTLDevice > device\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor is a struct which describes buffer elements in interleaved\n+data buffers....\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+OpenCL stencil table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDvvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CLStencilTable(Far::StencilTable const *stencilTable, cl_context clContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetOffsetsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLStencilTable * Create(Far::LimitStencilTable const *limitStencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetIndicesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetSizesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetDuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+~CLStencilTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLStencilTable * Create(Far::StencilTable const *stencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+CLStencilTable(Far::LimitStencilTable const *limitStencilTable, cl_context\n+clContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+cl_mem GetWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, CLEvaluator\n+const *instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0,\n+const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(cl_command_queue queue)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+~CLEvaluator()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem sizes, cl_mem offsets, cl_mem\n+indices, cl_mem weights, cl_mem duWeights, cl_mem dvWeights, int start, int\n+end, unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Dispatch the CL compute kernel asynchronously. returns false if the kernel\n+hasn't been compiled yet.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+cl_context clContext, cl_command_queue clCommandQueue)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b2_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, int numPatchCoords, cl_mem\n+patchCoordsBuffer, cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem\n+patchParamsBuffer, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, STENCIL_TABLE const *stencilTable, unsigned int numStartEvents=0,\n+const cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n+bool Instantiatable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+DEVICE_CONTEXT deviceContext)\n+Generic creator template.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n+BufferDescriptor const &dvvDesc, DEVICE_CONTEXT deviceContext)\n+Generic creator template.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n+&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, cl_mem patchCoordsBuffer,\n+cl_mem patchArrayBuffer, cl_mem patchIndexBuffer, cl_mem patchParamsBuffer,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem du, BufferDescriptor const &duDesc,\n+cl_mem dv, BufferDescriptor const &dvDesc, cl_mem duu, BufferDescriptor const\n+&duuDesc, cl_mem duv, BufferDescriptor const &duvDesc, cl_mem dvv,\n+BufferDescriptor const &dvvDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n+cl_mem weights, cl_mem duWeights, cl_mem dvWeights, cl_mem duuWeights, cl_mem\n+duvWeights, cl_mem dvvWeights, int start, int end, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Dispatch the CL compute kernel asynchronously. returns false if the kernel\n+hasn't been compiled yet.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b5_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, unsigned\n+int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n+DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(DEVICE_CONTEXT deviceContext)\n+Wait the OpenCL kernels finish.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b6_\b1_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CLEvaluator const *instance,\n+DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const cl_event\n+*startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b2_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b2_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(cl_mem src, BufferDescriptor const &srcDesc, cl_mem dst,\n+BufferDescriptor const &dstDesc, cl_mem sizes, cl_mem offsets, cl_mem indices,\n+cl_mem weights, int start, int end, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b2_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+CLEvaluator const *instance, DEVICE_CONTEXT deviceContext, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b4_\b3_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CLEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor\n+const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc,\n+BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc,\n+BufferDescriptor const &dvvDesc, cl_context clContext, cl_command_queue\n+clCommandQueue)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, CLEvaluator const *instance, DEVICE_CONTEXT deviceContext,\n+unsigned int numStartEvents=0, const cl_event *startEvents=NULL, cl_event\n+*endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b4_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, unsigned int\n+numStartEvents=0, const cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CLEvaluator const\n+*instance, DEVICE_CONTEXT deviceContext, unsigned int numStartEvents=0, const\n+cl_event *startEvents=NULL, cl_event *endEvent=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n+*stencilTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+CLEvaluator(cl_context context, cl_command_queue queue)\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n+bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n+BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n+&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n+BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n+&dvvDesc=BufferDescriptor())\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bL_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel=0, unsigned int numStartEvents=0, const cl_event *startEvents=NULL,\n+cl_event *endEvent=NULL) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b1_\b4_\b3\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\n+ * _\bc_\bl_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00809.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00809.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
mtlPatchShaderSource.h File Reference
\n \n
\n
import "../version.h"
\n-import "../far/patchDescriptor.h"
\n+import "../far/patchDescriptor.h"
\n import <string>
\n
\n

Go to the source code of this file.

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00809_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00809_source.html", "unified_diff": "@@ -172,15 +172,15 @@\n
88} // end namespace OPENSUBDIV_VERSION
\n
89using namespace OPENSUBDIV_VERSION;
\n
90
\n
91} // end namespace OpenSubdiv
\n
92
\n
93#endif // OPENSUBDIV3_OSD_MTL_PATCH_SHADER_SOURCE
\n \n-\n+\n
Provides shader source which can be used by client code.
\n
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n
static std::string GetPatchDrawingShaderSource()
Returns shader source which can be used while drawing piecewise parametric patches resulting from sub...
\n
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
Deprecated.
\n
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type, Far::PatchDescriptor::Type fvarType)
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00812.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00812.html", "unified_diff": "@@ -95,15 +95,15 @@\n Namespaces |\n Typedefs\n
mtlMesh.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../osd/mesh.h"
\n-#include "../osd/mtlPatchTable.h"
\n+#include "../osd/mtlPatchTable.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MTLPatchShaderSource
\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00815.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00815.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlLegacyGregoryPatchTable.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlPatchTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,42 +90,45 @@\n \n \n \n
\n \n-
mtlLegacyGregoryPatchTable.h File Reference
\n+
mtlPatchTable.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n+#include "../far/patchDescriptor.h"
\n #include "../osd/nonCopyable.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/types.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n

\n Namespaces

namespace  OpenSubdiv
 
\n \n-\n+\n \n

\n Classes

class  MTLLegacyGregoryPatchTable
class  MTLPatchTable
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlLegacyGregoryPatchTable.h File Reference\n+mtlPatchTable.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n #include \"../osd/nonCopyable.h\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+class \u00a0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00815.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00815.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00815 = [\n- [\"MTLLegacyGregoryPatchTable\", \"a01297.html\", \"a01297\"]\n+ [\"MTLPatchTable\", \"a01305.html\", \"a01305\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00815_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00815_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlLegacyGregoryPatchTable.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlPatchTable.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlLegacyGregoryPatchTable.h
\n+
mtlPatchTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,112 +119,123 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n-
26#define OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n+
26#define OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../far/patchTable.h"
\n+
29#include "../far/patchDescriptor.h"
\n
30#include "../osd/nonCopyable.h"
\n-
31#include "../osd/mtlCommon.h"
\n-
32
\n-
33@protocol MTLDevice;
\n-
34@protocol MTLBuffer;
\n-
35
\n-
36namespace OpenSubdiv {
\n-
37namespace OPENSUBDIV_VERSION {
\n-
38
\n-
39namespace Osd {
\n-
40
\n-
\n-\n-
42: private NonCopyable<MTLLegacyGregoryPatchTable>
\n-
43{
\n-
44public:
\n-\n-
46
\n-
47 template<typename DEVICE_CONTEXT>
\n-
\n-
48 static MTLLegacyGregoryPatchTable* Create(Far::PatchTable const* farPatchTable, DEVICE_CONTEXT context) {
\n-
49 return Create(farPatchTable, context);
\n-
50 }
\n-
\n-
51
\n-
52 static MTLLegacyGregoryPatchTable* Create(Far::PatchTable const* farPatchTable, MTLContext* context);
\n-
53
\n-
54 void UpdateVertexBuffer(id<MTLBuffer> vbo, int numVertices, int numVertexElements, MTLContext* context);
\n-
55
\n-
\n-
56 id<MTLBuffer> GetVertexBuffer() const
\n-
57 {
\n-
58 return _vertexBuffer;
\n-
59 }
\n+
31#include "../osd/types.h"
\n+
32#include "../osd/mtlCommon.h"
\n+
33
\n+
34@protocol MTLDevice;
\n+
35@protocol MTLBuffer;
\n+
36
\n+
37namespace OpenSubdiv {
\n+
38namespace OPENSUBDIV_VERSION {
\n+
39
\n+
40namespace Far {
\n+
41 class PatchTable;
\n+
42};
\n+
43
\n+
44namespace Osd {
\n+
45
\n+
\n+
46class MTLPatchTable : private NonCopyable<MTLPatchTable> {
\n+
47public:
\n+
48 typedef id<MTLBuffer> VertexBufferBinding;
\n+
49
\n+\n+\n+
52
\n+
53 template<typename DEVICE_CONTEXT>
\n+
\n+
54 static MTLPatchTable *Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n+
55 {
\n+
56 return Create(farPatchTable, context);
\n+
57 }
\n
\n+
58
\n+
59 static MTLPatchTable *Create(Far::PatchTable const *farPatchTable, MTLContext* context);
\n
60
\n-
\n-
61 id<MTLBuffer> GetVertexValenceBuffer() const
\n-
62 {
\n-
63 return _vertexValenceBuffer;
\n-
64 }
\n-
\n-
65
\n-
\n-
66 id<MTLBuffer> GetQuadOffsetsBuffer() const
\n-
67 {
\n-
68 return _quadOffsetsBuffer;
\n-
69 }
\n-
\n-
70
\n-
\n-\n-
72 {
\n-\n-
74 return _quadOffsetsBase[1];
\n-
75 return _quadOffsetsBase[0];
\n-
76 }
\n-
\n+
61 PatchArrayVector const &GetPatchArrays() const { return _patchArrays; }
\n+
62 id<MTLBuffer> GetPatchIndexBuffer() const { return _indexBuffer; }
\n+
63 id<MTLBuffer> GetPatchParamBuffer() const { return _patchParamBuffer; }
\n+
64
\n+\n+
66 id<MTLBuffer> GetVaryingPatchIndexBuffer() const { return _varyingPatchIndexBuffer; }
\n+
67
\n+
68 int GetNumFVarChannels() const { return (int)_fvarPatchArrays.size(); }
\n+
69 PatchArrayVector const &GetFVarPatchArrays(int fvarChannel = 0) const { return _fvarPatchArrays[fvarChannel]; }
\n+
70 id<MTLBuffer> GetFVarPatchIndexBuffer(int fvarChannel = 0) const { return _fvarIndexBuffers[fvarChannel]; }
\n+
71 id<MTLBuffer> GetFVarPatchParamBuffer(int fvarChannel = 0) const { return _fvarParamBuffers[fvarChannel]; }
\n+
72
\n+
73protected:
\n+
74 bool allocate(Far::PatchTable const *farPatchTable, MTLContext* context);
\n+
75
\n+\n
77
\n-
78private:
\n-
79 id<MTLBuffer> _vertexBuffer;
\n-
80 id<MTLBuffer> _vertexValenceBuffer;
\n-
81 id<MTLBuffer> _quadOffsetsBuffer;
\n-
82 int _quadOffsetsBase[2];
\n-
83};
\n-
\n+
78 id<MTLBuffer> _indexBuffer;
\n+
79 id<MTLBuffer> _patchParamBuffer;
\n+
80
\n+\n+
82
\n+\n
84
\n-
85} //end namespace Osd
\n-
86
\n-
87} //end namespace OPENSUBDIV_VERSION
\n-
88using namespace OPENSUBDIV_VERSION;
\n+
85 std::vector<PatchArrayVector> _fvarPatchArrays;
\n+
86 std::vector<id<MTLBuffer>> _fvarIndexBuffers;
\n+
87 std::vector<id<MTLBuffer>> _fvarParamBuffers;
\n+
88};
\n+
\n
89
\n-
90} //end namespace OpenSuddiv
\n+
90} // end namespace Osd
\n
91
\n-
92#endif // OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
92} //end namespace OPENSUBDIV_VERSION
\n+
93using namespace OPENSUBDIV_VERSION;
\n+
94
\n+
95} //end namespace OpenSubdiv
\n+
96
\n+
97#endif //end OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n \n-\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-\n-\n-
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n-\n-\n-
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n-
void UpdateVertexBuffer(id< MTLBuffer > vbo, int numVertices, int numVertexElements, MTLContext *context)
\n-\n-\n+
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+\n+
PatchArrayVector const & GetPatchArrays() const
\n+
bool allocate(Far::PatchTable const *farPatchTable, MTLContext *context)
\n+
static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n+\n+
std::vector< id< MTLBuffer > > _fvarIndexBuffers
\n+
id< MTLBuffer > GetFVarPatchParamBuffer(int fvarChannel=0) const
\n+\n+\n+\n+\n+\n+\n+
PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const
\n+\n+
std::vector< id< MTLBuffer > > _fvarParamBuffers
\n+
std::vector< PatchArrayVector > _fvarPatchArrays
\n+\n+\n+
static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n+\n+
id< MTLBuffer > GetFVarPatchIndexBuffer(int fvarChannel=0) const
\n+
PatchArrayVector const & GetVaryingPatchArrays() const
\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlLegacyGregoryPatchTable.h\n+mtlPatchTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,127 +24,170 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n-26#define OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n+26#define OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n 27\n 28#include \"../version.h\"\n-29#include \"../far/patchTable.h\"\n+29#include \"../far/patchDescriptor.h\"\n 30#include \"../osd/nonCopyable.h\"\n-31#include \"../osd/mtlCommon.h\"\n-32\n-33@protocol MTLDevice;\n-34@protocol MTLBuffer;\n-35\n-36namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-37namespace OPENSUBDIV_VERSION {\n-38\n-39namespace Osd {\n-40\n-_\b4_\b1class _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-42: private NonCopyable\n-43{\n-44public:\n-_\b4_\b5 _\b~_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-46\n-47 template\n-_\b4_\b8 static _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be* _\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const*\n-farPatchTable, DEVICE_CONTEXT context) {\n-49 return Create(farPatchTable, context);\n-50 }\n-51\n-_\b5_\b2 static _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be* _\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const*\n-farPatchTable, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-53\n-_\b5_\b4 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(id vbo, int numVertices, int\n-numVertexElements, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-55\n-_\b5_\b6 id _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const\n-57 {\n-58 return _vertexBuffer;\n-59 }\n+31#include \"../osd/types.h\"\n+32#include \"../osd/mtlCommon.h\"\n+33\n+34@protocol MTLDevice;\n+35@protocol MTLBuffer;\n+36\n+37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+38namespace OPENSUBDIV_VERSION {\n+39\n+40namespace Far {\n+41 class PatchTable;\n+42};\n+43\n+44namespace Osd {\n+45\n+_\b4_\b6class _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be : private NonCopyable {\n+47public:\n+_\b4_\b8 typedef id _\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg;\n+49\n+_\b5_\b0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+_\b5_\b1 _\b~_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+52\n+53 template\n+_\b5_\b4 static _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n+DEVICE_CONTEXT context)\n+55 {\n+56 return _\bC_\br_\be_\ba_\bt_\be(farPatchTable, context);\n+57 }\n+58\n+_\b5_\b9 static _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n+_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n 60\n-_\b6_\b1 id _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bB_\bu_\bf_\bf_\be_\br() const\n-62 {\n-63 return _vertexValenceBuffer;\n-64 }\n-65\n-_\b6_\b6 id _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const\n-67 {\n-68 return _quadOffsetsBuffer;\n-69 }\n-70\n-_\b7_\b1 int _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type)\n-72 {\n-73 if(type == _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY)\n-74 return _quadOffsetsBase[1];\n-75 return _quadOffsetsBase[0];\n-76 }\n+_\b6_\b1 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const { return _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs; }\n+_\b6_\b2 id _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const { return _\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br; }\n+_\b6_\b3 id _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br() const { return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br; }\n+64\n+_\b6_\b5 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const { return\n+_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs; }\n+_\b6_\b6 id _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const { return\n+_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br; }\n+67\n+_\b6_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return (int)_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs.size(); }\n+_\b6_\b9 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs(int fvarChannel = 0) const\n+{ return _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs[fvarChannel]; }\n+_\b7_\b0 id _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const { return\n+_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel]; }\n+_\b7_\b1 id _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const { return\n+_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel]; }\n+72\n+73protected:\n+_\b7_\b4 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+75\n+_\b7_\b6 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n 77\n-78private:\n-79 id _vertexBuffer;\n-80 id _vertexValenceBuffer;\n-81 id _quadOffsetsBuffer;\n-82 int _quadOffsetsBase[2];\n-83};\n+_\b7_\b8 id _\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+_\b7_\b9 id _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n+80\n+_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+82\n+_\b8_\b3 id _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n 84\n-85} //end namespace Osd\n-86\n-87} //end namespace OPENSUBDIV_VERSION\n-88using namespace OPENSUBDIV_VERSION;\n+_\b8_\b5 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+_\b8_\b6 std::vector> _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs;\n+_\b8_\b7 std::vector> _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs;\n+88};\n 89\n-90} //end namespace OpenSuddiv\n+90} // end namespace Osd\n 91\n-92#endif // OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n+92} //end namespace OPENSUBDIV_VERSION\n+93using namespace OPENSUBDIV_VERSION;\n+94\n+95} //end namespace OpenSubdiv\n+96\n+97#endif //end OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n-@ GREGORY_BOUNDARY\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchArray > PatchArrayVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n Container for arrays of parametric patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be\n-int GetQuadOffsetsBase(Far::PatchDescriptor::Type type)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const\n-*farPatchTable, DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetVertexValenceBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetQuadOffsetsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const\n-*farPatchTable, MTLContext *context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-void UpdateVertexBuffer(id< MTLBuffer > vbo, int numVertices, int\n-numVertexElements, MTLContext *context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\b~_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-~MTLLegacyGregoryPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetVertexBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetPatchArrays() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(Far::PatchTable const *farPatchTable, MTLContext *context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext\n+*context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetVaryingPatchIndexBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs\n+std::vector< id< MTLBuffer > > _fvarIndexBuffers\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetFVarPatchParamBuffer(int fvarChannel=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+MTLPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetPatchParamBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetPatchIndexBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector _patchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg\n+id< MTLBuffer > VertexBufferBinding\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n+int GetNumFVarChannels() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > _varyingPatchIndexBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs\n+std::vector< id< MTLBuffer > > _fvarParamBuffers\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+std::vector< PatchArrayVector > _fvarPatchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > _patchParamBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector _varyingPatchArrays\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static MTLPatchTable * Create(Far::PatchTable const *farPatchTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+~MTLPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetFVarPatchIndexBuffer(int fvarChannel=0) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n+PatchArrayVector const & GetVaryingPatchArrays() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > _indexBuffer\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00818.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00818.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlPatchTable.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlLegacyGregoryPatchTable.h File Reference\n \n \n \n \n \n \n \n@@ -90,45 +90,42 @@\n \n \n \n
\n \n-
mtlPatchTable.h File Reference
\n+
mtlLegacyGregoryPatchTable.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchDescriptor.h"
\n+#include "../far/patchTable.h"
\n #include "../osd/nonCopyable.h"
\n-#include "../osd/types.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n+\n \n

\n Classes

class  MTLPatchTable
class  MTLLegacyGregoryPatchTable
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlPatchTable.h File Reference\n+mtlLegacyGregoryPatchTable.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n #include \"../osd/nonCopyable.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+class \u00a0 _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00818.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00818.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00818 = [\n- [\"MTLPatchTable\", \"a01305.html\", \"a01305\"]\n+ [\"MTLLegacyGregoryPatchTable\", \"a01297.html\", \"a01297\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00818_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00818_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlPatchTable.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlLegacyGregoryPatchTable.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlPatchTable.h
\n+
mtlLegacyGregoryPatchTable.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,123 +119,112 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n-
26#define OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n+
26#define OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../far/patchDescriptor.h"
\n+
29#include "../far/patchTable.h"
\n
30#include "../osd/nonCopyable.h"
\n-
31#include "../osd/types.h"
\n-
32#include "../osd/mtlCommon.h"
\n-
33
\n-
34@protocol MTLDevice;
\n-
35@protocol MTLBuffer;
\n-
36
\n-
37namespace OpenSubdiv {
\n-
38namespace OPENSUBDIV_VERSION {
\n-
39
\n-
40namespace Far {
\n-
41 class PatchTable;
\n-
42};
\n-
43
\n-
44namespace Osd {
\n-
45
\n-
\n-
46class MTLPatchTable : private NonCopyable<MTLPatchTable> {
\n-
47public:
\n-
48 typedef id<MTLBuffer> VertexBufferBinding;
\n-
49
\n-\n-\n-
52
\n-
53 template<typename DEVICE_CONTEXT>
\n-
\n-
54 static MTLPatchTable *Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n-
55 {
\n-
56 return Create(farPatchTable, context);
\n-
57 }
\n+
31#include "../osd/mtlCommon.h"
\n+
32
\n+
33@protocol MTLDevice;
\n+
34@protocol MTLBuffer;
\n+
35
\n+
36namespace OpenSubdiv {
\n+
37namespace OPENSUBDIV_VERSION {
\n+
38
\n+
39namespace Osd {
\n+
40
\n+
\n+\n+
42: private NonCopyable<MTLLegacyGregoryPatchTable>
\n+
43{
\n+
44public:
\n+\n+
46
\n+
47 template<typename DEVICE_CONTEXT>
\n+
\n+
48 static MTLLegacyGregoryPatchTable* Create(Far::PatchTable const* farPatchTable, DEVICE_CONTEXT context) {
\n+
49 return Create(farPatchTable, context);
\n+
50 }
\n+
\n+
51
\n+
52 static MTLLegacyGregoryPatchTable* Create(Far::PatchTable const* farPatchTable, MTLContext* context);
\n+
53
\n+
54 void UpdateVertexBuffer(id<MTLBuffer> vbo, int numVertices, int numVertexElements, MTLContext* context);
\n+
55
\n+
\n+
56 id<MTLBuffer> GetVertexBuffer() const
\n+
57 {
\n+
58 return _vertexBuffer;
\n+
59 }
\n
\n-
58
\n-
59 static MTLPatchTable *Create(Far::PatchTable const *farPatchTable, MTLContext* context);
\n
60
\n-
61 PatchArrayVector const &GetPatchArrays() const { return _patchArrays; }
\n-
62 id<MTLBuffer> GetPatchIndexBuffer() const { return _indexBuffer; }
\n-
63 id<MTLBuffer> GetPatchParamBuffer() const { return _patchParamBuffer; }
\n-
64
\n-\n-
66 id<MTLBuffer> GetVaryingPatchIndexBuffer() const { return _varyingPatchIndexBuffer; }
\n-
67
\n-
68 int GetNumFVarChannels() const { return (int)_fvarPatchArrays.size(); }
\n-
69 PatchArrayVector const &GetFVarPatchArrays(int fvarChannel = 0) const { return _fvarPatchArrays[fvarChannel]; }
\n-
70 id<MTLBuffer> GetFVarPatchIndexBuffer(int fvarChannel = 0) const { return _fvarIndexBuffers[fvarChannel]; }
\n-
71 id<MTLBuffer> GetFVarPatchParamBuffer(int fvarChannel = 0) const { return _fvarParamBuffers[fvarChannel]; }
\n-
72
\n-
73protected:
\n-
74 bool allocate(Far::PatchTable const *farPatchTable, MTLContext* context);
\n-
75
\n-\n+
\n+
61 id<MTLBuffer> GetVertexValenceBuffer() const
\n+
62 {
\n+
63 return _vertexValenceBuffer;
\n+
64 }
\n+
\n+
65
\n+
\n+
66 id<MTLBuffer> GetQuadOffsetsBuffer() const
\n+
67 {
\n+
68 return _quadOffsetsBuffer;
\n+
69 }
\n+
\n+
70
\n+
\n+\n+
72 {
\n+\n+
74 return _quadOffsetsBase[1];
\n+
75 return _quadOffsetsBase[0];
\n+
76 }
\n+
\n
77
\n-
78 id<MTLBuffer> _indexBuffer;
\n-
79 id<MTLBuffer> _patchParamBuffer;
\n-
80
\n-\n-
82
\n-\n-
84
\n-
85 std::vector<PatchArrayVector> _fvarPatchArrays;
\n-
86 std::vector<id<MTLBuffer>> _fvarIndexBuffers;
\n-
87 std::vector<id<MTLBuffer>> _fvarParamBuffers;
\n-
88};
\n+
78private:
\n+
79 id<MTLBuffer> _vertexBuffer;
\n+
80 id<MTLBuffer> _vertexValenceBuffer;
\n+
81 id<MTLBuffer> _quadOffsetsBuffer;
\n+
82 int _quadOffsetsBase[2];
\n+
83};
\n
\n+
84
\n+
85} //end namespace Osd
\n+
86
\n+
87} //end namespace OPENSUBDIV_VERSION
\n+
88using namespace OPENSUBDIV_VERSION;
\n
89
\n-
90} // end namespace Osd
\n+
90} //end namespace OpenSuddiv
\n
91
\n-
92} //end namespace OPENSUBDIV_VERSION
\n-
93using namespace OPENSUBDIV_VERSION;
\n-
94
\n-
95} //end namespace OpenSubdiv
\n-
96
\n-
97#endif //end OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H
\n+
92#endif // OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H
\n \n-
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-\n-\n-
PatchArrayVector const & GetPatchArrays() const
\n-
bool allocate(Far::PatchTable const *farPatchTable, MTLContext *context)
\n-
static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n-\n-
std::vector< id< MTLBuffer > > _fvarIndexBuffers
\n-
id< MTLBuffer > GetFVarPatchParamBuffer(int fvarChannel=0) const
\n-\n-\n-\n-\n-\n-\n-
PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const
\n-\n-
std::vector< id< MTLBuffer > > _fvarParamBuffers
\n-
std::vector< PatchArrayVector > _fvarPatchArrays
\n-\n-\n-
static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n-\n-
id< MTLBuffer > GetFVarPatchIndexBuffer(int fvarChannel=0) const
\n-
PatchArrayVector const & GetVaryingPatchArrays() const
\n-\n+\n+\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+\n+\n+
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n+\n+\n+
static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext *context)
\n+
void UpdateVertexBuffer(id< MTLBuffer > vbo, int numVertices, int numVertexElements, MTLContext *context)
\n+\n+\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlPatchTable.h\n+mtlLegacyGregoryPatchTable.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,170 +24,127 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n-26#define OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n+26#define OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n 27\n 28#include \"../version.h\"\n-29#include \"../far/patchDescriptor.h\"\n+29#include \"../far/patchTable.h\"\n 30#include \"../osd/nonCopyable.h\"\n-31#include \"../osd/types.h\"\n-32#include \"../osd/mtlCommon.h\"\n-33\n-34@protocol MTLDevice;\n-35@protocol MTLBuffer;\n-36\n-37namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-38namespace OPENSUBDIV_VERSION {\n-39\n-40namespace Far {\n-41 class PatchTable;\n-42};\n-43\n-44namespace Osd {\n-45\n-_\b4_\b6class _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be : private NonCopyable {\n-47public:\n-_\b4_\b8 typedef id _\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg;\n-49\n-_\b5_\b0 _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-_\b5_\b1 _\b~_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n-52\n-53 template\n-_\b5_\b4 static _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n-DEVICE_CONTEXT context)\n-55 {\n-56 return _\bC_\br_\be_\ba_\bt_\be(farPatchTable, context);\n-57 }\n-58\n-_\b5_\b9 static _\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable,\n-_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+31#include \"../osd/mtlCommon.h\"\n+32\n+33@protocol MTLDevice;\n+34@protocol MTLBuffer;\n+35\n+36namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+37namespace OPENSUBDIV_VERSION {\n+38\n+39namespace Osd {\n+40\n+_\b4_\b1class _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+42: private NonCopyable\n+43{\n+44public:\n+_\b4_\b5 _\b~_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be();\n+46\n+47 template\n+_\b4_\b8 static _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be* _\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const*\n+farPatchTable, DEVICE_CONTEXT context) {\n+49 return Create(farPatchTable, context);\n+50 }\n+51\n+_\b5_\b2 static _\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be* _\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const*\n+farPatchTable, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+53\n+_\b5_\b4 void _\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(id vbo, int numVertices, int\n+numVertexElements, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+55\n+_\b5_\b6 id _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const\n+57 {\n+58 return _vertexBuffer;\n+59 }\n 60\n-_\b6_\b1 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const { return _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs; }\n-_\b6_\b2 id _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const { return _\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br; }\n-_\b6_\b3 id _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br() const { return _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br; }\n-64\n-_\b6_\b5 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs() const { return\n-_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs; }\n-_\b6_\b6 id _\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br() const { return\n-_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br; }\n-67\n-_\b6_\b8 int _\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs() const { return (int)_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs.size(); }\n-_\b6_\b9 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br const &_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs(int fvarChannel = 0) const\n-{ return _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs[fvarChannel]; }\n-_\b7_\b0 id _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const { return\n-_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel]; }\n-_\b7_\b1 id _\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br(int fvarChannel = 0) const { return\n-_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs[fvarChannel]; }\n-72\n-73protected:\n-_\b7_\b4 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be const *farPatchTable, _\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-75\n-_\b7_\b6 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n+_\b6_\b1 id _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bB_\bu_\bf_\bf_\be_\br() const\n+62 {\n+63 return _vertexValenceBuffer;\n+64 }\n+65\n+_\b6_\b6 id _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const\n+67 {\n+68 return _quadOffsetsBuffer;\n+69 }\n+70\n+_\b7_\b1 int _\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type)\n+72 {\n+73 if(type == _\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY)\n+74 return _quadOffsetsBase[1];\n+75 return _quadOffsetsBase[0];\n+76 }\n 77\n-_\b7_\b8 id _\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n-_\b7_\b9 id _\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br;\n-80\n-_\b8_\b1 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-82\n-_\b8_\b3 id _\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br;\n+78private:\n+79 id _vertexBuffer;\n+80 id _vertexValenceBuffer;\n+81 id _quadOffsetsBuffer;\n+82 int _quadOffsetsBase[2];\n+83};\n 84\n-_\b8_\b5 std::vector _\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs;\n-_\b8_\b6 std::vector> _\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs;\n-_\b8_\b7 std::vector> _\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs;\n-88};\n+85} //end namespace Osd\n+86\n+87} //end namespace OPENSUBDIV_VERSION\n+88using namespace OPENSUBDIV_VERSION;\n 89\n-90} // end namespace Osd\n+90} //end namespace OpenSuddiv\n 91\n-92} //end namespace OPENSUBDIV_VERSION\n-93using namespace OPENSUBDIV_VERSION;\n-94\n-95} //end namespace OpenSubdiv\n-96\n-97#endif //end OPENSUBDIV3_OSD_MTL_PATCH_TABLE_H\n+92#endif // OPENSUBDIV3_OSD_MTL_LEGACY_GREGORY_PATCH_TABLE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchArray > PatchArrayVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\bR_\bE_\bG_\bO_\bR_\bY_\b__\bB_\bO_\bU_\bN_\bD_\bA_\bR_\bY\n+@ GREGORY_BOUNDARY\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n Container for arrays of parametric patches.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b5\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetPatchArrays() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(Far::PatchTable const *farPatchTable, MTLContext *context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static MTLPatchTable * Create(Far::PatchTable const *farPatchTable, MTLContext\n-*context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetVaryingPatchIndexBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bs\n-std::vector< id< MTLBuffer > > _fvarIndexBuffers\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetFVarPatchParamBuffer(int fvarChannel=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-MTLPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetPatchParamBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetPatchIndexBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector _patchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\bB_\bi_\bn_\bd_\bi_\bn_\bg\n-id< MTLBuffer > VertexBufferBinding\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bF_\bV_\ba_\br_\bC_\bh_\ba_\bn_\bn_\be_\bl_\bs\n-int GetNumFVarChannels() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetFVarPatchArrays(int fvarChannel=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > _varyingPatchIndexBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br_\bs\n-std::vector< id< MTLBuffer > > _fvarParamBuffers\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bf_\bv_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-std::vector< PatchArrayVector > _fvarPatchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bp_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > _patchParamBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bv_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector _varyingPatchArrays\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static MTLPatchTable * Create(Far::PatchTable const *farPatchTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n-~MTLPatchTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bF_\bV_\ba_\br_\bP_\ba_\bt_\bc_\bh_\bI_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > GetFVarPatchIndexBuffer(int fvarChannel=0) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bV_\ba_\br_\by_\bi_\bn_\bg_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bs\n-PatchArrayVector const & GetVaryingPatchArrays() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b__\bi_\bn_\bd_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > _indexBuffer\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\ba_\bs_\be\n+int GetQuadOffsetsBase(Far::PatchDescriptor::Type type)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const\n+*farPatchTable, DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bV_\ba_\bl_\be_\bn_\bc_\be_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetVertexValenceBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bQ_\bu_\ba_\bd_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetQuadOffsetsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static MTLLegacyGregoryPatchTable * Create(Far::PatchTable const\n+*farPatchTable, MTLContext *context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bU_\bp_\bd_\ba_\bt_\be_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+void UpdateVertexBuffer(id< MTLBuffer > vbo, int numVertices, int\n+numVertexElements, MTLContext *context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\b~_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be\n+~MTLLegacyGregoryPatchTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > GetVertexBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b6\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bL_\be_\bg_\ba_\bc_\by_\bG_\br_\be_\bg_\bo_\br_\by_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00821.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00821.html", "unified_diff": "@@ -95,16 +95,16 @@\n Classes |\n Namespaces
\n
mtlComputeEvaluator.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../osd/types.h"
\n-#include "../osd/bufferDescriptor.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/bufferDescriptor.h"
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00821_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00821_source.html", "unified_diff": "@@ -1184,18 +1184,18 @@\n
2163using namespace OPENSUBDIV_VERSION;
\n
2164
\n
2165} //end namespace OpenSubdiv
\n
2166
\n
2167#endif // OPENSUBDIV3_OSD_MTL_COMPUTE_EVALUATOR_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n \n
MTLStencilTable(Far::LimitStencilTable const *stencilTable, MTLContext *context)
\n \n \n \n
MTLStencilTable(Far::StencilTable const *stencilTable, MTLContext *context)
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00824.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00824.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h File Reference\n+OpenSubdiv: opensubdiv/osd/mtlVertexBuffer.h File Reference\n \n \n \n \n \n \n \n@@ -90,27 +90,25 @@\n \n \n \n
\n \n-
hlslPatchShaderSource.h File Reference
\n+
mtlVertexBuffer.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/patchDescriptor.h"
\n-#include <string>
\n+#include "../osd/mtlCommon.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MTLStencilTable
 
\n \n-\n-\n+\n \n

\n Classes

class  HLSLPatchShaderSource
 Provides shader source which can be used by client code. More...
class  CPUMTLVertexBuffer
 
\n \n \n \n \n@@ -119,13 +117,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,23 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-hlslPatchShaderSource.h File Reference\n+mtlVertexBuffer.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-\u00a0 Provides shader source which can be used by client code. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00824.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00824.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00824 = [\n- [\"HLSLPatchShaderSource\", \"a01265.html\", null]\n+ [\"CPUMTLVertexBuffer\", \"a01309.html\", \"a01309\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00824_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00824_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h Source File\n+OpenSubdiv: opensubdiv/osd/mtlVertexBuffer.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
hlslPatchShaderSource.h
\n+
mtlVertexBuffer.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,68 +119,97 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n-
26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
25#ifndef OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n+
26#define OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n
27
\n
28#include "../version.h"
\n-
29
\n-
30#include "../far/patchDescriptor.h"
\n-
31
\n-
32#include <string>
\n+
29#include "../osd/mtlCommon.h"
\n+
30
\n+
31@protocol MTLDevice;
\n+
32@protocol MTLBuffer;
\n
33
\n
34namespace OpenSubdiv {
\n
35namespace OPENSUBDIV_VERSION {
\n
36
\n
37namespace Osd {
\n
38
\n-
\n-\n-
41public:
\n-
45 static std::string GetPatchBasisShaderSource();
\n-
46
\n-
50 static std::string GetPatchDrawingShaderSource();
\n-
51
\n-
59
\n-
60 static std::string GetCommonShaderSource();
\n-
61
\n-\n-
63
\n-\n-
65
\n-\n-
67
\n-
69};
\n-
\n-
70
\n-
71} // end namespace Osd
\n-
72
\n-
73} // end namespace OPENSUBDIV_VERSION
\n-
74using namespace OPENSUBDIV_VERSION;
\n+
\n+\n+
40public:
\n+
41 static CPUMTLVertexBuffer* Create(int numElements, int numVertices, MTLContext* context);
\n+
42
\n+
43 void UpdateData(const float* src, int startVertex, int numVertices, MTLContext* context);
\n+
44
\n+
\n+
45 int GetNumElements() const
\n+
46 {
\n+
47 return _numElements;
\n+
48 }
\n+
\n+
49
\n+
\n+
50 int GetNumVertices() const
\n+
51 {
\n+
52 return _numVertices;
\n+
53 }
\n+
\n+
54
\n+
55 float* BindCpuBuffer();
\n+
56 id<MTLBuffer> BindMTLBuffer(MTLContext* context);
\n+
57
\n+
\n+
58 id<MTLBuffer> BindVBO(MTLContext* context)
\n+
59 {
\n+
60 return BindMTLBuffer(context);
\n+
61 }
\n+
\n+
62
\n+
63protected:
\n+
64
\n+
65 CPUMTLVertexBuffer(int numElements, int numVertices);
\n+
66
\n+
67 bool allocate(MTLContext* context);
\n+
68
\n+
69private:
\n+
70 int _numElements;
\n+
71 int _numVertices;
\n+
72 id<MTLBuffer> _buffer;
\n+
73 bool _dirty;
\n+
74};
\n+
\n
75
\n-
76} // end namespace OpenSubdiv
\n+
76} //end namespace Osd
\n
77
\n-
78#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
78} //end namespace OPENSUBDIV_VERSION
\n+
79 using namespace OPENSUBDIV_VERSION;
\n+
80
\n+
81} //end namespace OpenSubdiv
\n+
82
\n+
83#endif // OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n \n-\n-
Provides shader source which can be used by client code.
\n-
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetPatchDrawingShaderSource()
Returns shader source which can be used while drawing piecewise parametric patches resulting from sub...
\n-
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n-
static std::string GetPatchBasisShaderSource()
Returns shader source which can be used to evaluate position and first and second derivatives on piec...
\n-\n+\n+\n+\n+
CPUMTLVertexBuffer(int numElements, int numVertices)
\n+
static CPUMTLVertexBuffer * Create(int numElements, int numVertices, MTLContext *context)
\n+\n+
void UpdateData(const float *src, int startVertex, int numVertices, MTLContext *context)
\n+\n+
id< MTLBuffer > BindMTLBuffer(MTLContext *context)
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-hlslPatchShaderSource.h\n+mtlVertexBuffer.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,79 +24,101 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n-26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+25#ifndef OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n+26#define OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n 27\n 28#include \"../version.h\"\n-29\n-30#include \"../far/patchDescriptor.h\"\n-31\n-32#include \n+29#include \"../osd/mtlCommon.h\"\n+30\n+31@protocol MTLDevice;\n+32@protocol MTLBuffer;\n 33\n 34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n 35namespace OPENSUBDIV_VERSION {\n 36\n 37namespace Osd {\n 38\n-_\b4_\b0class _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n-41public:\n-_\b4_\b5 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n-46\n-_\b5_\b0 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\br_\ba_\bw_\bi_\bn_\bg_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n-51\n-59\n-_\b6_\b0 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n-61\n-_\b6_\b2 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-63\n-_\b6_\b4 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-65\n-_\b6_\b6 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n-67\n-69};\n-70\n-71} // end namespace Osd\n-72\n-73} // end namespace OPENSUBDIV_VERSION\n-74using namespace OPENSUBDIV_VERSION;\n+_\b3_\b9class _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n+40public:\n+_\b4_\b1 static _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br* _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n+_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+42\n+_\b4_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float* src, int startVertex, int numVertices,\n+_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+44\n+_\b4_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const\n+46 {\n+47 return _numElements;\n+48 }\n+49\n+_\b5_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const\n+51 {\n+52 return _numVertices;\n+53 }\n+54\n+_\b5_\b5 float* _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n+_\b5_\b6 id _\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+57\n+_\b5_\b8 id _\bB_\bi_\bn_\bd_\bV_\bB_\bO(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context)\n+59 {\n+60 return _\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br(context);\n+61 }\n+62\n+63protected:\n+64\n+_\b6_\b5 _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n+66\n+_\b6_\b7 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+68\n+69private:\n+70 int _numElements;\n+71 int _numVertices;\n+72 id _buffer;\n+73 bool _dirty;\n+74};\n 75\n-76} // end namespace OpenSubdiv\n+76} //end namespace Osd\n 77\n-78#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+78} //end namespace OPENSUBDIV_VERSION\n+79 using namespace OPENSUBDIV_VERSION;\n+80\n+81} //end namespace OpenSubdiv\n+82\n+83#endif // OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n-Type\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-Provides shader source which can be used by client code.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\br_\ba_\bw_\bi_\bn_\bg_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetPatchDrawingShaderSource()\n-Returns shader source which can be used while drawing piecewise parametric\n-patches resulting from sub...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetPatchBasisShaderSource()\n-Returns shader source which can be used to evaluate position and first and\n-second derivatives on piec...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n-_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n-static std::string GetCommonShaderSource()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n+id< MTLBuffer > BindVBO(MTLContext *context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+CPUMTLVertexBuffer(int numElements, int numVertices)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CPUMTLVertexBuffer * Create(int numElements, int numVertices, MTLContext\n+*context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int GetNumElements() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices, MTLContext\n+*context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b5_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br\n+id< MTLBuffer > BindMTLBuffer(MTLContext *context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n+float * BindCpuBuffer()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(MTLContext *context)\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n+ * _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlVertexBuffer.h File Reference\n+OpenSubdiv: opensubdiv/osd/d3d11Mesh.h File Reference\n \n \n \n \n \n \n \n@@ -88,42 +88,43 @@\n \n \n \n \n \n
\n \n-
mtlVertexBuffer.h File Reference
\n+Namespaces |\n+Typedefs
\n+
d3d11Mesh.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/mtlCommon.h"
\n+#include "../osd/mesh.h"
\n+#include "../osd/d3d11PatchTable.h"
\n
\n

Go to the source code of this file.

\n \n-\n-\n-\n-

\n-Classes

class  CPUMTLVertexBuffer
 
\n \n \n \n \n \n \n \n+

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n+\n+\n+\n

\n+Typedefs

typedef MeshInterface< D3D11PatchTableD3D11MeshInterface
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,23 +1,24 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-mtlVertexBuffer.h File Reference\n+_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n+d3d11Mesh.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bd_\b3_\bd_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n-C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n+T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n+typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00827 = [\n- [\"CPUMTLVertexBuffer\", \"a01309.html\", \"a01309\"]\n+ [\"D3D11MeshInterface\", \"a00827.html#ae5c8e80d05d6eaee105d8eecfa9ab609\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00827_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00827_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/mtlVertexBuffer.h Source File\n+OpenSubdiv: opensubdiv/osd/d3d11Mesh.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
mtlVertexBuffer.h
\n+
d3d11Mesh.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,97 +119,45 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n-
26#define OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n+
25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H
\n+
26#define OPENSUBDIV3_OSD_D3D11MESH_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../osd/mtlCommon.h"
\n-
30
\n-
31@protocol MTLDevice;
\n-
32@protocol MTLBuffer;
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Osd {
\n-
38
\n-
\n-\n-
40public:
\n-
41 static CPUMTLVertexBuffer* Create(int numElements, int numVertices, MTLContext* context);
\n+
29
\n+
30#include "../osd/mesh.h"
\n+
31#include "../osd/d3d11PatchTable.h"
\n+
32
\n+
33namespace OpenSubdiv {
\n+
34namespace OPENSUBDIV_VERSION {
\n+
35
\n+
36namespace Osd {
\n+
37
\n+\n+
39
\n+
40
\n+
41} // end namespace Osd
\n
42
\n-
43 void UpdateData(const float* src, int startVertex, int numVertices, MTLContext* context);
\n-
44
\n-
\n-
45 int GetNumElements() const
\n-
46 {
\n-
47 return _numElements;
\n-
48 }
\n-
\n-
49
\n-
\n-
50 int GetNumVertices() const
\n-
51 {
\n-
52 return _numVertices;
\n-
53 }
\n-
\n-
54
\n-
55 float* BindCpuBuffer();
\n-
56 id<MTLBuffer> BindMTLBuffer(MTLContext* context);
\n-
57
\n-
\n-
58 id<MTLBuffer> BindVBO(MTLContext* context)
\n-
59 {
\n-
60 return BindMTLBuffer(context);
\n-
61 }
\n-
\n-
62
\n-
63protected:
\n-
64
\n-
65 CPUMTLVertexBuffer(int numElements, int numVertices);
\n-
66
\n-
67 bool allocate(MTLContext* context);
\n-
68
\n-
69private:
\n-
70 int _numElements;
\n-
71 int _numVertices;
\n-
72 id<MTLBuffer> _buffer;
\n-
73 bool _dirty;
\n-
74};
\n-
\n-
75
\n-
76} //end namespace Osd
\n-
77
\n-
78} //end namespace OPENSUBDIV_VERSION
\n-
79 using namespace OPENSUBDIV_VERSION;
\n-
80
\n-
81} //end namespace OpenSubdiv
\n-
82
\n-
83#endif // OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H
\n+
43} // end namespace OPENSUBDIV_VERSION
\n+
44using namespace OPENSUBDIV_VERSION;
\n+
45
\n+
46} // end namespace OpenSubdiv
\n+
47
\n+
48#endif // OPENSUBDIV3_OSD_D3D11MESH_H
\n \n-\n-\n-\n-
CPUMTLVertexBuffer(int numElements, int numVertices)
\n-
static CPUMTLVertexBuffer * Create(int numElements, int numVertices, MTLContext *context)
\n-\n-
void UpdateData(const float *src, int startVertex, int numVertices, MTLContext *context)
\n-\n-
id< MTLBuffer > BindMTLBuffer(MTLContext *context)
\n-\n-\n+
MeshInterface< D3D11PatchTable > D3D11MeshInterface
Definition d3d11Mesh.h:38
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-mtlVertexBuffer.h\n+d3d11Mesh.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,101 +24,42 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n-26#define OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n+25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H\n+26#define OPENSUBDIV3_OSD_D3D11MESH_H\n 27\n 28#include \"../version.h\"\n-29#include \"../osd/mtlCommon.h\"\n-30\n-31@protocol MTLDevice;\n-32@protocol MTLBuffer;\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Osd {\n-38\n-_\b3_\b9class _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n-40public:\n-_\b4_\b1 static _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br* _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n-_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n+29\n+30#include \"../osd/mesh.h\"\n+31#include \"../osd/d3d11PatchTable.h\"\n+32\n+33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+34namespace OPENSUBDIV_VERSION {\n+35\n+36namespace Osd {\n+37\n+_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n+39\n+40\n+41} // end namespace Osd\n 42\n-_\b4_\b3 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float* src, int startVertex, int numVertices,\n-_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-44\n-_\b4_\b5 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const\n-46 {\n-47 return _numElements;\n-48 }\n-49\n-_\b5_\b0 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const\n-51 {\n-52 return _numVertices;\n-53 }\n-54\n-_\b5_\b5 float* _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n-_\b5_\b6 id _\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-57\n-_\b5_\b8 id _\bB_\bi_\bn_\bd_\bV_\bB_\bO(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context)\n-59 {\n-60 return _\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br(context);\n-61 }\n-62\n-63protected:\n-64\n-_\b6_\b5 _\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n-66\n-_\b6_\b7 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt* context);\n-68\n-69private:\n-70 int _numElements;\n-71 int _numVertices;\n-72 id _buffer;\n-73 bool _dirty;\n-74};\n-75\n-76} //end namespace Osd\n-77\n-78} //end namespace OPENSUBDIV_VERSION\n-79 using namespace OPENSUBDIV_VERSION;\n-80\n-81} //end namespace OpenSubdiv\n-82\n-83#endif // OPENSUBDIV3_OSD_MTL_VERTEX_BUFFER_H\n+43} // end namespace OPENSUBDIV_VERSION\n+44using namespace OPENSUBDIV_VERSION;\n+45\n+46} // end namespace OpenSubdiv\n+47\n+48#endif // OPENSUBDIV3_OSD_D3D11MESH_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\bT_\bL_\bC_\bo_\bn_\bt_\be_\bx_\bt\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bC_\bo_\bm_\bm_\bo_\bn_\b._\bh_\b:_\b4_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n-id< MTLBuffer > BindVBO(MTLContext *context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-CPUMTLVertexBuffer(int numElements, int numVertices)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CPUMTLVertexBuffer * Create(int numElements, int numVertices, MTLContext\n-*context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int GetNumElements() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices, MTLContext\n-*context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b5_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bM_\bT_\bL_\bB_\bu_\bf_\bf_\be_\br\n-id< MTLBuffer > BindMTLBuffer(MTLContext *context)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n-float * BindCpuBuffer()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bP_\bU_\bM_\bT_\bL_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(MTLContext *context)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+MeshInterface< D3D11PatchTable > D3D11MeshInterface\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bm_\bt_\bl_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11Mesh.h File Reference\n+OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h File Reference\n \n \n \n \n \n \n \n@@ -88,43 +88,44 @@\n \n \n \n \n \n
\n \n-
d3d11Mesh.h File Reference
\n+Classes |\n+Namespaces
\n+
hlslPatchShaderSource.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../osd/mesh.h"
\n-#include "../osd/d3d11PatchTable.h"
\n+#include "../far/patchDescriptor.h"
\n+#include <string>
\n
\n

Go to the source code of this file.

\n \n+\n+\n+\n+\n+

\n+Classes

class  HLSLPatchShaderSource
 Provides shader source which can be used by client code. More...
 
\n \n \n \n \n \n \n \n-

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n-\n-\n-\n

\n-Typedefs

typedef MeshInterface< D3D11PatchTableD3D11MeshInterface
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,24 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-_\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs | _\bT_\by_\bp_\be_\bd_\be_\bf_\bs\n-d3d11Mesh.h File Reference\n+_\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n+hlslPatchShaderSource.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bm_\be_\bs_\bh_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bd_\b3_\bd_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n+C\bCl\bla\bas\bss\bse\bes\bs\n+class \u00a0 _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+\u00a0 Provides shader source which can be used by client code. _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n-T\bTy\byp\bpe\bed\bde\bef\bfs\bs\n-typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be< _\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be >\u00a0 _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-\u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00830 = [\n- [\"D3D11MeshInterface\", \"a00830.html#ae5c8e80d05d6eaee105d8eecfa9ab609\", null]\n+ [\"HLSLPatchShaderSource\", \"a01265.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00830_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00830_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11Mesh.h Source File\n+OpenSubdiv: opensubdiv/osd/hlslPatchShaderSource.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
d3d11Mesh.h
\n+
hlslPatchShaderSource.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,45 +119,68 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H
\n-
26#define OPENSUBDIV3_OSD_D3D11MESH_H
\n+
25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n+
26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/mesh.h"
\n-
31#include "../osd/d3d11PatchTable.h"
\n-
32
\n-
33namespace OpenSubdiv {
\n-
34namespace OPENSUBDIV_VERSION {
\n-
35
\n-
36namespace Osd {
\n-
37
\n-\n-
39
\n-
40
\n-
41} // end namespace Osd
\n-
42
\n-
43} // end namespace OPENSUBDIV_VERSION
\n-
44using namespace OPENSUBDIV_VERSION;
\n-
45
\n-
46} // end namespace OpenSubdiv
\n-
47
\n-
48#endif // OPENSUBDIV3_OSD_D3D11MESH_H
\n+
30#include "../far/patchDescriptor.h"
\n+
31
\n+
32#include <string>
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Osd {
\n+
38
\n+
\n+\n+
41public:
\n+
45 static std::string GetPatchBasisShaderSource();
\n+
46
\n+
50 static std::string GetPatchDrawingShaderSource();
\n+
51
\n+
59
\n+
60 static std::string GetCommonShaderSource();
\n+
61
\n+\n+
63
\n+\n+
65
\n+\n+
67
\n+
69};
\n+
\n+
70
\n+
71} // end namespace Osd
\n+
72
\n+
73} // end namespace OPENSUBDIV_VERSION
\n+
74using namespace OPENSUBDIV_VERSION;
\n+
75
\n+
76} // end namespace OpenSubdiv
\n+
77
\n+
78#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H
\n \n-
MeshInterface< D3D11PatchTable > D3D11MeshInterface
Definition d3d11Mesh.h:38
\n-\n+\n+
Provides shader source which can be used by client code.
\n+
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetPatchDrawingShaderSource()
Returns shader source which can be used while drawing piecewise parametric patches resulting from sub...
\n+
static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)
\n+
static std::string GetPatchBasisShaderSource()
Returns shader source which can be used to evaluate position and first and second derivatives on piec...
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-d3d11Mesh.h\n+hlslPatchShaderSource.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,42 +24,79 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_D3D11MESH_H\n-26#define OPENSUBDIV3_OSD_D3D11MESH_H\n+25#ifndef OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n+26#define OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/mesh.h\"\n-31#include \"../osd/d3d11PatchTable.h\"\n-32\n-33namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-34namespace OPENSUBDIV_VERSION {\n-35\n-36namespace Osd {\n-37\n-_\b3_\b8typedef _\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be_\b<_\bD_\b3_\bD_\b1_\b1_\bP_\ba_\bt_\bc_\bh_\bT_\ba_\bb_\bl_\be_\b> _\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be;\n-39\n-40\n-41} // end namespace Osd\n-42\n-43} // end namespace OPENSUBDIV_VERSION\n-44using namespace OPENSUBDIV_VERSION;\n-45\n-46} // end namespace OpenSubdiv\n-47\n-48#endif // OPENSUBDIV3_OSD_D3D11MESH_H\n+30#include \"../far/patchDescriptor.h\"\n+31\n+32#include \n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Osd {\n+38\n+_\b4_\b0class _\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be {\n+41public:\n+_\b4_\b5 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+46\n+_\b5_\b0 static std::string _\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\br_\ba_\bw_\bi_\bn_\bg_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+51\n+59\n+_\b6_\b0 static std::string _\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be();\n+61\n+_\b6_\b2 static std::string _\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+63\n+_\b6_\b4 static std::string _\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+65\n+_\b6_\b6 static std::string _\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be(_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be type);\n+67\n+69};\n+70\n+71} // end namespace Osd\n+72\n+73} // end namespace OPENSUBDIV_VERSION\n+74using namespace OPENSUBDIV_VERSION;\n+75\n+76} // end namespace OpenSubdiv\n+77\n+78#endif // OPENSUBDIV3_OSD_HLSL_PATCH_SHADER_SOURCE_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-MeshInterface< D3D11PatchTable > D3D11MeshInterface\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh_\b:_\b3_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bM_\be_\bs_\bh_\bI_\bn_\bt_\be_\br_\bf_\ba_\bc_\be\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bm_\be_\bs_\bh_\b._\bh_\b:_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bT_\by_\bp_\be\n+Type\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bp_\ba_\bt_\bc_\bh_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+Provides shader source which can be used by client code.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh_\b:_\b4_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bV_\be_\br_\bt_\be_\bx_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bD_\br_\ba_\bw_\bi_\bn_\bg_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetPatchDrawingShaderSource()\n+Returns shader source which can be used while drawing piecewise parametric\n+patches resulting from sub...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bD_\bo_\bm_\ba_\bi_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetDomainShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:_\bG_\be_\bt_\bH_\bu_\bl_\bl_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetHullShaderSource(Far::PatchDescriptor::Type type)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bP_\ba_\bt_\bc_\bh_\bB_\ba_\bs_\bi_\bs_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetPatchBasisShaderSource()\n+Returns shader source which can be used to evaluate position and first and\n+second derivatives on piec...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bH_\bL_\bS_\bL_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b:_\b:\n+_\bG_\be_\bt_\bC_\bo_\bm_\bm_\bo_\bn_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be\n+static std::string GetCommonShaderSource()\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bM_\be_\bs_\bh_\b._\bh\n+ * _\bh_\bl_\bs_\bl_\bP_\ba_\bt_\bc_\bh_\bS_\bh_\ba_\bd_\be_\br_\bS_\bo_\bu_\br_\bc_\be_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00836.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00836.html", "unified_diff": "@@ -95,15 +95,15 @@\n Classes |\n Namespaces \n
d3d11PatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n #include <vector>
\n-#include "../far/patchDescriptor.h"
\n+#include "../far/patchDescriptor.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/types.h"
\n
\n

Go to the source code of this file.

\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00836_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00836_source.html", "unified_diff": "@@ -204,15 +204,15 @@\n
95using namespace OPENSUBDIV_VERSION;
\n
96
\n
97} // end namespace OpenSubdiv
\n
98
\n
99#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n
static D3D11PatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n \n
bool allocate(Far::PatchTable const *farPatchTable, ID3D11DeviceContext *deviceContext)
\n \n \n
ID3D11Buffer * GetPatchIndexBuffer() const
Returns the index buffer containing the patch control vertices.
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00839.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00839.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
d3d11LegacyGregoryPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n+#include "../far/patchTable.h"
\n #include "../osd/nonCopyable.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00839_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00839_source.html", "unified_diff": "@@ -210,17 +210,17 @@\n
97} // end namespace OPENSUBDIV_VERSION
\n
98using namespace OPENSUBDIV_VERSION;
\n
99
\n
100} // end namespace OpenSubdiv
\n
101
\n
102#endif // OPENSUBDIV3_OSD_D3D11_LEGACY_GREGORY_PATCH_TABLE_H
\n \n-\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n
void UpdateVertexBuffer(ID3D11Buffer *vbo, int numVertices, int numVertexElements, ID3D11DeviceContext *pd3d11DeviceContext)
\n \n \n
static D3D11LegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, ID3D11DeviceContext *deviceContext)
\n \n
static D3D11LegacyGregoryPatchTable * Create(Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h File Reference\n \n \n \n \n \n \n \n@@ -90,45 +90,41 @@\n \n \n \n
\n \n-
d3d11ComputeEvaluator.h File Reference
\n+
cpuD3D11VertexBuffer.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n

\n Classes

class  D3D11LegacyGregoryPatchTable
\n \n-\n-\n-\n-\n+\n+\n \n

\n Classes

class  D3D11StencilTable
 D3D11 stencil table. More...
 
class  D3D11ComputeEvaluator
class  CpuD3D11VertexBuffer
 Concrete vertex buffer class for Cpu subdivision and DirectX drawing. More...
 
\n \n \n \n \n \n-\n-\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,28 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-d3d11ComputeEvaluator.h File Reference\n+cpuD3D11VertexBuffer.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-\u00a0 D3D11 stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n-\u00a0\n-class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+class \u00a0 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+\u00a0 Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n+ _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n-namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n-\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,3 @@\n var a00842 = [\n- [\"D3D11StencilTable\", \"a01197.html\", \"a01197\"],\n- [\"D3D11ComputeEvaluator\", \"a01201.html\", \"a01201\"]\n+ [\"CpuD3D11VertexBuffer\", \"a01161.html\", \"a01161\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00842_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00842_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
d3d11ComputeEvaluator.h
\n+
cpuD3D11VertexBuffer.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2015 Pixar
\n+
2// Copyright 2013 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,225 +119,91 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n
27
\n
28#include "../version.h"
\n-
29
\n-
30struct ID3D11DeviceContext;
\n+
29#include <cstddef>
\n+
30
\n
31struct ID3D11Buffer;
\n-
32struct ID3D11ComputeShader;
\n-
33struct ID3D11ClassLinkage;
\n-
34struct ID3D11ClassInstance;
\n-
35struct ID3D11ShaderResourceView;
\n-
36struct ID3D11UnorderedAccessView;
\n+
32struct ID3D11Device;
\n+
33struct ID3D11DeviceContext;
\n+
34
\n+
35namespace OpenSubdiv {
\n+
36namespace OPENSUBDIV_VERSION {
\n
37
\n-
38#include "../osd/bufferDescriptor.h"
\n+
38namespace Osd {
\n
39
\n-
40namespace OpenSubdiv {
\n-
41namespace OPENSUBDIV_VERSION {
\n-
42
\n-
43namespace Far {
\n-
44 class StencilTable;
\n-
45}
\n-
46
\n-
47namespace Osd {
\n-
48
\n-
\n-\n-
57public:
\n-
58 template <typename DEVICE_CONTEXT>
\n-
\n-
59 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n-
60 DEVICE_CONTEXT context) {
\n-
61 return new D3D11StencilTable(stencilTable, context->GetDeviceContext());
\n-
62 }
\n-
\n-
63
\n-
\n-
64 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n-
65 ID3D11DeviceContext *deviceContext) {
\n-
66 return new D3D11StencilTable(stencilTable, deviceContext);
\n-
67 }
\n-
\n-
68
\n-\n-
70 ID3D11DeviceContext *deviceContext);
\n-
71
\n-\n+
\n+\n+
49public:
\n+
51 static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,
\n+
52 ID3D11DeviceContext *deviceContext);
\n+
53
\n+\n+
56
\n+
59 void UpdateData(const float *src, int startVertex, int numVertices,
\n+
60 void *deviceContext = NULL);
\n+
61
\n+
63 int GetNumElements() const;
\n+
64
\n+
66 int GetNumVertices() const;
\n+
67
\n+
69 float * BindCpuBuffer();
\n+
70
\n+
72 ID3D11Buffer *BindD3D11Buffer(ID3D11DeviceContext *deviceContext);
\n
73
\n-
74 // interfaces needed for D3D11ComputeEvaluator
\n-
75 ID3D11ShaderResourceView *GetSizesSRV() const { return _sizes; }
\n-
76 ID3D11ShaderResourceView *GetOffsetsSRV() const { return _offsets; }
\n-
77 ID3D11ShaderResourceView *GetIndicesSRV() const { return _indices; }
\n-
78 ID3D11ShaderResourceView *GetWeightsSRV() const { return _weights; }
\n-
79 int GetNumStencils() const { return _numStencils; }
\n-
80
\n-
81private:
\n-
82 ID3D11ShaderResourceView *_sizes;
\n-
83 ID3D11ShaderResourceView *_offsets;
\n-
84 ID3D11ShaderResourceView *_indices;
\n-
85 ID3D11ShaderResourceView *_weights;
\n-
86 ID3D11Buffer *_sizesBuffer;
\n-
87 ID3D11Buffer *_offsetsBuffer;
\n-
88 ID3D11Buffer *_indicesBuffer;
\n-
89 ID3D11Buffer *_weightsBuffer;
\n-
90
\n-
91 int _numStencils;
\n-
92};
\n+
\n+
75 ID3D11Buffer *BindVBO(ID3D11DeviceContext *deviceContext) {
\n+
76 return BindD3D11Buffer(deviceContext);
\n+
77 }
\n+
\n+
78
\n+
79protected:
\n+
81 CpuD3D11VertexBuffer(int numElements, int numVertices);
\n+
82
\n+
83 bool allocate(ID3D11Device *device);
\n+
84
\n+
85private:
\n+
86 int _numElements;
\n+
87 int _numVertices;
\n+
88 ID3D11Buffer *_d3d11Buffer;
\n+
89 float *_cpuBuffer;
\n+
90};
\n
\n+
91
\n+
92} // end namespace Osd
\n
93
\n-
94// ---------------------------------------------------------------------------
\n-
95
\n-
\n-\n-
97public:
\n-
98 typedef bool Instantiatable;
\n-\n-
100 BufferDescriptor const &dstDesc,
\n-
101 BufferDescriptor const &duDesc,
\n-
102 BufferDescriptor const &dvDesc,
\n-
103 ID3D11DeviceContext *deviceContext);
\n-
104
\n-\n-
106 BufferDescriptor const &dstDesc,
\n-
107 BufferDescriptor const &duDesc,
\n-
108 BufferDescriptor const &dvDesc,
\n-
109 BufferDescriptor const &duuDesc,
\n-
110 BufferDescriptor const &duvDesc,
\n-
111 BufferDescriptor const &dvvDesc,
\n-
112 ID3D11DeviceContext *deviceContext);
\n-
113
\n-\n-
116
\n-\n-
119
\n-
147 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
148 static bool EvalStencils(
\n-
149 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
150 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
151 STENCIL_TABLE const *stencilTable,
\n-
152 D3D11ComputeEvaluator const *instance,
\n-
153 ID3D11DeviceContext * deviceContext) {
\n-
154 if (instance) {
\n-
155 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
156 dstBuffer, dstDesc,
\n-
157 stencilTable,
\n-
158 deviceContext);
\n-
159 } else {
\n-
160 // Create an instance on demand (slow)
\n-
161 (void)deviceContext; // unused
\n-
162 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
165 deviceContext);
\n-
166 if (instance) {
\n-
167 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
168 dstBuffer, dstDesc,
\n-
169 stencilTable,
\n-
170 deviceContext);
\n-
171 delete instance;
\n-
172 return r;
\n-
173 }
\n-
174 return false;
\n-
175 }
\n-
176 }
\n-
\n-
177
\n-
180 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
182 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
183 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
184 STENCIL_TABLE const *stencilTable,
\n-
185 ID3D11DeviceContext *deviceContext) const {
\n-
186 return EvalStencils(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,
\n-
187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,
\n-
188 stencilTable->GetSizesSRV(),
\n-
189 stencilTable->GetOffsetsSRV(),
\n-
190 stencilTable->GetIndicesSRV(),
\n-
191 stencilTable->GetWeightsSRV(),
\n-
192 /* start = */ 0,
\n-
193 /* end = */ stencilTable->GetNumStencils(),
\n-
194 deviceContext);
\n-
195 }
\n-
\n-
196
\n-
199 bool EvalStencils(ID3D11UnorderedAccessView *srcSRV,
\n-
200 BufferDescriptor const &srcDesc,
\n-
201 ID3D11UnorderedAccessView *dstUAV,
\n-
202 BufferDescriptor const &dstDesc,
\n-
203 ID3D11ShaderResourceView *sizesSRV,
\n-
204 ID3D11ShaderResourceView *offsetsSRV,
\n-
205 ID3D11ShaderResourceView *indicesSRV,
\n-
206 ID3D11ShaderResourceView *weightsSRV,
\n-
207 int start,
\n-
208 int end,
\n-
209 ID3D11DeviceContext *deviceContext) const;
\n-
210
\n-
212 bool Compile(BufferDescriptor const &srcDesc,
\n-
213 BufferDescriptor const &dstDesc,
\n-
214 ID3D11DeviceContext *deviceContext);
\n-
215
\n-
217 static void Synchronize(ID3D11DeviceContext *deviceContext);
\n-
218
\n-
219private:
\n-
220 ID3D11ComputeShader * _computeShader;
\n-
221 ID3D11ClassLinkage * _classLinkage;
\n-
222 ID3D11ClassInstance * _singleBufferKernel;
\n-
223 ID3D11ClassInstance * _separateBufferKernel;
\n-
224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels
\n-
225
\n-
226 int _workGroupSize;
\n-
227};
\n-
\n-
228
\n-
229} // end namespace Osd
\n-
230
\n-
231} // end namespace OPENSUBDIV_VERSION
\n-
232using namespace OPENSUBDIV_VERSION;
\n-
233
\n-
234} // end namespace OpenSubdiv
\n-
235
\n-
236
\n-
237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
94} // end namespace OPENSUBDIV_VERSION
\n+
95using namespace OPENSUBDIV_VERSION;
\n+
96
\n+
97} // end namespace OpenSubdiv
\n+
98
\n+
99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n \n-
Stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
\n-\n-\n-\n-\n-
D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n-
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n-\n-\n-\n-
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext *deviceContext)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n-
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, ID3D11DeviceContext *deviceContext)
\n-\n-
static void Synchronize(ID3D11DeviceContext *deviceContext)
Wait the dispatched kernel finishes.
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, ID3D11DeviceContext *deviceContext) const
\n-
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, ID3D11DeviceContext *deviceContext)
Configure DX kernel. Returns false if it fails to compile the kernel.
\n-\n-\n-
bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const &srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc, ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV, ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int start, int end, ID3D11DeviceContext *deviceContext) const
\n+
Concrete vertex buffer class for Cpu subdivision and DirectX drawing.
\n+
static CpuD3D11VertexBuffer * Create(int numElements, int numVertices, ID3D11DeviceContext *deviceContext)
Creator. Returns NULL if error.
\n+
CpuD3D11VertexBuffer(int numElements, int numVertices)
Constructor.
\n+
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n+
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n+
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n+
ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object.
\n+
float * BindCpuBuffer()
Returns the address of CPU buffer.
\n+\n+\n+
ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object (for Osd::Mesh interface)
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-d3d11ComputeEvaluator.h\n+cpuD3D11VertexBuffer.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2015 Pixar\n+2// Copyright 2013 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,272 +24,105 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n 27\n 28#include \"../version.h\"\n-29\n-30struct ID3D11DeviceContext;\n+29#include \n+30\n 31struct ID3D11Buffer;\n-32struct ID3D11ComputeShader;\n-33struct ID3D11ClassLinkage;\n-34struct ID3D11ClassInstance;\n-35struct ID3D11ShaderResourceView;\n-36struct ID3D11UnorderedAccessView;\n+32struct ID3D11Device;\n+33struct ID3D11DeviceContext;\n+34\n+35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+36namespace OPENSUBDIV_VERSION {\n 37\n-38#include \"../osd/bufferDescriptor.h\"\n+38namespace Osd {\n 39\n-40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-41namespace OPENSUBDIV_VERSION {\n-42\n-43namespace Far {\n-44 class StencilTable;\n-45}\n-46\n-47namespace Osd {\n-48\n-_\b5_\b6class _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n-57public:\n-58 template \n-_\b5_\b9 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-60 DEVICE_CONTEXT context) {\n-61 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetDeviceContext());\n-62 }\n-63\n-_\b6_\b4 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-65 ID3D11DeviceContext *deviceContext) {\n-66 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, deviceContext);\n-67 }\n-68\n-_\b6_\b9 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-70 ID3D11DeviceContext *deviceContext);\n-71\n-_\b7_\b2 _\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n+_\b4_\b8class _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n+49public:\n+_\b5_\b1 static _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n+52 ID3D11DeviceContext *deviceContext);\n+53\n+_\b5_\b5 virtual _\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n+56\n+_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n+60 void *deviceContext = NULL);\n+61\n+_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n+64\n+_\b6_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n+67\n+_\b6_\b9 float * _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n+70\n+_\b7_\b2 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(ID3D11DeviceContext *deviceContext);\n 73\n-74 // interfaces needed for D3D11ComputeEvaluator\n-_\b7_\b5 ID3D11ShaderResourceView *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV() const { return _sizes; }\n-_\b7_\b6 ID3D11ShaderResourceView *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV() const { return _offsets; }\n-_\b7_\b7 ID3D11ShaderResourceView *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV() const { return _indices; }\n-_\b7_\b8 ID3D11ShaderResourceView *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV() const { return _weights; }\n-_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n-80\n-81private:\n-82 ID3D11ShaderResourceView *_sizes;\n-83 ID3D11ShaderResourceView *_offsets;\n-84 ID3D11ShaderResourceView *_indices;\n-85 ID3D11ShaderResourceView *_weights;\n-86 ID3D11Buffer *_sizesBuffer;\n-87 ID3D11Buffer *_offsetsBuffer;\n-88 ID3D11Buffer *_indicesBuffer;\n-89 ID3D11Buffer *_weightsBuffer;\n-90\n-91 int _numStencils;\n-92};\n+_\b7_\b5 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bV_\bB_\bO(ID3D11DeviceContext *deviceContext) {\n+76 return _\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(deviceContext);\n+77 }\n+78\n+79protected:\n+_\b8_\b1 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n+82\n+_\b8_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(ID3D11Device *device);\n+84\n+85private:\n+86 int _numElements;\n+87 int _numVertices;\n+88 ID3D11Buffer *_d3d11Buffer;\n+89 float *_cpuBuffer;\n+90};\n+91\n+92} // end namespace Osd\n 93\n-94// --------------------------------------------------------------------------\n--\n-95\n-_\b9_\b6class _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-97public:\n-_\b9_\b8 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n-_\b9_\b9 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-100 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-101 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-102 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-103 ID3D11DeviceContext *deviceContext);\n-104\n-_\b1_\b0_\b5 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-110 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-111 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-112 ID3D11DeviceContext *deviceContext);\n-113\n-_\b1_\b1_\b5 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-116\n-_\b1_\b1_\b8 _\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-119\n-147 template \n-_\b1_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-149 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-150 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-151 STENCIL_TABLE const *stencilTable,\n-152 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-153 ID3D11DeviceContext * deviceContext) {\n-154 if (instance) {\n-155 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-156 dstBuffer, dstDesc,\n-157 stencilTable,\n-158 deviceContext);\n-159 } else {\n-160 // Create an instance on demand (slow)\n-161 (void)deviceContext; // unused\n-162 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-163 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-164 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-165 deviceContext);\n-166 if (instance) {\n-167 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-168 dstBuffer, dstDesc,\n-169 stencilTable,\n-170 deviceContext);\n-171 delete instance;\n-172 return r;\n-173 }\n-174 return false;\n-175 }\n-176 }\n-177\n-180 template \n-_\b1_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-182 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-183 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-184 STENCIL_TABLE const *stencilTable,\n-185 ID3D11DeviceContext *deviceContext) const {\n-186 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,\n-187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,\n-188 stencilTable->GetSizesSRV(),\n-189 stencilTable->GetOffsetsSRV(),\n-190 stencilTable->GetIndicesSRV(),\n-191 stencilTable->GetWeightsSRV(),\n-192 /* start = */ 0,\n-193 /* end = */ stencilTable->GetNumStencils(),\n-194 deviceContext);\n-195 }\n-196\n-_\b1_\b9_\b9 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(ID3D11UnorderedAccessView *srcSRV,\n-200 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-201 ID3D11UnorderedAccessView *dstUAV,\n-202 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-203 ID3D11ShaderResourceView *sizesSRV,\n-204 ID3D11ShaderResourceView *offsetsSRV,\n-205 ID3D11ShaderResourceView *indicesSRV,\n-206 ID3D11ShaderResourceView *weightsSRV,\n-207 int start,\n-208 int end,\n-209 ID3D11DeviceContext *deviceContext) const;\n-210\n-_\b2_\b1_\b2 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-213 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-214 ID3D11DeviceContext *deviceContext);\n-215\n-_\b2_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(ID3D11DeviceContext *deviceContext);\n-218\n-219private:\n-220 ID3D11ComputeShader * _computeShader;\n-221 ID3D11ClassLinkage * _classLinkage;\n-222 ID3D11ClassInstance * _singleBufferKernel;\n-223 ID3D11ClassInstance * _separateBufferKernel;\n-224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels\n-225\n-226 int _workGroupSize;\n-227};\n-228\n-229} // end namespace Osd\n-230\n-231} // end namespace OPENSUBDIV_VERSION\n-232using namespace OPENSUBDIV_VERSION;\n-233\n-234} // end namespace OpenSubdiv\n-235\n-236\n-237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+94} // end namespace OPENSUBDIV_VERSION\n+95using namespace OPENSUBDIV_VERSION;\n+96\n+97} // end namespace OpenSubdiv\n+98\n+99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor is a struct which describes buffer elements in interleaved\n-data buffers....\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-D3D11 stencil table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n-DEVICE_CONTEXT context)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetOffsetsSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetIndicesSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-~D3D11StencilTable()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext\n-*deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,\n ID3D11DeviceContext *deviceContext)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetSizesSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV\n-ID3D11ShaderResourceView * GetWeightsSRV() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n-BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext\n-*deviceContext)\n-Generic static compute function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n-BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n-BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc,\n-ID3D11DeviceContext *deviceContext)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n-bool Instantiatable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(ID3D11DeviceContext *deviceContext)\n-Wait the dispatched kernel finishes.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n-*stencilTable, ID3D11DeviceContext *deviceContext) const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n-bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n-ID3D11DeviceContext *deviceContext)\n-Configure DX kernel. Returns false if it fails to compile the kernel.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n-_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D3D11ComputeEvaluator()\n+Creator. Returns NULL if error.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+CpuD3D11VertexBuffer(int numElements, int numVertices)\n Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n-_\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-~D3D11ComputeEvaluator()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n+int GetNumElements() const\n+Returns how many elements defined in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n+void UpdateData(const float *src, int startVertex, int numVertices, void\n+*deviceContext=NULL)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n+int GetNumVertices() const\n+Returns how many vertices allocated in this vertex buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br\n+ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)\n+Returns the D3D11 buffer object.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n+float * BindCpuBuffer()\n+Returns the address of CPU buffer.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n+bool allocate(ID3D11Device *device)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:\n+_\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n+virtual ~CpuD3D11VertexBuffer()\n Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const\n-&srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc,\n-ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV,\n-ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int\n-start, int end, ID3D11DeviceContext *deviceContext) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n+ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)\n+Returns the D3D11 buffer object (for Osd::Mesh interface)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b7_\b5\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h File Reference\n+OpenSubdiv: opensubdiv/osd/glComputeEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,41 +90,47 @@\n \n \n \n
\n \n-
cpuD3D11VertexBuffer.h File Reference
\n+
glComputeEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include <cstddef>
\n+#include "../osd/opengl.h"
\n+#include "../osd/types.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n+\n+\n \n

\n Classes

class  CpuD3D11VertexBuffer
 Concrete vertex buffer class for Cpu subdivision and DirectX drawing. More...
class  GLStencilTableSSBO
 GL stencil table (Shader Storage buffer) More...
 
class  GLComputeEvaluator
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Osd
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,30 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-cpuD3D11VertexBuffer.h File Reference\n+glComputeEvaluator.h File Reference\n #include \"../version.h\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bg_\bl_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-\u00a0 Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n+\u00a0 GL stencil table (Shader Storage buffer) _\bM_\bo_\br_\be_\b._\b._\b.\n+\u00a0\n+class \u00a0 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,4 @@\n var a00845 = [\n- [\"CpuD3D11VertexBuffer\", \"a01161.html\", \"a01161\"]\n+ [\"GLStencilTableSSBO\", \"a01217.html\", \"a01217\"],\n+ [\"GLComputeEvaluator\", \"a01221.html\", \"a01221\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00845_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00845_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuD3D11VertexBuffer.h Source File\n+OpenSubdiv: opensubdiv/osd/glComputeEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,19 +92,19 @@\n
No Matches
\n \n \n \n \n \n
\n-
cpuD3D11VertexBuffer.h
\n+
glComputeEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n-
2// Copyright 2013 Pixar
\n+
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n
6// compliance with the Apache License and the following modification to it:
\n
7// Section 6. Trademarks. is deleted and replaced with:
\n
8//
\n
9// 6. Trademarks. This License does not grant permission to use the trade
\n@@ -119,91 +119,1132 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n-
26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
25#ifndef OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n-
29#include <cstddef>
\n-
30
\n-
31struct ID3D11Buffer;
\n-
32struct ID3D11Device;
\n-
33struct ID3D11DeviceContext;
\n-
34
\n-
35namespace OpenSubdiv {
\n-
36namespace OPENSUBDIV_VERSION {
\n-
37
\n-
38namespace Osd {
\n-
39
\n-
\n-\n-
49public:
\n-
51 static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,
\n-
52 ID3D11DeviceContext *deviceContext);
\n-
53
\n-\n-
56
\n-
59 void UpdateData(const float *src, int startVertex, int numVertices,
\n-
60 void *deviceContext = NULL);
\n-
61
\n-
63 int GetNumElements() const;
\n+
29
\n+
30#include "../osd/opengl.h"
\n+
31#include "../osd/types.h"
\n+
32#include "../osd/bufferDescriptor.h"
\n+
33
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Far {
\n+
38 class PatchTable;
\n+
39 class StencilTable;
\n+
40 class LimitStencilTable;
\n+
41}
\n+
42
\n+
43namespace Osd {
\n+
44
\n+
\n+\n+
52public:
\n+
\n+
53 static GLStencilTableSSBO *Create(Far::StencilTable const *stencilTable,
\n+
54 void *deviceContext = NULL) {
\n+
55 (void)deviceContext; // unused
\n+
56 return new GLStencilTableSSBO(stencilTable);
\n+
57 }
\n+
\n+
\n+\n+
59 Far::LimitStencilTable const *limitStencilTable,
\n+
60 void *deviceContext = NULL) {
\n+
61 (void)deviceContext; // unused
\n+
62 return new GLStencilTableSSBO(limitStencilTable);
\n+
63 }
\n+
\n
64
\n-
66 int GetNumVertices() const;
\n-
67
\n-
69 float * BindCpuBuffer();
\n-
70
\n-
72 ID3D11Buffer *BindD3D11Buffer(ID3D11DeviceContext *deviceContext);
\n-
73
\n-
\n-
75 ID3D11Buffer *BindVBO(ID3D11DeviceContext *deviceContext) {
\n-
76 return BindD3D11Buffer(deviceContext);
\n-
77 }
\n-
\n-
78
\n-
79protected:
\n-
81 CpuD3D11VertexBuffer(int numElements, int numVertices);
\n-
82
\n-
83 bool allocate(ID3D11Device *device);
\n-
84
\n-
85private:
\n-
86 int _numElements;
\n-
87 int _numVertices;
\n-
88 ID3D11Buffer *_d3d11Buffer;
\n-
89 float *_cpuBuffer;
\n-
90};
\n+
65 explicit GLStencilTableSSBO(Far::StencilTable const *stencilTable);
\n+
66 explicit GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable);
\n+\n+
68
\n+
69 // interfaces needed for GLSLComputeKernel
\n+
70 GLuint GetSizesBuffer() const { return _sizes; }
\n+
71 GLuint GetOffsetsBuffer() const { return _offsets; }
\n+
72 GLuint GetIndicesBuffer() const { return _indices; }
\n+
73 GLuint GetWeightsBuffer() const { return _weights; }
\n+
74 GLuint GetDuWeightsBuffer() const { return _duWeights; }
\n+
75 GLuint GetDvWeightsBuffer() const { return _dvWeights; }
\n+
76 GLuint GetDuuWeightsBuffer() const { return _duuWeights; }
\n+
77 GLuint GetDuvWeightsBuffer() const { return _duvWeights; }
\n+
78 GLuint GetDvvWeightsBuffer() const { return _dvvWeights; }
\n+
79 int GetNumStencils() const { return _numStencils; }
\n+
80
\n+
81private:
\n+
82 GLuint _sizes;
\n+
83 GLuint _offsets;
\n+
84 GLuint _indices;
\n+
85 GLuint _weights;
\n+
86 GLuint _duWeights;
\n+
87 GLuint _dvWeights;
\n+
88 GLuint _duuWeights;
\n+
89 GLuint _duvWeights;
\n+
90 GLuint _dvvWeights;
\n+
91 int _numStencils;
\n+
92};
\n
\n-
91
\n-
92} // end namespace Osd
\n
93
\n-
94} // end namespace OPENSUBDIV_VERSION
\n-
95using namespace OPENSUBDIV_VERSION;
\n-
96
\n-
97} // end namespace OpenSubdiv
\n-
98
\n-
99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H
\n+
94// ---------------------------------------------------------------------------
\n+
95
\n+
\n+\n+
97public:
\n+
98 typedef bool Instantiatable;
\n+
\n+\n+
100 BufferDescriptor const &dstDesc,
\n+
101 BufferDescriptor const &duDesc,
\n+
102 BufferDescriptor const &dvDesc,
\n+
103 void * deviceContext = NULL) {
\n+
104 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+\n+\n+\n+
108 deviceContext);
\n+
109 }
\n+
\n+
110
\n+
\n+\n+
112 BufferDescriptor const &dstDesc,
\n+
113 BufferDescriptor const &duDesc,
\n+
114 BufferDescriptor const &dvDesc,
\n+
115 BufferDescriptor const &duuDesc,
\n+
116 BufferDescriptor const &duvDesc,
\n+
117 BufferDescriptor const &dvvDesc,
\n+
118 void * deviceContext = NULL) {
\n+
119 (void)deviceContext; // not used
\n+
120 GLComputeEvaluator *instance = new GLComputeEvaluator();
\n+
121 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n+
122 duuDesc, duvDesc, dvvDesc))
\n+
123 return instance;
\n+
124 delete instance;
\n+
125 return NULL;
\n+
126 }
\n+
\n+
127
\n+\n+
130
\n+\n+
133
\n+
139
\n+
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
168 static bool EvalStencils(
\n+
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
171 STENCIL_TABLE const *stencilTable,
\n+
172 GLComputeEvaluator const *instance,
\n+
173 void * deviceContext = NULL) {
\n+
174
\n+
175 if (instance) {
\n+
176 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
177 dstBuffer, dstDesc,
\n+
178 stencilTable);
\n+
179 } else {
\n+
180 // Create an instance on demand (slow)
\n+
181 (void)deviceContext; // unused
\n+
182 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
185 if (instance) {
\n+
186 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
187 dstBuffer, dstDesc,
\n+
188 stencilTable);
\n+
189 delete instance;
\n+
190 return r;
\n+
191 }
\n+
192 return false;
\n+
193 }
\n+
194 }
\n+
\n+
195
\n+
235 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
236 static bool EvalStencils(
\n+
237 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
238 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
239 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
240 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
241 STENCIL_TABLE const *stencilTable,
\n+
242 GLComputeEvaluator const *instance,
\n+
243 void * deviceContext = NULL) {
\n+
244
\n+
245 if (instance) {
\n+
246 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
247 dstBuffer, dstDesc,
\n+
248 duBuffer, duDesc,
\n+
249 dvBuffer, dvDesc,
\n+
250 stencilTable);
\n+
251 } else {
\n+
252 // Create an instance on demand (slow)
\n+
253 (void)deviceContext; // unused
\n+
254 instance = Create(srcDesc, dstDesc, duDesc, dvDesc);
\n+
255 if (instance) {
\n+
256 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
257 dstBuffer, dstDesc,
\n+
258 duBuffer, duDesc,
\n+
259 dvBuffer, dvDesc,
\n+
260 stencilTable);
\n+
261 delete instance;
\n+
262 return r;
\n+
263 }
\n+
264 return false;
\n+
265 }
\n+
266 }
\n+
\n+
267
\n+
325 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
326 static bool EvalStencils(
\n+
327 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
328 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
329 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
330 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
331 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
332 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
333 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
334 STENCIL_TABLE const *stencilTable,
\n+
335 GLComputeEvaluator const *instance,
\n+
336 void * deviceContext = NULL) {
\n+
337
\n+
338 if (instance) {
\n+
339 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
340 dstBuffer, dstDesc,
\n+
341 duBuffer, duDesc,
\n+
342 dvBuffer, dvDesc,
\n+
343 duuBuffer, duuDesc,
\n+
344 duvBuffer, duvDesc,
\n+
345 dvvBuffer, dvvDesc,
\n+
346 stencilTable);
\n+
347 } else {
\n+
348 // Create an instance on demand (slow)
\n+
349 (void)deviceContext; // unused
\n+
350 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n+
351 duuDesc, duvDesc, dvvDesc);
\n+
352 if (instance) {
\n+
353 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
354 dstBuffer, dstDesc,
\n+
355 duBuffer, duDesc,
\n+
356 dvBuffer, dvDesc,
\n+
357 duuBuffer, duuDesc,
\n+
358 duvBuffer, duvDesc,
\n+
359 dvvBuffer, dvvDesc,
\n+
360 stencilTable);
\n+
361 delete instance;
\n+
362 return r;
\n+
363 }
\n+
364 return false;
\n+
365 }
\n+
366 }
\n+
\n+
367
\n+
385 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
387 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
388 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
389 STENCIL_TABLE const *stencilTable) const {
\n+
390 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n+
391 dstBuffer->BindVBO(), dstDesc,
\n+
392 0, BufferDescriptor(),
\n+
393 0, BufferDescriptor(),
\n+
394 stencilTable->GetSizesBuffer(),
\n+
395 stencilTable->GetOffsetsBuffer(),
\n+
396 stencilTable->GetIndicesBuffer(),
\n+
397 stencilTable->GetWeightsBuffer(),
\n+
398 0,
\n+
399 0,
\n+
400 /* start = */ 0,
\n+
401 /* end = */ stencilTable->GetNumStencils());
\n+
402 }
\n+
\n+
403
\n+
433 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
435 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
436 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
437 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
438 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
439 STENCIL_TABLE const *stencilTable) const {
\n+
440 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n+
441 dstBuffer->BindVBO(), dstDesc,
\n+
442 duBuffer->BindVBO(), duDesc,
\n+
443 dvBuffer->BindVBO(), dvDesc,
\n+
444 stencilTable->GetSizesBuffer(),
\n+
445 stencilTable->GetOffsetsBuffer(),
\n+
446 stencilTable->GetIndicesBuffer(),
\n+
447 stencilTable->GetWeightsBuffer(),
\n+
448 stencilTable->GetDuWeightsBuffer(),
\n+
449 stencilTable->GetDvWeightsBuffer(),
\n+
450 /* start = */ 0,
\n+
451 /* end = */ stencilTable->GetNumStencils());
\n+
452 }
\n+
\n+
453
\n+
501 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
503 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
504 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
505 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
506 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
507 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
508 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
509 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
510 STENCIL_TABLE const *stencilTable) const {
\n+
511 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n+
512 dstBuffer->BindVBO(), dstDesc,
\n+
513 duBuffer->BindVBO(), duDesc,
\n+
514 dvBuffer->BindVBO(), dvDesc,
\n+
515 duuBuffer->BindVBO(), duuDesc,
\n+
516 duvBuffer->BindVBO(), duvDesc,
\n+
517 dvvBuffer->BindVBO(), dvvDesc,
\n+
518 stencilTable->GetSizesBuffer(),
\n+
519 stencilTable->GetOffsetsBuffer(),
\n+
520 stencilTable->GetIndicesBuffer(),
\n+
521 stencilTable->GetWeightsBuffer(),
\n+
522 stencilTable->GetDuWeightsBuffer(),
\n+
523 stencilTable->GetDvWeightsBuffer(),
\n+
524 stencilTable->GetDuuWeightsBuffer(),
\n+
525 stencilTable->GetDuvWeightsBuffer(),
\n+
526 stencilTable->GetDvvWeightsBuffer(),
\n+
527 /* start = */ 0,
\n+
528 /* end = */ stencilTable->GetNumStencils());
\n+
529 }
\n+
\n+
530
\n+
566 bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n+
567 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n+
568 GLuint duBuffer, BufferDescriptor const &duDesc,
\n+
569 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n+
570 GLuint sizesBuffer,
\n+
571 GLuint offsetsBuffer,
\n+
572 GLuint indicesBuffer,
\n+
573 GLuint weightsBuffer,
\n+
574 GLuint duWeightsBuffer,
\n+
575 GLuint dvWeightsBuffer,
\n+
576 int start,
\n+
577 int end) const;
\n+
578
\n+
632 bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n+
633 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n+
634 GLuint duBuffer, BufferDescriptor const &duDesc,
\n+
635 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n+
636 GLuint duuBuffer, BufferDescriptor const &duuDesc,
\n+
637 GLuint duvBuffer, BufferDescriptor const &duvDesc,
\n+
638 GLuint dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
639 GLuint sizesBuffer,
\n+
640 GLuint offsetsBuffer,
\n+
641 GLuint indicesBuffer,
\n+
642 GLuint weightsBuffer,
\n+
643 GLuint duWeightsBuffer,
\n+
644 GLuint dvWeightsBuffer,
\n+
645 GLuint duuWeightsBuffer,
\n+
646 GLuint duvWeightsBuffer,
\n+
647 GLuint dvvWeightsBuffer,
\n+
648 int start,
\n+
649 int end) const;
\n+
650
\n+
656
\n+
689 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
690 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
691 static bool EvalPatches(
\n+
692 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
693 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
694 int numPatchCoords,
\n+
695 PATCHCOORD_BUFFER *patchCoords,
\n+
696 PATCH_TABLE *patchTable,
\n+
697 GLComputeEvaluator const *instance,
\n+
698 void * deviceContext = NULL) {
\n+
699
\n+
700 if (instance) {
\n+
701 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
702 dstBuffer, dstDesc,
\n+
703 numPatchCoords, patchCoords,
\n+
704 patchTable);
\n+
705 } else {
\n+
706 // Create an instance on demand (slow)
\n+
707 (void)deviceContext; // unused
\n+
708 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
711 if (instance) {
\n+
712 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
713 dstBuffer, dstDesc,
\n+
714 numPatchCoords, patchCoords,
\n+
715 patchTable);
\n+
716 delete instance;
\n+
717 return r;
\n+
718 }
\n+
719 return false;
\n+
720 }
\n+
721 }
\n+
\n+
722
\n+
767 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
768 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
769 static bool EvalPatches(
\n+
770 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
771 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
772 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
773 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
774 int numPatchCoords,
\n+
775 PATCHCOORD_BUFFER *patchCoords,
\n+
776 PATCH_TABLE *patchTable,
\n+
777 GLComputeEvaluator const *instance,
\n+
778 void * deviceContext = NULL) {
\n+
779
\n+
780 if (instance) {
\n+
781 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
782 dstBuffer, dstDesc,
\n+
783 duBuffer, duDesc,
\n+
784 dvBuffer, dvDesc,
\n+
785 numPatchCoords, patchCoords,
\n+
786 patchTable);
\n+
787 } else {
\n+
788 // Create an instance on demand (slow)
\n+
789 (void)deviceContext; // unused
\n+
790 instance = Create(srcDesc, dstDesc,
\n+
791 duDesc, dvDesc);
\n+
792 if (instance) {
\n+
793 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
794 dstBuffer, dstDesc,
\n+
795 duBuffer, duDesc,
\n+
796 dvBuffer, dvDesc,
\n+
797 numPatchCoords, patchCoords,
\n+
798 patchTable);
\n+
799 delete instance;
\n+
800 return r;
\n+
801 }
\n+
802 return false;
\n+
803 }
\n+
804 }
\n+
\n+
805
\n+
868 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
869 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
870 static bool EvalPatches(
\n+
871 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
872 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
873 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
874 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
875 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
876 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
877 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
878 int numPatchCoords,
\n+
879 PATCHCOORD_BUFFER *patchCoords,
\n+
880 PATCH_TABLE *patchTable,
\n+
881 GLComputeEvaluator const *instance,
\n+
882 void * deviceContext = NULL) {
\n+
883
\n+
884 if (instance) {
\n+
885 return instance->EvalPatches(srcBuffer, srcDesc,
\n+
886 dstBuffer, dstDesc,
\n+
887 duBuffer, duDesc,
\n+
888 dvBuffer, dvDesc,
\n+
889 duuBuffer, duuDesc,
\n+
890 duvBuffer, duvDesc,
\n+
891 dvvBuffer, dvvDesc,
\n+
892 numPatchCoords, patchCoords,
\n+
893 patchTable);
\n+
894 } else {
\n+
895 // Create an instance on demand (slow)
\n+
896 (void)deviceContext; // unused
\n+
897 instance = Create(srcDesc, dstDesc,
\n+
898 duDesc, dvDesc,
\n+
899 duuDesc, duvDesc, dvvDesc);
\n+
900 if (instance) {
\n+
901 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n+
902 dstBuffer, dstDesc,
\n+
903 duBuffer, duDesc,
\n+
904 dvBuffer, dvDesc,
\n+
905 duuBuffer, duuDesc,
\n+
906 duvBuffer, duvDesc,
\n+
907 dvvBuffer, dvvDesc,
\n+
908 numPatchCoords, patchCoords,
\n+
909 patchTable);
\n+
910 delete instance;
\n+
911 return r;
\n+
912 }
\n+
913 return false;
\n+
914 }
\n+
915 }
\n+
\n+
916
\n+
941 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
942 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
944 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
945 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
946 int numPatchCoords,
\n+
947 PATCHCOORD_BUFFER *patchCoords,
\n+
948 PATCH_TABLE *patchTable) const {
\n+
949
\n+
950 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
951 dstBuffer->BindVBO(), dstDesc,
\n+
952 0, BufferDescriptor(),
\n+
953 0, BufferDescriptor(),
\n+
954 numPatchCoords,
\n+
955 patchCoords->BindVBO(),
\n+
956 patchTable->GetPatchArrays(),
\n+
957 patchTable->GetPatchIndexBuffer(),
\n+
958 patchTable->GetPatchParamBuffer());
\n+
959 }
\n+
\n+
960
\n+
995 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
996 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
998 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
999 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1000 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1001 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1002 int numPatchCoords,
\n+
1003 PATCHCOORD_BUFFER *patchCoords,
\n+
1004 PATCH_TABLE *patchTable) const {
\n+
1005
\n+
1006 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1007 dstBuffer->BindVBO(), dstDesc,
\n+
1008 duBuffer->BindVBO(), duDesc,
\n+
1009 dvBuffer->BindVBO(), dvDesc,
\n+
1010 numPatchCoords,
\n+
1011 patchCoords->BindVBO(),
\n+
1012 patchTable->GetPatchArrays(),
\n+
1013 patchTable->GetPatchIndexBuffer(),
\n+
1014 patchTable->GetPatchParamBuffer());
\n+
1015 }
\n+
\n+
1016
\n+
1069 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1070 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1072 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1073 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1074 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1075 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1076 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1077 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1078 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1079 int numPatchCoords,
\n+
1080 PATCHCOORD_BUFFER *patchCoords,
\n+
1081 PATCH_TABLE *patchTable) const {
\n+
1082
\n+
1083 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1084 dstBuffer->BindVBO(), dstDesc,
\n+
1085 duBuffer->BindVBO(), duDesc,
\n+
1086 dvBuffer->BindVBO(), dvDesc,
\n+
1087 duuBuffer->BindVBO(), duuDesc,
\n+
1088 duvBuffer->BindVBO(), duvDesc,
\n+
1089 dvvBuffer->BindVBO(), dvvDesc,
\n+
1090 numPatchCoords,
\n+
1091 patchCoords->BindVBO(),
\n+
1092 patchTable->GetPatchArrays(),
\n+
1093 patchTable->GetPatchIndexBuffer(),
\n+
1094 patchTable->GetPatchParamBuffer());
\n+
1095 }
\n+
\n+
1096
\n+
1097 bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n+
1098 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n+
1099 GLuint duBuffer, BufferDescriptor const &duDesc,
\n+
1100 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n+
1101 int numPatchCoords,
\n+
1102 GLuint patchCoordsBuffer,
\n+
1103 const PatchArrayVector &patchArrays,
\n+
1104 GLuint patchIndexBuffer,
\n+
1105 GLuint patchParamsBuffer) const;
\n+
1106
\n+
1107 bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n+
1108 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n+
1109 GLuint duBuffer, BufferDescriptor const &duDesc,
\n+
1110 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n+
1111 GLuint duuBuffer, BufferDescriptor const &duuDesc,
\n+
1112 GLuint duvBuffer, BufferDescriptor const &duvDesc,
\n+
1113 GLuint dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1114 int numPatchCoords,
\n+
1115 GLuint patchCoordsBuffer,
\n+
1116 const PatchArrayVector &patchArrays,
\n+
1117 GLuint patchIndexBuffer,
\n+
1118 GLuint patchParamsBuffer) const;
\n+
1119
\n+
1152 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1153 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1155 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1156 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1157 int numPatchCoords,
\n+
1158 PATCHCOORD_BUFFER *patchCoords,
\n+
1159 PATCH_TABLE *patchTable,
\n+
1160 GLComputeEvaluator const *instance,
\n+
1161 void * deviceContext = NULL) {
\n+
1162
\n+
1163 if (instance) {
\n+
1164 return instance->EvalPatchesVarying(
\n+
1165 srcBuffer, srcDesc,
\n+
1166 dstBuffer, dstDesc,
\n+
1167 numPatchCoords, patchCoords,
\n+
1168 patchTable);
\n+
1169 } else {
\n+
1170 // Create an instance on demand (slow)
\n+
1171 (void)deviceContext; // unused
\n+
1172 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
1175 if (instance) {
\n+
1176 bool r = instance->EvalPatchesVarying(
\n+
1177 srcBuffer, srcDesc,
\n+
1178 dstBuffer, dstDesc,
\n+
1179 numPatchCoords, patchCoords,
\n+
1180 patchTable);
\n+
1181 delete instance;
\n+
1182 return r;
\n+
1183 }
\n+
1184 return false;
\n+
1185 }
\n+
1186 }
\n+
\n+
1187
\n+
1212 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1213 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1215 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1216 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1217 int numPatchCoords,
\n+
1218 PATCHCOORD_BUFFER *patchCoords,
\n+
1219 PATCH_TABLE *patchTable) const {
\n+
1220
\n+
1221 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1222 dstBuffer->BindVBO(), dstDesc,
\n+
1223 0, BufferDescriptor(),
\n+
1224 0, BufferDescriptor(),
\n+
1225 numPatchCoords,
\n+
1226 patchCoords->BindVBO(),
\n+
1227 patchTable->GetVaryingPatchArrays(),
\n+
1228 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1229 patchTable->GetPatchParamBuffer());
\n+
1230 }
\n+
\n+
1231
\n+
1276 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1277 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1279 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1280 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1281 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1282 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1283 int numPatchCoords,
\n+
1284 PATCHCOORD_BUFFER *patchCoords,
\n+
1285 PATCH_TABLE *patchTable,
\n+
1286 GLComputeEvaluator const *instance,
\n+
1287 void * deviceContext = NULL) {
\n+
1288
\n+
1289 if (instance) {
\n+
1290 return instance->EvalPatchesVarying(
\n+
1291 srcBuffer, srcDesc,
\n+
1292 dstBuffer, dstDesc,
\n+
1293 duBuffer, duDesc,
\n+
1294 dvBuffer, dvDesc,
\n+
1295 numPatchCoords, patchCoords,
\n+
1296 patchTable);
\n+
1297 } else {
\n+
1298 // Create an instance on demand (slow)
\n+
1299 (void)deviceContext; // unused
\n+
1300 instance = Create(srcDesc, dstDesc,
\n+
1301 duDesc, dvDesc);
\n+
1302 if (instance) {
\n+
1303 bool r = instance->EvalPatchesVarying(
\n+
1304 srcBuffer, srcDesc,
\n+
1305 dstBuffer, dstDesc,
\n+
1306 duBuffer, duDesc,
\n+
1307 dvBuffer, dvDesc,
\n+
1308 numPatchCoords, patchCoords,
\n+
1309 patchTable);
\n+
1310 delete instance;
\n+
1311 return r;
\n+
1312 }
\n+
1313 return false;
\n+
1314 }
\n+
1315 }
\n+
\n+
1316
\n+
1353 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1354 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1356 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1357 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1358 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1359 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1360 int numPatchCoords,
\n+
1361 PATCHCOORD_BUFFER *patchCoords,
\n+
1362 PATCH_TABLE *patchTable) const {
\n+
1363
\n+
1364 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1365 dstBuffer->BindVBO(), dstDesc,
\n+
1366 duBuffer->BindVBO(), duDesc,
\n+
1367 dvBuffer->BindVBO(), dvDesc,
\n+
1368 numPatchCoords,
\n+
1369 patchCoords->BindVBO(),
\n+
1370 patchTable->GetVaryingPatchArrays(),
\n+
1371 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1372 patchTable->GetPatchParamBuffer());
\n+
1373 }
\n+
\n+
1374
\n+
1437 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1438 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1440 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1441 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1442 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1443 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1444 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1445 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1446 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1447 int numPatchCoords,
\n+
1448 PATCHCOORD_BUFFER *patchCoords,
\n+
1449 PATCH_TABLE *patchTable,
\n+
1450 GLComputeEvaluator const *instance,
\n+
1451 void * deviceContext = NULL) {
\n+
1452
\n+
1453 if (instance) {
\n+
1454 return instance->EvalPatchesVarying(
\n+
1455 srcBuffer, srcDesc,
\n+
1456 dstBuffer, dstDesc,
\n+
1457 duBuffer, duDesc,
\n+
1458 dvBuffer, dvDesc,
\n+
1459 duuBuffer, duuDesc,
\n+
1460 duvBuffer, duvDesc,
\n+
1461 dvvBuffer, dvvDesc,
\n+
1462 numPatchCoords, patchCoords,
\n+
1463 patchTable);
\n+
1464 } else {
\n+
1465 // Create an instance on demand (slow)
\n+
1466 (void)deviceContext; // unused
\n+
1467 instance = Create(srcDesc, dstDesc,
\n+
1468 duDesc, dvDesc,
\n+
1469 duuDesc, duvDesc, dvvDesc);
\n+
1470 if (instance) {
\n+
1471 bool r = instance->EvalPatchesVarying(
\n+
1472 srcBuffer, srcDesc,
\n+
1473 dstBuffer, dstDesc,
\n+
1474 duBuffer, duDesc,
\n+
1475 dvBuffer, dvDesc,
\n+
1476 duuBuffer, duuDesc,
\n+
1477 duvBuffer, duvDesc,
\n+
1478 dvvBuffer, dvvDesc,
\n+
1479 numPatchCoords, patchCoords,
\n+
1480 patchTable);
\n+
1481 delete instance;
\n+
1482 return r;
\n+
1483 }
\n+
1484 return false;
\n+
1485 }
\n+
1486 }
\n+
\n+
1487
\n+
1542 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1543 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1545 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1546 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1547 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1548 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1549 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1550 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1551 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1552 int numPatchCoords,
\n+
1553 PATCHCOORD_BUFFER *patchCoords,
\n+
1554 PATCH_TABLE *patchTable) const {
\n+
1555
\n+
1556 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1557 dstBuffer->BindVBO(), dstDesc,
\n+
1558 duBuffer->BindVBO(), duDesc,
\n+
1559 dvBuffer->BindVBO(), dvDesc,
\n+
1560 duuBuffer->BindVBO(), duuDesc,
\n+
1561 duvBuffer->BindVBO(), duvDesc,
\n+
1562 dvvBuffer->BindVBO(), dvvDesc,
\n+
1563 numPatchCoords,
\n+
1564 patchCoords->BindVBO(),
\n+
1565 patchTable->GetVaryingPatchArrays(),
\n+
1566 patchTable->GetVaryingPatchIndexBuffer(),
\n+
1567 patchTable->GetPatchParamBuffer());
\n+
1568 }
\n+
\n+
1569
\n+
1604 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1605 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1607 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1608 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1609 int numPatchCoords,
\n+
1610 PATCHCOORD_BUFFER *patchCoords,
\n+
1611 PATCH_TABLE *patchTable,
\n+
1612 int fvarChannel,
\n+
1613 GLComputeEvaluator const *instance,
\n+
1614 void * deviceContext = NULL) {
\n+
1615
\n+
1616 if (instance) {
\n+
1617 return instance->EvalPatchesFaceVarying(
\n+
1618 srcBuffer, srcDesc,
\n+
1619 dstBuffer, dstDesc,
\n+
1620 numPatchCoords, patchCoords,
\n+
1621 patchTable, fvarChannel);
\n+
1622 } else {
\n+
1623 // Create an instance on demand (slow)
\n+
1624 (void)deviceContext; // unused
\n+
1625 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
1628 if (instance) {
\n+
1629 bool r = instance->EvalPatchesFaceVarying(
\n+
1630 srcBuffer, srcDesc,
\n+
1631 dstBuffer, dstDesc,
\n+
1632 numPatchCoords, patchCoords,
\n+
1633 patchTable, fvarChannel);
\n+
1634 delete instance;
\n+
1635 return r;
\n+
1636 }
\n+
1637 return false;
\n+
1638 }
\n+
1639 }
\n+
\n+
1640
\n+
1667 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1668 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1670 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1671 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1672 int numPatchCoords,
\n+
1673 PATCHCOORD_BUFFER *patchCoords,
\n+
1674 PATCH_TABLE *patchTable,
\n+
1675 int fvarChannel = 0) const {
\n+
1676
\n+
1677 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1678 dstBuffer->BindVBO(), dstDesc,
\n+
1679 0, BufferDescriptor(),
\n+
1680 0, BufferDescriptor(),
\n+
1681 numPatchCoords,
\n+
1682 patchCoords->BindVBO(),
\n+
1683 patchTable->GetFVarPatchArrays(fvarChannel),
\n+
1684 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1685 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1686 }
\n+
\n+
1687
\n+
1734 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1735 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1737 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1738 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1739 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1740 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1741 int numPatchCoords,
\n+
1742 PATCHCOORD_BUFFER *patchCoords,
\n+
1743 PATCH_TABLE *patchTable,
\n+
1744 int fvarChannel,
\n+
1745 GLComputeEvaluator const *instance,
\n+
1746 void * deviceContext = NULL) {
\n+
1747
\n+
1748 if (instance) {
\n+
1749 return instance->EvalPatchesFaceVarying(
\n+
1750 srcBuffer, srcDesc,
\n+
1751 dstBuffer, dstDesc,
\n+
1752 duBuffer, duDesc,
\n+
1753 dvBuffer, dvDesc,
\n+
1754 numPatchCoords, patchCoords,
\n+
1755 patchTable, fvarChannel);
\n+
1756 } else {
\n+
1757 // Create an instance on demand (slow)
\n+
1758 (void)deviceContext; // unused
\n+
1759 instance = Create(srcDesc, dstDesc,
\n+
1760 duDesc, dvDesc);
\n+
1761 if (instance) {
\n+
1762 bool r = instance->EvalPatchesFaceVarying(
\n+
1763 srcBuffer, srcDesc,
\n+
1764 dstBuffer, dstDesc,
\n+
1765 duBuffer, duDesc,
\n+
1766 dvBuffer, dvDesc,
\n+
1767 numPatchCoords, patchCoords,
\n+
1768 patchTable, fvarChannel);
\n+
1769 delete instance;
\n+
1770 return r;
\n+
1771 }
\n+
1772 return false;
\n+
1773 }
\n+
1774 }
\n+
\n+
1775
\n+
1814 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1815 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1817 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1818 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1819 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1820 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1821 int numPatchCoords,
\n+
1822 PATCHCOORD_BUFFER *patchCoords,
\n+
1823 PATCH_TABLE *patchTable,
\n+
1824 int fvarChannel = 0) const {
\n+
1825
\n+
1826 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
1827 dstBuffer->BindVBO(), dstDesc,
\n+
1828 duBuffer->BindVBO(), duDesc,
\n+
1829 dvBuffer->BindVBO(), dvDesc,
\n+
1830 numPatchCoords,
\n+
1831 patchCoords->BindVBO(),
\n+
1832 patchTable->GetFVarPatchArrays(fvarChannel),
\n+
1833 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1834 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1835 }
\n+
\n+
1836
\n+
1901 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1902 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1904 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1905 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1906 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1907 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1908 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1909 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1910 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1911 int numPatchCoords,
\n+
1912 PATCHCOORD_BUFFER *patchCoords,
\n+
1913 PATCH_TABLE *patchTable,
\n+
1914 int fvarChannel,
\n+
1915 GLComputeEvaluator const *instance,
\n+
1916 void * deviceContext = NULL) {
\n+
1917
\n+
1918 if (instance) {
\n+
1919 return instance->EvalPatchesFaceVarying(
\n+
1920 srcBuffer, srcDesc,
\n+
1921 dstBuffer, dstDesc,
\n+
1922 duBuffer, duDesc,
\n+
1923 dvBuffer, dvDesc,
\n+
1924 duuBuffer, duuDesc,
\n+
1925 duvBuffer, duvDesc,
\n+
1926 dvvBuffer, dvvDesc,
\n+
1927 numPatchCoords, patchCoords,
\n+
1928 patchTable, fvarChannel);
\n+
1929 } else {
\n+
1930 // Create an instance on demand (slow)
\n+
1931 (void)deviceContext; // unused
\n+
1932 instance = Create(srcDesc, dstDesc,
\n+
1933 duDesc, dvDesc,
\n+
1934 duuDesc, duvDesc, dvvDesc);
\n+
1935 if (instance) {
\n+
1936 bool r = instance->EvalPatchesFaceVarying(
\n+
1937 srcBuffer, srcDesc,
\n+
1938 dstBuffer, dstDesc,
\n+
1939 duBuffer, duDesc,
\n+
1940 dvBuffer, dvDesc,
\n+
1941 duuBuffer, duuDesc,
\n+
1942 duvBuffer, duvDesc,
\n+
1943 dvvBuffer, dvvDesc,
\n+
1944 numPatchCoords, patchCoords,
\n+
1945 patchTable, fvarChannel);
\n+
1946 delete instance;
\n+
1947 return r;
\n+
1948 }
\n+
1949 return false;
\n+
1950 }
\n+
1951 }
\n+
\n+
1952
\n+
2009 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
2010 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
2012 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
2013 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
2014 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
2015 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
2016 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
2017 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
2018 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
2019 int numPatchCoords,
\n+
2020 PATCHCOORD_BUFFER *patchCoords,
\n+
2021 PATCH_TABLE *patchTable,
\n+
2022 int fvarChannel = 0) const {
\n+
2023
\n+
2024 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n+
2025 dstBuffer->BindVBO(), dstDesc,
\n+
2026 duBuffer->BindVBO(), duDesc,
\n+
2027 dvBuffer->BindVBO(), dvDesc,
\n+
2028 duuBuffer->BindVBO(), duuDesc,
\n+
2029 duvBuffer->BindVBO(), duvDesc,
\n+
2030 dvvBuffer->BindVBO(), dvvDesc,
\n+
2031 numPatchCoords,
\n+
2032 patchCoords->BindVBO(),
\n+
2033 patchTable->GetFVarPatchArrays(fvarChannel),
\n+
2034 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
2035 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
2036 }
\n+
\n+
2037
\n+
2043
\n+
2046 bool Compile(BufferDescriptor const &srcDesc,
\n+
2047 BufferDescriptor const &dstDesc,
\n+
2048 BufferDescriptor const &duDesc = BufferDescriptor(),
\n+
2049 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n+
2050 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n+
2051 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n+
2052 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n+
2053
\n+
2055 static void Synchronize(void *deviceContext);
\n+
2056
\n+
2057private:
\n+
2058 struct _StencilKernel {
\n+
2059 _StencilKernel();
\n+
2060 ~_StencilKernel();
\n+
2061 bool Compile(BufferDescriptor const &srcDesc,
\n+
2062 BufferDescriptor const &dstDesc,
\n+
2063 BufferDescriptor const &duDesc,
\n+
2064 BufferDescriptor const &dvDesc,
\n+
2065 BufferDescriptor const &duuDesc,
\n+
2066 BufferDescriptor const &duvDesc,
\n+
2067 BufferDescriptor const &dvvDesc,
\n+
2068 int workGroupSize);
\n+
2069 GLuint program;
\n+
2070 GLuint uniformStart;
\n+
2071 GLuint uniformEnd;
\n+
2072 GLuint uniformSrcOffset;
\n+
2073 GLuint uniformDstOffset;
\n+
2074 GLuint uniformDuDesc;
\n+
2075 GLuint uniformDvDesc;
\n+
2076 GLuint uniformDuuDesc;
\n+
2077 GLuint uniformDuvDesc;
\n+
2078 GLuint uniformDvvDesc;
\n+
2079 } _stencilKernel;
\n+
2080
\n+
2081 struct _PatchKernel {
\n+
2082 _PatchKernel();
\n+
2083 ~_PatchKernel();
\n+
2084 bool Compile(BufferDescriptor const &srcDesc,
\n+
2085 BufferDescriptor const &dstDesc,
\n+
2086 BufferDescriptor const &duDesc,
\n+
2087 BufferDescriptor const &dvDesc,
\n+
2088 BufferDescriptor const &duuDesc,
\n+
2089 BufferDescriptor const &duvDesc,
\n+
2090 BufferDescriptor const &dvvDesc,
\n+
2091 int workGroupSize);
\n+
2092 GLuint program;
\n+
2093 GLuint uniformSrcOffset;
\n+
2094 GLuint uniformDstOffset;
\n+
2095 GLuint uniformPatchArray;
\n+
2096 GLuint uniformDuDesc;
\n+
2097 GLuint uniformDvDesc;
\n+
2098 GLuint uniformDuuDesc;
\n+
2099 GLuint uniformDuvDesc;
\n+
2100 GLuint uniformDvvDesc;
\n+
2101 } _patchKernel;
\n+
2102
\n+
2103 int _workGroupSize;
\n+
2104 GLuint _patchArraysSSBO;
\n+
2105};
\n+
\n+
2106
\n+
2107} // end namespace Osd
\n+
2108
\n+
2109} // end namespace OPENSUBDIV_VERSION
\n+
2110using namespace OPENSUBDIV_VERSION;
\n+
2111
\n+
2112} // end namespace OpenSubdiv
\n+
2113
\n+
2114
\n+
2115#endif // OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n \n-
Concrete vertex buffer class for Cpu subdivision and DirectX drawing.
\n-
static CpuD3D11VertexBuffer * Create(int numElements, int numVertices, ID3D11DeviceContext *deviceContext)
Creator. Returns NULL if error.
\n-
CpuD3D11VertexBuffer(int numElements, int numVertices)
Constructor.
\n-
int GetNumElements() const
Returns how many elements defined in this vertex buffer.
\n-
void UpdateData(const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
\n-
int GetNumVertices() const
Returns how many vertices allocated in this vertex buffer.
\n-
ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object.
\n-
float * BindCpuBuffer()
Returns the address of CPU buffer.
\n-\n-\n-
ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)
Returns the D3D11 buffer object (for Osd::Mesh interface)
\n+
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+\n+\n+
GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable)
\n+\n+\n+\n+\n+\n+
GLStencilTableSSBO(Far::StencilTable const *stencilTable)
\n+\n+\n+
static GLStencilTableSSBO * Create(Far::LimitStencilTable const *limitStencilTable, void *deviceContext=NULL)
\n+\n+\n+
static GLStencilTableSSBO * Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)
\n+\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+\n+
bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays, GLuint patchIndexBuffer, GLuint patchParamsBuffer) const
\n+
~GLComputeEvaluator()
Destructor. note that the GL context must be made current.
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, GLuint sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer, GLuint duWeightsBuffer, GLuint dvWeightsBuffer, GLuint duuWeightsBuffer, GLuint duvWeightsBuffer, GLuint dvvWeightsBuffer, int start, int end) const
Dispatch the GLSL compute kernel on GPU asynchronously returns false if the kernel hasn't been compil...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+\n+
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n+
bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays, GLuint patchIndexBuffer, GLuint patchParamsBuffer) const
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, void *deviceContext=NULL)
\n+
bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer, GLuint duWeightsBuffer, GLuint dvWeightsBuffer, int start, int end) const
Dispatch the GLSL compute kernel on GPU asynchronously returns false if the kernel hasn't been compil...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n+
static void Synchronize(void *deviceContext)
Wait the dispatched kernel finishes.
\n+
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n+
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, void *deviceContext=NULL)
\n+
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,15 +1,15 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-cpuD3D11VertexBuffer.h\n+glComputeEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n-2// Copyright 2013 Pixar\n+2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n 7// Section 6. Trademarks. is deleted and replaced with:\n 8//\n 9// 6. Trademarks. This License does not grant permission to use the trade\n@@ -24,105 +24,1359 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n-26#define OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+25#ifndef OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n-29#include \n-30\n-31struct ID3D11Buffer;\n-32struct ID3D11Device;\n-33struct ID3D11DeviceContext;\n-34\n-35namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-36namespace OPENSUBDIV_VERSION {\n-37\n-38namespace Osd {\n-39\n-_\b4_\b8class _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br {\n-49public:\n-_\b5_\b1 static _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br * _\bC_\br_\be_\ba_\bt_\be(int numElements, int numVertices,\n-52 ID3D11DeviceContext *deviceContext);\n-53\n-_\b5_\b5 virtual _\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br();\n-56\n-_\b5_\b9 void _\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba(const float *src, int startVertex, int numVertices,\n-60 void *deviceContext = NULL);\n-61\n-_\b6_\b3 int _\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs() const;\n+29\n+30#include \"../osd/opengl.h\"\n+31#include \"../osd/types.h\"\n+32#include \"../osd/bufferDescriptor.h\"\n+33\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Far {\n+38 class PatchTable;\n+39 class StencilTable;\n+40 class LimitStencilTable;\n+41}\n+42\n+43namespace Osd {\n+44\n+_\b5_\b1class _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO {\n+52public:\n+_\b5_\b3 static _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+54 void *deviceContext = NULL) {\n+55 (void)deviceContext; // unused\n+56 return new _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(stencilTable);\n+57 }\n+_\b5_\b8 static _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO *_\bC_\br_\be_\ba_\bt_\be(\n+59 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n+60 void *deviceContext = NULL) {\n+61 (void)deviceContext; // unused\n+62 return new _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(limitStencilTable);\n+63 }\n 64\n-_\b6_\b6 int _\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs() const;\n-67\n-_\b6_\b9 float * _\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br();\n-70\n-_\b7_\b2 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(ID3D11DeviceContext *deviceContext);\n-73\n-_\b7_\b5 ID3D11Buffer *_\bB_\bi_\bn_\bd_\bV_\bB_\bO(ID3D11DeviceContext *deviceContext) {\n-76 return _\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br(deviceContext);\n-77 }\n-78\n-79protected:\n-_\b8_\b1 _\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br(int numElements, int numVertices);\n-82\n-_\b8_\b3 bool _\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be(ID3D11Device *device);\n-84\n-85private:\n-86 int _numElements;\n-87 int _numVertices;\n-88 ID3D11Buffer *_d3d11Buffer;\n-89 float *_cpuBuffer;\n-90};\n-91\n-92} // end namespace Osd\n+_\b6_\b5 explicit _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable);\n+_\b6_\b6 explicit _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const\n+*limitStencilTable);\n+_\b6_\b7 _\b~_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO();\n+68\n+69 // interfaces needed for GLSLComputeKernel\n+_\b7_\b0 GLuint _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n+_\b7_\b1 GLuint _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n+_\b7_\b2 GLuint _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n+_\b7_\b3 GLuint _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n+_\b7_\b4 GLuint _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n+_\b7_\b5 GLuint _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n+_\b7_\b6 GLuint _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n+_\b7_\b7 GLuint _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n+_\b7_\b8 GLuint _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n+_\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n+80\n+81private:\n+82 GLuint _sizes;\n+83 GLuint _offsets;\n+84 GLuint _indices;\n+85 GLuint _weights;\n+86 GLuint _duWeights;\n+87 GLuint _dvWeights;\n+88 GLuint _duuWeights;\n+89 GLuint _duvWeights;\n+90 GLuint _dvvWeights;\n+91 int _numStencils;\n+92};\n 93\n-94} // end namespace OPENSUBDIV_VERSION\n-95using namespace OPENSUBDIV_VERSION;\n-96\n-97} // end namespace OpenSubdiv\n-98\n-99#endif // OPENSUBDIV3_OSD_CPU_D3D11_VERTEX_BUFFER_H\n+94// --------------------------------------------------------------------------\n+-\n+95\n+_\b9_\b6class _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+97public:\n+_\b9_\b8 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n+_\b9_\b9 static _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+100 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+101 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+102 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+103 void * deviceContext = NULL) {\n+104 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+105 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+108 deviceContext);\n+109 }\n+110\n+_\b1_\b1_\b1 static _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+112 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+113 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+114 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+115 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+116 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+118 void * deviceContext = NULL) {\n+119 (void)deviceContext; // not used\n+120 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+121 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+122 duuDesc, duvDesc, dvvDesc))\n+123 return instance;\n+124 delete instance;\n+125 return NULL;\n+126 }\n+127\n+_\b1_\b2_\b9 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+130\n+_\b1_\b3_\b2 _\b~_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+133\n+139\n+167 template \n+_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+171 STENCIL_TABLE const *stencilTable,\n+172 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+173 void * deviceContext = NULL) {\n+174\n+175 if (instance) {\n+176 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+177 dstBuffer, dstDesc,\n+178 stencilTable);\n+179 } else {\n+180 // Create an instance on demand (slow)\n+181 (void)deviceContext; // unused\n+182 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+183 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+184 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+185 if (instance) {\n+186 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+187 dstBuffer, dstDesc,\n+188 stencilTable);\n+189 delete instance;\n+190 return r;\n+191 }\n+192 return false;\n+193 }\n+194 }\n+195\n+235 template \n+_\b2_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+237 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+238 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+239 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+240 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+241 STENCIL_TABLE const *stencilTable,\n+242 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+243 void * deviceContext = NULL) {\n+244\n+245 if (instance) {\n+246 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+247 dstBuffer, dstDesc,\n+248 duBuffer, duDesc,\n+249 dvBuffer, dvDesc,\n+250 stencilTable);\n+251 } else {\n+252 // Create an instance on demand (slow)\n+253 (void)deviceContext; // unused\n+254 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc);\n+255 if (instance) {\n+256 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+257 dstBuffer, dstDesc,\n+258 duBuffer, duDesc,\n+259 dvBuffer, dvDesc,\n+260 stencilTable);\n+261 delete instance;\n+262 return r;\n+263 }\n+264 return false;\n+265 }\n+266 }\n+267\n+325 template \n+_\b3_\b2_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+327 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+328 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+329 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+330 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+331 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+332 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+333 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+334 STENCIL_TABLE const *stencilTable,\n+335 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+336 void * deviceContext = NULL) {\n+337\n+338 if (instance) {\n+339 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+340 dstBuffer, dstDesc,\n+341 duBuffer, duDesc,\n+342 dvBuffer, dvDesc,\n+343 duuBuffer, duuDesc,\n+344 duvBuffer, duvDesc,\n+345 dvvBuffer, dvvDesc,\n+346 stencilTable);\n+347 } else {\n+348 // Create an instance on demand (slow)\n+349 (void)deviceContext; // unused\n+350 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n+351 duuDesc, duvDesc, dvvDesc);\n+352 if (instance) {\n+353 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+354 dstBuffer, dstDesc,\n+355 duBuffer, duDesc,\n+356 dvBuffer, dvDesc,\n+357 duuBuffer, duuDesc,\n+358 duvBuffer, duvDesc,\n+359 dvvBuffer, dvvDesc,\n+360 stencilTable);\n+361 delete instance;\n+362 return r;\n+363 }\n+364 return false;\n+365 }\n+366 }\n+367\n+385 template \n+_\b3_\b8_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+387 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+388 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+389 STENCIL_TABLE const *stencilTable) const {\n+390 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n+391 dstBuffer->BindVBO(), dstDesc,\n+392 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+393 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+394 stencilTable->GetSizesBuffer(),\n+395 stencilTable->GetOffsetsBuffer(),\n+396 stencilTable->GetIndicesBuffer(),\n+397 stencilTable->GetWeightsBuffer(),\n+398 0,\n+399 0,\n+400 /* start = */ 0,\n+401 /* end = */ stencilTable->GetNumStencils());\n+402 }\n+403\n+433 template \n+_\b4_\b3_\b4 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+435 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+436 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+437 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+438 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+439 STENCIL_TABLE const *stencilTable) const {\n+440 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n+441 dstBuffer->BindVBO(), dstDesc,\n+442 duBuffer->BindVBO(), duDesc,\n+443 dvBuffer->BindVBO(), dvDesc,\n+444 stencilTable->GetSizesBuffer(),\n+445 stencilTable->GetOffsetsBuffer(),\n+446 stencilTable->GetIndicesBuffer(),\n+447 stencilTable->GetWeightsBuffer(),\n+448 stencilTable->GetDuWeightsBuffer(),\n+449 stencilTable->GetDvWeightsBuffer(),\n+450 /* start = */ 0,\n+451 /* end = */ stencilTable->GetNumStencils());\n+452 }\n+453\n+501 template \n+_\b5_\b0_\b2 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+503 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+504 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+505 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+506 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+507 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+508 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+509 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+510 STENCIL_TABLE const *stencilTable) const {\n+511 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n+512 dstBuffer->BindVBO(), dstDesc,\n+513 duBuffer->BindVBO(), duDesc,\n+514 dvBuffer->BindVBO(), dvDesc,\n+515 duuBuffer->BindVBO(), duuDesc,\n+516 duvBuffer->BindVBO(), duvDesc,\n+517 dvvBuffer->BindVBO(), dvvDesc,\n+518 stencilTable->GetSizesBuffer(),\n+519 stencilTable->GetOffsetsBuffer(),\n+520 stencilTable->GetIndicesBuffer(),\n+521 stencilTable->GetWeightsBuffer(),\n+522 stencilTable->GetDuWeightsBuffer(),\n+523 stencilTable->GetDvWeightsBuffer(),\n+524 stencilTable->GetDuuWeightsBuffer(),\n+525 stencilTable->GetDuvWeightsBuffer(),\n+526 stencilTable->GetDvvWeightsBuffer(),\n+527 /* start = */ 0,\n+528 /* end = */ stencilTable->GetNumStencils());\n+529 }\n+530\n+_\b5_\b6_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+567 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+568 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+569 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+570 GLuint sizesBuffer,\n+571 GLuint offsetsBuffer,\n+572 GLuint indicesBuffer,\n+573 GLuint weightsBuffer,\n+574 GLuint duWeightsBuffer,\n+575 GLuint dvWeightsBuffer,\n+576 int start,\n+577 int end) const;\n+578\n+_\b6_\b3_\b2 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+633 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+634 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+635 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+636 GLuint duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+637 GLuint duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+638 GLuint dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+639 GLuint sizesBuffer,\n+640 GLuint offsetsBuffer,\n+641 GLuint indicesBuffer,\n+642 GLuint weightsBuffer,\n+643 GLuint duWeightsBuffer,\n+644 GLuint dvWeightsBuffer,\n+645 GLuint duuWeightsBuffer,\n+646 GLuint duvWeightsBuffer,\n+647 GLuint dvvWeightsBuffer,\n+648 int start,\n+649 int end) const;\n+650\n+656\n+689 template \n+_\b6_\b9_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+692 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+693 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+694 int numPatchCoords,\n+695 PATCHCOORD_BUFFER *patchCoords,\n+696 PATCH_TABLE *patchTable,\n+697 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+698 void * deviceContext = NULL) {\n+699\n+700 if (instance) {\n+701 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+702 dstBuffer, dstDesc,\n+703 numPatchCoords, patchCoords,\n+704 patchTable);\n+705 } else {\n+706 // Create an instance on demand (slow)\n+707 (void)deviceContext; // unused\n+708 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+709 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+710 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+711 if (instance) {\n+712 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+713 dstBuffer, dstDesc,\n+714 numPatchCoords, patchCoords,\n+715 patchTable);\n+716 delete instance;\n+717 return r;\n+718 }\n+719 return false;\n+720 }\n+721 }\n+722\n+767 template \n+_\b7_\b6_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+770 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+771 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+772 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+773 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+774 int numPatchCoords,\n+775 PATCHCOORD_BUFFER *patchCoords,\n+776 PATCH_TABLE *patchTable,\n+777 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+778 void * deviceContext = NULL) {\n+779\n+780 if (instance) {\n+781 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+782 dstBuffer, dstDesc,\n+783 duBuffer, duDesc,\n+784 dvBuffer, dvDesc,\n+785 numPatchCoords, patchCoords,\n+786 patchTable);\n+787 } else {\n+788 // Create an instance on demand (slow)\n+789 (void)deviceContext; // unused\n+790 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+791 duDesc, dvDesc);\n+792 if (instance) {\n+793 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+794 dstBuffer, dstDesc,\n+795 duBuffer, duDesc,\n+796 dvBuffer, dvDesc,\n+797 numPatchCoords, patchCoords,\n+798 patchTable);\n+799 delete instance;\n+800 return r;\n+801 }\n+802 return false;\n+803 }\n+804 }\n+805\n+868 template \n+_\b8_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+871 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+872 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+873 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+874 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+875 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+876 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+877 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+878 int numPatchCoords,\n+879 PATCHCOORD_BUFFER *patchCoords,\n+880 PATCH_TABLE *patchTable,\n+881 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+882 void * deviceContext = NULL) {\n+883\n+884 if (instance) {\n+885 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+886 dstBuffer, dstDesc,\n+887 duBuffer, duDesc,\n+888 dvBuffer, dvDesc,\n+889 duuBuffer, duuDesc,\n+890 duvBuffer, duvDesc,\n+891 dvvBuffer, dvvDesc,\n+892 numPatchCoords, patchCoords,\n+893 patchTable);\n+894 } else {\n+895 // Create an instance on demand (slow)\n+896 (void)deviceContext; // unused\n+897 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+898 duDesc, dvDesc,\n+899 duuDesc, duvDesc, dvvDesc);\n+900 if (instance) {\n+901 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n+902 dstBuffer, dstDesc,\n+903 duBuffer, duDesc,\n+904 dvBuffer, dvDesc,\n+905 duuBuffer, duuDesc,\n+906 duvBuffer, duvDesc,\n+907 dvvBuffer, dvvDesc,\n+908 numPatchCoords, patchCoords,\n+909 patchTable);\n+910 delete instance;\n+911 return r;\n+912 }\n+913 return false;\n+914 }\n+915 }\n+916\n+941 template \n+_\b9_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+944 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+945 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+946 int numPatchCoords,\n+947 PATCHCOORD_BUFFER *patchCoords,\n+948 PATCH_TABLE *patchTable) const {\n+949\n+950 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+951 dstBuffer->BindVBO(), dstDesc,\n+952 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+953 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+954 numPatchCoords,\n+955 patchCoords->BindVBO(),\n+956 patchTable->GetPatchArrays(),\n+957 patchTable->GetPatchIndexBuffer(),\n+958 patchTable->GetPatchParamBuffer());\n+959 }\n+960\n+995 template \n+_\b9_\b9_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+998 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+999 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1000 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1001 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1002 int numPatchCoords,\n+1003 PATCHCOORD_BUFFER *patchCoords,\n+1004 PATCH_TABLE *patchTable) const {\n+1005\n+1006 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1007 dstBuffer->BindVBO(), dstDesc,\n+1008 duBuffer->BindVBO(), duDesc,\n+1009 dvBuffer->BindVBO(), dvDesc,\n+1010 numPatchCoords,\n+1011 patchCoords->BindVBO(),\n+1012 patchTable->GetPatchArrays(),\n+1013 patchTable->GetPatchIndexBuffer(),\n+1014 patchTable->GetPatchParamBuffer());\n+1015 }\n+1016\n+1069 template \n+_\b1_\b0_\b7_\b1 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+1072 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1073 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1074 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1075 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1076 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1077 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1078 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1079 int numPatchCoords,\n+1080 PATCHCOORD_BUFFER *patchCoords,\n+1081 PATCH_TABLE *patchTable) const {\n+1082\n+1083 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1084 dstBuffer->BindVBO(), dstDesc,\n+1085 duBuffer->BindVBO(), duDesc,\n+1086 dvBuffer->BindVBO(), dvDesc,\n+1087 duuBuffer->BindVBO(), duuDesc,\n+1088 duvBuffer->BindVBO(), duvDesc,\n+1089 dvvBuffer->BindVBO(), dvvDesc,\n+1090 numPatchCoords,\n+1091 patchCoords->BindVBO(),\n+1092 patchTable->GetPatchArrays(),\n+1093 patchTable->GetPatchIndexBuffer(),\n+1094 patchTable->GetPatchParamBuffer());\n+1095 }\n+1096\n+_\b1_\b0_\b9_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1098 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1099 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1100 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1101 int numPatchCoords,\n+1102 GLuint patchCoordsBuffer,\n+1103 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br &patchArrays,\n+1104 GLuint patchIndexBuffer,\n+1105 GLuint patchParamsBuffer) const;\n+1106\n+_\b1_\b1_\b0_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1108 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1109 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1110 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1111 GLuint duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1112 GLuint duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1113 GLuint dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1114 int numPatchCoords,\n+1115 GLuint patchCoordsBuffer,\n+1116 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br &patchArrays,\n+1117 GLuint patchIndexBuffer,\n+1118 GLuint patchParamsBuffer) const;\n+1119\n+1152 template \n+_\b1_\b1_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1155 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1156 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1157 int numPatchCoords,\n+1158 PATCHCOORD_BUFFER *patchCoords,\n+1159 PATCH_TABLE *patchTable,\n+1160 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1161 void * deviceContext = NULL) {\n+1162\n+1163 if (instance) {\n+1164 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1165 srcBuffer, srcDesc,\n+1166 dstBuffer, dstDesc,\n+1167 numPatchCoords, patchCoords,\n+1168 patchTable);\n+1169 } else {\n+1170 // Create an instance on demand (slow)\n+1171 (void)deviceContext; // unused\n+1172 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1173 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1174 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+1175 if (instance) {\n+1176 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1177 srcBuffer, srcDesc,\n+1178 dstBuffer, dstDesc,\n+1179 numPatchCoords, patchCoords,\n+1180 patchTable);\n+1181 delete instance;\n+1182 return r;\n+1183 }\n+1184 return false;\n+1185 }\n+1186 }\n+1187\n+1212 template \n+_\b1_\b2_\b1_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1215 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1216 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1217 int numPatchCoords,\n+1218 PATCHCOORD_BUFFER *patchCoords,\n+1219 PATCH_TABLE *patchTable) const {\n+1220\n+1221 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1222 dstBuffer->BindVBO(), dstDesc,\n+1223 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1224 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1225 numPatchCoords,\n+1226 patchCoords->BindVBO(),\n+1227 patchTable->GetVaryingPatchArrays(),\n+1228 patchTable->GetVaryingPatchIndexBuffer(),\n+1229 patchTable->GetPatchParamBuffer());\n+1230 }\n+1231\n+1276 template \n+_\b1_\b2_\b7_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1279 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1280 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1281 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1282 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1283 int numPatchCoords,\n+1284 PATCHCOORD_BUFFER *patchCoords,\n+1285 PATCH_TABLE *patchTable,\n+1286 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1287 void * deviceContext = NULL) {\n+1288\n+1289 if (instance) {\n+1290 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1291 srcBuffer, srcDesc,\n+1292 dstBuffer, dstDesc,\n+1293 duBuffer, duDesc,\n+1294 dvBuffer, dvDesc,\n+1295 numPatchCoords, patchCoords,\n+1296 patchTable);\n+1297 } else {\n+1298 // Create an instance on demand (slow)\n+1299 (void)deviceContext; // unused\n+1300 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1301 duDesc, dvDesc);\n+1302 if (instance) {\n+1303 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1304 srcBuffer, srcDesc,\n+1305 dstBuffer, dstDesc,\n+1306 duBuffer, duDesc,\n+1307 dvBuffer, dvDesc,\n+1308 numPatchCoords, patchCoords,\n+1309 patchTable);\n+1310 delete instance;\n+1311 return r;\n+1312 }\n+1313 return false;\n+1314 }\n+1315 }\n+1316\n+1353 template \n+_\b1_\b3_\b5_\b5 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1356 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1357 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1358 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1359 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1360 int numPatchCoords,\n+1361 PATCHCOORD_BUFFER *patchCoords,\n+1362 PATCH_TABLE *patchTable) const {\n+1363\n+1364 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1365 dstBuffer->BindVBO(), dstDesc,\n+1366 duBuffer->BindVBO(), duDesc,\n+1367 dvBuffer->BindVBO(), dvDesc,\n+1368 numPatchCoords,\n+1369 patchCoords->BindVBO(),\n+1370 patchTable->GetVaryingPatchArrays(),\n+1371 patchTable->GetVaryingPatchIndexBuffer(),\n+1372 patchTable->GetPatchParamBuffer());\n+1373 }\n+1374\n+1437 template \n+_\b1_\b4_\b3_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1440 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1441 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1442 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1443 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1444 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1445 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1446 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1447 int numPatchCoords,\n+1448 PATCHCOORD_BUFFER *patchCoords,\n+1449 PATCH_TABLE *patchTable,\n+1450 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1451 void * deviceContext = NULL) {\n+1452\n+1453 if (instance) {\n+1454 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1455 srcBuffer, srcDesc,\n+1456 dstBuffer, dstDesc,\n+1457 duBuffer, duDesc,\n+1458 dvBuffer, dvDesc,\n+1459 duuBuffer, duuDesc,\n+1460 duvBuffer, duvDesc,\n+1461 dvvBuffer, dvvDesc,\n+1462 numPatchCoords, patchCoords,\n+1463 patchTable);\n+1464 } else {\n+1465 // Create an instance on demand (slow)\n+1466 (void)deviceContext; // unused\n+1467 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1468 duDesc, dvDesc,\n+1469 duuDesc, duvDesc, dvvDesc);\n+1470 if (instance) {\n+1471 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1472 srcBuffer, srcDesc,\n+1473 dstBuffer, dstDesc,\n+1474 duBuffer, duDesc,\n+1475 dvBuffer, dvDesc,\n+1476 duuBuffer, duuDesc,\n+1477 duvBuffer, duvDesc,\n+1478 dvvBuffer, dvvDesc,\n+1479 numPatchCoords, patchCoords,\n+1480 patchTable);\n+1481 delete instance;\n+1482 return r;\n+1483 }\n+1484 return false;\n+1485 }\n+1486 }\n+1487\n+1542 template \n+_\b1_\b5_\b4_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1545 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1546 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1547 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1548 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1549 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1550 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1551 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1552 int numPatchCoords,\n+1553 PATCHCOORD_BUFFER *patchCoords,\n+1554 PATCH_TABLE *patchTable) const {\n+1555\n+1556 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1557 dstBuffer->BindVBO(), dstDesc,\n+1558 duBuffer->BindVBO(), duDesc,\n+1559 dvBuffer->BindVBO(), dvDesc,\n+1560 duuBuffer->BindVBO(), duuDesc,\n+1561 duvBuffer->BindVBO(), duvDesc,\n+1562 dvvBuffer->BindVBO(), dvvDesc,\n+1563 numPatchCoords,\n+1564 patchCoords->BindVBO(),\n+1565 patchTable->GetVaryingPatchArrays(),\n+1566 patchTable->GetVaryingPatchIndexBuffer(),\n+1567 patchTable->GetPatchParamBuffer());\n+1568 }\n+1569\n+1604 template \n+_\b1_\b6_\b0_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1607 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1608 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1609 int numPatchCoords,\n+1610 PATCHCOORD_BUFFER *patchCoords,\n+1611 PATCH_TABLE *patchTable,\n+1612 int fvarChannel,\n+1613 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1614 void * deviceContext = NULL) {\n+1615\n+1616 if (instance) {\n+1617 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1618 srcBuffer, srcDesc,\n+1619 dstBuffer, dstDesc,\n+1620 numPatchCoords, patchCoords,\n+1621 patchTable, fvarChannel);\n+1622 } else {\n+1623 // Create an instance on demand (slow)\n+1624 (void)deviceContext; // unused\n+1625 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1626 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1627 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+1628 if (instance) {\n+1629 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1630 srcBuffer, srcDesc,\n+1631 dstBuffer, dstDesc,\n+1632 numPatchCoords, patchCoords,\n+1633 patchTable, fvarChannel);\n+1634 delete instance;\n+1635 return r;\n+1636 }\n+1637 return false;\n+1638 }\n+1639 }\n+1640\n+1667 template \n+_\b1_\b6_\b6_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1670 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1671 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1672 int numPatchCoords,\n+1673 PATCHCOORD_BUFFER *patchCoords,\n+1674 PATCH_TABLE *patchTable,\n+1675 int fvarChannel = 0) const {\n+1676\n+1677 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1678 dstBuffer->BindVBO(), dstDesc,\n+1679 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1680 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+1681 numPatchCoords,\n+1682 patchCoords->BindVBO(),\n+1683 patchTable->GetFVarPatchArrays(fvarChannel),\n+1684 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1685 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1686 }\n+1687\n+1734 template \n+_\b1_\b7_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1737 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1738 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1739 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1740 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1741 int numPatchCoords,\n+1742 PATCHCOORD_BUFFER *patchCoords,\n+1743 PATCH_TABLE *patchTable,\n+1744 int fvarChannel,\n+1745 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1746 void * deviceContext = NULL) {\n+1747\n+1748 if (instance) {\n+1749 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1750 srcBuffer, srcDesc,\n+1751 dstBuffer, dstDesc,\n+1752 duBuffer, duDesc,\n+1753 dvBuffer, dvDesc,\n+1754 numPatchCoords, patchCoords,\n+1755 patchTable, fvarChannel);\n+1756 } else {\n+1757 // Create an instance on demand (slow)\n+1758 (void)deviceContext; // unused\n+1759 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1760 duDesc, dvDesc);\n+1761 if (instance) {\n+1762 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1763 srcBuffer, srcDesc,\n+1764 dstBuffer, dstDesc,\n+1765 duBuffer, duDesc,\n+1766 dvBuffer, dvDesc,\n+1767 numPatchCoords, patchCoords,\n+1768 patchTable, fvarChannel);\n+1769 delete instance;\n+1770 return r;\n+1771 }\n+1772 return false;\n+1773 }\n+1774 }\n+1775\n+1814 template \n+_\b1_\b8_\b1_\b6 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1817 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1818 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1819 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1820 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1821 int numPatchCoords,\n+1822 PATCHCOORD_BUFFER *patchCoords,\n+1823 PATCH_TABLE *patchTable,\n+1824 int fvarChannel = 0) const {\n+1825\n+1826 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+1827 dstBuffer->BindVBO(), dstDesc,\n+1828 duBuffer->BindVBO(), duDesc,\n+1829 dvBuffer->BindVBO(), dvDesc,\n+1830 numPatchCoords,\n+1831 patchCoords->BindVBO(),\n+1832 patchTable->GetFVarPatchArrays(fvarChannel),\n+1833 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1834 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1835 }\n+1836\n+1901 template \n+_\b1_\b9_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1904 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1905 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1906 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1907 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1908 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1909 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1910 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1911 int numPatchCoords,\n+1912 PATCHCOORD_BUFFER *patchCoords,\n+1913 PATCH_TABLE *patchTable,\n+1914 int fvarChannel,\n+1915 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+1916 void * deviceContext = NULL) {\n+1917\n+1918 if (instance) {\n+1919 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1920 srcBuffer, srcDesc,\n+1921 dstBuffer, dstDesc,\n+1922 duBuffer, duDesc,\n+1923 dvBuffer, dvDesc,\n+1924 duuBuffer, duuDesc,\n+1925 duvBuffer, duvDesc,\n+1926 dvvBuffer, dvvDesc,\n+1927 numPatchCoords, patchCoords,\n+1928 patchTable, fvarChannel);\n+1929 } else {\n+1930 // Create an instance on demand (slow)\n+1931 (void)deviceContext; // unused\n+1932 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+1933 duDesc, dvDesc,\n+1934 duuDesc, duvDesc, dvvDesc);\n+1935 if (instance) {\n+1936 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1937 srcBuffer, srcDesc,\n+1938 dstBuffer, dstDesc,\n+1939 duBuffer, duDesc,\n+1940 dvBuffer, dvDesc,\n+1941 duuBuffer, duuDesc,\n+1942 duvBuffer, duvDesc,\n+1943 dvvBuffer, dvvDesc,\n+1944 numPatchCoords, patchCoords,\n+1945 patchTable, fvarChannel);\n+1946 delete instance;\n+1947 return r;\n+1948 }\n+1949 return false;\n+1950 }\n+1951 }\n+1952\n+2009 template \n+_\b2_\b0_\b1_\b1 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+2012 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2013 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2014 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2015 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2016 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2017 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2018 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2019 int numPatchCoords,\n+2020 PATCHCOORD_BUFFER *patchCoords,\n+2021 PATCH_TABLE *patchTable,\n+2022 int fvarChannel = 0) const {\n+2023\n+2024 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n+2025 dstBuffer->BindVBO(), dstDesc,\n+2026 duBuffer->BindVBO(), duDesc,\n+2027 dvBuffer->BindVBO(), dvDesc,\n+2028 duuBuffer->BindVBO(), duuDesc,\n+2029 duvBuffer->BindVBO(), duvDesc,\n+2030 dvvBuffer->BindVBO(), dvvDesc,\n+2031 numPatchCoords,\n+2032 patchCoords->BindVBO(),\n+2033 patchTable->GetFVarPatchArrays(fvarChannel),\n+2034 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+2035 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+2036 }\n+2037\n+2043\n+_\b2_\b0_\b4_\b6 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2047 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2048 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2049 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2050 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2051 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+2052 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n+2053\n+_\b2_\b0_\b5_\b5 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext);\n+2056\n+2057private:\n+2058 struct _StencilKernel {\n+2059 _StencilKernel();\n+2060 ~_StencilKernel();\n+2061 bool Compile(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2062 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2063 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2064 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2065 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2066 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2067 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2068 int workGroupSize);\n+2069 GLuint program;\n+2070 GLuint uniformStart;\n+2071 GLuint uniformEnd;\n+2072 GLuint uniformSrcOffset;\n+2073 GLuint uniformDstOffset;\n+2074 GLuint uniformDuDesc;\n+2075 GLuint uniformDvDesc;\n+2076 GLuint uniformDuuDesc;\n+2077 GLuint uniformDuvDesc;\n+2078 GLuint uniformDvvDesc;\n+2079 } _stencilKernel;\n+2080\n+2081 struct _PatchKernel {\n+2082 _PatchKernel();\n+2083 ~_PatchKernel();\n+2084 bool Compile(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+2087 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+2088 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+2089 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+2090 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+2091 int workGroupSize);\n+2092 GLuint program;\n+2093 GLuint uniformSrcOffset;\n+2094 GLuint uniformDstOffset;\n+2095 GLuint uniformPatchArray;\n+2096 GLuint uniformDuDesc;\n+2097 GLuint uniformDvDesc;\n+2098 GLuint uniformDuuDesc;\n+2099 GLuint uniformDuvDesc;\n+2100 GLuint uniformDvvDesc;\n+2101 } _patchKernel;\n+2102\n+2103 int _workGroupSize;\n+2104 GLuint _patchArraysSSBO;\n+2105};\n+2106\n+2107} // end namespace Osd\n+2108\n+2109} // end namespace OPENSUBDIV_VERSION\n+2110using namespace OPENSUBDIV_VERSION;\n+2111\n+2112} // end namespace OpenSubdiv\n+2113\n+2114\n+2115#endif // OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-Concrete vertex buffer class for Cpu subdivision and DirectX drawing.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b4_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static CpuD3D11VertexBuffer * Create(int numElements, int numVertices,\n-ID3D11DeviceContext *deviceContext)\n-Creator. Returns NULL if error.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-CpuD3D11VertexBuffer(int numElements, int numVertices)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n+std::vector< PatchArray > PatchArrayVector\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+Limit stencil table class wrapping the template for compatibility.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor is a struct which describes buffer elements in interleaved\n+data buffers....\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n+GL stencil table (Shader Storage buffer)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetDuvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n+GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetDuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\b~_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n+~GLStencilTableSSBO()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+int GetNumStencils() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetIndicesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetOffsetsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n+GLStencilTableSSBO(Far::StencilTable const *stencilTable)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetDvvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetSizesBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLStencilTableSSBO * Create(Far::LimitStencilTable const\n+*limitStencilTable, void *deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetDuuWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n+GLuint GetDvWeightsBuffer() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLStencilTableSSBO * Create(Far::StencilTable const *stencilTable, void\n+*deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator\n+const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, STENCIL_TABLE const *stencilTable) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b0_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void\n+*deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n+bool Instantiatable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n+dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n+const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n+duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor\n+const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, int\n+numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays,\n+GLuint patchIndexBuffer, GLuint patchParamsBuffer) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+~GLComputeEvaluator()\n+Destructor. note that the GL context must be made current.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable,\n+GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n+dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n+const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n+duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor\n+const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, GLuint\n+sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer,\n+GLuint duWeightsBuffer, GLuint dvWeightsBuffer, GLuint duuWeightsBuffer, GLuint\n+duvWeightsBuffer, GLuint dvvWeightsBuffer, int start, int end) const\n+Dispatch the GLSL compute kernel on GPU asynchronously returns false if the\n+kernel hasn't been compil...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, GLComputeEvaluator const *instance, void\n+*deviceContext=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator\n+const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b4_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b4_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+GLComputeEvaluator()\n Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bE_\bl_\be_\bm_\be_\bn_\bt_\bs\n-int GetNumElements() const\n-Returns how many elements defined in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bU_\bp_\bd_\ba_\bt_\be_\bD_\ba_\bt_\ba\n-void UpdateData(const float *src, int startVertex, int numVertices, void\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable) const\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b9_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator\n+const *instance, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b9_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n+*stencilTable) const\n+Generic stencil function.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n+dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n+const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, int\n+numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays,\n+GLuint patchIndexBuffer, GLuint patchParamsBuffer) const\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0)\n+const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n+BufferDescriptor const &dvDesc, void *deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n+dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n+const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n+sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer,\n+GLuint duWeightsBuffer, GLuint dvWeightsBuffer, int start, int end) const\n+Dispatch the GLSL compute kernel on GPU asynchronously returns false if the\n+kernel hasn't been compil...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+GLComputeEvaluator const *instance, void *deviceContext=NULL)\n+Generic static stencil function. This function has a same signature as other\n+device kernels have so t...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(void *deviceContext)\n+Wait the dispatched kernel finishes.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n+bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n+BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n+&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n+BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n+&dvvDesc=BufferDescriptor())\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b5_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n+BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n+BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, void\n+*deviceContext=NULL)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel=0) const\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b6_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void\n *deviceContext=NULL)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bV_\be_\br_\bt_\bi_\bc_\be_\bs\n-int GetNumVertices() const\n-Returns how many vertices allocated in this vertex buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bD_\b3_\bD_\b1_\b1_\bB_\bu_\bf_\bf_\be_\br\n-ID3D11Buffer * BindD3D11Buffer(ID3D11DeviceContext *deviceContext)\n-Returns the D3D11 buffer object.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bC_\bp_\bu_\bB_\bu_\bf_\bf_\be_\br\n-float * BindCpuBuffer()\n-Returns the address of CPU buffer.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\ba_\bl_\bl_\bo_\bc_\ba_\bt_\be\n-bool allocate(ID3D11Device *device)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:\n-_\b~_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br\n-virtual ~CpuD3D11VertexBuffer()\n-Destructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b:_\b:_\bB_\bi_\bn_\bd_\bV_\bB_\bO\n-ID3D11Buffer * BindVBO(ID3D11DeviceContext *deviceContext)\n-Returns the D3D11 buffer object (for Osd::Mesh interface)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh_\b:_\b7_\b5\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b7_\b0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bD_\b3_\bD_\b1_\b1_\bV_\be_\br_\bt_\be_\bx_\bB_\bu_\bf_\bf_\be_\br_\b._\bh\n+ * _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00848.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00848.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glComputeEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,30 +90,28 @@\n \n \n \n
\n \n-
glComputeEvaluator.h File Reference
\n+
d3d11ComputeEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/opengl.h"
\n-#include "../osd/types.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n+\n \n

\n Classes

class  GLStencilTableSSBO
 GL stencil table (Shader Storage buffer) More...
class  D3D11StencilTable
 D3D11 stencil table. More...
 
class  GLComputeEvaluator
class  D3D11ComputeEvaluator
 
\n \n \n \n \n@@ -124,13 +122,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,30 +1,28 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-glComputeEvaluator.h File Reference\n+d3d11ComputeEvaluator.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bo_\bp_\be_\bn_\bg_\bl_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n #include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n-\u00a0 GL stencil table (Shader Storage buffer) _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+\u00a0 D3D11 stencil table. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-class \u00a0 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+class \u00a0 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00848.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00848.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var a00848 = [\n- [\"GLStencilTableSSBO\", \"a01217.html\", \"a01217\"],\n- [\"GLComputeEvaluator\", \"a01221.html\", \"a01221\"]\n+ [\"D3D11StencilTable\", \"a01197.html\", \"a01197\"],\n+ [\"D3D11ComputeEvaluator\", \"a01201.html\", \"a01201\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00848_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00848_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/glComputeEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/d3d11ComputeEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
glComputeEvaluator.h
\n+
d3d11ComputeEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,1132 +119,225 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n
29
\n-
30#include "../osd/opengl.h"
\n-
31#include "../osd/types.h"
\n-
32#include "../osd/bufferDescriptor.h"
\n-
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Far {
\n-
38 class PatchTable;
\n-
39 class StencilTable;
\n-
40 class LimitStencilTable;
\n-
41}
\n+
30struct ID3D11DeviceContext;
\n+
31struct ID3D11Buffer;
\n+
32struct ID3D11ComputeShader;
\n+
33struct ID3D11ClassLinkage;
\n+
34struct ID3D11ClassInstance;
\n+
35struct ID3D11ShaderResourceView;
\n+
36struct ID3D11UnorderedAccessView;
\n+
37
\n+
38#include "../osd/bufferDescriptor.h"
\n+
39
\n+
40namespace OpenSubdiv {
\n+
41namespace OPENSUBDIV_VERSION {
\n
42
\n-
43namespace Osd {
\n-
44
\n-
\n-\n-
52public:
\n-
\n-
53 static GLStencilTableSSBO *Create(Far::StencilTable const *stencilTable,
\n-
54 void *deviceContext = NULL) {
\n-
55 (void)deviceContext; // unused
\n-
56 return new GLStencilTableSSBO(stencilTable);
\n-
57 }
\n+
43namespace Far {
\n+
44 class StencilTable;
\n+
45}
\n+
46
\n+
47namespace Osd {
\n+
48
\n+
\n+\n+
57public:
\n+
58 template <typename DEVICE_CONTEXT>
\n+
\n+
59 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n+
60 DEVICE_CONTEXT context) {
\n+
61 return new D3D11StencilTable(stencilTable, context->GetDeviceContext());
\n+
62 }
\n+
\n+
63
\n+
\n+
64 static D3D11StencilTable *Create(Far::StencilTable const *stencilTable,
\n+
65 ID3D11DeviceContext *deviceContext) {
\n+
66 return new D3D11StencilTable(stencilTable, deviceContext);
\n+
67 }
\n
\n-
\n-\n-
59 Far::LimitStencilTable const *limitStencilTable,
\n-
60 void *deviceContext = NULL) {
\n-
61 (void)deviceContext; // unused
\n-
62 return new GLStencilTableSSBO(limitStencilTable);
\n-
63 }
\n-
\n-
64
\n-
65 explicit GLStencilTableSSBO(Far::StencilTable const *stencilTable);
\n-
66 explicit GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable);
\n-\n
68
\n-
69 // interfaces needed for GLSLComputeKernel
\n-
70 GLuint GetSizesBuffer() const { return _sizes; }
\n-
71 GLuint GetOffsetsBuffer() const { return _offsets; }
\n-
72 GLuint GetIndicesBuffer() const { return _indices; }
\n-
73 GLuint GetWeightsBuffer() const { return _weights; }
\n-
74 GLuint GetDuWeightsBuffer() const { return _duWeights; }
\n-
75 GLuint GetDvWeightsBuffer() const { return _dvWeights; }
\n-
76 GLuint GetDuuWeightsBuffer() const { return _duuWeights; }
\n-
77 GLuint GetDuvWeightsBuffer() const { return _duvWeights; }
\n-
78 GLuint GetDvvWeightsBuffer() const { return _dvvWeights; }
\n-
79 int GetNumStencils() const { return _numStencils; }
\n+\n+
70 ID3D11DeviceContext *deviceContext);
\n+
71
\n+\n+
73
\n+
74 // interfaces needed for D3D11ComputeEvaluator
\n+
75 ID3D11ShaderResourceView *GetSizesSRV() const { return _sizes; }
\n+
76 ID3D11ShaderResourceView *GetOffsetsSRV() const { return _offsets; }
\n+
77 ID3D11ShaderResourceView *GetIndicesSRV() const { return _indices; }
\n+
78 ID3D11ShaderResourceView *GetWeightsSRV() const { return _weights; }
\n+
79 int GetNumStencils() const { return _numStencils; }
\n
80
\n
81private:
\n-
82 GLuint _sizes;
\n-
83 GLuint _offsets;
\n-
84 GLuint _indices;
\n-
85 GLuint _weights;
\n-
86 GLuint _duWeights;
\n-
87 GLuint _dvWeights;
\n-
88 GLuint _duuWeights;
\n-
89 GLuint _duvWeights;
\n-
90 GLuint _dvvWeights;
\n+
82 ID3D11ShaderResourceView *_sizes;
\n+
83 ID3D11ShaderResourceView *_offsets;
\n+
84 ID3D11ShaderResourceView *_indices;
\n+
85 ID3D11ShaderResourceView *_weights;
\n+
86 ID3D11Buffer *_sizesBuffer;
\n+
87 ID3D11Buffer *_offsetsBuffer;
\n+
88 ID3D11Buffer *_indicesBuffer;
\n+
89 ID3D11Buffer *_weightsBuffer;
\n+
90
\n
91 int _numStencils;
\n
92};
\n
\n
93
\n
94// ---------------------------------------------------------------------------
\n
95
\n
\n-\n+\n
97public:
\n-
98 typedef bool Instantiatable;
\n-
\n-\n-
100 BufferDescriptor const &dstDesc,
\n-
101 BufferDescriptor const &duDesc,
\n-
102 BufferDescriptor const &dvDesc,
\n-
103 void * deviceContext = NULL) {
\n-
104 return Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-\n-\n-\n-
108 deviceContext);
\n-
109 }
\n-
\n-
110
\n-
\n-\n-
112 BufferDescriptor const &dstDesc,
\n-
113 BufferDescriptor const &duDesc,
\n-
114 BufferDescriptor const &dvDesc,
\n-
115 BufferDescriptor const &duuDesc,
\n-
116 BufferDescriptor const &duvDesc,
\n-
117 BufferDescriptor const &dvvDesc,
\n-
118 void * deviceContext = NULL) {
\n-
119 (void)deviceContext; // not used
\n-
120 GLComputeEvaluator *instance = new GLComputeEvaluator();
\n-
121 if (instance->Compile(srcDesc, dstDesc, duDesc, dvDesc,
\n-
122 duuDesc, duvDesc, dvvDesc))
\n-
123 return instance;
\n-
124 delete instance;
\n-
125 return NULL;
\n-
126 }
\n-
\n-
127
\n-\n-
130
\n-\n-
133
\n-
139
\n-
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
168 static bool EvalStencils(
\n-
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
171 STENCIL_TABLE const *stencilTable,
\n-
172 GLComputeEvaluator const *instance,
\n-
173 void * deviceContext = NULL) {
\n-
174
\n-
175 if (instance) {
\n-
176 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
177 dstBuffer, dstDesc,
\n-
178 stencilTable);
\n-
179 } else {
\n-
180 // Create an instance on demand (slow)
\n-
181 (void)deviceContext; // unused
\n-
182 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
185 if (instance) {
\n-
186 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
187 dstBuffer, dstDesc,
\n-
188 stencilTable);
\n-
189 delete instance;
\n-
190 return r;
\n-
191 }
\n-
192 return false;
\n-
193 }
\n-
194 }
\n-
\n-
195
\n-
235 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
236 static bool EvalStencils(
\n-
237 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
238 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
239 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
240 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
241 STENCIL_TABLE const *stencilTable,
\n-
242 GLComputeEvaluator const *instance,
\n-
243 void * deviceContext = NULL) {
\n-
244
\n-
245 if (instance) {
\n-
246 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
247 dstBuffer, dstDesc,
\n-
248 duBuffer, duDesc,
\n-
249 dvBuffer, dvDesc,
\n-
250 stencilTable);
\n-
251 } else {
\n-
252 // Create an instance on demand (slow)
\n-
253 (void)deviceContext; // unused
\n-
254 instance = Create(srcDesc, dstDesc, duDesc, dvDesc);
\n-
255 if (instance) {
\n-
256 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
257 dstBuffer, dstDesc,
\n-
258 duBuffer, duDesc,
\n-
259 dvBuffer, dvDesc,
\n-
260 stencilTable);
\n-
261 delete instance;
\n-
262 return r;
\n-
263 }
\n-
264 return false;
\n-
265 }
\n-
266 }
\n-
\n-
267
\n-
325 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
326 static bool EvalStencils(
\n-
327 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
328 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
329 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
330 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
331 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
332 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
333 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
334 STENCIL_TABLE const *stencilTable,
\n-
335 GLComputeEvaluator const *instance,
\n-
336 void * deviceContext = NULL) {
\n-
337
\n-
338 if (instance) {
\n-
339 return instance->EvalStencils(srcBuffer, srcDesc,
\n-
340 dstBuffer, dstDesc,
\n-
341 duBuffer, duDesc,
\n-
342 dvBuffer, dvDesc,
\n-
343 duuBuffer, duuDesc,
\n-
344 duvBuffer, duvDesc,
\n-
345 dvvBuffer, dvvDesc,
\n-
346 stencilTable);
\n-
347 } else {
\n-
348 // Create an instance on demand (slow)
\n-
349 (void)deviceContext; // unused
\n-
350 instance = Create(srcDesc, dstDesc, duDesc, dvDesc,
\n-
351 duuDesc, duvDesc, dvvDesc);
\n-
352 if (instance) {
\n-
353 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n-
354 dstBuffer, dstDesc,
\n-
355 duBuffer, duDesc,
\n-
356 dvBuffer, dvDesc,
\n-
357 duuBuffer, duuDesc,
\n-
358 duvBuffer, duvDesc,
\n-
359 dvvBuffer, dvvDesc,
\n-
360 stencilTable);
\n-
361 delete instance;
\n-
362 return r;
\n-
363 }
\n-
364 return false;
\n-
365 }
\n-
366 }
\n-
\n-
367
\n-
385 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
387 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
388 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
389 STENCIL_TABLE const *stencilTable) const {
\n-
390 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n-
391 dstBuffer->BindVBO(), dstDesc,
\n-
392 0, BufferDescriptor(),
\n-
393 0, BufferDescriptor(),
\n-
394 stencilTable->GetSizesBuffer(),
\n-
395 stencilTable->GetOffsetsBuffer(),
\n-
396 stencilTable->GetIndicesBuffer(),
\n-
397 stencilTable->GetWeightsBuffer(),
\n-
398 0,
\n-
399 0,
\n-
400 /* start = */ 0,
\n-
401 /* end = */ stencilTable->GetNumStencils());
\n-
402 }
\n-
\n-
403
\n-
433 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
435 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
436 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
437 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
438 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
439 STENCIL_TABLE const *stencilTable) const {
\n-
440 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n-
441 dstBuffer->BindVBO(), dstDesc,
\n-
442 duBuffer->BindVBO(), duDesc,
\n-
443 dvBuffer->BindVBO(), dvDesc,
\n-
444 stencilTable->GetSizesBuffer(),
\n-
445 stencilTable->GetOffsetsBuffer(),
\n-
446 stencilTable->GetIndicesBuffer(),
\n-
447 stencilTable->GetWeightsBuffer(),
\n-
448 stencilTable->GetDuWeightsBuffer(),
\n-
449 stencilTable->GetDvWeightsBuffer(),
\n-
450 /* start = */ 0,
\n-
451 /* end = */ stencilTable->GetNumStencils());
\n-
452 }
\n-
\n-
453
\n-
501 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-\n-
503 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
504 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
505 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
506 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
507 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
508 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
509 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
510 STENCIL_TABLE const *stencilTable) const {
\n-
511 return EvalStencils(srcBuffer->BindVBO(), srcDesc,
\n-
512 dstBuffer->BindVBO(), dstDesc,
\n-
513 duBuffer->BindVBO(), duDesc,
\n-
514 dvBuffer->BindVBO(), dvDesc,
\n-
515 duuBuffer->BindVBO(), duuDesc,
\n-
516 duvBuffer->BindVBO(), duvDesc,
\n-
517 dvvBuffer->BindVBO(), dvvDesc,
\n-
518 stencilTable->GetSizesBuffer(),
\n-
519 stencilTable->GetOffsetsBuffer(),
\n-
520 stencilTable->GetIndicesBuffer(),
\n-
521 stencilTable->GetWeightsBuffer(),
\n-
522 stencilTable->GetDuWeightsBuffer(),
\n-
523 stencilTable->GetDvWeightsBuffer(),
\n-
524 stencilTable->GetDuuWeightsBuffer(),
\n-
525 stencilTable->GetDuvWeightsBuffer(),
\n-
526 stencilTable->GetDvvWeightsBuffer(),
\n-
527 /* start = */ 0,
\n-
528 /* end = */ stencilTable->GetNumStencils());
\n-
529 }
\n-
\n-
530
\n-
566 bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n-
567 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n-
568 GLuint duBuffer, BufferDescriptor const &duDesc,
\n-
569 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n-
570 GLuint sizesBuffer,
\n-
571 GLuint offsetsBuffer,
\n-
572 GLuint indicesBuffer,
\n-
573 GLuint weightsBuffer,
\n-
574 GLuint duWeightsBuffer,
\n-
575 GLuint dvWeightsBuffer,
\n-
576 int start,
\n-
577 int end) const;
\n-
578
\n-
632 bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n-
633 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n-
634 GLuint duBuffer, BufferDescriptor const &duDesc,
\n-
635 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n-
636 GLuint duuBuffer, BufferDescriptor const &duuDesc,
\n-
637 GLuint duvBuffer, BufferDescriptor const &duvDesc,
\n-
638 GLuint dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
639 GLuint sizesBuffer,
\n-
640 GLuint offsetsBuffer,
\n-
641 GLuint indicesBuffer,
\n-
642 GLuint weightsBuffer,
\n-
643 GLuint duWeightsBuffer,
\n-
644 GLuint dvWeightsBuffer,
\n-
645 GLuint duuWeightsBuffer,
\n-
646 GLuint duvWeightsBuffer,
\n-
647 GLuint dvvWeightsBuffer,
\n-
648 int start,
\n-
649 int end) const;
\n-
650
\n-
656
\n-
689 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
690 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
691 static bool EvalPatches(
\n-
692 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
693 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
694 int numPatchCoords,
\n-
695 PATCHCOORD_BUFFER *patchCoords,
\n-
696 PATCH_TABLE *patchTable,
\n-
697 GLComputeEvaluator const *instance,
\n-
698 void * deviceContext = NULL) {
\n-
699
\n-
700 if (instance) {
\n-
701 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
702 dstBuffer, dstDesc,
\n-
703 numPatchCoords, patchCoords,
\n-
704 patchTable);
\n-
705 } else {
\n-
706 // Create an instance on demand (slow)
\n-
707 (void)deviceContext; // unused
\n-
708 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
711 if (instance) {
\n-
712 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
713 dstBuffer, dstDesc,
\n-
714 numPatchCoords, patchCoords,
\n-
715 patchTable);
\n-
716 delete instance;
\n-
717 return r;
\n-
718 }
\n-
719 return false;
\n-
720 }
\n-
721 }
\n-
\n-
722
\n-
767 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
768 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
769 static bool EvalPatches(
\n-
770 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
771 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
772 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
773 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
774 int numPatchCoords,
\n-
775 PATCHCOORD_BUFFER *patchCoords,
\n-
776 PATCH_TABLE *patchTable,
\n-
777 GLComputeEvaluator const *instance,
\n-
778 void * deviceContext = NULL) {
\n-
779
\n-
780 if (instance) {
\n-
781 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
782 dstBuffer, dstDesc,
\n-
783 duBuffer, duDesc,
\n-
784 dvBuffer, dvDesc,
\n-
785 numPatchCoords, patchCoords,
\n-
786 patchTable);
\n-
787 } else {
\n-
788 // Create an instance on demand (slow)
\n-
789 (void)deviceContext; // unused
\n-
790 instance = Create(srcDesc, dstDesc,
\n-
791 duDesc, dvDesc);
\n-
792 if (instance) {
\n-
793 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
794 dstBuffer, dstDesc,
\n-
795 duBuffer, duDesc,
\n-
796 dvBuffer, dvDesc,
\n-
797 numPatchCoords, patchCoords,
\n-
798 patchTable);
\n-
799 delete instance;
\n-
800 return r;
\n-
801 }
\n-
802 return false;
\n-
803 }
\n-
804 }
\n-
\n-
805
\n-
868 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
869 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
870 static bool EvalPatches(
\n-
871 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
872 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
873 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
874 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
875 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
876 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
877 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
878 int numPatchCoords,
\n-
879 PATCHCOORD_BUFFER *patchCoords,
\n-
880 PATCH_TABLE *patchTable,
\n-
881 GLComputeEvaluator const *instance,
\n-
882 void * deviceContext = NULL) {
\n-
883
\n-
884 if (instance) {
\n-
885 return instance->EvalPatches(srcBuffer, srcDesc,
\n-
886 dstBuffer, dstDesc,
\n-
887 duBuffer, duDesc,
\n-
888 dvBuffer, dvDesc,
\n-
889 duuBuffer, duuDesc,
\n-
890 duvBuffer, duvDesc,
\n-
891 dvvBuffer, dvvDesc,
\n-
892 numPatchCoords, patchCoords,
\n-
893 patchTable);
\n-
894 } else {
\n-
895 // Create an instance on demand (slow)
\n-
896 (void)deviceContext; // unused
\n-
897 instance = Create(srcDesc, dstDesc,
\n-
898 duDesc, dvDesc,
\n-
899 duuDesc, duvDesc, dvvDesc);
\n-
900 if (instance) {
\n-
901 bool r = instance->EvalPatches(srcBuffer, srcDesc,
\n-
902 dstBuffer, dstDesc,
\n-
903 duBuffer, duDesc,
\n-
904 dvBuffer, dvDesc,
\n-
905 duuBuffer, duuDesc,
\n-
906 duvBuffer, duvDesc,
\n-
907 dvvBuffer, dvvDesc,
\n-
908 numPatchCoords, patchCoords,
\n-
909 patchTable);
\n-
910 delete instance;
\n-
911 return r;
\n-
912 }
\n-
913 return false;
\n-
914 }
\n-
915 }
\n-
\n-
916
\n-
941 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
942 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
944 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
945 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
946 int numPatchCoords,
\n-
947 PATCHCOORD_BUFFER *patchCoords,
\n-
948 PATCH_TABLE *patchTable) const {
\n-
949
\n-
950 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
951 dstBuffer->BindVBO(), dstDesc,
\n-
952 0, BufferDescriptor(),
\n-
953 0, BufferDescriptor(),
\n-
954 numPatchCoords,
\n-
955 patchCoords->BindVBO(),
\n-
956 patchTable->GetPatchArrays(),
\n-
957 patchTable->GetPatchIndexBuffer(),
\n-
958 patchTable->GetPatchParamBuffer());
\n-
959 }
\n-
\n-
960
\n-
995 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
996 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
998 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
999 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1000 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1001 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1002 int numPatchCoords,
\n-
1003 PATCHCOORD_BUFFER *patchCoords,
\n-
1004 PATCH_TABLE *patchTable) const {
\n-
1005
\n-
1006 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1007 dstBuffer->BindVBO(), dstDesc,
\n-
1008 duBuffer->BindVBO(), duDesc,
\n-
1009 dvBuffer->BindVBO(), dvDesc,
\n-
1010 numPatchCoords,
\n-
1011 patchCoords->BindVBO(),
\n-
1012 patchTable->GetPatchArrays(),
\n-
1013 patchTable->GetPatchIndexBuffer(),
\n-
1014 patchTable->GetPatchParamBuffer());
\n-
1015 }
\n-
\n-
1016
\n-
1069 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1070 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1072 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1073 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1074 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1075 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1076 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1077 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1078 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1079 int numPatchCoords,
\n-
1080 PATCHCOORD_BUFFER *patchCoords,
\n-
1081 PATCH_TABLE *patchTable) const {
\n-
1082
\n-
1083 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1084 dstBuffer->BindVBO(), dstDesc,
\n-
1085 duBuffer->BindVBO(), duDesc,
\n-
1086 dvBuffer->BindVBO(), dvDesc,
\n-
1087 duuBuffer->BindVBO(), duuDesc,
\n-
1088 duvBuffer->BindVBO(), duvDesc,
\n-
1089 dvvBuffer->BindVBO(), dvvDesc,
\n-
1090 numPatchCoords,
\n-
1091 patchCoords->BindVBO(),
\n-
1092 patchTable->GetPatchArrays(),
\n-
1093 patchTable->GetPatchIndexBuffer(),
\n-
1094 patchTable->GetPatchParamBuffer());
\n-
1095 }
\n-
\n-
1096
\n-
1097 bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n-
1098 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n-
1099 GLuint duBuffer, BufferDescriptor const &duDesc,
\n-
1100 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n-
1101 int numPatchCoords,
\n-
1102 GLuint patchCoordsBuffer,
\n-
1103 const PatchArrayVector &patchArrays,
\n-
1104 GLuint patchIndexBuffer,
\n-
1105 GLuint patchParamsBuffer) const;
\n-
1106
\n-
1107 bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc,
\n-
1108 GLuint dstBuffer, BufferDescriptor const &dstDesc,
\n-
1109 GLuint duBuffer, BufferDescriptor const &duDesc,
\n-
1110 GLuint dvBuffer, BufferDescriptor const &dvDesc,
\n-
1111 GLuint duuBuffer, BufferDescriptor const &duuDesc,
\n-
1112 GLuint duvBuffer, BufferDescriptor const &duvDesc,
\n-
1113 GLuint dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1114 int numPatchCoords,
\n-
1115 GLuint patchCoordsBuffer,
\n-
1116 const PatchArrayVector &patchArrays,
\n-
1117 GLuint patchIndexBuffer,
\n-
1118 GLuint patchParamsBuffer) const;
\n-
1119
\n-
1152 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1153 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1155 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1156 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1157 int numPatchCoords,
\n-
1158 PATCHCOORD_BUFFER *patchCoords,
\n-
1159 PATCH_TABLE *patchTable,
\n-
1160 GLComputeEvaluator const *instance,
\n-
1161 void * deviceContext = NULL) {
\n-
1162
\n-
1163 if (instance) {
\n-
1164 return instance->EvalPatchesVarying(
\n-
1165 srcBuffer, srcDesc,
\n-
1166 dstBuffer, dstDesc,
\n-
1167 numPatchCoords, patchCoords,
\n-
1168 patchTable);
\n-
1169 } else {
\n-
1170 // Create an instance on demand (slow)
\n-
1171 (void)deviceContext; // unused
\n-
1172 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
1175 if (instance) {
\n-
1176 bool r = instance->EvalPatchesVarying(
\n-
1177 srcBuffer, srcDesc,
\n-
1178 dstBuffer, dstDesc,
\n-
1179 numPatchCoords, patchCoords,
\n-
1180 patchTable);
\n-
1181 delete instance;
\n-
1182 return r;
\n-
1183 }
\n-
1184 return false;
\n-
1185 }
\n-
1186 }
\n-
\n-
1187
\n-
1212 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1213 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1215 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1216 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1217 int numPatchCoords,
\n-
1218 PATCHCOORD_BUFFER *patchCoords,
\n-
1219 PATCH_TABLE *patchTable) const {
\n-
1220
\n-
1221 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1222 dstBuffer->BindVBO(), dstDesc,
\n-
1223 0, BufferDescriptor(),
\n-
1224 0, BufferDescriptor(),
\n-
1225 numPatchCoords,
\n-
1226 patchCoords->BindVBO(),
\n-
1227 patchTable->GetVaryingPatchArrays(),
\n-
1228 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1229 patchTable->GetPatchParamBuffer());
\n-
1230 }
\n-
\n-
1231
\n-
1276 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1277 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1279 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1280 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1281 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1282 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1283 int numPatchCoords,
\n-
1284 PATCHCOORD_BUFFER *patchCoords,
\n-
1285 PATCH_TABLE *patchTable,
\n-
1286 GLComputeEvaluator const *instance,
\n-
1287 void * deviceContext = NULL) {
\n-
1288
\n-
1289 if (instance) {
\n-
1290 return instance->EvalPatchesVarying(
\n-
1291 srcBuffer, srcDesc,
\n-
1292 dstBuffer, dstDesc,
\n-
1293 duBuffer, duDesc,
\n-
1294 dvBuffer, dvDesc,
\n-
1295 numPatchCoords, patchCoords,
\n-
1296 patchTable);
\n-
1297 } else {
\n-
1298 // Create an instance on demand (slow)
\n-
1299 (void)deviceContext; // unused
\n-
1300 instance = Create(srcDesc, dstDesc,
\n-
1301 duDesc, dvDesc);
\n-
1302 if (instance) {
\n-
1303 bool r = instance->EvalPatchesVarying(
\n-
1304 srcBuffer, srcDesc,
\n-
1305 dstBuffer, dstDesc,
\n-
1306 duBuffer, duDesc,
\n-
1307 dvBuffer, dvDesc,
\n-
1308 numPatchCoords, patchCoords,
\n-
1309 patchTable);
\n-
1310 delete instance;
\n-
1311 return r;
\n-
1312 }
\n-
1313 return false;
\n-
1314 }
\n-
1315 }
\n-
\n-
1316
\n-
1353 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1354 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1356 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1357 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1358 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1359 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1360 int numPatchCoords,
\n-
1361 PATCHCOORD_BUFFER *patchCoords,
\n-
1362 PATCH_TABLE *patchTable) const {
\n-
1363
\n-
1364 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1365 dstBuffer->BindVBO(), dstDesc,
\n-
1366 duBuffer->BindVBO(), duDesc,
\n-
1367 dvBuffer->BindVBO(), dvDesc,
\n-
1368 numPatchCoords,
\n-
1369 patchCoords->BindVBO(),
\n-
1370 patchTable->GetVaryingPatchArrays(),
\n-
1371 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1372 patchTable->GetPatchParamBuffer());
\n-
1373 }
\n-
\n-
1374
\n-
1437 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1438 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1440 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1441 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1442 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1443 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1444 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1445 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1446 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1447 int numPatchCoords,
\n-
1448 PATCHCOORD_BUFFER *patchCoords,
\n-
1449 PATCH_TABLE *patchTable,
\n-
1450 GLComputeEvaluator const *instance,
\n-
1451 void * deviceContext = NULL) {
\n-
1452
\n-
1453 if (instance) {
\n-
1454 return instance->EvalPatchesVarying(
\n-
1455 srcBuffer, srcDesc,
\n-
1456 dstBuffer, dstDesc,
\n-
1457 duBuffer, duDesc,
\n-
1458 dvBuffer, dvDesc,
\n-
1459 duuBuffer, duuDesc,
\n-
1460 duvBuffer, duvDesc,
\n-
1461 dvvBuffer, dvvDesc,
\n-
1462 numPatchCoords, patchCoords,
\n-
1463 patchTable);
\n-
1464 } else {
\n-
1465 // Create an instance on demand (slow)
\n-
1466 (void)deviceContext; // unused
\n-
1467 instance = Create(srcDesc, dstDesc,
\n-
1468 duDesc, dvDesc,
\n-
1469 duuDesc, duvDesc, dvvDesc);
\n-
1470 if (instance) {
\n-
1471 bool r = instance->EvalPatchesVarying(
\n-
1472 srcBuffer, srcDesc,
\n-
1473 dstBuffer, dstDesc,
\n-
1474 duBuffer, duDesc,
\n-
1475 dvBuffer, dvDesc,
\n-
1476 duuBuffer, duuDesc,
\n-
1477 duvBuffer, duvDesc,
\n-
1478 dvvBuffer, dvvDesc,
\n-
1479 numPatchCoords, patchCoords,
\n-
1480 patchTable);
\n-
1481 delete instance;
\n-
1482 return r;
\n-
1483 }
\n-
1484 return false;
\n-
1485 }
\n-
1486 }
\n-
\n-
1487
\n-
1542 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1543 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1545 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1546 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1547 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1548 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1549 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1550 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1551 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1552 int numPatchCoords,
\n-
1553 PATCHCOORD_BUFFER *patchCoords,
\n-
1554 PATCH_TABLE *patchTable) const {
\n-
1555
\n-
1556 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1557 dstBuffer->BindVBO(), dstDesc,
\n-
1558 duBuffer->BindVBO(), duDesc,
\n-
1559 dvBuffer->BindVBO(), dvDesc,
\n-
1560 duuBuffer->BindVBO(), duuDesc,
\n-
1561 duvBuffer->BindVBO(), duvDesc,
\n-
1562 dvvBuffer->BindVBO(), dvvDesc,
\n-
1563 numPatchCoords,
\n-
1564 patchCoords->BindVBO(),
\n-
1565 patchTable->GetVaryingPatchArrays(),
\n-
1566 patchTable->GetVaryingPatchIndexBuffer(),
\n-
1567 patchTable->GetPatchParamBuffer());
\n-
1568 }
\n-
\n-
1569
\n-
1604 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1605 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1607 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1608 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1609 int numPatchCoords,
\n-
1610 PATCHCOORD_BUFFER *patchCoords,
\n-
1611 PATCH_TABLE *patchTable,
\n-
1612 int fvarChannel,
\n-
1613 GLComputeEvaluator const *instance,
\n-
1614 void * deviceContext = NULL) {
\n-
1615
\n-
1616 if (instance) {
\n-
1617 return instance->EvalPatchesFaceVarying(
\n-
1618 srcBuffer, srcDesc,
\n-
1619 dstBuffer, dstDesc,
\n-
1620 numPatchCoords, patchCoords,
\n-
1621 patchTable, fvarChannel);
\n-
1622 } else {
\n-
1623 // Create an instance on demand (slow)
\n-
1624 (void)deviceContext; // unused
\n-
1625 instance = Create(srcDesc, dstDesc,
\n-\n-\n-
1628 if (instance) {
\n-
1629 bool r = instance->EvalPatchesFaceVarying(
\n-
1630 srcBuffer, srcDesc,
\n-
1631 dstBuffer, dstDesc,
\n-
1632 numPatchCoords, patchCoords,
\n-
1633 patchTable, fvarChannel);
\n-
1634 delete instance;
\n-
1635 return r;
\n-
1636 }
\n-
1637 return false;
\n-
1638 }
\n-
1639 }
\n-
\n-
1640
\n-
1667 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1668 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1670 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1671 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1672 int numPatchCoords,
\n-
1673 PATCHCOORD_BUFFER *patchCoords,
\n-
1674 PATCH_TABLE *patchTable,
\n-
1675 int fvarChannel = 0) const {
\n-
1676
\n-
1677 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1678 dstBuffer->BindVBO(), dstDesc,
\n-
1679 0, BufferDescriptor(),
\n-
1680 0, BufferDescriptor(),
\n-
1681 numPatchCoords,
\n-
1682 patchCoords->BindVBO(),
\n-
1683 patchTable->GetFVarPatchArrays(fvarChannel),
\n-
1684 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1685 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1686 }
\n-
\n-
1687
\n-
1734 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1735 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1737 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1738 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1739 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1740 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1741 int numPatchCoords,
\n-
1742 PATCHCOORD_BUFFER *patchCoords,
\n-
1743 PATCH_TABLE *patchTable,
\n-
1744 int fvarChannel,
\n-
1745 GLComputeEvaluator const *instance,
\n-
1746 void * deviceContext = NULL) {
\n-
1747
\n-
1748 if (instance) {
\n-
1749 return instance->EvalPatchesFaceVarying(
\n-
1750 srcBuffer, srcDesc,
\n-
1751 dstBuffer, dstDesc,
\n-
1752 duBuffer, duDesc,
\n-
1753 dvBuffer, dvDesc,
\n-
1754 numPatchCoords, patchCoords,
\n-
1755 patchTable, fvarChannel);
\n-
1756 } else {
\n-
1757 // Create an instance on demand (slow)
\n-
1758 (void)deviceContext; // unused
\n-
1759 instance = Create(srcDesc, dstDesc,
\n-
1760 duDesc, dvDesc);
\n-
1761 if (instance) {
\n-
1762 bool r = instance->EvalPatchesFaceVarying(
\n-
1763 srcBuffer, srcDesc,
\n-
1764 dstBuffer, dstDesc,
\n-
1765 duBuffer, duDesc,
\n-
1766 dvBuffer, dvDesc,
\n-
1767 numPatchCoords, patchCoords,
\n-
1768 patchTable, fvarChannel);
\n-
1769 delete instance;
\n-
1770 return r;
\n-
1771 }
\n-
1772 return false;
\n-
1773 }
\n-
1774 }
\n-
\n-
1775
\n-
1814 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1815 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1817 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1818 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1819 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1820 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1821 int numPatchCoords,
\n-
1822 PATCHCOORD_BUFFER *patchCoords,
\n-
1823 PATCH_TABLE *patchTable,
\n-
1824 int fvarChannel = 0) const {
\n-
1825
\n-
1826 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
1827 dstBuffer->BindVBO(), dstDesc,
\n-
1828 duBuffer->BindVBO(), duDesc,
\n-
1829 dvBuffer->BindVBO(), dvDesc,
\n-
1830 numPatchCoords,
\n-
1831 patchCoords->BindVBO(),
\n-
1832 patchTable->GetFVarPatchArrays(fvarChannel),
\n-
1833 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1834 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1835 }
\n-
\n-
1836
\n-
1901 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1902 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1904 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1905 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1906 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1907 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1908 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1909 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1910 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1911 int numPatchCoords,
\n-
1912 PATCHCOORD_BUFFER *patchCoords,
\n-
1913 PATCH_TABLE *patchTable,
\n-
1914 int fvarChannel,
\n-
1915 GLComputeEvaluator const *instance,
\n-
1916 void * deviceContext = NULL) {
\n-
1917
\n-
1918 if (instance) {
\n-
1919 return instance->EvalPatchesFaceVarying(
\n-
1920 srcBuffer, srcDesc,
\n-
1921 dstBuffer, dstDesc,
\n-
1922 duBuffer, duDesc,
\n-
1923 dvBuffer, dvDesc,
\n-
1924 duuBuffer, duuDesc,
\n-
1925 duvBuffer, duvDesc,
\n-
1926 dvvBuffer, dvvDesc,
\n-
1927 numPatchCoords, patchCoords,
\n-
1928 patchTable, fvarChannel);
\n-
1929 } else {
\n-
1930 // Create an instance on demand (slow)
\n-
1931 (void)deviceContext; // unused
\n-
1932 instance = Create(srcDesc, dstDesc,
\n-
1933 duDesc, dvDesc,
\n-
1934 duuDesc, duvDesc, dvvDesc);
\n-
1935 if (instance) {
\n-
1936 bool r = instance->EvalPatchesFaceVarying(
\n-
1937 srcBuffer, srcDesc,
\n-
1938 dstBuffer, dstDesc,
\n-
1939 duBuffer, duDesc,
\n-
1940 dvBuffer, dvDesc,
\n-
1941 duuBuffer, duuDesc,
\n-
1942 duvBuffer, duvDesc,
\n-
1943 dvvBuffer, dvvDesc,
\n-
1944 numPatchCoords, patchCoords,
\n-
1945 patchTable, fvarChannel);
\n-
1946 delete instance;
\n-
1947 return r;
\n-
1948 }
\n-
1949 return false;
\n-
1950 }
\n-
1951 }
\n-
\n-
1952
\n-
2009 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
2010 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
2012 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
2013 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
2014 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
2015 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
2016 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
2017 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
2018 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
2019 int numPatchCoords,
\n-
2020 PATCHCOORD_BUFFER *patchCoords,
\n-
2021 PATCH_TABLE *patchTable,
\n-
2022 int fvarChannel = 0) const {
\n-
2023
\n-
2024 return EvalPatches(srcBuffer->BindVBO(), srcDesc,
\n-
2025 dstBuffer->BindVBO(), dstDesc,
\n-
2026 duBuffer->BindVBO(), duDesc,
\n-
2027 dvBuffer->BindVBO(), dvDesc,
\n-
2028 duuBuffer->BindVBO(), duuDesc,
\n-
2029 duvBuffer->BindVBO(), duvDesc,
\n-
2030 dvvBuffer->BindVBO(), dvvDesc,
\n-
2031 numPatchCoords,
\n-
2032 patchCoords->BindVBO(),
\n-
2033 patchTable->GetFVarPatchArrays(fvarChannel),
\n-
2034 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
2035 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
2036 }
\n-
\n-
2037
\n-
2043
\n-
2046 bool Compile(BufferDescriptor const &srcDesc,
\n-
2047 BufferDescriptor const &dstDesc,
\n-
2048 BufferDescriptor const &duDesc = BufferDescriptor(),
\n-
2049 BufferDescriptor const &dvDesc = BufferDescriptor(),
\n-
2050 BufferDescriptor const &duuDesc = BufferDescriptor(),
\n-
2051 BufferDescriptor const &duvDesc = BufferDescriptor(),
\n-
2052 BufferDescriptor const &dvvDesc = BufferDescriptor());
\n-
2053
\n-
2055 static void Synchronize(void *deviceContext);
\n-
2056
\n-
2057private:
\n-
2058 struct _StencilKernel {
\n-
2059 _StencilKernel();
\n-
2060 ~_StencilKernel();
\n-
2061 bool Compile(BufferDescriptor const &srcDesc,
\n-
2062 BufferDescriptor const &dstDesc,
\n-
2063 BufferDescriptor const &duDesc,
\n-
2064 BufferDescriptor const &dvDesc,
\n-
2065 BufferDescriptor const &duuDesc,
\n-
2066 BufferDescriptor const &duvDesc,
\n-
2067 BufferDescriptor const &dvvDesc,
\n-
2068 int workGroupSize);
\n-
2069 GLuint program;
\n-
2070 GLuint uniformStart;
\n-
2071 GLuint uniformEnd;
\n-
2072 GLuint uniformSrcOffset;
\n-
2073 GLuint uniformDstOffset;
\n-
2074 GLuint uniformDuDesc;
\n-
2075 GLuint uniformDvDesc;
\n-
2076 GLuint uniformDuuDesc;
\n-
2077 GLuint uniformDuvDesc;
\n-
2078 GLuint uniformDvvDesc;
\n-
2079 } _stencilKernel;
\n-
2080
\n-
2081 struct _PatchKernel {
\n-
2082 _PatchKernel();
\n-
2083 ~_PatchKernel();
\n-
2084 bool Compile(BufferDescriptor const &srcDesc,
\n-
2085 BufferDescriptor const &dstDesc,
\n-
2086 BufferDescriptor const &duDesc,
\n-
2087 BufferDescriptor const &dvDesc,
\n-
2088 BufferDescriptor const &duuDesc,
\n-
2089 BufferDescriptor const &duvDesc,
\n-
2090 BufferDescriptor const &dvvDesc,
\n-
2091 int workGroupSize);
\n-
2092 GLuint program;
\n-
2093 GLuint uniformSrcOffset;
\n-
2094 GLuint uniformDstOffset;
\n-
2095 GLuint uniformPatchArray;
\n-
2096 GLuint uniformDuDesc;
\n-
2097 GLuint uniformDvDesc;
\n-
2098 GLuint uniformDuuDesc;
\n-
2099 GLuint uniformDuvDesc;
\n-
2100 GLuint uniformDvvDesc;
\n-
2101 } _patchKernel;
\n-
2102
\n-
2103 int _workGroupSize;
\n-
2104 GLuint _patchArraysSSBO;
\n-
2105};
\n-
\n-
2106
\n-
2107} // end namespace Osd
\n-
2108
\n-
2109} // end namespace OPENSUBDIV_VERSION
\n-
2110using namespace OPENSUBDIV_VERSION;
\n-
2111
\n-
2112} // end namespace OpenSubdiv
\n-
2113
\n-
2114
\n-
2115#endif // OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H
\n+
98 typedef bool Instantiatable;
\n+\n+
100 BufferDescriptor const &dstDesc,
\n+
101 BufferDescriptor const &duDesc,
\n+
102 BufferDescriptor const &dvDesc,
\n+
103 ID3D11DeviceContext *deviceContext);
\n+
104
\n+\n+
106 BufferDescriptor const &dstDesc,
\n+
107 BufferDescriptor const &duDesc,
\n+
108 BufferDescriptor const &dvDesc,
\n+
109 BufferDescriptor const &duuDesc,
\n+
110 BufferDescriptor const &duvDesc,
\n+
111 BufferDescriptor const &dvvDesc,
\n+
112 ID3D11DeviceContext *deviceContext);
\n+
113
\n+\n+
116
\n+\n+
119
\n+
147 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
148 static bool EvalStencils(
\n+
149 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
150 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
151 STENCIL_TABLE const *stencilTable,
\n+
152 D3D11ComputeEvaluator const *instance,
\n+
153 ID3D11DeviceContext * deviceContext) {
\n+
154 if (instance) {
\n+
155 return instance->EvalStencils(srcBuffer, srcDesc,
\n+
156 dstBuffer, dstDesc,
\n+
157 stencilTable,
\n+
158 deviceContext);
\n+
159 } else {
\n+
160 // Create an instance on demand (slow)
\n+
161 (void)deviceContext; // unused
\n+
162 instance = Create(srcDesc, dstDesc,
\n+\n+\n+
165 deviceContext);
\n+
166 if (instance) {
\n+
167 bool r = instance->EvalStencils(srcBuffer, srcDesc,
\n+
168 dstBuffer, dstDesc,
\n+
169 stencilTable,
\n+
170 deviceContext);
\n+
171 delete instance;
\n+
172 return r;
\n+
173 }
\n+
174 return false;
\n+
175 }
\n+
176 }
\n+
\n+
177
\n+
180 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+\n+
182 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
183 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
184 STENCIL_TABLE const *stencilTable,
\n+
185 ID3D11DeviceContext *deviceContext) const {
\n+
186 return EvalStencils(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,
\n+
187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,
\n+
188 stencilTable->GetSizesSRV(),
\n+
189 stencilTable->GetOffsetsSRV(),
\n+
190 stencilTable->GetIndicesSRV(),
\n+
191 stencilTable->GetWeightsSRV(),
\n+
192 /* start = */ 0,
\n+
193 /* end = */ stencilTable->GetNumStencils(),
\n+
194 deviceContext);
\n+
195 }
\n+
\n+
196
\n+
199 bool EvalStencils(ID3D11UnorderedAccessView *srcSRV,
\n+
200 BufferDescriptor const &srcDesc,
\n+
201 ID3D11UnorderedAccessView *dstUAV,
\n+
202 BufferDescriptor const &dstDesc,
\n+
203 ID3D11ShaderResourceView *sizesSRV,
\n+
204 ID3D11ShaderResourceView *offsetsSRV,
\n+
205 ID3D11ShaderResourceView *indicesSRV,
\n+
206 ID3D11ShaderResourceView *weightsSRV,
\n+
207 int start,
\n+
208 int end,
\n+
209 ID3D11DeviceContext *deviceContext) const;
\n+
210
\n+
212 bool Compile(BufferDescriptor const &srcDesc,
\n+
213 BufferDescriptor const &dstDesc,
\n+
214 ID3D11DeviceContext *deviceContext);
\n+
215
\n+
217 static void Synchronize(ID3D11DeviceContext *deviceContext);
\n+
218
\n+
219private:
\n+
220 ID3D11ComputeShader * _computeShader;
\n+
221 ID3D11ClassLinkage * _classLinkage;
\n+
222 ID3D11ClassInstance * _singleBufferKernel;
\n+
223 ID3D11ClassInstance * _separateBufferKernel;
\n+
224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels
\n+
225
\n+
226 int _workGroupSize;
\n+
227};
\n+
\n+
228
\n+
229} // end namespace Osd
\n+
230
\n+
231} // end namespace OPENSUBDIV_VERSION
\n+
232using namespace OPENSUBDIV_VERSION;
\n+
233
\n+
234} // end namespace OpenSubdiv
\n+
235
\n+
236
\n+
237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H
\n \n-
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-\n-\n-
GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable)
\n-\n-\n-\n-\n-\n-
GLStencilTableSSBO(Far::StencilTable const *stencilTable)
\n-\n-\n-
static GLStencilTableSSBO * Create(Far::LimitStencilTable const *limitStencilTable, void *deviceContext=NULL)
\n-\n-\n-
static GLStencilTableSSBO * Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)
\n-\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-\n-
bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays, GLuint patchIndexBuffer, GLuint patchParamsBuffer) const
\n-
~GLComputeEvaluator()
Destructor. note that the GL context must be made current.
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, GLuint sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer, GLuint duWeightsBuffer, GLuint dvWeightsBuffer, GLuint duuWeightsBuffer, GLuint duvWeightsBuffer, GLuint dvvWeightsBuffer, int start, int end) const
Dispatch the GLSL compute kernel on GPU asynchronously returns false if the kernel hasn't been compil...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-\n-
bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable) const
Generic stencil function.
\n-
bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays, GLuint patchIndexBuffer, GLuint patchParamsBuffer) const
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, void *deviceContext=NULL)
\n-
bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer, GLuint duWeightsBuffer, GLuint dvWeightsBuffer, int start, int end) const
Dispatch the GLSL compute kernel on GPU asynchronously returns false if the kernel hasn't been compil...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic static stencil function. This function has a same signature as other device kernels have so t...
\n-
static void Synchronize(void *deviceContext)
Wait the dispatched kernel finishes.
\n-
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const &dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(), BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const &dvvDesc=BufferDescriptor())
\n-
bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, void *deviceContext=NULL)
\n-
bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
Stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, DEVICE_CONTEXT context)
\n+\n+\n+\n+\n+
D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n+
static D3D11StencilTable * Create(Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
\n+\n+\n+\n+
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext *deviceContext)
Generic static compute function. This function has a same signature as other device kernels have so t...
\n+
static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc, BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc, BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, ID3D11DeviceContext *deviceContext)
\n+\n+
static void Synchronize(ID3D11DeviceContext *deviceContext)
Wait the dispatched kernel finishes.
\n+
bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, ID3D11DeviceContext *deviceContext) const
\n+
bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc, ID3D11DeviceContext *deviceContext)
Configure DX kernel. Returns false if it fails to compile the kernel.
\n+\n+\n+
bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const &srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc, ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV, ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int start, int end, ID3D11DeviceContext *deviceContext) const
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-glComputeEvaluator.h\n+d3d11ComputeEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,1359 +24,272 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n 29\n-30#include \"../osd/opengl.h\"\n-31#include \"../osd/types.h\"\n-32#include \"../osd/bufferDescriptor.h\"\n-33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Far {\n-38 class PatchTable;\n-39 class StencilTable;\n-40 class LimitStencilTable;\n-41}\n+30struct ID3D11DeviceContext;\n+31struct ID3D11Buffer;\n+32struct ID3D11ComputeShader;\n+33struct ID3D11ClassLinkage;\n+34struct ID3D11ClassInstance;\n+35struct ID3D11ShaderResourceView;\n+36struct ID3D11UnorderedAccessView;\n+37\n+38#include \"../osd/bufferDescriptor.h\"\n+39\n+40namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+41namespace OPENSUBDIV_VERSION {\n 42\n-43namespace Osd {\n-44\n-_\b5_\b1class _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO {\n-52public:\n-_\b5_\b3 static _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n-54 void *deviceContext = NULL) {\n-55 (void)deviceContext; // unused\n-56 return new _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(stencilTable);\n-57 }\n-_\b5_\b8 static _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO *_\bC_\br_\be_\ba_\bt_\be(\n-59 _\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *limitStencilTable,\n-60 void *deviceContext = NULL) {\n-61 (void)deviceContext; // unused\n-62 return new _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(limitStencilTable);\n-63 }\n-64\n-_\b6_\b5 explicit _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable);\n-_\b6_\b6 explicit _\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO(_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const\n-*limitStencilTable);\n-_\b6_\b7 _\b~_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO();\n+43namespace Far {\n+44 class StencilTable;\n+45}\n+46\n+47namespace Osd {\n+48\n+_\b5_\b6class _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be {\n+57public:\n+58 template \n+_\b5_\b9 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+60 DEVICE_CONTEXT context) {\n+61 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, context->GetDeviceContext());\n+62 }\n+63\n+_\b6_\b4 static _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be *_\bC_\br_\be_\ba_\bt_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+65 ID3D11DeviceContext *deviceContext) {\n+66 return new _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(stencilTable, deviceContext);\n+67 }\n 68\n-69 // interfaces needed for GLSLComputeKernel\n-_\b7_\b0 GLuint _\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _sizes; }\n-_\b7_\b1 GLuint _\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _offsets; }\n-_\b7_\b2 GLuint _\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _indices; }\n-_\b7_\b3 GLuint _\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _weights; }\n-_\b7_\b4 GLuint _\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duWeights; }\n-_\b7_\b5 GLuint _\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvWeights; }\n-_\b7_\b6 GLuint _\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duuWeights; }\n-_\b7_\b7 GLuint _\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _duvWeights; }\n-_\b7_\b8 GLuint _\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br() const { return _dvvWeights; }\n+_\b6_\b9 _\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be(_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be const *stencilTable,\n+70 ID3D11DeviceContext *deviceContext);\n+71\n+_\b7_\b2 _\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be();\n+73\n+74 // interfaces needed for D3D11ComputeEvaluator\n+_\b7_\b5 ID3D11ShaderResourceView *_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV() const { return _sizes; }\n+_\b7_\b6 ID3D11ShaderResourceView *_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV() const { return _offsets; }\n+_\b7_\b7 ID3D11ShaderResourceView *_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV() const { return _indices; }\n+_\b7_\b8 ID3D11ShaderResourceView *_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV() const { return _weights; }\n _\b7_\b9 int _\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs() const { return _numStencils; }\n 80\n 81private:\n-82 GLuint _sizes;\n-83 GLuint _offsets;\n-84 GLuint _indices;\n-85 GLuint _weights;\n-86 GLuint _duWeights;\n-87 GLuint _dvWeights;\n-88 GLuint _duuWeights;\n-89 GLuint _duvWeights;\n-90 GLuint _dvvWeights;\n+82 ID3D11ShaderResourceView *_sizes;\n+83 ID3D11ShaderResourceView *_offsets;\n+84 ID3D11ShaderResourceView *_indices;\n+85 ID3D11ShaderResourceView *_weights;\n+86 ID3D11Buffer *_sizesBuffer;\n+87 ID3D11Buffer *_offsetsBuffer;\n+88 ID3D11Buffer *_indicesBuffer;\n+89 ID3D11Buffer *_weightsBuffer;\n+90\n 91 int _numStencils;\n 92};\n 93\n 94// --------------------------------------------------------------------------\n -\n 95\n-_\b9_\b6class _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+_\b9_\b6class _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n 97public:\n _\b9_\b8 typedef bool _\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be;\n-_\b9_\b9 static _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+_\b9_\b9 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n 100 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n 101 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n 102 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-103 void * deviceContext = NULL) {\n-104 return _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-105 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-108 deviceContext);\n-109 }\n-110\n-_\b1_\b1_\b1 static _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-112 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-113 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-114 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-115 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-116 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-117 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-118 void * deviceContext = NULL) {\n-119 (void)deviceContext; // not used\n-120 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = new _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-121 if (instance->_\bC_\bo_\bm_\bp_\bi_\bl_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-122 duuDesc, duvDesc, dvvDesc))\n-123 return instance;\n-124 delete instance;\n-125 return NULL;\n-126 }\n-127\n-_\b1_\b2_\b9 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-130\n-_\b1_\b3_\b2 _\b~_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n-133\n-139\n-167 template \n-_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-171 STENCIL_TABLE const *stencilTable,\n-172 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-173 void * deviceContext = NULL) {\n-174\n-175 if (instance) {\n-176 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-177 dstBuffer, dstDesc,\n-178 stencilTable);\n-179 } else {\n-180 // Create an instance on demand (slow)\n-181 (void)deviceContext; // unused\n-182 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-183 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-184 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-185 if (instance) {\n-186 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-187 dstBuffer, dstDesc,\n-188 stencilTable);\n-189 delete instance;\n-190 return r;\n-191 }\n-192 return false;\n-193 }\n-194 }\n-195\n-235 template \n-_\b2_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-237 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-238 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-239 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-240 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-241 STENCIL_TABLE const *stencilTable,\n-242 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-243 void * deviceContext = NULL) {\n-244\n-245 if (instance) {\n-246 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-247 dstBuffer, dstDesc,\n-248 duBuffer, duDesc,\n-249 dvBuffer, dvDesc,\n-250 stencilTable);\n-251 } else {\n-252 // Create an instance on demand (slow)\n-253 (void)deviceContext; // unused\n-254 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc);\n-255 if (instance) {\n-256 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-257 dstBuffer, dstDesc,\n-258 duBuffer, duDesc,\n-259 dvBuffer, dvDesc,\n-260 stencilTable);\n-261 delete instance;\n-262 return r;\n-263 }\n-264 return false;\n-265 }\n-266 }\n-267\n-325 template \n-_\b3_\b2_\b6 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-327 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-328 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-329 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-330 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-331 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-332 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-333 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-334 STENCIL_TABLE const *stencilTable,\n-335 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-336 void * deviceContext = NULL) {\n-337\n-338 if (instance) {\n-339 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-340 dstBuffer, dstDesc,\n-341 duBuffer, duDesc,\n-342 dvBuffer, dvDesc,\n-343 duuBuffer, duuDesc,\n-344 duvBuffer, duvDesc,\n-345 dvvBuffer, dvvDesc,\n-346 stencilTable);\n-347 } else {\n-348 // Create an instance on demand (slow)\n-349 (void)deviceContext; // unused\n-350 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc, duDesc, dvDesc,\n-351 duuDesc, duvDesc, dvvDesc);\n-352 if (instance) {\n-353 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n-354 dstBuffer, dstDesc,\n-355 duBuffer, duDesc,\n-356 dvBuffer, dvDesc,\n-357 duuBuffer, duuDesc,\n-358 duvBuffer, duvDesc,\n-359 dvvBuffer, dvvDesc,\n-360 stencilTable);\n-361 delete instance;\n-362 return r;\n-363 }\n-364 return false;\n-365 }\n-366 }\n-367\n-385 template \n-_\b3_\b8_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-387 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-388 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-389 STENCIL_TABLE const *stencilTable) const {\n-390 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n-391 dstBuffer->BindVBO(), dstDesc,\n-392 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-393 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-394 stencilTable->GetSizesBuffer(),\n-395 stencilTable->GetOffsetsBuffer(),\n-396 stencilTable->GetIndicesBuffer(),\n-397 stencilTable->GetWeightsBuffer(),\n-398 0,\n-399 0,\n-400 /* start = */ 0,\n-401 /* end = */ stencilTable->GetNumStencils());\n-402 }\n-403\n-433 template \n-_\b4_\b3_\b4 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-435 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-436 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-437 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-438 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-439 STENCIL_TABLE const *stencilTable) const {\n-440 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n-441 dstBuffer->BindVBO(), dstDesc,\n-442 duBuffer->BindVBO(), duDesc,\n-443 dvBuffer->BindVBO(), dvDesc,\n-444 stencilTable->GetSizesBuffer(),\n-445 stencilTable->GetOffsetsBuffer(),\n-446 stencilTable->GetIndicesBuffer(),\n-447 stencilTable->GetWeightsBuffer(),\n-448 stencilTable->GetDuWeightsBuffer(),\n-449 stencilTable->GetDvWeightsBuffer(),\n-450 /* start = */ 0,\n-451 /* end = */ stencilTable->GetNumStencils());\n-452 }\n-453\n-501 template \n-_\b5_\b0_\b2 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-503 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-504 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-505 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-506 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-507 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-508 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-509 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-510 STENCIL_TABLE const *stencilTable) const {\n-511 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindVBO(), srcDesc,\n-512 dstBuffer->BindVBO(), dstDesc,\n-513 duBuffer->BindVBO(), duDesc,\n-514 dvBuffer->BindVBO(), dvDesc,\n-515 duuBuffer->BindVBO(), duuDesc,\n-516 duvBuffer->BindVBO(), duvDesc,\n-517 dvvBuffer->BindVBO(), dvvDesc,\n-518 stencilTable->GetSizesBuffer(),\n-519 stencilTable->GetOffsetsBuffer(),\n-520 stencilTable->GetIndicesBuffer(),\n-521 stencilTable->GetWeightsBuffer(),\n-522 stencilTable->GetDuWeightsBuffer(),\n-523 stencilTable->GetDvWeightsBuffer(),\n-524 stencilTable->GetDuuWeightsBuffer(),\n-525 stencilTable->GetDuvWeightsBuffer(),\n-526 stencilTable->GetDvvWeightsBuffer(),\n-527 /* start = */ 0,\n-528 /* end = */ stencilTable->GetNumStencils());\n-529 }\n-530\n-_\b5_\b6_\b6 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-567 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-568 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-569 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-570 GLuint sizesBuffer,\n-571 GLuint offsetsBuffer,\n-572 GLuint indicesBuffer,\n-573 GLuint weightsBuffer,\n-574 GLuint duWeightsBuffer,\n-575 GLuint dvWeightsBuffer,\n-576 int start,\n-577 int end) const;\n-578\n-_\b6_\b3_\b2 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-633 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-634 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-635 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-636 GLuint duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-637 GLuint duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-638 GLuint dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-639 GLuint sizesBuffer,\n-640 GLuint offsetsBuffer,\n-641 GLuint indicesBuffer,\n-642 GLuint weightsBuffer,\n-643 GLuint duWeightsBuffer,\n-644 GLuint dvWeightsBuffer,\n-645 GLuint duuWeightsBuffer,\n-646 GLuint duvWeightsBuffer,\n-647 GLuint dvvWeightsBuffer,\n-648 int start,\n-649 int end) const;\n-650\n-656\n-689 template \n-_\b6_\b9_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-692 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-693 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-694 int numPatchCoords,\n-695 PATCHCOORD_BUFFER *patchCoords,\n-696 PATCH_TABLE *patchTable,\n-697 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-698 void * deviceContext = NULL) {\n-699\n-700 if (instance) {\n-701 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-702 dstBuffer, dstDesc,\n-703 numPatchCoords, patchCoords,\n-704 patchTable);\n-705 } else {\n-706 // Create an instance on demand (slow)\n-707 (void)deviceContext; // unused\n-708 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-709 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-710 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-711 if (instance) {\n-712 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-713 dstBuffer, dstDesc,\n-714 numPatchCoords, patchCoords,\n-715 patchTable);\n-716 delete instance;\n-717 return r;\n-718 }\n-719 return false;\n-720 }\n-721 }\n-722\n-767 template \n-_\b7_\b6_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-770 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-771 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-772 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-773 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-774 int numPatchCoords,\n-775 PATCHCOORD_BUFFER *patchCoords,\n-776 PATCH_TABLE *patchTable,\n-777 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-778 void * deviceContext = NULL) {\n-779\n-780 if (instance) {\n-781 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-782 dstBuffer, dstDesc,\n-783 duBuffer, duDesc,\n-784 dvBuffer, dvDesc,\n-785 numPatchCoords, patchCoords,\n-786 patchTable);\n-787 } else {\n-788 // Create an instance on demand (slow)\n-789 (void)deviceContext; // unused\n-790 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-791 duDesc, dvDesc);\n-792 if (instance) {\n-793 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-794 dstBuffer, dstDesc,\n-795 duBuffer, duDesc,\n-796 dvBuffer, dvDesc,\n-797 numPatchCoords, patchCoords,\n-798 patchTable);\n-799 delete instance;\n-800 return r;\n-801 }\n-802 return false;\n-803 }\n-804 }\n-805\n-868 template \n-_\b8_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-871 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-872 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-873 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-874 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-875 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-876 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-877 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-878 int numPatchCoords,\n-879 PATCHCOORD_BUFFER *patchCoords,\n-880 PATCH_TABLE *patchTable,\n-881 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-882 void * deviceContext = NULL) {\n-883\n-884 if (instance) {\n-885 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-886 dstBuffer, dstDesc,\n-887 duBuffer, duDesc,\n-888 dvBuffer, dvDesc,\n-889 duuBuffer, duuDesc,\n-890 duvBuffer, duvDesc,\n-891 dvvBuffer, dvvDesc,\n-892 numPatchCoords, patchCoords,\n-893 patchTable);\n-894 } else {\n-895 // Create an instance on demand (slow)\n-896 (void)deviceContext; // unused\n-897 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-898 duDesc, dvDesc,\n-899 duuDesc, duvDesc, dvvDesc);\n-900 if (instance) {\n-901 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer, srcDesc,\n-902 dstBuffer, dstDesc,\n-903 duBuffer, duDesc,\n-904 dvBuffer, dvDesc,\n-905 duuBuffer, duuDesc,\n-906 duvBuffer, duvDesc,\n-907 dvvBuffer, dvvDesc,\n-908 numPatchCoords, patchCoords,\n-909 patchTable);\n-910 delete instance;\n-911 return r;\n-912 }\n-913 return false;\n-914 }\n-915 }\n-916\n-941 template \n-_\b9_\b4_\b3 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-944 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-945 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-946 int numPatchCoords,\n-947 PATCHCOORD_BUFFER *patchCoords,\n-948 PATCH_TABLE *patchTable) const {\n-949\n-950 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-951 dstBuffer->BindVBO(), dstDesc,\n-952 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-953 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-954 numPatchCoords,\n-955 patchCoords->BindVBO(),\n-956 patchTable->GetPatchArrays(),\n-957 patchTable->GetPatchIndexBuffer(),\n-958 patchTable->GetPatchParamBuffer());\n-959 }\n-960\n-995 template \n-_\b9_\b9_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-998 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-999 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1000 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1001 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1002 int numPatchCoords,\n-1003 PATCHCOORD_BUFFER *patchCoords,\n-1004 PATCH_TABLE *patchTable) const {\n-1005\n-1006 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1007 dstBuffer->BindVBO(), dstDesc,\n-1008 duBuffer->BindVBO(), duDesc,\n-1009 dvBuffer->BindVBO(), dvDesc,\n-1010 numPatchCoords,\n-1011 patchCoords->BindVBO(),\n-1012 patchTable->GetPatchArrays(),\n-1013 patchTable->GetPatchIndexBuffer(),\n-1014 patchTable->GetPatchParamBuffer());\n-1015 }\n-1016\n-1069 template \n-_\b1_\b0_\b7_\b1 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-1072 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1073 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1074 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1075 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1076 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1077 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1078 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1079 int numPatchCoords,\n-1080 PATCHCOORD_BUFFER *patchCoords,\n-1081 PATCH_TABLE *patchTable) const {\n-1082\n-1083 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1084 dstBuffer->BindVBO(), dstDesc,\n-1085 duBuffer->BindVBO(), duDesc,\n-1086 dvBuffer->BindVBO(), dvDesc,\n-1087 duuBuffer->BindVBO(), duuDesc,\n-1088 duvBuffer->BindVBO(), duvDesc,\n-1089 dvvBuffer->BindVBO(), dvvDesc,\n-1090 numPatchCoords,\n-1091 patchCoords->BindVBO(),\n-1092 patchTable->GetPatchArrays(),\n-1093 patchTable->GetPatchIndexBuffer(),\n-1094 patchTable->GetPatchParamBuffer());\n-1095 }\n-1096\n-_\b1_\b0_\b9_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1098 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1099 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1100 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1101 int numPatchCoords,\n-1102 GLuint patchCoordsBuffer,\n-1103 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br &patchArrays,\n-1104 GLuint patchIndexBuffer,\n-1105 GLuint patchParamsBuffer) const;\n-1106\n-_\b1_\b1_\b0_\b7 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(GLuint srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1108 GLuint dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1109 GLuint duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1110 GLuint dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1111 GLuint duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1112 GLuint duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1113 GLuint dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1114 int numPatchCoords,\n-1115 GLuint patchCoordsBuffer,\n-1116 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br &patchArrays,\n-1117 GLuint patchIndexBuffer,\n-1118 GLuint patchParamsBuffer) const;\n-1119\n-1152 template \n-_\b1_\b1_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1155 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1156 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1157 int numPatchCoords,\n-1158 PATCHCOORD_BUFFER *patchCoords,\n-1159 PATCH_TABLE *patchTable,\n-1160 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1161 void * deviceContext = NULL) {\n-1162\n-1163 if (instance) {\n-1164 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1165 srcBuffer, srcDesc,\n-1166 dstBuffer, dstDesc,\n-1167 numPatchCoords, patchCoords,\n-1168 patchTable);\n-1169 } else {\n-1170 // Create an instance on demand (slow)\n-1171 (void)deviceContext; // unused\n-1172 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1173 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1174 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-1175 if (instance) {\n-1176 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1177 srcBuffer, srcDesc,\n-1178 dstBuffer, dstDesc,\n-1179 numPatchCoords, patchCoords,\n-1180 patchTable);\n-1181 delete instance;\n-1182 return r;\n-1183 }\n-1184 return false;\n-1185 }\n-1186 }\n-1187\n-1212 template \n-_\b1_\b2_\b1_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1215 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1216 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1217 int numPatchCoords,\n-1218 PATCHCOORD_BUFFER *patchCoords,\n-1219 PATCH_TABLE *patchTable) const {\n-1220\n-1221 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1222 dstBuffer->BindVBO(), dstDesc,\n-1223 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1224 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1225 numPatchCoords,\n-1226 patchCoords->BindVBO(),\n-1227 patchTable->GetVaryingPatchArrays(),\n-1228 patchTable->GetVaryingPatchIndexBuffer(),\n-1229 patchTable->GetPatchParamBuffer());\n-1230 }\n-1231\n-1276 template \n-_\b1_\b2_\b7_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1279 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1280 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1281 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1282 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1283 int numPatchCoords,\n-1284 PATCHCOORD_BUFFER *patchCoords,\n-1285 PATCH_TABLE *patchTable,\n-1286 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1287 void * deviceContext = NULL) {\n-1288\n-1289 if (instance) {\n-1290 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1291 srcBuffer, srcDesc,\n-1292 dstBuffer, dstDesc,\n-1293 duBuffer, duDesc,\n-1294 dvBuffer, dvDesc,\n-1295 numPatchCoords, patchCoords,\n-1296 patchTable);\n-1297 } else {\n-1298 // Create an instance on demand (slow)\n-1299 (void)deviceContext; // unused\n-1300 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1301 duDesc, dvDesc);\n-1302 if (instance) {\n-1303 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1304 srcBuffer, srcDesc,\n-1305 dstBuffer, dstDesc,\n-1306 duBuffer, duDesc,\n-1307 dvBuffer, dvDesc,\n-1308 numPatchCoords, patchCoords,\n-1309 patchTable);\n-1310 delete instance;\n-1311 return r;\n-1312 }\n-1313 return false;\n-1314 }\n-1315 }\n-1316\n-1353 template \n-_\b1_\b3_\b5_\b5 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1356 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1357 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1358 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1359 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1360 int numPatchCoords,\n-1361 PATCHCOORD_BUFFER *patchCoords,\n-1362 PATCH_TABLE *patchTable) const {\n-1363\n-1364 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1365 dstBuffer->BindVBO(), dstDesc,\n-1366 duBuffer->BindVBO(), duDesc,\n-1367 dvBuffer->BindVBO(), dvDesc,\n-1368 numPatchCoords,\n-1369 patchCoords->BindVBO(),\n-1370 patchTable->GetVaryingPatchArrays(),\n-1371 patchTable->GetVaryingPatchIndexBuffer(),\n-1372 patchTable->GetPatchParamBuffer());\n-1373 }\n-1374\n-1437 template \n-_\b1_\b4_\b3_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1440 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1441 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1442 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1443 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1444 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1445 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1446 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1447 int numPatchCoords,\n-1448 PATCHCOORD_BUFFER *patchCoords,\n-1449 PATCH_TABLE *patchTable,\n-1450 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1451 void * deviceContext = NULL) {\n-1452\n-1453 if (instance) {\n-1454 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1455 srcBuffer, srcDesc,\n-1456 dstBuffer, dstDesc,\n-1457 duBuffer, duDesc,\n-1458 dvBuffer, dvDesc,\n-1459 duuBuffer, duuDesc,\n-1460 duvBuffer, duvDesc,\n-1461 dvvBuffer, dvvDesc,\n-1462 numPatchCoords, patchCoords,\n-1463 patchTable);\n-1464 } else {\n-1465 // Create an instance on demand (slow)\n-1466 (void)deviceContext; // unused\n-1467 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1468 duDesc, dvDesc,\n-1469 duuDesc, duvDesc, dvvDesc);\n-1470 if (instance) {\n-1471 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1472 srcBuffer, srcDesc,\n-1473 dstBuffer, dstDesc,\n-1474 duBuffer, duDesc,\n-1475 dvBuffer, dvDesc,\n-1476 duuBuffer, duuDesc,\n-1477 duvBuffer, duvDesc,\n-1478 dvvBuffer, dvvDesc,\n-1479 numPatchCoords, patchCoords,\n-1480 patchTable);\n-1481 delete instance;\n-1482 return r;\n-1483 }\n-1484 return false;\n-1485 }\n-1486 }\n-1487\n-1542 template \n-_\b1_\b5_\b4_\b4 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1545 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1546 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1547 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1548 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1549 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1550 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1551 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1552 int numPatchCoords,\n-1553 PATCHCOORD_BUFFER *patchCoords,\n-1554 PATCH_TABLE *patchTable) const {\n-1555\n-1556 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1557 dstBuffer->BindVBO(), dstDesc,\n-1558 duBuffer->BindVBO(), duDesc,\n-1559 dvBuffer->BindVBO(), dvDesc,\n-1560 duuBuffer->BindVBO(), duuDesc,\n-1561 duvBuffer->BindVBO(), duvDesc,\n-1562 dvvBuffer->BindVBO(), dvvDesc,\n-1563 numPatchCoords,\n-1564 patchCoords->BindVBO(),\n-1565 patchTable->GetVaryingPatchArrays(),\n-1566 patchTable->GetVaryingPatchIndexBuffer(),\n-1567 patchTable->GetPatchParamBuffer());\n-1568 }\n-1569\n-1604 template \n-_\b1_\b6_\b0_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1607 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1608 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1609 int numPatchCoords,\n-1610 PATCHCOORD_BUFFER *patchCoords,\n-1611 PATCH_TABLE *patchTable,\n-1612 int fvarChannel,\n-1613 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1614 void * deviceContext = NULL) {\n-1615\n-1616 if (instance) {\n-1617 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1618 srcBuffer, srcDesc,\n-1619 dstBuffer, dstDesc,\n-1620 numPatchCoords, patchCoords,\n-1621 patchTable, fvarChannel);\n-1622 } else {\n-1623 // Create an instance on demand (slow)\n-1624 (void)deviceContext; // unused\n-1625 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1626 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1627 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-1628 if (instance) {\n-1629 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1630 srcBuffer, srcDesc,\n-1631 dstBuffer, dstDesc,\n-1632 numPatchCoords, patchCoords,\n-1633 patchTable, fvarChannel);\n-1634 delete instance;\n-1635 return r;\n-1636 }\n-1637 return false;\n-1638 }\n-1639 }\n-1640\n-1667 template \n-_\b1_\b6_\b6_\b9 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1670 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1671 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1672 int numPatchCoords,\n-1673 PATCHCOORD_BUFFER *patchCoords,\n-1674 PATCH_TABLE *patchTable,\n-1675 int fvarChannel = 0) const {\n-1676\n-1677 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1678 dstBuffer->BindVBO(), dstDesc,\n-1679 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1680 0, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-1681 numPatchCoords,\n-1682 patchCoords->BindVBO(),\n-1683 patchTable->GetFVarPatchArrays(fvarChannel),\n-1684 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1685 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1686 }\n-1687\n-1734 template \n-_\b1_\b7_\b3_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1737 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1738 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1739 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1740 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1741 int numPatchCoords,\n-1742 PATCHCOORD_BUFFER *patchCoords,\n-1743 PATCH_TABLE *patchTable,\n-1744 int fvarChannel,\n-1745 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1746 void * deviceContext = NULL) {\n-1747\n-1748 if (instance) {\n-1749 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1750 srcBuffer, srcDesc,\n-1751 dstBuffer, dstDesc,\n-1752 duBuffer, duDesc,\n-1753 dvBuffer, dvDesc,\n-1754 numPatchCoords, patchCoords,\n-1755 patchTable, fvarChannel);\n-1756 } else {\n-1757 // Create an instance on demand (slow)\n-1758 (void)deviceContext; // unused\n-1759 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1760 duDesc, dvDesc);\n-1761 if (instance) {\n-1762 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1763 srcBuffer, srcDesc,\n-1764 dstBuffer, dstDesc,\n-1765 duBuffer, duDesc,\n-1766 dvBuffer, dvDesc,\n-1767 numPatchCoords, patchCoords,\n-1768 patchTable, fvarChannel);\n-1769 delete instance;\n-1770 return r;\n-1771 }\n-1772 return false;\n-1773 }\n-1774 }\n-1775\n-1814 template \n-_\b1_\b8_\b1_\b6 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1817 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1818 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1819 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1820 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1821 int numPatchCoords,\n-1822 PATCHCOORD_BUFFER *patchCoords,\n-1823 PATCH_TABLE *patchTable,\n-1824 int fvarChannel = 0) const {\n-1825\n-1826 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-1827 dstBuffer->BindVBO(), dstDesc,\n-1828 duBuffer->BindVBO(), duDesc,\n-1829 dvBuffer->BindVBO(), dvDesc,\n-1830 numPatchCoords,\n-1831 patchCoords->BindVBO(),\n-1832 patchTable->GetFVarPatchArrays(fvarChannel),\n-1833 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1834 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1835 }\n-1836\n-1901 template \n-_\b1_\b9_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1904 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1905 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1906 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1907 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1908 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1909 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1910 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1911 int numPatchCoords,\n-1912 PATCHCOORD_BUFFER *patchCoords,\n-1913 PATCH_TABLE *patchTable,\n-1914 int fvarChannel,\n-1915 _\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n-1916 void * deviceContext = NULL) {\n-1917\n-1918 if (instance) {\n-1919 return instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1920 srcBuffer, srcDesc,\n-1921 dstBuffer, dstDesc,\n-1922 duBuffer, duDesc,\n-1923 dvBuffer, dvDesc,\n-1924 duuBuffer, duuDesc,\n-1925 duvBuffer, duvDesc,\n-1926 dvvBuffer, dvvDesc,\n-1927 numPatchCoords, patchCoords,\n-1928 patchTable, fvarChannel);\n-1929 } else {\n-1930 // Create an instance on demand (slow)\n-1931 (void)deviceContext; // unused\n-1932 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n-1933 duDesc, dvDesc,\n-1934 duuDesc, duvDesc, dvvDesc);\n-1935 if (instance) {\n-1936 bool r = instance->_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1937 srcBuffer, srcDesc,\n-1938 dstBuffer, dstDesc,\n-1939 duBuffer, duDesc,\n-1940 dvBuffer, dvDesc,\n-1941 duuBuffer, duuDesc,\n-1942 duvBuffer, duvDesc,\n-1943 dvvBuffer, dvvDesc,\n-1944 numPatchCoords, patchCoords,\n-1945 patchTable, fvarChannel);\n-1946 delete instance;\n-1947 return r;\n-1948 }\n-1949 return false;\n-1950 }\n-1951 }\n-1952\n-2009 template \n-_\b2_\b0_\b1_\b1 bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-2012 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2013 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2014 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2015 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2016 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2017 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2018 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2019 int numPatchCoords,\n-2020 PATCHCOORD_BUFFER *patchCoords,\n-2021 PATCH_TABLE *patchTable,\n-2022 int fvarChannel = 0) const {\n-2023\n-2024 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindVBO(), srcDesc,\n-2025 dstBuffer->BindVBO(), dstDesc,\n-2026 duBuffer->BindVBO(), duDesc,\n-2027 dvBuffer->BindVBO(), dvDesc,\n-2028 duuBuffer->BindVBO(), duuDesc,\n-2029 duvBuffer->BindVBO(), duvDesc,\n-2030 dvvBuffer->BindVBO(), dvvDesc,\n-2031 numPatchCoords,\n-2032 patchCoords->BindVBO(),\n-2033 patchTable->GetFVarPatchArrays(fvarChannel),\n-2034 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-2035 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-2036 }\n-2037\n-2043\n-_\b2_\b0_\b4_\b6 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2047 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2048 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2049 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2050 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2051 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n-2052 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc = _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br());\n-2053\n-_\b2_\b0_\b5_\b5 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void *deviceContext);\n-2056\n-2057private:\n-2058 struct _StencilKernel {\n-2059 _StencilKernel();\n-2060 ~_StencilKernel();\n-2061 bool Compile(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2062 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2063 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2064 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2065 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2066 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2067 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2068 int workGroupSize);\n-2069 GLuint program;\n-2070 GLuint uniformStart;\n-2071 GLuint uniformEnd;\n-2072 GLuint uniformSrcOffset;\n-2073 GLuint uniformDstOffset;\n-2074 GLuint uniformDuDesc;\n-2075 GLuint uniformDvDesc;\n-2076 GLuint uniformDuuDesc;\n-2077 GLuint uniformDuvDesc;\n-2078 GLuint uniformDvvDesc;\n-2079 } _stencilKernel;\n-2080\n-2081 struct _PatchKernel {\n-2082 _PatchKernel();\n-2083 ~_PatchKernel();\n-2084 bool Compile(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-2085 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-2086 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-2087 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-2088 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-2089 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-2090 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-2091 int workGroupSize);\n-2092 GLuint program;\n-2093 GLuint uniformSrcOffset;\n-2094 GLuint uniformDstOffset;\n-2095 GLuint uniformPatchArray;\n-2096 GLuint uniformDuDesc;\n-2097 GLuint uniformDvDesc;\n-2098 GLuint uniformDuuDesc;\n-2099 GLuint uniformDuvDesc;\n-2100 GLuint uniformDvvDesc;\n-2101 } _patchKernel;\n-2102\n-2103 int _workGroupSize;\n-2104 GLuint _patchArraysSSBO;\n-2105};\n-2106\n-2107} // end namespace Osd\n-2108\n-2109} // end namespace OPENSUBDIV_VERSION\n-2110using namespace OPENSUBDIV_VERSION;\n-2111\n-2112} // end namespace OpenSubdiv\n-2113\n-2114\n-2115#endif // OPENSUBDIV3_OSD_GL_COMPUTE_EVALUATOR_H\n+103 ID3D11DeviceContext *deviceContext);\n+104\n+_\b1_\b0_\b5 static _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br * _\bC_\br_\be_\ba_\bt_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+106 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+107 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+108 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+109 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+110 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+111 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+112 ID3D11DeviceContext *deviceContext);\n+113\n+_\b1_\b1_\b5 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+116\n+_\b1_\b1_\b8 _\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br();\n+119\n+147 template \n+_\b1_\b4_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+149 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+150 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+151 STENCIL_TABLE const *stencilTable,\n+152 _\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance,\n+153 ID3D11DeviceContext * deviceContext) {\n+154 if (instance) {\n+155 return instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+156 dstBuffer, dstDesc,\n+157 stencilTable,\n+158 deviceContext);\n+159 } else {\n+160 // Create an instance on demand (slow)\n+161 (void)deviceContext; // unused\n+162 instance = _\bC_\br_\be_\ba_\bt_\be(srcDesc, dstDesc,\n+163 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+164 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(),\n+165 deviceContext);\n+166 if (instance) {\n+167 bool r = instance->_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer, srcDesc,\n+168 dstBuffer, dstDesc,\n+169 stencilTable,\n+170 deviceContext);\n+171 delete instance;\n+172 return r;\n+173 }\n+174 return false;\n+175 }\n+176 }\n+177\n+180 template \n+_\b1_\b8_\b1 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+182 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+183 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+184 STENCIL_TABLE const *stencilTable,\n+185 ID3D11DeviceContext *deviceContext) const {\n+186 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindD3D11UAV(deviceContext), srcDesc,\n+187 dstBuffer->BindD3D11UAV(deviceContext), dstDesc,\n+188 stencilTable->GetSizesSRV(),\n+189 stencilTable->GetOffsetsSRV(),\n+190 stencilTable->GetIndicesSRV(),\n+191 stencilTable->GetWeightsSRV(),\n+192 /* start = */ 0,\n+193 /* end = */ stencilTable->GetNumStencils(),\n+194 deviceContext);\n+195 }\n+196\n+_\b1_\b9_\b9 bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(ID3D11UnorderedAccessView *srcSRV,\n+200 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+201 ID3D11UnorderedAccessView *dstUAV,\n+202 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+203 ID3D11ShaderResourceView *sizesSRV,\n+204 ID3D11ShaderResourceView *offsetsSRV,\n+205 ID3D11ShaderResourceView *indicesSRV,\n+206 ID3D11ShaderResourceView *weightsSRV,\n+207 int start,\n+208 int end,\n+209 ID3D11DeviceContext *deviceContext) const;\n+210\n+_\b2_\b1_\b2 bool _\bC_\bo_\bm_\bp_\bi_\bl_\be(_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+213 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+214 ID3D11DeviceContext *deviceContext);\n+215\n+_\b2_\b1_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(ID3D11DeviceContext *deviceContext);\n+218\n+219private:\n+220 ID3D11ComputeShader * _computeShader;\n+221 ID3D11ClassLinkage * _classLinkage;\n+222 ID3D11ClassInstance * _singleBufferKernel;\n+223 ID3D11ClassInstance * _separateBufferKernel;\n+224 ID3D11Buffer * _uniformArgs; // uniform parameters for kernels\n+225\n+226 int _workGroupSize;\n+227};\n+228\n+229} // end namespace Osd\n+230\n+231} // end namespace OPENSUBDIV_VERSION\n+232using namespace OPENSUBDIV_VERSION;\n+233\n+234} // end namespace OpenSubdiv\n+235\n+236\n+237#endif // OPENSUBDIV3_OSD_D3D11_COMPUTE_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by_\bV_\be_\bc_\bt_\bo_\br\n-std::vector< PatchArray > PatchArrayVector\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n Stencil table class wrapping the template for compatibility.\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b2_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br_\b:_\b:_\bL_\bi_\bm_\bi_\bt_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n-Limit stencil table class wrapping the template for compatibility.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bs_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b._\bh_\b:_\b5_\b8_\b3\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n BufferDescriptor is a struct which describes buffer elements in interleaved\n data buffers....\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n-GL stencil table (Shader Storage buffer)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetDuvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n-GLStencilTableSSBO(Far::LimitStencilTable const *limitStencilTable)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetDuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\b~_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n-~GLStencilTableSSBO()\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+D3D11 stencil table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n+DEVICE_CONTEXT context)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetOffsetsSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bN_\bu_\bm_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n int GetNumStencils() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetIndicesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bO_\bf_\bf_\bs_\be_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetOffsetsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO\n-GLStencilTableSSBO(Far::StencilTable const *stencilTable)\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetDvvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetSizesBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLStencilTableSSBO * Create(Far::LimitStencilTable const\n-*limitStencilTable, void *deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bu_\bu_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetDuuWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bG_\be_\bt_\bD_\bv_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bB_\bu_\bf_\bf_\be_\br\n-GLuint GetDvWeightsBuffer() const\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\bS_\bS_\bB_\bO_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLStencilTableSSBO * Create(Far::StencilTable const *stencilTable, void\n-*deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b1_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, GLComputeEvaluator\n-const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b7_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, STENCIL_TABLE const *stencilTable) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b0_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void\n-*deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b7_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n-bool Instantiatable\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n-dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n-const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n-duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor\n-const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, int\n-numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays,\n-GLuint patchIndexBuffer, GLuint patchParamsBuffer) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\b~_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-~GLComputeEvaluator()\n-Destructor. note that the GL context must be made current.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable,\n-GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b3_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n-dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n-const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n-duuBuffer, BufferDescriptor const &duuDesc, GLuint duvBuffer, BufferDescriptor\n-const &duvDesc, GLuint dvvBuffer, BufferDescriptor const &dvvDesc, GLuint\n-sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer,\n-GLuint duWeightsBuffer, GLuint dvWeightsBuffer, GLuint duuWeightsBuffer, GLuint\n-duvWeightsBuffer, GLuint dvvWeightsBuffer, int start, int end) const\n-Dispatch the GLSL compute kernel on GPU asynchronously returns false if the\n-kernel hasn't been compil...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bI_\bn_\bd_\bi_\bc_\be_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetIndicesSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\b~_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+~D3D11StencilTable()\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be\n+D3D11StencilTable(Far::StencilTable const *stencilTable, ID3D11DeviceContext\n+*deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11StencilTable * Create(Far::StencilTable const *stencilTable,\n+ID3D11DeviceContext *deviceContext)\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bS_\bi_\bz_\be_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetSizesSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bT_\ba_\bb_\bl_\be_\b:_\b:_\bG_\be_\bt_\bW_\be_\bi_\bg_\bh_\bt_\bs_\bS_\bR_\bV\n+ID3D11ShaderResourceView * GetWeightsSRV() const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n+BufferDescriptor const &dvDesc, ID3D11DeviceContext *deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, GLComputeEvaluator const *instance, void\n-*deviceContext=NULL)\n-Generic static stencil function. This function has a same signature as other\n+const *stencilTable, D3D11ComputeEvaluator const *instance, ID3D11DeviceContext\n+*deviceContext)\n+Generic static compute function. This function has a same signature as other\n device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator\n-const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b9_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b5_\b4_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b4_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-GLComputeEvaluator()\n-Constructor.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable) const\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b9_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator\n-const *instance, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b9_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n-*stencilTable) const\n-Generic stencil function.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-bool EvalPatches(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n-dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n-const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, int\n-numPatchCoords, GLuint patchCoordsBuffer, const PatchArrayVector &patchArrays,\n-GLuint patchIndexBuffer, GLuint patchParamsBuffer) const\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel=0)\n-const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b2_\b0_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b4_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n+static D3D11ComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, void *deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-bool EvalStencils(GLuint srcBuffer, BufferDescriptor const &srcDesc, GLuint\n-dstBuffer, BufferDescriptor const &dstDesc, GLuint duBuffer, BufferDescriptor\n-const &duDesc, GLuint dvBuffer, BufferDescriptor const &dvDesc, GLuint\n-sizesBuffer, GLuint offsetsBuffer, GLuint indicesBuffer, GLuint weightsBuffer,\n-GLuint duWeightsBuffer, GLuint dvWeightsBuffer, int start, int end) const\n-Dispatch the GLSL compute kernel on GPU asynchronously returns false if the\n-kernel hasn't been compil...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-GLComputeEvaluator const *instance, void *deviceContext=NULL)\n-Generic static stencil function. This function has a same signature as other\n-device kernels have so t...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b2_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(void *deviceContext)\n+BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n+BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc,\n+ID3D11DeviceContext *deviceContext)\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bI_\bn_\bs_\bt_\ba_\bn_\bt_\bi_\ba_\bt_\ba_\bb_\bl_\be\n+bool Instantiatable\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(ID3D11DeviceContext *deviceContext)\n Wait the dispatched kernel finishes.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const\n+*stencilTable, ID3D11DeviceContext *deviceContext) const\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\bo_\bm_\bp_\bi_\bl_\be\n bool Compile(BufferDescriptor const &srcDesc, BufferDescriptor const &dstDesc,\n-BufferDescriptor const &duDesc=BufferDescriptor(), BufferDescriptor const\n-&dvDesc=BufferDescriptor(), BufferDescriptor const &duuDesc=BufferDescriptor(),\n-BufferDescriptor const &duvDesc=BufferDescriptor(), BufferDescriptor const\n-&dvvDesc=BufferDescriptor())\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b3_\b5_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bC_\br_\be_\ba_\bt_\be\n-static GLComputeEvaluator * Create(BufferDescriptor const &srcDesc,\n-BufferDescriptor const &dstDesc, BufferDescriptor const &duDesc,\n-BufferDescriptor const &dvDesc, BufferDescriptor const &duuDesc,\n-BufferDescriptor const &duvDesc, BufferDescriptor const &dvvDesc, void\n-*deviceContext=NULL)\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel=0) const\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b6_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bG_\bL_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, GLComputeEvaluator const *instance, void\n-*deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b7_\b0\n+ID3D11DeviceContext *deviceContext)\n+Configure DX kernel. Returns false if it fails to compile the kernel.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n+_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D3D11ComputeEvaluator()\n+Constructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:\n+_\b~_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+~D3D11ComputeEvaluator()\n+Destructor.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bD_\b3_\bD_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+bool EvalStencils(ID3D11UnorderedAccessView *srcSRV, BufferDescriptor const\n+&srcDesc, ID3D11UnorderedAccessView *dstUAV, BufferDescriptor const &dstDesc,\n+ID3D11ShaderResourceView *sizesSRV, ID3D11ShaderResourceView *offsetsSRV,\n+ID3D11ShaderResourceView *indicesSRV, ID3D11ShaderResourceView *weightsSRV, int\n+start, int end, ID3D11DeviceContext *deviceContext) const\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bg_\bl_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bd_\b3_\bd_\b1_\b1_\bC_\bo_\bm_\bp_\bu_\bt_\be_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00851.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00851.html", "unified_diff": "@@ -96,15 +96,15 @@\n Namespaces \n
glXFBEvaluator.h File Reference
\n \n
\n
#include "../version.h"
\n #include "../osd/opengl.h"
\n #include "../osd/types.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00851_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00851_source.html", "unified_diff": "@@ -1247,17 +1247,17 @@\n
2189
\n
2190} // end namespace OpenSubdiv
\n
2191
\n
2192
\n
2193#endif // OPENSUBDIV3_OSD_GL_XFB_EVALUATOR_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n \n \n
static GLStencilTableTBO * Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)
\n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00854.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00854.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
glslPatchShaderSource.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../far/patchDescriptor.h"
\n+#include "../far/patchDescriptor.h"
\n #include <string>
\n
\n

Go to the source code of this file.

\n

\n Classes

class  GLStencilTableTBO
 GL TextureBuffer stencil table. More...
\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00854_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00854_source.html", "unified_diff": "@@ -164,15 +164,15 @@\n
76} // end namespace OPENSUBDIV_VERSION
\n
77using namespace OPENSUBDIV_VERSION;
\n
78
\n
79} // end namespace OpenSubdiv
\n
80
\n
81#endif // OPENSUBDIV3_OSD_GLSL_PATCH_SHADER_SOURCE
\n \n-\n+\n
Provides shader source which can be used by client code.
\n
static std::string GetVertexShaderSource(Far::PatchDescriptor::Type type)
\n
static std::string GetPatchDrawingShaderSource()
Returns shader source which can be used while drawing piecewise parametric patches resulting from sub...
\n
static std::string GetTessEvalShaderSource(Far::PatchDescriptor::Type type)
\n
static std::string GetPatchBasisShaderSource()
Returns shader source which can be used to evaluate position and first and second derivatives on piec...
\n \n
static std::string GetTessControlShaderSource(Far::PatchDescriptor::Type type)
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00863_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00863_source.html", "unified_diff": "@@ -267,15 +267,15 @@\n
152using namespace OPENSUBDIV_VERSION;
\n
153
\n
154} // end namespace OpenSubdiv
\n
155
\n
156#endif // OPENSUBDIV3_OSD_GL_PATCH_TABLE_H
\n \n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n \n \n
PatchArrayVector const & GetPatchArrays() const
Returns the patch arrays for vertex index buffer data.
\n
GLuint GetFVarPatchIndexBuffer(int fvarChannel=0) const
Returns the GL index buffer containing face-varying control vertices.
\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00866.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00866.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
glLegacyGregoryPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n+#include "../far/patchTable.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/opengl.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  GLSLPatchShaderSource
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00866_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00866_source.html", "unified_diff": "@@ -192,17 +192,17 @@\n
81} // end namespace OPENSUBDIV_VERSION
\n
82using namespace OPENSUBDIV_VERSION;
\n
83
\n
84} // end namespace OpenSubdiv
\n
85
\n
86#endif // OPENSUBDIV3_OSD_GL_LEGACY_GREGORY_PATCH_TABLE_H
\n \n-\n-\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+\n+\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00872.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00872.html", "unified_diff": "@@ -94,16 +94,16 @@\n \n
tbbKernel.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../far/patchDescriptor.h"
\n-#include "../far/patchParam.h"
\n+#include "../far/patchDescriptor.h"
\n+#include "../far/patchParam.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00872_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00872_source.html", "unified_diff": "@@ -213,15 +213,15 @@\n
112
\n
113} // end namespace OpenSubdiv
\n
114
\n
115#endif // OPENSUBDIV3_OSD_TBB_KERNEL_H
\n \n
void TbbEvalPatches(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *dstDu, BufferDescriptor const &dstDuDesc, float *dstDv, BufferDescriptor const &dstDvDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrayBuffer, const int *patchIndexBuffer, const PatchParam *patchParamBuffer)
\n
void TbbEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n
Coordinates set on a patch table.
Definition types.h:42
\n \n \n \n \n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00875.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00875.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
tbbEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../osd/bufferDescriptor.h"
\n #include "../osd/types.h"
\n #include <cstddef>
\n
\n

Go to the source code of this file.

\n

\n Namespaces

namespace  OpenSubdiv
 
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00875_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00875_source.html", "unified_diff": "@@ -604,15 +604,15 @@\n
1240using namespace OPENSUBDIV_VERSION;
\n
1241
\n
1242} // end namespace OpenSubdiv
\n
1243
\n
1244
\n
1245#endif // OPENSUBDIV3_OSD_TBB_EVALUATOR_H
\n \n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n \n
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, TbbEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function. This function has a same signature as other device kernels hav...
\n
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, TbbEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const TbbEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, TbbEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, TbbEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00878_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00878_source.html", "unified_diff": "@@ -182,15 +182,15 @@\n
81using namespace OPENSUBDIV_VERSION;
\n
82
\n
83} // end namespace OpenSubdiv
\n
84
\n
85#endif // OPENSUBDIV3_OSD_OMP_KERNEL_H
\n \n
void OmpEvalStencils(float const *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int const *sizes, int const *offsets, int const *indices, float const *weights, int start, int end)
\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n \n \n \n
\n
    \n
  • opensubdiv
  • osd
  • ompKernel.h
  • \n
  • Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by \"doxygen\"/ 1.9.8
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00881.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00881.html", "unified_diff": "@@ -94,15 +94,15 @@\n \n
    ompEvaluator.h File Reference
    \n
\n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../osd/bufferDescriptor.h"
\n #include "../osd/types.h"
\n #include <cstddef>
\n
\n

Go to the source code of this file.

\n

\n Classes

\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00881_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00881_source.html", "unified_diff": "@@ -604,15 +604,15 @@\n
1236using namespace OPENSUBDIV_VERSION;
\n
1237
\n
1238} // end namespace OpenSubdiv
\n
1239
\n
1240
\n
1241#endif // OPENSUBDIV3_OSD_OMP_EVALUATOR_H
\n \n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n \n
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const OmpEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, OmpEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00887.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00887.html", "unified_diff": "@@ -101,19 +101,19 @@\n \n
\n
#include "../version.h"
\n #include <bitset>
\n #include <cassert>
\n #include <cstring>
\n #include <vector>
\n-#include "../far/topologyRefiner.h"
\n-#include "../far/patchTableFactory.h"
\n-#include "../far/stencilTable.h"
\n-#include "../far/stencilTableFactory.h"
\n-#include "../osd/bufferDescriptor.h"
\n+#include "../far/topologyRefiner.h"
\n+#include "../far/patchTableFactory.h"
\n+#include "../far/stencilTable.h"
\n+#include "../far/stencilTableFactory.h"
\n+#include "../osd/bufferDescriptor.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00887_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00887_source.html", "unified_diff": "@@ -895,48 +895,48 @@\n \n \n \n
Far::StencilTable const * convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, void >(Far::StencilTable const *table, void *)
Definition mesh.h:149
\n
Far::LimitStencilTable const * convertToCompatibleStencilTable< Far::LimitStencilTable, Far::LimitStencilTable, void >(Far::LimitStencilTable const *table, void *)
Definition mesh.h:159
\n
std::bitset< NUM_MESH_BITS > MeshBitset
Definition mesh.h:63
\n
Far::StencilTable const * convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, ID3D11DeviceContext >(Far::StencilTable const *table, ID3D11DeviceContext *)
Definition mesh.h:169
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n-
int GetMaxValence() const
Returns max vertex valence.
Definition patchTable.h:92
\n-
StencilTable const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
Definition patchTable.h:778
\n-
StencilTable const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
Definition patchTable.h:783
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
int GetMaxValence() const
Returns max vertex valence.
Definition patchTable.h:92
\n+
StencilTable const * GetLocalPointStencilTable() const
Returns the stencil table to compute local point vertex values.
Definition patchTable.h:778
\n+
StencilTable const * GetLocalPointVaryingStencilTable() const
Returns the stencil table to compute local point varying values.
Definition patchTable.h:783
\n
static PatchTable * Create(TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
Instantiates a PatchTable from a client-provided TopologyRefiner.
\n-\n-
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n-
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n-
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n-
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n-\n-
int GetNumControlVertices() const
Returns the number of control vertices indexed in the table.
\n-
int GetNumStencils() const
Returns the number of stencils in the table.
\n-
Stencil table class wrapping the template for compatibility.
\n-
Limit stencil table class wrapping the template for compatibility.
\n-
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n-
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n-
int GetNumVertices() const
Return the number of vertices in this level.
\n-
Stores topology data for a specified set of refinement options.
\n-
bool IsUniform() const
Returns true if uniform refinement has been applied.
\n-
int GetNumFVarChannels() const
Returns the number of face-varying channels in the tables.
\n+\n+
@ ENDCAP_LEGACY_GREGORY
legacy option for 2.x style Gregory patches (Catmark only)
\n+
@ ENDCAP_GREGORY_BASIS
use Gregory patches (highest quality, recommended default)
\n+
@ ENDCAP_BILINEAR_BASIS
use linear patches (simple quads or tris)
\n+
@ ENDCAP_BSPLINE_BASIS
use BSpline-like patches (same patch type as regular)
\n+\n+
int GetNumControlVertices() const
Returns the number of control vertices indexed in the table.
\n+
int GetNumStencils() const
Returns the number of stencils in the table.
\n+
Stencil table class wrapping the template for compatibility.
\n+
Limit stencil table class wrapping the template for compatibility.
\n+
static StencilTable const * Create(TopologyRefiner const &refiner, Options options=Options())
\n+
static StencilTable const * AppendLocalPointStencilTable(TopologyRefiner const &refiner, StencilTable const *baseStencilTable, StencilTable const *localPointStencilTable, bool factorize=true)
\n+
int GetNumVertices() const
Return the number of vertices in this level.
\n+
Stores topology data for a specified set of refinement options.
\n+
bool IsUniform() const
Returns true if uniform refinement has been applied.
\n+
int GetNumFVarChannels() const
Returns the number of face-varying channels in the tables.
\n
void RefineUniform(UniformOptions options)
Refine the topology uniformly.
\n-
TopologyLevel const & GetLevel(int level) const
Returns a handle to access data specific to a particular level.
\n+
TopologyLevel const & GetLevel(int level) const
Returns a handle to access data specific to a particular level.
\n
void RefineAdaptive(AdaptiveOptions options, ConstIndexArray selectedFaces=ConstIndexArray())
Feature Adaptive topology refinement.
\n-\n-\n-\n-\n-\n-\n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-\n-\n+\n+\n+\n+\n+\n+\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+\n+\n \n
virtual Far::PatchTable const * GetFarPatchTable() const =0
\n
static void refineMesh(Far::TopologyRefiner &refiner, int level, MeshBitset bits)
Definition mesh.h:117
\n \n \n
virtual void UpdateVaryingBuffer(float const *varyingData, int startVertex, int numVerts)=0
\n
static void refineMesh(Far::TopologyRefiner &refiner, int level, bool adaptive, bool singleCreasePatch)
Definition mesh.h:101
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00893.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00893.html", "unified_diff": "@@ -95,15 +95,15 @@\n Classes |\n Namespaces\n
cpuPatchTable.h File Reference
\n \n
\n
#include "../version.h"
\n #include <vector>
\n-#include "../far/patchDescriptor.h"
\n+#include "../far/patchDescriptor.h"
\n #include "../osd/nonCopyable.h"
\n #include "../osd/types.h"
\n
\n

Go to the source code of this file.

\n

\n Classes

class  MeshInterface< PATCH_TABLE >
 
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00893_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00893_source.html", "unified_diff": "@@ -264,15 +264,15 @@\n
142
\n
143} // end namespace OpenSubdiv
\n
144
\n
145#endif // OPENSUBDIV3_OSD_CPU_PATCH_TABLE_H
\n \n
std::vector< PatchParam > PatchParamVector
Definition types.h:133
\n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-
Container for arrays of parametric patches.
Definition patchTable.h:55
\n+
Container for arrays of parametric patches.
Definition patchTable.h:55
\n \n
const PatchArray * GetFVarPatchArrayBuffer(int fvarChannel=0) const
\n \n \n
size_t GetFVarPatchParamSize(int fvarChannel=0) const
\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00896.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00896.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuEvaluator.h File Reference\n+OpenSubdiv: opensubdiv/osd/bufferDescriptor.h File Reference\n \n \n \n \n \n \n \n@@ -90,27 +90,26 @@\n \n \n \n
\n \n-
cpuEvaluator.h File Reference
\n+
bufferDescriptor.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../osd/bufferDescriptor.h"
\n-#include "../osd/types.h"
\n-#include <cstddef>
\n+#include <string.h>
\n
\n

Go to the source code of this file.

\n

\n Classes

\n \n-\n+\n+\n \n

\n Classes

class  CpuEvaluator
struct  BufferDescriptor
 BufferDescriptor is a struct which describes buffer elements in interleaved data buffers. Almost all Osd Evaluator APIs take BufferDescriptors along with device-specific buffer objects. More...
 
\n \n \n \n \n@@ -119,13 +118,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,25 +1,26 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-cpuEvaluator.h File Reference\n+bufferDescriptor.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n-#include \n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-class \u00a0 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+struct \u00a0 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+ _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br is a struct which describes buffer elements in\n+\u00a0 interleaved data buffers. Almost all _\bO_\bs_\bd Evaluator APIs take\n+ BufferDescriptors along with device-specific buffer objects. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00896.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00896.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00896 = [\n- [\"CpuEvaluator\", \"a01165.html\", null]\n+ [\"BufferDescriptor\", \"a01141.html\", \"a01141\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00896_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00896_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/cpuEvaluator.h Source File\n+OpenSubdiv: opensubdiv/osd/bufferDescriptor.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
cpuEvaluator.h
\n+
bufferDescriptor.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,529 +119,112 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n-
26#define OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n+
26#define OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n
27
\n
28#include "../version.h"
\n-
29#include "../osd/bufferDescriptor.h"
\n-
30#include "../osd/types.h"
\n-
31
\n-
32#include <cstddef>
\n+
29#include <string.h>
\n+
30
\n+
31namespace OpenSubdiv {
\n+
32namespace OPENSUBDIV_VERSION {
\n
33
\n-
34namespace OpenSubdiv {
\n-
35namespace OPENSUBDIV_VERSION {
\n-
36
\n-
37namespace Osd {
\n-
38
\n-
\n-\n-
40public:
\n+
\n+
34namespace Osd {
\n+
35
\n
46
\n-
71 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
72 static bool EvalStencils(
\n-
73 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
74 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
75 STENCIL_TABLE const *stencilTable,
\n-
76 const CpuEvaluator *instance = NULL,
\n-
77 void * deviceContext = NULL) {
\n-
78
\n-
79 (void)instance; // unused
\n-
80 (void)deviceContext; // unused
\n-
81
\n-
82 if (stencilTable->GetNumStencils() == 0)
\n-
83 return false;
\n+
47// example:
\n+
48// n
\n+
49// -----+----------------------------------------+-------------------------
\n+
50// | vertex 0 |
\n+
51// -----+----------------------------------------+-------------------------
\n+
52// | X Y Z R G B A Xu Yu Zu Xv Yv Zv |
\n+
53// -----+----------------------------------------+-------------------------
\n+
54// <------------- stride = 13 -------------->
\n+
55//
\n+
56// - XYZ (offset = n+0, length = 3, stride = 13)
\n+
57// - RGBA (offset = n+3, length = 4, stride = 13)
\n+
58// - uTangent (offset = n+7, length = 3, stride = 13)
\n+
59// - vTangent (offset = n+10, length = 3, stride = 13)
\n+
60//
\n+
\n+\n+
62
\n+\n+
65
\n+
67 BufferDescriptor(int o, int l, int s) : offset(o), length(l), stride(s) { }
\n+
68
\n+
\n+
70 int GetLocalOffset() const {
\n+
71 return stride > 0 ? offset % stride : 0;
\n+
72 }
\n+
\n+
73
\n+
\n+
75 bool IsValid() const {
\n+
76 return ((length > 0) &&
\n+\n+
78 }
\n+
\n+
79
\n+
\n+
81 void Reset() {
\n+
82 offset = length = stride = 0;
\n+
83 }
\n+
\n
84
\n-
85 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
86 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
87 &stencilTable->GetSizes()[0],
\n-
88 &stencilTable->GetOffsets()[0],
\n-
89 &stencilTable->GetControlIndices()[0],
\n-
90 &stencilTable->GetWeights()[0],
\n-
91 /*start = */ 0,
\n-
92 /*end = */ stencilTable->GetNumStencils());
\n-
93 }
\n-
\n-
94
\n-
121 static bool EvalStencils(
\n-
122 const float *src, BufferDescriptor const &srcDesc,
\n-
123 float *dst, BufferDescriptor const &dstDesc,
\n-
124 const int * sizes,
\n-
125 const int * offsets,
\n-
126 const int * indices,
\n-
127 const float * weights,
\n-
128 int start, int end);
\n-
129
\n-
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
168 static bool EvalStencils(
\n-
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
171 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
172 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
173 STENCIL_TABLE const *stencilTable,
\n-
174 const CpuEvaluator *instance = NULL,
\n-
175 void * deviceContext = NULL) {
\n-
176
\n-
177 (void)instance; // unused
\n-
178 (void)deviceContext; // unused
\n-
179
\n-
180 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
181 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
182 duBuffer->BindCpuBuffer(), duDesc,
\n-
183 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
184 &stencilTable->GetSizes()[0],
\n-
185 &stencilTable->GetOffsets()[0],
\n-
186 &stencilTable->GetControlIndices()[0],
\n-
187 &stencilTable->GetWeights()[0],
\n-
188 &stencilTable->GetDuWeights()[0],
\n-
189 &stencilTable->GetDvWeights()[0],
\n-
190 /*start = */ 0,
\n-
191 /*end = */ stencilTable->GetNumStencils());
\n-
192 }
\n-
\n-
193
\n-
234 static bool EvalStencils(
\n-
235 const float *src, BufferDescriptor const &srcDesc,
\n-
236 float *dst, BufferDescriptor const &dstDesc,
\n-
237 float *du, BufferDescriptor const &duDesc,
\n-
238 float *dv, BufferDescriptor const &dvDesc,
\n-
239 const int * sizes,
\n-
240 const int * offsets,
\n-
241 const int * indices,
\n-
242 const float * weights,
\n-
243 const float * duWeights,
\n-
244 const float * dvWeights,
\n-
245 int start, int end);
\n-
246
\n-
302 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n-
\n-
303 static bool EvalStencils(
\n-
304 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
305 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
306 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
307 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
308 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
309 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
310 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
311 STENCIL_TABLE const *stencilTable,
\n-
312 const CpuEvaluator *instance = NULL,
\n-
313 void * deviceContext = NULL) {
\n-
314
\n-
315 (void)instance; // unused
\n-
316 (void)deviceContext; // unused
\n-
317
\n-
318 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
319 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
320 duBuffer->BindCpuBuffer(), duDesc,
\n-
321 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
322 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
323 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
324 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
325 &stencilTable->GetSizes()[0],
\n-
326 &stencilTable->GetOffsets()[0],
\n-
327 &stencilTable->GetControlIndices()[0],
\n-
328 &stencilTable->GetWeights()[0],
\n-
329 &stencilTable->GetDuWeights()[0],
\n-
330 &stencilTable->GetDvWeights()[0],
\n-
331 &stencilTable->GetDuuWeights()[0],
\n-
332 &stencilTable->GetDuvWeights()[0],
\n-
333 &stencilTable->GetDvvWeights()[0],
\n-
334 /*start = */ 0,
\n-
335 /*end = */ stencilTable->GetNumStencils());
\n-
336 }
\n-
\n-
337
\n-
399 static bool EvalStencils(
\n-
400 const float *src, BufferDescriptor const &srcDesc,
\n-
401 float *dst, BufferDescriptor const &dstDesc,
\n-
402 float *du, BufferDescriptor const &duDesc,
\n-
403 float *dv, BufferDescriptor const &dvDesc,
\n-
404 float *duu, BufferDescriptor const &duuDesc,
\n-
405 float *duv, BufferDescriptor const &duvDesc,
\n-
406 float *dvv, BufferDescriptor const &dvvDesc,
\n-
407 const int * sizes,
\n-
408 const int * offsets,
\n-
409 const int * indices,
\n-
410 const float * weights,
\n-
411 const float * duWeights,
\n-
412 const float * dvWeights,
\n-
413 const float * duuWeights,
\n-
414 const float * duvWeights,
\n-
415 const float * dvvWeights,
\n-
416 int start, int end);
\n-
417
\n-
423
\n-
452 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
453 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
454 static bool EvalPatches(
\n-
455 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
456 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
457 int numPatchCoords,
\n-
458 PATCHCOORD_BUFFER *patchCoords,
\n-
459 PATCH_TABLE *patchTable,
\n-
460 CpuEvaluator const *instance = NULL,
\n-
461 void * deviceContext = NULL) {
\n-
462
\n-
463 (void)instance; // unused
\n-
464 (void)deviceContext; // unused
\n-
465
\n-
466 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
467 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
468 numPatchCoords,
\n-
469 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
470 patchTable->GetPatchArrayBuffer(),
\n-
471 patchTable->GetPatchIndexBuffer(),
\n-
472 patchTable->GetPatchParamBuffer());
\n-
473 }
\n-
\n-
474
\n-
515 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
516 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
517 static bool EvalPatches(
\n-
518 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
519 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
520 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
521 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
522 int numPatchCoords,
\n-
523 PATCHCOORD_BUFFER *patchCoords,
\n-
524 PATCH_TABLE *patchTable,
\n-
525 CpuEvaluator const *instance = NULL,
\n-
526 void * deviceContext = NULL) {
\n-
527
\n-
528 (void)instance; // unused
\n-
529 (void)deviceContext; // unused
\n-
530
\n-
531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n-
532 // ideally all buffer classes should have templated by datatype
\n-
533 // so that downcast isn't needed there.
\n-
534 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n-
535 //
\n-
536 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
537 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
538 duBuffer->BindCpuBuffer(), duDesc,
\n-
539 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
540 numPatchCoords,
\n-
541 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
542 patchTable->GetPatchArrayBuffer(),
\n-
543 patchTable->GetPatchIndexBuffer(),
\n-
544 patchTable->GetPatchParamBuffer());
\n-
545 }
\n-
\n-
546
\n-
605 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
606 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-
607 static bool EvalPatches(
\n-
608 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
609 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
610 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
611 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
612 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
613 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
614 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
615 int numPatchCoords,
\n-
616 PATCHCOORD_BUFFER *patchCoords,
\n-
617 PATCH_TABLE *patchTable,
\n-
618 CpuEvaluator const *instance = NULL,
\n-
619 void * deviceContext = NULL) {
\n-
620
\n-
621 (void)instance; // unused
\n-
622 (void)deviceContext; // unused
\n-
623
\n-
624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n-
625 // ideally all buffer classes should have templated by datatype
\n-
626 // so that downcast isn't needed there.
\n-
627 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n-
628 //
\n-
629 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
630 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
631 duBuffer->BindCpuBuffer(), duDesc,
\n-
632 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
633 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
634 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
635 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
636 numPatchCoords,
\n-
637 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
638 patchTable->GetPatchArrayBuffer(),
\n-
639 patchTable->GetPatchIndexBuffer(),
\n-
640 patchTable->GetPatchParamBuffer());
\n-
641 }
\n-
\n-
642
\n-
670 static bool EvalPatches(
\n-
671 const float *src, BufferDescriptor const &srcDesc,
\n-
672 float *dst, BufferDescriptor const &dstDesc,
\n-
673 int numPatchCoords,
\n-
674 const PatchCoord *patchCoords,
\n-
675 const PatchArray *patchArrays,
\n-
676 const int *patchIndexBuffer,
\n-
677 const PatchParam *patchParamBuffer);
\n-
678
\n-
716 static bool EvalPatches(
\n-
717 const float *src, BufferDescriptor const &srcDesc,
\n-
718 float *dst, BufferDescriptor const &dstDesc,
\n-
719 float *du, BufferDescriptor const &duDesc,
\n-
720 float *dv, BufferDescriptor const &dvDesc,
\n-
721 int numPatchCoords,
\n-
722 PatchCoord const *patchCoords,
\n-
723 PatchArray const *patchArrays,
\n-
724 const int *patchIndexBuffer,
\n-
725 PatchParam const *patchParamBuffer);
\n-
726
\n-
779 static bool EvalPatches(
\n-
780 const float *src, BufferDescriptor const &srcDesc,
\n-
781 float *dst, BufferDescriptor const &dstDesc,
\n-
782 float *du, BufferDescriptor const &duDesc,
\n-
783 float *dv, BufferDescriptor const &dvDesc,
\n-
784 float *duu, BufferDescriptor const &duuDesc,
\n-
785 float *duv, BufferDescriptor const &duvDesc,
\n-
786 float *dvv, BufferDescriptor const &dvvDesc,
\n-
787 int numPatchCoords,
\n-
788 PatchCoord const *patchCoords,
\n-
789 PatchArray const *patchArrays,
\n-
790 const int *patchIndexBuffer,
\n-
791 PatchParam const *patchParamBuffer);
\n-
792
\n-
821 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
822 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
824 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
825 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
826 int numPatchCoords,
\n-
827 PATCHCOORD_BUFFER *patchCoords,
\n-
828 PATCH_TABLE *patchTable,
\n-
829 CpuEvaluator const *instance = NULL,
\n-
830 void * deviceContext = NULL) {
\n-
831
\n-
832 (void)instance; // unused
\n-
833 (void)deviceContext; // unused
\n-
834
\n-
835 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
836 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
837 numPatchCoords,
\n-
838 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
839 patchTable->GetVaryingPatchArrayBuffer(),
\n-
840 patchTable->GetVaryingPatchIndexBuffer(),
\n-
841 patchTable->GetPatchParamBuffer());
\n-
842 }
\n-
\n-
843
\n-
884 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
885 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
887 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
888 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
889 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
890 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
891 int numPatchCoords,
\n-
892 PATCHCOORD_BUFFER *patchCoords,
\n-
893 PATCH_TABLE *patchTable,
\n-
894 CpuEvaluator const *instance = NULL,
\n-
895 void * deviceContext = NULL) {
\n-
896
\n-
897 (void)instance; // unused
\n-
898 (void)deviceContext; // unused
\n-
899
\n-
900 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
901 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
902 duBuffer->BindCpuBuffer(), duDesc,
\n-
903 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
904 numPatchCoords,
\n-
905 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
906 patchTable->GetVaryingPatchArrayBuffer(),
\n-
907 patchTable->GetVaryingPatchIndexBuffer(),
\n-
908 patchTable->GetPatchParamBuffer());
\n-
909 }
\n-
\n-
910
\n-
969 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
970 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
972 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
973 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
974 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
975 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
976 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
977 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
978 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
979 int numPatchCoords,
\n-
980 PATCHCOORD_BUFFER *patchCoords,
\n-
981 PATCH_TABLE *patchTable,
\n-
982 CpuEvaluator const *instance = NULL,
\n-
983 void * deviceContext = NULL) {
\n-
984
\n-
985 (void)instance; // unused
\n-
986 (void)deviceContext; // unused
\n-
987
\n-
988 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
989 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
990 duBuffer->BindCpuBuffer(), duDesc,
\n-
991 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
992 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
993 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
994 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
995 numPatchCoords,
\n-
996 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
997 patchTable->GetVaryingPatchArrayBuffer(),
\n-
998 patchTable->GetVaryingPatchIndexBuffer(),
\n-
999 patchTable->GetPatchParamBuffer());
\n-
1000 }
\n-
\n-
1001
\n-
1032 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1033 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1035 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1036 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1037 int numPatchCoords,
\n-
1038 PATCHCOORD_BUFFER *patchCoords,
\n-
1039 PATCH_TABLE *patchTable,
\n-
1040 int fvarChannel,
\n-
1041 CpuEvaluator const *instance = NULL,
\n-
1042 void * deviceContext = NULL) {
\n-
1043
\n-
1044 (void)instance; // unused
\n-
1045 (void)deviceContext; // unused
\n-
1046
\n-
1047 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1048 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1049 numPatchCoords,
\n-
1050 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1054 }
\n-
\n-
1055
\n-
1098 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1099 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1101 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1102 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1103 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1104 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1105 int numPatchCoords,
\n-
1106 PATCHCOORD_BUFFER *patchCoords,
\n-
1107 PATCH_TABLE *patchTable,
\n-
1108 int fvarChannel,
\n-
1109 CpuEvaluator const *instance = NULL,
\n-
1110 void * deviceContext = NULL) {
\n-
1111
\n-
1112 (void)instance; // unused
\n-
1113 (void)deviceContext; // unused
\n-
1114
\n-
1115 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1116 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1117 duBuffer->BindCpuBuffer(), duDesc,
\n-
1118 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
1119 numPatchCoords,
\n-
1120 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1124 }
\n-
\n-
1125
\n-
1186 template <typename SRC_BUFFER, typename DST_BUFFER,
\n-
1187 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n-
\n-\n-
1189 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n-
1190 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n-
1191 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n-
1192 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n-
1193 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n-
1194 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n-
1195 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n-
1196 int numPatchCoords,
\n-
1197 PATCHCOORD_BUFFER *patchCoords,
\n-
1198 PATCH_TABLE *patchTable,
\n-
1199 int fvarChannel,
\n-
1200 CpuEvaluator const *instance = NULL,
\n-
1201 void * deviceContext = NULL) {
\n-
1202
\n-
1203 (void)instance; // unused
\n-
1204 (void)deviceContext; // unused
\n-
1205
\n-
1206 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n-
1207 dstBuffer->BindCpuBuffer(), dstDesc,
\n-
1208 duBuffer->BindCpuBuffer(), duDesc,
\n-
1209 dvBuffer->BindCpuBuffer(), dvDesc,
\n-
1210 duuBuffer->BindCpuBuffer(), duuDesc,
\n-
1211 duvBuffer->BindCpuBuffer(), duvDesc,
\n-
1212 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n-
1213 numPatchCoords,
\n-
1214 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n-
1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n-
1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n-
1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n-
1218 }
\n-
\n-
1219
\n-
1225
\n-
\n-
1227 static void Synchronize(void * /*deviceContext = NULL*/) {
\n-
1228 // nothing.
\n-
1229 }
\n-
\n-
1230};
\n-
\n-
1231
\n-
1232
\n-
1233} // end namespace Osd
\n-
1234
\n-
1235} // end namespace OPENSUBDIV_VERSION
\n-
1236using namespace OPENSUBDIV_VERSION;
\n-
1237
\n-
1238} // end namespace OpenSubdiv
\n-
1239
\n-
1240
\n-
1241#endif // OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n+
\n+
86 bool operator == (BufferDescriptor const &other) const {
\n+
87 return (offset == other.offset &&
\n+
88 length == other.length &&
\n+
89 stride == other.stride);
\n+
90 }
\n+
\n+
91
\n+
\n+
93 bool operator != (BufferDescriptor const &other) const {
\n+
94 return !(this->operator==(other));
\n+
95 }
\n+
\n+
96
\n+
98 int offset;
\n+\n+\n+
103};
\n+
\n+
104
\n+
105} // end namespace Osd
\n+
\n+
106
\n+
107} // end namespace OPENSUBDIV_VERSION
\n+
108using namespace OPENSUBDIV_VERSION;
\n+
109
\n+
110} // end namespace OpenSubdiv
\n+
111
\n+
112#endif // OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n \n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n-
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n-
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndexBuffer, const PatchParam *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n-
static void Synchronize(void *)
synchronize all asynchronous computation invoked on this device.
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function. This function has a same signature as other device kernels hav...
\n-
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n-
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n-
Coordinates set on a patch table.
Definition types.h:42
\n-\n-\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+
void Reset()
Resets the descriptor to default.
\n+\n+\n+\n+
bool operator!=(BufferDescriptor const &other) const
True if the descriptors are not identical.
\n+
bool operator==(BufferDescriptor const &other) const
True if the descriptors are identical.
\n+
bool IsValid() const
True if the descriptor values are internally consistent.
\n+
int GetLocalOffset() const
Returns the relative offset within a stride.
\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-cpuEvaluator.h\n+bufferDescriptor.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,655 +24,125 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n-26#define OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n+25#ifndef OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n+26#define OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n 27\n 28#include \"../version.h\"\n-29#include \"../osd/bufferDescriptor.h\"\n-30#include \"../osd/types.h\"\n-31\n-32#include \n+29#include \n+30\n+31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+32namespace OPENSUBDIV_VERSION {\n 33\n-34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-35namespace OPENSUBDIV_VERSION {\n-36\n-37namespace Osd {\n-38\n-_\b3_\b9class _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n-40public:\n+_\b3_\b4namespace Osd {\n+35\n 46\n-71 template \n-_\b7_\b2 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-73 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-74 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-75 STENCIL_TABLE const *stencilTable,\n-76 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-77 void * deviceContext = NULL) {\n-78\n-79 (void)instance; // unused\n-80 (void)deviceContext; // unused\n-81\n-82 if (stencilTable->GetNumStencils() == 0)\n-83 return false;\n+47// example:\n+48// n\n+49// -----+----------------------------------------+-------------------------\n+50// | vertex 0 |\n+51// -----+----------------------------------------+-------------------------\n+52// | X Y Z R G B A Xu Yu Zu Xv Yv Zv |\n+53// -----+----------------------------------------+-------------------------\n+54// <------------- stride = 13 -------------->\n+55//\n+56// - XYZ (offset = n+0, length = 3, stride = 13)\n+57// - RGBA (offset = n+3, length = 4, stride = 13)\n+58// - uTangent (offset = n+7, length = 3, stride = 13)\n+59// - vTangent (offset = n+10, length = 3, stride = 13)\n+60//\n+_\b6_\b1struct _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n+62\n+_\b6_\b4 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() : _\bo_\bf_\bf_\bs_\be_\bt(0), _\bl_\be_\bn_\bg_\bt_\bh(0), _\bs_\bt_\br_\bi_\bd_\be(0) { }\n+65\n+_\b6_\b7 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int o, int l, int s) : _\bo_\bf_\bf_\bs_\be_\bt(o), _\bl_\be_\bn_\bg_\bt_\bh(l), _\bs_\bt_\br_\bi_\bd_\be(s) { }\n+68\n+_\b7_\b0 int _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt() const {\n+71 return _\bs_\bt_\br_\bi_\bd_\be > 0 ? _\bo_\bf_\bf_\bs_\be_\bt % _\bs_\bt_\br_\bi_\bd_\be : 0;\n+72 }\n+73\n+_\b7_\b5 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const {\n+76 return ((_\bl_\be_\bn_\bg_\bt_\bh > 0) &&\n+77 (_\bl_\be_\bn_\bg_\bt_\bh <= _\bs_\bt_\br_\bi_\bd_\be - _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt()));\n+78 }\n+79\n+_\b8_\b1 void _\bR_\be_\bs_\be_\bt() {\n+82 _\bo_\bf_\bf_\bs_\be_\bt = _\bl_\be_\bn_\bg_\bt_\bh = _\bs_\bt_\br_\bi_\bd_\be = 0;\n+83 }\n 84\n-85 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-86 dstBuffer->BindCpuBuffer(), dstDesc,\n-87 &stencilTable->GetSizes()[0],\n-88 &stencilTable->GetOffsets()[0],\n-89 &stencilTable->GetControlIndices()[0],\n-90 &stencilTable->GetWeights()[0],\n-91 /*start = */ 0,\n-92 /*end = */ stencilTable->GetNumStencils());\n-93 }\n-94\n-_\b1_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-122 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-123 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-124 const int * sizes,\n-125 const int * offsets,\n-126 const int * indices,\n-127 const float * weights,\n-128 int start, int end);\n-129\n-167 template \n-_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-171 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-172 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-173 STENCIL_TABLE const *stencilTable,\n-174 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-175 void * deviceContext = NULL) {\n-176\n-177 (void)instance; // unused\n-178 (void)deviceContext; // unused\n-179\n-180 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-181 dstBuffer->BindCpuBuffer(), dstDesc,\n-182 duBuffer->BindCpuBuffer(), duDesc,\n-183 dvBuffer->BindCpuBuffer(), dvDesc,\n-184 &stencilTable->GetSizes()[0],\n-185 &stencilTable->GetOffsets()[0],\n-186 &stencilTable->GetControlIndices()[0],\n-187 &stencilTable->GetWeights()[0],\n-188 &stencilTable->GetDuWeights()[0],\n-189 &stencilTable->GetDvWeights()[0],\n-190 /*start = */ 0,\n-191 /*end = */ stencilTable->GetNumStencils());\n-192 }\n-193\n-_\b2_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-235 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-236 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-237 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-238 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-239 const int * sizes,\n-240 const int * offsets,\n-241 const int * indices,\n-242 const float * weights,\n-243 const float * duWeights,\n-244 const float * dvWeights,\n-245 int start, int end);\n-246\n-302 template \n-_\b3_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-304 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-305 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-306 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-307 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-308 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-309 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-310 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-311 STENCIL_TABLE const *stencilTable,\n-312 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n-313 void * deviceContext = NULL) {\n-314\n-315 (void)instance; // unused\n-316 (void)deviceContext; // unused\n-317\n-318 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-319 dstBuffer->BindCpuBuffer(), dstDesc,\n-320 duBuffer->BindCpuBuffer(), duDesc,\n-321 dvBuffer->BindCpuBuffer(), dvDesc,\n-322 duuBuffer->BindCpuBuffer(), duuDesc,\n-323 duvBuffer->BindCpuBuffer(), duvDesc,\n-324 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-325 &stencilTable->GetSizes()[0],\n-326 &stencilTable->GetOffsets()[0],\n-327 &stencilTable->GetControlIndices()[0],\n-328 &stencilTable->GetWeights()[0],\n-329 &stencilTable->GetDuWeights()[0],\n-330 &stencilTable->GetDvWeights()[0],\n-331 &stencilTable->GetDuuWeights()[0],\n-332 &stencilTable->GetDuvWeights()[0],\n-333 &stencilTable->GetDvvWeights()[0],\n-334 /*start = */ 0,\n-335 /*end = */ stencilTable->GetNumStencils());\n-336 }\n-337\n-_\b3_\b9_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n-400 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-401 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-402 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-403 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-404 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-405 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-406 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-407 const int * sizes,\n-408 const int * offsets,\n-409 const int * indices,\n-410 const float * weights,\n-411 const float * duWeights,\n-412 const float * dvWeights,\n-413 const float * duuWeights,\n-414 const float * duvWeights,\n-415 const float * dvvWeights,\n-416 int start, int end);\n-417\n-423\n-452 template \n-_\b4_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-455 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-456 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-457 int numPatchCoords,\n-458 PATCHCOORD_BUFFER *patchCoords,\n-459 PATCH_TABLE *patchTable,\n-460 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-461 void * deviceContext = NULL) {\n-462\n-463 (void)instance; // unused\n-464 (void)deviceContext; // unused\n-465\n-466 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-467 dstBuffer->BindCpuBuffer(), dstDesc,\n-468 numPatchCoords,\n-469 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-470 patchTable->GetPatchArrayBuffer(),\n-471 patchTable->GetPatchIndexBuffer(),\n-472 patchTable->GetPatchParamBuffer());\n-473 }\n-474\n-515 template \n-_\b5_\b1_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-518 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-519 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-520 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-521 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-522 int numPatchCoords,\n-523 PATCHCOORD_BUFFER *patchCoords,\n-524 PATCH_TABLE *patchTable,\n-525 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-526 void * deviceContext = NULL) {\n-527\n-528 (void)instance; // unused\n-529 (void)deviceContext; // unused\n-530\n-531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n-532 // ideally all buffer classes should have templated by datatype\n-533 // so that downcast isn't needed there.\n-534 // (e.g. Osd::CpuBuffer )\n-535 //\n-536 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-537 dstBuffer->BindCpuBuffer(), dstDesc,\n-538 duBuffer->BindCpuBuffer(), duDesc,\n-539 dvBuffer->BindCpuBuffer(), dvDesc,\n-540 numPatchCoords,\n-541 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-542 patchTable->GetPatchArrayBuffer(),\n-543 patchTable->GetPatchIndexBuffer(),\n-544 patchTable->GetPatchParamBuffer());\n-545 }\n-546\n-605 template \n-_\b6_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-608 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-609 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-610 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-611 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-612 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-613 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-614 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-615 int numPatchCoords,\n-616 PATCHCOORD_BUFFER *patchCoords,\n-617 PATCH_TABLE *patchTable,\n-618 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-619 void * deviceContext = NULL) {\n-620\n-621 (void)instance; // unused\n-622 (void)deviceContext; // unused\n-623\n-624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n-625 // ideally all buffer classes should have templated by datatype\n-626 // so that downcast isn't needed there.\n-627 // (e.g. Osd::CpuBuffer )\n-628 //\n-629 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-630 dstBuffer->BindCpuBuffer(), dstDesc,\n-631 duBuffer->BindCpuBuffer(), duDesc,\n-632 dvBuffer->BindCpuBuffer(), dvDesc,\n-633 duuBuffer->BindCpuBuffer(), duuDesc,\n-634 duvBuffer->BindCpuBuffer(), duvDesc,\n-635 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-636 numPatchCoords,\n-637 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-638 patchTable->GetPatchArrayBuffer(),\n-639 patchTable->GetPatchIndexBuffer(),\n-640 patchTable->GetPatchParamBuffer());\n-641 }\n-642\n-_\b6_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-671 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-672 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-673 int numPatchCoords,\n-674 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n-675 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n-676 const int *patchIndexBuffer,\n-677 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParamBuffer);\n-678\n-_\b7_\b1_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-717 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-718 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-719 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-720 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-721 int numPatchCoords,\n-722 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-723 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-724 const int *patchIndexBuffer,\n-725 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n-726\n-_\b7_\b7_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n-780 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-781 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-782 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-783 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-784 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-785 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-786 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-787 int numPatchCoords,\n-788 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n-789 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n-790 const int *patchIndexBuffer,\n-791 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n-792\n-821 template \n-_\b8_\b2_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-824 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-825 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-826 int numPatchCoords,\n-827 PATCHCOORD_BUFFER *patchCoords,\n-828 PATCH_TABLE *patchTable,\n-829 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-830 void * deviceContext = NULL) {\n-831\n-832 (void)instance; // unused\n-833 (void)deviceContext; // unused\n-834\n-835 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-836 dstBuffer->BindCpuBuffer(), dstDesc,\n-837 numPatchCoords,\n-838 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-839 patchTable->GetVaryingPatchArrayBuffer(),\n-840 patchTable->GetVaryingPatchIndexBuffer(),\n-841 patchTable->GetPatchParamBuffer());\n-842 }\n-843\n-884 template \n-_\b8_\b8_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-887 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-888 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-889 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-890 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-891 int numPatchCoords,\n-892 PATCHCOORD_BUFFER *patchCoords,\n-893 PATCH_TABLE *patchTable,\n-894 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-895 void * deviceContext = NULL) {\n-896\n-897 (void)instance; // unused\n-898 (void)deviceContext; // unused\n-899\n-900 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-901 dstBuffer->BindCpuBuffer(), dstDesc,\n-902 duBuffer->BindCpuBuffer(), duDesc,\n-903 dvBuffer->BindCpuBuffer(), dvDesc,\n-904 numPatchCoords,\n-905 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-906 patchTable->GetVaryingPatchArrayBuffer(),\n-907 patchTable->GetVaryingPatchIndexBuffer(),\n-908 patchTable->GetPatchParamBuffer());\n-909 }\n-910\n-969 template \n-_\b9_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-972 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-973 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-974 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-975 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-976 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-977 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-978 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-979 int numPatchCoords,\n-980 PATCHCOORD_BUFFER *patchCoords,\n-981 PATCH_TABLE *patchTable,\n-982 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-983 void * deviceContext = NULL) {\n-984\n-985 (void)instance; // unused\n-986 (void)deviceContext; // unused\n-987\n-988 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-989 dstBuffer->BindCpuBuffer(), dstDesc,\n-990 duBuffer->BindCpuBuffer(), duDesc,\n-991 dvBuffer->BindCpuBuffer(), dvDesc,\n-992 duuBuffer->BindCpuBuffer(), duuDesc,\n-993 duvBuffer->BindCpuBuffer(), duvDesc,\n-994 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-995 numPatchCoords,\n-996 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-997 patchTable->GetVaryingPatchArrayBuffer(),\n-998 patchTable->GetVaryingPatchIndexBuffer(),\n-999 patchTable->GetPatchParamBuffer());\n-1000 }\n-1001\n-1032 template \n-_\b1_\b0_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1035 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1036 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1037 int numPatchCoords,\n-1038 PATCHCOORD_BUFFER *patchCoords,\n-1039 PATCH_TABLE *patchTable,\n-1040 int fvarChannel,\n-1041 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1042 void * deviceContext = NULL) {\n-1043\n-1044 (void)instance; // unused\n-1045 (void)deviceContext; // unused\n-1046\n-1047 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1048 dstBuffer->BindCpuBuffer(), dstDesc,\n-1049 numPatchCoords,\n-1050 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1054 }\n-1055\n-1098 template \n-_\b1_\b1_\b0_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1101 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1102 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1103 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1104 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1105 int numPatchCoords,\n-1106 PATCHCOORD_BUFFER *patchCoords,\n-1107 PATCH_TABLE *patchTable,\n-1108 int fvarChannel,\n-1109 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1110 void * deviceContext = NULL) {\n-1111\n-1112 (void)instance; // unused\n-1113 (void)deviceContext; // unused\n-1114\n-1115 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1116 dstBuffer->BindCpuBuffer(), dstDesc,\n-1117 duBuffer->BindCpuBuffer(), duDesc,\n-1118 dvBuffer->BindCpuBuffer(), dvDesc,\n-1119 numPatchCoords,\n-1120 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1124 }\n-1125\n-1186 template \n-_\b1_\b1_\b8_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n-1189 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n-1190 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n-1191 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n-1192 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n-1193 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n-1194 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n-1195 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n-1196 int numPatchCoords,\n-1197 PATCHCOORD_BUFFER *patchCoords,\n-1198 PATCH_TABLE *patchTable,\n-1199 int fvarChannel,\n-1200 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n-1201 void * deviceContext = NULL) {\n-1202\n-1203 (void)instance; // unused\n-1204 (void)deviceContext; // unused\n-1205\n-1206 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n-1207 dstBuffer->BindCpuBuffer(), dstDesc,\n-1208 duBuffer->BindCpuBuffer(), duDesc,\n-1209 dvBuffer->BindCpuBuffer(), dvDesc,\n-1210 duuBuffer->BindCpuBuffer(), duuDesc,\n-1211 duvBuffer->BindCpuBuffer(), duvDesc,\n-1212 dvvBuffer->BindCpuBuffer(), dvvDesc,\n-1213 numPatchCoords,\n-1214 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n-1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n-1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n-1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n-1218 }\n-1219\n-1225\n-_\b1_\b2_\b2_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void * /*deviceContext = NULL*/) {\n-1228 // nothing.\n-1229 }\n-1230};\n-1231\n-1232\n-1233} // end namespace Osd\n-1234\n-1235} // end namespace OPENSUBDIV_VERSION\n-1236using namespace OPENSUBDIV_VERSION;\n-1237\n-1238} // end namespace OpenSubdiv\n-1239\n-1240\n-1241#endif // OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n+_\b8_\b6 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b (_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &other) const {\n+87 return (_\bo_\bf_\bf_\bs_\be_\bt == other._\bo_\bf_\bf_\bs_\be_\bt &&\n+88 _\bl_\be_\bn_\bg_\bt_\bh == other._\bl_\be_\bn_\bg_\bt_\bh &&\n+89 _\bs_\bt_\br_\bi_\bd_\be == other._\bs_\bt_\br_\bi_\bd_\be);\n+90 }\n+91\n+_\b9_\b3 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b!_\b=_\b (_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &other) const {\n+94 return !(this->_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(other));\n+95 }\n+96\n+_\b9_\b8 int _\bo_\bf_\bf_\bs_\be_\bt;\n+_\b1_\b0_\b0 int _\bl_\be_\bn_\bg_\bt_\bh;\n+_\b1_\b0_\b2 int _\bs_\bt_\br_\bi_\bd_\be;\n+103};\n+104\n+105} // end namespace Osd\n+106\n+107} // end namespace OPENSUBDIV_VERSION\n+108using namespace OPENSUBDIV_VERSION;\n+109\n+110} // end namespace OpenSubdiv\n+111\n+112#endif // OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n BufferDescriptor is a struct which describes buffer elements in interleaved\n data buffers....\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n-fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b3_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, int start, int end)\n-Static eval stencils function which takes raw CPU pointers for input and\n-output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n-const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n-DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n-CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b8_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw CPU pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n-*offsets, const int *indices, const float *weights, const float *duWeights,\n-const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n-float *dvvWeights, int start, int end)\n-Static eval stencils function with derivatives, which takes raw CPU pointers\n-for input and output.\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n-BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n-float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n-const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer,\n-PatchParam const *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n-PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const\n-*instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b5_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n-*patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n-&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n-PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n-*patchIndexBuffer, PatchParam const *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n-&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n-*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n-const CpuEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n-float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n-PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n-*patchIndexBuffer, const PatchParam *patchParamBuffer)\n-Static limit eval function. It takes an array of PatchCoord and evaluate limit\n-values on given PatchT...\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void\n-*deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n-static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n-numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n-CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n-Generic limit eval function. This function has a same signature as other device\n-kernels have so that ...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n-static void Synchronize(void *)\n-synchronize all asynchronous computation invoked on this device.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b2_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n-const *stencilTable, const CpuEvaluator *instance=NULL, void\n-*deviceContext=NULL)\n-Generic static eval stencils function. This function has a same signature as\n-other device kernels hav...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n-static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n-DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n-BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n-&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n-*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n-BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n-*patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void\n-*deviceContext=NULL)\n-Generic limit eval function with derivatives. This function has a same\n-signature as other device kern...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n-static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n-&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n-*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n-BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n-CpuEvaluator *instance=NULL, void *deviceContext=NULL)\n-Generic static eval stencils function with derivatives. This function has a\n-same signature as other d...\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n-Coordinates set on a patch table.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bs_\bt_\br_\bi_\bd_\be\n+int stride\n+stride to the next element\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bR_\be_\bs_\be_\bt\n+void Reset()\n+Resets the descriptor to default.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor()\n+Default Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n+BufferDescriptor(int o, int l, int s)\n+Constructor.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bl_\be_\bn_\bg_\bt_\bh\n+int length\n+number or length of the data\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n+bool operator!=(BufferDescriptor const &other) const\n+True if the descriptors are not identical.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n+bool operator==(BufferDescriptor const &other) const\n+True if the descriptors are identical.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n+bool IsValid() const\n+True if the descriptor values are internally consistent.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt\n+int GetLocalOffset() const\n+Returns the relative offset within a stride.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bf_\bf_\bs_\be_\bt\n+int offset\n+offset to desired element data\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n+ * _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00899.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00899.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/bufferDescriptor.h File Reference\n+OpenSubdiv: opensubdiv/osd/cpuEvaluator.h File Reference\n \n \n \n \n \n \n \n@@ -90,26 +90,27 @@\n \n \n \n
\n \n-
bufferDescriptor.h File Reference
\n+
cpuEvaluator.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include <string.h>
\n+#include "../osd/bufferDescriptor.h"
\n+#include "../osd/types.h"
\n+#include <cstddef>
\n
\n

Go to the source code of this file.

\n \n \n-\n-\n+\n \n

\n Classes

struct  BufferDescriptor
 BufferDescriptor is a struct which describes buffer elements in interleaved data buffers. Almost all Osd Evaluator APIs take BufferDescriptors along with device-specific buffer objects. More...
class  CpuEvaluator
 
\n \n \n \n \n@@ -118,13 +119,13 @@\n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,26 +1,25 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-bufferDescriptor.h File Reference\n+cpuEvaluator.h File Reference\n #include \"../version.h\"\n-#include \n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\"\n+#include \"_\b._\b._\b/_\bo_\bs_\bd_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n-struct \u00a0 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n- _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br is a struct which describes buffer elements in\n-\u00a0 interleaved data buffers. Almost all _\bO_\bs_\bd Evaluator APIs take\n- BufferDescriptors along with device-specific buffer objects. _\bM_\bo_\br_\be_\b._\b._\b.\n+class \u00a0 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00899.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00899.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var a00899 = [\n- [\"BufferDescriptor\", \"a01141.html\", \"a01141\"]\n+ [\"CpuEvaluator\", \"a01165.html\", null]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00899_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00899_source.html", "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/osd/bufferDescriptor.h Source File\n+OpenSubdiv: opensubdiv/osd/cpuEvaluator.h Source File\n \n \n \n \n \n \n \n@@ -92,15 +92,15 @@\n
No Matches
\n \n \n \n \n \n
\n-
bufferDescriptor.h
\n+
cpuEvaluator.h
\n
\n
\n Go to the documentation of this file.
1//
\n
2// Copyright 2015 Pixar
\n
3//
\n
4// Licensed under the Apache License, Version 2.0 (the "Apache License")
\n
5// with the following modification; you may not use this file except in
\n@@ -119,112 +119,529 @@\n
18// Unless required by applicable law or agreed to in writing, software
\n
19// distributed under the Apache License with the above modification is
\n
20// distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
\n
21// KIND, either express or implied. See the Apache License for the specific
\n
22// language governing permissions and limitations under the Apache License.
\n
23//
\n
24
\n-
25#ifndef OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n-
26#define OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n+
25#ifndef OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n+
26#define OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n
27
\n
28#include "../version.h"
\n-
29#include <string.h>
\n-
30
\n-
31namespace OpenSubdiv {
\n-
32namespace OPENSUBDIV_VERSION {
\n+
29#include "../osd/bufferDescriptor.h"
\n+
30#include "../osd/types.h"
\n+
31
\n+
32#include <cstddef>
\n
33
\n-
\n-
34namespace Osd {
\n-
35
\n+
34namespace OpenSubdiv {
\n+
35namespace OPENSUBDIV_VERSION {
\n+
36
\n+
37namespace Osd {
\n+
38
\n+
\n+\n+
40public:
\n
46
\n-
47// example:
\n-
48// n
\n-
49// -----+----------------------------------------+-------------------------
\n-
50// | vertex 0 |
\n-
51// -----+----------------------------------------+-------------------------
\n-
52// | X Y Z R G B A Xu Yu Zu Xv Yv Zv |
\n-
53// -----+----------------------------------------+-------------------------
\n-
54// <------------- stride = 13 -------------->
\n-
55//
\n-
56// - XYZ (offset = n+0, length = 3, stride = 13)
\n-
57// - RGBA (offset = n+3, length = 4, stride = 13)
\n-
58// - uTangent (offset = n+7, length = 3, stride = 13)
\n-
59// - vTangent (offset = n+10, length = 3, stride = 13)
\n-
60//
\n-
\n-\n-
62
\n-\n-
65
\n-
67 BufferDescriptor(int o, int l, int s) : offset(o), length(l), stride(s) { }
\n-
68
\n-
\n-
70 int GetLocalOffset() const {
\n-
71 return stride > 0 ? offset % stride : 0;
\n-
72 }
\n-
\n-
73
\n-
\n-
75 bool IsValid() const {
\n-
76 return ((length > 0) &&
\n-\n-
78 }
\n-
\n-
79
\n-
\n-
81 void Reset() {
\n-
82 offset = length = stride = 0;
\n-
83 }
\n-
\n+
71 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
72 static bool EvalStencils(
\n+
73 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
74 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
75 STENCIL_TABLE const *stencilTable,
\n+
76 const CpuEvaluator *instance = NULL,
\n+
77 void * deviceContext = NULL) {
\n+
78
\n+
79 (void)instance; // unused
\n+
80 (void)deviceContext; // unused
\n+
81
\n+
82 if (stencilTable->GetNumStencils() == 0)
\n+
83 return false;
\n
84
\n-
\n-
86 bool operator == (BufferDescriptor const &other) const {
\n-
87 return (offset == other.offset &&
\n-
88 length == other.length &&
\n-
89 stride == other.stride);
\n-
90 }
\n-
\n-
91
\n-
\n-
93 bool operator != (BufferDescriptor const &other) const {
\n-
94 return !(this->operator==(other));
\n-
95 }
\n-
\n-
96
\n-
98 int offset;
\n-\n-\n-
103};
\n-
\n-
104
\n-
105} // end namespace Osd
\n-
\n-
106
\n-
107} // end namespace OPENSUBDIV_VERSION
\n-
108using namespace OPENSUBDIV_VERSION;
\n-
109
\n-
110} // end namespace OpenSubdiv
\n-
111
\n-
112#endif // OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H
\n+
85 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
86 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
87 &stencilTable->GetSizes()[0],
\n+
88 &stencilTable->GetOffsets()[0],
\n+
89 &stencilTable->GetControlIndices()[0],
\n+
90 &stencilTable->GetWeights()[0],
\n+
91 /*start = */ 0,
\n+
92 /*end = */ stencilTable->GetNumStencils());
\n+
93 }
\n+
\n+
94
\n+
121 static bool EvalStencils(
\n+
122 const float *src, BufferDescriptor const &srcDesc,
\n+
123 float *dst, BufferDescriptor const &dstDesc,
\n+
124 const int * sizes,
\n+
125 const int * offsets,
\n+
126 const int * indices,
\n+
127 const float * weights,
\n+
128 int start, int end);
\n+
129
\n+
167 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
168 static bool EvalStencils(
\n+
169 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
170 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
171 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
172 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
173 STENCIL_TABLE const *stencilTable,
\n+
174 const CpuEvaluator *instance = NULL,
\n+
175 void * deviceContext = NULL) {
\n+
176
\n+
177 (void)instance; // unused
\n+
178 (void)deviceContext; // unused
\n+
179
\n+
180 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
181 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
182 duBuffer->BindCpuBuffer(), duDesc,
\n+
183 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
184 &stencilTable->GetSizes()[0],
\n+
185 &stencilTable->GetOffsets()[0],
\n+
186 &stencilTable->GetControlIndices()[0],
\n+
187 &stencilTable->GetWeights()[0],
\n+
188 &stencilTable->GetDuWeights()[0],
\n+
189 &stencilTable->GetDvWeights()[0],
\n+
190 /*start = */ 0,
\n+
191 /*end = */ stencilTable->GetNumStencils());
\n+
192 }
\n+
\n+
193
\n+
234 static bool EvalStencils(
\n+
235 const float *src, BufferDescriptor const &srcDesc,
\n+
236 float *dst, BufferDescriptor const &dstDesc,
\n+
237 float *du, BufferDescriptor const &duDesc,
\n+
238 float *dv, BufferDescriptor const &dvDesc,
\n+
239 const int * sizes,
\n+
240 const int * offsets,
\n+
241 const int * indices,
\n+
242 const float * weights,
\n+
243 const float * duWeights,
\n+
244 const float * dvWeights,
\n+
245 int start, int end);
\n+
246
\n+
302 template <typename SRC_BUFFER, typename DST_BUFFER, typename STENCIL_TABLE>
\n+
\n+
303 static bool EvalStencils(
\n+
304 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
305 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
306 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
307 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
308 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
309 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
310 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
311 STENCIL_TABLE const *stencilTable,
\n+
312 const CpuEvaluator *instance = NULL,
\n+
313 void * deviceContext = NULL) {
\n+
314
\n+
315 (void)instance; // unused
\n+
316 (void)deviceContext; // unused
\n+
317
\n+
318 return EvalStencils(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
319 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
320 duBuffer->BindCpuBuffer(), duDesc,
\n+
321 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
322 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
323 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
324 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
325 &stencilTable->GetSizes()[0],
\n+
326 &stencilTable->GetOffsets()[0],
\n+
327 &stencilTable->GetControlIndices()[0],
\n+
328 &stencilTable->GetWeights()[0],
\n+
329 &stencilTable->GetDuWeights()[0],
\n+
330 &stencilTable->GetDvWeights()[0],
\n+
331 &stencilTable->GetDuuWeights()[0],
\n+
332 &stencilTable->GetDuvWeights()[0],
\n+
333 &stencilTable->GetDvvWeights()[0],
\n+
334 /*start = */ 0,
\n+
335 /*end = */ stencilTable->GetNumStencils());
\n+
336 }
\n+
\n+
337
\n+
399 static bool EvalStencils(
\n+
400 const float *src, BufferDescriptor const &srcDesc,
\n+
401 float *dst, BufferDescriptor const &dstDesc,
\n+
402 float *du, BufferDescriptor const &duDesc,
\n+
403 float *dv, BufferDescriptor const &dvDesc,
\n+
404 float *duu, BufferDescriptor const &duuDesc,
\n+
405 float *duv, BufferDescriptor const &duvDesc,
\n+
406 float *dvv, BufferDescriptor const &dvvDesc,
\n+
407 const int * sizes,
\n+
408 const int * offsets,
\n+
409 const int * indices,
\n+
410 const float * weights,
\n+
411 const float * duWeights,
\n+
412 const float * dvWeights,
\n+
413 const float * duuWeights,
\n+
414 const float * duvWeights,
\n+
415 const float * dvvWeights,
\n+
416 int start, int end);
\n+
417
\n+
423
\n+
452 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
453 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
454 static bool EvalPatches(
\n+
455 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
456 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
457 int numPatchCoords,
\n+
458 PATCHCOORD_BUFFER *patchCoords,
\n+
459 PATCH_TABLE *patchTable,
\n+
460 CpuEvaluator const *instance = NULL,
\n+
461 void * deviceContext = NULL) {
\n+
462
\n+
463 (void)instance; // unused
\n+
464 (void)deviceContext; // unused
\n+
465
\n+
466 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
467 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
468 numPatchCoords,
\n+
469 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
470 patchTable->GetPatchArrayBuffer(),
\n+
471 patchTable->GetPatchIndexBuffer(),
\n+
472 patchTable->GetPatchParamBuffer());
\n+
473 }
\n+
\n+
474
\n+
515 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
516 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
517 static bool EvalPatches(
\n+
518 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
519 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
520 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
521 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
522 int numPatchCoords,
\n+
523 PATCHCOORD_BUFFER *patchCoords,
\n+
524 PATCH_TABLE *patchTable,
\n+
525 CpuEvaluator const *instance = NULL,
\n+
526 void * deviceContext = NULL) {
\n+
527
\n+
528 (void)instance; // unused
\n+
529 (void)deviceContext; // unused
\n+
530
\n+
531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n+
532 // ideally all buffer classes should have templated by datatype
\n+
533 // so that downcast isn't needed there.
\n+
534 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n+
535 //
\n+
536 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
537 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
538 duBuffer->BindCpuBuffer(), duDesc,
\n+
539 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
540 numPatchCoords,
\n+
541 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
542 patchTable->GetPatchArrayBuffer(),
\n+
543 patchTable->GetPatchIndexBuffer(),
\n+
544 patchTable->GetPatchParamBuffer());
\n+
545 }
\n+
\n+
546
\n+
605 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
606 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+
607 static bool EvalPatches(
\n+
608 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
609 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
610 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
611 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
612 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
613 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
614 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
615 int numPatchCoords,
\n+
616 PATCHCOORD_BUFFER *patchCoords,
\n+
617 PATCH_TABLE *patchTable,
\n+
618 CpuEvaluator const *instance = NULL,
\n+
619 void * deviceContext = NULL) {
\n+
620
\n+
621 (void)instance; // unused
\n+
622 (void)deviceContext; // unused
\n+
623
\n+
624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.
\n+
625 // ideally all buffer classes should have templated by datatype
\n+
626 // so that downcast isn't needed there.
\n+
627 // (e.g. Osd::CpuBuffer<PatchCoord> )
\n+
628 //
\n+
629 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
630 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
631 duBuffer->BindCpuBuffer(), duDesc,
\n+
632 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
633 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
634 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
635 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
636 numPatchCoords,
\n+
637 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
638 patchTable->GetPatchArrayBuffer(),
\n+
639 patchTable->GetPatchIndexBuffer(),
\n+
640 patchTable->GetPatchParamBuffer());
\n+
641 }
\n+
\n+
642
\n+
670 static bool EvalPatches(
\n+
671 const float *src, BufferDescriptor const &srcDesc,
\n+
672 float *dst, BufferDescriptor const &dstDesc,
\n+
673 int numPatchCoords,
\n+
674 const PatchCoord *patchCoords,
\n+
675 const PatchArray *patchArrays,
\n+
676 const int *patchIndexBuffer,
\n+
677 const PatchParam *patchParamBuffer);
\n+
678
\n+
716 static bool EvalPatches(
\n+
717 const float *src, BufferDescriptor const &srcDesc,
\n+
718 float *dst, BufferDescriptor const &dstDesc,
\n+
719 float *du, BufferDescriptor const &duDesc,
\n+
720 float *dv, BufferDescriptor const &dvDesc,
\n+
721 int numPatchCoords,
\n+
722 PatchCoord const *patchCoords,
\n+
723 PatchArray const *patchArrays,
\n+
724 const int *patchIndexBuffer,
\n+
725 PatchParam const *patchParamBuffer);
\n+
726
\n+
779 static bool EvalPatches(
\n+
780 const float *src, BufferDescriptor const &srcDesc,
\n+
781 float *dst, BufferDescriptor const &dstDesc,
\n+
782 float *du, BufferDescriptor const &duDesc,
\n+
783 float *dv, BufferDescriptor const &dvDesc,
\n+
784 float *duu, BufferDescriptor const &duuDesc,
\n+
785 float *duv, BufferDescriptor const &duvDesc,
\n+
786 float *dvv, BufferDescriptor const &dvvDesc,
\n+
787 int numPatchCoords,
\n+
788 PatchCoord const *patchCoords,
\n+
789 PatchArray const *patchArrays,
\n+
790 const int *patchIndexBuffer,
\n+
791 PatchParam const *patchParamBuffer);
\n+
792
\n+
821 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
822 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
824 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
825 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
826 int numPatchCoords,
\n+
827 PATCHCOORD_BUFFER *patchCoords,
\n+
828 PATCH_TABLE *patchTable,
\n+
829 CpuEvaluator const *instance = NULL,
\n+
830 void * deviceContext = NULL) {
\n+
831
\n+
832 (void)instance; // unused
\n+
833 (void)deviceContext; // unused
\n+
834
\n+
835 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
836 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
837 numPatchCoords,
\n+
838 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
839 patchTable->GetVaryingPatchArrayBuffer(),
\n+
840 patchTable->GetVaryingPatchIndexBuffer(),
\n+
841 patchTable->GetPatchParamBuffer());
\n+
842 }
\n+
\n+
843
\n+
884 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
885 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
887 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
888 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
889 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
890 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
891 int numPatchCoords,
\n+
892 PATCHCOORD_BUFFER *patchCoords,
\n+
893 PATCH_TABLE *patchTable,
\n+
894 CpuEvaluator const *instance = NULL,
\n+
895 void * deviceContext = NULL) {
\n+
896
\n+
897 (void)instance; // unused
\n+
898 (void)deviceContext; // unused
\n+
899
\n+
900 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
901 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
902 duBuffer->BindCpuBuffer(), duDesc,
\n+
903 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
904 numPatchCoords,
\n+
905 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
906 patchTable->GetVaryingPatchArrayBuffer(),
\n+
907 patchTable->GetVaryingPatchIndexBuffer(),
\n+
908 patchTable->GetPatchParamBuffer());
\n+
909 }
\n+
\n+
910
\n+
969 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
970 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
972 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
973 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
974 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
975 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
976 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
977 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
978 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
979 int numPatchCoords,
\n+
980 PATCHCOORD_BUFFER *patchCoords,
\n+
981 PATCH_TABLE *patchTable,
\n+
982 CpuEvaluator const *instance = NULL,
\n+
983 void * deviceContext = NULL) {
\n+
984
\n+
985 (void)instance; // unused
\n+
986 (void)deviceContext; // unused
\n+
987
\n+
988 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
989 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
990 duBuffer->BindCpuBuffer(), duDesc,
\n+
991 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
992 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
993 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
994 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
995 numPatchCoords,
\n+
996 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
997 patchTable->GetVaryingPatchArrayBuffer(),
\n+
998 patchTable->GetVaryingPatchIndexBuffer(),
\n+
999 patchTable->GetPatchParamBuffer());
\n+
1000 }
\n+
\n+
1001
\n+
1032 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1033 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1035 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1036 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1037 int numPatchCoords,
\n+
1038 PATCHCOORD_BUFFER *patchCoords,
\n+
1039 PATCH_TABLE *patchTable,
\n+
1040 int fvarChannel,
\n+
1041 CpuEvaluator const *instance = NULL,
\n+
1042 void * deviceContext = NULL) {
\n+
1043
\n+
1044 (void)instance; // unused
\n+
1045 (void)deviceContext; // unused
\n+
1046
\n+
1047 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1048 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1049 numPatchCoords,
\n+
1050 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1054 }
\n+
\n+
1055
\n+
1098 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1099 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1101 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1102 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1103 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1104 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1105 int numPatchCoords,
\n+
1106 PATCHCOORD_BUFFER *patchCoords,
\n+
1107 PATCH_TABLE *patchTable,
\n+
1108 int fvarChannel,
\n+
1109 CpuEvaluator const *instance = NULL,
\n+
1110 void * deviceContext = NULL) {
\n+
1111
\n+
1112 (void)instance; // unused
\n+
1113 (void)deviceContext; // unused
\n+
1114
\n+
1115 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1116 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1117 duBuffer->BindCpuBuffer(), duDesc,
\n+
1118 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
1119 numPatchCoords,
\n+
1120 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1124 }
\n+
\n+
1125
\n+
1186 template <typename SRC_BUFFER, typename DST_BUFFER,
\n+
1187 typename PATCHCOORD_BUFFER, typename PATCH_TABLE>
\n+
\n+\n+
1189 SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,
\n+
1190 DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,
\n+
1191 DST_BUFFER *duBuffer, BufferDescriptor const &duDesc,
\n+
1192 DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc,
\n+
1193 DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc,
\n+
1194 DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc,
\n+
1195 DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc,
\n+
1196 int numPatchCoords,
\n+
1197 PATCHCOORD_BUFFER *patchCoords,
\n+
1198 PATCH_TABLE *patchTable,
\n+
1199 int fvarChannel,
\n+
1200 CpuEvaluator const *instance = NULL,
\n+
1201 void * deviceContext = NULL) {
\n+
1202
\n+
1203 (void)instance; // unused
\n+
1204 (void)deviceContext; // unused
\n+
1205
\n+
1206 return EvalPatches(srcBuffer->BindCpuBuffer(), srcDesc,
\n+
1207 dstBuffer->BindCpuBuffer(), dstDesc,
\n+
1208 duBuffer->BindCpuBuffer(), duDesc,
\n+
1209 dvBuffer->BindCpuBuffer(), dvDesc,
\n+
1210 duuBuffer->BindCpuBuffer(), duuDesc,
\n+
1211 duvBuffer->BindCpuBuffer(), duvDesc,
\n+
1212 dvvBuffer->BindCpuBuffer(), dvvDesc,
\n+
1213 numPatchCoords,
\n+
1214 (const PatchCoord*)patchCoords->BindCpuBuffer(),
\n+
1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),
\n+
1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),
\n+
1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));
\n+
1218 }
\n+
\n+
1219
\n+
1225
\n+
\n+
1227 static void Synchronize(void * /*deviceContext = NULL*/) {
\n+
1228 // nothing.
\n+
1229 }
\n+
\n+
1230};
\n+
\n+
1231
\n+
1232
\n+
1233} // end namespace Osd
\n+
1234
\n+
1235} // end namespace OPENSUBDIV_VERSION
\n+
1236using namespace OPENSUBDIV_VERSION;
\n+
1237
\n+
1238} // end namespace OpenSubdiv
\n+
1239
\n+
1240
\n+
1241#endif // OPENSUBDIV3_OSD_CPU_EVALUATOR_H
\n \n-
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n-\n-
void Reset()
Resets the descriptor to default.
\n-\n-\n-\n-
bool operator!=(BufferDescriptor const &other) const
True if the descriptors are not identical.
\n-
bool operator==(BufferDescriptor const &other) const
True if the descriptors are identical.
\n-
bool IsValid() const
True if the descriptor values are internally consistent.
\n-
int GetLocalOffset() const
Returns the relative offset within a stride.
\n-\n+
BufferDescriptor is a struct which describes buffer elements in interleaved data buffers....
\n+\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, int start, int end)
Static eval stencils function which takes raw CPU pointers for input and output.
\n+
static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n+
static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int *offsets, const int *indices, const float *weights, const float *duWeights, const float *dvWeights, const float *duuWeights, const float *duvWeights, const float *dvvWeights, int start, int end)
Static eval stencils function with derivatives, which takes raw CPU pointers for input and output.
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu, BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc, float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const &duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords, PatchCoord const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer, PatchParam const *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc, float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const PatchCoord *patchCoords, const PatchArray *patchArrays, const int *patchIndexBuffer, const PatchParam *patchParamBuffer)
Static limit eval function. It takes an array of PatchCoord and evaluate limit values on given PatchT...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function. This function has a same signature as other device kernels have so that ...
\n+
static void Synchronize(void *)
synchronize all asynchronous computation invoked on this device.
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function. This function has a same signature as other device kernels hav...
\n+
static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)
Generic limit eval function with derivatives. This function has a same signature as other device kern...
\n+
static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
Generic static eval stencils function with derivatives. This function has a same signature as other d...
\n+
Coordinates set on a patch table.
Definition types.h:42
\n+\n+\n
\n \n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,12 +1,12 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n-bufferDescriptor.h\n+cpuEvaluator.h\n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bd_\bo_\bc_\bu_\bm_\be_\bn_\bt_\ba_\bt_\bi_\bo_\bn_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n 1//\n 2// Copyright 2015 Pixar\n 3//\n 4// Licensed under the Apache License, Version 2.0 (the \"Apache License\")\n 5// with the following modification; you may not use this file except in\n 6// compliance with the Apache License and the following modification to it:\n@@ -24,125 +24,655 @@\n 18// Unless required by applicable law or agreed to in writing, software\n 19// distributed under the Apache License with the above modification is\n 20// distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n 21// KIND, either express or implied. See the Apache License for the specific\n 22// language governing permissions and limitations under the Apache License.\n 23//\n 24\n-25#ifndef OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n-26#define OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n+25#ifndef OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n+26#define OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n 27\n 28#include \"../version.h\"\n-29#include \n-30\n-31namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n-32namespace OPENSUBDIV_VERSION {\n+29#include \"../osd/bufferDescriptor.h\"\n+30#include \"../osd/types.h\"\n+31\n+32#include \n 33\n-_\b3_\b4namespace Osd {\n-35\n+34namespace _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv {\n+35namespace OPENSUBDIV_VERSION {\n+36\n+37namespace Osd {\n+38\n+_\b3_\b9class _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br {\n+40public:\n 46\n-47// example:\n-48// n\n-49// -----+----------------------------------------+-------------------------\n-50// | vertex 0 |\n-51// -----+----------------------------------------+-------------------------\n-52// | X Y Z R G B A Xu Yu Zu Xv Yv Zv |\n-53// -----+----------------------------------------+-------------------------\n-54// <------------- stride = 13 -------------->\n-55//\n-56// - XYZ (offset = n+0, length = 3, stride = 13)\n-57// - RGBA (offset = n+3, length = 4, stride = 13)\n-58// - uTangent (offset = n+7, length = 3, stride = 13)\n-59// - vTangent (offset = n+10, length = 3, stride = 13)\n-60//\n-_\b6_\b1struct _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br {\n-62\n-_\b6_\b4 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br() : _\bo_\bf_\bf_\bs_\be_\bt(0), _\bl_\be_\bn_\bg_\bt_\bh(0), _\bs_\bt_\br_\bi_\bd_\be(0) { }\n-65\n-_\b6_\b7 _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br(int o, int l, int s) : _\bo_\bf_\bf_\bs_\be_\bt(o), _\bl_\be_\bn_\bg_\bt_\bh(l), _\bs_\bt_\br_\bi_\bd_\be(s) { }\n-68\n-_\b7_\b0 int _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt() const {\n-71 return _\bs_\bt_\br_\bi_\bd_\be > 0 ? _\bo_\bf_\bf_\bs_\be_\bt % _\bs_\bt_\br_\bi_\bd_\be : 0;\n-72 }\n-73\n-_\b7_\b5 bool _\bI_\bs_\bV_\ba_\bl_\bi_\bd() const {\n-76 return ((_\bl_\be_\bn_\bg_\bt_\bh > 0) &&\n-77 (_\bl_\be_\bn_\bg_\bt_\bh <= _\bs_\bt_\br_\bi_\bd_\be - _\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt()));\n-78 }\n-79\n-_\b8_\b1 void _\bR_\be_\bs_\be_\bt() {\n-82 _\bo_\bf_\bf_\bs_\be_\bt = _\bl_\be_\bn_\bg_\bt_\bh = _\bs_\bt_\br_\bi_\bd_\be = 0;\n-83 }\n+71 template \n+_\b7_\b2 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+73 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+74 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+75 STENCIL_TABLE const *stencilTable,\n+76 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+77 void * deviceContext = NULL) {\n+78\n+79 (void)instance; // unused\n+80 (void)deviceContext; // unused\n+81\n+82 if (stencilTable->GetNumStencils() == 0)\n+83 return false;\n 84\n-_\b8_\b6 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b=_\b=_\b (_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &other) const {\n-87 return (_\bo_\bf_\bf_\bs_\be_\bt == other._\bo_\bf_\bf_\bs_\be_\bt &&\n-88 _\bl_\be_\bn_\bg_\bt_\bh == other._\bl_\be_\bn_\bg_\bt_\bh &&\n-89 _\bs_\bt_\br_\bi_\bd_\be == other._\bs_\bt_\br_\bi_\bd_\be);\n-90 }\n-91\n-_\b9_\b3 bool _\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b _\b!_\b=_\b (_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &other) const {\n-94 return !(this->_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=(other));\n-95 }\n-96\n-_\b9_\b8 int _\bo_\bf_\bf_\bs_\be_\bt;\n-_\b1_\b0_\b0 int _\bl_\be_\bn_\bg_\bt_\bh;\n-_\b1_\b0_\b2 int _\bs_\bt_\br_\bi_\bd_\be;\n-103};\n-104\n-105} // end namespace Osd\n-106\n-107} // end namespace OPENSUBDIV_VERSION\n-108using namespace OPENSUBDIV_VERSION;\n-109\n-110} // end namespace OpenSubdiv\n-111\n-112#endif // OPENSUBDIV3_OSD_BUFFER_DESCRIPTOR_H\n+85 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+86 dstBuffer->BindCpuBuffer(), dstDesc,\n+87 &stencilTable->GetSizes()[0],\n+88 &stencilTable->GetOffsets()[0],\n+89 &stencilTable->GetControlIndices()[0],\n+90 &stencilTable->GetWeights()[0],\n+91 /*start = */ 0,\n+92 /*end = */ stencilTable->GetNumStencils());\n+93 }\n+94\n+_\b1_\b2_\b1 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+122 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+123 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+124 const int * sizes,\n+125 const int * offsets,\n+126 const int * indices,\n+127 const float * weights,\n+128 int start, int end);\n+129\n+167 template \n+_\b1_\b6_\b8 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+169 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+170 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+171 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+172 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+173 STENCIL_TABLE const *stencilTable,\n+174 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+175 void * deviceContext = NULL) {\n+176\n+177 (void)instance; // unused\n+178 (void)deviceContext; // unused\n+179\n+180 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+181 dstBuffer->BindCpuBuffer(), dstDesc,\n+182 duBuffer->BindCpuBuffer(), duDesc,\n+183 dvBuffer->BindCpuBuffer(), dvDesc,\n+184 &stencilTable->GetSizes()[0],\n+185 &stencilTable->GetOffsets()[0],\n+186 &stencilTable->GetControlIndices()[0],\n+187 &stencilTable->GetWeights()[0],\n+188 &stencilTable->GetDuWeights()[0],\n+189 &stencilTable->GetDvWeights()[0],\n+190 /*start = */ 0,\n+191 /*end = */ stencilTable->GetNumStencils());\n+192 }\n+193\n+_\b2_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+235 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+236 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+237 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+238 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+239 const int * sizes,\n+240 const int * offsets,\n+241 const int * indices,\n+242 const float * weights,\n+243 const float * duWeights,\n+244 const float * dvWeights,\n+245 int start, int end);\n+246\n+302 template \n+_\b3_\b0_\b3 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+304 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+305 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+306 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+307 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+308 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+309 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+310 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+311 STENCIL_TABLE const *stencilTable,\n+312 const _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br *instance = NULL,\n+313 void * deviceContext = NULL) {\n+314\n+315 (void)instance; // unused\n+316 (void)deviceContext; // unused\n+317\n+318 return _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+319 dstBuffer->BindCpuBuffer(), dstDesc,\n+320 duBuffer->BindCpuBuffer(), duDesc,\n+321 dvBuffer->BindCpuBuffer(), dvDesc,\n+322 duuBuffer->BindCpuBuffer(), duuDesc,\n+323 duvBuffer->BindCpuBuffer(), duvDesc,\n+324 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+325 &stencilTable->GetSizes()[0],\n+326 &stencilTable->GetOffsets()[0],\n+327 &stencilTable->GetControlIndices()[0],\n+328 &stencilTable->GetWeights()[0],\n+329 &stencilTable->GetDuWeights()[0],\n+330 &stencilTable->GetDvWeights()[0],\n+331 &stencilTable->GetDuuWeights()[0],\n+332 &stencilTable->GetDuvWeights()[0],\n+333 &stencilTable->GetDvvWeights()[0],\n+334 /*start = */ 0,\n+335 /*end = */ stencilTable->GetNumStencils());\n+336 }\n+337\n+_\b3_\b9_\b9 static bool _\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs(\n+400 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+401 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+402 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+403 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+404 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+405 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+406 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+407 const int * sizes,\n+408 const int * offsets,\n+409 const int * indices,\n+410 const float * weights,\n+411 const float * duWeights,\n+412 const float * dvWeights,\n+413 const float * duuWeights,\n+414 const float * duvWeights,\n+415 const float * dvvWeights,\n+416 int start, int end);\n+417\n+423\n+452 template \n+_\b4_\b5_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+455 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+456 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+457 int numPatchCoords,\n+458 PATCHCOORD_BUFFER *patchCoords,\n+459 PATCH_TABLE *patchTable,\n+460 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+461 void * deviceContext = NULL) {\n+462\n+463 (void)instance; // unused\n+464 (void)deviceContext; // unused\n+465\n+466 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+467 dstBuffer->BindCpuBuffer(), dstDesc,\n+468 numPatchCoords,\n+469 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+470 patchTable->GetPatchArrayBuffer(),\n+471 patchTable->GetPatchIndexBuffer(),\n+472 patchTable->GetPatchParamBuffer());\n+473 }\n+474\n+515 template \n+_\b5_\b1_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+518 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+519 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+520 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+521 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+522 int numPatchCoords,\n+523 PATCHCOORD_BUFFER *patchCoords,\n+524 PATCH_TABLE *patchTable,\n+525 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+526 void * deviceContext = NULL) {\n+527\n+528 (void)instance; // unused\n+529 (void)deviceContext; // unused\n+530\n+531 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n+532 // ideally all buffer classes should have templated by datatype\n+533 // so that downcast isn't needed there.\n+534 // (e.g. Osd::CpuBuffer )\n+535 //\n+536 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+537 dstBuffer->BindCpuBuffer(), dstDesc,\n+538 duBuffer->BindCpuBuffer(), duDesc,\n+539 dvBuffer->BindCpuBuffer(), dvDesc,\n+540 numPatchCoords,\n+541 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+542 patchTable->GetPatchArrayBuffer(),\n+543 patchTable->GetPatchIndexBuffer(),\n+544 patchTable->GetPatchParamBuffer());\n+545 }\n+546\n+605 template \n+_\b6_\b0_\b7 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+608 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+609 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+610 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+611 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+612 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+613 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+614 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+615 int numPatchCoords,\n+616 PATCHCOORD_BUFFER *patchCoords,\n+617 PATCH_TABLE *patchTable,\n+618 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+619 void * deviceContext = NULL) {\n+620\n+621 (void)instance; // unused\n+622 (void)deviceContext; // unused\n+623\n+624 // XXX: PatchCoords is somewhat abusing vertex primvar buffer interop.\n+625 // ideally all buffer classes should have templated by datatype\n+626 // so that downcast isn't needed there.\n+627 // (e.g. Osd::CpuBuffer )\n+628 //\n+629 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+630 dstBuffer->BindCpuBuffer(), dstDesc,\n+631 duBuffer->BindCpuBuffer(), duDesc,\n+632 dvBuffer->BindCpuBuffer(), dvDesc,\n+633 duuBuffer->BindCpuBuffer(), duuDesc,\n+634 duvBuffer->BindCpuBuffer(), duvDesc,\n+635 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+636 numPatchCoords,\n+637 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+638 patchTable->GetPatchArrayBuffer(),\n+639 patchTable->GetPatchIndexBuffer(),\n+640 patchTable->GetPatchParamBuffer());\n+641 }\n+642\n+_\b6_\b7_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+671 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+672 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+673 int numPatchCoords,\n+674 const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd *patchCoords,\n+675 const _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by *patchArrays,\n+676 const int *patchIndexBuffer,\n+677 const _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm *patchParamBuffer);\n+678\n+_\b7_\b1_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+717 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+718 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+719 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+720 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+721 int numPatchCoords,\n+722 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+723 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+724 const int *patchIndexBuffer,\n+725 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n+726\n+_\b7_\b7_\b9 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(\n+780 const float *src, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+781 float *dst, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+782 float *du, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+783 float *dv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+784 float *duu, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+785 float *duv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+786 float *dvv, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+787 int numPatchCoords,\n+788 _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd const *patchCoords,\n+789 _\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by const *patchArrays,\n+790 const int *patchIndexBuffer,\n+791 _\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm const *patchParamBuffer);\n+792\n+821 template \n+_\b8_\b2_\b3 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+824 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+825 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+826 int numPatchCoords,\n+827 PATCHCOORD_BUFFER *patchCoords,\n+828 PATCH_TABLE *patchTable,\n+829 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+830 void * deviceContext = NULL) {\n+831\n+832 (void)instance; // unused\n+833 (void)deviceContext; // unused\n+834\n+835 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+836 dstBuffer->BindCpuBuffer(), dstDesc,\n+837 numPatchCoords,\n+838 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+839 patchTable->GetVaryingPatchArrayBuffer(),\n+840 patchTable->GetVaryingPatchIndexBuffer(),\n+841 patchTable->GetPatchParamBuffer());\n+842 }\n+843\n+884 template \n+_\b8_\b8_\b6 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+887 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+888 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+889 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+890 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+891 int numPatchCoords,\n+892 PATCHCOORD_BUFFER *patchCoords,\n+893 PATCH_TABLE *patchTable,\n+894 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+895 void * deviceContext = NULL) {\n+896\n+897 (void)instance; // unused\n+898 (void)deviceContext; // unused\n+899\n+900 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+901 dstBuffer->BindCpuBuffer(), dstDesc,\n+902 duBuffer->BindCpuBuffer(), duDesc,\n+903 dvBuffer->BindCpuBuffer(), dvDesc,\n+904 numPatchCoords,\n+905 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+906 patchTable->GetVaryingPatchArrayBuffer(),\n+907 patchTable->GetVaryingPatchIndexBuffer(),\n+908 patchTable->GetPatchParamBuffer());\n+909 }\n+910\n+969 template \n+_\b9_\b7_\b1 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+972 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+973 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+974 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+975 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+976 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+977 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+978 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+979 int numPatchCoords,\n+980 PATCHCOORD_BUFFER *patchCoords,\n+981 PATCH_TABLE *patchTable,\n+982 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+983 void * deviceContext = NULL) {\n+984\n+985 (void)instance; // unused\n+986 (void)deviceContext; // unused\n+987\n+988 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+989 dstBuffer->BindCpuBuffer(), dstDesc,\n+990 duBuffer->BindCpuBuffer(), duDesc,\n+991 dvBuffer->BindCpuBuffer(), dvDesc,\n+992 duuBuffer->BindCpuBuffer(), duuDesc,\n+993 duvBuffer->BindCpuBuffer(), duvDesc,\n+994 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+995 numPatchCoords,\n+996 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+997 patchTable->GetVaryingPatchArrayBuffer(),\n+998 patchTable->GetVaryingPatchIndexBuffer(),\n+999 patchTable->GetPatchParamBuffer());\n+1000 }\n+1001\n+1032 template \n+_\b1_\b0_\b3_\b4 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1035 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1036 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1037 int numPatchCoords,\n+1038 PATCHCOORD_BUFFER *patchCoords,\n+1039 PATCH_TABLE *patchTable,\n+1040 int fvarChannel,\n+1041 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1042 void * deviceContext = NULL) {\n+1043\n+1044 (void)instance; // unused\n+1045 (void)deviceContext; // unused\n+1046\n+1047 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1048 dstBuffer->BindCpuBuffer(), dstDesc,\n+1049 numPatchCoords,\n+1050 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1051 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1052 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1053 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1054 }\n+1055\n+1098 template \n+_\b1_\b1_\b0_\b0 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1101 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1102 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1103 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1104 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1105 int numPatchCoords,\n+1106 PATCHCOORD_BUFFER *patchCoords,\n+1107 PATCH_TABLE *patchTable,\n+1108 int fvarChannel,\n+1109 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1110 void * deviceContext = NULL) {\n+1111\n+1112 (void)instance; // unused\n+1113 (void)deviceContext; // unused\n+1114\n+1115 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1116 dstBuffer->BindCpuBuffer(), dstDesc,\n+1117 duBuffer->BindCpuBuffer(), duDesc,\n+1118 dvBuffer->BindCpuBuffer(), dvDesc,\n+1119 numPatchCoords,\n+1120 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1121 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1122 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1123 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1124 }\n+1125\n+1186 template \n+_\b1_\b1_\b8_\b8 static bool _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg(\n+1189 SRC_BUFFER *srcBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &srcDesc,\n+1190 DST_BUFFER *dstBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dstDesc,\n+1191 DST_BUFFER *duBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duDesc,\n+1192 DST_BUFFER *dvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvDesc,\n+1193 DST_BUFFER *duuBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duuDesc,\n+1194 DST_BUFFER *duvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &duvDesc,\n+1195 DST_BUFFER *dvvBuffer, _\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br const &dvvDesc,\n+1196 int numPatchCoords,\n+1197 PATCHCOORD_BUFFER *patchCoords,\n+1198 PATCH_TABLE *patchTable,\n+1199 int fvarChannel,\n+1200 _\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br const *instance = NULL,\n+1201 void * deviceContext = NULL) {\n+1202\n+1203 (void)instance; // unused\n+1204 (void)deviceContext; // unused\n+1205\n+1206 return _\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs(srcBuffer->BindCpuBuffer(), srcDesc,\n+1207 dstBuffer->BindCpuBuffer(), dstDesc,\n+1208 duBuffer->BindCpuBuffer(), duDesc,\n+1209 dvBuffer->BindCpuBuffer(), dvDesc,\n+1210 duuBuffer->BindCpuBuffer(), duuDesc,\n+1211 duvBuffer->BindCpuBuffer(), duvDesc,\n+1212 dvvBuffer->BindCpuBuffer(), dvvDesc,\n+1213 numPatchCoords,\n+1214 (const _\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd*)patchCoords->BindCpuBuffer(),\n+1215 patchTable->GetFVarPatchArrayBuffer(fvarChannel),\n+1216 patchTable->GetFVarPatchIndexBuffer(fvarChannel),\n+1217 patchTable->GetFVarPatchParamBuffer(fvarChannel));\n+1218 }\n+1219\n+1225\n+_\b1_\b2_\b2_\b7 static void _\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be(void * /*deviceContext = NULL*/) {\n+1228 // nothing.\n+1229 }\n+1230};\n+1231\n+1232\n+1233} // end namespace Osd\n+1234\n+1235} // end namespace OPENSUBDIV_VERSION\n+1236using namespace OPENSUBDIV_VERSION;\n+1237\n+1238} // end namespace OpenSubdiv\n+1239\n+1240\n+1241#endif // OPENSUBDIV3_OSD_CPU_EVALUATOR_H\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bl_\bi_\bm_\bi_\bt_\bs_\b._\bh_\b:_\b3_\b2\n _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n BufferDescriptor is a struct which describes buffer elements in interleaved\n data buffers....\n D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bs_\bt_\br_\bi_\bd_\be\n-int stride\n-stride to the next element\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b2\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bR_\be_\bs_\be_\bt\n-void Reset()\n-Resets the descriptor to default.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b1\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor()\n-Default Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b4\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br\n-BufferDescriptor(int o, int l, int s)\n-Constructor.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b6_\b7\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bl_\be_\bn_\bg_\bt_\bh\n-int length\n-number or length of the data\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b!_\b=\n-bool operator!=(BufferDescriptor const &other) const\n-True if the descriptors are not identical.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b3\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bp_\be_\br_\ba_\bt_\bo_\br_\b=_\b=\n-bool operator==(BufferDescriptor const &other) const\n-True if the descriptors are identical.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b8_\b6\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bI_\bs_\bV_\ba_\bl_\bi_\bd\n-bool IsValid() const\n-True if the descriptor values are internally consistent.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b5\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bG_\be_\bt_\bL_\bo_\bc_\ba_\bl_\bO_\bf_\bf_\bs_\be_\bt\n-int GetLocalOffset() const\n-Returns the relative offset within a stride.\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b7_\b0\n-_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bB_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b:_\b:_\bo_\bf_\bf_\bs_\be_\bt\n-int offset\n-offset to desired element data\n-D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh_\b:_\b9_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b9\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int\n+fvarChannel, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b0_\b3_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, int fvarChannel, CpuEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b0_\b0\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, int start, int end)\n+Static eval stencils function which takes raw CPU pointers for input and\n+output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bF_\ba_\bc_\be_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesFaceVarying(SRC_BUFFER *srcBuffer, BufferDescriptor\n+const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc,\n+DST_BUFFER *duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, int fvarChannel,\n+CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b1_\b8_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b9_\b7_\b1\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw CPU pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, const int *sizes, const int\n+*offsets, const int *indices, const float *weights, const float *duWeights,\n+const float *dvWeights, const float *duuWeights, const float *duvWeights, const\n+float *dvvWeights, int start, int end)\n+Static eval stencils function with derivatives, which takes raw CPU pointers\n+for input and output.\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, float *duu,\n+BufferDescriptor const &duuDesc, float *duv, BufferDescriptor const &duvDesc,\n+float *dvv, BufferDescriptor const &dvvDesc, int numPatchCoords, PatchCoord\n+const *patchCoords, PatchArray const *patchArrays, const int *patchIndexBuffer,\n+PatchParam const *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int numPatchCoords,\n+PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const\n+*instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b4_\b5_\b4\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, int numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE\n+*patchTable, CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b5_\b1_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, float *du, BufferDescriptor const\n+&duDesc, float *dv, BufferDescriptor const &dvDesc, int numPatchCoords,\n+PatchCoord const *patchCoords, PatchArray const *patchArrays, const int\n+*patchIndexBuffer, PatchParam const *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const\n+&duuDesc, DST_BUFFER *duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER\n+*dvvBuffer, BufferDescriptor const &dvvDesc, STENCIL_TABLE const *stencilTable,\n+const CpuEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b3_\b0_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(const float *src, BufferDescriptor const &srcDesc,\n+float *dst, BufferDescriptor const &dstDesc, int numPatchCoords, const\n+PatchCoord *patchCoords, const PatchArray *patchArrays, const int\n+*patchIndexBuffer, const PatchParam *patchParamBuffer)\n+Static limit eval function. It takes an array of PatchCoord and evaluate limit\n+values on given PatchT...\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void\n+*deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b8_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs_\bV_\ba_\br_\by_\bi_\bn_\bg\n+static bool EvalPatchesVarying(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, int\n+numPatchCoords, PATCHCOORD_BUFFER *patchCoords, PATCH_TABLE *patchTable,\n+CpuEvaluator const *instance=NULL, void *deviceContext=NULL)\n+Generic limit eval function. This function has a same signature as other device\n+kernels have so that ...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b8_\b2_\b3\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bS_\by_\bn_\bc_\bh_\br_\bo_\bn_\bi_\bz_\be\n+static void Synchronize(void *)\n+synchronize all asynchronous computation invoked on this device.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b2_\b2_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE\n+const *stencilTable, const CpuEvaluator *instance=NULL, void\n+*deviceContext=NULL)\n+Generic static eval stencils function. This function has a same signature as\n+other device kernels hav...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b7_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bP_\ba_\bt_\bc_\bh_\be_\bs\n+static bool EvalPatches(SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc,\n+DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER *duBuffer,\n+BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer, BufferDescriptor const\n+&dvDesc, DST_BUFFER *duuBuffer, BufferDescriptor const &duuDesc, DST_BUFFER\n+*duvBuffer, BufferDescriptor const &duvDesc, DST_BUFFER *dvvBuffer,\n+BufferDescriptor const &dvvDesc, int numPatchCoords, PATCHCOORD_BUFFER\n+*patchCoords, PATCH_TABLE *patchTable, CpuEvaluator const *instance=NULL, void\n+*deviceContext=NULL)\n+Generic limit eval function with derivatives. This function has a same\n+signature as other device kern...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b6_\b0_\b7\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bC_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b:_\b:_\bE_\bv_\ba_\bl_\bS_\bt_\be_\bn_\bc_\bi_\bl_\bs\n+static bool EvalStencils(SRC_BUFFER *srcBuffer, BufferDescriptor const\n+&srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, DST_BUFFER\n+*duBuffer, BufferDescriptor const &duDesc, DST_BUFFER *dvBuffer,\n+BufferDescriptor const &dvDesc, STENCIL_TABLE const *stencilTable, const\n+CpuEvaluator *instance=NULL, void *deviceContext=NULL)\n+Generic static eval stencils function with derivatives. This function has a\n+same signature as other d...\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh_\b:_\b1_\b6_\b8\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bC_\bo_\bo_\br_\bd\n+Coordinates set on a patch table.\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b4_\b2\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bA_\br_\br_\ba_\by\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b6_\b6\n+_\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bO_\bs_\bd_\b:_\b:_\bP_\ba_\bt_\bc_\bh_\bP_\ba_\br_\ba_\bm\n+D\bDe\bef\bfi\bin\bni\bit\bti\bio\bon\bn _\bt_\by_\bp_\be_\bs_\b._\bh_\b:_\b1_\b2_\b7\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bo_\bs_\bd\n- * _\bb_\bu_\bf_\bf_\be_\br_\bD_\be_\bs_\bc_\br_\bi_\bp_\bt_\bo_\br_\b._\bh\n+ * _\bc_\bp_\bu_\bE_\bv_\ba_\bl_\bu_\ba_\bt_\bo_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00908.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00908.html", "unified_diff": "@@ -280,15 +280,15 @@\n \n \n \n \n
typedef Vtr::ConstArray<PatchDescriptor> ConstPatchDescriptorArray
\n
\n \n-

Definition at line 146 of file patchDescriptor.h.

\n+

Definition at line 146 of file patchDescriptor.h.

\n \n
\n \n \n

◆ ConstPatchParamArray

\n \n
\n@@ -296,15 +296,15 @@\n \n \n \n \n
typedef Vtr::ConstArray<PatchParam> ConstPatchParamArray
\n
\n \n-

Definition at line 246 of file patchParam.h.

\n+

Definition at line 246 of file patchParam.h.

\n \n
\n \n \n

◆ ErrorCallbackFunc

\n \n
\n@@ -394,15 +394,15 @@\n \n \n \n \n
typedef Vtr::Array<PatchParam> PatchParamArray
\n
\n \n-

Definition at line 245 of file patchParam.h.

\n+

Definition at line 245 of file patchParam.h.

\n \n
\n \n \n

◆ PatchParamTable

\n \n
\n@@ -410,15 +410,15 @@\n \n \n \n \n
typedef std::vector<PatchParam> PatchParamTable
\n
\n \n-

Definition at line 243 of file patchParam.h.

\n+

Definition at line 243 of file patchParam.h.

\n \n
\n \n \n

◆ WarningCallbackFunc

\n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00912.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00912.html", "unified_diff": "@@ -294,15 +294,15 @@\n \n \n \n \n
typedef MeshInterface<D3D11PatchTable> D3D11MeshInterface
\n
\n \n-

Definition at line 38 of file d3d11Mesh.h.

\n+

Definition at line 38 of file d3d11Mesh.h.

\n \n
\n \n \n

◆ GLMeshInterface

\n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00961.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00961.html", "unified_diff": "@@ -97,15 +97,15 @@\n
Tessellation Class Reference
\n
\n
\n \n

Encapsulates a specific tessellation pattern of a Parameterization. \n More...

\n \n-

#include <tessellation.h>

\n+

#include <tessellation.h>

\n \n \n \n \n \n

\n Classes

class  Options
 Options configure a Tessellation to specify the nature of both its results and the structure of the coordinate and facet index arrays that its methods will populate. More...
 
\n@@ -219,15 +219,15 @@\n \n
 
\n

Detailed Description

\n

Encapsulates a specific tessellation pattern of a Parameterization.

\n

Tessellation is a simple class that encapsulates a specified tessellation pattern for a given Parameterization. Tessellation parameters are given on construction and are fixed for its lifetime.

\n

Methods allow inspection of the pattern in terms of the 2D coordinates of the points comprising the pattern and the faces that connect them. The 2D coordinates are referred to both in the documentation and the interface as \"coords\" while the faces connecting them are referred to as \"facets\" (to distinguish from the faces of the mesh, to which a Tessellation is applied).

\n \n-

Definition at line 51 of file tessellation.h.

\n+

Definition at line 51 of file tessellation.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Tessellation() [1/4]

\n \n
\n
\n \n@@ -445,15 +445,15 @@\n inline\n \n
\n
\n \n

Retrieve the coordinates for the entire pattern.

\n \n-

Definition at line 372 of file tessellation.h.

\n+

Definition at line 372 of file tessellation.h.

\n \n
\n
\n \n

◆ GetCoordStride()

\n \n
\n@@ -474,15 +474,15 @@\n inline

\n
\n \n

Return the number of elements between each coordinate.

\n \n-

Definition at line 208 of file tessellation.h.

\n+

Definition at line 208 of file tessellation.h.

\n \n
\n \n \n

◆ GetEdgeCoords()

\n \n
\n@@ -535,15 +535,15 @@\n inline
\n
\n \n

Return the size of the face.

\n \n-

Definition at line 182 of file tessellation.h.

\n+

Definition at line 182 of file tessellation.h.

\n \n
\n \n \n

◆ GetFacets()

\n \n
\n@@ -584,15 +584,15 @@\n inline \n \n \n
\n \n

Return the number of indices assigned to each facet.

\n \n-

Definition at line 258 of file tessellation.h.

\n+

Definition at line 258 of file tessellation.h.

\n \n
\n \n \n

◆ GetFacetStride()

\n \n
\n@@ -613,15 +613,15 @@\n inline \n \n \n
\n \n

Return the number of elements between each facet.

\n \n-

Definition at line 261 of file tessellation.h.

\n+

Definition at line 261 of file tessellation.h.

\n \n
\n \n \n

◆ GetInteriorCoords()

\n \n
\n@@ -664,15 +664,15 @@\n inline \n \n \n
\n \n

Return the number of boundary coordinates.

\n \n-

Definition at line 211 of file tessellation.h.

\n+

Definition at line 211 of file tessellation.h.

\n \n
\n \n \n

◆ GetNumCoords()

\n \n
\n@@ -693,15 +693,15 @@\n inline \n \n \n
\n \n

Return the number of coordinates in the entire pattern.

\n \n-

Definition at line 205 of file tessellation.h.

\n+

Definition at line 205 of file tessellation.h.

\n \n
\n \n \n

◆ GetNumEdgeCoords()

\n \n
\n@@ -723,15 +723,15 @@\n inline \n \n \n
\n \n

Return the number of coordinates within a given edge (excluding those at its end vertices)

\n \n-

Definition at line 218 of file tessellation.h.

\n+

Definition at line 218 of file tessellation.h.

\n \n
\n \n \n

◆ GetNumFacets()

\n \n
\n@@ -752,15 +752,15 @@\n inline \n \n \n
\n \n

Return the number of facets in the entire pattern.

\n \n-

Definition at line 255 of file tessellation.h.

\n+

Definition at line 255 of file tessellation.h.

\n \n
\n \n \n

◆ GetNumInteriorCoords()

\n \n
\n@@ -781,15 +781,15 @@\n inline \n \n \n
\n \n

Return the number of interior coordinates.

\n \n-

Definition at line 214 of file tessellation.h.

\n+

Definition at line 214 of file tessellation.h.

\n \n
\n \n \n

◆ GetParameterization()

\n \n
\n@@ -810,15 +810,15 @@\n inline \n \n \n
\n \n

Return the Parameterization.

\n \n-

Definition at line 179 of file tessellation.h.

\n+

Definition at line 179 of file tessellation.h.

\n \n
\n \n \n

◆ GetRates()

\n \n
\n@@ -872,15 +872,15 @@\n inline \n \n \n
\n \n

Retrieve the coordinate for a given vertex of the face.

\n \n-

Definition at line 365 of file tessellation.h.

\n+

Definition at line 365 of file tessellation.h.

\n \n
\n \n \n

◆ IsUniform()

\n \n
\n@@ -901,15 +901,15 @@\n inline \n \n \n
\n \n

Return if the pattern is uniform.

\n \n-

Definition at line 188 of file tessellation.h.

\n+

Definition at line 188 of file tessellation.h.

\n \n
\n \n \n

◆ IsValid()

\n \n
\n@@ -930,15 +930,15 @@\n inline \n \n \n
\n \n

Return true if correctly initialized.

\n \n-

Definition at line 162 of file tessellation.h.

\n+

Definition at line 162 of file tessellation.h.

\n \n
\n \n \n

◆ operator=()

\n \n
\n@@ -1063,15 +1063,15 @@\n
\n \n

Reassign indices of boundary coordinates while offseting those of interior coordinates.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • Tessellation
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00965.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00965.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    Tessellation::Options Class Reference
    \n
\n
\n \n

Options configure a Tessellation to specify the nature of both its results and the structure of the coordinate and facet index arrays that its methods will populate. \n More...

\n \n-

#include <tessellation.h>

\n+

#include <tessellation.h>

\n \n \n \n \n \n \n@@ -132,15 +132,15 @@\n \n

\n Public Member Functions

 Options ()
 
OptionsPreserveQuads (bool on)
 Select preservation of quads for quad-based subdivision (requires 4-sided facets, default is off)
 
\n

Detailed Description

\n

Options configure a Tessellation to specify the nature of both its results and the structure of the coordinate and facet index arrays that its methods will populate.

\n

The sizes and strides of the target arrays should be specified explicitly as they are not inferred by the presence of other options.

\n

Modifiers of Options return a reference to itself to facilitate inline usage.

\n \n-

Definition at line 65 of file tessellation.h.

\n+

Definition at line 65 of file tessellation.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n \n@@ -157,15 +157,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 67 of file tessellation.h.

\n+

Definition at line 67 of file tessellation.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetCoordStride()

\n \n@@ -187,15 +187,15 @@\n inline \n \n \n
\n \n

Return the stride between (u,v) pairs.

\n \n-

Definition at line 90 of file tessellation.h.

\n+

Definition at line 90 of file tessellation.h.

\n \n
\n \n \n

◆ GetFacetSize()

\n \n
\n@@ -214,15 +214,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 80 of file tessellation.h.

\n+

Definition at line 80 of file tessellation.h.

\n \n
\n \n \n

◆ GetFacetStride()

\n \n
\n@@ -243,15 +243,15 @@\n inline \n \n \n
\n \n

Return the stride between facets.

\n \n-

Definition at line 85 of file tessellation.h.

\n+

Definition at line 85 of file tessellation.h.

\n \n
\n \n \n

◆ PreserveQuads() [1/2]

\n \n
\n@@ -272,15 +272,15 @@\n inline \n \n \n
\n \n

Return if preservation of quads is set.

\n \n-

Definition at line 74 of file tessellation.h.

\n+

Definition at line 74 of file tessellation.h.

\n \n
\n \n \n

◆ PreserveQuads() [2/2]

\n \n
\n@@ -302,15 +302,15 @@\n inline \n \n \n
\n \n

Select preservation of quads for quad-based subdivision (requires 4-sided facets, default is off)

\n \n-

Definition at line 343 of file tessellation.h.

\n+

Definition at line 343 of file tessellation.h.

\n \n
\n \n \n

◆ SetCoordStride()

\n \n
\n@@ -332,15 +332,15 @@\n inline \n \n \n
\n \n

Assign the stride between (u,v) pairs (default is 2)

\n \n-

Definition at line 358 of file tessellation.h.

\n+

Definition at line 358 of file tessellation.h.

\n \n
\n \n \n

◆ SetFacetSize()

\n \n
\n@@ -362,15 +362,15 @@\n inline \n \n \n
\n \n

Assign the number of indices per facet (must be 3 or 4, default is 3)

\n \n-

Definition at line 348 of file tessellation.h.

\n+

Definition at line 348 of file tessellation.h.

\n \n
\n \n \n

◆ SetFacetStride()

\n \n
\n@@ -392,20 +392,20 @@\n inline \n \n \n
\n \n

Assign the stride between facets (default is facet size)

\n \n-

Definition at line 353 of file tessellation.h.

\n+

Definition at line 353 of file tessellation.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • Tessellation
  • Options
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00969.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00969.html", "unified_diff": "@@ -96,15 +96,15 @@\n
    VertexDescriptor Class Reference
    \n
\n
\n \n

Simple class used by subclasses of SurfaceFactory to describe a vertex. \n More...

\n \n-

#include <vertexDescriptor.h>

\n+

#include <vertexDescriptor.h>

\n \n \n \n \n \n@@ -178,15 +178,15 @@\n \n

\n Public Member Functions

Methods to begin and end specification

Partially constructed instances are populated using a set of methods between calls to Initialize() and Finalize(). Both return false to indicate failure due to invalid input, or the instance can be inspected after each to determine if valid.

\n
bool Initialize (int numIncidentFaces)
 
\n

Detailed Description

\n

Simple class used by subclasses of SurfaceFactory to describe a vertex.

\n

VertexDescriptor is a simple class used by SurfaceFactory and its subclasses to provide a complete topological description around the vertex of a face, i.e. its valence, the sizes of its incident faces, sharpness values, etc.

\n

Instances are created and partially initialized by SurfaceFactory before being passed to its subclasses to be fully populated. So public construction is not available (or useful).

\n \n-

Definition at line 131 of file vertexDescriptor.h.

\n+

Definition at line 131 of file vertexDescriptor.h.

\n

Member Function Documentation

\n \n

◆ ClearEdgeSharpness()

\n \n
\n
\n \n@@ -205,15 +205,15 @@\n inline\n \n
\n
\n \n

Remove any sharpness assigned to the incident edges.

\n \n-

Definition at line 398 of file vertexDescriptor.h.

\n+

Definition at line 398 of file vertexDescriptor.h.

\n \n
\n
\n \n

◆ ClearIncidentFaceSizes()

\n \n
\n@@ -234,15 +234,15 @@\n inline \n \n \n
\n \n

Remove any assigned sizes of incident faces.

\n \n-

Definition at line 350 of file vertexDescriptor.h.

\n+

Definition at line 350 of file vertexDescriptor.h.

\n \n
\n
\n \n

◆ ClearVertexSharpness()

\n \n
\n@@ -263,15 +263,15 @@\n inline \n \n \n
\n \n

Remove any sharpness assigned to the vertex.

\n \n-

Definition at line 377 of file vertexDescriptor.h.

\n+

Definition at line 377 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ Finalize()

\n \n
\n@@ -328,15 +328,15 @@\n inline \n \n \n
\n \n

Return the sharpness assigned to edges of an incident face.

\n \n-

Definition at line 436 of file vertexDescriptor.h.

\n+

Definition at line 436 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ GetIncidentFaceSize()

\n \n
\n@@ -358,15 +358,15 @@\n inline \n \n \n
\n \n

Return the size of an incident face.

\n \n-

Definition at line 362 of file vertexDescriptor.h.

\n+

Definition at line 362 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ GetManifoldEdgeSharpness()

\n \n
\n@@ -388,15 +388,15 @@\n inline \n \n \n
\n \n

Return the sharpness assigned to a manifold edge.

\n \n-

Definition at line 420 of file vertexDescriptor.h.

\n+

Definition at line 420 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ GetVertexSharpness()

\n \n
\n@@ -417,15 +417,15 @@\n inline \n \n \n
\n \n

Return the sharpness of the vertex.

\n \n-

Definition at line 386 of file vertexDescriptor.h.

\n+

Definition at line 386 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ HasEdgeSharpness()

\n \n
\n@@ -446,15 +446,15 @@\n inline \n \n \n
\n \n

Return if sharpness was assigned to the incident edges.

\n \n-

Definition at line 394 of file vertexDescriptor.h.

\n+

Definition at line 394 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ HasIncidentFaceSizes()

\n \n
\n@@ -475,15 +475,15 @@\n inline \n \n \n
\n \n

Return if the sizes of incident faces are assigned.

\n \n-

Definition at line 346 of file vertexDescriptor.h.

\n+

Definition at line 346 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ HasVertexSharpness()

\n \n
\n@@ -504,15 +504,15 @@\n inline \n \n \n
\n \n

Return if sharpness was assigned to the vertex.

\n \n-

Definition at line 373 of file vertexDescriptor.h.

\n+

Definition at line 373 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ Initialize()

\n \n
\n@@ -553,15 +553,15 @@\n inline \n \n \n
\n \n

Return if vertex neighborhood is on a boundary.

\n \n-

Definition at line 338 of file vertexDescriptor.h.

\n+

Definition at line 338 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ IsManifold()

\n \n
\n@@ -582,15 +582,15 @@\n inline \n \n \n
\n \n

Return if vertex neighborhood is manifold.

\n \n-

Definition at line 329 of file vertexDescriptor.h.

\n+

Definition at line 329 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ IsValid()

\n \n
\n@@ -611,15 +611,15 @@\n inline \n \n \n
\n \n

Return if instance is valid.

\n \n-

Definition at line 320 of file vertexDescriptor.h.

\n+

Definition at line 320 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetBoundary()

\n \n
\n@@ -641,15 +641,15 @@\n inline \n \n \n
\n \n

Declare the vertex neighborhood as being on a boundary.

\n \n-

Definition at line 334 of file vertexDescriptor.h.

\n+

Definition at line 334 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetIncidentFaceEdgeSharpness()

\n \n
\n@@ -696,15 +696,15 @@\n faceIndexIndex of the incident face \n leadingEdgeSharpSharpness to assign to the leading edge of the incident face, i.e. the edge of the face following the vertex. \n trailingEdgeSharpSharpness to assign to the trailing edge of the incident face, i.e. the edge of the face preceding the vertex. \n \n \n \n \n-

Definition at line 427 of file vertexDescriptor.h.

\n+

Definition at line 427 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetIncidentFaceSize()

\n \n
\n@@ -736,15 +736,15 @@\n inline \n \n \n
\n \n

Assign the size of an incident face.

\n \n-

Definition at line 355 of file vertexDescriptor.h.

\n+

Definition at line 355 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetManifold()

\n \n
\n@@ -766,15 +766,15 @@\n inline \n \n \n
\n \n

Declare the vertex neighborhood as manifold (ordered)

\n \n-

Definition at line 325 of file vertexDescriptor.h.

\n+

Definition at line 325 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetManifoldEdgeSharpness()

\n \n
\n@@ -814,15 +814,15 @@\n \n \n \n
edgeIndexIndex of the edge in the ordered sequence
edgeSharpnessSharpness to be assigned to the edge
\n \n \n \n-

Definition at line 403 of file vertexDescriptor.h.

\n+

Definition at line 403 of file vertexDescriptor.h.

\n \n
\n \n \n

◆ SetVertexSharpness()

\n \n
\n@@ -844,20 +844,20 @@\n inline \n \n \n
\n \n

Assign sharpness to the vertex.

\n \n-

Definition at line 382 of file vertexDescriptor.h.

\n+

Definition at line 382 of file vertexDescriptor.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Bfr
  • VertexDescriptor
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00973.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00973.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    PatchDescriptor Class Reference
    \n
\n
\n \n

Describes the type of a patch. \n More...

\n \n-

#include <patchDescriptor.h>

\n+

#include <patchDescriptor.h>

\n \n \n \n \n

\n Public Types

enum  Type {
\n   NON_PATCH = 0\n ,
\n   POINTS\n@@ -192,15 +192,15 @@\n
 Returns a vector of all the legal patch descriptors for the given adaptive subdivision scheme.
 
\n

Detailed Description

\n

Describes the type of a patch.

\n

Uniquely identifies all the different types of patches

\n \n-

Definition at line 44 of file patchDescriptor.h.

\n+

Definition at line 44 of file patchDescriptor.h.

\n

Member Enumeration Documentation

\n \n

◆ Type

\n \n
\n
\n \n@@ -226,15 +226,15 @@\n \n \n \n \n \n
GREGORY 
GREGORY_BOUNDARY 
GREGORY_BASIS 
GREGORY_TRIANGLE 
\n \n-

Definition at line 48 of file patchDescriptor.h.

\n+

Definition at line 48 of file patchDescriptor.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ PatchDescriptor() [1/3]

\n \n@@ -256,15 +256,15 @@\n inline \n \n \n
\n \n

Default constructor.

\n \n-

Definition at line 69 of file patchDescriptor.h.

\n+

Definition at line 69 of file patchDescriptor.h.

\n \n
\n \n \n

◆ PatchDescriptor() [2/3]

\n \n
\n@@ -286,15 +286,15 @@\n inline \n \n \n
\n \n

Constructor.

\n \n-

Definition at line 73 of file patchDescriptor.h.

\n+

Definition at line 73 of file patchDescriptor.h.

\n \n
\n \n \n

◆ PatchDescriptor() [3/3]

\n \n
\n@@ -316,15 +316,15 @@\n inline \n \n \n
\n \n

Copy Constructor.

\n \n-

Definition at line 77 of file patchDescriptor.h.

\n+

Definition at line 77 of file patchDescriptor.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ GetAdaptivePatchDescriptors()

\n \n@@ -374,15 +374,15 @@\n inlinestatic \n \n \n
\n \n

Number of control vertices of Gregory patch basis (20)

\n \n-

Definition at line 126 of file patchDescriptor.h.

\n+

Definition at line 126 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetGregoryPatchSize()

\n \n
\n@@ -403,15 +403,15 @@\n inlinestatic \n \n \n
\n \n

Number of control vertices of Gregory (and Gregory Boundary) Patches in table.

\n \n-

Definition at line 123 of file patchDescriptor.h.

\n+

Definition at line 123 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetNumControlVertices() [1/2]

\n \n
\n@@ -432,15 +432,15 @@\n inline \n \n \n
\n \n

Returns the number of control vertices expected for a patch of the type described.

\n \n-

Definition at line 110 of file patchDescriptor.h.

\n+

Definition at line 110 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetNumControlVertices() [2/2]

\n \n
\n@@ -462,15 +462,15 @@\n inlinestatic \n \n \n
\n \n

Returns the number of control vertices expected for a patch of the type described.

\n \n-

Definition at line 150 of file patchDescriptor.h.

\n+

Definition at line 150 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetNumFVarControlVertices() [1/2]

\n \n
\n@@ -492,15 +492,15 @@\n \n \n
\n \n

Deprecated.

\n
See also
PatchDescriptor::GetNumControlVertices
\n \n-

Definition at line 115 of file patchDescriptor.h.

\n+

Definition at line 115 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetNumFVarControlVertices() [2/2]

\n \n
\n@@ -523,15 +523,15 @@\n \n \n
\n \n

Deprecated.

\n
See also
PatchDescriptor::GetNumControlVertices
\n \n-

Definition at line 168 of file patchDescriptor.h.

\n+

Definition at line 168 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetRegularPatchSize()

\n \n
\n@@ -552,15 +552,15 @@\n inlinestatic \n \n \n
\n \n

Number of control vertices of Regular Patches in table.

\n \n-

Definition at line 120 of file patchDescriptor.h.

\n+

Definition at line 120 of file patchDescriptor.h.

\n \n
\n \n \n

◆ GetType()

\n \n
\n@@ -581,15 +581,15 @@\n inline \n \n \n
\n \n

Returns the type of the patch.

\n \n-

Definition at line 87 of file patchDescriptor.h.

\n+

Definition at line 87 of file patchDescriptor.h.

\n \n
\n \n \n

◆ IsAdaptive() [1/2]

\n \n
\n@@ -610,15 +610,15 @@\n inline \n \n \n
\n \n

Returns true if the type is an adaptive patch.

\n \n-

Definition at line 97 of file patchDescriptor.h.

\n+

Definition at line 97 of file patchDescriptor.h.

\n \n
\n \n \n

◆ IsAdaptive() [2/2]

\n \n
\n@@ -640,15 +640,15 @@\n inlinestatic \n \n \n
\n \n

Returns true if the type is an adaptive (non-linear) patch.

\n \n-

Definition at line 92 of file patchDescriptor.h.

\n+

Definition at line 92 of file patchDescriptor.h.

\n \n
\n \n \n

◆ operator<()

\n \n
\n@@ -670,15 +670,15 @@\n inline \n \n \n
\n \n

Allows ordering of patches by type.

\n \n-

Definition at line 173 of file patchDescriptor.h.

\n+

Definition at line 173 of file patchDescriptor.h.

\n \n
\n \n \n

◆ operator=()

\n \n
\n@@ -700,15 +700,15 @@\n inline \n \n \n
\n \n

Assignment operator.

\n \n-

Definition at line 81 of file patchDescriptor.h.

\n+

Definition at line 81 of file patchDescriptor.h.

\n \n
\n \n \n

◆ operator==()

\n \n
\n@@ -730,15 +730,15 @@\n inline \n \n \n
\n \n

True if the descriptors are identical.

\n \n-

Definition at line 180 of file patchDescriptor.h.

\n+

Definition at line 180 of file patchDescriptor.h.

\n \n
\n \n \n

◆ print()

\n \n
\n@@ -752,15 +752,15 @@\n \n \n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchDescriptor
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00977.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00977.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    PatchMap Class Reference
    \n
\n
\n \n

An quadtree-based map connecting coarse faces to their sub-patches. \n More...

\n \n-

#include <patchMap.h>

\n+

#include <patchMap.h>

\n \n \n \n \n

\n Public Types

typedef PatchTable::PatchHandle Handle
 
\n \n

\n@@ -120,29 +120,29 @@\n

 
\n

Detailed Description

\n

An quadtree-based map connecting coarse faces to their sub-patches.

\n

PatchTable::PatchArrays contain lists of patches that represent the limit surface of a mesh, sorted by their topological type. These arrays break the connection between coarse faces and their sub-patches.

\n

The PatchMap provides a quad-tree based lookup structure that, given a singular parametric location, can efficiently return a handle to the sub-patch that contains this location.

\n \n-

Definition at line 49 of file patchMap.h.

\n+

Definition at line 49 of file patchMap.h.

\n

Member Typedef Documentation

\n \n

◆ Handle

\n \n
\n
\n \n \n \n \n
typedef PatchTable::PatchHandle Handle
\n
\n \n-

Definition at line 52 of file patchMap.h.

\n+

Definition at line 52 of file patchMap.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ PatchMap()

\n \n@@ -218,20 +218,20 @@\n uLocal u parameter\n vLocal v parameter\n \n \n \n
Returns
A patch handle or 0 if the face is not supported (index out of bounds) or is tagged as a hole
\n \n-

Definition at line 193 of file patchMap.h.

\n+

Definition at line 193 of file patchMap.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <patchMap.h>

\n+

#include <patchMap.h>

\n \n \n \n \n \n \n \n \n

\n Public Attributes

unsigned int isSet: 1
 
unsigned int isLeaf: 1
 
unsigned int index: 30
 
\n

Detailed Description

\n
\n-

Definition at line 85 of file patchMap.h.

\n+

Definition at line 85 of file patchMap.h.

\n

Member Data Documentation

\n \n

◆ index

\n \n
\n
\n \n \n \n \n
unsigned int index
\n
\n \n-

Definition at line 88 of file patchMap.h.

\n+

Definition at line 88 of file patchMap.h.

\n \n
\n
\n \n

◆ isLeaf

\n \n
\n@@ -137,15 +137,15 @@\n \n \n \n \n
unsigned int isLeaf
\n
\n \n-

Definition at line 87 of file patchMap.h.

\n+

Definition at line 87 of file patchMap.h.

\n \n
\n
\n \n

◆ isSet

\n \n
\n@@ -153,20 +153,20 @@\n \n \n \n \n
unsigned int isSet
\n
\n \n-

Definition at line 86 of file patchMap.h.

\n+

Definition at line 86 of file patchMap.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchMap
  • QuadNode
  • Child
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00989.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00989.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    PatchParam Struct Reference
    \n
\n
\n \n

Patch parameterization. \n More...

\n \n-

#include <patchParam.h>

\n+

#include <patchParam.h>

\n
\n Inheritance diagram for PatchParam:
\n
\n
\n \"\"/\n \n \"PatchParam\"\n@@ -249,15 +249,15 @@\n | \\ | \\ | | \\ | \\\n | L1 \\ | L1 \\ | | L1 \\ | L1 \\\n | \\ | \\ | | \\ | \\\n |0,0 \\ |1,0 \\ | | \\ | \\\n +---------------+---------------+ +---------------+---------------+\n (0,0) (1,0) (0,0,1) (1,0,0)\n \n-

Definition at line 152 of file patchParam.h.

\n+

Definition at line 152 of file patchParam.h.

\n

Member Function Documentation

\n \n

◆ Clear()

\n \n
\n
\n \n@@ -276,15 +276,15 @@\n inline\n \n
\n
\n \n

Resets everything to 0.

\n \n-

Definition at line 174 of file patchParam.h.

\n+

Definition at line 174 of file patchParam.h.

\n \n
\n
\n \n

◆ GetBoundary()

\n \n
\n@@ -305,15 +305,15 @@\n inline \n \n \n
\n \n

Returns the boundary edge encoding for the patch.

\n \n-

Definition at line 191 of file patchParam.h.

\n+

Definition at line 191 of file patchParam.h.

\n \n
\n
\n \n

◆ GetDepth()

\n \n
\n@@ -334,15 +334,15 @@\n inline \n \n \n
\n \n

Returns the level of subdivision of the patch.

\n \n-

Definition at line 197 of file patchParam.h.

\n+

Definition at line 197 of file patchParam.h.

\n \n
\n
\n \n

◆ GetFaceId()

\n \n
\n@@ -363,15 +363,15 @@\n inline \n \n \n
\n \n

Returns the faceid.

\n \n-

Definition at line 177 of file patchParam.h.

\n+

Definition at line 177 of file patchParam.h.

\n \n
\n \n \n

◆ GetParamFraction()

\n \n
\n@@ -392,15 +392,15 @@\n inline \n \n \n
\n \n

Returns the fraction of unit parametric space covered by this face.

\n \n-

Definition at line 265 of file patchParam.h.

\n+

Definition at line 265 of file patchParam.h.

\n \n
\n \n \n

◆ GetTransition()

\n \n
\n@@ -421,15 +421,15 @@\n inline \n \n \n
\n \n

Returns the transition edge encoding for the patch.

\n \n-

Definition at line 188 of file patchParam.h.

\n+

Definition at line 188 of file patchParam.h.

\n \n
\n \n \n

◆ GetU()

\n \n
\n@@ -450,15 +450,15 @@\n inline \n \n \n
\n \n

Returns the log2 value of the u parameter at the first corner of the patch.

\n \n-

Definition at line 181 of file patchParam.h.

\n+

Definition at line 181 of file patchParam.h.

\n \n
\n \n \n

◆ GetV()

\n \n
\n@@ -479,15 +479,15 @@\n inline \n \n \n
\n \n

Returns the log2 value of the v parameter at the first corner of the patch.

\n \n-

Definition at line 185 of file patchParam.h.

\n+

Definition at line 185 of file patchParam.h.

\n \n
\n \n \n

◆ IsRegular()

\n \n
\n@@ -508,15 +508,15 @@\n inline \n \n \n
\n \n

Returns whether the patch is regular.

\n \n-

Definition at line 228 of file patchParam.h.

\n+

Definition at line 228 of file patchParam.h.

\n \n
\n \n \n

◆ IsTriangleRotated()

\n \n
\n@@ -537,15 +537,15 @@\n inline \n \n \n
\n \n

Returns if a triangular patch is parametrically rotated 180 degrees.

\n \n-

Definition at line 290 of file patchParam.h.

\n+

Definition at line 290 of file patchParam.h.

\n \n
\n \n \n

◆ NonQuadRoot()

\n \n
\n@@ -566,15 +566,15 @@\n inline \n \n \n
\n \n

True if the parent base face is a non-quad.

\n \n-

Definition at line 194 of file patchParam.h.

\n+

Definition at line 194 of file patchParam.h.

\n \n
\n \n \n

◆ Normalize()

\n \n
\n@@ -615,15 +615,15 @@\n \n \n \n
uu parameter
vv parameter
\n \n \n \n-

Definition at line 271 of file patchParam.h.

\n+

Definition at line 271 of file patchParam.h.

\n \n
\n \n \n

◆ NormalizeTriangle()

\n \n
\n@@ -655,15 +655,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 297 of file patchParam.h.

\n+

Definition at line 297 of file patchParam.h.

\n \n
\n \n \n

◆ Set()

\n \n
\n@@ -744,15 +744,15 @@\n boundary5-bits identifying boundary edges (and verts for tris) \n transition4-bits identifying transition edges\n regularwhether the patch is regular \n \n \n \n \n-

Definition at line 249 of file patchParam.h.

\n+

Definition at line 249 of file patchParam.h.

\n \n
\n \n \n

◆ Unnormalize()

\n \n
\n@@ -793,15 +793,15 @@\n \n \n \n
uu parameter
vv parameter
\n \n \n \n-

Definition at line 281 of file patchParam.h.

\n+

Definition at line 281 of file patchParam.h.

\n \n
\n \n \n

◆ UnnormalizeTriangle()

\n \n
\n@@ -833,15 +833,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 312 of file patchParam.h.

\n+

Definition at line 312 of file patchParam.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ field0

\n \n@@ -850,15 +850,15 @@\n \n \n \n \n
unsigned int field0
\n
\n \n-

Definition at line 230 of file patchParam.h.

\n+

Definition at line 230 of file patchParam.h.

\n \n
\n \n \n

◆ field1

\n \n
\n@@ -866,20 +866,20 @@\n \n \n \n \n
unsigned int field1
\n
\n \n-

Definition at line 231 of file patchParam.h.

\n+

Definition at line 231 of file patchParam.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchParam
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00993.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00993.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    PatchTable Class Reference
    \n
\n
\n \n

Container for arrays of parametric patches. \n More...

\n \n-

#include <patchTable.h>

\n+

#include <patchTable.h>

\n \n \n \n \n \n

\n Classes

class  PatchHandle
 Handle that can be used as unique patch identifier within PatchTable. More...
 
\n@@ -420,15 +420,15 @@\n
\n

Detailed Description

\n

Container for arrays of parametric patches.

\n

PatchTable contains topology and parametric information about the patches generated by the Refinement process. Patches in the table are sorted into arrays based on their PatchDescriptor Type.

\n

Note : PatchTable can be accessed either using a PatchHandle or a combination of array and patch indices.

\n

XXXX manuelk we should add a PatchIterator that can dereference into a PatchHandle for fast linear traversal of the table

\n \n-

Definition at line 55 of file patchTable.h.

\n+

Definition at line 55 of file patchTable.h.

\n

Member Typedef Documentation

\n \n

◆ ConstQuadOffsetsArray

\n \n
\n
\n \n@@ -436,15 +436,15 @@\n \n \n
typedef Vtr::ConstArray<unsigned int> ConstQuadOffsetsArray
\n
\n \n

Accessors for the gregory patch evaluation buffers. These methods will be deprecated.

\n \n-

Definition at line 259 of file patchTable.h.

\n+

Definition at line 259 of file patchTable.h.

\n \n
\n
\n \n

◆ PatchVertsTable

\n \n
\n@@ -452,15 +452,15 @@\n \n \n \n \n
typedef std::vector<Index> PatchVertsTable
\n
\n \n-

Definition at line 375 of file patchTable.h.

\n+

Definition at line 375 of file patchTable.h.

\n \n
\n
\n \n

◆ QuadOffsetsTable

\n \n
\n@@ -468,15 +468,15 @@\n \n \n \n \n
typedef std::vector<unsigned int> QuadOffsetsTable
\n
\n \n-

Definition at line 389 of file patchTable.h.

\n+

Definition at line 389 of file patchTable.h.

\n \n
\n \n \n

◆ VertexValenceTable

\n \n
\n@@ -484,15 +484,15 @@\n \n \n \n \n
typedef std::vector<Index> VertexValenceTable
\n
\n \n-

Definition at line 264 of file patchTable.h.

\n+

Definition at line 264 of file patchTable.h.

\n \n
\n \n

Constructor & Destructor Documentation

\n \n

◆ PatchTable() [1/2]

\n \n@@ -601,15 +601,15 @@\n srcBuffer with primvar data for the base and refined vertex values\n dstDestination buffer for the computed local point vertex values\n \n \n \n

For more flexibility computing local vertex points, retrieval of the local point stencil table and use of its public methods is recommended or often required.

\n \n-

Definition at line 826 of file patchTable.h.

\n+

Definition at line 826 of file patchTable.h.

\n \n \n \n \n

◆ ComputeLocalPointValuesFaceVarying()

\n \n
\n@@ -658,15 +658,15 @@\n dstDestination buffer for the computed local point face-varying values\n channelface-varying channel\n \n \n \n

For more flexibility computing local face-varying points, retrieval of the local point face-varying stencil table and use of its public methods is recommended or often required.

\n \n-

Definition at line 844 of file patchTable.h.

\n+

Definition at line 844 of file patchTable.h.

\n \n
\n \n \n

◆ ComputeLocalPointValuesVarying()

\n \n
\n@@ -708,15 +708,15 @@\n srcBuffer with primvar data for the base and refined varying values\n dstDestination buffer for the computed local point varying values\n \n \n \n

For more flexibility computing local varying points, retrieval of the local point varying stencil table and use of its public methods is recommended or often required.

\n \n-

Definition at line 835 of file patchTable.h.

\n+

Definition at line 835 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasis() [1/3]

\n \n
\n@@ -790,15 +790,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 865 of file patchTable.h.

\n+

Definition at line 865 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasis() [2/3]

\n \n
\n@@ -872,15 +872,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 858 of file patchTable.h.

\n+

Definition at line 858 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasis() [3/3]

\n \n
\n@@ -1048,15 +1048,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 895 of file patchTable.h.

\n+

Definition at line 895 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasisFaceVarying() [2/3]

\n \n
\n@@ -1136,15 +1136,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 888 of file patchTable.h.

\n+

Definition at line 888 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasisFaceVarying() [3/3]

\n \n
\n@@ -1313,15 +1313,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 880 of file patchTable.h.

\n+

Definition at line 880 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasisVarying() [2/3]

\n \n
\n@@ -1395,15 +1395,15 @@\n inline \n \n \n
\n \n

An overloaded version to assist template parameter resolution when explicitly declaring unused array arguments as 0.

\n \n-

Definition at line 873 of file patchTable.h.

\n+

Definition at line 873 of file patchTable.h.

\n \n
\n \n \n

◆ EvaluateBasisVarying() [3/3]

\n \n
\n@@ -1654,15 +1654,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 812 of file patchTable.h.

\n+

Definition at line 812 of file patchTable.h.

\n \n
\n \n \n

◆ GetLocalPointFaceVaryingStencilTable() [2/3]

\n \n
\n@@ -1684,15 +1684,15 @@\n inline \n \n \n
\n \n

Returns the stencil table to compute local point face-varying values.

\n \n-

Definition at line 789 of file patchTable.h.

\n+

Definition at line 789 of file patchTable.h.

\n \n
\n \n \n

◆ GetLocalPointFaceVaryingStencilTable() [3/3]

\n \n
\n@@ -1735,15 +1735,15 @@\n inline \n \n \n
\n \n

Returns the stencil table to compute local point vertex values.

\n \n-

Definition at line 778 of file patchTable.h.

\n+

Definition at line 778 of file patchTable.h.

\n \n
\n \n \n

◆ GetLocalPointStencilTable() [2/3]

\n \n
\n@@ -1785,15 +1785,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 800 of file patchTable.h.

\n+

Definition at line 800 of file patchTable.h.

\n \n
\n \n \n

◆ GetLocalPointVaryingStencilTable() [1/3]

\n \n
\n@@ -1814,15 +1814,15 @@\n inline \n \n \n
\n \n

Returns the stencil table to compute local point varying values.

\n \n-

Definition at line 783 of file patchTable.h.

\n+

Definition at line 783 of file patchTable.h.

\n \n
\n \n \n

◆ GetLocalPointVaryingStencilTable() [2/3]

\n \n
\n@@ -1864,15 +1864,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 806 of file patchTable.h.

\n+

Definition at line 806 of file patchTable.h.

\n \n
\n \n \n

◆ GetMaxValence()

\n \n
\n@@ -1893,15 +1893,15 @@\n inline \n \n \n
\n \n

Returns max vertex valence.

\n \n-

Definition at line 92 of file patchTable.h.

\n+

Definition at line 92 of file patchTable.h.

\n \n
\n \n \n

◆ GetNumControlVertices()

\n \n
\n@@ -1942,15 +1942,15 @@\n inline \n \n \n
\n \n

Returns the total number of control vertex indices in the table.

\n \n-

Definition at line 84 of file patchTable.h.

\n+

Definition at line 84 of file patchTable.h.

\n \n
\n \n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -2106,15 +2106,15 @@\n inline \n \n \n
\n \n

Returns the total number of ptex faces in the mesh.

\n \n-

Definition at line 95 of file patchTable.h.

\n+

Definition at line 95 of file patchTable.h.

\n \n
\n \n \n

◆ GetPatchArrayDescriptor()

\n \n
\n@@ -2255,15 +2255,15 @@\n inline \n \n \n
\n \n

Get the table of patch control vertices.

\n \n-

Definition at line 378 of file patchTable.h.

\n+

Definition at line 378 of file patchTable.h.

\n \n
\n \n \n

◆ GetPatchDescriptor()

\n \n
\n@@ -2568,15 +2568,15 @@\n inline \n \n \n
\n \n

Returns the PatchParamTable (PatchParams order matches patch array sorting)

\n \n-

Definition at line 381 of file patchTable.h.

\n+

Definition at line 381 of file patchTable.h.

\n \n
\n \n \n

◆ GetPatchQuadOffsets()

\n \n
\n@@ -2717,15 +2717,15 @@\n inline \n \n \n
\n \n

Returns the quad-offsets table.

\n \n-

Definition at line 392 of file patchTable.h.

\n+

Definition at line 392 of file patchTable.h.

\n \n
\n \n \n

◆ GetSharpnessIndexTable()

\n \n
\n@@ -2746,15 +2746,15 @@\n inline \n \n \n
\n \n

Returns a sharpness index table for each patch (if exists)

\n \n-

Definition at line 384 of file patchTable.h.

\n+

Definition at line 384 of file patchTable.h.

\n \n
\n \n \n

◆ getSharpnessIndices()

\n \n
\n@@ -2801,15 +2801,15 @@\n inline \n \n \n
\n \n

Returns sharpness values table.

\n \n-

Definition at line 387 of file patchTable.h.

\n+

Definition at line 387 of file patchTable.h.

\n \n
\n \n \n

◆ getSharpnessValues()

\n \n
\n@@ -2944,15 +2944,15 @@\n inline \n \n \n
\n \n

Returns the 'VertexValences' table (vertex neighborhoods table)

\n \n-

Definition at line 267 of file patchTable.h.

\n+

Definition at line 267 of file patchTable.h.

\n \n
\n \n \n

◆ IsFeatureAdaptive()

\n \n
\n@@ -3013,15 +3013,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 756 of file patchTable.h.

\n+

Definition at line 756 of file patchTable.h.

\n \n
\n \n \n

◆ LocalPointFaceVaryingStencilPrecisionMatchesType() [3/3]

\n \n
\n@@ -3042,15 +3042,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 769 of file patchTable.h.

\n+

Definition at line 769 of file patchTable.h.

\n \n
\n \n \n

◆ LocalPointStencilPrecisionMatchesType() [1/3]

\n \n
\n@@ -3092,15 +3092,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 748 of file patchTable.h.

\n+

Definition at line 748 of file patchTable.h.

\n \n
\n \n \n

◆ LocalPointStencilPrecisionMatchesType() [3/3]

\n \n
\n@@ -3121,15 +3121,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 761 of file patchTable.h.

\n+

Definition at line 761 of file patchTable.h.

\n \n
\n \n \n

◆ LocalPointVaryingStencilPrecisionMatchesType() [1/3]

\n \n
\n@@ -3171,15 +3171,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 752 of file patchTable.h.

\n+

Definition at line 752 of file patchTable.h.

\n \n
\n \n \n

◆ LocalPointVaryingStencilPrecisionMatchesType() [3/3]

\n \n
\n@@ -3200,15 +3200,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 765 of file patchTable.h.

\n+

Definition at line 765 of file patchTable.h.

\n \n
\n \n \n

◆ print()

\n \n
\n@@ -3244,20 +3244,20 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 531 of file patchTable.h.

\n+

Definition at line 531 of file patchTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTable
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00997.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00997.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    PatchTable::PatchHandle Class Reference
    \n
\n
\n \n

Handle that can be used as unique patch identifier within PatchTable. \n More...

\n \n-

#include <patchTable.h>

\n+

#include <patchTable.h>

\n \n \n \n \n \n \n@@ -119,15 +119,15 @@\n \n \n \n

\n Public Attributes

Index arrayIndex
 
Index patchIndex
 
 
class PatchMap
 
\n

Detailed Description

\n

Handle that can be used as unique patch identifier within PatchTable.

\n \n-

Definition at line 60 of file patchTable.h.

\n+

Definition at line 60 of file patchTable.h.

\n

Friends And Related Symbol Documentation

\n \n

◆ PatchMap

\n \n
\n
\n \n@@ -141,15 +141,15 @@\n \n \n \n
\n friend
\n
\n \n-

Definition at line 65 of file patchTable.h.

\n+

Definition at line 65 of file patchTable.h.

\n \n
\n
\n \n

◆ PatchTable

\n \n
\n@@ -165,15 +165,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 64 of file patchTable.h.

\n+

Definition at line 64 of file patchTable.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ arrayIndex

\n \n@@ -182,15 +182,15 @@\n \n \n \n \n
Index arrayIndex
\n
\n \n-

Definition at line 67 of file patchTable.h.

\n+

Definition at line 67 of file patchTable.h.

\n \n
\n \n \n

◆ patchIndex

\n \n
\n@@ -198,15 +198,15 @@\n \n \n \n \n
Index patchIndex
\n
\n \n-

Definition at line 68 of file patchTable.h.

\n+

Definition at line 68 of file patchTable.h.

\n \n
\n \n \n

◆ vertIndex

\n \n
\n@@ -214,20 +214,20 @@\n \n \n \n \n
Index vertIndex
\n
\n \n-

Definition at line 69 of file patchTable.h.

\n+

Definition at line 69 of file patchTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTable
  • PatchHandle
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01017.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01017.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    PatchTableFactory Class Reference
    \n
\n
\n \n

Factory for constructing a PatchTable from a TopologyRefiner. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n \n@@ -124,29 +124,29 @@\n \n \n \n

\n Classes

struct  Options
 Public options for the PatchTable factory. More...
 
struct  PatchFaceTag
static PatchTableCreate (TopologyRefiner const &refiner, Options options=Options(), ConstIndexArray selectedFaces=ConstIndexArray())
 Instantiates a PatchTable from a client-provided TopologyRefiner.
 
\n

Detailed Description

\n

Factory for constructing a PatchTable from a TopologyRefiner.

\n \n-

Definition at line 40 of file patchTableFactory.h.

\n+

Definition at line 40 of file patchTableFactory.h.

\n

Member Typedef Documentation

\n \n

◆ PatchTagVector

\n \n
\n
\n \n \n \n \n
typedef std::vector<PatchFaceTag> PatchTagVector
\n
\n \n-

Definition at line 208 of file patchTableFactory.h.

\n+

Definition at line 208 of file patchTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ Create()

\n \n@@ -200,15 +200,15 @@\n \n \n
Returns
A new instance of PatchTable
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTableFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01021.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01021.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    PatchTableFactory::Options Struct Reference
    \n
\n
\n \n

Public options for the PatchTable factory. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n

\n Public Types

enum  EndCapType {
\n   ENDCAP_NONE = 0\n ,
\n   ENDCAP_BILINEAR_BASIS\n@@ -208,15 +208,15 @@\n
int const * fvarChannelIndices
 List containing the indices of the channels selected for the factory.
 
\n

Detailed Description

\n

Public options for the PatchTable factory.

\n \n-

Definition at line 45 of file patchTableFactory.h.

\n+

Definition at line 45 of file patchTableFactory.h.

\n

Member Enumeration Documentation

\n \n

◆ EndCapType

\n \n
\n
\n \n@@ -237,15 +237,15 @@\n \n \n \n
ENDCAP_GREGORY_BASIS 

use Gregory patches (highest quality, recommended default)

\n
ENDCAP_LEGACY_GREGORY 

legacy option for 2.x style Gregory patches (Catmark only)

\n
\n \n-

Definition at line 55 of file patchTableFactory.h.

\n+

Definition at line 55 of file patchTableFactory.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n@@ -266,15 +266,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file patchTableFactory.h.

\n+

Definition at line 63 of file patchTableFactory.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ GetEndCapType()

\n \n@@ -296,15 +296,15 @@\n inline \n \n \n
\n \n

Get endcap basis type.

\n \n-

Definition at line 85 of file patchTableFactory.h.

\n+

Definition at line 85 of file patchTableFactory.h.

\n \n
\n \n \n

◆ GetRefineAdaptiveOptions()

\n \n
\n@@ -325,15 +325,15 @@\n inline \n \n \n
\n \n

Determine adaptive refinement options to match assigned patch options.

\n \n-

Definition at line 100 of file patchTableFactory.h.

\n+

Definition at line 100 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetEndCapType()

\n \n
\n@@ -355,15 +355,15 @@\n inline \n \n \n
\n \n

Set endcap basis type.

\n \n-

Definition at line 88 of file patchTableFactory.h.

\n+

Definition at line 88 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetFVarPatchPrecision() [1/2]

\n \n
\n@@ -403,15 +403,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 215 of file patchTableFactory.h.

\n+

Definition at line 215 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetMaxIsolationLevel()

\n \n
\n@@ -433,15 +433,15 @@\n inline \n \n \n
\n \n

Set maximum isolation level.

\n \n-

Definition at line 91 of file patchTableFactory.h.

\n+

Definition at line 91 of file patchTableFactory.h.

\n \n
\n \n \n

◆ SetPatchPrecision() [1/2]

\n \n
\n@@ -481,15 +481,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 212 of file patchTableFactory.h.

\n+

Definition at line 212 of file patchTableFactory.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ endCapType

\n \n@@ -500,15 +500,15 @@\n unsigned int endCapType\n \n \n
\n \n

EndCapType.

\n \n-

Definition at line 120 of file patchTableFactory.h.

\n+

Definition at line 120 of file patchTableFactory.h.

\n \n
\n \n \n

◆ fvarChannelIndices

\n \n
\n@@ -518,15 +518,15 @@\n int const* fvarChannelIndices\n \n \n
\n \n

List containing the indices of the channels selected for the factory.

\n \n-

Definition at line 140 of file patchTableFactory.h.

\n+

Definition at line 140 of file patchTableFactory.h.

\n \n
\n \n \n

◆ fvarPatchPrecisionDouble

\n \n
\n@@ -536,15 +536,15 @@\n unsigned int fvarPatchPrecisionDouble\n \n \n
\n \n

Generate double-precision stencils for face-varying patches.

\n \n-

Definition at line 133 of file patchTableFactory.h.

\n+

Definition at line 133 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateAllLevels

\n \n
\n@@ -554,15 +554,15 @@\n unsigned int generateAllLevels\n \n \n
\n \n

Generate levels from 'firstLevel' to 'maxLevel' (Uniform mode only)

\n \n-

Definition at line 110 of file patchTableFactory.h.

\n+

Definition at line 110 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateFVarLegacyLinearPatches

\n \n
\n@@ -572,15 +572,15 @@\n unsigned int generateFVarLegacyLinearPatches\n \n \n
\n \n

Generate all linear face-varying patches (legacy)

\n \n-

Definition at line 136 of file patchTableFactory.h.

\n+

Definition at line 136 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateFVarTables

\n \n
\n@@ -590,15 +590,15 @@\n unsigned int generateFVarTables\n \n \n
\n \n

Generate face-varying patch tables.

\n \n-

Definition at line 129 of file patchTableFactory.h.

\n+

Definition at line 129 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateLegacySharpCornerPatches

\n \n
\n@@ -608,15 +608,15 @@\n unsigned int generateLegacySharpCornerPatches\n \n \n
\n \n

Generate sharp regular patches at smooth corners (legacy)

\n \n-

Definition at line 137 of file patchTableFactory.h.

\n+

Definition at line 137 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateVaryingLocalPoints

\n \n
\n@@ -626,15 +626,15 @@\n unsigned int generateVaryingLocalPoints\n \n \n
\n \n

Generate local points with varying patches.

\n \n-

Definition at line 126 of file patchTableFactory.h.

\n+

Definition at line 126 of file patchTableFactory.h.

\n \n
\n \n \n

◆ generateVaryingTables

\n \n
\n@@ -644,15 +644,15 @@\n unsigned int generateVaryingTables\n \n \n
\n \n

Generate varying patch tables.

\n \n-

Definition at line 125 of file patchTableFactory.h.

\n+

Definition at line 125 of file patchTableFactory.h.

\n \n
\n \n \n

◆ includeBaseLevelIndices

\n \n
\n@@ -662,15 +662,15 @@\n unsigned int includeBaseLevelIndices\n \n \n
\n \n

Include base level in patch point indices (Uniform mode only)

\n \n-

Definition at line 111 of file patchTableFactory.h.

\n+

Definition at line 111 of file patchTableFactory.h.

\n \n
\n \n \n

◆ includeFVarBaseLevelIndices

\n \n
\n@@ -680,15 +680,15 @@\n unsigned int includeFVarBaseLevelIndices\n \n \n
\n \n

Include base level in face-varying patch point indices (Uniform mode only)

\n \n-

Definition at line 112 of file patchTableFactory.h.

\n+

Definition at line 112 of file patchTableFactory.h.

\n \n
\n \n \n

◆ maxIsolationLevel

\n \n
\n@@ -698,15 +698,15 @@\n unsigned int maxIsolationLevel\n \n \n
\n \n

Cap adaptive feature isolation to the given level (max. 10)

\n \n-

Definition at line 117 of file patchTableFactory.h.

\n+

Definition at line 117 of file patchTableFactory.h.

\n \n
\n \n \n

◆ numFVarChannels

\n \n
\n@@ -716,15 +716,15 @@\n int numFVarChannels\n \n \n
\n \n

Number of channel indices and interpolation modes passed.

\n \n-

Definition at line 139 of file patchTableFactory.h.

\n+

Definition at line 139 of file patchTableFactory.h.

\n \n
\n \n \n

◆ patchPrecisionDouble

\n \n
\n@@ -734,15 +734,15 @@\n unsigned int patchPrecisionDouble\n \n \n
\n \n

Generate double-precision stencils for vertex patches.

\n \n-

Definition at line 132 of file patchTableFactory.h.

\n+

Definition at line 132 of file patchTableFactory.h.

\n \n
\n \n \n

◆ shareEndCapPatchPoints

\n \n
\n@@ -751,15 +751,15 @@\n \n unsigned int shareEndCapPatchPoints\n \n \n
\n

Share endcap patch points among adjacent endcap patches. currently only work with GregoryBasis.

\n \n-

Definition at line 121 of file patchTableFactory.h.

\n+

Definition at line 121 of file patchTableFactory.h.

\n \n
\n \n \n

◆ triangulateQuads

\n \n
\n@@ -769,15 +769,15 @@\n unsigned int triangulateQuads\n \n \n
\n \n

Triangulate 'QUADS' primitives (Uniform mode only)

\n \n-

Definition at line 113 of file patchTableFactory.h.

\n+

Definition at line 113 of file patchTableFactory.h.

\n \n
\n \n \n

◆ useInfSharpPatch

\n \n
\n@@ -787,15 +787,15 @@\n unsigned int useInfSharpPatch\n \n \n
\n \n

Use infinitely-sharp patch.

\n \n-

Definition at line 116 of file patchTableFactory.h.

\n+

Definition at line 116 of file patchTableFactory.h.

\n \n
\n \n \n

◆ useSingleCreasePatch

\n \n
\n@@ -805,20 +805,20 @@\n unsigned int useSingleCreasePatch\n \n \n
\n \n

Use single crease patch.

\n \n-

Definition at line 115 of file patchTableFactory.h.

\n+

Definition at line 115 of file patchTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PatchTableFactory
  • Options
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01025.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01025.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    PatchTableFactory::PatchFaceTag Struct Reference
    \n
\n
\n \n

Obsolete internal struct not intended for public use – due to be deprecated. \n More...

\n \n-

#include <patchTableFactory.h>

\n+

#include <patchTableFactory.h>

\n \n \n \n \n \n \n@@ -133,15 +133,15 @@\n \n \n \n

\n Public Member Functions

void clear ()
 
void assignBoundaryPropertiesFromEdgeMask (int boundaryEdgeMask)
 
 
unsigned int _isSingleCrease: 1
 
\n

Detailed Description

\n

Obsolete internal struct not intended for public use – due to be deprecated.

\n \n-

Definition at line 192 of file patchTableFactory.h.

\n+

Definition at line 192 of file patchTableFactory.h.

\n

Member Function Documentation

\n \n

◆ assignBoundaryPropertiesFromEdgeMask()

\n \n
\n
\n \n@@ -219,15 +219,15 @@\n
\n \n \n \n
unsigned int _boundaryCount
\n
\n \n-

Definition at line 199 of file patchTableFactory.h.

\n+

Definition at line 199 of file patchTableFactory.h.

\n \n
\n
\n \n

◆ _boundaryIndex

\n \n
\n@@ -235,15 +235,15 @@\n \n \n \n \n
unsigned int _boundaryIndex
\n
\n \n-

Definition at line 198 of file patchTableFactory.h.

\n+

Definition at line 198 of file patchTableFactory.h.

\n \n
\n
\n \n

◆ _boundaryMask

\n \n
\n@@ -251,15 +251,15 @@\n \n \n \n \n
unsigned int _boundaryMask
\n
\n \n-

Definition at line 197 of file patchTableFactory.h.

\n+

Definition at line 197 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _hasBoundaryEdge

\n \n
\n@@ -267,15 +267,15 @@\n \n \n \n \n
unsigned int _hasBoundaryEdge
\n
\n \n-

Definition at line 200 of file patchTableFactory.h.

\n+

Definition at line 200 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _hasPatch

\n \n
\n@@ -283,15 +283,15 @@\n \n \n \n \n
unsigned int _hasPatch
\n
\n \n-

Definition at line 194 of file patchTableFactory.h.

\n+

Definition at line 194 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _isRegular

\n \n
\n@@ -299,15 +299,15 @@\n \n \n \n \n
unsigned int _isRegular
\n
\n \n-

Definition at line 195 of file patchTableFactory.h.

\n+

Definition at line 195 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _isSingleCrease

\n \n
\n@@ -315,15 +315,15 @@\n \n \n \n \n
unsigned int _isSingleCrease
\n
\n \n-

Definition at line 201 of file patchTableFactory.h.

\n+

Definition at line 201 of file patchTableFactory.h.

\n \n
\n \n \n

◆ _transitionMask

\n \n
\n@@ -331,20 +331,20 @@\n \n \n \n \n
unsigned int _transitionMask
\n
\n \n-

Definition at line 196 of file patchTableFactory.h.

\n+

Definition at line 196 of file patchTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Applies refinement operations to generic primvar data. \n More...

\n \n-

#include <primvarRefiner.h>

\n+

#include <primvarRefiner.h>

\n \n \n \n \n \n \n@@ -159,15 +159,15 @@\n \n \n

\n Public Member Functions

 PrimvarRefinerReal (TopologyRefiner const &refiner)
 
 ~PrimvarRefinerReal ()
 
void LimitFaceVarying (T const &src, U &dst, int channel=0) const
 
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefinerReal< REAL >

Applies refinement operations to generic primvar data.

\n \n-

Definition at line 56 of file primvarRefiner.h.

\n+

Definition at line 56 of file primvarRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ PrimvarRefinerReal()

\n \n
\n
\n
\n@@ -187,15 +187,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 59 of file primvarRefiner.h.

\n+

Definition at line 59 of file primvarRefiner.h.

\n \n
\n
\n \n

◆ ~PrimvarRefinerReal()

\n \n
\n@@ -216,15 +216,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 60 of file primvarRefiner.h.

\n+

Definition at line 60 of file primvarRefiner.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetTopologyRefiner()

\n \n@@ -246,15 +246,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 62 of file primvarRefiner.h.

\n+

Definition at line 62 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Interpolate()

\n \n
\n@@ -305,15 +305,15 @@\n levelThe refinement level\n srcSource primvar buffer (templating control vertex data)\n dstDestination primvar buffer (templating refined vertex data) \n \n \n \n \n-

Definition at line 267 of file primvarRefiner.h.

\n+

Definition at line 267 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateFaceUniform()

\n \n
\n@@ -365,15 +365,15 @@\n levelThe refinement level\n srcSource primvar buffer\n dstDestination primvar buffer \n \n \n \n \n-

Definition at line 394 of file primvarRefiner.h.

\n+

Definition at line 394 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateFaceVarying()

\n \n
\n@@ -423,15 +423,15 @@\n \n
\n \n

Apply face-varying interpolation weights to a primvar buffer associated with a particular face-varying channel.

\n

Unlike vertex and varying primvar buffers, there is not a 1-to-1 correspondence between vertices and face-varying values – typically there are more face-varying values than vertices. Each face-varying channel is also independent in how its values relate to the vertices.

\n

The destination buffer must allocate an array of data for all the refined values, i.e. at least refiner.GetLevel(level).GetNumFVarValues(channel).

\n \n-

Definition at line 293 of file primvarRefiner.h.

\n+

Definition at line 293 of file primvarRefiner.h.

\n \n
\n \n \n

◆ InterpolateVarying()

\n \n
\n@@ -483,15 +483,15 @@\n levelThe refinement level\n srcSource primvar buffer (templating control vertex data)\n dstDestination primvar buffer (templating refined vertex data) \n \n \n \n \n-

Definition at line 412 of file primvarRefiner.h.

\n+

Definition at line 412 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Limit() [1/2]

\n \n
\n@@ -535,15 +535,15 @@\n \n \n \n
srcSource primvar buffer (refined data) for last level
dstPosDestination primvar buffer (data at the limit)
\n \n \n \n-

Definition at line 319 of file primvarRefiner.h.

\n+

Definition at line 319 of file primvarRefiner.h.

\n \n
\n \n \n

◆ Limit() [2/2]

\n \n
\n@@ -589,15 +589,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 344 of file primvarRefiner.h.

\n+

Definition at line 344 of file primvarRefiner.h.

\n \n
\n \n \n

◆ LimitFaceVarying()

\n \n
\n@@ -637,20 +637,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 369 of file primvarRefiner.h.

\n+

Definition at line 369 of file primvarRefiner.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <primvarRefiner.h>

\n+

#include <primvarRefiner.h>

\n
\n Inheritance diagram for PrimvarRefiner:
\n
\n
\n \"\"/\n \n \"PrimvarRefinerReal<\n@@ -138,15 +138,15 @@\n void Limit (T const &src, U &dstPos, U1 &dstTan1, U2 &dstTan2) const\n  \n void LimitFaceVarying (T const &src, U &dst, int channel=0) const\n  \n \n

Detailed Description

\n
\n-

Definition at line 1265 of file primvarRefiner.h.

\n+

Definition at line 1265 of file primvarRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ PrimvarRefiner()

\n \n
\n
\n \n@@ -164,20 +164,20 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 1267 of file primvarRefiner.h.

\n+

Definition at line 1267 of file primvarRefiner.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PrimvarRefiner
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01041.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01041.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    PtexIndices Class Reference
    \n
\n
\n \n

Object used to compute and query ptex face indices. \n More...

\n \n-

#include <ptexIndices.h>

\n+

#include <ptexIndices.h>

\n \n \n \n \n \n \n@@ -121,15 +121,15 @@\n \n \n

\n Public Member Functions

 PtexIndices (TopologyRefiner const &refiner)
 Constructor.
 
 ~PtexIndices ()
 Returns ptex face adjacency information for a given coarse face.
 
\n

Detailed Description

\n

Object used to compute and query ptex face indices.

\n

Given a refiner, constructing a PtexIndices object builds the mapping from coarse faces to ptex ids. Once built, the object can be used to query the mapping.

\n \n-

Definition at line 46 of file ptexIndices.h.

\n+

Definition at line 46 of file ptexIndices.h.

\n

Constructor & Destructor Documentation

\n \n

◆ PtexIndices()

\n \n
\n
\n \n@@ -262,15 +262,15 @@\n \n

Returns the number of ptex faces in the mesh.

\n

Ptex

\n \n \n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • PtexIndices
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01045.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01045.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    StencilTableFactoryReal< REAL > Class Template Reference
    \n
\n
\n \n

A specialized factory for StencilTable. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n
\n \n \n \n

\n Classes

struct  Options
 
\n \n \n

\n@@ -140,15 +140,15 @@\n

 Utility function for stencil splicing for local point face-varying stencils.
 
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal< REAL >

A specialized factory for StencilTable.

\n \n-

Definition at line 51 of file stencilTableFactory.h.

\n+

Definition at line 51 of file stencilTableFactory.h.

\n

Member Enumeration Documentation

\n \n

◆ Mode

\n \n
\n
\n
\n@@ -164,15 +164,15 @@\n \n INTERPOLATE_VARYING 

varying primvar stencils

\n \n INTERPOLATE_FACE_VARYING 

face-varying primvar stencils

\n \n \n \n-

Definition at line 55 of file stencilTableFactory.h.

\n+

Definition at line 55 of file stencilTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ AppendLocalPointStencilTable()

\n \n@@ -357,15 +357,15 @@\n baseStencilTableInput StencilTable for refined vertices\n localPointStencilTableStencilTable for the change of basis patch points.\n factorizeIf factorize is set to true, endcap stencils will be factorized with supporting vertices from baseStencil table so that the endcap points can be computed directly from control vertices. \n \n \n \n \n-

Definition at line 148 of file stencilTableFactory.h.

\n+

Definition at line 148 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [1/2]

\n \n
\n@@ -458,16 +458,16 @@\n \n \n \n \n
\n
\n
The documentation for this class was generated from the following files:\n
\n
\n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTableFactoryReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01049.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01049.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    LimitStencilTableFactoryReal< REAL > Class Template Reference
    \n
\n
\n \n

A specialized factory for LimitStencilTable. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n \n \n@@ -135,15 +135,15 @@\n

\n Classes

struct  LocationArray
 Descriptor for limit surface locations. More...
 
struct  Options
\n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >

A specialized factory for LimitStencilTable.

\n

The LimitStencilTableFactory creates a table of limit stencils. Limit stencils can interpolate any arbitrary location on the limit surface. The stencils will be bilinear if the surface is refined uniformly, and bicubic if feature adaptive isolation is used instead.

\n

Surface locations are expressed as a combination of ptex face index and normalized (s,t) patch coordinates. The factory exposes the LocationArray struct as a container for these location descriptors.

\n \n-

Definition at line 209 of file stencilTableFactory.h.

\n+

Definition at line 209 of file stencilTableFactory.h.

\n

Member Typedef Documentation

\n \n

◆ LocationArrayVec

\n \n
\n
\n
\n@@ -151,15 +151,15 @@\n \n \n \n \n
typedef std::vector<LocationArray> LocationArrayVec
\n
\n \n-

Definition at line 244 of file stencilTableFactory.h.

\n+

Definition at line 244 of file stencilTableFactory.h.

\n \n
\n
\n

Member Enumeration Documentation

\n \n

◆ Mode

\n \n@@ -178,15 +178,15 @@\n \n INTERPOLATE_VARYING 

varying primvar stencils

\n \n INTERPOLATE_FACE_VARYING 

face-varying primvar stencils

\n \n \n \n-

Definition at line 213 of file stencilTableFactory.h.

\n+

Definition at line 213 of file stencilTableFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ Create()

\n \n@@ -252,16 +252,16 @@\n \n \n \n \n \n \n
The documentation for this class was generated from the following files:\n \n \n \n
\n
\n
\n \n

Vertex stencil descriptor. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for StencilReal< REAL >:
\n
\n
\n \"\"/\n \n \"LimitStencilReal<\n@@ -160,15 +160,15 @@\n  \n \n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilReal< REAL >

Vertex stencil descriptor.

\n

Allows access and manipulation of a single stencil in a StencilTable.

\n \n-

Definition at line 53 of file stencilTable.h.

\n+

Definition at line 53 of file stencilTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ StencilReal() [1/3]

\n \n
\n
\n
\n@@ -189,15 +189,15 @@\n inline \n \n \n
\n \n

Default constructor.

\n \n-

Definition at line 57 of file stencilTable.h.

\n+

Definition at line 57 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilReal() [2/3]

\n \n
\n@@ -245,15 +245,15 @@\n sizeTable pointer to the size of the stencil\n indicesTable pointer to the vertex indices of the stencil\n weightsTable pointer to the vertex weights of the stencil \n \n \n \n \n-

Definition at line 67 of file stencilTable.h.

\n+

Definition at line 67 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilReal() [3/3]

\n \n
\n@@ -277,15 +277,15 @@\n inline \n \n \n
\n \n

Copy constructor.

\n \n-

Definition at line 71 of file stencilTable.h.

\n+

Definition at line 71 of file stencilTable.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetSize()

\n \n@@ -309,15 +309,15 @@\n inline \n \n \n
\n \n

Returns the size of the stencil.

\n \n-

Definition at line 78 of file stencilTable.h.

\n+

Definition at line 78 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetSizePtr()

\n \n
\n@@ -340,15 +340,15 @@\n inline \n \n \n
\n \n

Returns the size of the stencil as a pointer.

\n \n-

Definition at line 83 of file stencilTable.h.

\n+

Definition at line 83 of file stencilTable.h.

\n \n
\n \n \n

◆ GetVertexIndices()

\n \n
\n@@ -371,15 +371,15 @@\n inline \n \n \n
\n \n

Returns the control vertices' indices.

\n \n-

Definition at line 88 of file stencilTable.h.

\n+

Definition at line 88 of file stencilTable.h.

\n \n
\n \n \n

◆ GetWeights()

\n \n
\n@@ -402,15 +402,15 @@\n inline \n \n \n
\n \n

Returns the interpolation weights.

\n \n-

Definition at line 93 of file stencilTable.h.

\n+

Definition at line 93 of file stencilTable.h.

\n \n
\n \n \n

◆ Next()

\n \n
\n@@ -433,15 +433,15 @@\n inline \n \n \n
\n \n

Advance to the next stencil in the table.

\n \n-

Definition at line 98 of file stencilTable.h.

\n+

Definition at line 98 of file stencilTable.h.

\n \n
\n \n

Friends And Related Symbol Documentation

\n \n

◆ LimitStencilTableFactoryReal< REAL >

\n \n@@ -460,15 +460,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 98 of file stencilTable.h.

\n+

Definition at line 98 of file stencilTable.h.

\n \n
\n \n \n

◆ StencilTableFactoryReal< REAL >

\n \n
\n@@ -486,15 +486,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 98 of file stencilTable.h.

\n+

Definition at line 98 of file stencilTable.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ _indices

\n \n@@ -513,15 +513,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 110 of file stencilTable.h.

\n+

Definition at line 110 of file stencilTable.h.

\n \n
\n \n \n

◆ _size

\n \n
\n@@ -539,15 +539,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 109 of file stencilTable.h.

\n+

Definition at line 109 of file stencilTable.h.

\n \n
\n \n \n

◆ _weights

\n \n
\n@@ -565,20 +565,20 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 111 of file stencilTable.h.

\n+

Definition at line 111 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01057.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01057.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    Stencil Class Reference
    \n
\n
\n \n

Vertex stencil class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for Stencil:
\n
\n
\n \"\"/\n \n \"StencilReal<\n@@ -161,15 +161,15 @@\n  \n float * _weights\n  \n \n

Detailed Description

\n

Vertex stencil class wrapping the template for compatibility.

\n \n-

Definition at line 116 of file stencilTable.h.

\n+

Definition at line 116 of file stencilTable.h.

\n

Member Typedef Documentation

\n \n

◆ BaseStencil

\n \n
\n
\n \n@@ -183,15 +183,15 @@\n \n \n \n
\n protected
\n
\n \n-

Definition at line 118 of file stencilTable.h.

\n+

Definition at line 118 of file stencilTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ Stencil() [1/3]

\n \n@@ -211,15 +211,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 121 of file stencilTable.h.

\n+

Definition at line 121 of file stencilTable.h.

\n \n
\n
\n \n

◆ Stencil() [2/3]

\n \n
\n@@ -239,15 +239,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 122 of file stencilTable.h.

\n+

Definition at line 122 of file stencilTable.h.

\n \n
\n
\n \n

◆ Stencil() [3/3]

\n \n
\n@@ -283,20 +283,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 123 of file stencilTable.h.

\n+

Definition at line 123 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • Stencil
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01061.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01061.html", "unified_diff": "@@ -100,15 +100,15 @@\n
    StencilTableReal< REAL > Class Template Reference
    \n
\n
\n \n

Table of subdivision stencils. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for StencilTableReal< REAL >:
\n
\n
\n \"\"/\n \n \"LimitStencilTableReal<\n@@ -209,15 +209,15 @@\n \n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableReal< REAL >

Table of subdivision stencils.

\n

Stencils are the most direct method of evaluation of locations on the limit of a surface. Every point of a limit surface can be computed by linearly blending a collection of coarse control vertices.

\n

A stencil assigns a series of control vertex indices with a blending weight that corresponds to a unique parametric location of the limit surface. When the control vertices move in space, the limit location can be very efficiently recomputed simply by applying the blending weights to the series of coarse control vertices.

\n \n-

Definition at line 141 of file stencilTable.h.

\n+

Definition at line 141 of file stencilTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ StencilTableReal() [1/3]

\n \n
\n
\n
\n@@ -304,15 +304,15 @@\n \n \n inlinevirtual \n \n \n
\n \n-

Definition at line 153 of file stencilTable.h.

\n+

Definition at line 153 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilTableReal() [2/3]

\n \n
\n@@ -333,15 +333,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 255 of file stencilTable.h.

\n+

Definition at line 255 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilTableReal() [3/3]

\n \n
\n@@ -363,15 +363,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 256 of file stencilTable.h.

\n+

Definition at line 256 of file stencilTable.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ Clear()

\n \n@@ -414,15 +414,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 714 of file stencilTable.h.

\n+

Definition at line 714 of file stencilTable.h.

\n \n
\n
\n \n

◆ generateOffsets()

\n \n
\n@@ -443,15 +443,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 678 of file stencilTable.h.

\n+

Definition at line 678 of file stencilTable.h.

\n \n
\n \n \n

◆ GetControlIndices()

\n \n
\n@@ -474,15 +474,15 @@\n inline \n \n \n
\n \n

Returns the indices of the control vertices.

\n \n-

Definition at line 179 of file stencilTable.h.

\n+

Definition at line 179 of file stencilTable.h.

\n \n
\n \n \n

◆ GetNumControlVertices()

\n \n
\n@@ -505,15 +505,15 @@\n inline \n \n \n
\n \n

Returns the number of control vertices indexed in the table.

\n \n-

Definition at line 161 of file stencilTable.h.

\n+

Definition at line 161 of file stencilTable.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -536,15 +536,15 @@\n inline \n \n \n
\n \n

Returns the number of stencils in the table.

\n \n-

Definition at line 156 of file stencilTable.h.

\n+

Definition at line 156 of file stencilTable.h.

\n \n
\n \n \n

◆ GetOffsets()

\n \n
\n@@ -567,15 +567,15 @@\n inline \n \n \n
\n \n

Returns the offset to a given stencil (factory may leave empty)

\n \n-

Definition at line 174 of file stencilTable.h.

\n+

Definition at line 174 of file stencilTable.h.

\n \n
\n \n \n

◆ GetSizes()

\n \n
\n@@ -598,15 +598,15 @@\n inline \n \n \n
\n \n

Returns the number of control vertices of each stencil in the table.

\n \n-

Definition at line 169 of file stencilTable.h.

\n+

Definition at line 169 of file stencilTable.h.

\n \n
\n \n \n

◆ GetStencil()

\n \n
\n@@ -630,15 +630,15 @@\n inline \n \n \n
\n \n

Returns a Stencil at index i in the table.

\n \n-

Definition at line 722 of file stencilTable.h.

\n+

Definition at line 722 of file stencilTable.h.

\n \n
\n \n \n

◆ GetWeights()

\n \n
\n@@ -661,15 +661,15 @@\n inline \n \n \n
\n \n

Returns the stencil interpolation weights.

\n \n-

Definition at line 184 of file stencilTable.h.

\n+

Definition at line 184 of file stencilTable.h.

\n \n
\n \n \n

◆ operator[]()

\n \n
\n@@ -693,15 +693,15 @@\n inline \n \n \n
\n \n

Returns the stencil at index i in the table.

\n \n-

Definition at line 734 of file stencilTable.h.

\n+

Definition at line 734 of file stencilTable.h.

\n \n
\n \n \n

◆ reserve()

\n \n
\n@@ -733,15 +733,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 698 of file stencilTable.h.

\n+

Definition at line 698 of file stencilTable.h.

\n \n
\n \n \n

◆ resize()

\n \n
\n@@ -773,15 +773,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 690 of file stencilTable.h.

\n+

Definition at line 690 of file stencilTable.h.

\n \n
\n \n \n

◆ shrinkToFit()

\n \n
\n@@ -802,15 +802,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 706 of file stencilTable.h.

\n+

Definition at line 706 of file stencilTable.h.

\n \n
\n \n \n

◆ update() [1/2]

\n \n
\n@@ -862,15 +862,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 650 of file stencilTable.h.

\n+

Definition at line 650 of file stencilTable.h.

\n \n
\n \n \n

◆ update() [2/2]

\n \n
\n@@ -934,15 +934,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 618 of file stencilTable.h.

\n+

Definition at line 618 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateValues() [1/4]

\n \n
\n@@ -1000,15 +1000,15 @@\n dstValuesDestination buffer for the interpolated primvar data\n startIndex of first destination value to update\n endIndex of last destination value to update \n \n \n \n \n-

Definition at line 205 of file stencilTable.h.

\n+

Definition at line 205 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateValues() [2/4]

\n \n
\n@@ -1054,15 +1054,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 217 of file stencilTable.h.

\n+

Definition at line 217 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateValues() [3/4]

\n \n
\n@@ -1120,15 +1120,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 210 of file stencilTable.h.

\n+

Definition at line 210 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateValues() [4/4]

\n \n
\n@@ -1186,15 +1186,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 221 of file stencilTable.h.

\n+

Definition at line 221 of file stencilTable.h.

\n \n
\n \n

Friends And Related Symbol Documentation

\n \n

◆ Far::PatchTableBuilder

\n \n@@ -1213,15 +1213,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 261 of file stencilTable.h.

\n+

Definition at line 261 of file stencilTable.h.

\n \n
\n \n \n

◆ StencilTableFactoryReal< REAL >

\n \n
\n@@ -1239,15 +1239,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 256 of file stencilTable.h.

\n+

Definition at line 256 of file stencilTable.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ _indices

\n \n@@ -1266,15 +1266,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 267 of file stencilTable.h.

\n+

Definition at line 267 of file stencilTable.h.

\n \n
\n \n \n

◆ _numControlVertices

\n \n
\n@@ -1292,15 +1292,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 263 of file stencilTable.h.

\n+

Definition at line 263 of file stencilTable.h.

\n \n
\n \n \n

◆ _offsets

\n \n
\n@@ -1318,15 +1318,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 266 of file stencilTable.h.

\n+

Definition at line 266 of file stencilTable.h.

\n \n
\n \n \n

◆ _sizes

\n \n
\n@@ -1344,15 +1344,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 265 of file stencilTable.h.

\n+

Definition at line 265 of file stencilTable.h.

\n \n
\n \n \n

◆ _weights

\n \n
\n@@ -1370,20 +1370,20 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 268 of file stencilTable.h.

\n+

Definition at line 268 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTableReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01065.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01065.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    StencilTable Class Reference
    \n
\n
\n \n

Stencil table class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for StencilTable:
\n
\n
\n \"\"/\n \n \"StencilTableReal<\n@@ -208,15 +208,15 @@\n  \n std::vector< float > _weights\n  \n \n

Detailed Description

\n

Stencil table class wrapping the template for compatibility.

\n \n-

Definition at line 273 of file stencilTable.h.

\n+

Definition at line 273 of file stencilTable.h.

\n

Member Typedef Documentation

\n \n

◆ BaseTable

\n \n
\n
\n \n@@ -230,15 +230,15 @@\n \n \n \n
\n protected
\n
\n \n-

Definition at line 275 of file stencilTable.h.

\n+

Definition at line 275 of file stencilTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ StencilTable() [1/3]

\n \n@@ -258,15 +258,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 286 of file stencilTable.h.

\n+

Definition at line 286 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilTable() [2/3]

\n \n
\n@@ -286,15 +286,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 287 of file stencilTable.h.

\n+

Definition at line 287 of file stencilTable.h.

\n \n
\n
\n \n

◆ StencilTable() [3/3]

\n \n
\n@@ -354,15 +354,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 288 of file stencilTable.h.

\n+

Definition at line 288 of file stencilTable.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ GetStencil()

\n \n@@ -383,15 +383,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 278 of file stencilTable.h.

\n+

Definition at line 278 of file stencilTable.h.

\n \n
\n \n \n

◆ operator[]()

\n \n
\n@@ -411,20 +411,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 281 of file stencilTable.h.

\n+

Definition at line 281 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTable
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01069.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01069.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    LimitStencilReal< REAL > Class Template Reference
    \n
\n
\n \n

Limit point stencil descriptor. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for LimitStencilReal< REAL >:
\n
\n
\n \"\"/\n \n \"StencilReal<\n@@ -179,15 +179,15 @@\n REAL * _weights\n  \n \n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilReal< REAL >

Limit point stencil descriptor.

\n \n-

Definition at line 303 of file stencilTable.h.

\n+

Definition at line 303 of file stencilTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ LimitStencilReal()

\n \n
\n
\n
\n@@ -268,15 +268,15 @@\n duuWeightsTable pointer to the 'uu' derivative weights\n duvWeightsTable pointer to the 'uv' derivative weights\n dvvWeightsTable pointer to the 'vv' derivative weights \n \n \n \n \n-

Definition at line 324 of file stencilTable.h.

\n+

Definition at line 324 of file stencilTable.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetDuuWeights()

\n \n@@ -300,15 +300,15 @@\n inline \n \n \n
\n \n

Returns the uu derivative weights.

\n \n-

Definition at line 351 of file stencilTable.h.

\n+

Definition at line 351 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDuvWeights()

\n \n
\n@@ -331,15 +331,15 @@\n inline \n \n \n
\n \n

Returns the uv derivative weights.

\n \n-

Definition at line 356 of file stencilTable.h.

\n+

Definition at line 356 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDuWeights()

\n \n
\n@@ -362,15 +362,15 @@\n inline \n \n \n
\n \n

Returns the u derivative weights.

\n \n-

Definition at line 341 of file stencilTable.h.

\n+

Definition at line 341 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDvvWeights()

\n \n
\n@@ -393,15 +393,15 @@\n inline \n \n \n
\n \n

Returns the vv derivative weights.

\n \n-

Definition at line 361 of file stencilTable.h.

\n+

Definition at line 361 of file stencilTable.h.

\n \n
\n \n \n

◆ GetDvWeights()

\n \n
\n@@ -424,15 +424,15 @@\n inline \n \n \n
\n \n

Returns the v derivative weights.

\n \n-

Definition at line 346 of file stencilTable.h.

\n+

Definition at line 346 of file stencilTable.h.

\n \n
\n \n \n

◆ Next()

\n \n
\n@@ -455,15 +455,15 @@\n inline \n \n \n
\n \n

Advance to the next stencil in the table.

\n \n-

Definition at line 366 of file stencilTable.h.

\n+

Definition at line 366 of file stencilTable.h.

\n \n
\n \n

Friends And Related Symbol Documentation

\n \n

◆ LimitStencilTableFactoryReal< REAL >

\n \n@@ -482,15 +482,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 366 of file stencilTable.h.

\n+

Definition at line 366 of file stencilTable.h.

\n \n
\n \n \n

◆ StencilTableFactoryReal< REAL >

\n \n
\n@@ -508,20 +508,20 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 366 of file stencilTable.h.

\n+

Definition at line 366 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • LimitStencilReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01073.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01073.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    LimitStencil Class Reference
    \n
\n
\n \n

Limit point stencil class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for LimitStencil:
\n
\n
\n \"\"/\n \n \"LimitStencilReal<\n@@ -182,15 +182,15 @@\n  \n REAL * _weights\n  \n \n

Detailed Description

\n

Limit point stencil class wrapping the template for compatibility.

\n \n-

Definition at line 392 of file stencilTable.h.

\n+

Definition at line 392 of file stencilTable.h.

\n

Member Typedef Documentation

\n \n

◆ BaseStencil

\n \n
\n
\n \n@@ -204,15 +204,15 @@\n \n \n \n
\n protected
\n
\n \n-

Definition at line 394 of file stencilTable.h.

\n+

Definition at line 394 of file stencilTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ LimitStencil() [1/2]

\n \n@@ -233,15 +233,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 397 of file stencilTable.h.

\n+

Definition at line 397 of file stencilTable.h.

\n \n
\n
\n \n

◆ LimitStencil() [2/2]

\n \n
\n@@ -307,20 +307,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 398 of file stencilTable.h.

\n+

Definition at line 398 of file stencilTable.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • LimitStencil
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01077.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01077.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    LimitStencilTableReal< REAL > Class Template Reference
    \n
\n
\n \n

Table of limit subdivision stencils. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for LimitStencilTableReal< REAL >:
\n
\n
\n \"\"/\n \n \"StencilTableReal<\n@@ -257,15 +257,15 @@\n std::vector< REAL > _weights\n  \n \n

Detailed Description

\n
template<typename REAL>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableReal< REAL >

Table of limit subdivision stencils.

\n \n-

Definition at line 409 of file stencilTable.h.

\n+

Definition at line 409 of file stencilTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ LimitStencilTableReal()

\n \n
\n
\n
\n@@ -406,15 +406,15 @@\n inline \n \n \n
\n \n

Returns the 'uu' derivative stencil interpolation weights.

\n \n-

Definition at line 444 of file stencilTable.h.

\n+

Definition at line 444 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDuvWeights()

\n \n
\n@@ -437,15 +437,15 @@\n inline \n \n \n
\n \n

Returns the 'uv' derivative stencil interpolation weights.

\n \n-

Definition at line 449 of file stencilTable.h.

\n+

Definition at line 449 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDuWeights()

\n \n
\n@@ -468,15 +468,15 @@\n inline \n \n \n
\n \n

Returns the 'u' derivative stencil interpolation weights.

\n \n-

Definition at line 434 of file stencilTable.h.

\n+

Definition at line 434 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDvvWeights()

\n \n
\n@@ -499,15 +499,15 @@\n inline \n \n \n
\n \n

Returns the 'vv' derivative stencil interpolation weights.

\n \n-

Definition at line 454 of file stencilTable.h.

\n+

Definition at line 454 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetDvWeights()

\n \n
\n@@ -530,15 +530,15 @@\n inline \n \n \n
\n \n

Returns the 'v' derivative stencil interpolation weights.

\n \n-

Definition at line 439 of file stencilTable.h.

\n+

Definition at line 439 of file stencilTable.h.

\n \n
\n
\n \n

◆ GetLimitStencil()

\n \n
\n@@ -562,15 +562,15 @@\n inline \n \n \n
\n \n

Returns a LimitStencil at index i in the table.

\n \n-

Definition at line 749 of file stencilTable.h.

\n+

Definition at line 749 of file stencilTable.h.

\n \n
\n \n \n

◆ operator[]()

\n \n
\n@@ -594,15 +594,15 @@\n inline \n \n \n
\n \n

Returns the limit stencil at index i in the table.

\n \n-

Definition at line 782 of file stencilTable.h.

\n+

Definition at line 782 of file stencilTable.h.

\n \n
\n \n \n

◆ Update2ndDerivs() [1/4]

\n \n
\n@@ -674,15 +674,15 @@\n vvderivsDestination buffer for the interpolated 'vv' derivative primvar data\n startIndex of first destination derivative to update\n endIndex of last destination derivative to update \n \n \n \n \n-

Definition at line 528 of file stencilTable.h.

\n+

Definition at line 528 of file stencilTable.h.

\n \n
\n \n \n

◆ Update2ndDerivs() [2/4]

\n \n
\n@@ -740,15 +740,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 548 of file stencilTable.h.

\n+

Definition at line 548 of file stencilTable.h.

\n \n
\n \n \n

◆ Update2ndDerivs() [3/4]

\n \n
\n@@ -818,15 +818,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 538 of file stencilTable.h.

\n+

Definition at line 538 of file stencilTable.h.

\n \n
\n \n \n

◆ Update2ndDerivs() [4/4]

\n \n
\n@@ -896,15 +896,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 556 of file stencilTable.h.

\n+

Definition at line 556 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateDerivs() [1/4]

\n \n
\n@@ -969,15 +969,15 @@\n vderivsDestination buffer for the interpolated 'v' derivative primvar data\n startIndex of first destination derivative to update\n endIndex of last destination derivative to update \n \n \n \n \n-

Definition at line 476 of file stencilTable.h.

\n+

Definition at line 476 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateDerivs() [2/4]

\n \n
\n@@ -1029,15 +1029,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 493 of file stencilTable.h.

\n+

Definition at line 493 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateDerivs() [3/4]

\n \n
\n@@ -1101,15 +1101,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 484 of file stencilTable.h.

\n+

Definition at line 484 of file stencilTable.h.

\n \n
\n \n \n

◆ UpdateDerivs() [4/4]

\n \n
\n@@ -1173,15 +1173,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 500 of file stencilTable.h.

\n+

Definition at line 500 of file stencilTable.h.

\n \n
\n \n

Friends And Related Symbol Documentation

\n \n

◆ LimitStencilTableFactoryReal< REAL >

\n \n@@ -1200,20 +1200,20 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 565 of file stencilTable.h.

\n+

Definition at line 565 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • LimitStencilTableReal
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01081.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01081.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    LimitStencilTable Class Reference
    \n
\n
\n \n

Limit stencil table class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTable.h>

\n+

#include <stencilTable.h>

\n
\n Inheritance diagram for LimitStencilTable:
\n
\n
\n \"\"/\n \n \"LimitStencilTableReal<\n@@ -257,15 +257,15 @@\n  \n std::vector< REAL > _weights\n  \n \n

Detailed Description

\n

Limit stencil table class wrapping the template for compatibility.

\n \n-

Definition at line 583 of file stencilTable.h.

\n+

Definition at line 583 of file stencilTable.h.

\n

Member Typedef Documentation

\n \n

◆ BaseTable

\n \n
\n
\n \n@@ -279,15 +279,15 @@\n \n \n \n
\n protected
\n
\n \n-

Definition at line 585 of file stencilTable.h.

\n+

Definition at line 585 of file stencilTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ LimitStencilTable()

\n \n@@ -378,15 +378,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 596 of file stencilTable.h.

\n+

Definition at line 596 of file stencilTable.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ GetLimitStencil()

\n \n@@ -407,15 +407,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 588 of file stencilTable.h.

\n+

Definition at line 588 of file stencilTable.h.

\n \n
\n \n \n

◆ operator[]()

\n \n
\n@@ -435,20 +435,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 591 of file stencilTable.h.

\n+

Definition at line 591 of file stencilTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
StencilTableFactoryReal< REAL >::Options Struct Reference
\n \n
\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 Options ()
 
\n \n \n \n

\n@@ -127,15 +127,15 @@\n

 
unsigned int fvarChannel
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal< REAL >::Options
\n-

Definition at line 61 of file stencilTableFactory.h.

\n+

Definition at line 61 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n
\n@@ -154,15 +154,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file stencilTableFactory.h.

\n+

Definition at line 63 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ factorizeIntermediateLevels

\n \n@@ -174,15 +174,15 @@\n \n unsigned int factorizeIntermediateLevels\n \n \n
\n

accumulate stencil weights from control vertices or from the stencils of the previous level

\n \n-

Definition at line 75 of file stencilTableFactory.h.

\n+

Definition at line 75 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ fvarChannel

\n \n
\n@@ -193,15 +193,15 @@\n \n unsigned int fvarChannel\n \n \n
\n

face-varying channel to use when generating face-varying stencils

\n \n-

Definition at line 79 of file stencilTableFactory.h.

\n+

Definition at line 79 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateControlVerts

\n \n
\n@@ -213,15 +213,15 @@\n unsigned int generateControlVerts\n \n \n
\n \n

generate stencils for control-vertices

\n \n-

Definition at line 73 of file stencilTableFactory.h.

\n+

Definition at line 73 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateIntermediateLevels

\n \n
\n@@ -233,15 +233,15 @@\n unsigned int generateIntermediateLevels\n \n \n
\n \n

vertices at all levels or highest only

\n \n-

Definition at line 74 of file stencilTableFactory.h.

\n+

Definition at line 74 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generateOffsets

\n \n
\n@@ -253,15 +253,15 @@\n unsigned int generateOffsets\n \n \n
\n \n

populate optional \"_offsets\" field

\n \n-

Definition at line 72 of file stencilTableFactory.h.

\n+

Definition at line 72 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ interpolationMode

\n \n
\n@@ -273,15 +273,15 @@\n unsigned int interpolationMode\n \n \n
\n \n

interpolation mode

\n \n-

Definition at line 71 of file stencilTableFactory.h.

\n+

Definition at line 71 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ maxLevel

\n \n
\n@@ -293,20 +293,20 @@\n unsigned int maxLevel\n \n \n
\n \n

generate stencils up to 'maxLevel'

\n \n-

Definition at line 78 of file stencilTableFactory.h.

\n+

Definition at line 78 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
LimitStencilTableFactoryReal< REAL >::Options Struct Reference
\n \n
\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 Options ()
 
\n \n \n \n

\n@@ -120,15 +120,15 @@\n

unsigned int fvarChannel
 face-varying channel to use
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >::Options
\n-

Definition at line 219 of file stencilTableFactory.h.

\n+

Definition at line 219 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n
\n@@ -147,15 +147,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 221 of file stencilTableFactory.h.

\n+

Definition at line 221 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ fvarChannel

\n \n@@ -168,15 +168,15 @@\n unsigned int fvarChannel\n \n \n
\n \n

face-varying channel to use

\n \n-

Definition at line 229 of file stencilTableFactory.h.

\n+

Definition at line 229 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ generate1stDerivatives

\n \n
\n@@ -188,15 +188,15 @@\n unsigned int generate1stDerivatives\n \n \n
\n \n

Generate weights for 1st derivatives.

\n \n-

Definition at line 227 of file stencilTableFactory.h.

\n+

Definition at line 227 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ generate2ndDerivatives

\n \n
\n@@ -208,15 +208,15 @@\n unsigned int generate2ndDerivatives\n \n \n
\n \n

Generate weights for 2nd derivatives.

\n \n-

Definition at line 228 of file stencilTableFactory.h.

\n+

Definition at line 228 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ interpolationMode

\n \n
\n@@ -228,20 +228,20 @@\n unsigned int interpolationMode\n \n \n
\n \n

interpolation mode

\n \n-

Definition at line 226 of file stencilTableFactory.h.

\n+

Definition at line 226 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Descriptor for limit surface locations. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n \n \n \n \n

\n Public Member Functions

 LocationArray ()
 
\n \n \n

\n@@ -124,15 +124,15 @@\n

 array of v coordinates
 
\n

Detailed Description

\n
template<typename REAL>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal< REAL >::LocationArray

Descriptor for limit surface locations.

\n \n-

Definition at line 233 of file stencilTableFactory.h.

\n+

Definition at line 233 of file stencilTableFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ LocationArray()

\n \n
\n
\n
\n@@ -151,15 +151,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 235 of file stencilTableFactory.h.

\n+

Definition at line 235 of file stencilTableFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ numLocations

\n \n@@ -172,15 +172,15 @@\n int numLocations\n \n \n
\n \n

number of (u,v) coordinates in the array

\n \n-

Definition at line 238 of file stencilTableFactory.h.

\n+

Definition at line 238 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ ptexIdx

\n \n
\n@@ -192,15 +192,15 @@\n int ptexIdx\n \n \n
\n \n

ptex face index

\n \n-

Definition at line 237 of file stencilTableFactory.h.

\n+

Definition at line 237 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ s

\n \n
\n@@ -212,15 +212,15 @@\n REAL const* s\n \n \n
\n \n

array of u coordinates

\n \n-

Definition at line 240 of file stencilTableFactory.h.

\n+

Definition at line 240 of file stencilTableFactory.h.

\n \n
\n \n \n

◆ t

\n \n
\n@@ -232,20 +232,20 @@\n REAL const * t\n \n \n
\n \n

array of v coordinates

\n \n-

Definition at line 241 of file stencilTableFactory.h.

\n+

Definition at line 241 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Stencil table factory class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n
\n Inheritance diagram for StencilTableFactory:
\n
\n
\n \"\"/\n \n \"StencilTableFactoryReal<\n@@ -146,15 +146,15 @@\n \"-\"/ Public Types inherited from StencilTableFactoryReal< float >\n enum  Mode \n  \n \n

Detailed Description

\n

Stencil table factory class wrapping the template for compatibility.

\n \n-

Definition at line 287 of file stencilTableFactory.h.

\n+

Definition at line 287 of file stencilTableFactory.h.

\n

Member Function Documentation

\n \n

◆ AppendLocalPointStencilTable()

\n \n
\n
\n \n@@ -194,15 +194,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 308 of file stencilTableFactory.h.

\n+

Definition at line 308 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ AppendLocalPointStencilTableFaceVarying()

\n \n
\n@@ -250,15 +250,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 334 of file stencilTableFactory.h.

\n+

Definition at line 334 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ AppendLocalPointStencilTableVarying()

\n \n
\n@@ -300,15 +300,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 321 of file stencilTableFactory.h.

\n+

Definition at line 321 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [1/2]

\n \n
\n@@ -338,15 +338,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 300 of file stencilTableFactory.h.

\n+

Definition at line 300 of file stencilTableFactory.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -376,20 +376,20 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 293 of file stencilTableFactory.h.

\n+

Definition at line 293 of file stencilTableFactory.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • StencilTableFactory
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01101.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01101.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    LimitStencilTableFactory Class Reference
    \n
\n
\n \n

Stencil table factory class wrapping the template for compatibility. \n More...

\n \n-

#include <stencilTableFactory.h>

\n+

#include <stencilTableFactory.h>

\n
\n Inheritance diagram for LimitStencilTableFactory:
\n
\n
\n \"\"/\n \n \"LimitStencilTableFactoryReal<\n@@ -128,15 +128,15 @@\n  \n typedef std::vector< LocationArray > LocationArrayVec\n  \n \n

Detailed Description

\n

Stencil table factory class wrapping the template for compatibility.

\n \n-

Definition at line 354 of file stencilTableFactory.h.

\n+

Definition at line 354 of file stencilTableFactory.h.

\n

Member Function Documentation

\n \n

◆ Create()

\n \n
\n
\n \n@@ -182,20 +182,20 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 360 of file stencilTableFactory.h.

\n+

Definition at line 360 of file stencilTableFactory.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n
\n \n
\n
\n
\n \n

A simple reference to raw topology data for use with TopologyRefinerFactory. \n More...

\n \n-

#include <topologyDescriptor.h>

\n+

#include <topologyDescriptor.h>

\n \n \n \n \n

\n Classes

struct  FVarChannel
 
\n \n \n

\n@@ -148,15 +148,15 @@\n

FVarChannel const * fvarChannels
 
\n

Detailed Description

\n

A simple reference to raw topology data for use with TopologyRefinerFactory.

\n

TopologyDescriptor is a simple struct containing references to raw topology data used to construct a TopologyRefiner. It is not a requirement but a convenience for use with TopologyRefinerFactory when mesh topology is not available in an existing mesh data structure. It should be functionally complete and simple to use, but for more demanding situations, writing a custom Factory is usually warranted.

\n \n-

Definition at line 49 of file topologyDescriptor.h.

\n+

Definition at line 49 of file topologyDescriptor.h.

\n

Constructor & Destructor Documentation

\n \n

◆ TopologyDescriptor()

\n \n
\n
\n \n@@ -180,15 +180,15 @@\n
\n \n \n \n
Index const* cornerVertexIndices
\n
\n \n-

Definition at line 62 of file topologyDescriptor.h.

\n+

Definition at line 62 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ cornerWeights

\n \n
\n@@ -196,15 +196,15 @@\n \n \n \n \n
float const* cornerWeights
\n
\n \n-

Definition at line 63 of file topologyDescriptor.h.

\n+

Definition at line 63 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ creaseVertexIndexPairs

\n \n
\n@@ -212,15 +212,15 @@\n \n \n \n \n
Index const* creaseVertexIndexPairs
\n
\n \n-

Definition at line 58 of file topologyDescriptor.h.

\n+

Definition at line 58 of file topologyDescriptor.h.

\n \n
\n
\n \n

◆ creaseWeights

\n \n
\n@@ -228,15 +228,15 @@\n \n \n \n \n
float const* creaseWeights
\n
\n \n-

Definition at line 59 of file topologyDescriptor.h.

\n+

Definition at line 59 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ fvarChannels

\n \n
\n@@ -244,15 +244,15 @@\n \n \n \n \n
FVarChannel const* fvarChannels
\n
\n \n-

Definition at line 82 of file topologyDescriptor.h.

\n+

Definition at line 82 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ holeIndices

\n \n
\n@@ -260,15 +260,15 @@\n \n \n \n \n
Index const* holeIndices
\n
\n \n-

Definition at line 66 of file topologyDescriptor.h.

\n+

Definition at line 66 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ isLeftHanded

\n \n
\n@@ -276,15 +276,15 @@\n \n \n \n \n
bool isLeftHanded
\n
\n \n-

Definition at line 68 of file topologyDescriptor.h.

\n+

Definition at line 68 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numCorners

\n \n
\n@@ -292,15 +292,15 @@\n \n \n \n \n
int numCorners
\n
\n \n-

Definition at line 61 of file topologyDescriptor.h.

\n+

Definition at line 61 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numCreases

\n \n
\n@@ -308,15 +308,15 @@\n \n \n \n \n
int numCreases
\n
\n \n-

Definition at line 57 of file topologyDescriptor.h.

\n+

Definition at line 57 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numFaces

\n \n
\n@@ -324,15 +324,15 @@\n \n \n \n \n
int numFaces
\n
\n \n-

Definition at line 52 of file topologyDescriptor.h.

\n+

Definition at line 52 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numFVarChannels

\n \n
\n@@ -340,15 +340,15 @@\n \n \n \n \n
int numFVarChannels
\n
\n \n-

Definition at line 81 of file topologyDescriptor.h.

\n+

Definition at line 81 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numHoles

\n \n
\n@@ -356,15 +356,15 @@\n \n \n \n \n
int numHoles
\n
\n \n-

Definition at line 65 of file topologyDescriptor.h.

\n+

Definition at line 65 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numVertices

\n \n
\n@@ -372,15 +372,15 @@\n \n \n \n \n
int numVertices
\n
\n \n-

Definition at line 51 of file topologyDescriptor.h.

\n+

Definition at line 51 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ numVertsPerFace

\n \n
\n@@ -388,15 +388,15 @@\n \n \n \n \n
int const* numVertsPerFace
\n
\n \n-

Definition at line 54 of file topologyDescriptor.h.

\n+

Definition at line 54 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ vertIndicesPerFace

\n \n
\n@@ -404,20 +404,20 @@\n \n \n \n \n
Index const* vertIndicesPerFace
\n
\n \n-

Definition at line 55 of file topologyDescriptor.h.

\n+

Definition at line 55 of file topologyDescriptor.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
TopologyDescriptor::FVarChannel Struct Reference
\n \n
\n \n-

#include <topologyDescriptor.h>

\n+

#include <topologyDescriptor.h>

\n \n \n \n \n

\n Public Member Functions

 FVarChannel ()
 
\n \n \n \n \n

\n@@ -111,15 +111,15 @@\n

int numValues
 
Index const * valueIndices
 
\n

Detailed Description

\n
\n-

Definition at line 73 of file topologyDescriptor.h.

\n+

Definition at line 73 of file topologyDescriptor.h.

\n

Constructor & Destructor Documentation

\n \n

◆ FVarChannel()

\n \n
\n
\n \n@@ -136,15 +136,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 78 of file topologyDescriptor.h.

\n+

Definition at line 78 of file topologyDescriptor.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ numValues

\n \n@@ -153,15 +153,15 @@\n \n \n \n \n
int numValues
\n
\n \n-

Definition at line 75 of file topologyDescriptor.h.

\n+

Definition at line 75 of file topologyDescriptor.h.

\n \n
\n \n \n

◆ valueIndices

\n \n
\n@@ -169,20 +169,20 @@\n \n \n \n \n
Index const* valueIndices
\n
\n \n-

Definition at line 76 of file topologyDescriptor.h.

\n+

Definition at line 76 of file topologyDescriptor.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

An interface for accessing data in a specific level of a refined topology hierarchy. \n More...

\n \n-

#include <topologyLevel.h>

\n+

#include <topologyLevel.h>

\n \n \n \n \n \n@@ -258,15 +258,15 @@\n \n \n

\n Public Member Functions

Methods to inspect the overall inventory of components:

All three main component types are indexed locally within each level. For some topological relationships – notably face-vertices, which is often the only relationship of interest – the total number of entries is also made available.

\n
int GetNumVertices () const
 ~TopologyLevel ()
 
\n

Detailed Description

\n

An interface for accessing data in a specific level of a refined topology hierarchy.

\n

TopologyLevel provides an interface to data in a specific level of a topology hierarchy. Instances of TopologyLevel are created and owned by a TopologyRefiner, which will return const-references to them. Such references are only valid during the lifetime of the TopologyRefiner that created and returned them, and only for a given refinement, i.e. if the TopologyRefiner is re-refined, any references to TopoologyLevels are invalidated.

\n \n-

Definition at line 49 of file topologyLevel.h.

\n+

Definition at line 49 of file topologyLevel.h.

\n

Constructor & Destructor Documentation

\n \n

◆ TopologyLevel()

\n \n
\n
\n \n@@ -283,15 +283,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 300 of file topologyLevel.h.

\n+

Definition at line 300 of file topologyLevel.h.

\n \n
\n
\n \n

◆ ~TopologyLevel()

\n \n
\n@@ -310,15 +310,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 301 of file topologyLevel.h.

\n+

Definition at line 301 of file topologyLevel.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ DoesEdgeFVarTopologyMatch()

\n \n@@ -351,15 +351,15 @@\n inline \n \n \n
\n \n

Return if face-varying topology across the edge only matches.

\n \n-

Definition at line 247 of file topologyLevel.h.

\n+

Definition at line 247 of file topologyLevel.h.

\n \n
\n \n \n

◆ DoesFaceFVarTopologyMatch()

\n \n
\n@@ -391,15 +391,15 @@\n inline \n \n \n
\n \n

Return if face-varying topology around a face matches.

\n \n-

Definition at line 252 of file topologyLevel.h.

\n+

Definition at line 252 of file topologyLevel.h.

\n \n
\n \n \n

◆ DoesVertexFVarTopologyMatch()

\n \n
\n@@ -431,15 +431,15 @@\n inline \n \n \n
\n \n

Return if face-varying topology around a vertex matches.

\n \n-

Definition at line 242 of file topologyLevel.h.

\n+

Definition at line 242 of file topologyLevel.h.

\n \n
\n \n \n

◆ FindEdge()

\n \n
\n@@ -471,15 +471,15 @@\n inline \n \n \n
\n \n

Identify the edge matching the given vertex pair.

\n \n-

Definition at line 120 of file topologyLevel.h.

\n+

Definition at line 120 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeChildEdges()

\n \n
\n@@ -501,15 +501,15 @@\n inline \n \n \n
\n \n

Access the child edges (in the next level) of a given edge.

\n \n-

Definition at line 268 of file topologyLevel.h.

\n+

Definition at line 268 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeChildVertex()

\n \n
\n@@ -531,15 +531,15 @@\n inline \n \n \n
\n \n

Return the child vertex (in the next level) of a given edge.

\n \n-

Definition at line 274 of file topologyLevel.h.

\n+

Definition at line 274 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeFaceLocalIndices()

\n \n
\n@@ -561,15 +561,15 @@\n inline \n \n \n
\n \n

Access the local indices of an edge with respect to its incident faces.

\n \n-

Definition at line 117 of file topologyLevel.h.

\n+

Definition at line 117 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeFaces()

\n \n
\n@@ -591,15 +591,15 @@\n inline \n \n \n
\n \n

Access the faces incident a given edge.

\n \n-

Definition at line 102 of file topologyLevel.h.

\n+

Definition at line 102 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeSharpness()

\n \n
\n@@ -621,15 +621,15 @@\n inline \n \n \n
\n \n

Return the sharpness assigned a given edge.

\n \n-

Definition at line 173 of file topologyLevel.h.

\n+

Definition at line 173 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetEdgeVertices()

\n \n
\n@@ -651,15 +651,15 @@\n inline \n \n \n
\n \n

Access the vertices incident a given edge.

\n \n-

Definition at line 99 of file topologyLevel.h.

\n+

Definition at line 99 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceChildEdges()

\n \n
\n@@ -681,15 +681,15 @@\n inline \n \n \n
\n \n

Access the child edges (in the next level) of a given face.

\n \n-

Definition at line 265 of file topologyLevel.h.

\n+

Definition at line 265 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceChildFaces()

\n \n
\n@@ -711,15 +711,15 @@\n inline \n \n \n
\n \n

Access the child faces (in the next level) of a given face.

\n \n-

Definition at line 262 of file topologyLevel.h.

\n+

Definition at line 262 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceChildVertex()

\n \n
\n@@ -741,15 +741,15 @@\n inline \n \n \n
\n \n

Return the child vertex (in the next level) of a given face.

\n \n-

Definition at line 271 of file topologyLevel.h.

\n+

Definition at line 271 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceEdges()

\n \n
\n@@ -771,15 +771,15 @@\n inline \n \n \n
\n \n

Access the edges incident a given face.

\n \n-

Definition at line 96 of file topologyLevel.h.

\n+

Definition at line 96 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceFVarValues()

\n \n
\n@@ -811,15 +811,15 @@\n inline \n \n \n
\n \n

Access the face-varying values associated with a particular face.

\n \n-

Definition at line 237 of file topologyLevel.h.

\n+

Definition at line 237 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceParentFace()

\n \n
\n@@ -841,15 +841,15 @@\n inline \n \n \n
\n \n

Return the parent face (in the previous level) of a given face.

\n \n-

Definition at line 280 of file topologyLevel.h.

\n+

Definition at line 280 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetFaceVertices()

\n \n
\n@@ -871,15 +871,15 @@\n inline \n \n \n
\n \n

Access the vertices incident a given face.

\n \n-

Definition at line 93 of file topologyLevel.h.

\n+

Definition at line 93 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumEdges()

\n \n
\n@@ -900,15 +900,15 @@\n inline \n \n \n
\n \n

Return the number of edges in this level.

\n \n-

Definition at line 68 of file topologyLevel.h.

\n+

Definition at line 68 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumFaces()

\n \n
\n@@ -929,15 +929,15 @@\n inline \n \n \n
\n \n

Return the number of faces in this level.

\n \n-

Definition at line 65 of file topologyLevel.h.

\n+

Definition at line 65 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumFaceVertices()

\n \n
\n@@ -958,15 +958,15 @@\n inline \n \n \n
\n \n

Return the total number of face-vertices, i.e. the sum of all vertices for all faces.

\n \n-

Definition at line 71 of file topologyLevel.h.

\n+

Definition at line 71 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -987,15 +987,15 @@\n inline \n \n \n
\n \n

Return the number of face-varying channels (should be same for all levels)

\n \n-

Definition at line 230 of file topologyLevel.h.

\n+

Definition at line 230 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumFVarValues()

\n \n
\n@@ -1017,15 +1017,15 @@\n inline \n \n \n
\n \n

Return the total number of face-varying values in a particular channel (the upper bound of a face-varying value index)

\n \n-

Definition at line 234 of file topologyLevel.h.

\n+

Definition at line 234 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetNumVertices()

\n \n
\n@@ -1046,15 +1046,15 @@\n inline \n \n \n
\n \n

Return the number of vertices in this level.

\n \n-

Definition at line 62 of file topologyLevel.h.

\n+

Definition at line 62 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexChildVertex()

\n \n
\n@@ -1076,15 +1076,15 @@\n inline \n \n \n
\n \n

Return the child vertex (in the next level) of a given vertex.

\n \n-

Definition at line 277 of file topologyLevel.h.

\n+

Definition at line 277 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexEdgeLocalIndices()

\n \n
\n@@ -1106,15 +1106,15 @@\n inline \n \n \n
\n \n

Access the local indices of a vertex with respect to its incident edges.

\n \n-

Definition at line 114 of file topologyLevel.h.

\n+

Definition at line 114 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexEdges()

\n \n
\n@@ -1136,15 +1136,15 @@\n inline \n \n \n
\n \n

Access the edges incident a given vertex.

\n \n-

Definition at line 108 of file topologyLevel.h.

\n+

Definition at line 108 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexFaceLocalIndices()

\n \n
\n@@ -1166,15 +1166,15 @@\n inline \n \n \n
\n \n

Access the local indices of a vertex with respect to its incident faces.

\n \n-

Definition at line 111 of file topologyLevel.h.

\n+

Definition at line 111 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexFaces()

\n \n
\n@@ -1196,15 +1196,15 @@\n inline \n \n \n
\n \n

Access the faces incident a given vertex.

\n \n-

Definition at line 105 of file topologyLevel.h.

\n+

Definition at line 105 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexRule()

\n \n
\n@@ -1226,15 +1226,15 @@\n inline \n \n \n
\n \n

Return the subdivision rule assigned a given vertex specific to this level.

\n \n-

Definition at line 194 of file topologyLevel.h.

\n+

Definition at line 194 of file topologyLevel.h.

\n \n
\n \n \n

◆ GetVertexSharpness()

\n \n
\n@@ -1256,15 +1256,15 @@\n inline \n \n \n
\n \n

Return the sharpness assigned a given vertex.

\n \n-

Definition at line 176 of file topologyLevel.h.

\n+

Definition at line 176 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsEdgeBoundary()

\n \n
\n@@ -1286,15 +1286,15 @@\n inline \n \n \n
\n \n

Return if the edge is a boundary (only one incident face)

\n \n-

Definition at line 134 of file topologyLevel.h.

\n+

Definition at line 134 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsEdgeInfSharp()

\n \n
\n@@ -1316,15 +1316,15 @@\n inline \n \n \n
\n \n

Return if the edge is infinitely-sharp.

\n \n-

Definition at line 179 of file topologyLevel.h.

\n+

Definition at line 179 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsEdgeNonManifold()

\n \n
\n@@ -1346,15 +1346,15 @@\n inline \n \n \n
\n \n

Return if the edge is non-manifold.

\n \n-

Definition at line 128 of file topologyLevel.h.

\n+

Definition at line 128 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsEdgeSemiSharp()

\n \n
\n@@ -1376,15 +1376,15 @@\n inline \n \n \n
\n \n

Return if the edge is semi-sharp.

\n \n-

Definition at line 185 of file topologyLevel.h.

\n+

Definition at line 185 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsFaceHole()

\n \n
\n@@ -1406,15 +1406,15 @@\n inline \n \n \n
\n \n

Return if a given face has been tagged as a hole.

\n \n-

Definition at line 191 of file topologyLevel.h.

\n+

Definition at line 191 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexBoundary()

\n \n
\n@@ -1436,15 +1436,15 @@\n inline \n \n \n
\n \n

Return if the vertex is on a boundary (at least one incident boundary edge)

\n \n-

Definition at line 137 of file topologyLevel.h.

\n+

Definition at line 137 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexCorner()

\n \n
\n@@ -1466,15 +1466,15 @@\n inline \n \n \n
\n \n

Return if the vertex is a corner (only one incident face)

\n \n-

Definition at line 140 of file topologyLevel.h.

\n+

Definition at line 140 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexInfSharp()

\n \n
\n@@ -1496,15 +1496,15 @@\n inline \n \n \n
\n \n

Return if the vertex is infinitely-sharp.

\n \n-

Definition at line 182 of file topologyLevel.h.

\n+

Definition at line 182 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexNonManifold()

\n \n
\n@@ -1526,15 +1526,15 @@\n inline \n \n \n
\n \n

Return if the vertex is non-manifold.

\n \n-

Definition at line 131 of file topologyLevel.h.

\n+

Definition at line 131 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexSemiSharp()

\n \n
\n@@ -1556,15 +1556,15 @@\n inline \n \n \n
\n \n

Return if the vertex is semi-sharp.

\n \n-

Definition at line 188 of file topologyLevel.h.

\n+

Definition at line 188 of file topologyLevel.h.

\n \n
\n \n \n

◆ IsVertexValenceRegular()

\n \n
\n@@ -1589,15 +1589,15 @@\n
\n \n

Return if the valence of the vertex is regular (must be manifold)

\n

Note that this test only determines if the valence of the vertex is regular with respect to the assigned subdivision scheme – not if the neighborhood around the vertex is regular. The latter depends on a number of factors including the incident faces of the vertex (they must all be regular) and the presence of sharpness at the vertex itself or its incident edges.

\n

The regularity of the valence is a necessary but not a sufficient condition in determining the regularity of the neighborhood. For example, while the valence of an interior vertex may be regular, its neighborhood is not if the vertex was made infinitely sharp. Conversely, a corner vertex is considered regular by its valence but its neighborhood is not if the vertex was not made infinitely sharp.

\n

Whether the valence of the vertex is regular is also a property that remains the same for the vertex in all subdivision levels. In contrast, the regularity of the region around the vertex may change as the presence of irregular faces or semi-sharp features is reduced by subdivision.

\n \n-

Definition at line 162 of file topologyLevel.h.

\n+

Definition at line 162 of file topologyLevel.h.

\n \n
\n \n \n

◆ PrintTopology()

\n \n
\n@@ -1617,15 +1617,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 287 of file topologyLevel.h.

\n+

Definition at line 287 of file topologyLevel.h.

\n \n
\n \n \n

◆ ValidateTopology()

\n \n
\n@@ -1644,15 +1644,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 286 of file topologyLevel.h.

\n+

Definition at line 286 of file topologyLevel.h.

\n \n
\n \n

Friends And Related Symbol Documentation

\n \n

◆ TopologyRefiner

\n \n@@ -1669,20 +1669,20 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 292 of file topologyLevel.h.

\n+

Definition at line 292 of file topologyLevel.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • TopologyLevel
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01117.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01117.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    TopologyRefinerFactory< MESH > Class Template Reference
    \n
\n
\n \n

Factory for constructing TopologyRefiners from specific mesh classes. \n More...

\n \n-

#include <topologyRefinerFactory.h>

\n+

#include <topologyRefinerFactory.h>

\n
\n Inheritance diagram for TopologyRefinerFactory< MESH >:
\n
\n
\n \"\"/\n \n \"TopologyRefinerFactoryBase\"\n@@ -277,15 +277,15 @@\n \n

Detailed Description

\n
template<class MESH>
\n class OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactory< MESH >

Factory for constructing TopologyRefiners from specific mesh classes.

\n

TopologyRefinerFactory<MESH> is the factory class template to convert an instance of TopologyRefiner from an arbitrary mesh class. While a class template, the implementation is not (cannot) be complete, so specialization of a few methods is required (it is a stateless factory, so no instance and only static methods).

\n

This template provides both the interface and high level assembly for the construction of the TopologyRefiner instance. The high level construction executes a specific set of operations to convert the client's MESH into TopologyRefiner. This set of operations combines methods independent of MESH from the base class with those specialized here for class MESH.

\n \n-

Definition at line 78 of file topologyRefinerFactory.h.

\n+

Definition at line 78 of file topologyRefinerFactory.h.

\n

Member Typedef Documentation

\n \n

◆ TopologyError

\n \n
\n
\n
\n@@ -301,15 +301,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 131 of file topologyRefinerFactory.h.

\n+

Definition at line 131 of file topologyRefinerFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ assignComponentTags()

\n \n@@ -344,15 +344,15 @@\n staticprotected \n \n \n
\n \n

(Optional) Specify edge or vertex sharpness or face holes

\n \n-

Definition at line 690 of file topologyRefinerFactory.h.

\n+

Definition at line 690 of file topologyRefinerFactory.h.

\n \n
\n
\n \n

◆ assignComponentTopology()

\n \n
\n@@ -386,15 +386,15 @@\n staticprotected \n \n \n
\n \n

Specify the relationships between vertices, faces, etc. ie the face-vertices, vertex-faces, edge-vertices, etc.

\n \n-

Definition at line 621 of file topologyRefinerFactory.h.

\n+

Definition at line 621 of file topologyRefinerFactory.h.

\n \n
\n
\n \n

◆ assignFaceVaryingTopology()

\n \n
\n@@ -428,15 +428,15 @@\n staticprotected \n \n \n
\n \n

(Optional) Specify face-varying data per face

\n \n-

Definition at line 674 of file topologyRefinerFactory.h.

\n+

Definition at line 674 of file topologyRefinerFactory.h.

\n \n
\n
\n \n

◆ Create() [1/2]

\n \n
\n@@ -479,15 +479,15 @@\n meshClient's topological representation (or a converter) \n optionsOptions controlling the creation of the TopologyRefiner\n \n \n \n
Returns
A new instance of TopologyRefiner or 0 for failure
\n \n-

Definition at line 346 of file topologyRefinerFactory.h.

\n+

Definition at line 346 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ Create() [2/2]

\n \n
\n@@ -519,15 +519,15 @@\n \n \n
baseLevelAn existing TopologyRefiner to share base level.
\n \n \n
Returns
A new instance of TopologyRefiner or 0 for failure
\n \n-

Definition at line 364 of file topologyRefinerFactory.h.

\n+

Definition at line 364 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ createBaseFVarChannel() [1/2]

\n \n
\n@@ -561,15 +561,15 @@\n inlinestaticprotected \n \n \n
\n \n

Create a new face-varying channel with the given number of values.

\n \n-

Definition at line 561 of file topologyRefinerFactory.h.

\n+

Definition at line 561 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ createBaseFVarChannel() [2/2]

\n \n
\n@@ -609,15 +609,15 @@\n inlinestaticprotected \n \n \n
\n \n

Create a new face-varying channel with the given number of values and independent interpolation options.

\n \n-

Definition at line 566 of file topologyRefinerFactory.h.

\n+

Definition at line 566 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ findBaseEdge()

\n \n
\n@@ -657,15 +657,15 @@\n inlinestaticprotected \n \n \n
\n \n

Identify an edge to be assigned a sharpness value given a vertex pair.

\n \n-

Definition at line 521 of file topologyRefinerFactory.h.

\n+

Definition at line 521 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseEdgeFaceLocalIndices()

\n \n
\n@@ -699,15 +699,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the local indices of an edge within each of its incident faces.

\n \n-

Definition at line 505 of file topologyRefinerFactory.h.

\n+

Definition at line 505 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseEdgeFaces()

\n \n
\n@@ -741,15 +741,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the faces incident each edge.

\n \n-

Definition at line 489 of file topologyRefinerFactory.h.

\n+

Definition at line 489 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseEdgeVertices()

\n \n
\n@@ -783,15 +783,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the vertices incident each edge.

\n \n-

Definition at line 484 of file topologyRefinerFactory.h.

\n+

Definition at line 484 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseFaceEdges()

\n \n
\n@@ -825,15 +825,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the edges incident each face.

\n \n-

Definition at line 479 of file topologyRefinerFactory.h.

\n+

Definition at line 479 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseFaceFVarValues()

\n \n
\n@@ -873,15 +873,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the face-varying values for the corners of each face.

\n \n-

Definition at line 573 of file topologyRefinerFactory.h.

\n+

Definition at line 573 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseFaceVertices()

\n \n
\n@@ -915,15 +915,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the vertices incident each face.

\n \n-

Definition at line 474 of file topologyRefinerFactory.h.

\n+

Definition at line 474 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseVertexEdgeLocalIndices()

\n \n
\n@@ -957,15 +957,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the local indices of a vertex within each of its incident edges.

\n \n-

Definition at line 515 of file topologyRefinerFactory.h.

\n+

Definition at line 515 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseVertexEdges()

\n \n
\n@@ -999,15 +999,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the edges incident each vertex.

\n \n-

Definition at line 499 of file topologyRefinerFactory.h.

\n+

Definition at line 499 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseVertexFaceLocalIndices()

\n \n
\n@@ -1041,15 +1041,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the local indices of a vertex within each of its incident faces.

\n \n-

Definition at line 510 of file topologyRefinerFactory.h.

\n+

Definition at line 510 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getBaseVertexFaces()

\n \n
\n@@ -1083,15 +1083,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign the faces incident each vertex.

\n \n-

Definition at line 494 of file topologyRefinerFactory.h.

\n+

Definition at line 494 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getNumBaseEdges()

\n \n
\n@@ -1113,15 +1113,15 @@\n \n \n inlinestaticprotected \n \n \n
\n \n-

Definition at line 441 of file topologyRefinerFactory.h.

\n+

Definition at line 441 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getNumBaseFaces()

\n \n
\n@@ -1143,15 +1143,15 @@\n \n \n inlinestaticprotected \n \n \n
\n \n-

Definition at line 436 of file topologyRefinerFactory.h.

\n+

Definition at line 436 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ getNumBaseVertices()

\n \n
\n@@ -1173,15 +1173,15 @@\n \n \n inlinestaticprotected \n \n \n
\n \n-

Definition at line 446 of file topologyRefinerFactory.h.

\n+

Definition at line 446 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ populateBaseLevel()

\n \n
\n@@ -1219,15 +1219,15 @@\n \n \n staticprotected \n \n \n
\n \n-

Definition at line 371 of file topologyRefinerFactory.h.

\n+

Definition at line 371 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ populateBaseLocalIndices()

\n \n
\n@@ -1251,15 +1251,15 @@\n inlinestaticprotected \n \n \n
\n \n

Determine all local indices by inspection (only for pure manifold meshes)

\n \n-

Definition at line 527 of file topologyRefinerFactory.h.

\n+

Definition at line 527 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ reportInvalidTopology()

\n \n
\n@@ -1299,15 +1299,15 @@\n staticprotected \n \n \n
\n \n

(Optional) Control run-time topology validation and error reporting

\n \n-

Definition at line 707 of file topologyRefinerFactory.h.

\n+

Definition at line 707 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ resizeComponentTopology()

\n \n
\n@@ -1341,15 +1341,15 @@\n staticprotected \n \n \n
\n \n

Specify the number of vertices, faces, face-vertices, etc.

\n \n-

Definition at line 580 of file topologyRefinerFactory.h.

\n+

Definition at line 580 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setBaseEdgeNonManifold()

\n \n
\n@@ -1389,15 +1389,15 @@\n inlinestaticprotected \n \n \n
\n \n

Tag an edge as non-manifold.

\n \n-

Definition at line 533 of file topologyRefinerFactory.h.

\n+

Definition at line 533 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setBaseEdgeSharpness()

\n \n
\n@@ -1437,15 +1437,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign a sharpness value to a given edge.

\n \n-

Definition at line 544 of file topologyRefinerFactory.h.

\n+

Definition at line 544 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setBaseFaceHole()

\n \n
\n@@ -1485,15 +1485,15 @@\n inlinestaticprotected \n \n \n
\n \n

Tag a face as a hole.

\n \n-

Definition at line 554 of file topologyRefinerFactory.h.

\n+

Definition at line 554 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setBaseVertexNonManifold()

\n \n
\n@@ -1533,15 +1533,15 @@\n inlinestaticprotected \n \n \n
\n \n

Tag a vertex as non-manifold.

\n \n-

Definition at line 538 of file topologyRefinerFactory.h.

\n+

Definition at line 538 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setBaseVertexSharpness()

\n \n
\n@@ -1581,15 +1581,15 @@\n inlinestaticprotected \n \n \n
\n \n

Assign a sharpness value to a given vertex.

\n \n-

Definition at line 549 of file topologyRefinerFactory.h.

\n+

Definition at line 549 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseEdgeFaces()

\n \n
\n@@ -1629,15 +1629,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of faces incident each edge.

\n \n-

Definition at line 458 of file topologyRefinerFactory.h.

\n+

Definition at line 458 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseEdges()

\n \n
\n@@ -1671,15 +1671,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of edges to be accommodated.

\n \n-

Definition at line 425 of file topologyRefinerFactory.h.

\n+

Definition at line 425 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseFaces()

\n \n
\n@@ -1713,15 +1713,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of faces to be accommodated.

\n \n-

Definition at line 420 of file topologyRefinerFactory.h.

\n+

Definition at line 420 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseFaceVertices()

\n \n
\n@@ -1761,15 +1761,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of vertices incident each face.

\n \n-

Definition at line 452 of file topologyRefinerFactory.h.

\n+

Definition at line 452 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseVertexEdges()

\n \n
\n@@ -1809,15 +1809,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of edges incident each vertex.

\n \n-

Definition at line 468 of file topologyRefinerFactory.h.

\n+

Definition at line 468 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseVertexFaces()

\n \n
\n@@ -1857,15 +1857,15 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of faces incident each vertex.

\n \n-

Definition at line 463 of file topologyRefinerFactory.h.

\n+

Definition at line 463 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ setNumBaseVertices()

\n \n
\n@@ -1899,21 +1899,21 @@\n inlinestaticprotected \n \n \n
\n \n

Specify the number of vertices to be accommodated.

\n \n-

Definition at line 430 of file topologyRefinerFactory.h.

\n+

Definition at line 430 of file topologyRefinerFactory.h.

\n \n
\n \n
The documentation for this class was generated from the following files:\n \n \n \n
\n
\n
\n \n

Stores topology data for a specified set of refinement options. \n More...

\n \n-

#include <topologyRefiner.h>

\n+

#include <topologyRefiner.h>

\n \n \n \n \n \n \n@@ -208,15 +208,15 @@\n \n \n \n

\n Classes

struct  AdaptiveOptions
 Adaptive refinement options. More...
 
struct  UniformOptions
 
 TopologyRefiner (TopologyRefiner const &source)
 
\n

Detailed Description

\n

Stores topology data for a specified set of refinement options.

\n \n-

Definition at line 51 of file topologyRefiner.h.

\n+

Definition at line 51 of file topologyRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ TopologyRefiner() [1/2]

\n \n
\n
\n \n@@ -311,15 +311,15 @@\n inline\n \n
\n
\n \n

Returns the options specified on refinement.

\n \n-

Definition at line 196 of file topologyRefiner.h.

\n+

Definition at line 196 of file topologyRefiner.h.

\n \n
\n
\n \n

◆ GetFVarLinearInterpolation()

\n \n
\n@@ -341,15 +341,15 @@\n inline \n \n \n
\n \n

Returns the face-varying interpolation rule set for a given channel.

\n \n-

Definition at line 298 of file topologyRefiner.h.

\n+

Definition at line 298 of file topologyRefiner.h.

\n \n
\n
\n \n

◆ getLevel() [1/2]

\n \n
\n@@ -369,15 +369,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 236 of file topologyRefiner.h.

\n+

Definition at line 236 of file topologyRefiner.h.

\n \n
\n \n \n

◆ getLevel() [2/2]

\n \n
\n@@ -397,15 +397,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 237 of file topologyRefiner.h.

\n+

Definition at line 237 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetLevel()

\n \n
\n@@ -427,15 +427,15 @@\n inline \n \n \n
\n \n

Returns a handle to access data specific to a particular level.

\n \n-

Definition at line 95 of file topologyRefiner.h.

\n+

Definition at line 95 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetMaxLevel()

\n \n
\n@@ -456,15 +456,15 @@\n inline \n \n \n
\n \n

Returns the highest level of refinement.

\n \n-

Definition at line 74 of file topologyRefiner.h.

\n+

Definition at line 74 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetMaxValence()

\n \n
\n@@ -485,15 +485,15 @@\n inline \n \n \n
\n \n

Returns the maximum vertex valence in all levels.

\n \n-

Definition at line 77 of file topologyRefiner.h.

\n+

Definition at line 77 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumEdgesTotal()

\n \n
\n@@ -514,15 +514,15 @@\n inline \n \n \n
\n \n

Returns the total number of edges in all levels.

\n \n-

Definition at line 86 of file topologyRefiner.h.

\n+

Definition at line 86 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumFacesTotal()

\n \n
\n@@ -543,15 +543,15 @@\n inline \n \n \n
\n \n

Returns the total number of edges in all levels.

\n \n-

Definition at line 89 of file topologyRefiner.h.

\n+

Definition at line 89 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumFaceVerticesTotal()

\n \n
\n@@ -572,15 +572,15 @@\n inline \n \n \n
\n \n

Returns the total number of face vertices in all levels.

\n \n-

Definition at line 92 of file topologyRefiner.h.

\n+

Definition at line 92 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -601,15 +601,15 @@\n inline \n \n \n
\n \n

Returns the number of face-varying channels in the tables.

\n \n-

Definition at line 293 of file topologyRefiner.h.

\n+

Definition at line 293 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumFVarValuesTotal()

\n \n
\n@@ -650,15 +650,15 @@\n inline \n \n \n
\n \n

Returns the number of refinement levels.

\n \n-

Definition at line 71 of file topologyRefiner.h.

\n+

Definition at line 71 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetNumVerticesTotal()

\n \n
\n@@ -679,15 +679,15 @@\n inline \n \n \n
\n \n

Returns the total number of vertices in all levels.

\n \n-

Definition at line 83 of file topologyRefiner.h.

\n+

Definition at line 83 of file topologyRefiner.h.

\n \n
\n \n \n

◆ getRefinement() [1/2]

\n \n
\n@@ -707,15 +707,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 239 of file topologyRefiner.h.

\n+

Definition at line 239 of file topologyRefiner.h.

\n \n
\n \n \n

◆ getRefinement() [2/2]

\n \n
\n@@ -735,15 +735,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 240 of file topologyRefiner.h.

\n+

Definition at line 240 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetSchemeOptions()

\n \n
\n@@ -764,15 +764,15 @@\n inline \n \n \n
\n \n

Returns the subdivision options.

\n \n-

Definition at line 65 of file topologyRefiner.h.

\n+

Definition at line 65 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetSchemeType()

\n \n
\n@@ -793,15 +793,15 @@\n inline \n \n \n
\n \n

Returns the subdivision scheme.

\n \n-

Definition at line 62 of file topologyRefiner.h.

\n+

Definition at line 62 of file topologyRefiner.h.

\n \n
\n \n \n

◆ GetUniformOptions()

\n \n
\n@@ -822,15 +822,15 @@\n inline \n \n \n
\n \n

Returns the options specified on refinement.

\n \n-

Definition at line 149 of file topologyRefiner.h.

\n+

Definition at line 149 of file topologyRefiner.h.

\n \n
\n \n \n

◆ HasHoles()

\n \n
\n@@ -851,15 +851,15 @@\n inline \n \n \n
\n \n

Returns true if faces have been tagged as holes.

\n \n-

Definition at line 80 of file topologyRefiner.h.

\n+

Definition at line 80 of file topologyRefiner.h.

\n \n
\n \n \n

◆ IsUniform()

\n \n
\n@@ -880,15 +880,15 @@\n inline \n \n \n
\n \n

Returns true if uniform refinement has been applied.

\n \n-

Definition at line 68 of file topologyRefiner.h.

\n+

Definition at line 68 of file topologyRefiner.h.

\n \n
\n \n \n

◆ RefineAdaptive()

\n \n
\n@@ -989,15 +989,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 226 of file topologyRefiner.h.

\n+

Definition at line 226 of file topologyRefiner.h.

\n \n
\n \n \n

◆ PatchTableBuilder

\n \n
\n@@ -1013,15 +1013,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 225 of file topologyRefiner.h.

\n+

Definition at line 225 of file topologyRefiner.h.

\n \n
\n \n \n

◆ PrimvarRefinerReal

\n \n
\n@@ -1039,15 +1039,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 229 of file topologyRefiner.h.

\n+

Definition at line 229 of file topologyRefiner.h.

\n \n
\n \n \n

◆ PtexIndices

\n \n
\n@@ -1063,15 +1063,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 227 of file topologyRefiner.h.

\n+

Definition at line 227 of file topologyRefiner.h.

\n \n
\n \n \n

◆ TopologyRefinerFactory

\n \n
\n@@ -1089,15 +1089,15 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 223 of file topologyRefiner.h.

\n+

Definition at line 223 of file topologyRefiner.h.

\n \n
\n \n \n

◆ TopologyRefinerFactoryBase

\n \n
\n@@ -1113,20 +1113,20 @@\n \n \n friend \n \n \n
\n \n-

Definition at line 224 of file topologyRefiner.h.

\n+

Definition at line 224 of file topologyRefiner.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • TopologyRefiner
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01125.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01125.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    TopologyRefiner::UniformOptions Struct Reference
    \n
\n
\n \n

Uniform refinement options. \n More...

\n \n-

#include <topologyRefiner.h>

\n+

#include <topologyRefiner.h>

\n \n \n \n \n \n \n@@ -123,15 +123,15 @@\n \n

\n Public Member Functions

 UniformOptions (int level)
 
void SetRefinementLevel (int level)
 Set uniform refinement level.
 
\n

Detailed Description

\n

Uniform refinement options.

\n

Options for uniform refinement, including the number of levels, vertex ordering and generation of topology information.

\n

Note the impact of the option to generate fullTopologyInLastLevel. Given subsequent levels of uniform refinement typically reguire 4x the data of the previous level, only the minimum amount of data is generated in the last level by default, i.e. a vertex and face-vertex list. If requiring topology traversal of the last level, e.g. inspecting edges or incident faces of vertices, the option to generate full topology in the last level should be enabled.

\n \n-

Definition at line 118 of file topologyRefiner.h.

\n+

Definition at line 118 of file topologyRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ UniformOptions()

\n \n
\n
\n \n@@ -149,15 +149,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 120 of file topologyRefiner.h.

\n+

Definition at line 120 of file topologyRefiner.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ SetRefinementLevel()

\n \n@@ -180,15 +180,15 @@\n inline \n \n \n
\n \n

Set uniform refinement level.

\n \n-

Definition at line 126 of file topologyRefiner.h.

\n+

Definition at line 126 of file topologyRefiner.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ fullTopologyInLastLevel

\n \n@@ -198,15 +198,15 @@\n \n unsigned int fullTopologyInLastLevel\n \n \n
\n

Skip topological relationships in the last level of refinement that are not needed for interpolation (keep false if using limit).

\n \n-

Definition at line 131 of file topologyRefiner.h.

\n+

Definition at line 131 of file topologyRefiner.h.

\n \n
\n \n \n

◆ orderVerticesFromFacesFirst

\n \n
\n@@ -215,15 +215,15 @@\n \n unsigned int orderVerticesFromFacesFirst\n \n \n
\n

Order child vertices from faces first instead of child vertices of vertices

\n \n-

Definition at line 129 of file topologyRefiner.h.

\n+

Definition at line 129 of file topologyRefiner.h.

\n \n
\n \n \n

◆ refinementLevel

\n \n
\n@@ -233,20 +233,20 @@\n unsigned int refinementLevel\n \n \n
\n \n

Number of refinement iterations.

\n \n-

Definition at line 128 of file topologyRefiner.h.

\n+

Definition at line 128 of file topologyRefiner.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Adaptive refinement options. \n More...

\n \n-

#include <topologyRefiner.h>

\n+

#include <topologyRefiner.h>

\n \n \n \n \n \n \n@@ -129,15 +129,15 @@\n \n \n \n

\n Public Member Functions

 AdaptiveOptions (int level)
 
void SetIsolationLevel (int level)
 Set isolation level.
 
unsigned int orderVerticesFromFacesFirst:1
 
\n

Detailed Description

\n

Adaptive refinement options.

\n \n-

Definition at line 156 of file topologyRefiner.h.

\n+

Definition at line 156 of file topologyRefiner.h.

\n

Constructor & Destructor Documentation

\n \n

◆ AdaptiveOptions()

\n \n
\n
\n \n@@ -155,15 +155,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 158 of file topologyRefiner.h.

\n+

Definition at line 158 of file topologyRefiner.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ SetIsolationLevel()

\n \n@@ -186,15 +186,15 @@\n inline \n \n \n
\n \n

Set isolation level.

\n \n-

Definition at line 167 of file topologyRefiner.h.

\n+

Definition at line 167 of file topologyRefiner.h.

\n \n
\n \n \n

◆ SetSecondaryLevel()

\n \n
\n@@ -216,15 +216,15 @@\n inline \n \n \n
\n \n

Set secondary isolation level.

\n \n-

Definition at line 170 of file topologyRefiner.h.

\n+

Definition at line 170 of file topologyRefiner.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ considerFVarChannels

\n \n@@ -234,15 +234,15 @@\n \n unsigned int considerFVarChannels\n \n \n
\n

Inspect face-varying channels and isolate when irregular features present

\n \n-

Definition at line 180 of file topologyRefiner.h.

\n+

Definition at line 180 of file topologyRefiner.h.

\n \n
\n \n \n

◆ isolationLevel

\n \n
\n@@ -251,15 +251,15 @@\n \n unsigned int isolationLevel\n \n \n
\n

Number of iterations applied to isolate extraordinary vertices and creases

\n \n-

Definition at line 172 of file topologyRefiner.h.

\n+

Definition at line 172 of file topologyRefiner.h.

\n \n
\n \n \n

◆ orderVerticesFromFacesFirst

\n \n
\n@@ -268,15 +268,15 @@\n \n unsigned int orderVerticesFromFacesFirst\n \n \n
\n

Order child vertices from faces first instead of child vertices of vertices

\n \n-

Definition at line 182 of file topologyRefiner.h.

\n+

Definition at line 182 of file topologyRefiner.h.

\n \n
\n \n \n

◆ secondaryLevel

\n \n
\n@@ -285,15 +285,15 @@\n \n unsigned int secondaryLevel\n \n \n
\n

Shallower level to stop isolation of smooth irregular features

\n \n-

Definition at line 174 of file topologyRefiner.h.

\n+

Definition at line 174 of file topologyRefiner.h.

\n \n
\n \n \n

◆ useInfSharpPatch

\n \n
\n@@ -302,15 +302,15 @@\n \n unsigned int useInfSharpPatch\n \n \n
\n

Use infinitely sharp patches and stop isolation where applicable

\n \n-

Definition at line 178 of file topologyRefiner.h.

\n+

Definition at line 178 of file topologyRefiner.h.

\n \n
\n \n \n

◆ useSingleCreasePatch

\n \n
\n@@ -319,20 +319,20 @@\n \n unsigned int useSingleCreasePatch\n \n \n
\n

Use 'single-crease' patch and stop isolation where applicable

\n \n-

Definition at line 176 of file topologyRefiner.h.

\n+

Definition at line 176 of file topologyRefiner.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

Private base class of Factories for constructing TopologyRefiners. \n More...

\n \n-

#include <topologyRefinerFactory.h>

\n+

#include <topologyRefinerFactory.h>

\n
\n Inheritance diagram for TopologyRefinerFactoryBase:
\n
\n
\n \"\"/\n \n \"TopologyRefinerFactory<\n@@ -129,15 +129,15 @@\n static bool prepareFaceVaryingChannels (TopologyRefiner &refiner)\n  \n \n

Detailed Description

\n

Private base class of Factories for constructing TopologyRefiners.

\n

TopologyRefinerFactoryBase is the base class for subclasses that are intended to construct TopologyRefiners directly from meshes in their native representations. The subclasses are parameterized by the mesh type <class MESH> and are expected to inherit the details related to assembly and validation provided here that are independent of the subclass' mesh type.

\n \n-

Definition at line 47 of file topologyRefinerFactory.h.

\n+

Definition at line 47 of file topologyRefinerFactory.h.

\n

Member Typedef Documentation

\n \n

◆ TopologyCallback

\n \n
\n
\n \n@@ -151,15 +151,15 @@\n \n \n \n
\n protected
\n
\n \n-

Definition at line 54 of file topologyRefinerFactory.h.

\n+

Definition at line 54 of file topologyRefinerFactory.h.

\n \n
\n
\n

Member Function Documentation

\n \n

◆ prepareComponentTagsAndSharpness()

\n \n@@ -283,15 +283,15 @@\n \n \n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Far
  • TopologyRefinerFactoryBase
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01137.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01137.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    TopologyRefinerFactory< MESH >::Options Struct Reference
    \n
\n
\n \n

Options related to the construction of each TopologyRefiner. \n More...

\n \n-

#include <topologyRefinerFactory.h>

\n+

#include <topologyRefinerFactory.h>

\n \n \n \n \n

\n Public Member Functions

 Options (Sdc::SchemeType sdcType=Sdc::SCHEME_CATMARK, Sdc::Options sdcOptions=Sdc::Options())
 
\n \n \n

\n@@ -119,15 +119,15 @@\n

unsigned int validateFullTopology: 1
 
\n

Detailed Description

\n
template<class MESH>
\n struct OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactory< MESH >::Options

Options related to the construction of each TopologyRefiner.

\n \n-

Definition at line 84 of file topologyRefinerFactory.h.

\n+

Definition at line 84 of file topologyRefinerFactory.h.

\n

Constructor & Destructor Documentation

\n \n

◆ Options()

\n \n
\n
\n
\n@@ -157,15 +157,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 86 of file topologyRefinerFactory.h.

\n+

Definition at line 86 of file topologyRefinerFactory.h.

\n \n
\n
\n

Member Data Documentation

\n \n

◆ schemeOptions

\n \n@@ -177,15 +177,15 @@\n \n Sdc::Options schemeOptions\n \n \n
\n

The full set of options for the scheme, e.g. boundary interpolation rules...

\n \n-

Definition at line 92 of file topologyRefinerFactory.h.

\n+

Definition at line 92 of file topologyRefinerFactory.h.

\n \n
\n
\n \n

◆ schemeType

\n \n
\n@@ -197,15 +197,15 @@\n Sdc::SchemeType schemeType\n \n \n
\n \n

The subdivision scheme type identifier.

\n \n-

Definition at line 91 of file topologyRefinerFactory.h.

\n+

Definition at line 91 of file topologyRefinerFactory.h.

\n \n
\n \n \n

◆ validateFullTopology

\n \n
\n@@ -216,20 +216,20 @@\n \n unsigned int validateFullTopology\n \n \n
\n

Apply more extensive validation of the constructed topology – intended for debugging.

\n \n-

Definition at line 94 of file topologyRefinerFactory.h.

\n+

Definition at line 94 of file topologyRefinerFactory.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
\n
\n \n

BufferDescriptor is a struct which describes buffer elements in interleaved data buffers. Almost all Osd Evaluator APIs take BufferDescriptors along with device-specific buffer objects. \n More...

\n \n-

#include <bufferDescriptor.h>

\n+

#include <bufferDescriptor.h>

\n \n \n \n \n \n \n@@ -143,15 +143,15 @@\n

Detailed Description

\n

BufferDescriptor is a struct which describes buffer elements in interleaved data buffers. Almost all Osd Evaluator APIs take BufferDescriptors along with device-specific buffer objects.

\n

The offset of BufferDescriptor can also be used to express a batching offset if the data buffer is combined across multiple objects together.

\n
    \n
  • Note that each element has the same data type (float)
  • \n
\n \n-

Definition at line 61 of file bufferDescriptor.h.

\n+

Definition at line 61 of file bufferDescriptor.h.

\n

Constructor & Destructor Documentation

\n \n

◆ BufferDescriptor() [1/2]

\n \n
\n
\n

\n Public Member Functions

 BufferDescriptor ()
 Default Constructor.
 
 BufferDescriptor (int o, int l, int s)
\n@@ -170,15 +170,15 @@\n inline\n \n
\n
\n \n

Default Constructor.

\n \n-

Definition at line 64 of file bufferDescriptor.h.

\n+

Definition at line 64 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ BufferDescriptor() [2/2]

\n \n
\n@@ -216,15 +216,15 @@\n inline \n \n \n
\n \n

Constructor.

\n \n-

Definition at line 67 of file bufferDescriptor.h.

\n+

Definition at line 67 of file bufferDescriptor.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ GetLocalOffset()

\n \n@@ -246,15 +246,15 @@\n inline \n \n \n
\n \n

Returns the relative offset within a stride.

\n \n-

Definition at line 70 of file bufferDescriptor.h.

\n+

Definition at line 70 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ IsValid()

\n \n
\n@@ -275,15 +275,15 @@\n inline \n \n \n
\n \n

True if the descriptor values are internally consistent.

\n \n-

Definition at line 75 of file bufferDescriptor.h.

\n+

Definition at line 75 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ operator!=()

\n \n
\n@@ -305,15 +305,15 @@\n inline \n \n \n
\n \n

True if the descriptors are not identical.

\n \n-

Definition at line 93 of file bufferDescriptor.h.

\n+

Definition at line 93 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ operator==()

\n \n
\n@@ -335,15 +335,15 @@\n inline \n \n \n
\n \n

True if the descriptors are identical.

\n \n-

Definition at line 86 of file bufferDescriptor.h.

\n+

Definition at line 86 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ Reset()

\n \n
\n@@ -364,15 +364,15 @@\n inline \n \n \n
\n \n

Resets the descriptor to default.

\n \n-

Definition at line 81 of file bufferDescriptor.h.

\n+

Definition at line 81 of file bufferDescriptor.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ length

\n \n@@ -383,15 +383,15 @@\n int length\n \n \n
\n \n

number or length of the data

\n \n-

Definition at line 100 of file bufferDescriptor.h.

\n+

Definition at line 100 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ offset

\n \n
\n@@ -401,15 +401,15 @@\n int offset\n \n \n
\n \n

offset to desired element data

\n \n-

Definition at line 98 of file bufferDescriptor.h.

\n+

Definition at line 98 of file bufferDescriptor.h.

\n \n
\n \n \n

◆ stride

\n \n
\n@@ -419,20 +419,20 @@\n int stride\n \n \n
\n \n

stride to the next element

\n \n-

Definition at line 102 of file bufferDescriptor.h.

\n+

Definition at line 102 of file bufferDescriptor.h.

\n \n
\n \n
The documentation for this struct was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • BufferDescriptor
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01145.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01145.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    CLStencilTable Class Reference
    \n
\n
\n \n

OpenCL stencil table. \n More...

\n \n-

#include <clEvaluator.h>

\n+

#include <clEvaluator.h>

\n \n \n \n \n \n \n@@ -143,15 +143,15 @@\n \n

\n Public Member Functions

 CLStencilTable (Far::StencilTable const *stencilTable, cl_context clContext)
 
 CLStencilTable (Far::LimitStencilTable const *limitStencilTable, cl_context clContext)
 
 
\n

Detailed Description

\n

OpenCL stencil table.

\n

This class is an OpenCL buffer representation of Far::StencilTable.

\n

CLCompute consumes this table to apply stencils

\n \n-

Definition at line 52 of file clEvaluator.h.

\n+

Definition at line 52 of file clEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ CLStencilTable() [1/2]

\n \n
\n
\n \n@@ -255,15 +255,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 61 of file clEvaluator.h.

\n+

Definition at line 61 of file clEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -295,15 +295,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 55 of file clEvaluator.h.

\n+

Definition at line 55 of file clEvaluator.h.

\n \n
\n
\n \n

◆ GetDuuWeightsBuffer()

\n \n
\n@@ -322,15 +322,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 80 of file clEvaluator.h.

\n+

Definition at line 80 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDuvWeightsBuffer()

\n \n
\n@@ -349,15 +349,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 81 of file clEvaluator.h.

\n+

Definition at line 81 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDuWeightsBuffer()

\n \n
\n@@ -376,15 +376,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file clEvaluator.h.

\n+

Definition at line 78 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDvvWeightsBuffer()

\n \n
\n@@ -403,15 +403,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 82 of file clEvaluator.h.

\n+

Definition at line 82 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetDvWeightsBuffer()

\n \n
\n@@ -430,15 +430,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file clEvaluator.h.

\n+

Definition at line 79 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetIndicesBuffer()

\n \n
\n@@ -457,15 +457,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file clEvaluator.h.

\n+

Definition at line 76 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -484,15 +484,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 83 of file clEvaluator.h.

\n+

Definition at line 83 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsBuffer()

\n \n
\n@@ -511,15 +511,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file clEvaluator.h.

\n+

Definition at line 75 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetSizesBuffer()

\n \n
\n@@ -538,15 +538,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 74 of file clEvaluator.h.

\n+

Definition at line 74 of file clEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsBuffer()

\n \n
\n@@ -565,20 +565,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file clEvaluator.h.

\n+

Definition at line 77 of file clEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
CLEvaluator Class Reference
\n \n
\n \n-

#include <clEvaluator.h>

\n+

#include <clEvaluator.h>

\n \n \n \n \n

\n Public Types

typedef bool Instantiatable
 
\n \n \n \n \n

\n@@ -245,29 +245,29 @@\n

 Wait the OpenCL kernels finish.
 
static void Synchronize (cl_command_queue queue)
 
\n

Detailed Description

\n
\n-

Definition at line 100 of file clEvaluator.h.

\n+

Definition at line 100 of file clEvaluator.h.

\n

Member Typedef Documentation

\n \n

◆ Instantiatable

\n \n
\n
\n \n \n \n \n
typedef bool Instantiatable
\n
\n \n-

Definition at line 102 of file clEvaluator.h.

\n+

Definition at line 102 of file clEvaluator.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ CLEvaluator()

\n \n@@ -452,15 +452,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 145 of file clEvaluator.h.

\n+

Definition at line 145 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [2/4]

\n \n
\n@@ -530,15 +530,15 @@\n inlinestatic \n \n \n
\n \n

Generic creator template.

\n \n-

Definition at line 131 of file clEvaluator.h.

\n+

Definition at line 131 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [3/4]

\n \n
\n@@ -592,15 +592,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 116 of file clEvaluator.h.

\n+

Definition at line 116 of file clEvaluator.h.

\n \n
\n \n \n

◆ Create() [4/4]

\n \n
\n@@ -652,15 +652,15 @@\n inlinestatic \n \n \n
\n \n

Generic creator template.

\n \n-

Definition at line 106 of file clEvaluator.h.

\n+

Definition at line 106 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [1/8]

\n \n
\n@@ -1101,15 +1101,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1125 of file clEvaluator.h.

\n+

Definition at line 1125 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [4/8]

\n \n
\n@@ -1276,15 +1276,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1379 of file clEvaluator.h.

\n+

Definition at line 1379 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [5/8]

\n \n
\n@@ -1423,15 +1423,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1003 of file clEvaluator.h.

\n+

Definition at line 1003 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [6/8]

\n \n
\n@@ -1556,15 +1556,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1288 of file clEvaluator.h.

\n+

Definition at line 1288 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [7/8]

\n \n
\n@@ -1678,15 +1678,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 902 of file clEvaluator.h.

\n+

Definition at line 902 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [8/8]

\n \n
\n@@ -1783,15 +1783,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1217 of file clEvaluator.h.

\n+

Definition at line 1217 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [1/6]

\n \n
\n@@ -1979,15 +1979,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2437 of file clEvaluator.h.

\n+

Definition at line 2437 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [2/6]

\n \n
\n@@ -2161,15 +2161,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2564 of file clEvaluator.h.

\n+

Definition at line 2564 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/6]

\n \n
\n@@ -2315,15 +2315,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2231 of file clEvaluator.h.

\n+

Definition at line 2231 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [4/6]

\n \n
\n@@ -2455,15 +2455,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2329 of file clEvaluator.h.

\n+

Definition at line 2329 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [5/6]

\n \n
\n@@ -2581,15 +2581,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2061 of file clEvaluator.h.

\n+

Definition at line 2061 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [6/6]

\n \n
\n@@ -2693,15 +2693,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 2143 of file clEvaluator.h.

\n+

Definition at line 2143 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/6]

\n \n
\n@@ -2882,15 +2882,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1854 of file clEvaluator.h.

\n+

Definition at line 1854 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/6]

\n \n
\n@@ -3057,15 +3057,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1978 of file clEvaluator.h.

\n+

Definition at line 1978 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/6]

\n \n
\n@@ -3204,15 +3204,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1653 of file clEvaluator.h.

\n+

Definition at line 1653 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [4/6]

\n \n
\n@@ -3337,15 +3337,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1749 of file clEvaluator.h.

\n+

Definition at line 1749 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [5/6]

\n \n
\n@@ -3456,15 +3456,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1489 of file clEvaluator.h.

\n+

Definition at line 1489 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [6/6]

\n \n
\n@@ -3561,15 +3561,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 1568 of file clEvaluator.h.

\n+

Definition at line 1568 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/9]

\n \n
\n@@ -4206,15 +4206,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 421 of file clEvaluator.h.

\n+

Definition at line 421 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/9]

\n \n
\n@@ -4367,15 +4367,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 646 of file clEvaluator.h.

\n+

Definition at line 646 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/9]

\n \n
\n@@ -4500,15 +4500,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 309 of file clEvaluator.h.

\n+

Definition at line 309 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [7/9]

\n \n
\n@@ -4619,15 +4619,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 561 of file clEvaluator.h.

\n+

Definition at line 561 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [8/9]

\n \n
\n@@ -4727,15 +4727,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 219 of file clEvaluator.h.

\n+

Definition at line 219 of file clEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [9/9]

\n \n
\n@@ -4818,15 +4818,15 @@\n numStartEventsthe number of events in the array pointed to by startEvents.\n startEventspoints to an array of cl_event which will determine when it is safe for the OpenCL device to begin work or NULL if it can begin immediately.\n endEventpointer to a cl_event which will receive a copy of the cl_event which indicates when all work for this call has completed. This cl_event has an incremented reference count and should be released via clReleaseEvent(). NULL if not required. \n \n \n \n \n-

Definition at line 500 of file clEvaluator.h.

\n+

Definition at line 500 of file clEvaluator.h.

\n \n
\n \n \n

◆ Synchronize() [1/2]

\n \n
\n@@ -4876,20 +4876,20 @@\n inlinestatic \n \n \n
\n \n

Wait the OpenCL kernels finish.

\n \n-

Definition at line 2613 of file clEvaluator.h.

\n+

Definition at line 2613 of file clEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CLEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01161.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01161.html", "unified_diff": "@@ -99,15 +99,15 @@\n
    CpuD3D11VertexBuffer Class Reference
    \n
\n
\n \n

Concrete vertex buffer class for Cpu subdivision and DirectX drawing. \n More...

\n \n-

#include <cpuD3D11VertexBuffer.h>

\n+

#include <cpuD3D11VertexBuffer.h>

\n \n \n \n \n \n \n@@ -143,15 +143,15 @@\n \n

\n Public Member Functions

virtual ~CpuD3D11VertexBuffer ()
 Destructor.
 
void UpdateData (const float *src, int startVertex, int numVertices, void *deviceContext=NULL)
 
\n

Detailed Description

\n

Concrete vertex buffer class for Cpu subdivision and DirectX drawing.

\n

CpuD3D11VertexBuffer implements CpuVertexBufferInterface and D3D11VertexBufferInterface.

\n

An instance of this buffer class can be passed to CpuEvaluator.

\n \n-

Definition at line 48 of file cpuD3D11VertexBuffer.h.

\n+

Definition at line 48 of file cpuD3D11VertexBuffer.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~CpuD3D11VertexBuffer()

\n \n
\n
\n \n@@ -302,15 +302,15 @@\n inline\n \n
\n
\n \n

Returns the D3D11 buffer object (for Osd::Mesh interface)

\n \n-

Definition at line 75 of file cpuD3D11VertexBuffer.h.

\n+

Definition at line 75 of file cpuD3D11VertexBuffer.h.

\n \n
\n
\n \n

◆ Create()

\n \n
\n@@ -430,15 +430,15 @@\n \n
\n

This method is meant to be used in client code in order to provide coarse vertices data to Osd.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
\n \n-

#include <cpuEvaluator.h>

\n+

#include <cpuEvaluator.h>

\n \n \n \n \n \n \n@@ -170,15 +170,15 @@\n \n \n \n \n

\n Static Public Member Functions

template<typename SRC_BUFFER , typename DST_BUFFER , typename STENCIL_TABLE >
static bool EvalStencils (SRC_BUFFER *srcBuffer, BufferDescriptor const &srcDesc, DST_BUFFER *dstBuffer, BufferDescriptor const &dstDesc, STENCIL_TABLE const *stencilTable, const CpuEvaluator *instance=NULL, void *deviceContext=NULL)
 Generic static eval stencils function. This function has a same signature as other device kernels have so that it can be called in the same way from OsdMesh template interface.
 
 
static void Synchronize (void *)
 synchronize all asynchronous computation invoked on this device.
 
\n

Detailed Description

\n
\n-

Definition at line 39 of file cpuEvaluator.h.

\n+

Definition at line 39 of file cpuEvaluator.h.

\n

Member Function Documentation

\n \n

◆ EvalPatches() [1/6]

\n \n
\n
\n \n@@ -716,15 +716,15 @@\n \n \n \n
patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch
instancenot used in the cpu evaluator
deviceContextnot used in the cpu evaluator
\n \n \n \n-

Definition at line 607 of file cpuEvaluator.h.

\n+

Definition at line 607 of file cpuEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [5/6]

\n \n
\n@@ -842,15 +842,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 517 of file cpuEvaluator.h.

\n+

Definition at line 517 of file cpuEvaluator.h.

\n \n
\n
\n \n

◆ EvalPatches() [6/6]

\n \n
\n@@ -943,15 +943,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 454 of file cpuEvaluator.h.

\n+

Definition at line 454 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [1/3]

\n \n
\n@@ -1118,15 +1118,15 @@\n fvarChannelface-varying channel\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 1188 of file cpuEvaluator.h.

\n+

Definition at line 1188 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [2/3]

\n \n
\n@@ -1251,15 +1251,15 @@\n fvarChannelface-varying channel\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 1100 of file cpuEvaluator.h.

\n+

Definition at line 1100 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/3]

\n \n
\n@@ -1356,15 +1356,15 @@\n fvarChannelface-varying channel\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 1034 of file cpuEvaluator.h.

\n+

Definition at line 1034 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/3]

\n \n
\n@@ -1524,15 +1524,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 971 of file cpuEvaluator.h.

\n+

Definition at line 971 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/3]

\n \n
\n@@ -1650,15 +1650,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 886 of file cpuEvaluator.h.

\n+

Definition at line 886 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/3]

\n \n
\n@@ -1748,15 +1748,15 @@\n patchTableCpuPatchTable or equivalent XXX: currently Far::PatchTable can't be used due to interface mismatch\n instancenot used in the cpu evaluator\n deviceContextnot used in the cpu evaluator \n \n \n \n \n-

Definition at line 823 of file cpuEvaluator.h.

\n+

Definition at line 823 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/6]

\n \n
\n@@ -2352,15 +2352,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the cpu kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the cpu kernel \n \n \n \n \n-

Definition at line 303 of file cpuEvaluator.h.

\n+

Definition at line 303 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/6]

\n \n
\n@@ -2464,15 +2464,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the cpu kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the cpu kernel \n \n \n \n \n-

Definition at line 168 of file cpuEvaluator.h.

\n+

Definition at line 168 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/6]

\n \n
\n@@ -2551,15 +2551,15 @@\n stencilTableFar::StencilTable or equivalent\n instancenot used in the cpu kernel (declared as a typed pointer to prevent undesirable template resolution)\n deviceContextnot used in the cpu kernel \n \n \n \n \n-

Definition at line 72 of file cpuEvaluator.h.

\n+

Definition at line 72 of file cpuEvaluator.h.

\n \n
\n \n \n

◆ Synchronize()

\n \n
\n@@ -2584,20 +2584,20 @@\n
\n \n

synchronize all asynchronous computation invoked on this device.

\n
\n

Other methods

\n
\n \n-

Definition at line 1227 of file cpuEvaluator.h.

\n+

Definition at line 1227 of file cpuEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CpuEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01197.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01197.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    D3D11StencilTable Class Reference
    \n
\n
\n \n

D3D11 stencil table. \n More...

\n \n-

#include <d3d11ComputeEvaluator.h>

\n+

#include <d3d11ComputeEvaluator.h>

\n \n \n \n \n \n \n@@ -130,15 +130,15 @@\n \n

\n Public Member Functions

 D3D11StencilTable (Far::StencilTable const *stencilTable, ID3D11DeviceContext *deviceContext)
 
 ~D3D11StencilTable ()
 
 
\n

Detailed Description

\n

D3D11 stencil table.

\n

This class is a D3D11 Shader Resource View representation of Far::StencilTable.

\n

D3D11ComputeEvaluator consumes this table to apply stencils

\n \n-

Definition at line 56 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 56 of file d3d11ComputeEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ D3D11StencilTable()

\n \n
\n
\n \n@@ -214,15 +214,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 59 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 59 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -252,15 +252,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 64 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 64 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n \n

◆ GetIndicesSRV()

\n \n
\n@@ -279,15 +279,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 77 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -306,15 +306,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 79 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsSRV()

\n \n
\n@@ -333,15 +333,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 76 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetSizesSRV()

\n \n
\n@@ -360,15 +360,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 75 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsSRV()

\n \n
\n@@ -387,20 +387,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 78 of file d3d11ComputeEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
D3D11ComputeEvaluator Class Reference
\n \n
\n \n-

#include <d3d11ComputeEvaluator.h>

\n+

#include <d3d11ComputeEvaluator.h>

\n \n \n \n \n

\n Public Types

typedef bool Instantiatable
 
\n \n \n \n \n

\n@@ -136,29 +136,29 @@\n

 
static void Synchronize (ID3D11DeviceContext *deviceContext)
 Wait the dispatched kernel finishes.
 
\n

Detailed Description

\n
\n-

Definition at line 96 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 96 of file d3d11ComputeEvaluator.h.

\n

Member Typedef Documentation

\n \n

◆ Instantiatable

\n \n
\n
\n \n \n \n \n
typedef bool Instantiatable
\n
\n \n-

Definition at line 98 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 98 of file d3d11ComputeEvaluator.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ D3D11ComputeEvaluator()

\n \n@@ -519,15 +519,15 @@\n stencilTablestencil table to be applied. The table must have SSBO interfaces.\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextID3D11DeviceContext. \n \n \n \n \n-

Definition at line 148 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 148 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [3/3]

\n \n
\n@@ -584,15 +584,15 @@\n \n inline \n \n \n
\n

Dispatch the DX compute kernel on GPU asynchronously. returns false if the kernel hasn't been compiled yet.

\n \n-

Definition at line 181 of file d3d11ComputeEvaluator.h.

\n+

Definition at line 181 of file d3d11ComputeEvaluator.h.

\n \n
\n \n \n

◆ Synchronize()

\n \n
\n@@ -617,15 +617,15 @@\n
\n \n

Wait the dispatched kernel finishes.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • D3D11ComputeEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01217.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01217.html", "unified_diff": "@@ -98,15 +98,15 @@\n
    GLStencilTableSSBO Class Reference
    \n
\n
\n \n

GL stencil table (Shader Storage buffer) \n More...

\n \n-

#include <glComputeEvaluator.h>

\n+

#include <glComputeEvaluator.h>

\n \n \n \n \n \n \n@@ -141,15 +141,15 @@\n \n

\n Public Member Functions

 GLStencilTableSSBO (Far::StencilTable const *stencilTable)
 
 GLStencilTableSSBO (Far::LimitStencilTable const *limitStencilTable)
 
 
\n

Detailed Description

\n

GL stencil table (Shader Storage buffer)

\n

This class is a GLSL SSBO representation of Far::StencilTable.

\n

GLSLComputeKernel consumes this table to apply stencils

\n \n-

Definition at line 51 of file glComputeEvaluator.h.

\n+

Definition at line 51 of file glComputeEvaluator.h.

\n

Constructor & Destructor Documentation

\n \n

◆ GLStencilTableSSBO() [1/2]

\n \n
\n
\n \n@@ -247,15 +247,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 58 of file glComputeEvaluator.h.

\n+

Definition at line 58 of file glComputeEvaluator.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -285,15 +285,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 53 of file glComputeEvaluator.h.

\n+

Definition at line 53 of file glComputeEvaluator.h.

\n \n
\n
\n \n

◆ GetDuuWeightsBuffer()

\n \n
\n@@ -312,15 +312,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 76 of file glComputeEvaluator.h.

\n+

Definition at line 76 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetDuvWeightsBuffer()

\n \n
\n@@ -339,15 +339,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 77 of file glComputeEvaluator.h.

\n+

Definition at line 77 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetDuWeightsBuffer()

\n \n
\n@@ -366,15 +366,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 74 of file glComputeEvaluator.h.

\n+

Definition at line 74 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetDvvWeightsBuffer()

\n \n
\n@@ -393,15 +393,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 78 of file glComputeEvaluator.h.

\n+

Definition at line 78 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetDvWeightsBuffer()

\n \n
\n@@ -420,15 +420,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 75 of file glComputeEvaluator.h.

\n+

Definition at line 75 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetIndicesBuffer()

\n \n
\n@@ -447,15 +447,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 72 of file glComputeEvaluator.h.

\n+

Definition at line 72 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetNumStencils()

\n \n
\n@@ -474,15 +474,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 79 of file glComputeEvaluator.h.

\n+

Definition at line 79 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetOffsetsBuffer()

\n \n
\n@@ -501,15 +501,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 71 of file glComputeEvaluator.h.

\n+

Definition at line 71 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetSizesBuffer()

\n \n
\n@@ -528,15 +528,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 70 of file glComputeEvaluator.h.

\n+

Definition at line 70 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ GetWeightsBuffer()

\n \n
\n@@ -555,20 +555,20 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 73 of file glComputeEvaluator.h.

\n+

Definition at line 73 of file glComputeEvaluator.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
GLComputeEvaluator Class Reference
\n \n
\n \n-

#include <glComputeEvaluator.h>

\n+

#include <glComputeEvaluator.h>

\n \n \n \n \n

\n Public Types

typedef bool Instantiatable
 
\n \n \n \n \n

\n@@ -233,29 +233,29 @@\n

 
static void Synchronize (void *deviceContext)
 Wait the dispatched kernel finishes.
 
\n

Detailed Description

\n
\n-

Definition at line 96 of file glComputeEvaluator.h.

\n+

Definition at line 96 of file glComputeEvaluator.h.

\n

Member Typedef Documentation

\n \n

◆ Instantiatable

\n \n
\n
\n \n \n \n \n
typedef bool Instantiatable
\n
\n \n-

Definition at line 98 of file glComputeEvaluator.h.

\n+

Definition at line 98 of file glComputeEvaluator.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ GLComputeEvaluator()

\n \n@@ -423,15 +423,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 111 of file glComputeEvaluator.h.

\n+

Definition at line 111 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ Create() [2/2]

\n \n
\n@@ -479,15 +479,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 99 of file glComputeEvaluator.h.

\n+

Definition at line 99 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [1/8]

\n \n
\n@@ -857,15 +857,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 1071 of file glComputeEvaluator.h.

\n+

Definition at line 1071 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [4/8]

\n \n
\n@@ -1025,15 +1025,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 870 of file glComputeEvaluator.h.

\n+

Definition at line 870 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [5/8]

\n \n
\n@@ -1137,15 +1137,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 997 of file glComputeEvaluator.h.

\n+

Definition at line 997 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [6/8]

\n \n
\n@@ -1263,15 +1263,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 769 of file glComputeEvaluator.h.

\n+

Definition at line 769 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [7/8]

\n \n
\n@@ -1347,15 +1347,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 943 of file glComputeEvaluator.h.

\n+

Definition at line 943 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatches() [8/8]

\n \n
\n@@ -1448,15 +1448,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 691 of file glComputeEvaluator.h.

\n+

Definition at line 691 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [1/6]

\n \n
\n@@ -1623,15 +1623,15 @@\n fvarChannelface-varying channel\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1903 of file glComputeEvaluator.h.

\n+

Definition at line 1903 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [2/6]

\n \n
\n@@ -1784,15 +1784,15 @@\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent\n fvarChannelface-varying channel \n \n \n \n \n-

Definition at line 2011 of file glComputeEvaluator.h.

\n+

Definition at line 2011 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [3/6]

\n \n
\n@@ -1917,15 +1917,15 @@\n fvarChannelface-varying channel\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1736 of file glComputeEvaluator.h.

\n+

Definition at line 1736 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [4/6]

\n \n
\n@@ -2036,15 +2036,15 @@\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent\n fvarChannelface-varying channel \n \n \n \n \n-

Definition at line 1816 of file glComputeEvaluator.h.

\n+

Definition at line 1816 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [5/6]

\n \n
\n@@ -2141,15 +2141,15 @@\n fvarChannelface-varying channel\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1606 of file glComputeEvaluator.h.

\n+

Definition at line 1606 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesFaceVarying() [6/6]

\n \n
\n@@ -2232,15 +2232,15 @@\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent\n fvarChannelface-varying channel \n \n \n \n \n-

Definition at line 1669 of file glComputeEvaluator.h.

\n+

Definition at line 1669 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [1/6]

\n \n
\n@@ -2386,15 +2386,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 1544 of file glComputeEvaluator.h.

\n+

Definition at line 1544 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [2/6]

\n \n
\n@@ -2554,15 +2554,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1439 of file glComputeEvaluator.h.

\n+

Definition at line 1439 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [3/6]

\n \n
\n@@ -2666,15 +2666,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 1355 of file glComputeEvaluator.h.

\n+

Definition at line 1355 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [4/6]

\n \n
\n@@ -2792,15 +2792,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1278 of file glComputeEvaluator.h.

\n+

Definition at line 1278 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [5/6]

\n \n
\n@@ -2876,15 +2876,15 @@\n numPatchCoordsnumber of patchCoords.\n patchCoordsarray of locations to be evaluated. must have BindVBO() method returning an array of PatchCoord struct in VBO.\n patchTableGLPatchTable or equivalent \n \n \n \n \n-

Definition at line 1214 of file glComputeEvaluator.h.

\n+

Definition at line 1214 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalPatchesVarying() [6/6]

\n \n
\n@@ -2974,15 +2974,15 @@\n patchTableGLPatchTable or equivalent\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLXFB evaluator \n \n \n \n \n-

Definition at line 1154 of file glComputeEvaluator.h.

\n+

Definition at line 1154 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [1/8]

\n \n
\n@@ -3447,15 +3447,15 @@\n dvvBufferOutput buffer 2nd derivative wrt v must have BindVBO() method returning a GL buffer object of destination data\n dvvDescvertex buffer descriptor for the dvvBuffer\n stencilTablestencil table to be applied. The table must have SSBO interfaces. \n \n \n \n \n-

Definition at line 502 of file glComputeEvaluator.h.

\n+

Definition at line 502 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [4/8]

\n \n
\n@@ -3601,15 +3601,15 @@\n stencilTablestencil table to be applied. The table must have SSBO interfaces.\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLSL kernel \n \n \n \n \n-

Definition at line 326 of file glComputeEvaluator.h.

\n+

Definition at line 326 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [5/8]

\n \n
\n@@ -3699,15 +3699,15 @@\n dvBufferOutput buffer derivative wrt v must have BindVBO() method returning a GL buffer object of destination data\n dvDescvertex buffer descriptor for the dvBuffer\n stencilTablestencil table to be applied. The table must have SSBO interfaces. \n \n \n \n \n-

Definition at line 434 of file glComputeEvaluator.h.

\n+

Definition at line 434 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [6/8]

\n \n
\n@@ -3811,15 +3811,15 @@\n stencilTablestencil table to be applied. The table must have SSBO interfaces.\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLSL kernel \n \n \n \n \n-

Definition at line 236 of file glComputeEvaluator.h.

\n+

Definition at line 236 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [7/8]

\n \n
\n@@ -3881,15 +3881,15 @@\n dstBufferOutput primvar buffer must have BindVBO() method returning a GL buffer object of destination data\n dstDescvertex buffer descriptor for the output buffer\n stencilTablestencil table to be applied. The table must have SSBO interfaces. \n \n \n \n \n-

Definition at line 386 of file glComputeEvaluator.h.

\n+

Definition at line 386 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ EvalStencils() [8/8]

\n \n
\n@@ -3968,15 +3968,15 @@\n stencilTablestencil table to be applied. The table must have SSBO interfaces.\n instancecached compiled instance. Clients are supposed to pre-compile an instance of this class and provide to this function. If it's null the kernel still compute by instantiating on-demand kernel although it may cause a performance problem.\n deviceContextnot used in the GLSL kernel \n \n \n \n \n-

Definition at line 168 of file glComputeEvaluator.h.

\n+

Definition at line 168 of file glComputeEvaluator.h.

\n \n
\n \n \n

◆ Synchronize()

\n \n
\n@@ -4001,15 +4001,15 @@\n
\n \n

Wait the dispatched kernel finishes.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • GLComputeEvaluator
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01265.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01265.html", "unified_diff": "@@ -97,15 +97,15 @@\n
    HLSLPatchShaderSource Class Reference
    \n
\n
\n \n

Provides shader source which can be used by client code. \n More...

\n \n-

#include <hlslPatchShaderSource.h>

\n+

#include <hlslPatchShaderSource.h>

\n \n \n \n \n \n \n@@ -122,15 +122,15 @@\n \n \n \n

\n Static Public Member Functions

static std::string GetPatchBasisShaderSource ()
 Returns shader source which can be used to evaluate position and first and second derivatives on piecewise parametric patches resulting from subdivision refinement.
 
static std::string GetPatchDrawingShaderSource ()
 
static std::string GetDomainShaderSource (Far::PatchDescriptor::Type type)
 
\n

Detailed Description

\n

Provides shader source which can be used by client code.

\n \n-

Definition at line 40 of file hlslPatchShaderSource.h.

\n+

Definition at line 40 of file hlslPatchShaderSource.h.

\n

Member Function Documentation

\n \n

◆ GetCommonShaderSource()

\n \n
\n
\n \n@@ -282,15 +282,15 @@\n \n
\n
\n \n
\n
\n
The documentation for this class was generated from the following file:\n
\n \n \n
\n
\n
\n \n-

#include <mtlCommon.h>

\n+

#include <mtlCommon.h>

\n \n \n \n \n \n \n

\n Public Attributes

id< MTLDevice > device = nullptr
 
id< MTLCommandQueue > commandQueue = nullptr
 
\n

Detailed Description

\n
\n-

Definition at line 40 of file mtlCommon.h.

\n+

Definition at line 40 of file mtlCommon.h.

\n

Member Data Documentation

\n \n

◆ commandQueue

\n \n
\n
\n \n \n \n \n
id<MTLCommandQueue> commandQueue = nullptr
\n
\n \n-

Definition at line 43 of file mtlCommon.h.

\n+

Definition at line 43 of file mtlCommon.h.

\n \n
\n
\n \n

◆ device

\n \n
\n@@ -135,20 +135,20 @@\n \n \n \n \n
id<MTLDevice> device = nullptr
\n
\n \n-

Definition at line 42 of file mtlCommon.h.

\n+

Definition at line 42 of file mtlCommon.h.

\n \n
\n
\n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
MTLLegacyGregoryPatchTable Class Reference
\n \n
\n \n-

#include <mtlLegacyGregoryPatchTable.h>

\n+

#include <mtlLegacyGregoryPatchTable.h>

\n
\n Inheritance diagram for MTLLegacyGregoryPatchTable:
\n
\n
\n \"\"/\n
\n \n@@ -128,15 +128,15 @@\n \n \n \n \n
static MTLLegacyGregoryPatchTableCreate (Far::PatchTable const *farPatchTable, DEVICE_CONTEXT context)
 
static MTLLegacyGregoryPatchTableCreate (Far::PatchTable const *farPatchTable, MTLContext *context)
 
\n

Detailed Description

\n
\n-

Definition at line 41 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 41 of file mtlLegacyGregoryPatchTable.h.

\n

Constructor & Destructor Documentation

\n \n

◆ ~MTLLegacyGregoryPatchTable()

\n \n
\n
\n \n@@ -184,15 +184,15 @@\n \n \n \n
\n inlinestatic
\n
\n \n-

Definition at line 48 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 48 of file mtlLegacyGregoryPatchTable.h.

\n \n
\n
\n \n

◆ Create() [2/2]

\n \n
\n@@ -248,15 +248,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 71 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 71 of file mtlLegacyGregoryPatchTable.h.

\n \n
\n
\n \n

◆ GetQuadOffsetsBuffer()

\n \n
\n@@ -275,15 +275,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 66 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 66 of file mtlLegacyGregoryPatchTable.h.

\n \n
\n \n \n

◆ GetVertexBuffer()

\n \n
\n@@ -302,15 +302,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 56 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 56 of file mtlLegacyGregoryPatchTable.h.

\n \n
\n \n \n

◆ GetVertexValenceBuffer()

\n \n
\n@@ -329,15 +329,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 61 of file mtlLegacyGregoryPatchTable.h.

\n+

Definition at line 61 of file mtlLegacyGregoryPatchTable.h.

\n \n
\n \n \n

◆ UpdateVertexBuffer()

\n \n
\n@@ -374,15 +374,15 @@\n \n \n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
MTLPatchTable Class Reference
\n \n
\n \n-

#include <mtlPatchTable.h>

\n+

#include <mtlPatchTable.h>

\n
\n Inheritance diagram for MTLPatchTable:
\n
\n
\n \"\"/\n
\n \n@@ -170,29 +170,29 @@\n \n \n \n \n
std::vector< id< MTLBuffer > > _fvarIndexBuffers
 
std::vector< id< MTLBuffer > > _fvarParamBuffers
 
\n

Detailed Description

\n
\n-

Definition at line 46 of file mtlPatchTable.h.

\n+

Definition at line 46 of file mtlPatchTable.h.

\n

Member Typedef Documentation

\n \n

◆ VertexBufferBinding

\n \n
\n
\n \n \n \n \n
typedef id<MTLBuffer> VertexBufferBinding
\n
\n \n-

Definition at line 48 of file mtlPatchTable.h.

\n+

Definition at line 48 of file mtlPatchTable.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ MTLPatchTable()

\n \n@@ -296,15 +296,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 54 of file mtlPatchTable.h.

\n+

Definition at line 54 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ Create() [2/2]

\n \n
\n@@ -360,15 +360,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 69 of file mtlPatchTable.h.

\n+

Definition at line 69 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchIndexBuffer()

\n \n
\n@@ -388,15 +388,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 70 of file mtlPatchTable.h.

\n+

Definition at line 70 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetFVarPatchParamBuffer()

\n \n
\n@@ -416,15 +416,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 71 of file mtlPatchTable.h.

\n+

Definition at line 71 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetNumFVarChannels()

\n \n
\n@@ -443,15 +443,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 68 of file mtlPatchTable.h.

\n+

Definition at line 68 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetPatchArrays()

\n \n
\n@@ -470,15 +470,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 61 of file mtlPatchTable.h.

\n+

Definition at line 61 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetPatchIndexBuffer()

\n \n
\n@@ -497,15 +497,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 62 of file mtlPatchTable.h.

\n+

Definition at line 62 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetPatchParamBuffer()

\n \n
\n@@ -524,15 +524,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 63 of file mtlPatchTable.h.

\n+

Definition at line 63 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetVaryingPatchArrays()

\n \n
\n@@ -551,15 +551,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 65 of file mtlPatchTable.h.

\n+

Definition at line 65 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ GetVaryingPatchIndexBuffer()

\n \n
\n@@ -578,15 +578,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 66 of file mtlPatchTable.h.

\n+

Definition at line 66 of file mtlPatchTable.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ _fvarIndexBuffers

\n \n@@ -603,15 +603,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 86 of file mtlPatchTable.h.

\n+

Definition at line 86 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _fvarParamBuffers

\n \n
\n@@ -627,15 +627,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 87 of file mtlPatchTable.h.

\n+

Definition at line 87 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _fvarPatchArrays

\n \n
\n@@ -651,15 +651,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 85 of file mtlPatchTable.h.

\n+

Definition at line 85 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _indexBuffer

\n \n
\n@@ -675,15 +675,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 78 of file mtlPatchTable.h.

\n+

Definition at line 78 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _patchArrays

\n \n
\n@@ -699,15 +699,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 76 of file mtlPatchTable.h.

\n+

Definition at line 76 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _patchParamBuffer

\n \n
\n@@ -723,15 +723,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 79 of file mtlPatchTable.h.

\n+

Definition at line 79 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _varyingPatchArrays

\n \n
\n@@ -747,15 +747,15 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 81 of file mtlPatchTable.h.

\n+

Definition at line 81 of file mtlPatchTable.h.

\n \n
\n \n \n

◆ _varyingPatchIndexBuffer

\n \n
\n@@ -771,20 +771,20 @@\n \n \n protected \n \n \n
\n \n-

Definition at line 83 of file mtlPatchTable.h.

\n+

Definition at line 83 of file mtlPatchTable.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
\n
CPUMTLVertexBuffer Class Reference
\n \n
\n \n-

#include <mtlVertexBuffer.h>

\n+

#include <mtlVertexBuffer.h>

\n \n \n \n \n \n \n@@ -127,15 +127,15 @@\n \n \n \n \n

\n Public Member Functions

void UpdateData (const float *src, int startVertex, int numVertices, MTLContext *context)
 
int GetNumElements () const
 
 CPUMTLVertexBuffer (int numElements, int numVertices)
 
bool allocate (MTLContext *context)
 
\n

Detailed Description

\n
\n-

Definition at line 39 of file mtlVertexBuffer.h.

\n+

Definition at line 39 of file mtlVertexBuffer.h.

\n

Constructor & Destructor Documentation

\n \n

◆ CPUMTLVertexBuffer()

\n \n
\n
\n \n@@ -251,15 +251,15 @@\n \n \n \n
\n inline
\n
\n \n-

Definition at line 58 of file mtlVertexBuffer.h.

\n+

Definition at line 58 of file mtlVertexBuffer.h.

\n \n
\n
\n \n

◆ Create()

\n \n
\n@@ -320,15 +320,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 45 of file mtlVertexBuffer.h.

\n+

Definition at line 45 of file mtlVertexBuffer.h.

\n \n
\n
\n \n

◆ GetNumVertices()

\n \n
\n@@ -347,15 +347,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 50 of file mtlVertexBuffer.h.

\n+

Definition at line 50 of file mtlVertexBuffer.h.

\n \n
\n \n \n

◆ UpdateData()

\n \n
\n@@ -392,15 +392,15 @@\n \n \n
\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Osd
  • CPUMTLVertexBuffer
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01333.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01333.html", "unified_diff": "@@ -101,15 +101,15 @@\n
    Crease Class Reference
    \n
\n
\n \n

Types, constants and utilities related to semi-sharp creasing – whose implementation is independent of the subdivision scheme. \n More...

\n \n-

#include <crease.h>

\n+

#include <crease.h>

\n \n \n

\n Public Types

enum  Rule {
\n   RULE_UNKNOWN = 0\n ,
\n   RULE_SMOOTH = (1 << 0)\n@@ -180,15 +180,15 @@\n
\n

Detailed Description

\n

Types, constants and utilities related to semi-sharp creasing – whose implementation is independent of the subdivision scheme.

\n

Crease is intended to be a light-weight, trivially constructed class that computes crease-related properties – typically sharpness values and associated interpolation weights. An instance of Crease is defined with a set of options that include current and future variations that will impact computations involving sharpness values.

\n

The Crease methods do not use topological neighborhoods as input. The methods here rely more on the sharpness values and less on the topology, so we choose to work directly with the sharpness values. We also follow the trend of using primitive arrays in the interface to encourage local gathering for re-use.

\n

Note on the need for and use of sharpness values: In general, mask queries rely on the sharpness values. The common case of a smooth vertex, when known, avoids the need to inspect them, but unless the rules are well understood, users will be expected to provided them – particularly when they expect the mask queries to do all of the work (just determining if a vertex is smooth will require inspection of incident edge sharpness). Mask queries will occasionally require the subdivided sharpness values around the child vertex. So users will be expected to either provide them up front when known, or to be gathered on demand. Any implementation of subdivision with creasing cannot avoid subdividing the sharpness values first, so keeping them available for re-use is a worthwhile consideration.

\n \n-

Definition at line 62 of file crease.h.

\n+

Definition at line 62 of file crease.h.

\n

Member Enumeration Documentation

\n \n

◆ Rule

\n \n
\n
\n \n@@ -202,15 +202,15 @@\n \n \n \n \n \n
Enumerator
RULE_UNKNOWN 
RULE_SMOOTH 
RULE_DART 
RULE_CREASE 
RULE_CORNER 
\n \n-

Definition at line 82 of file crease.h.

\n+

Definition at line 82 of file crease.h.

\n \n
\n
\n

Constructor & Destructor Documentation

\n \n

◆ Crease() [1/2]

\n \n@@ -230,15 +230,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 91 of file crease.h.

\n+

Definition at line 91 of file crease.h.

\n \n
\n \n \n

◆ Crease() [2/2]

\n \n
\n@@ -258,15 +258,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 92 of file crease.h.

\n+

Definition at line 92 of file crease.h.

\n \n
\n \n \n

◆ ~Crease()

\n \n
\n@@ -285,15 +285,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 93 of file crease.h.

\n+

Definition at line 93 of file crease.h.

\n \n
\n \n

Member Function Documentation

\n \n

◆ ComputeFractionalWeightAtVertex()

\n \n@@ -362,15 +362,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 207 of file crease.h.

\n+

Definition at line 207 of file crease.h.

\n \n
\n \n \n

◆ DetermineVertexVertexRule() [1/2]

\n \n
\n@@ -469,15 +469,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 228 of file crease.h.

\n+

Definition at line 228 of file crease.h.

\n \n
\n \n \n

◆ IsInfinite()

\n \n
\n@@ -497,15 +497,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 72 of file crease.h.

\n+

Definition at line 72 of file crease.h.

\n \n
\n \n \n

◆ IsSemiSharp()

\n \n
\n@@ -525,15 +525,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 73 of file crease.h.

\n+

Definition at line 73 of file crease.h.

\n \n
\n \n \n

◆ IsSharp()

\n \n
\n@@ -553,15 +553,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 71 of file crease.h.

\n+

Definition at line 71 of file crease.h.

\n \n
\n \n \n

◆ IsSmooth()

\n \n
\n@@ -581,15 +581,15 @@\n \n \n inlinestatic \n \n \n
\n \n-

Definition at line 70 of file crease.h.

\n+

Definition at line 70 of file crease.h.

\n \n
\n \n \n

◆ IsUniform()

\n \n
\n@@ -608,15 +608,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 95 of file crease.h.

\n+

Definition at line 95 of file crease.h.

\n \n
\n \n \n

◆ SharpenBoundaryEdge()

\n \n
\n@@ -637,15 +637,15 @@\n \n inline \n \n \n
\n

Optional sharp features: Since options treat certain topological features as infinitely sharp – boundaries or (in future) non-manifold features – sharpness values should be adjusted before use. The following methods will adjust (by return) specific values according to the options applied.

\n \n-

Definition at line 189 of file crease.h.

\n+

Definition at line 189 of file crease.h.

\n \n
\n \n \n

◆ SharpenBoundaryVertex()

\n \n
\n@@ -665,15 +665,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 200 of file crease.h.

\n+

Definition at line 200 of file crease.h.

\n \n
\n \n \n

◆ SubdivideEdgeSharpnessAtVertex()

\n \n
\n@@ -766,15 +766,15 @@\n
\n

Sharpness subdivision: The computation of a Uniform subdivided sharpness value is as follows:

    \n
  • Smooth edges or verts stay Smooth
  • \n
  • Sharp edges or verts stay Sharp
  • \n
  • semi-sharp edges or verts are decremented by 1.0 but for Chaikin (and potentially future non-uniform schemes that improve upon it) the computation is more involved. In the case of edges in particular, the sharpness of a child edge is determined by the sharpness in the neighborhood of the end vertex corresponding to the child. For this reason, an alternative to subdividing sharpness that computes all child edges around a vertex is given.
  • \n
\n \n-

Definition at line 216 of file crease.h.

\n+

Definition at line 216 of file crease.h.

\n \n
\n \n \n

◆ SubdivideVertexSharpness()

\n \n
\n@@ -794,15 +794,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 222 of file crease.h.

\n+

Definition at line 222 of file crease.h.

\n \n
\n \n

Member Data Documentation

\n \n

◆ SHARPNESS_INFINITE

\n \n@@ -819,15 +819,15 @@\n \n \n static \n \n \n
\n \n-

Definition at line 68 of file crease.h.

\n+

Definition at line 68 of file crease.h.

\n \n
\n \n \n

◆ SHARPNESS_SMOOTH

\n \n
\n@@ -844,20 +844,20 @@\n \n static \n \n \n
\n

Constants and related queries of sharpness values:

\n \n-

Definition at line 67 of file crease.h.

\n+

Definition at line 67 of file crease.h.

\n \n
\n \n
The documentation for this class was generated from the following file:\n \n \n \n
\n
    \n
  • OpenSubdiv
  • OPENSUBDIV_VERSION
  • Sdc
  • Crease
  • \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01341.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01341.html", "unified_diff": "@@ -407,15 +407,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 208 of file catmarkScheme.h.

\n+

Definition at line 208 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitMask() [3/4]

\n \n
\n@@ -619,15 +619,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 301 of file catmarkScheme.h.

\n+

Definition at line 301 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCornerLimitTangentMasks() [4/4]

\n \n
\n@@ -833,15 +833,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 221 of file catmarkScheme.h.

\n+

Definition at line 221 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseLimitMask() [3/4]

\n \n
\n@@ -1023,15 +1023,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 334 of file catmarkScheme.h.

\n+

Definition at line 334 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseLimitTangentMasks() [3/4]

\n \n
\n@@ -1293,15 +1293,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 148 of file catmarkScheme.h.

\n+

Definition at line 148 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignCreaseMaskForVertex() [3/3]

\n \n
\n@@ -1453,15 +1453,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 247 of file catmarkScheme.h.

\n+

Definition at line 247 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitMask() [4/4]

\n \n
\n@@ -1625,15 +1625,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 453 of file catmarkScheme.h.

\n+

Definition at line 453 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothLimitTangentMasks() [4/4]

\n \n
\n@@ -1707,15 +1707,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 71 of file catmarkScheme.h.

\n+

Definition at line 71 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothMaskForEdge() [2/3]

\n \n
\n@@ -1863,15 +1863,15 @@\n \n \n inlineprotected \n \n \n
\n \n-

Definition at line 173 of file catmarkScheme.h.

\n+

Definition at line 173 of file catmarkScheme.h.

\n \n
\n \n \n

◆ assignSmoothMaskForVertex() [3/3]

\n \n
\n@@ -2268,15 +2268,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 56 of file catmarkScheme.h.

\n+

Definition at line 56 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetLocalNeighborhoodSize() [3/4]

\n \n
\n@@ -2405,15 +2405,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 50 of file catmarkScheme.h.

\n+

Definition at line 50 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetRegularFaceSize() [3/4]

\n \n
\n@@ -2513,15 +2513,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 53 of file catmarkScheme.h.

\n+

Definition at line 53 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetRegularVertexValence() [3/4]

\n \n
\n@@ -2621,15 +2621,15 @@\n \n \n inline \n \n \n
\n \n-

Definition at line 47 of file catmarkScheme.h.

\n+

Definition at line 47 of file catmarkScheme.h.

\n \n
\n \n \n

◆ GetTopologicalSplitType() [3/4]

\n \n
\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01489.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01489.html", "unified_diff": "@@ -95,15 +95,15 @@\n Classes |\n Namespaces |\n Typedefs
\n
types.h File Reference
\n \n
\n
#include "../version.h"
\n-#include "../far/patchTable.h"
\n+#include "../far/patchTable.h"
\n #include <algorithm>
\n
\n

Go to the source code of this file.

\n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a01489_source.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a01489_source.html", "unified_diff": "@@ -263,21 +263,21 @@\n
140} // end namespace OpenSubdiv
\n
141
\n
142
\n
143#endif // OPENSUBDIV3_OSD_TYPES_H
\n \n
std::vector< PatchParam > PatchParamVector
Definition types.h:133
\n
std::vector< PatchArray > PatchArrayVector
Definition types.h:132
\n-\n-
Type GetType() const
Returns the type of the patch.
\n-\n-
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n-\n-\n-\n+\n+
Type GetType() const
Returns the type of the patch.
\n+\n+
Handle that can be used as unique patch identifier within PatchTable.
Definition patchTable.h:60
\n+\n+\n+\n
Coordinates set on a patch table.
Definition types.h:42
\n
Far::PatchTable::PatchHandle handle
patch handle
Definition types.h:62
\n \n \n
PatchCoord(Far::PatchTable::PatchHandle handleArg, float sArg, float tArg)
Constructor.
Definition types.h:53
\n
float t
parametric location on patch
Definition types.h:63
\n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.html", "unified_diff": "@@ -93,79 +93,79 @@\n
\n
osd Directory Reference
\n
\n
\n

\n Classes

struct  PatchCoord
\n \n-\n+\n \n-\n+\n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n \n \n \n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n \n \n-\n+\n \n \n \n \n \n \n \n \n \n \n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n-\n+\n \n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_2483050b711c1829a6434006d0beb10c.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,41 +1,41 @@\n var dir_2483050b711c1829a6434006d0beb10c = [\n- [\"bufferDescriptor.h\", \"a00899.html\", \"a00899\"],\n- [\"clEvaluator.h\", \"a00803.html\", \"a00803\"],\n+ [\"bufferDescriptor.h\", \"a00896.html\", \"a00896\"],\n+ [\"clEvaluator.h\", \"a00806.html\", \"a00806\"],\n [\"clPatchTable.h\", \"a00800.html\", \"a00800\"],\n [\"clVertexBuffer.h\", \"a00794.html\", \"a00794\"],\n- [\"cpuD3D11VertexBuffer.h\", \"a00845.html\", \"a00845\"],\n- [\"cpuEvaluator.h\", \"a00896.html\", \"a00896\"],\n+ [\"cpuD3D11VertexBuffer.h\", \"a00842.html\", \"a00842\"],\n+ [\"cpuEvaluator.h\", \"a00899.html\", \"a00899\"],\n [\"cpuGLVertexBuffer.h\", \"a00869.html\", \"a00869\"],\n [\"cpuPatchTable.h\", \"a00893.html\", \"a00893\"],\n [\"cpuVertexBuffer.h\", \"a00890.html\", \"a00890\"],\n [\"cudaEvaluator.h\", \"a00791.html\", \"a00791\"],\n [\"cudaPatchTable.h\", \"a00788.html\", \"a00788\"],\n [\"cudaVertexBuffer.h\", \"a00902.html\", \"a00902\"],\n- [\"d3d11ComputeEvaluator.h\", \"a00842.html\", \"a00842\"],\n+ [\"d3d11ComputeEvaluator.h\", \"a00848.html\", \"a00848\"],\n [\"d3d11LegacyGregoryPatchTable.h\", \"a00839.html\", \"a00839\"],\n- [\"d3d11Mesh.h\", \"a00830.html\", \"a00830\"],\n+ [\"d3d11Mesh.h\", \"a00827.html\", \"a00827\"],\n [\"d3d11PatchTable.h\", \"a00836.html\", \"a00836\"],\n [\"d3d11VertexBuffer.h\", \"a00833.html\", \"a00833\"],\n- [\"glComputeEvaluator.h\", \"a00848.html\", \"a00848\"],\n+ [\"glComputeEvaluator.h\", \"a00845.html\", \"a00845\"],\n [\"glLegacyGregoryPatchTable.h\", \"a00866.html\", \"a00866\"],\n [\"glMesh.h\", \"a00857.html\", \"a00857\"],\n [\"glPatchTable.h\", \"a00863.html\", \"a00863\"],\n [\"glslPatchShaderSource.h\", \"a00854.html\", \"a00854\"],\n [\"glVertexBuffer.h\", \"a00860.html\", \"a00860\"],\n [\"glXFBEvaluator.h\", \"a00851.html\", \"a00851\"],\n- [\"hlslPatchShaderSource.h\", \"a00824.html\", \"a00824\"],\n+ [\"hlslPatchShaderSource.h\", \"a00830.html\", \"a00830\"],\n [\"mesh.h\", \"a00887.html\", \"a00887\"],\n- [\"mtlCommon.h\", \"a00806.html\", \"a00806\"],\n+ [\"mtlCommon.h\", \"a00803.html\", \"a00803\"],\n [\"mtlComputeEvaluator.h\", \"a00821.html\", \"a00821\"],\n- [\"mtlLegacyGregoryPatchTable.h\", \"a00815.html\", \"a00815\"],\n+ [\"mtlLegacyGregoryPatchTable.h\", \"a00818.html\", \"a00818\"],\n [\"mtlMesh.h\", \"a00812.html\", \"a00812\"],\n [\"mtlPatchShaderSource.h\", \"a00809.html\", \"a00809\"],\n- [\"mtlPatchTable.h\", \"a00818.html\", \"a00818\"],\n- [\"mtlVertexBuffer.h\", \"a00827.html\", \"a00827\"],\n+ [\"mtlPatchTable.h\", \"a00815.html\", \"a00815\"],\n+ [\"mtlVertexBuffer.h\", \"a00824.html\", \"a00824\"],\n [\"ompEvaluator.h\", \"a00881.html\", \"a00881\"],\n [\"ompKernel.h\", \"a00878.html\", \"a00878\"],\n [\"opencl.h\", \"a00797.html\", null],\n [\"opengl.h\", \"a00884.html\", null],\n [\"tbbEvaluator.h\", \"a00875.html\", \"a00875\"],\n [\"tbbKernel.h\", \"a00872.html\", \"a00872\"],\n [\"types.h\", \"a01489.html\", \"a01489\"]\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.html", "unified_diff": "@@ -95,39 +95,39 @@\n \n
\n

\n Files

 bufferDescriptor.h
 bufferDescriptor.h
 
 clEvaluator.h
 clEvaluator.h
 
 clPatchTable.h
 
 clVertexBuffer.h
 
 cpuD3D11VertexBuffer.h
 cpuD3D11VertexBuffer.h
 
 cpuEvaluator.h
 cpuEvaluator.h
 
 cpuGLVertexBuffer.h
 
 cpuPatchTable.h
 
 cpuVertexBuffer.h
 
 cudaEvaluator.h
 
 cudaPatchTable.h
 
 cudaVertexBuffer.h
 
 d3d11ComputeEvaluator.h
 d3d11ComputeEvaluator.h
 
 d3d11LegacyGregoryPatchTable.h
 
 d3d11Mesh.h
 d3d11Mesh.h
 
 d3d11PatchTable.h
 
 d3d11VertexBuffer.h
 
 glComputeEvaluator.h
 glComputeEvaluator.h
 
 glLegacyGregoryPatchTable.h
 
 glMesh.h
 
 glPatchTable.h
 
 glslPatchShaderSource.h
 
 glVertexBuffer.h
 
 glXFBEvaluator.h
 
 hlslPatchShaderSource.h
 hlslPatchShaderSource.h
 
 mesh.h
 
 mtlCommon.h
 mtlCommon.h
 
 mtlComputeEvaluator.h
 
 mtlLegacyGregoryPatchTable.h
 mtlLegacyGregoryPatchTable.h
 
 mtlMesh.h
 
 mtlPatchShaderSource.h
 
 mtlPatchTable.h
 mtlPatchTable.h
 
 mtlVertexBuffer.h
 mtlVertexBuffer.h
 
 ompEvaluator.h
 
 ompKernel.h
 
 opencl.h
 
\n \n \n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n-\n+\n \n \n \n

\n Files

 error.h
 
 patchDescriptor.h
 patchDescriptor.h
 
 patchMap.h
 patchMap.h
 
 patchParam.h
 patchParam.h
 
 patchTable.h
 patchTable.h
 
 patchTableFactory.h
 patchTableFactory.h
 
 primvarRefiner.h
 primvarRefiner.h
 
 ptexIndices.h
 ptexIndices.h
 
 stencilTable.h
 stencilTable.h
 
 stencilTableFactory.h
 stencilTableFactory.h
 
 topologyDescriptor.h
 topologyDescriptor.h
 
 topologyLevel.h
 topologyLevel.h
 
 topologyRefiner.h
 topologyRefiner.h
 
 topologyRefinerFactory.h
 topologyRefinerFactory.h
 
 types.h
 
\n
\n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_7f420b72a822828cfa8b0561c695a5cc.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,17 +1,17 @@\n var dir_7f420b72a822828cfa8b0561c695a5cc = [\n [\"error.h\", \"a00743.html\", \"a00743\"],\n- [\"patchDescriptor.h\", \"a00737.html\", \"a00737\"],\n- [\"patchMap.h\", \"a00734.html\", \"a00734\"],\n- [\"patchParam.h\", \"a00740.html\", \"a00740\"],\n- [\"patchTable.h\", \"a00731.html\", \"a00731\"],\n- [\"patchTableFactory.h\", \"a00725.html\", \"a00725\"],\n- [\"primvarRefiner.h\", \"a00728.html\", \"a00728\"],\n- [\"ptexIndices.h\", \"a00722.html\", \"a00722\"],\n- [\"stencilTable.h\", \"a00719.html\", \"a00719\"],\n- [\"stencilTableFactory.h\", \"a00716.html\", \"a00716\"],\n- [\"topologyDescriptor.h\", \"a00713.html\", \"a00713\"],\n- [\"topologyLevel.h\", \"a00710.html\", \"a00710\"],\n- [\"topologyRefiner.h\", \"a00707.html\", \"a00707\"],\n- [\"topologyRefinerFactory.h\", \"a00701.html\", \"a00701\"],\n+ [\"patchDescriptor.h\", \"a00740.html\", \"a00740\"],\n+ [\"patchMap.h\", \"a00731.html\", \"a00731\"],\n+ [\"patchParam.h\", \"a00737.html\", \"a00737\"],\n+ [\"patchTable.h\", \"a00734.html\", \"a00734\"],\n+ [\"patchTableFactory.h\", \"a00728.html\", \"a00728\"],\n+ [\"primvarRefiner.h\", \"a00722.html\", \"a00722\"],\n+ [\"ptexIndices.h\", \"a00725.html\", \"a00725\"],\n+ [\"stencilTable.h\", \"a00713.html\", \"a00713\"],\n+ [\"stencilTableFactory.h\", \"a00719.html\", \"a00719\"],\n+ [\"topologyDescriptor.h\", \"a00716.html\", \"a00716\"],\n+ [\"topologyLevel.h\", \"a00707.html\", \"a00707\"],\n+ [\"topologyRefiner.h\", \"a00704.html\", \"a00704\"],\n+ [\"topologyRefinerFactory.h\", \"a00710.html\", \"a00710\"],\n [\"types.h\", \"a01486.html\", \"a01486\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.html", "unified_diff": "@@ -95,17 +95,17 @@\n \n
\n \n \n \n \n-\n+\n \n-\n+\n \n \n \n \n \n \n \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_f61368944c63c2c1f8c69bc232e59c39.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var dir_f61368944c63c2c1f8c69bc232e59c39 = [\n [\"bilinearScheme.h\", \"a00785.html\", null],\n- [\"catmarkScheme.h\", \"a00779.html\", null],\n- [\"crease.h\", \"a00782.html\", \"a00782\"],\n+ [\"catmarkScheme.h\", \"a00782.html\", null],\n+ [\"crease.h\", \"a00779.html\", \"a00779\"],\n [\"loopScheme.h\", \"a00776.html\", null],\n [\"options.h\", \"a00773.html\", \"a00773\"],\n [\"scheme.h\", \"a00770.html\", \"a00770\"],\n [\"types.h\", \"a01492.html\", \"a01492\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.html", "unified_diff": "@@ -107,17 +107,17 @@\n \n \n \n \n \n \n \n-\n+\n \n-\n+\n \n

\n Files

 bilinearScheme.h
 
 catmarkScheme.h
 catmarkScheme.h
 
 crease.h
 crease.h
 
 loopScheme.h
 
 options.h
 
 scheme.h
 
 
 surfaceFactory.h
 
 surfaceFactoryCache.h
 
 surfaceFactoryMeshAdapter.h
 
 tessellation.h
 tessellation.h
 
 vertexDescriptor.h
 vertexDescriptor.h
 
\n
\n \n \n
\n
    \n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/dir_fa5edef2a780a73fbfb6a11f1af88ceb.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -2,10 +2,10 @@\n [\"limits.h\", \"a00698.html\", \"a00698\"],\n [\"parameterization.h\", \"a00695.html\", \"a00695\"],\n [\"refinerSurfaceFactory.h\", \"a00692.html\", \"a00692\"],\n [\"surface.h\", \"a00689.html\", \"a00689\"],\n [\"surfaceFactory.h\", \"a00686.html\", \"a00686\"],\n [\"surfaceFactoryCache.h\", \"a00680.html\", \"a00680\"],\n [\"surfaceFactoryMeshAdapter.h\", \"a00683.html\", \"a00683\"],\n- [\"tessellation.h\", \"a00674.html\", \"a00674\"],\n- [\"vertexDescriptor.h\", \"a00677.html\", \"a00677\"]\n+ [\"tessellation.h\", \"a00677.html\", \"a00677\"],\n+ [\"vertexDescriptor.h\", \"a00674.html\", \"a00674\"]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/files.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/files.html", "unified_diff": "@@ -101,77 +101,77 @@\n  limits.h\n  parameterization.h\n  refinerSurfaceFactory.h\n  surface.h\n  surfaceFactory.h\n  surfaceFactoryCache.h\n  surfaceFactoryMeshAdapter.h\n- tessellation.h\n- vertexDescriptor.h\n+ tessellation.h\n+ vertexDescriptor.h\n   far\n  error.h\n- patchDescriptor.h\n- patchMap.h\n- patchParam.h\n- patchTable.h\n- patchTableFactory.h\n- primvarRefiner.h\n- ptexIndices.h\n- stencilTable.h\n- stencilTableFactory.h\n- topologyDescriptor.h\n- topologyLevel.h\n- topologyRefiner.h\n- topologyRefinerFactory.h\n+ patchDescriptor.h\n+ patchMap.h\n+ patchParam.h\n+ patchTable.h\n+ patchTableFactory.h\n+ primvarRefiner.h\n+ ptexIndices.h\n+ stencilTable.h\n+ stencilTableFactory.h\n+ topologyDescriptor.h\n+ topologyLevel.h\n+ topologyRefiner.h\n+ topologyRefinerFactory.h\n  types.h\n   osd\n- bufferDescriptor.h\n- clEvaluator.h\n+ bufferDescriptor.h\n+ clEvaluator.h\n  clPatchTable.h\n  clVertexBuffer.h\n- cpuD3D11VertexBuffer.h\n- cpuEvaluator.h\n+ cpuD3D11VertexBuffer.h\n+ cpuEvaluator.h\n  cpuGLVertexBuffer.h\n  cpuPatchTable.h\n  cpuVertexBuffer.h\n  cudaEvaluator.h\n  cudaPatchTable.h\n  cudaVertexBuffer.h\n- d3d11ComputeEvaluator.h\n+ d3d11ComputeEvaluator.h\n  d3d11LegacyGregoryPatchTable.h\n- d3d11Mesh.h\n+ d3d11Mesh.h\n  d3d11PatchTable.h\n  d3d11VertexBuffer.h\n- glComputeEvaluator.h\n+ glComputeEvaluator.h\n  glLegacyGregoryPatchTable.h\n  glMesh.h\n  glPatchTable.h\n  glslPatchShaderSource.h\n  glVertexBuffer.h\n  glXFBEvaluator.h\n- hlslPatchShaderSource.h\n+ hlslPatchShaderSource.h\n  mesh.h\n- mtlCommon.h\n+ mtlCommon.h\n  mtlComputeEvaluator.h\n- mtlLegacyGregoryPatchTable.h\n+ mtlLegacyGregoryPatchTable.h\n  mtlMesh.h\n  mtlPatchShaderSource.h\n- mtlPatchTable.h\n- mtlVertexBuffer.h\n+ mtlPatchTable.h\n+ mtlVertexBuffer.h\n  ompEvaluator.h\n  ompKernel.h\n  opencl.h\n  opengl.h\n  tbbEvaluator.h\n  tbbKernel.h\n  types.h\n   sdc\n  bilinearScheme.h\n- catmarkScheme.h\n- crease.h\n+ catmarkScheme.h\n+ crease.h\n  loopScheme.h\n  options.h\n  scheme.h\n  types.h\n   vtr\n  array.h\n  componentInterfaces.h\n"}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/navtreeindex0.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/navtreeindex0.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,56 +1,56 @@\n var NAVTREEINDEX0 = {\n- \"a00674.html\": [2, 0, 0, 0, 7],\n- \"a00674_source.html\": [2, 0, 0, 0, 7],\n- \"a00677.html\": [2, 0, 0, 0, 8],\n- \"a00677_source.html\": [2, 0, 0, 0, 8],\n+ \"a00674.html\": [2, 0, 0, 0, 8],\n+ \"a00674_source.html\": [2, 0, 0, 0, 8],\n+ \"a00677.html\": [2, 0, 0, 0, 7],\n+ \"a00677_source.html\": [2, 0, 0, 0, 7],\n \"a00680.html\": [2, 0, 0, 0, 5],\n \"a00680_source.html\": [2, 0, 0, 0, 5],\n \"a00683.html\": [2, 0, 0, 0, 6],\n \"a00683_source.html\": [2, 0, 0, 0, 6],\n \"a00686.html\": [2, 0, 0, 0, 4],\n \"a00686_source.html\": [2, 0, 0, 0, 4],\n \"a00689.html\": [2, 0, 0, 0, 3],\n \"a00689_source.html\": [2, 0, 0, 0, 3],\n \"a00692.html\": [2, 0, 0, 0, 2],\n \"a00692_source.html\": [2, 0, 0, 0, 2],\n \"a00695.html\": [2, 0, 0, 0, 1],\n \"a00695_source.html\": [2, 0, 0, 0, 1],\n \"a00698.html\": [2, 0, 0, 0, 0],\n \"a00698_source.html\": [2, 0, 0, 0, 0],\n- \"a00701.html\": [2, 0, 0, 1, 13],\n- \"a00701_source.html\": [2, 0, 0, 1, 13],\n- \"a00707.html\": [2, 0, 0, 1, 12],\n- \"a00707_source.html\": [2, 0, 0, 1, 12],\n- \"a00710.html\": [2, 0, 0, 1, 11],\n- \"a00710_source.html\": [2, 0, 0, 1, 11],\n- \"a00713.html\": [2, 0, 0, 1, 10],\n- \"a00713_source.html\": [2, 0, 0, 1, 10],\n- \"a00716.html\": [2, 0, 0, 1, 9],\n- \"a00716_source.html\": [2, 0, 0, 1, 9],\n- \"a00719.html\": [2, 0, 0, 1, 8],\n- \"a00719_source.html\": [2, 0, 0, 1, 8],\n- \"a00722.html\": [2, 0, 0, 1, 7],\n- \"a00722_source.html\": [2, 0, 0, 1, 7],\n- \"a00725.html\": [2, 0, 0, 1, 5],\n- \"a00725_source.html\": [2, 0, 0, 1, 5],\n- \"a00728.html\": [2, 0, 0, 1, 6],\n- \"a00728_source.html\": [2, 0, 0, 1, 6],\n- \"a00731.html\": [2, 0, 0, 1, 4],\n- \"a00731_source.html\": [2, 0, 0, 1, 4],\n- \"a00734.html\": [2, 0, 0, 1, 2],\n- \"a00734_source.html\": [2, 0, 0, 1, 2],\n- \"a00737.html\": [2, 0, 0, 1, 1],\n- \"a00737.html#ad258c2d8f7871bc0d40cf3a9ded6e08a\": [2, 0, 0, 1, 1, 1],\n- \"a00737_source.html\": [2, 0, 0, 1, 1],\n- \"a00740.html\": [2, 0, 0, 1, 3],\n- \"a00740.html#a3139c7c52ddf26b2403e8e95ff63eeb3\": [2, 0, 0, 1, 3, 1],\n- \"a00740.html#a46ea68db89cc3d55c4191ef7648281ce\": [2, 0, 0, 1, 3, 3],\n- \"a00740.html#abe07210a029a01571c54276ae28b4d88\": [2, 0, 0, 1, 3, 2],\n- \"a00740_source.html\": [2, 0, 0, 1, 3],\n+ \"a00704.html\": [2, 0, 0, 1, 12],\n+ \"a00704_source.html\": [2, 0, 0, 1, 12],\n+ \"a00707.html\": [2, 0, 0, 1, 11],\n+ \"a00707_source.html\": [2, 0, 0, 1, 11],\n+ \"a00710.html\": [2, 0, 0, 1, 13],\n+ \"a00710_source.html\": [2, 0, 0, 1, 13],\n+ \"a00713.html\": [2, 0, 0, 1, 8],\n+ \"a00713_source.html\": [2, 0, 0, 1, 8],\n+ \"a00716.html\": [2, 0, 0, 1, 10],\n+ \"a00716_source.html\": [2, 0, 0, 1, 10],\n+ \"a00719.html\": [2, 0, 0, 1, 9],\n+ \"a00719_source.html\": [2, 0, 0, 1, 9],\n+ \"a00722.html\": [2, 0, 0, 1, 6],\n+ \"a00722_source.html\": [2, 0, 0, 1, 6],\n+ \"a00725.html\": [2, 0, 0, 1, 7],\n+ \"a00725_source.html\": [2, 0, 0, 1, 7],\n+ \"a00728.html\": [2, 0, 0, 1, 5],\n+ \"a00728_source.html\": [2, 0, 0, 1, 5],\n+ \"a00731.html\": [2, 0, 0, 1, 2],\n+ \"a00731_source.html\": [2, 0, 0, 1, 2],\n+ \"a00734.html\": [2, 0, 0, 1, 4],\n+ \"a00734_source.html\": [2, 0, 0, 1, 4],\n+ \"a00737.html\": [2, 0, 0, 1, 3],\n+ \"a00737.html#a3139c7c52ddf26b2403e8e95ff63eeb3\": [2, 0, 0, 1, 3, 1],\n+ \"a00737.html#a46ea68db89cc3d55c4191ef7648281ce\": [2, 0, 0, 1, 3, 3],\n+ \"a00737.html#abe07210a029a01571c54276ae28b4d88\": [2, 0, 0, 1, 3, 2],\n+ \"a00737_source.html\": [2, 0, 0, 1, 3],\n+ \"a00740.html\": [2, 0, 0, 1, 1],\n+ \"a00740.html#ad258c2d8f7871bc0d40cf3a9ded6e08a\": [2, 0, 0, 1, 1, 1],\n+ \"a00740_source.html\": [2, 0, 0, 1, 1],\n \"a00743.html\": [2, 0, 0, 1, 0],\n \"a00743.html#a25d51c3a61fb3dacded6e48d01fd2fdb\": [2, 0, 0, 1, 0, 3],\n \"a00743.html#a2bd300390ebc686e71a3690f4a0b1726\": [2, 0, 0, 1, 0, 1],\n \"a00743.html#a3ba4fd4ed534a5c9c32ad01fa88bb8d9\": [2, 0, 0, 1, 0, 4],\n \"a00743.html#a73bbe6b41209e4c34234f192f0193a63\": [2, 0, 0, 1, 0, 5],\n \"a00743.html#a97d41b6faaf421937e6b82bd1c3067db\": [2, 0, 0, 1, 0, 6],\n \"a00743.html#aa1630f297a91dfc683dfcfddeeebb2ac\": [2, 0, 0, 1, 0, 0],\n@@ -79,64 +79,64 @@\n \"a00767_source.html\": [2, 0, 0, 4, 0],\n \"a00770.html\": [2, 0, 0, 3, 5],\n \"a00770_source.html\": [2, 0, 0, 3, 5],\n \"a00773.html\": [2, 0, 0, 3, 4],\n \"a00773_source.html\": [2, 0, 0, 3, 4],\n \"a00776.html\": [2, 0, 0, 3, 3],\n \"a00776_source.html\": [2, 0, 0, 3, 3],\n- \"a00779.html\": [2, 0, 0, 3, 1],\n- \"a00779_source.html\": [2, 0, 0, 3, 1],\n- \"a00782.html\": [2, 0, 0, 3, 2],\n- \"a00782_source.html\": [2, 0, 0, 3, 2],\n+ \"a00779.html\": [2, 0, 0, 3, 2],\n+ \"a00779_source.html\": [2, 0, 0, 3, 2],\n+ \"a00782.html\": [2, 0, 0, 3, 1],\n+ \"a00782_source.html\": [2, 0, 0, 3, 1],\n \"a00785.html\": [2, 0, 0, 3, 0],\n \"a00785_source.html\": [2, 0, 0, 3, 0],\n \"a00788.html\": [2, 0, 0, 2, 10],\n \"a00788_source.html\": [2, 0, 0, 2, 10],\n \"a00791.html\": [2, 0, 0, 2, 9],\n \"a00791_source.html\": [2, 0, 0, 2, 9],\n \"a00794.html\": [2, 0, 0, 2, 3],\n \"a00794_source.html\": [2, 0, 0, 2, 3],\n \"a00797.html\": [2, 0, 0, 2, 35],\n \"a00797_source.html\": [2, 0, 0, 2, 35],\n \"a00800.html\": [2, 0, 0, 2, 2],\n \"a00800_source.html\": [2, 0, 0, 2, 2],\n- \"a00803.html\": [2, 0, 0, 2, 1],\n- \"a00803_source.html\": [2, 0, 0, 2, 1],\n- \"a00806.html\": [2, 0, 0, 2, 26],\n- \"a00806_source.html\": [2, 0, 0, 2, 26],\n+ \"a00803.html\": [2, 0, 0, 2, 26],\n+ \"a00803_source.html\": [2, 0, 0, 2, 26],\n+ \"a00806.html\": [2, 0, 0, 2, 1],\n+ \"a00806_source.html\": [2, 0, 0, 2, 1],\n \"a00809.html\": [2, 0, 0, 2, 30],\n \"a00809_source.html\": [2, 0, 0, 2, 30],\n \"a00812.html\": [2, 0, 0, 2, 29],\n \"a00812.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa\": [2, 0, 0, 2, 29, 0],\n \"a00812_source.html\": [2, 0, 0, 2, 29],\n- \"a00815.html\": [2, 0, 0, 2, 28],\n- \"a00815_source.html\": [2, 0, 0, 2, 28],\n- \"a00818.html\": [2, 0, 0, 2, 31],\n- \"a00818_source.html\": [2, 0, 0, 2, 31],\n+ \"a00815.html\": [2, 0, 0, 2, 31],\n+ \"a00815_source.html\": [2, 0, 0, 2, 31],\n+ \"a00818.html\": [2, 0, 0, 2, 28],\n+ \"a00818_source.html\": [2, 0, 0, 2, 28],\n \"a00821.html\": [2, 0, 0, 2, 27],\n \"a00821_source.html\": [2, 0, 0, 2, 27],\n- \"a00824.html\": [2, 0, 0, 2, 24],\n- \"a00824_source.html\": [2, 0, 0, 2, 24],\n- \"a00827.html\": [2, 0, 0, 2, 32],\n- \"a00827_source.html\": [2, 0, 0, 2, 32],\n- \"a00830.html\": [2, 0, 0, 2, 14],\n- \"a00830.html#ae5c8e80d05d6eaee105d8eecfa9ab609\": [2, 0, 0, 2, 14, 0],\n- \"a00830_source.html\": [2, 0, 0, 2, 14],\n+ \"a00824.html\": [2, 0, 0, 2, 32],\n+ \"a00824_source.html\": [2, 0, 0, 2, 32],\n+ \"a00827.html\": [2, 0, 0, 2, 14],\n+ \"a00827.html#ae5c8e80d05d6eaee105d8eecfa9ab609\": [2, 0, 0, 2, 14, 0],\n+ \"a00827_source.html\": [2, 0, 0, 2, 14],\n+ \"a00830.html\": [2, 0, 0, 2, 24],\n+ \"a00830_source.html\": [2, 0, 0, 2, 24],\n \"a00833.html\": [2, 0, 0, 2, 16],\n \"a00833_source.html\": [2, 0, 0, 2, 16],\n \"a00836.html\": [2, 0, 0, 2, 15],\n \"a00836_source.html\": [2, 0, 0, 2, 15],\n \"a00839.html\": [2, 0, 0, 2, 13],\n \"a00839_source.html\": [2, 0, 0, 2, 13],\n- \"a00842.html\": [2, 0, 0, 2, 12],\n- \"a00842_source.html\": [2, 0, 0, 2, 12],\n- \"a00845.html\": [2, 0, 0, 2, 4],\n- \"a00845_source.html\": [2, 0, 0, 2, 4],\n- \"a00848.html\": [2, 0, 0, 2, 17],\n- \"a00848_source.html\": [2, 0, 0, 2, 17],\n+ \"a00842.html\": [2, 0, 0, 2, 4],\n+ \"a00842_source.html\": [2, 0, 0, 2, 4],\n+ \"a00845.html\": [2, 0, 0, 2, 17],\n+ \"a00845_source.html\": [2, 0, 0, 2, 17],\n+ \"a00848.html\": [2, 0, 0, 2, 12],\n+ \"a00848_source.html\": [2, 0, 0, 2, 12],\n \"a00851.html\": [2, 0, 0, 2, 23],\n \"a00851_source.html\": [2, 0, 0, 2, 23],\n \"a00854.html\": [2, 0, 0, 2, 21],\n \"a00854_source.html\": [2, 0, 0, 2, 21],\n \"a00857.html\": [2, 0, 0, 2, 19],\n \"a00857.html#a7f9cf2b729178bdbb847fc4afd91af9e\": [2, 0, 0, 2, 19, 0],\n \"a00857_source.html\": [2, 0, 0, 2, 19],\n@@ -186,18 +186,18 @@\n \"a00887.html#a85ba9df501aea9af1ec9da1558c255bc\": [2, 0, 0, 2, 25, 4],\n \"a00887.html#ab5753a2b0a0995c8e2259d2c4765f7df\": [2, 0, 0, 2, 25, 8],\n \"a00887_source.html\": [2, 0, 0, 2, 25],\n \"a00890.html\": [2, 0, 0, 2, 8],\n \"a00890_source.html\": [2, 0, 0, 2, 8],\n \"a00893.html\": [2, 0, 0, 2, 7],\n \"a00893_source.html\": [2, 0, 0, 2, 7],\n- \"a00896.html\": [2, 0, 0, 2, 5],\n- \"a00896_source.html\": [2, 0, 0, 2, 5],\n- \"a00899.html\": [2, 0, 0, 2, 0],\n- \"a00899_source.html\": [2, 0, 0, 2, 0],\n+ \"a00896.html\": [2, 0, 0, 2, 0],\n+ \"a00896_source.html\": [2, 0, 0, 2, 0],\n+ \"a00899.html\": [2, 0, 0, 2, 5],\n+ \"a00899_source.html\": [2, 0, 0, 2, 5],\n \"a00902.html\": [2, 0, 0, 2, 11],\n \"a00902_source.html\": [2, 0, 0, 2, 11],\n \"a00905.html\": [0, 0, 0],\n \"a00906.html\": [0, 0, 0, 0],\n \"a00907.html\": [0, 0, 0, 0, 0],\n \"a00908.html\": [0, 0, 0, 0, 1],\n \"a00908.html#a200172f1c19545bc01f292afa2167e2f\": [0, 0, 0, 0, 1, 32],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_11.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_11.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -101,17 +101,17 @@\n ['stencilreal_3c_20float_20_3e_74', ['StencilReal< float >', ['../a01053.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['stenciltable_75', ['stenciltable', ['../a01065.html#a3d12830eb0d421206de500d7abc9decf', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::StencilTable(int numControlVerts, std::vector< int > const &offsets, std::vector< int > const &sizes, std::vector< int > const &sources, std::vector< float > const &weights, bool includeCoarseVerts, size_t firstOffset)'],\n ['../a01065.html#a54db76b34112b5cb3c623be8789dd8f4', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::StencilTable(int numControlVerts)'],\n ['../a01065.html#acc553d2d5624ab2a790ae9613812393e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTable::StencilTable()'],\n ['../a01281.html#a6b90e8290c540c78bedd053e2cc42f31', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::Mesh::StencilTable'],\n ['../a01065.html', 1, 'StencilTable']\n ]],\n- ['stenciltable_2eh_76', ['stencilTable.h', ['../a00719.html', 1, '']]],\n+ ['stenciltable_2eh_76', ['stencilTable.h', ['../a00713.html', 1, '']]],\n ['stenciltablefactory_77', ['StencilTableFactory', ['../a01097.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n- ['stenciltablefactory_2eh_78', ['stencilTableFactory.h', ['../a00716.html', 1, '']]],\n+ ['stenciltablefactory_2eh_78', ['stencilTableFactory.h', ['../a00719.html', 1, '']]],\n ['stenciltablefactoryreal_79', ['StencilTableFactoryReal', ['../a01045.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['stenciltablefactoryreal_3c_20float_20_3e_80', ['StencilTableFactoryReal< float >', ['../a01045.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['stenciltablefactoryreal_3c_20real_20_3e_81', ['stenciltablefactoryreal< real >', ['../a01053.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilReal::StencilTableFactoryReal< REAL >'],\n ['../a01061.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableReal::StencilTableFactoryReal< REAL >'],\n ['../a01069.html#af58f6a3f9b167c3330097c1a69ca36a8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilReal::StencilTableFactoryReal< REAL >']\n ]],\n ['stenciltablereal_82', ['stenciltablereal', ['../a01061.html', 1, 'StencilTableReal< REAL >'],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_12.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_12.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -14,35 +14,35 @@\n ['tbbkernel_2eh_5', ['tbbKernel.h', ['../a00872.html', 1, '']]],\n ['tessellation_6', ['tessellation', ['../a00961.html', 1, 'Tessellation'],\n ['../a00961.html#ab03191ef31cf0d8b0bcc44f226804e87', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Tessellation(Tessellation const &)=delete'],\n ['../a00961.html#a7a3e89992f3cc492804ec9bc184a1674', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Tessellation()=delete'],\n ['../a00961.html#a65ee652b3607c97bb2b04a64c55d7f99', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Tessellation(Parameterization const &p, int numRates, int const rates[], Options const &options=Options())'],\n ['../a00961.html#a7f0af117d53701f7ca6e3eb2368b89bb', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Tessellation(Parameterization const &p, int uniformRate, Options const &options=Options())']\n ]],\n- ['tessellation_2eh_7', ['tessellation.h', ['../a00674.html', 1, '']]],\n+ ['tessellation_2eh_7', ['tessellation.h', ['../a00677.html', 1, '']]],\n ['topologycallback_8', ['TopologyCallback', ['../a01133.html#a896a964625491e084b3d776acd10f053', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactoryBase']]],\n ['topologydescriptor_9', ['topologydescriptor', ['../a01105.html', 1, 'TopologyDescriptor'],\n ['../a01105.html#a8209f1b69b0162ee2e7065d91088113d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor::TopologyDescriptor()']\n ]],\n- ['topologydescriptor_2eh_10', ['topologyDescriptor.h', ['../a00713.html', 1, '']]],\n+ ['topologydescriptor_2eh_10', ['topologyDescriptor.h', ['../a00716.html', 1, '']]],\n ['topologyerror_11', ['TopologyError', ['../a01117.html#a5458be6ce3f2e63c8d8555f4ab3b2b62', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefinerFactory']]],\n ['topologylevel_12', ['topologylevel', ['../a01113.html', 1, 'TopologyLevel'],\n ['../a01113.html#a03a8183081b34983ade155e3636ba835', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyLevel::TopologyLevel()']\n ]],\n- ['topologylevel_2eh_13', ['topologyLevel.h', ['../a00710.html', 1, '']]],\n+ ['topologylevel_2eh_13', ['topologyLevel.h', ['../a00707.html', 1, '']]],\n ['topologyrefiner_14', ['topologyrefiner', ['../a01121.html', 1, 'TopologyRefiner'],\n ['../a01113.html#a094d2e51437ecd5ecc6a0cf2c4ce1e78', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyLevel::TopologyRefiner'],\n ['../a01121.html#a91353962838bff64448014136e0e11ff', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::TopologyRefiner(Sdc::SchemeType type, Sdc::Options options=Sdc::Options())'],\n ['../a01121.html#a13c709a24feeed80409924510e3efc5e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::TopologyRefiner(TopologyRefiner const &source)']\n ]],\n- ['topologyrefiner_2eh_15', ['topologyRefiner.h', ['../a00707.html', 1, '']]],\n+ ['topologyrefiner_2eh_15', ['topologyRefiner.h', ['../a00704.html', 1, '']]],\n ['topologyrefinerfactory_16', ['topologyrefinerfactory', ['../a01121.html#a7efec9ae15b61001dcf6a0de284914b7', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::TopologyRefinerFactory'],\n ['../a01117.html', 1, 'TopologyRefinerFactory< MESH >']\n ]],\n- ['topologyrefinerfactory_2eh_17', ['topologyRefinerFactory.h', ['../a00701.html', 1, '']]],\n+ ['topologyrefinerfactory_2eh_17', ['topologyRefinerFactory.h', ['../a00710.html', 1, '']]],\n ['topologyrefinerfactorybase_18', ['topologyrefinerfactorybase', ['../a01121.html#a7b09fef2ae2989a546c50a65add2091f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::TopologyRefinerFactoryBase'],\n ['../a01133.html', 1, 'TopologyRefinerFactoryBase']\n ]],\n ['transformfacetcoordindices_19', ['transformfacetcoordindices', ['../a00961.html#a666de589b64bea493b1d23446a1ddb49', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int interiorOffset)'],\n ['../a00961.html#a2651a3405daf40d1ffbd47c57233d3c3', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::TransformFacetCoordIndices(int facetTuples[], int const boundaryIndices[], int const interiorIndices[])'],\n ['../a00961.html#a621ab2f30043ff7f4ecdad9e64a73173', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::TransformFacetCoordIndices(int facetTuples[], int commonOffset)']\n ]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_14.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_14.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -9,15 +9,15 @@\n ['vertexbufferbinding_5', ['vertexbufferbinding', ['../a01209.html#a2d85a5ed6ddcef5023c9ef2e6fdd38a5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11PatchTable::VertexBufferBinding'],\n ['../a01237.html#a02af2ea2e9328a776b5b0bb3edf88864', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLPatchTable::VertexBufferBinding'],\n ['../a01269.html#a9cf40ecf1b9b5c29507fe92a03f37a3c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MeshInterface::VertexBufferBinding'],\n ['../a01281.html#a9cf40ecf1b9b5c29507fe92a03f37a3c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::Mesh::VertexBufferBinding'],\n ['../a01305.html#aa00654dc321a5c8dc370a900b0f404da', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLPatchTable::VertexBufferBinding']\n ]],\n ['vertexdescriptor_6', ['VertexDescriptor', ['../a00969.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr']]],\n- ['vertexdescriptor_2eh_7', ['vertexDescriptor.h', ['../a00677.html', 1, '']]],\n+ ['vertexdescriptor_2eh_7', ['vertexDescriptor.h', ['../a00674.html', 1, '']]],\n ['vertexvalencetable_8', ['VertexValenceTable', ['../a00993.html#a2fbf111cac9d122eeaec5c0cb73fa77d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable']]],\n ['vertexweight_9', ['vertexweight', ['../a01345.html#aec5c2abfdfbde4dd934c061625994791', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Scheme::LocalMask::VertexWeight(int index) const'],\n ['../a01345.html#a92e98987f9a4220b9edd041401c9ed76', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Scheme::LocalMask::VertexWeight(int index)']\n ]],\n ['vertindex_10', ['vertIndex', ['../a00997.html#a46d1a8129375c3ee40a33a81d44b685a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchHandle']]],\n ['vertindicesperface_11', ['vertIndicesPerFace', ['../a01105.html#a3f2274c4d3dd54c4e24144e504972b34', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['vtx_5fboundary_5fedge_5fand_5fcorner_12', ['VTX_BOUNDARY_EDGE_AND_CORNER', ['../a01337.html#acbf78f1a6abfc8db080ef7fb3c3f417eac6e5f52f358d3b6d62cc2b708a5a8757', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Options']]],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_2.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_2.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -35,9 +35,9 @@\n ]],\n ['boundcontrolpoints_13', ['BoundControlPoints', ['../a00933.html#a22604a4489ed5fdedb0ef272de0fa637', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface']]],\n ['boundcontrolpointsfrommesh_14', ['BoundControlPointsFromMesh', ['../a00933.html#a8df5cf06cea51aeb6419fd698651ae3b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface']]],\n ['bufferdescriptor_15', ['bufferdescriptor', ['../a01141.html', 1, 'BufferDescriptor'],\n ['../a01141.html#a958068066d1d10ae2a452ac57d9c0401', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::BufferDescriptor::BufferDescriptor(int o, int l, int s)'],\n ['../a01141.html#a446218762f5de8c77d06ee61e14b6b61', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::BufferDescriptor::BufferDescriptor()']\n ]],\n- ['bufferdescriptor_2eh_16', ['bufferDescriptor.h', ['../a00899.html', 1, '']]]\n+ ['bufferdescriptor_2eh_16', ['bufferDescriptor.h', ['../a00896.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_3.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_3.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,23 +1,23 @@\n var searchData = [\n- ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00779.html', 1, '']]],\n+ ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00782.html', 1, '']]],\n ['child_1', ['Child', ['../a00985.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchMap::QuadNode']]],\n ['clear_2', ['clear', ['../a01025.html#ac8bb3912a3ce86b15842e79d0b421204', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory::PatchFaceTag::clear()'],\n ['../a01077.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableReal::Clear()'],\n ['../a01061.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableReal::Clear()'],\n ['../a00989.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchParam::Clear()'],\n ['../a00933.html#aa71d36872f416feaa853788a7a7a7ef8', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::Clear()']\n ]],\n ['clearedgesharpness_3', ['ClearEdgeSharpness', ['../a00969.html#a831025d6d817c4afb1df7d5a705af378', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clearincidentfacesizes_4', ['ClearIncidentFaceSizes', ['../a00969.html#a5c719e43580059139938a6ed0f851853', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clearvertexsharpness_5', ['ClearVertexSharpness', ['../a00969.html#a68afc60df5a617f5d7e1580548b72f9b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['clevaluator_6', ['clevaluator', ['../a01149.html', 1, 'CLEvaluator'],\n ['../a01149.html#adbb0aafb7db3284f164499e8007c4cac', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLEvaluator::CLEvaluator()']\n ]],\n- ['clevaluator_2eh_7', ['clEvaluator.h', ['../a00803.html', 1, '']]],\n+ ['clevaluator_2eh_7', ['clEvaluator.h', ['../a00806.html', 1, '']]],\n ['clpatchtable_8', ['clpatchtable', ['../a01153.html', 1, 'CLPatchTable'],\n ['../a01153.html#ae69549a9493f9a51edfa7d11cec1d72f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLPatchTable::CLPatchTable()']\n ]],\n ['clpatchtable_2eh_9', ['clPatchTable.h', ['../a00800.html', 1, '']]],\n ['clstenciltable_10', ['clstenciltable', ['../a01145.html#af2994e79cf93c872e39659321750351a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLStencilTable::CLStencilTable()'],\n ['../a01145.html', 1, 'CLStencilTable'],\n ['../a01145.html#a33ca6bb1dba9f8e390a58395d164431e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CLStencilTable::CLStencilTable()']\n@@ -77,17 +77,17 @@\n ['converttocompatiblestenciltable_3c_20far_3a_3astenciltable_2c_20far_3a_3astenciltable_2c_20id3d11devicecontext_20_3e_41', ['convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, ID3D11DeviceContext >', ['../a00912.html#ab5753a2b0a0995c8e2259d2c4765f7df', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['converttocompatiblestenciltable_3c_20far_3a_3astenciltable_2c_20far_3a_3astenciltable_2c_20void_20_3e_42', ['convertToCompatibleStencilTable< Far::StencilTable, Far::StencilTable, void >', ['../a00912.html#a33f9830228f847fae1c30c9dffe02b5a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['cornervertexindices_43', ['cornerVertexIndices', ['../a01105.html#a3bf794743edda29fbee0653b65b75ba4', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['cornerweights_44', ['cornerWeights', ['../a01105.html#a6d938f6b0a9ff0fa377ef675aa2c7fda', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['cpud3d11vertexbuffer_45', ['cpud3d11vertexbuffer', ['../a01161.html', 1, 'CpuD3D11VertexBuffer'],\n ['../a01161.html#a632143bc1ec4fbbca2148b0e9e87bc08', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuD3D11VertexBuffer::CpuD3D11VertexBuffer()']\n ]],\n- ['cpud3d11vertexbuffer_2eh_46', ['cpuD3D11VertexBuffer.h', ['../a00845.html', 1, '']]],\n+ ['cpud3d11vertexbuffer_2eh_46', ['cpuD3D11VertexBuffer.h', ['../a00842.html', 1, '']]],\n ['cpuevaluator_47', ['CpuEvaluator', ['../a01165.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['cpuevaluator_2eh_48', ['cpuEvaluator.h', ['../a00896.html', 1, '']]],\n+ ['cpuevaluator_2eh_48', ['cpuEvaluator.h', ['../a00899.html', 1, '']]],\n ['cpuglvertexbuffer_49', ['cpuglvertexbuffer', ['../a01169.html', 1, 'CpuGLVertexBuffer'],\n ['../a01169.html#a32dd2317d622c1b079e3219f97c86955', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CpuGLVertexBuffer::CpuGLVertexBuffer()']\n ]],\n ['cpuglvertexbuffer_2eh_50', ['cpuGLVertexBuffer.h', ['../a00869.html', 1, '']]],\n ['cpumtlvertexbuffer_51', ['cpumtlvertexbuffer', ['../a01309.html', 1, 'CPUMTLVertexBuffer'],\n ['../a01309.html#a1457f342bc3007386104aa3d29277a67', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::CPUMTLVertexBuffer::CPUMTLVertexBuffer()']\n ]],\n@@ -99,15 +99,15 @@\n ['../a01177.html', 1, 'CpuVertexBuffer']\n ]],\n ['cpuvertexbuffer_2eh_55', ['cpuVertexBuffer.h', ['../a00890.html', 1, '']]],\n ['crease_56', ['crease', ['../a01333.html#a9659c3f2c73b80d9dc22763a6054079b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Crease::Crease()'],\n ['../a01333.html#a75d5d7e54170ccf6481932916e0fa9c1', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Crease::Crease(Options const &options)'],\n ['../a01333.html', 1, 'Crease']\n ]],\n- ['crease_2eh_57', ['crease.h', ['../a00782.html', 1, '']]],\n+ ['crease_2eh_57', ['crease.h', ['../a00779.html', 1, '']]],\n ['crease_5fchaikin_58', ['CREASE_CHAIKIN', ['../a01337.html#a16ec522dc0398bf1435a912cd669ffb0a1e31a583663dd65a7b2feffeb24268b5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Options']]],\n ['crease_5funiform_59', ['CREASE_UNIFORM', ['../a01337.html#a16ec522dc0398bf1435a912cd669ffb0a10f2956db48d2975424be2e52ebd544d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Options']]],\n ['creasevertexindexpairs_60', ['creaseVertexIndexPairs', ['../a01105.html#a411a2a927b0270c9e4753dc219763ba5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['creaseweights_61', ['creaseWeights', ['../a01105.html#a8cd977015d3ffffc1146c5a4e17d65e0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]],\n ['creasingmethod_62', ['CreasingMethod', ['../a01337.html#a16ec522dc0398bf1435a912cd669ffb0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Sdc::Options']]],\n ['create_63', ['create', ['../a01249.html#ae38a4728f9debae7733ab48cfadd8312', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableTBO::Create(Far::LimitStencilTable const *limitStencilTable, void *deviceContext=NULL)'],\n ['../a01249.html#a24a8210b637a5b0fca2b258de3b8b8a6', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableTBO::Create(Far::StencilTable const *stencilTable, void *deviceContext=NULL)'],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_4.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_4.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,17 +1,17 @@\n var searchData = [\n ['d3d11computeevaluator_0', ['d3d11computeevaluator', ['../a01201.html', 1, 'D3D11ComputeEvaluator'],\n ['../a01201.html#aa81511d3938d70d67a62217951cb8eb7', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11ComputeEvaluator::D3D11ComputeEvaluator()']\n ]],\n- ['d3d11computeevaluator_2eh_1', ['d3d11ComputeEvaluator.h', ['../a00842.html', 1, '']]],\n+ ['d3d11computeevaluator_2eh_1', ['d3d11ComputeEvaluator.h', ['../a00848.html', 1, '']]],\n ['d3d11legacygregorypatchtable_2', ['d3d11legacygregorypatchtable', ['../a01205.html', 1, 'D3D11LegacyGregoryPatchTable'],\n ['../a01205.html#af138b4535e4db5f013225c5924e0b243', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11LegacyGregoryPatchTable::D3D11LegacyGregoryPatchTable()']\n ]],\n ['d3d11legacygregorypatchtable_2eh_3', ['d3d11LegacyGregoryPatchTable.h', ['../a00839.html', 1, '']]],\n- ['d3d11mesh_2eh_4', ['d3d11Mesh.h', ['../a00830.html', 1, '']]],\n+ ['d3d11mesh_2eh_4', ['d3d11Mesh.h', ['../a00827.html', 1, '']]],\n ['d3d11meshinterface_5', ['D3D11MeshInterface', ['../a00912.html#ae5c8e80d05d6eaee105d8eecfa9ab609', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['d3d11patchtable_6', ['d3d11patchtable', ['../a01209.html#ac81ed5f09e3d3a2aae5a01802b343a6d', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11PatchTable::D3D11PatchTable()'],\n ['../a01209.html', 1, 'D3D11PatchTable']\n ]],\n ['d3d11patchtable_2eh_7', ['d3d11PatchTable.h', ['../a00836.html', 1, '']]],\n ['d3d11stenciltable_8', ['d3d11stenciltable', ['../a01197.html', 1, 'D3D11StencilTable'],\n ['../a01197.html#a7e3a2f5c281c55308400138222797dbc', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11StencilTable::D3D11StencilTable()']\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_7.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -525,15 +525,15 @@\n ['../a01289.html#ab22907c9cfe58b82ddfcad8241304500', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLStencilTable::GetWeightsBuffer()']\n ]],\n ['getweightssrv_267', ['GetWeightsSRV', ['../a01197.html#ac3de1233503ee41bac41618702b4302c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::D3D11StencilTable']]],\n ['getweightstexture_268', ['GetWeightsTexture', ['../a01249.html#ad5f4a852f17762c50c5d3011b11155cb', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLStencilTableTBO']]],\n ['glcomputeevaluator_269', ['glcomputeevaluator', ['../a01221.html#a9fe54ab76e32fb2dc6f7cd631ce2e678', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLComputeEvaluator::GLComputeEvaluator()'],\n ['../a01221.html', 1, 'GLComputeEvaluator']\n ]],\n- ['glcomputeevaluator_2eh_270', ['glComputeEvaluator.h', ['../a00848.html', 1, '']]],\n+ ['glcomputeevaluator_2eh_270', ['glComputeEvaluator.h', ['../a00845.html', 1, '']]],\n ['gllegacygregorypatchtable_271', ['gllegacygregorypatchtable', ['../a01233.html#a5b78188b846b316c5c0cdb42f4ee9563', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLLegacyGregoryPatchTable::GLLegacyGregoryPatchTable()'],\n ['../a01233.html', 1, 'GLLegacyGregoryPatchTable']\n ]],\n ['gllegacygregorypatchtable_2eh_272', ['glLegacyGregoryPatchTable.h', ['../a00866.html', 1, '']]],\n ['glmesh_2eh_273', ['glMesh.h', ['../a00857.html', 1, '']]],\n ['glmeshinterface_274', ['GLMeshInterface', ['../a00912.html#a7f9cf2b729178bdbb847fc4afd91af9e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['glpatchtable_275', ['glpatchtable', ['../a01237.html#a88c12681f62189c398c1d2dc32111264', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::GLPatchTable::GLPatchTable()'],\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_8.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_8.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -4,10 +4,10 @@\n ]],\n ['hasedgesharpness_1', ['HasEdgeSharpness', ['../a00969.html#a2c6d182581c88931784f62fe2b8ae666', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hasholes_2', ['HasHoles', ['../a01121.html#a1b68f0501aabb94ba410e006181d2cc5', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner']]],\n ['hasincidentfacesizes_3', ['HasIncidentFaceSizes', ['../a00969.html#ad56c50bc5582768806d7890c55b63141', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hassubfaces_4', ['HasSubFaces', ['../a00921.html#adc4cd156a8fdb843b0e233a922bb8a17', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Parameterization']]],\n ['hasvertexsharpness_5', ['HasVertexSharpness', ['../a00969.html#a4f46be1cfd41b34d8808363c83e9ff56', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::VertexDescriptor']]],\n ['hlslpatchshadersource_6', ['HLSLPatchShaderSource', ['../a01265.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['hlslpatchshadersource_2eh_7', ['hlslPatchShaderSource.h', ['../a00824.html', 1, '']]],\n+ ['hlslpatchshadersource_2eh_7', ['hlslPatchShaderSource.h', ['../a00830.html', 1, '']]],\n ['holeindices_8', ['holeIndices', ['../a01105.html#a4fcd8e9a636d89045d364607f2b035a1', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyDescriptor']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_b.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -22,29 +22,29 @@\n ['meshinterleavevarying_16', ['MeshInterleaveVarying', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a9313c644b9b2a998bcb55cfcc4582b1a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshuseinfsharppatch_17', ['MeshUseInfSharpPatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a8fab1b3018f94b5b2432c7435e795925', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshusesinglecreasepatch_18', ['MeshUseSingleCreasePatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492a9058d69e1089fc77f1974a76c34e2071', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['meshusesmoothcornerpatch_19', ['MeshUseSmoothCornerPatch', ['../a00912.html#a1af6b50e9f8ae13d3d2f9d5b03b35492ab32b8ef595539e14041e2fb0e619e3f9', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mode_20', ['mode', ['../a01045.html#a46c8a310cf4c094f8c80e1cb8dc1f911', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::StencilTableFactoryReal::Mode'],\n ['../a01049.html#a46c8a310cf4c094f8c80e1cb8dc1f911', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal::Mode']\n ]],\n- ['mtlcommon_2eh_21', ['mtlCommon.h', ['../a00806.html', 1, '']]],\n+ ['mtlcommon_2eh_21', ['mtlCommon.h', ['../a00803.html', 1, '']]],\n ['mtlcomputeevaluator_22', ['mtlcomputeevaluator', ['../a01293.html#a10015b2c4f90f3a11e60cc88dcbb9d6b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLComputeEvaluator::MTLComputeEvaluator()'],\n ['../a01293.html', 1, 'MTLComputeEvaluator']\n ]],\n ['mtlcomputeevaluator_2eh_23', ['mtlComputeEvaluator.h', ['../a00821.html', 1, '']]],\n ['mtlcontext_24', ['MTLContext', ['../a01285.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtllegacygregorypatchtable_25', ['MTLLegacyGregoryPatchTable', ['../a01297.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n- ['mtllegacygregorypatchtable_2eh_26', ['mtlLegacyGregoryPatchTable.h', ['../a00815.html', 1, '']]],\n+ ['mtllegacygregorypatchtable_2eh_26', ['mtlLegacyGregoryPatchTable.h', ['../a00818.html', 1, '']]],\n ['mtlmesh_2eh_27', ['mtlMesh.h', ['../a00812.html', 1, '']]],\n ['mtlmeshinterface_28', ['MTLMeshInterface', ['../a00912.html#aa41e5b43fe46eeb0f97ff6ebdb1935aa', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtlpatchshadersource_29', ['MTLPatchShaderSource', ['../a01301.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['mtlpatchshadersource_2eh_30', ['mtlPatchShaderSource.h', ['../a00809.html', 1, '']]],\n ['mtlpatchtable_31', ['mtlpatchtable', ['../a01305.html', 1, 'MTLPatchTable'],\n ['../a01305.html#a3f197c2ae3862390d72e7443a2525187', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLPatchTable::MTLPatchTable()']\n ]],\n- ['mtlpatchtable_2eh_32', ['mtlPatchTable.h', ['../a00818.html', 1, '']]],\n+ ['mtlpatchtable_2eh_32', ['mtlPatchTable.h', ['../a00815.html', 1, '']]],\n ['mtlstenciltable_33', ['mtlstenciltable', ['../a01289.html', 1, 'MTLStencilTable'],\n ['../a01289.html#a015dc72c3360b4841ee2b3feb06c106f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLStencilTable::MTLStencilTable(Far::LimitStencilTable const *stencilTable, MTLContext *context)'],\n ['../a01289.html#a45e329ffe9fe4e32a1b21bfc89a6763f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MTLStencilTable::MTLStencilTable(Far::StencilTable const *stencilTable, MTLContext *context)']\n ]],\n- ['mtlvertexbuffer_2eh_34', ['mtlVertexBuffer.h', ['../a00827.html', 1, '']]]\n+ ['mtlvertexbuffer_2eh_34', ['mtlVertexBuffer.h', ['../a00824.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/all_e.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/all_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -16,44 +16,44 @@\n ['../a01321.html', 1, 'PatchCoord']\n ]],\n ['patchdescriptor_6', ['patchdescriptor', ['../a00973.html', 1, 'PatchDescriptor'],\n ['../a00973.html#a6c6de8b1c8212039f4702f70bb75cf02', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor::PatchDescriptor(PatchDescriptor const &d)'],\n ['../a00973.html#a8e33c50700963e8dc99a5f598a32aaa3', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor::PatchDescriptor(int type)'],\n ['../a00973.html#af3f91a4a134cb2e5786990ec81f30d17', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor::PatchDescriptor()']\n ]],\n- ['patchdescriptor_2eh_7', ['patchDescriptor.h', ['../a00737.html', 1, '']]],\n+ ['patchdescriptor_2eh_7', ['patchDescriptor.h', ['../a00740.html', 1, '']]],\n ['patchfacetag_8', ['PatchFaceTag', ['../a01025.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory']]],\n ['patchhandle_9', ['PatchHandle', ['../a00997.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable']]],\n ['patchindex_10', ['patchIndex', ['../a00997.html#a31bdf15525ab73560c2b725ff7f8ae3a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchHandle']]],\n ['patchmap_11', ['patchmap', ['../a00977.html#a016619de52fd79dbcdb879cc12b79200', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchMap::PatchMap()'],\n ['../a00977.html', 1, 'PatchMap'],\n ['../a00997.html#aff380d8d7f072959898c0a4e25150d2a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchHandle::PatchMap']\n ]],\n- ['patchmap_2eh_12', ['patchMap.h', ['../a00734.html', 1, '']]],\n+ ['patchmap_2eh_12', ['patchMap.h', ['../a00731.html', 1, '']]],\n ['patchparam_13', ['patchparam', ['../a01329.html', 1, 'PatchParam'],\n ['../a00989.html', 1, 'PatchParam']\n ]],\n- ['patchparam_2eh_14', ['patchParam.h', ['../a00740.html', 1, '']]],\n+ ['patchparam_2eh_14', ['patchParam.h', ['../a00737.html', 1, '']]],\n ['patchparamarray_15', ['PatchParamArray', ['../a00908.html#abe07210a029a01571c54276ae28b4d88', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['patchparamtable_16', ['PatchParamTable', ['../a00908.html#a46ea68db89cc3d55c4191ef7648281ce', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['patchparamvector_17', ['PatchParamVector', ['../a00912.html#a1e22001c627b0364d6c6d62a3ed05fee', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd']]],\n ['patchprecisiondouble_18', ['patchPrecisionDouble', ['../a01021.html#a91ce5fe0ce9b9ec6c5afcfb6e1ccaa40', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory::Options']]],\n ['patchtable_19', ['patchtable', ['../a00993.html', 1, 'PatchTable'],\n ['../a00993.html#a37e24b0244219eef61cc1ab2a5a5450e', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchTable(int maxvalence)'],\n ['../a00993.html#a3419c5d57330d6787f8c14a7677b8d9b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchTable(PatchTable const &src)'],\n ['../a00997.html#ad4867d502f9704b7e45a7974e8918dc3', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchHandle::PatchTable'],\n ['../a01281.html#adf9352136d44e5999629c6b4530bf4e0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::Mesh::PatchTable'],\n ['../a01269.html#adf9352136d44e5999629c6b4530bf4e0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::MeshInterface::PatchTable']\n ]],\n- ['patchtable_2eh_20', ['patchTable.h', ['../a00731.html', 1, '']]],\n+ ['patchtable_2eh_20', ['patchTable.h', ['../a00734.html', 1, '']]],\n ['patchtablebuilder_21', ['patchtablebuilder', ['../a00993.html#ad452cef79832abb71eef0c3d88acc1a0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::PatchTableBuilder'],\n ['../a01121.html#ad452cef79832abb71eef0c3d88acc1a0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::PatchTableBuilder']\n ]],\n ['patchtablefactory_22', ['PatchTableFactory', ['../a01017.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n- ['patchtablefactory_2eh_23', ['patchTableFactory.h', ['../a00725.html', 1, '']]],\n+ ['patchtablefactory_2eh_23', ['patchTableFactory.h', ['../a00728.html', 1, '']]],\n ['patchtagvector_24', ['PatchTagVector', ['../a01017.html#a37218ea13f75caee4c93cc4e94d26060', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTableFactory']]],\n ['patchvertstable_25', ['PatchVertsTable', ['../a00993.html#a9484ab8a323750c2f639ee8709b1349b', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable']]],\n ['pointdescriptor_26', ['pointdescriptor', ['../a00937.html', 1, 'Surface< REAL >::PointDescriptor'],\n ['../a00937.html#ac60ab7fa3966237e2de95cc60defa4de', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor()'],\n ['../a00937.html#a69d66788e741236b1176159a1d609189', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor(int n)'],\n ['../a00937.html#a6e6069bdfef867e798fe863f40f4274a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Surface::PointDescriptor::PointDescriptor(int n, int m)']\n ]],\n@@ -69,24 +69,24 @@\n ['preservequads_36', ['preservequads', ['../a00965.html#a98820ec764e776bd556a9b80b872b78f', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Options::PreserveQuads(bool on)'],\n ['../a00965.html#ae2ec197b850e8bd12878cc67a503a07a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Bfr::Tessellation::Options::PreserveQuads() const']\n ]],\n ['primitiveidbase_37', ['primitiveIdBase', ['../a01325.html#a5a054ce6862ecc6ea8c404fadb1c9a15', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Osd::PatchArray']]],\n ['primvarrefiner_38', ['primvarrefiner', ['../a01037.html#a643d81a2ae20ba1897433f5af5a3697a', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefiner::PrimvarRefiner()'],\n ['../a01037.html', 1, 'PrimvarRefiner']\n ]],\n- ['primvarrefiner_2eh_39', ['primvarRefiner.h', ['../a00728.html', 1, '']]],\n+ ['primvarrefiner_2eh_39', ['primvarRefiner.h', ['../a00722.html', 1, '']]],\n ['primvarrefinerreal_40', ['primvarrefinerreal', ['../a01121.html#a2cb48b58c1c2ecef25abb39339a95ac1', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::PrimvarRefinerReal'],\n ['../a01029.html#a1fe1fbda93c01c326f13929d1c3c6247', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PrimvarRefinerReal::PrimvarRefinerReal()'],\n ['../a01029.html', 1, 'PrimvarRefinerReal< REAL >']\n ]],\n ['primvarrefinerreal_3c_20float_20_3e_41', ['PrimvarRefinerReal< float >', ['../a01029.html', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far']]],\n ['print_42', ['print', ['../a00973.html#acd0f82d3c49b8a5dd436d4003c44b713', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchDescriptor::print()'],\n ['../a00993.html#acd0f82d3c49b8a5dd436d4003c44b713', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PatchTable::print()']\n ]],\n ['printtopology_43', ['PrintTopology', ['../a01113.html#a3f963f5352658762e7a2e8d82fb888a0', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyLevel']]],\n ['ptexidx_44', ['ptexIdx', ['../a01093.html#afb60a8380cb9df186de7183b32bd84e2', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::LimitStencilTableFactoryReal::LocationArray']]],\n ['ptexindices_45', ['ptexindices', ['../a01121.html#a3e6c896f40ac50aec4b28f19bc4eae9c', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::TopologyRefiner::PtexIndices'],\n ['../a01041.html#a7b5dd5f4c76d684d924adf477eeea0a3', 1, 'OpenSubdiv::OPENSUBDIV_VERSION::Far::PtexIndices::PtexIndices()'],\n ['../a01041.html', 1, 'PtexIndices']\n ]],\n- ['ptexindices_2eh_46', ['ptexIndices.h', ['../a00722.html', 1, '']]]\n+ ['ptexindices_2eh_46', ['ptexIndices.h', ['../a00725.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_1.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_1.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,4 +1,4 @@\n var searchData = [\n ['bilinearscheme_2eh_0', ['bilinearScheme.h', ['../a00785.html', 1, '']]],\n- ['bufferdescriptor_2eh_1', ['bufferDescriptor.h', ['../a00899.html', 1, '']]]\n+ ['bufferdescriptor_2eh_1', ['bufferDescriptor.h', ['../a00896.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_2.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_2.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,16 +1,16 @@\n var searchData = [\n- ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00779.html', 1, '']]],\n- ['clevaluator_2eh_1', ['clEvaluator.h', ['../a00803.html', 1, '']]],\n+ ['catmarkscheme_2eh_0', ['catmarkScheme.h', ['../a00782.html', 1, '']]],\n+ ['clevaluator_2eh_1', ['clEvaluator.h', ['../a00806.html', 1, '']]],\n ['clpatchtable_2eh_2', ['clPatchTable.h', ['../a00800.html', 1, '']]],\n ['clvertexbuffer_2eh_3', ['clVertexBuffer.h', ['../a00794.html', 1, '']]],\n ['componentinterfaces_2eh_4', ['componentInterfaces.h', ['../a00764.html', 1, '']]],\n- ['cpud3d11vertexbuffer_2eh_5', ['cpuD3D11VertexBuffer.h', ['../a00845.html', 1, '']]],\n- ['cpuevaluator_2eh_6', ['cpuEvaluator.h', ['../a00896.html', 1, '']]],\n+ ['cpud3d11vertexbuffer_2eh_5', ['cpuD3D11VertexBuffer.h', ['../a00842.html', 1, '']]],\n+ ['cpuevaluator_2eh_6', ['cpuEvaluator.h', ['../a00899.html', 1, '']]],\n ['cpuglvertexbuffer_2eh_7', ['cpuGLVertexBuffer.h', ['../a00869.html', 1, '']]],\n ['cpupatchtable_2eh_8', ['cpuPatchTable.h', ['../a00893.html', 1, '']]],\n ['cpuvertexbuffer_2eh_9', ['cpuVertexBuffer.h', ['../a00890.html', 1, '']]],\n- ['crease_2eh_10', ['crease.h', ['../a00782.html', 1, '']]],\n+ ['crease_2eh_10', ['crease.h', ['../a00779.html', 1, '']]],\n ['cudaevaluator_2eh_11', ['cudaEvaluator.h', ['../a00791.html', 1, '']]],\n ['cudapatchtable_2eh_12', ['cudaPatchTable.h', ['../a00788.html', 1, '']]],\n ['cudavertexbuffer_2eh_13', ['cudaVertexBuffer.h', ['../a00902.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_3.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_3.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,7 +1,7 @@\n var searchData = [\n- ['d3d11computeevaluator_2eh_0', ['d3d11ComputeEvaluator.h', ['../a00842.html', 1, '']]],\n+ ['d3d11computeevaluator_2eh_0', ['d3d11ComputeEvaluator.h', ['../a00848.html', 1, '']]],\n ['d3d11legacygregorypatchtable_2eh_1', ['d3d11LegacyGregoryPatchTable.h', ['../a00839.html', 1, '']]],\n- ['d3d11mesh_2eh_2', ['d3d11Mesh.h', ['../a00830.html', 1, '']]],\n+ ['d3d11mesh_2eh_2', ['d3d11Mesh.h', ['../a00827.html', 1, '']]],\n ['d3d11patchtable_2eh_3', ['d3d11PatchTable.h', ['../a00836.html', 1, '']]],\n ['d3d11vertexbuffer_2eh_4', ['d3d11VertexBuffer.h', ['../a00833.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_6.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_6.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,9 +1,9 @@\n var searchData = [\n- ['glcomputeevaluator_2eh_0', ['glComputeEvaluator.h', ['../a00848.html', 1, '']]],\n+ ['glcomputeevaluator_2eh_0', ['glComputeEvaluator.h', ['../a00845.html', 1, '']]],\n ['gllegacygregorypatchtable_2eh_1', ['glLegacyGregoryPatchTable.h', ['../a00866.html', 1, '']]],\n ['glmesh_2eh_2', ['glMesh.h', ['../a00857.html', 1, '']]],\n ['glpatchtable_2eh_3', ['glPatchTable.h', ['../a00863.html', 1, '']]],\n ['glslpatchshadersource_2eh_4', ['glslPatchShaderSource.h', ['../a00854.html', 1, '']]],\n ['glvertexbuffer_2eh_5', ['glVertexBuffer.h', ['../a00860.html', 1, '']]],\n ['glxfbevaluator_2eh_6', ['glXFBEvaluator.h', ['../a00851.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_7.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_7.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['hlslpatchshadersource_2eh_0', ['hlslPatchShaderSource.h', ['../a00824.html', 1, '']]]\n+ ['hlslpatchshadersource_2eh_0', ['hlslPatchShaderSource.h', ['../a00830.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_9.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_9.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,10 @@\n var searchData = [\n ['mesh_2eh_0', ['mesh.h', ['../a00887.html', 1, '']]],\n- ['mtlcommon_2eh_1', ['mtlCommon.h', ['../a00806.html', 1, '']]],\n+ ['mtlcommon_2eh_1', ['mtlCommon.h', ['../a00803.html', 1, '']]],\n ['mtlcomputeevaluator_2eh_2', ['mtlComputeEvaluator.h', ['../a00821.html', 1, '']]],\n- ['mtllegacygregorypatchtable_2eh_3', ['mtlLegacyGregoryPatchTable.h', ['../a00815.html', 1, '']]],\n+ ['mtllegacygregorypatchtable_2eh_3', ['mtlLegacyGregoryPatchTable.h', ['../a00818.html', 1, '']]],\n ['mtlmesh_2eh_4', ['mtlMesh.h', ['../a00812.html', 1, '']]],\n ['mtlpatchshadersource_2eh_5', ['mtlPatchShaderSource.h', ['../a00809.html', 1, '']]],\n- ['mtlpatchtable_2eh_6', ['mtlPatchTable.h', ['../a00818.html', 1, '']]],\n- ['mtlvertexbuffer_2eh_7', ['mtlVertexBuffer.h', ['../a00827.html', 1, '']]]\n+ ['mtlpatchtable_2eh_6', ['mtlPatchTable.h', ['../a00815.html', 1, '']]],\n+ ['mtlvertexbuffer_2eh_7', ['mtlVertexBuffer.h', ['../a00824.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_b.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_b.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,10 +1,10 @@\n var searchData = [\n ['parameterization_2eh_0', ['parameterization.h', ['../a00695.html', 1, '']]],\n- ['patchdescriptor_2eh_1', ['patchDescriptor.h', ['../a00737.html', 1, '']]],\n- ['patchmap_2eh_2', ['patchMap.h', ['../a00734.html', 1, '']]],\n- ['patchparam_2eh_3', ['patchParam.h', ['../a00740.html', 1, '']]],\n- ['patchtable_2eh_4', ['patchTable.h', ['../a00731.html', 1, '']]],\n- ['patchtablefactory_2eh_5', ['patchTableFactory.h', ['../a00725.html', 1, '']]],\n- ['primvarrefiner_2eh_6', ['primvarRefiner.h', ['../a00728.html', 1, '']]],\n- ['ptexindices_2eh_7', ['ptexIndices.h', ['../a00722.html', 1, '']]]\n+ ['patchdescriptor_2eh_1', ['patchDescriptor.h', ['../a00740.html', 1, '']]],\n+ ['patchmap_2eh_2', ['patchMap.h', ['../a00731.html', 1, '']]],\n+ ['patchparam_2eh_3', ['patchParam.h', ['../a00737.html', 1, '']]],\n+ ['patchtable_2eh_4', ['patchTable.h', ['../a00734.html', 1, '']]],\n+ ['patchtablefactory_2eh_5', ['patchTableFactory.h', ['../a00728.html', 1, '']]],\n+ ['primvarrefiner_2eh_6', ['primvarRefiner.h', ['../a00722.html', 1, '']]],\n+ ['ptexindices_2eh_7', ['ptexIndices.h', ['../a00725.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_d.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_d.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,11 +1,11 @@\n var searchData = [\n ['scheme_2eh_0', ['scheme.h', ['../a00770.html', 1, '']]],\n ['sparseselector_2eh_1', ['sparseSelector.h', ['../a00749.html', 1, '']]],\n ['stackbuffer_2eh_2', ['stackBuffer.h', ['../a00746.html', 1, '']]],\n- ['stenciltable_2eh_3', ['stencilTable.h', ['../a00719.html', 1, '']]],\n- ['stenciltablefactory_2eh_4', ['stencilTableFactory.h', ['../a00716.html', 1, '']]],\n+ ['stenciltable_2eh_3', ['stencilTable.h', ['../a00713.html', 1, '']]],\n+ ['stenciltablefactory_2eh_4', ['stencilTableFactory.h', ['../a00719.html', 1, '']]],\n ['surface_2eh_5', ['surface.h', ['../a00689.html', 1, '']]],\n ['surfacefactory_2eh_6', ['surfaceFactory.h', ['../a00686.html', 1, '']]],\n ['surfacefactorycache_2eh_7', ['surfaceFactoryCache.h', ['../a00680.html', 1, '']]],\n ['surfacefactorymeshadapter_2eh_8', ['surfaceFactoryMeshAdapter.h', ['../a00683.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_e.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_e.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,14 +1,14 @@\n var searchData = [\n ['tbbevaluator_2eh_0', ['tbbEvaluator.h', ['../a00875.html', 1, '']]],\n ['tbbkernel_2eh_1', ['tbbKernel.h', ['../a00872.html', 1, '']]],\n- ['tessellation_2eh_2', ['tessellation.h', ['../a00674.html', 1, '']]],\n- ['topologydescriptor_2eh_3', ['topologyDescriptor.h', ['../a00713.html', 1, '']]],\n- ['topologylevel_2eh_4', ['topologyLevel.h', ['../a00710.html', 1, '']]],\n- ['topologyrefiner_2eh_5', ['topologyRefiner.h', ['../a00707.html', 1, '']]],\n- ['topologyrefinerfactory_2eh_6', ['topologyRefinerFactory.h', ['../a00701.html', 1, '']]],\n+ ['tessellation_2eh_2', ['tessellation.h', ['../a00677.html', 1, '']]],\n+ ['topologydescriptor_2eh_3', ['topologyDescriptor.h', ['../a00716.html', 1, '']]],\n+ ['topologylevel_2eh_4', ['topologyLevel.h', ['../a00707.html', 1, '']]],\n+ ['topologyrefiner_2eh_5', ['topologyRefiner.h', ['../a00704.html', 1, '']]],\n+ ['topologyrefinerfactory_2eh_6', ['topologyRefinerFactory.h', ['../a00710.html', 1, '']]],\n ['types_2eh_7', ['types.h', ['../a01486.html', 1, '(Global Namespace)'],\n ['../a01489.html', 1, '(Global Namespace)'],\n ['../a01492.html', 1, '(Global Namespace)'],\n ['../a01495.html', 1, '(Global Namespace)']\n ]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/search/files_f.js", "source2": "./usr/share/doc/opensubdiv/doxy_html/search/files_f.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,3 +1,3 @@\n var searchData = [\n- ['vertexdescriptor_2eh_0', ['vertexDescriptor.h', ['../a00677.html', 1, '']]]\n+ ['vertexdescriptor_2eh_0', ['vertexDescriptor.h', ['../a00674.html', 1, '']]]\n ];\n"}]}, {"source1": "./usr/share/doc/opensubdiv/tipuesearch/tipuesearch_content.js", "source2": "./usr/share/doc/opensubdiv/tipuesearch/tipuesearch_content.js", "unified_diff": null, "details": [{"source1": "js-beautify {}", "source2": "js-beautify {}", "unified_diff": "@@ -1,14 +1,19 @@\n var tipuesearch = {\n \"pages\": [{\n \"title\": \"osd_tutorial_0.cpp\",\n \"text\": \"osd_tutorial_0.cpp osd_tutorial_0.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsosdtutorial_0osd_tutorial_0.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial demonstrates the manipulation of Osd Evaluator and BufferDescriptor. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTableFactory.h include opensubdivosdcpuEvaluator.h include opensubdivosdcpuVertexBuffer.h include cstdio include cstring ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner const createTopologyRefiner int maxlevel ------------------------------------------------------------------------------ int main int , char int maxlevel 2 , nCoarseVerts 0 , nRefinedVerts 0 Setup phase Far StencilTable const stencilTable NULL Setup FarStencilTable Far TopologyRefiner const refiner createTopologyRefiner maxlevel Setup a factory to create FarStencilTable for more details see Far tutorials Far StencilTableFactory Options options options . generateOffsets true options . generateIntermediateLevels false stencilTable Far StencilTableFactory Create refiner , options nCoarseVerts refiner - GetLevel 0 . GetNumVertices nRefinedVerts stencilTable - GetNumStencils We are done with Far cleanup table delete refiner Setup a buffer for vertex primvar data Osd CpuVertexBuffer vbuffer Osd CpuVertexBuffer Create 3 , nCoarseVerts nRefinedVerts Execution phase every frame Pack the control vertex data at the start of the vertex buffer and update every time control data changes vbuffer - UpdateData g_verts , 0 , nCoarseVerts Osd BufferDescriptor srcDesc 0 , 3 , 3 Osd BufferDescriptor dstDesc nCoarseVerts 3 , 3 , 3 Launch the computation Osd CpuEvaluator EvalStencils vbuffer , srcDesc , vbuffer , dstDesc , stencilTable Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle float const refinedVerts vbuffer - BindCpuBuffer 3 nCoarseVerts for int i 0 i nRefinedVerts i float const vert refinedVerts 3 i printf -p f f f n , vert 0 , vert 1 , vert 2 printf -c 1 n delete stencilTable delete vbuffer ------------------------------------------------------------------------------ static Far TopologyRefiner const createTopologyRefiner int maxlevel Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel return refiner ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"osd_tutorial_0.html\"\n }, {\n+ \"title\": \"bfr_tutorial_2_1.cpp\",\n+ \"text\": \"bfr_tutorial_2_1.cpp bfr_tutorial_2_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_2_1bfr_tutorial_2_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes by illustrating the use of non-uniform tessellation parameters with Tessellation. Tessellation rates for the edges of a face are determined by a length associated with each edge. That length may be computed using either the control hull or the limit surface. The length of a tessellation interval is required and will be inferred if not explicitly specified as a command line option. The tessellation rate for an edge is computed as its length divided by the length of the tessellation interval. A maximum tessellation rate is imposed to prevent accidental unbounded tessellation, but can easily be raised as needed. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio include cmath include algorithm Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType float tessInterval int tessRateMax bool useHullFlag bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessInterval 0.0f , tessRateMax 10 , useHullFlag false , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -length if i argc tessInterval float atof argv i else if strcmp argv i , -max if i argc tessRateMax atoi argv i else if strcmp argv i , -hull useHullFlag true else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args Local trivial functions for simple edge length calculations and the determination of associated tessellation rates inline float EdgeLength float const v0 , float const v1 float dv 3 dv 0 std abs v0 0 - v1 0 dv 1 std abs v0 1 - v1 1 dv 2 std abs v0 2 - v1 2 return std sqrt dv 0 dv 0 dv 1 dv 1 dv 2 dv 2 float FindLongestEdge Far TopologyRefiner const mesh , std vector float const vertPos , int pointSize float maxLength 0.0f int numEdges mesh . GetLevel 0 . GetNumEdges for int i 0 i numEdges i Far ConstIndexArray edgeVerts mesh . GetLevel 0 . GetEdgeVertices i float edgeLength EdgeLength vertPos edgeVerts 0 pointSize , vertPos edgeVerts 1 pointSize maxLength std max maxLength , edgeLength return maxLength void GetEdgeTessRates std vector float const vertPos , int pointSize , Args const options , int edgeRates int numEdges int vertPos . size pointSize for int i 0 i numEdges i int j i 1 numEdges float edgeLength EdgeLength vertPos i pointSize , vertPos j pointSize edgeRates i 1 int edgeLength options . tessInterval edgeRates i std min edgeRates i , options . tessRateMax The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector int faceTessRates std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Prepare the Surface patch points first as it may be evaluated to determine suitable edge-rates for Tessellation int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize For each of the N edges of the face, a tessellation rate is determined to initialize a non-uniform Tessellation pattern. Many metrics are possible -- some based on the geometry itself size, curvature, others dependent on viewpoint screen space size, center of view, etc. and many more. Simple techniques are chosen here for illustration and can easily be replaced. Here two methods are shown using lengths between the corners of the face -- the first using the vertex positions of the face and the second using points evaluated at the corners of its limit surface. Use of the control hull is more efficient avoiding the evaluation but may prove less effective in some cases though both estimates have their limitations. int N faceSurface . GetFaceSize Use the output array temporarily to hold the N positions outPos . resize N pointSize if options . useHullFlag Far ConstIndexArray verts meshTopology . GetLevel 0 . GetFaceVertices faceIndex for int i 0 , j 0 i N i , j pointSize float const vPos meshVertexPositions verts i pointSize outPos j vPos 0 outPos j 1 vPos 1 outPos j 2 vPos 2 else Bfr Parameterization faceParam faceSurface . GetParameterization for int i 0 , j 0 i N i , j pointSize float uv 2 faceParam . GetVertexCoord i , uv faceSurface . Evaluate uv , facePatchPoints . data , pointSize , outPos j faceTessRates . resize N GetEdgeTessRates outPos , pointSize , options , faceTessRates . data Declare a non-uniform Tessellation using the rates for each edge and identify coordinates of the points to evaluate Additional interior rates can be optionally provided 2 for quads, 1 for others but will be inferred in their absence. Bfr Tessellation tessPattern faceSurface . GetParameterization , N , faceTessRates . data , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Resize the output arrays and evaluate outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE If no interval length was specified, set one by finding the longest edge of the mesh and dividing it by the maximum tessellation rate if args . tessInterval 0.0f args . tessInterval FindLongestEdge meshTopology , meshVtxPositions , 3 float args . tessRateMax tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"bfr_tutorial_2_1.html\"\n+ }, {\n \"title\": \"bfr_tutorial_3_2.cpp\",\n \"text\": \"bfr_tutorial_3_2.cpp bfr_tutorial_3_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_3_2bfr_tutorial_3_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial is a variation of tutorials showing simple uniform tessellation. Rather than constructing and evaluating a Surface at a time, this tutorial shows how Surfaces can be created and saved for repeated use. A simple SurfaceCache class is created that creates and stores the Surface for each face, along with the patch points associated with it. The main tessellation function remains essentially the same, but here it access the Surfaces from the SurfaceCache rather than computing them locally. Note that while this example illustrated the retention of all Surfaces for a mesh, this behavior is not recommended. It does not scale well for large meshes and undermines the memory savings that transient use of Surfaces is designed to achieve. Rather than storing Surfaces for all faces, maintaining a priority queue for a fixed number may be a reasonable compromise. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include memory include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args This simple class creates and dispenses Surfaces for all faces of a mesh. It consists primarily of an array of simple structs entries for each face and a single array of patch points for all Surfaces created. There are many ways to create such a cache depending on requirements. This is a simple example, but the interface presents some options that are worth considering. A SurfaceCache is constructed here given the following - a reference to the SurfaceFactory - the cache could just as easily take a reference to the mesh and construct the SurfaceFactory internally - the position data for the mesh - this is needed to compute patch points for the Surfaces - if caching UVs or any other primvar, other data needs to be provided -- along with the interpolation type for that data vertex, face-varying, etc. - option to cache patch points - the cache could store the Surfaces only or also include their patch points - storing patch points takes more memory but will eliminate any preparation time for evaluation of the Surface - option to cache all surfaces - the benefits to caching simple linear or regular surfaces are minimal -- and may even be detrimental - so only caching non-linear irregular surfaces is an option worth considering The SurfaceCache implementation here provides the options noted above. But for simplicity, the actual usage of the SurfaceCache does not deal with the permutations of additional work that is necessary when the Surfaces or their patch points are not cached. class SurfaceCache public typedef Bfr Surface float Surface typedef Bfr RefinerSurfaceFactory SurfaceFactory public SurfaceCache SurfaceFactory const surfaceFactory , std vector float const meshPoints , bool cachePatchPoints true , bool cacheAllSurfaces true SurfaceCache delete SurfaceCache default Public methods to retrieved cached Surfaces and their pre-computed patch points bool FaceHasLimitSurface int face return _entries face . hasLimit Surface const GetSurface int face return _entries face . surface . get float const GetPatchPoints int face return getPatchPoints face private Simple struct to keep track of Surface and more for each face struct FaceEntry FaceEntry surface , hasLimit false , pointOffset -1 std unique_ptr Surface const surface bool hasLimit int pointOffset Non-const version to be used internally to aide assignment float getPatchPoints int face return _entries face . surface _points . empty _points . data _entries face . pointOffset 3 0 private std vector FaceEntry _entries std vector float _points SurfaceCache SurfaceCache SurfaceFactory const surfaceFactory , std vector float const meshPoints , bool cachePatchPoints , bool cacheAllSurfaces int numFaces surfaceFactory . GetNumFaces _entries . resize numFaces int numPointsInCache 0 for int face 0 face numFaces face Surface s surfaceFactory . CreateVertexSurface float face if s FaceEntry entry _entries face entry . hasLimit true if cacheAllSurfaces s - IsRegular s - IsLinear entry . surface . reset s entry . pointOffset numPointsInCache numPointsInCache s - GetNumPatchPoints else delete s if cachePatchPoints _points . resize numPointsInCache 3 for int face 0 face numFaces face float patchPoints getPatchPoints face if patchPoints GetSurface face - PreparePatchPoints meshPoints . data , 3 , patchPoints , 3 The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions Initialize a SurfaceCache to construct Surfaces for all faces. From this point forward the SurfaceFactory is no longer used to access Surfaces. Note also that usage below is specific to the options used to initialize the SurfaceCache bool cachePatchPoints true bool cacheAllSurfaces true SurfaceCache surfaceCache meshSurfaceFactory , meshVertexPositions , cachePatchPoints , cacheAllSurfaces As with previous tutorials, output data associated with the face can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Retrieve the Surface for this face when present if surfaceCache . FaceHasLimitSurface faceIndex continue Surface const faceSurface surfaceCache . GetSurface faceIndex Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Retrieve the patch points for the Surface, then use them to evaluate output points for all identified coordinates float const facePatchPoints surfaceCache . GetPatchPoints faceIndex int pointSize 3 outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_3_2.html\"\n }, {\n \"title\": \"bfr_tutorial_2_2.cpp\",\n \"text\": \"bfr_tutorial_2_2.cpp bfr_tutorial_2_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_2_2bfr_tutorial_2_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on others using the SurfaceFactory, Surface and Tessellation classes by using more of the functionality of the Tessellation class to construct a tessellation of the mesh that is topologically watertight, i.e. resulting points evaluated along shared edges or vertices are shared and not duplicated. Since Tessellation provides points around its boundary first, the evaluated points for shared vertices and edges are identified when constructed and reused when shared later. The boundary of the tessellation of a face is therefore a collection of shared points and methods of Tessellation help to remap the faces generated to the shared set of points. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio include cassert Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv using Far Index using Far IndexArray using Far ConstIndexArray Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args Simple local structs supporting shared points for vertices and edges namespace struct SharedVertex SharedVertex pointIndex -1 bool IsSet const return pointIndex 0 void Set int index pointIndex index int pointIndex struct SharedEdge SharedEdge pointIndex -1 , numPoints 0 bool IsSet const return pointIndex 0 void Set int index , int n pointIndex index , numPoints n int pointIndex int numPoints end namespace The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. This tessellation function differs from earlier tutorials in that it computes and reuses shared points at vertices and edges of the mesh. There are several ways to compute these shared points, and which is best depends on context. Dealing with shared data poses complications for threading in general, so computing all points for the vertices and edges up front may be preferred -- despite the fact that faces will be visited more than once first when generating potentially shared vertex or edge points, and later when generating any interior points. The loops for vertices and edges can be threaded and the indexing of the shared points is simpler. For the single-threaded case here, the faces are each processed in order and any shared points will be computed and used as needed. So each face is visited once and so each Surface initialized once but the bookkeeping to deal with indices of shared points becomes more complicated. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Declare vectors to identify shared tessellation points at vertices and edges and their indices around the boundary of a face Far TopologyLevel const baseLevel meshTopology . GetLevel 0 std vector SharedVertex sharedVerts baseLevel . GetNumVertices std vector SharedEdge sharedEdges baseLevel . GetNumEdges std vector int tessBoundaryIndices Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numMeshPointsEvaluated 0 int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate the patch point array faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize Evaluate the sample points of the Tessellation First traverse the boundary of the face to determine whether to evaluate or share points on vertices and edges of the face. Both pre-existing and new boundary points are identified by index in an array for later use. The interior points are all trivially computed after the boundary is dealt with. Identify the boundary and interior coords and initialize the index array for the potentially shared boundary points int numBoundaryCoords tessPattern . GetNumBoundaryCoords int numInteriorCoords numOutCoords - numBoundaryCoords float const tessBoundaryCoords outCoords 0 float const tessInteriorCoords outCoords numBoundaryCoords 2 ConstIndexArray fVerts baseLevel . GetFaceVertices faceIndex ConstIndexArray fEdges baseLevel . GetFaceEdges faceIndex tessBoundaryIndices . resize numBoundaryCoords Walk around the face, inspecting each vertex and outgoing edge, and populating the index array of boundary points float patchPointData facePatchPoints . data int boundaryIndex 0 int numFacePointsEvaluated 0 for int i 0 i fVerts . size i Index vertIndex fVerts i Index edgeIndex fEdges i int edgeRate options . tessUniformRate Evaluateassign or retrieve the shared point for the vertex SharedVertex sharedVertex sharedVerts vertIndex if sharedVertex . IsSet Identify indices of the new shared point in both the mesh and face and increment their inventory int indexInMesh numMeshPointsEvaluated int indexInFace numFacePointsEvaluated sharedVertex . Set indexInMesh Evaluate new shared point and assign index to boundary float const uv tessBoundaryCoords boundaryIndex 2 int pIndex indexInFace pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex tessBoundaryIndices boundaryIndex indexInMesh else Assign shared vertex point index to boundary tessBoundaryIndices boundaryIndex sharedVertex . pointIndex Evaluateassign or retrieve all shared points for the edge To keep this simple, assume the edge is manifold. So the second face sharing the edge has that edge in the opposite direction in its boundary relative to the first face -- making it necessary to reverse the order of shared points for the boundary of the second face. To support a non-manifold edge, all subsequent faces that share the assigned shared edge must determine if their orientation of that edge is reversed relative to the first face for which the shared edge points were evaluated. So a little more book-keeping andor inspection is required. if edgeRate 1 int pointsPerEdge edgeRate - 1 SharedEdge sharedEdge sharedEdges edgeIndex if sharedEdge . IsSet Identify indices of the new shared points in both the mesh and face and increment their inventory int nextInMesh numMeshPointsEvaluated int nextInFace numFacePointsEvaluated numFacePointsEvaluated pointsPerEdge numMeshPointsEvaluated pointsPerEdge sharedEdge . Set nextInMesh , pointsPerEdge Evaluate shared points and assign indices to boundary float const uv tessBoundaryCoords boundaryIndex 2 for int j 0 j pointsPerEdge j , uv 2 int pIndex nextInFace pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex tessBoundaryIndices boundaryIndex nextInMesh else See note above on simplification for manifold edges assert baseLevel . IsEdgeNonManifold edgeIndex Assign shared points to boundary in reverse order int nextInMesh sharedEdge . pointIndex pointsPerEdge - 1 for int j 0 j pointsPerEdge j tessBoundaryIndices boundaryIndex nextInMesh -- Evaluate any interior points unique to this face -- appending them to those shared points computed above for the boundary if numInteriorCoords float const uv tessInteriorCoords int iLast numFacePointsEvaluated numInteriorCoords for int i numFacePointsEvaluated i iLast i , uv 2 int pIndex i pointSize faceSurface . Evaluate uv , patchPointData , pointSize , outPos pIndex , outDu pIndex , outDv pIndex numFacePointsEvaluated numInteriorCoords numMeshPointsEvaluated numInteriorCoords Remember to trimresize the arrays storing evaluation results for new points to reflect the size actually populated. outPos . resize numFacePointsEvaluated pointSize outDu . resize numFacePointsEvaluated pointSize outDv . resize numFacePointsEvaluated pointSize Identify the faces of the Tessellation Note that the coordinate indices used by the facets are local to the face i.e. they range from 0..N-1, where N is the number of coordinates in the pattern and so need to be offset when writing to Obj format. For more advanced use, the coordinates associated with the boundary and interior of the pattern are distinguishable so that those on the boundary can be easily remapped to refer to shared edge or corner points, while those in the interior can be separately offset or similarly remapped. So transform the indices of the facets here as needed using the indices of shared boundary points assembled above and a suitable offset for the new interior points added int tessInteriorOffset numMeshPointsEvaluated - numOutCoords int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , tessBoundaryIndices . data , tessInteriorOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n@@ -21,34 +26,29 @@\n \"loc\": \"bfr_tutorial_3_1.html\"\n }, {\n \"title\": \"bfr_tutorial_1_5.cpp\",\n \"text\": \"bfr_tutorial_1_5.cpp bfr_tutorial_1_5.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_5bfr_tutorial_1_5.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial is an alternative to an earlier tutorial that showed uniform tessellation. This version differs by evaluating the points of the tessellation using limit stencils instead of the standard Surface evaluation methods. Limit stencils factor the evaluation into a set of coefficients for each control point affecting the Surface. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float faceControlPoints std vector float limitStencils std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Resize stencils and control point arrays based on the number of control points for the Surface int numControlPoints faceSurface . GetNumControlPoints limitStencils . resize 3 numControlPoints float pStencil limitStencils . data float duStencil limitStencils . data numControlPoints float dvStencil limitStencils . data numControlPoints 2 Limit stencils can be applied using the control points in a local array or directy from the mesh. Both are shown here, so if using the local array, resize and populate it bool gatherControlPoints true if gatherControlPoints faceControlPoints . resize numControlPoints 3 faceSurface . GatherControlPoints meshVertexPositions . data , 3 , faceControlPoints . data , 3 Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Evaluate and apply stencils to compute points of the tessellation outPos . resize numOutCoords 3 outDu . resize numOutCoords 3 outDv . resize numOutCoords 3 for int i 0 i numOutCoords i float const uv outCoords . data i 2 faceSurface . EvaluateStencil uv , pStencil , duStencil , dvStencil float p outPos . data i 3 float du outDu . data i 3 float dv outDv . data i 3 if gatherControlPoints float const controlPoints faceControlPoints . data faceSurface . ApplyStencil pStencil , controlPoints , 3 , p faceSurface . ApplyStencil duStencil , controlPoints , 3 , du faceSurface . ApplyStencil dvStencil , controlPoints , 3 , dv else float const meshPoints meshVertexPositions . data faceSurface . ApplyStencilFromMesh pStencil , meshPoints , 3 , p faceSurface . ApplyStencilFromMesh duStencil , meshPoints , 3 , du faceSurface . ApplyStencilFromMesh dvStencil , meshPoints , 3 , dv Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_1_5.html\"\n }, {\n- \"title\": \"bfr_tutorial_2_1.cpp\",\n- \"text\": \"bfr_tutorial_2_1.cpp bfr_tutorial_2_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_2_1bfr_tutorial_2_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes by illustrating the use of non-uniform tessellation parameters with Tessellation. Tessellation rates for the edges of a face are determined by a length associated with each edge. That length may be computed using either the control hull or the limit surface. The length of a tessellation interval is required and will be inferred if not explicitly specified as a command line option. The tessellation rate for an edge is computed as its length divided by the length of the tessellation interval. A maximum tessellation rate is imposed to prevent accidental unbounded tessellation, but can easily be raised as needed. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio include cmath include algorithm Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType float tessInterval int tessRateMax bool useHullFlag bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessInterval 0.0f , tessRateMax 10 , useHullFlag false , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -length if i argc tessInterval float atof argv i else if strcmp argv i , -max if i argc tessRateMax atoi argv i else if strcmp argv i , -hull useHullFlag true else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args Local trivial functions for simple edge length calculations and the determination of associated tessellation rates inline float EdgeLength float const v0 , float const v1 float dv 3 dv 0 std abs v0 0 - v1 0 dv 1 std abs v0 1 - v1 1 dv 2 std abs v0 2 - v1 2 return std sqrt dv 0 dv 0 dv 1 dv 1 dv 2 dv 2 float FindLongestEdge Far TopologyRefiner const mesh , std vector float const vertPos , int pointSize float maxLength 0.0f int numEdges mesh . GetLevel 0 . GetNumEdges for int i 0 i numEdges i Far ConstIndexArray edgeVerts mesh . GetLevel 0 . GetEdgeVertices i float edgeLength EdgeLength vertPos edgeVerts 0 pointSize , vertPos edgeVerts 1 pointSize maxLength std max maxLength , edgeLength return maxLength void GetEdgeTessRates std vector float const vertPos , int pointSize , Args const options , int edgeRates int numEdges int vertPos . size pointSize for int i 0 i numEdges i int j i 1 numEdges float edgeLength EdgeLength vertPos i pointSize , vertPos j pointSize edgeRates i 1 int edgeLength options . tessInterval edgeRates i std min edgeRates i , options . tessRateMax The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector int faceTessRates std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Prepare the Surface patch points first as it may be evaluated to determine suitable edge-rates for Tessellation int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize For each of the N edges of the face, a tessellation rate is determined to initialize a non-uniform Tessellation pattern. Many metrics are possible -- some based on the geometry itself size, curvature, others dependent on viewpoint screen space size, center of view, etc. and many more. Simple techniques are chosen here for illustration and can easily be replaced. Here two methods are shown using lengths between the corners of the face -- the first using the vertex positions of the face and the second using points evaluated at the corners of its limit surface. Use of the control hull is more efficient avoiding the evaluation but may prove less effective in some cases though both estimates have their limitations. int N faceSurface . GetFaceSize Use the output array temporarily to hold the N positions outPos . resize N pointSize if options . useHullFlag Far ConstIndexArray verts meshTopology . GetLevel 0 . GetFaceVertices faceIndex for int i 0 , j 0 i N i , j pointSize float const vPos meshVertexPositions verts i pointSize outPos j vPos 0 outPos j 1 vPos 1 outPos j 2 vPos 2 else Bfr Parameterization faceParam faceSurface . GetParameterization for int i 0 , j 0 i N i , j pointSize float uv 2 faceParam . GetVertexCoord i , uv faceSurface . Evaluate uv , facePatchPoints . data , pointSize , outPos j faceTessRates . resize N GetEdgeTessRates outPos , pointSize , options , faceTessRates . data Declare a non-uniform Tessellation using the rates for each edge and identify coordinates of the points to evaluate Additional interior rates can be optionally provided 2 for quads, 1 for others but will be inferred in their absence. Bfr Tessellation tessPattern faceSurface . GetParameterization , N , faceTessRates . data , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Resize the output arrays and evaluate outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE If no interval length was specified, set one by finding the longest edge of the mesh and dividing it by the maximum tessellation rate if args . tessInterval 0.0f args . tessInterval FindLongestEdge meshTopology , meshVtxPositions , 3 float args . tessRateMax tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_2_1.html\"\n- }, {\n- \"title\": \"bfr_tutorial_1_3.cpp\",\n- \"text\": \"bfr_tutorial_1_3.cpp bfr_tutorial_1_3.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_3bfr_tutorial_1_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes for evaluating and tessellating the limit surface of faces of a mesh by adding support for the evaluation of face-varying UVs. If UVs exist in the given mesh, they will be evaluated and included with the vertex positions and normals previously illustrated as part of the tessellation written to the Obj file. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , std vector float const meshFaceVaryingUVs , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. bool meshHasUVs meshTopology . GetNumFVarChannels 0 SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize 3 facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays posSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize 2 facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays uvSurface . PreparePatchPoints meshFaceVaryingUVs . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , meshFVarUVs , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"bfr_tutorial_1_3.html\"\n- }, {\n \"title\": \"bfr_tutorial_1_4.cpp\",\n \"text\": \"bfr_tutorial_1_4.cpp bfr_tutorial_1_4.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_4bfr_tutorial_1_4.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes for evaluating and tessellating the limit surface of faces of a mesh by illustrating how the presence of additional data in the mesh arrays is handled. As in the previous tutorial, vertex positions and face-varying UVs are provided with the mesh to be evaluated. But here an additional color is interleaved with the position in the vertex data of the mesh and a third component is added to face-varying UV data making it u,v,w. To evaluate the position and 2D UVs while avoiding the color and unused third UV coordinate, the SurfacePointDescriptor class is used to describe the size and stride of the desired data to be evaluated in the arrays of mesh data. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVtxData , int vtxDataSize , std vector float const meshFVarData , int fvarDataSize , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface typedef Surface PointDescriptor SurfacePoint Identify the source positions and UVs within more general data arrays for the mesh. If position andor UV are not at the start of the vtx andor fvar data, simply offset the head of the array here accordingly bool meshHasUVs meshTopology . GetNumFVarChannels 0 float const meshPosData meshVtxData . data SurfacePoint meshPosPoint 3 , vtxDataSize float const meshUVData meshHasUVs meshFVarData . data 0 SurfacePoint meshUVPoint 2 , fvarDataSize Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize meshPosPoint . size facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays float patchPosData facePatchPoints . data SurfacePoint patchPosPoint pointSize posSurface . PreparePatchPoints meshPosData , meshPosPoint , patchPosData , patchPosPoint for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , patchPosData , patchPosPoint , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize meshUVPoint . size facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays float patchUVData facePatchPoints . data SurfacePoint patchUVPoint pointSize uvSurface . PreparePatchPoints meshUVData , meshUVPoint , patchUVData , patchUVPoint for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , patchUVData , patchUVPoint , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE Expand the loaded position and UV arrays to include additional data initialized with -1 for distinction, e.g. add a 4-tuple for RGBA color to the vertex data and add a third field w to the face-varying data int numPos int meshVtxPositions . size 3 int vtxSize 7 std vector float vtxData numPos vtxSize , -1.0f for int i 0 i numPos i vtxData i vtxSize meshVtxPositions i 3 vtxData i vtxSize 1 meshVtxPositions i 3 1 vtxData i vtxSize 2 meshVtxPositions i 3 2 int numUVs int meshFVarUVs . size 2 int fvarSize 3 std vector float fvarData numUVs fvarSize , -1.0f for int i 0 i numUVs i fvarData i fvarSize meshFVarUVs i 2 fvarData i fvarSize 1 meshFVarUVs i 2 1 Pass the expanded data arrays along with their respective strides tessellateToObj meshTopology , vtxData , vtxSize , fvarData , fvarSize , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_1_4.html\"\n }, {\n \"title\": \"bfr_tutorial_1_2.cpp\",\n \"text\": \"bfr_tutorial_1_2.cpp bfr_tutorial_1_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_2bfr_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory and Surface for evaluating the limit surface of faces by using the Tessellation class to determine the points to evaluate and the faces that connect them. The Tessellation class replaces the explicit determination of points and faces for the triangle fan of the previous example. Given a uniform tessellation rate via a command line option, Tessellation returns the set of coordinates to evaluate, and separately returns the faces that connect them. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern faceSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outFacets , tessFacetSize , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"bfr_tutorial_1_2.html\"\n }, {\n+ \"title\": \"bfr_tutorial_1_3.cpp\",\n+ \"text\": \"bfr_tutorial_1_3.cpp bfr_tutorial_1_3.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_3bfr_tutorial_1_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial builds on the previous tutorial that makes use of the SurfaceFactory, Surface and Tessellation classes for evaluating and tessellating the limit surface of faces of a mesh by adding support for the evaluation of face-varying UVs. If UVs exist in the given mesh, they will be evaluated and included with the vertex positions and normals previously illustrated as part of the tessellation written to the Obj file. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include opensubdivbfrtessellation.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType int tessUniformRate bool tessQuadsFlag bool uv2xyzFlag public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK , tessUniformRate 5 , tessQuadsFlag false , uv2xyzFlag false for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else if strcmp argv i , -res if i argc tessUniformRate atoi argv i else if strcmp argv i , -quads tessQuadsFlag true else if strcmp argv i , -uv2xyz uv2xyzFlag true else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , std vector float const meshFaceVaryingUVs , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing When dealing with face-varying data, an identifier is necessary when constructing Surfaces in order to distinguish the different face-varying data channels. To avoid repeatedly specifying that identifier when only one is present or of interest, it can be specified via the Options. bool meshHasUVs meshTopology . GetNumFVarChannels 0 SurfaceFactory Options surfaceOptions if meshHasUVs surfaceOptions . SetDefaultFVarID 0 SurfaceFactory surfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface posSurface Surface uvSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector float outUV std vector int outFacets Assign Tessellation Options applied for all faces. Tessellations allow the creating of either 3- or 4-sided faces -- both of which are supported here via a command line option int const tessFacetSize 3 options . tessQuadsFlag Bfr Tessellation Options tessOptions tessOptions . SetFacetSize tessFacetSize tessOptions . PreserveQuads options . tessQuadsFlag Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces surfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surfaces for position and UVs of this face. There are two ways to do this -- both illustrated here Creating Surfaces for the different data interpolation types independently is clear and convenient, but considerable work may be duplicated in the construction process in the case of non-linear face-varying Surfaces. So unless it is known that face-varying interpolation is linear, use of InitSurfaces is generally preferred. Remember also that the face-varying identifier is omitted from the initialization methods here as it was previously assigned to the SurfaceFactoryOptions. In the absence of an assignment of the default FVarID to the Options, a failure to specify the FVarID here will result in failure. The cases below are expanded for illustration purposes, and validity of the resulting Surface is tested here, rather than the return value of initialization methods. bool createSurfacesTogether true if meshHasUVs surfaceFactory . InitVertexSurface faceIndex , posSurface else if createSurfacesTogether surfaceFactory . InitSurfaces faceIndex , posSurface , uvSurface else if surfaceFactory . InitVertexSurface faceIndex , posSurface surfaceFactory . InitFaceVaryingSurface faceIndex , uvSurface if posSurface . IsValid continue Declare a simple uniform Tessellation for the Parameterization of this face and identify coordinates of the points to evaluate Bfr Tessellation tessPattern posSurface . GetParameterization , options . tessUniformRate , tessOptions int numOutCoords tessPattern . GetNumCoords outCoords . resize numOutCoords 2 tessPattern . GetCoords outCoords . data Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Evaluate vertex positions Resize patch point and output arrays int pointSize 3 facePatchPoints . resize posSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays posSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize posSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Evaluate face-varying UVs when present if meshHasUVs Resize patch point and output arrays - note reuse of the same patch point array as position int pointSize 2 facePatchPoints . resize uvSurface . GetNumPatchPoints pointSize outUV . resize numOutCoords pointSize Populate patch point and output arrays uvSurface . PreparePatchPoints meshFaceVaryingUVs . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize uvSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outUV j Identify the faces of the Tessellation Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. One of several Tessellation methods to transform the facet indices simply translates all indices by the desired offset. int objVertexIndexOffset objWriter . GetNumVertices int numFacets tessPattern . GetNumFacets outFacets . resize numFacets tessFacetSize tessPattern . GetFacets outFacets . data tessPattern . TransformFacetCoordIndices outFacets . data , objVertexIndexOffset Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex if meshHasUVs options . uv2xyzFlag objWriter . WriteVertexPositions outUV , 2 objWriter . WriteFaces outFacets , tessFacetSize , false , false else objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv if meshHasUVs objWriter . WriteVertexUVs outUV objWriter . WriteFaces outFacets , tessFacetSize , true , meshHasUVs Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , meshFVarUVs , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"bfr_tutorial_1_3.html\"\n+ }, {\n \"title\": \"far_tutorial_5_3.cpp\",\n \"text\": \"far_tutorial_5_3.cpp far_tutorial_5_3.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_5_3far_tutorial_5_3.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to use a FarLimitStenciTable to repeatedly and efficiently evaluate a set of points and optionally derivatives on the limit surface. A LimitStencilTable derives from StencilTable but is specialized to factor the evaluation of limit positions and derivatives into stencils. This allows a set of limit properties to be efficiently recomputed in response to changes to the vertices of the base mesh. Constructing the different kinds of StencilTables can have a high cost, so whether that cost is worth it will depend on your usage e.g. if points are only computed once, using stencil tables is typically not worth the added cost. Any points on the limit surface can be identified for evaluation. In this example we create a crude tessellation similar to tutorial_5_2. The midpoint of each face and points near the corners of the face are evaluated and a triangle fan connects them. include ......regressioncommonarg_utils.h include ......regressioncommonfar_utils.h include opensubdivfartopologyDescriptor.h include opensubdivfarpatchTableFactory.h include opensubdivfarstencilTableFactory.h include opensubdivfarptexIndices.h include cassert include cstdio include cstring include fstream include sstream using namespace OpenSubdiv using Far Index Global utilities in this namespace are not relevant to the tutorial. They simply serve to construct some default geometry to be processed in the form of a TopologyRefiner and vector of vertex positions. namespace Simple structs for x,y,z position and a 3-tuple for the set of vertices of a triangle struct Pos Pos Pos float x , float y , float z p 0 x , p 1 y , p 2 z Pos operator Pos const op const return Pos p 0 op . p 0 , p 1 op . p 1 , p 2 op . p 2 Clear and AddWithWeight required for interpolation void Clear void 0 p 0 p 1 p 2 0.0f void AddWithWeight Pos const src , float weight p 0 weight src . p 0 p 1 weight src . p 1 p 2 weight src . p 2 float p 3 typedef std vector Pos PosVector struct Tri Tri Tri int a , int b , int c v 0 a , v 1 b , v 2 c int v 3 typedef std vector Tri TriVector Functions to populate the topology and geometry arrays a simple shape whose positions may be transformed void createCube std vector int vertsPerFace , std vector Index faceVertsPerFace , std vector Pos positionsPerVert Local topology and position of a cube centered at origin static float const cubePositions 8 3 -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f static int const cubeFaceVerts 6 4 0 , 3 , 2 , 1 , 4 , 5 , 6 , 7 , 0 , 4 , 7 , 3 , 1 , 2 , 6 , 5 , 0 , 1 , 5 , 4 , 3 , 7 , 6 , 2 Initialize verts-per-face and face-vertices for each face vertsPerFace . resize 6 faceVertsPerFace . resize 24 for int i 0 i 6 i vertsPerFace i 4 for int j 0 j 4 j faceVertsPerFace i 4 j cubeFaceVerts i j Initialize vertex positions positionsPerVert . resize 8 for int i 0 i 8 i float const p cubePositions i positionsPerVert i Pos p 0 , p 1 , p 2 Create a TopologyRefiner from default geometry created above Far TopologyRefiner createTopologyRefinerDefault PosVector posVector std vector int topVertsPerFace std vector Index topFaceVerts createCube topVertsPerFace , topFaceVerts , posVector typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_AND_CORNER Descriptor desc desc . numVertices int posVector . size desc . numFaces int topVertsPerFace . size desc . numVertsPerFace topVertsPerFace 0 desc . vertIndicesPerFace topFaceVerts 0 Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options assert refiner return refiner Create a TopologyRefiner from a specified Obj file geometry created internally Far TopologyRefiner createTopologyRefinerFromObj std string const objFileName , Sdc SchemeType schemeType , PosVector posVector const char filename objFileName . c_str const Shape shape 0 std ifstream ifs filename if ifs std stringstream ss ss ifs . rdbuf ifs . close std string shapeString ss . str shape Shape parseObj shapeString . c_str , ConvertSdcTypeToShapeScheme schemeType , false if shape 0 fprintf stderr , Error Cannot create Shape from .obj file s n , filename return 0 else fprintf stderr , Error Cannot open .obj file s n , filename return 0 Sdc SchemeType sdcType GetSdcType shape Sdc Options sdcOptions GetSdcOptions shape Far TopologyRefiner refiner Far TopologyRefinerFactory Shape Create shape , Far TopologyRefinerFactory Shape Options sdcType , sdcOptions if refiner 0 fprintf stderr , Error Unable to construct TopologyRefiner from .obj file s n , filename return 0 int numVertices refiner - GetNumVerticesTotal posVector . resize numVertices std memcpy posVector 0 . p 0 , shape - verts 0 , numVertices 3 sizeof float delete shape return refiner Simple function to export an Obj file for the limit points -- which provides a simple tessllation similar to tutorial_5_2. int writeToObj Far TopologyLevel const baseLevel , std vector Pos const vertexPositions , int nextObjVertexIndex for size_t i 0 i vertexPositions . size i float const p vertexPositions i . p printf v f f f n , p 0 , p 1 , p 2 Connect the sequences of limit points center followed by corners into triangle fans for each base face for int i 0 i baseLevel . GetNumFaces i int faceSize baseLevel . GetFaceVertices i . size int vCenter nextObjVertexIndex 1 int vCorner vCenter 1 for int k 0 k faceSize k printf f d d d n , vCenter , vCorner k , vCorner k 1 faceSize nextObjVertexIndex faceSize 1 return nextObjVertexIndex end namespace Command line arguments parsed to provide run-time options class Args public std string inputObjFile Sdc SchemeType schemeType int maxPatchDepth int numPoses Pos poseOffset bool deriv1Flag bool noPatchesFlag bool noOutputFlag public Args int argc , char argv inputObjFile , schemeType Sdc SCHEME_CATMARK , maxPatchDepth 3 , numPoses 0 , poseOffset 1.0f , 0.0f , 0.0f , deriv1Flag false , noPatchesFlag false , noOutputFlag false Parse and assign standard arguments and Obj files ArgOptions args args . Parse argc , argv maxPatchDepth args . GetLevel schemeType ConvertShapeSchemeToSdcType args . GetDefaultScheme const std vector const char objFiles args . GetObjFiles if objFiles . empty for size_t i 1 i objFiles . size i fprintf stderr , Warning .obj file s ignored n , objFiles i inputObjFile std string objFiles 0 Parse remaining arguments specific to this example const std vector const char rargs args . GetRemainingArgs for size_t i 0 i rargs . size i if strcmp rargs i , -d1 deriv1Flag true else if strcmp rargs i , -nopatches noPatchesFlag true else if strcmp rargs i , -poses if i rargs . size numPoses atoi rargs i else if strcmp rargs i , -offset if i rargs . size poseOffset . p 0 float atof rargs i if i rargs . size poseOffset . p 1 float atof rargs i if i rargs . size poseOffset . p 2 float atof rargs i else if strcmp rargs i , -nooutput noOutputFlag true else fprintf stderr , Warning Argument s ignored n , rargs i private Args Assemble the set of locations for the limit points. The resulting vector of LocationArrays can contain arbitrary locations on the limit surface -- with multiple locations for the same patch grouped into a single array. In this case, for each base face, coordinates for the center and its corners are specified -- from which we will construct a triangle fan providing a crude tessellation similar to tutorial_5_2. typedef Far LimitStencilTableFactory LocationArray LocationArray int assembleLimitPointLocations Far TopologyRefiner const refiner , std vector LocationArray locations Coordinates for the center of the face and its corners slightly inset. Unlike most of the public interface for patches, the LocationArray refers to parameteric coordinates as s,t, so that convention will be followed here. Note that the s,t coordinates in a LocationArray are referred to by reference. The memory holding these s,t values must persist while the LimitStencilTable is constructed -- the arrays here are declared as static for that purpose. static float const quadSCoords 5 0.5f , 0.05f , 0.95f , 0.95f , 0.05f static float const quadTCoords 5 0.5f , 0.05f , 0.05f , 0.95f , 0.95f static float const triSCoords 4 0.33f , 0.05f , 0.95f , 0.05f static float const triTCoords 4 0.33f , 0.05f , 0.00f , 0.95f static float const irregSCoords 2 1.0f , 0.05f static float const irregTCoords 2 1.0f , 0.05f Since these are references to patches to be evaluated, we require use of the Ptex indices to identify the top-most parameterized patch, which is essential to dealing with non-quad faces in the case of Catmark. Far TopologyLevel const baseLevel refiner . GetLevel 0 Far PtexIndices basePtexIndices refiner int regFaceSize Sdc SchemeTypeTraits GetRegularFaceSize refiner . GetSchemeType For each base face, simply refer to the s,t arrays for regular quad and triangular patches with a single LocationArray. Otherwise, for irregular faces, the corners of the face come from different patches and so must be referenced in separate LocationArrays. locations . clear int numLimitPoints 0 for int i 0 i baseLevel . GetNumFaces i int baseFaceSize baseLevel . GetFaceVertices i . size int basePtexId basePtexIndices . GetFaceId i bool faceIsRegular baseFaceSize regFaceSize if faceIsRegular All coordinates are on the same top-level patch LocationArray loc loc . ptexIdx basePtexId loc . numLocations baseFaceSize 1 if baseFaceSize 4 loc . s quadSCoords loc . t quadTCoords else loc . s triSCoords loc . t triTCoords locations . push_back loc else Center coordinate is on the first sub-patch while those on near the corners are on each successive sub-patch LocationArray loc loc . numLocations 1 for int j 0 j baseFaceSize j bool isPerimeter j 0 loc . ptexIdx basePtexId isPerimeter j -1 0 loc . s irregSCoords isPerimeter loc . t irregTCoords isPerimeter locations . push_back loc numLimitPoints baseFaceSize 1 return numLimitPoints Load command line arguments and geometry, build the LimitStencilTable for a set of points on the limit surface and compute those points for several orientations of the mesh int main int argc , char argv Args args argc , argv Create or load the base geometry command line arguments allow a .obj file to be specified, providing a TopologyRefiner and a set of base vertex positions to work with std vector Pos basePositions Far TopologyRefiner refinerPtr args . inputObjFile . empty createTopologyRefinerDefault basePositions createTopologyRefinerFromObj args . inputObjFile , args . schemeType , basePositions assert refinerPtr Far TopologyRefiner refiner refinerPtr Far TopologyLevel const baseLevel refiner . GetLevel 0 Use of LimitStencilTable requires either explicit or implicit use of a PatchTable. A PatchTable is not required to construct a LimitStencilTable -- one will be constructed internally for use and discarded -- but explicit construction is recommended to control the many legacy options for PatchTable, rather than relying on internal defaults. Adaptive refinement is required in both cases to indicate the accuracy of the patches. Note that if a TopologyRefiner and PatchTable are not used for any other purpose than computing the limit points, that specifying the subset of faces containing those limit points in the adaptive refinement and PatchTable construction can avoid unnecessary overhead. Far PatchTable patchTablePtr 0 if args . noPatchesFlag refiner . RefineAdaptive Far TopologyRefiner AdaptiveOptions args . maxPatchDepth else Far PatchTableFactory Options patchOptions args . maxPatchDepth patchOptions . useInfSharpPatch true patchOptions . generateLegacySharpCornerPatches false patchOptions . generateVaryingTables false patchOptions . generateFVarTables false patchOptions . endCapType Far PatchTableFactory Options ENDCAP_GREGORY_BASIS refiner . RefineAdaptive patchOptions . GetRefineAdaptiveOptions patchTablePtr Far PatchTableFactory Create refiner , patchOptions assert patchTablePtr Assemble the set of locations for the limit points. For each base face, coordinates for the center and its corners are specified -- from which we will construct a triangle fan providing a crude tessellation similar to tutorial_5_2. std vector LocationArray locations int numLimitPoints assembleLimitPointLocations refiner , locations Construct a LimitStencilTable from the refiner, patch table optional and the collection of limit point locations. Stencils can optionally be created for computing dervatives -- the default is to compute 1st derivative stencils, so be sure to disable that if not necessary Far LimitStencilTableFactory Options limitOptions limitOptions . generate1stDerivatives args . deriv1Flag Far LimitStencilTable const limitStencilTablePtr Far LimitStencilTableFactory Create refiner , locations , 0 , optional StencilTable for the refined points patchTablePtr , optional PatchTable limitOptions assert limitStencilTablePtr Far LimitStencilTable const limitStencilTable limitStencilTablePtr Apply the constructed LimitStencilTable to compute limit positions from the base level vertex positions. This is trivial if computing all positions in one invokation. The UpdateValues method and those for derivatives are overloaded to optionally accept a subrange of indices to distribute the computation std vector Pos limitPositions numLimitPoints limitStencilTable . UpdateValues basePositions , limitPositions Call with the optional subrange limitStencilTable . UpdateValues basePositions , limitPositions , 0 , numLimitPoints 2 limitStencilTable . UpdateValues basePositions , limitPositions , numLimitPoints 2 1 , numLimitPoints Write vertices and faces in Obj format for the original limit points int objVertCount 0 if args . noOutputFlag printf g base_mesh n objVertCount writeToObj baseLevel , limitPositions , objVertCount Recompute the limit points and output faces for different poses of the original mesh -- in this case simply translated. Also optionally compute 1st derivatives though they are not used here std vector Pos posePositions basePositions std vector Pos limitDu args . deriv1Flag numLimitPoints 0 std vector Pos limitDv args . deriv1Flag numLimitPoints 0 for int i 0 i args . numPoses i Trivially transform the base vertex positions and re-compute for size_t j 0 j basePositions . size j posePositions j posePositions j args . poseOffset limitStencilTable . UpdateValues posePositions , limitPositions if args . deriv1Flag limitStencilTable . UpdateDerivs posePositions , limitDu , limitDv if args . noOutputFlag printf n g pose_d n , i objVertCount writeToObj baseLevel , limitPositions , objVertCount delete refinerPtr delete patchTablePtr delete limitStencilTablePtr return EXIT_SUCCESS Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_5_3.html\"\n }, {\n \"title\": \"bfr_tutorial_1_1.cpp\",\n \"text\": \"bfr_tutorial_1_1.cpp bfr_tutorial_1_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsbfrtutorial_1_1bfr_tutorial_1_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates the use of the SurfaceFactory, Surface and Parameterization classes for creating and evaluating the limit surface associated with each base face of a mesh. Following the creation of a connected mesh for a shape using a FarTopologyRefiner, as illustrated in Far tutorials, an instance of a SurfaceFactory is declared to process its faces. Each face of the mesh is evaluated and tessellated independently with a simple triangle fan, with results written out in Obj format for inspection. These classes make it simple to evaluate and tessellate all faces quads, tris or others while supporting the full set of subdivision options. While a triangle fan may be a trivial tessellation and so not very useful later examples using the Tessellation class provide more useful results with the same simplicity. include opensubdivfartopologyRefiner.h include opensubdivbfrrefinerSurfaceFactory.h include opensubdivbfrsurface.h include vector include string include cstring include cstdio Local headers with support for this tutorial in namespace tutorial include .meshLoader.h include .objWriter.h using namespace OpenSubdiv Simple command line arguments to provide input and run-time options class Args public std string inputObjFile std string outputObjFile Sdc SchemeType schemeType public Args int argc , char argv inputObjFile , outputObjFile , schemeType Sdc SCHEME_CATMARK for int i 1 i argc i if strstr argv i , .obj if inputObjFile . empty inputObjFile std string argv i else fprintf stderr , Warning Extra Obj file s ignored n , argv i else if strcmp argv i , -o if i argc outputObjFile std string argv i else if strcmp argv i , -bilinear schemeType Sdc SCHEME_BILINEAR else if strcmp argv i , -catmark schemeType Sdc SCHEME_CATMARK else if strcmp argv i , -loop schemeType Sdc SCHEME_LOOP else fprintf stderr , Warning Unrecognized argument s ignored n , argv i private Args The main tessellation function given a mesh and vertex positions, tessellate each face -- writing results in Obj format. void tessellateToObj Far TopologyRefiner const meshTopology , std vector float const meshVertexPositions , Args const options Use simpler local type names for the Surface and its factory typedef Bfr RefinerSurfaceFactory SurfaceFactory typedef Bfr Surface float Surface Initialize the SurfaceFactory for the given base mesh very low cost in terms of both time and space and tessellate each face independently i.e. no shared vertices Note that the SurfaceFactory is not thread-safe by default due to use of an internal cache. Creating a separate instance of the SurfaceFactory for each thread is one way to safely parallelize this loop. Another preferred is to assign a thread-safe cache to the single instance. First declare any evaluation options when initializing though none are used in this simple case SurfaceFactory Options surfaceOptions SurfaceFactory meshSurfaceFactory meshTopology , surfaceOptions The Surface to be constructed and evaluated for each face -- as well as the intermediate and output data associated with it -- can be declared in the scope local to each face. But since dynamic memory is involved with these variables, it is preferred to declare them outside that loop to preserve and reuse that dynamic memory. Surface faceSurface std vector float facePatchPoints std vector float outCoords std vector float outPos , outDu , outDv std vector int outTriangles Process each face, writing the output of each in Obj format tutorial ObjWriter objWriter options . outputObjFile int numFaces meshSurfaceFactory . GetNumFaces for int faceIndex 0 faceIndex numFaces faceIndex Initialize the Surface for this face -- if valid skipping holes and boundary faces in some rare cases if meshSurfaceFactory . InitVertexSurface faceIndex , faceSurface continue Get the Parameterization of the Surface and use it to identify coordinates for evaluation -- in this case, at the vertices and center of the face to create a fan of triangles Bfr Parameterization faceParam faceSurface . GetParameterization int faceSize faceParam . GetFaceSize int numOutCoords faceSize 1 outCoords . resize numOutCoords 2 for int i 0 i faceSize i faceParam . GetVertexCoord i , outCoords i 2 faceParam . GetCenterCoord outCoords faceSize 2 Prepare the patch points for the Surface, then use them to evaluate output points for all identified coordinates Resize patch point and output arrays int pointSize 3 facePatchPoints . resize faceSurface . GetNumPatchPoints pointSize outPos . resize numOutCoords pointSize outDu . resize numOutCoords pointSize outDv . resize numOutCoords pointSize Populate patch point and output arrays faceSurface . PreparePatchPoints meshVertexPositions . data , pointSize , facePatchPoints . data , pointSize for int i 0 , j 0 i numOutCoords i , j pointSize faceSurface . Evaluate outCoords i 2 , facePatchPoints . data , pointSize , outPos j , outDu j , outDv j Identify the faces of the tessellation, i.e. the triangle fan connecting points at the vertices to the center last point Note the need to offset vertex indices for the output faces -- using the number of vertices generated prior to this face. int objVertexIndexOffset objWriter . GetNumVertices outTriangles . resize faceSize 3 int outTriangle outTriangles . data for int i 0 i faceSize i , outTriangle 3 outTriangle 0 objVertexIndexOffset i outTriangle 1 objVertexIndexOffset i 1 faceSize outTriangle 2 objVertexIndexOffset faceSize Write the evaluated points and faces connecting them as Obj objWriter . WriteGroupName baseFace_ , faceIndex objWriter . WriteVertexPositions outPos objWriter . WriteVertexNormals outDu , outDv objWriter . WriteFaces outTriangles , 3 , true , false Load command line arguments, specified or default geometry and process int main int argc , char argv Args args argc , argv Far TopologyRefiner meshTopology 0 std vector float meshVtxPositions std vector float meshFVarUVs meshTopology tutorial createTopologyRefiner args . inputObjFile , args . schemeType , meshVtxPositions , meshFVarUVs if meshTopology 0 return EXIT_FAILURE tessellateToObj meshTopology , meshVtxPositions , args delete meshTopology return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n@@ -71,53 +71,53 @@\n \"loc\": \"far_tutorial_4_3.html\"\n }, {\n \"title\": \"far_tutorial_4_2.cpp\",\n \"text\": \"far_tutorial_4_2.cpp far_tutorial_4_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_2far_tutorial_4_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate both vertex and varying FarStencilTable to interpolate 2 primvar data buffers vertex positions and vertex colors. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _data 0 src . _data 0 _data 1 src . _data 1 _data 2 src . _data 2 void Clear void 0 _data 0 _data 1 _data 2 0.0f void AddWithWeight Vertex const src , float weight _data 0 weight src . _data 0 _data 1 weight src . _data 1 _data 2 weight src . _data 2 Public interface ------------------------------------ float const GetData const return _data private float _data 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f Per-vertex RGB color data static float g_colors 24 1.0f , 0.0f , 0.5f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 4 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel int nverts refiner - GetLevel maxlevel . GetNumVertices Use the FarStencilTable factory to create discrete stencil table Far StencilTableFactory Options options options . generateIntermediateLevels false only the highest refinement level. options . generateOffsets true Vertex primvar data Create stencils table for vertex interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VERTEX Far StencilTable const vertexStencils Far StencilTableFactory Create refiner , options assert nverts vertexStencils - GetNumStencils Allocate vertex primvar buffer 1 stencil for each vertex std vector Vertex vertexBuffer vertexStencils - GetNumStencils Use the cube vertex positions as vertex primvar data Vertex vertexCVs reinterpret_cast Vertex g_verts Varying primvar data Create stencils table for varying interpolation options . interpolationMode Far StencilTableFactory INTERPOLATE_VARYING Far StencilTable const varyingStencils Far StencilTableFactory Create refiner , options assert nverts varyingStencils - GetNumStencils Allocate varying primvar buffer 1 stencil for each vertex std vector Vertex varyingBuffer varyingStencils - GetNumStencils Use per-vertex array of RGB colors as varying primvar data Vertex varyingCVs reinterpret_cast Vertex g_colors delete refiner Apply stencils in frame loop This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. vertexStencils - UpdateValues vertexCVs , vertexBuffer 0 varyingStencils - UpdateValues varyingCVs , varyingBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int vert 0 vert int nverts vert float const pos vertexBuffer vert . GetData printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n Set particle point size 20 -- very large printf addAttr -is true -ln pointSize -at long -dv 20 particleShape1 n Add per-particle color attribute rgbPP printf addAttr -ln rgbPP -dt vectorArray particleShape1 n Set per-particle color values from our varying primvar data printf setAttr particleShape1.rgbPP -type vectorArray d , nverts for int vert 0 vert nverts vert float const color varyingBuffer vert . GetData printf f f f n , color 0 , color 1 , color 2 printf n delete vertexStencils delete varyingStencils return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_4_2.html\"\n }, {\n- \"title\": \"far_tutorial_4_1.cpp\",\n- \"text\": \"far_tutorial_4_1.cpp far_tutorial_4_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_1far_tutorial_4_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate FarStencilTable. We use the factorized stencils to interpolate vertex primvar data buffers. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z float const GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 3 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Use the FarStencilTable factory to create discrete stencil table note we only want stencils for the highest refinement level. Far StencilTableFactory Options options options . generateIntermediateLevels false options . generateOffsets true Far StencilTable const stencilTable Far StencilTableFactory Create refiner , options Allocate vertex primvar buffer 1 stencil for each vertex int nstencils stencilTable - GetNumStencils std vector Vertex vertexBuffer nstencils Quick dirty re-cast of the primvar data from our cube this is where you would drive shape deformations every frame Vertex controlValues reinterpret_cast Vertex g_verts This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. stencilTable - UpdateValues controlValues , vertexBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int i 0 i int vertexBuffer . size i float const pos vertexBuffer i . GetPosition printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n delete refiner delete stencilTable return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. return Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"far_tutorial_4_1.html\"\n- }, {\n \"title\": \"far_tutorial_2_3.cpp\",\n \"text\": \"far_tutorial_2_3.cpp far_tutorial_2_3.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_3far_tutorial_2_3.cpp ------------------------------------------------------------------------------ Tutorial description NOTE The following approaches are approximations to compute smooth normals, for highest fidelity patches should be used for positions and normals, which form the true limit surface. Building on tutorial 3, this example shows how to instantiate a simple mesh, refine it uniformly, interpolate both vertex and face-varying primvar data, and finally calculate approximated smooth normals. The resulting interpolated data is output in obj format. Currently, this tutorial supports 3 methods to approximate smooth normals CrossTriangle Calculates smooth normals accumulating per vertex using 3 verts to generate 2 vectors. This approximation has trouble when working with quads which can be non-planar since it only takes into account half of each face. CrossQuad Calculates smooth normals accumulating per vertex but this time, instead of taking into account only 3 verts it creates 2 vectors crossing the quad. This approximation builds upon CrossTriangle but takes into account the 4 verts of the face. Limit Calculates the normals at the limit for each vert at the last level of subdivision. These are the true limit normals, however, in this example they are used with verts that are not at the limit. This can lead to new visual artifacts since the normals and the positions dont match. Additionally, this approach requires extra computation to calculate the limit normals. For this reason, we strongly suggest using limit positions with limit normals. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Math helpers. Returns the normalized version of the input vector inline void normalize float n float rn 1.0f sqrtf n 0 n 0 n 1 n 1 n 2 n 2 n 0 rn n 1 rn n 2 rn Returns the cross product of p v1 and p v2. void cross float const v1 , float const v2 , float vOut vOut 0 v1 1 v2 2 - v1 2 v2 1 vOut 1 v1 2 v2 0 - v1 0 v2 2 vOut 2 v1 0 v2 1 - v1 1 v2 0 ------------------------------------------------------------------------------ Face-varying implementation. struct Vertex Minimal required interface ---------------------- Vertex Clear Vertex Vertex const src position 0 src . position 0 position 1 src . position 1 position 2 src . position 2 void Clear position 0 position 1 position 2 0.0f void AddWithWeight Vertex const src , float weight position 0 weight src . position 0 position 1 weight src . position 1 position 2 weight src . position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z position 0 x position 1 y position 2 z const float GetPosition const return position float position 3 ------------------------------------------------------------------------------ Face-varying container implementation. We are using a uv texture layout as a face-varying primtiive variable attribute. Because face-varying data is specified per-face-per-vertex, we cannot use the same container that we use for vertex or varying data. We specify a new container, which only carries u,v coordinates. Similarly to our Vertex container, we add a minimaliztic interpolation interface with a Clear and AddWithWeight methods. struct FVarVertexUV Minimal required interface ---------------------- void Clear u v 0.0f void AddWithWeight FVarVertexUV const src , float weight u weight src . u v weight src . v Basic uv layout channel float u , v struct FVarVertexColor Minimal required interface ---------------------- void Clear r g b a 0.0f void AddWithWeight FVarVertexColor const src , float weight r weight src . r g weight src . g b weight src . b a weight src . a Basic color layout channel float r , g , b , a ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h vertex primitive variable data topology static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 face-varying primitive variable data topology for UVs static float g_uvs 14 2 0.375 , 0.00 , 0.625 , 0.00 , 0.375 , 0.25 , 0.625 , 0.25 , 0.375 , 0.50 , 0.625 , 0.50 , 0.375 , 0.75 , 0.625 , 0.75 , 0.375 , 1.00 , 0.625 , 1.00 , 0.875 , 0.00 , 0.875 , 0.25 , 0.125 , 0.00 , 0.125 , 0.25 static int g_nuvs 14 static int g_uvIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 9 , 8 , 1 , 10 , 11 , 3 , 12 , 0 , 2 , 13 face-varying primitive variable data topology for color static float g_colors 24 4 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 static int g_ncolors 24 static int g_colorIndices 24 0 , 3 , 9 , 6 , 7 , 10 , 15 , 12 , 13 , 16 , 21 , 18 , 19 , 22 , 4 , 1 , 5 , 23 , 17 , 11 , 20 , 2 , 8 , 14 using namespace OpenSubdiv Approximation methods for smooth normal computations enum NormalApproximation CrossTriangle , CrossQuad , Limit ------------------------------------------------------------------------------ int main int argc , char argv const int maxlevel 2 enum NormalApproximation normalApproximation CrossTriangle Parsing command line parameters to see if the user wants to use a specific method to calculate normals for int i 1 i argc i if strstr argv i , -limit normalApproximation Limit else if strcmp argv i , -crossquad normalApproximation CrossQuad else if strcmp argv i , -crosstriangle normalApproximation CrossTriangle else printf Parameters n printf -crosstriangle use the cross product of vectors n printf generated from 3 verts default. n printf -crossquad use the cross product of vectors n printf generated from 4 verts. n printf -limit use normals calculated from the limit. n return 0 typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY options . SetFVarLinearInterpolation Sdc Options FVAR_LINEAR_NONE Populate a topology descriptor with our raw data Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Create a face-varying channel descriptor const int numChannels 2 const int channelUV 0 const int channelColor 1 Descriptor FVarChannel channels numChannels channels channelUV . numValues g_nuvs channels channelUV . valueIndices g_uvIndices channels channelColor . numValues g_ncolors channels channelColor . valueIndices g_colorIndices Add the channel topology to the main descriptor desc . numFVarChannels numChannels desc . fvarChannels channels Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topolgy up to maxlevel note fullTopologyInLastLevel must be true to work with face-varying data Far TopologyRefiner UniformOptions refineOptions maxlevel refineOptions . fullTopologyInLastLevel true refiner - RefineUniform refineOptions Allocate and initialize the vertex primvar data see tutorial 2 for more details. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 for int i 0 i g_nverts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Allocate initialize the first channel of face-varying primvars UVs std vector FVarVertexUV fvBufferUV refiner - GetNumFVarValuesTotal channelUV FVarVertexUV fvVertsUV fvBufferUV 0 for int i 0 i g_nuvs i fvVertsUV i . u g_uvs i 0 fvVertsUV i . v g_uvs i 1 Allocate interpolate the face-varying primvar data colors std vector FVarVertexColor fvBufferColor refiner - GetNumFVarValuesTotal channelColor FVarVertexColor fvVertsColor fvBufferColor 0 for int i 0 i g_ncolors i fvVertsColor i . r g_colors i 0 fvVertsColor i . g g_colors i 1 fvVertsColor i . b g_colors i 2 fvVertsColor i . a g_colors i 3 Interpolate both vertex and face-varying primvar data Far PrimvarRefiner primvarRefiner refiner Vertex srcVert verts FVarVertexUV srcFVarUV fvVertsUV FVarVertexColor srcFVarColor fvVertsColor for int level 1 level maxlevel level Vertex dstVert srcVert refiner - GetLevel level -1 . GetNumVertices FVarVertexUV dstFVarUV srcFVarUV refiner - GetLevel level -1 . GetNumFVarValues channelUV FVarVertexColor dstFVarColor srcFVarColor refiner - GetLevel level -1 . GetNumFVarValues channelColor primvarRefiner . Interpolate level , srcVert , dstVert primvarRefiner . InterpolateFaceVarying level , srcFVarUV , dstFVarUV , channelUV primvarRefiner . InterpolateFaceVarying level , srcFVarColor , dstFVarColor , channelColor srcVert dstVert srcFVarUV dstFVarUV srcFVarColor dstFVarColor Approximate normals Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nfaces refLastLevel . GetNumFaces int firstOfLastVerts refiner - GetNumVerticesTotal - nverts std vector Vertex normals nverts Different ways to approximate smooth normals For details check the description at the beginning of the file if normalApproximation Limit Approximation using the normal at the limit with verts that are not at the limit For details check the description at the beginning of the file std vector Vertex fineLimitPos nverts std vector Vertex fineDu nverts std vector Vertex fineDv nverts primvarRefiner . Limit verts firstOfLastVerts , fineLimitPos , fineDu , fineDv for int vert 0 vert nverts vert float const du fineDu vert . GetPosition float const dv fineDv vert . GetPosition float norm 3 cross du , dv , norm normals vert . SetPosition norm 0 , norm 1 , norm 2 else if normalApproximation CrossQuad Approximate smooth normals by accumulating normal vectors computed as the cross product of two vectors generated by the 4 verts that form each quad For details check the description at the beginning of the file for int f 0 f nfaces f Far ConstIndexArray faceVertices refLastLevel . GetFaceVertices f We will use the first three verts to calculate a normal const float v0 verts firstOfLastVerts faceVertices 0 . GetPosition const float v1 verts firstOfLastVerts faceVertices 1 . GetPosition const float v2 verts firstOfLastVerts faceVertices 2 . GetPosition const float v3 verts firstOfLastVerts faceVertices 3 . GetPosition Calculate the cross product between the vectors formed by v1-v0 and v2-v0, and then normalize the result float normalCalculated 0.0 , 0.0 , 0.0 float a 3 v2 0 - v0 0 , v2 1 - v0 1 , v2 2 - v0 2 float b 3 v3 0 - v1 0 , v3 1 - v1 1 , v3 2 - v1 2 cross a , b , normalCalculated normalize normalCalculated Accumulate that normal on all verts that are part of that face for int vInFace 0 vInFace faceVertices . size vInFace int vertexIndex faceVertices vInFace normals vertexIndex . position 0 normalCalculated 0 normals vertexIndex . position 1 normalCalculated 1 normals vertexIndex . position 2 normalCalculated 2 else if normalApproximation CrossTriangle Approximate smooth normals by accumulating normal vectors computed as the cross product of two vectors generated by 3 verts of the quad For details check the description at the beginning of the file for int f 0 f nfaces f Far ConstIndexArray faceVertices refLastLevel . GetFaceVertices f We will use the first three verts to calculate a normal const float v0 verts firstOfLastVerts faceVertices 0 . GetPosition const float v1 verts firstOfLastVerts faceVertices 1 . GetPosition const float v2 verts firstOfLastVerts faceVertices 2 . GetPosition Calculate the cross product between the vectors formed by v1-v0 and v2-v0, and then normalize the result float normalCalculated 0.0 , 0.0 , 0.0 float a 3 v1 0 - v0 0 , v1 1 - v0 1 , v1 2 - v0 2 float b 3 v2 0 - v0 0 , v2 1 - v0 1 , v2 2 - v0 2 cross a , b , normalCalculated normalize normalCalculated Accumulate that normal on all verts that are part of that face for int vInFace 0 vInFace faceVertices . size vInFace int vertexIndex faceVertices vInFace normals vertexIndex . position 0 normalCalculated 0 normals vertexIndex . position 1 normalCalculated 1 normals vertexIndex . position 2 normalCalculated 2 Finally we just need to normalize the accumulated normals for int vert 0 vert nverts vert normalize normals vert . position 0 Output OBJ of the highest level refined ----------- Print vertex positions for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print vertex normals for int vert 0 vert nverts vert float const pos normals vert . GetPosition printf vn f f f n , pos 0 , pos 1 , pos 2 Print uvs int nuvs refLastLevel . GetNumFVarValues channelUV int firstOfLastUvs refiner - GetNumFVarValuesTotal channelUV - nuvs for int fvvert 0 fvvert nuvs fvvert FVarVertexUV const uv fvVertsUV firstOfLastUvs fvvert printf vt f f n , uv . u , uv . v Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face Far ConstIndexArray fuvs refLastLevel . GetFaceFVarValues face , channelUV all refined Catmark faces should be quads assert fverts . size 4 fuvs . size 4 printf f for int vert 0 vert fverts . size vert OBJ uses 1-based arrays... printf ddd , fverts vert 1 , fuvs vert 1 , fverts vert 1 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_2_3.html\"\n }, {\n+ \"title\": \"far_tutorial_4_1.cpp\",\n+ \"text\": \"far_tutorial_4_1.cpp far_tutorial_4_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_4_1far_tutorial_4_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to create and manipulate FarStencilTable. We use the factorized stencils to interpolate vertex primvar data buffers. include opensubdivfartopologyDescriptor.h include opensubdivfarstencilTable.h include opensubdivfarstencilTableFactory.h include cstdio include cstring ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z float const GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 24 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createTopologyRefiner ------------------------------------------------------------------------------ int main int , char Generate a FarTopologyRefiner see tutorial_1_1 for details. Far TopologyRefiner refiner createTopologyRefiner Uniformly refine the topology up to maxlevel. int maxlevel 3 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Use the FarStencilTable factory to create discrete stencil table note we only want stencils for the highest refinement level. Far StencilTableFactory Options options options . generateIntermediateLevels false options . generateOffsets true Far StencilTable const stencilTable Far StencilTableFactory Create refiner , options Allocate vertex primvar buffer 1 stencil for each vertex int nstencils stencilTable - GetNumStencils std vector Vertex vertexBuffer nstencils Quick dirty re-cast of the primvar data from our cube this is where you would drive shape deformations every frame Vertex controlValues reinterpret_cast Vertex g_verts This section would be applied every frame after control vertices have been moved. Apply stencils on the control vertex data to update the primvar data of the refined vertices. stencilTable - UpdateValues controlValues , vertexBuffer 0 Visualization with Maya print a MEL script that generates particles at the location of the refined vertices printf particle for int i 0 i int vertexBuffer . size i float const pos vertexBuffer i . GetPosition printf -p f f f n , pos 0 , pos 1 , pos 2 printf -c 1 n delete refiner delete stencilTable return EXIT_SUCCESS ------------------------------------------------------------------------------ static Far TopologyRefiner createTopologyRefiner Populate a topology descriptor with our raw data. typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor. return Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"far_tutorial_4_1.html\"\n+ }, {\n \"title\": \"far_tutorial_3_1.cpp\",\n \"text\": \"far_tutorial_3_1.cpp far_tutorial_3_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_3_1far_tutorial_3_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to interface a high-level topology representation with Far for better efficiency. In tutorial 0, we showed how to instantiate topology from a simple face-vertex list. Here we will show how to take advantage of more complex data structures. Many client applications that manipulate geometry use advanced data structures such as half-edge, quad-edge or winged-edge in order to represent complex topological relationships beyond the usual face-vertex lists. We can take advantage of this information. Far provides an advanced interface that allows such a client application to communicate advanced component relationships directly and avoid having Far rebuilding them redundantly. include opensubdivfartopologyRefinerFactory.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ using namespace OpenSubdiv ------------------------------------------------------------------------------ For this tutorial, we provide the complete topological representation of a simple pyramid. In our case, we store it as a simple sequence of integers, with the understanding that client-code would provide a fully implemented data-structure such as quad-edges or winged-edges. Pyramid geometry from catmark_pyramid.h - extended for this tutorial static int g_nverts 5 , g_nedges 8 , g_nfaces 5 vertex positions static float g_verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f number of vertices in each face static int g_facenverts 5 3 , 3 , 3 , 3 , 4 index of face vertices static int g_faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 index of edge vertices 2 per edge static int g_edgeverts 16 0 , 1 , 1 , 2 , 2 , 0 , 2 , 3 , 3 , 0 , 3 , 4 , 4 , 0 , 4 , 1 index of face edges static int g_faceedges 16 0 , 1 , 2 , 2 , 3 , 4 , 4 , 5 , 6 , 6 , 7 , 0 , 5 , 3 , 1 , 7 number of faces adjacent to each edge static int g_edgenfaces 8 2 , 2 , 2 , 2 , 2 , 2 , 2 , 2 index of faces incident to a given edge static int g_edgefaces 16 0 , 3 , 0 , 4 , 0 , 1 , 1 , 4 , 1 , 2 , 2 , 4 , 2 , 3 , 3 , 4 number of faces incident to each vertex static int g_vertexnfaces 5 4 , 3 , 3 , 3 , 3 index of faces incident to each vertex static int g_vertexfaces 25 0 , 1 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 1 , 4 , 2 , 2 , 4 , 3 number of edges incident to each vertex static int g_vertexnedges 5 4 , 3 , 3 , 3 , 3 index of edges incident to each vertex static int g_vertexedges 25 0 , 2 , 4 , 6 , 1 , 0 , 7 , 2 , 1 , 3 , 4 , 3 , 5 , 6 , 5 , 7 Edge crease sharpness static float g_edgeCreases 8 0.0f , 2.5f , 0.0f , 2.5f , 0.0f , 2.5f , 0.0f , 2.5f ------------------------------------------------------------------------------ Because existing client-code may not provide an exact match for the topological queries required by Fars interface, we can provide a converter class. This can be particularly useful for instance if the client data-structure requires additional relationships to be mapped. For instance, half-edge representations do not store unique edge indices and it can be difficult to traverse edges or faces adjacent to a given vertex. Using an intermediate wrapper class allows us to leverage existing relationships information from a mesh, and generate the missing components temporarily. For a practical example, you can look at the file hbr_to_vtr.h in the same tutorial directory. This example implements a OsdHbrConverter class as a way of interfacing PRmans half-edge representation to Far. struct Converter public Sdc SchemeType GetType const return Sdc SCHEME_CATMARK Sdc Options GetOptions const Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY return options int GetNumFaces const return g_nfaces int GetNumEdges const return g_nedges int GetNumVertices const return g_nverts Face relationships int GetNumFaceVerts int face const return g_facenverts face int const GetFaceVerts int face const return g_faceverts getCompOffset g_facenverts , face int const GetFaceEdges int face const return g_faceedges getCompOffset g_facenverts , face Edge relationships int const GetEdgeVertices int edge const return g_edgeverts edge 2 int GetNumEdgeFaces int edge const return g_edgenfaces edge int const GetEdgeFaces int edge const return g_edgefaces getCompOffset g_edgenfaces , edge Vertex relationships int GetNumVertexEdges int vert const return g_vertexnedges vert int const GetVertexEdges int vert const return g_vertexedges getCompOffset g_vertexnedges , vert int GetNumVertexFaces int vert const return g_vertexnfaces vert int const GetVertexFaces int vert const return g_vertexfaces getCompOffset g_vertexnfaces , vert private int getCompOffset int const comps , int comp const int ofs 0 for int i 0 i comp i ofs comps i return ofs ------------------------------------------------------------------------------ namespace OpenSubdiv namespace OPENSUBDIV_VERSION namespace Far template bool TopologyRefinerFactory Converter resizeComponentTopology TopologyRefiner refiner , Converter const conv Faces and face-verts int nfaces conv . GetNumFaces setNumBaseFaces refiner , nfaces for int face 0 face nfaces face int nv conv . GetNumFaceVerts face setNumBaseFaceVertices refiner , face , nv Edges and edge-faces int nedges conv . GetNumEdges setNumBaseEdges refiner , nedges for int edge 0 edge nedges edge int nf conv . GetNumEdgeFaces edge setNumBaseEdgeFaces refiner , edge , nf Vertices and vert-faces and vert-edges int nverts conv . GetNumVertices setNumBaseVertices refiner , nverts for int vert 0 vert nverts vert int ne conv . GetNumVertexEdges vert , nf conv . GetNumVertexFaces vert setNumBaseVertexEdges refiner , vert , ne setNumBaseVertexFaces refiner , vert , nf return true template bool TopologyRefinerFactory Converter assignComponentTopology TopologyRefiner refiner , Converter const conv using Far IndexArray Face relations int nfaces conv . GetNumFaces for int face 0 face nfaces face IndexArray dstFaceVerts getBaseFaceVertices refiner , face IndexArray dstFaceEdges getBaseFaceEdges refiner , face int const faceverts conv . GetFaceVerts face int const faceedges conv . GetFaceEdges face for int vert 0 vert conv . GetNumFaceVerts face vert dstFaceVerts vert faceverts vert dstFaceEdges vert faceedges vert Edge relations Note if your representation is unable to provide edge relationships ex half-edges, you can comment out this section and Far will automatically generate the missing information. int nedges conv . GetNumEdges for int edge 0 edge nedges edge Edge-vertices IndexArray dstEdgeVerts getBaseEdgeVertices refiner , edge dstEdgeVerts 0 conv . GetEdgeVertices edge 0 dstEdgeVerts 1 conv . GetEdgeVertices edge 1 Edge-faces IndexArray dstEdgeFaces getBaseEdgeFaces refiner , edge for int face 0 face conv . GetNumEdgeFaces face face dstEdgeFaces face conv . GetEdgeFaces edge face Vertex relations int nverts conv . GetNumVertices for int vert 0 vert nverts vert Vert-Faces IndexArray vertFaces getBaseVertexFaces refiner , vert LocalIndexArray vertInFaceIndices getBaseVertexFaceLocalIndicesrefiner, vert for int face 0 face conv . GetNumVertexFaces vert face vertFaces face conv . GetVertexFaces vert face Vert-Edges IndexArray vertEdges getBaseVertexEdges refiner , vert LocalIndexArray vertInEdgeIndices getBaseVertexEdgeLocalIndicesrefiner, vert for int edge 0 edge conv . GetNumVertexEdges vert edge vertEdges edge conv . GetVertexEdges vert edge populateBaseLocalIndices refiner return true template bool TopologyRefinerFactory Converter assignComponentTags TopologyRefiner refiner , Converter const conv arbitrarily sharpen the 4 bottom edges of the pyramid to 2.5f for int edge 0 edge conv . GetNumEdges edge setBaseEdgeSharpness refiner , edge , g_edgeCreases edge return true ifdef _MSC_VER template void TopologyRefinerFactory Converter reportInvalidTopology TopologyError errCode , char const msg , Converter const mesh Optional topology validation error reporting This method is called whenever the factory encounters topology validation errors. By default, nothing is reported Warning msg template bool TopologyRefinerFactory Converter assignFaceVaryingTopology TopologyRefiner refiner , Converter const conv Because of the way MSVC specializes templated functions, we had to remove the default stubs in FarTopologyRefinerFactory. In this example, no face-varying data is being added, but we still need to implement a template specialization or MSVC linker fails. return true endif namespace Far namespace OPENSUBDIV_VERSION namespace OpenSubdiv ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ int main int , char Converter conv Far TopologyRefiner refiner Far TopologyRefinerFactory Converter Create conv , Far TopologyRefinerFactory Converter Options conv . GetType , conv . GetOptions int maxlevel 5 Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate a buffer for vertex primvar data. The buffer length is set to be the sum of all children vertices up to the highest level of refinement. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 Initialize coarse mesh positions int nCoarseVerts g_nverts for int i 0 i nCoarseVerts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Vertex src verts for int level 1 level maxlevel level Vertex dst src refiner - GetLevel level -1 . GetNumVertices primvarRefiner . Interpolate level , src , dst src dst Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face all refined Catmark faces should be quads assert fverts . size 4 printf f for int vert 0 vert fverts . size vert printf d , fverts vert 1 OBJ uses 1-based arrays... printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_3_1.html\"\n }, {\n- \"title\": \"far_tutorial_2_1.cpp\",\n- \"text\": \"far_tutorial_2_1.cpp far_tutorial_2_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_1far_tutorial_2_1.cpp ------------------------------------------------------------------------------ Tutorial description Building on tutorial 0, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate additional sets of primvar data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. We are adding a per-vertex color attribute to our primvar data. While they are separate properties and exist in separate buffers as when read from an Alembic file they are both of the form float3 and so we can use the same underlying type. While color and position may be the same, well make the color a varying primvar, e.g. it is constrained to being linearly interpolated between vertices, rather than smoothly like position and other vertex data. struct Point3 Minimal required interface ---------------------- Point3 void Clear void 0 _point 0 _point 1 _point 2 0.0f void AddWithWeight Point3 const src , float weight _point 0 weight src . _point 0 _point 1 weight src . _point 1 _point 2 weight src . _point 2 Public interface ------------------------------------ void SetPoint float x , float y , float z _point 0 x _point 1 y _point 2 z const float GetPoint const return _point private float _point 3 typedef Point3 VertexPosition typedef Point3 VertexColor ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f Per-vertex RGB color data static float g_colors 8 3 1.0f , 0.0f , 0.5f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createFarTopologyRefiner ------------------------------------------------------------------------------ int main int , char int maxlevel 5 Far TopologyRefiner refiner createFarTopologyRefiner Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate buffers for vertex primvar data. We assume we received the coarse data for the mesh in separate buffers from some other source, e.g. an Alembic file. Meanwhile, we want buffers for the lastfinest subdivision level to persist. We have no interest in the intermediate levels. Determine the sizes for our needs int nCoarseVerts g_nverts int nFineVerts refiner - GetLevel maxlevel . GetNumVertices int nTotalVerts refiner - GetNumVerticesTotal int nTempVerts nTotalVerts - nCoarseVerts - nFineVerts Allocate and initialize the primvar data for the original coarse vertices std vector VertexPosition coarsePosBuffer nCoarseVerts std vector VertexColor coarseClrBuffer nCoarseVerts for int i 0 i nCoarseVerts i coarsePosBuffer i . SetPoint g_verts i 0 , g_verts i 1 , g_verts i 2 coarseClrBuffer i . SetPoint g_colors i 0 , g_colors i 1 , g_colors i 2 Allocate intermediate and final storage to be populated std vector VertexPosition tempPosBuffer nTempVerts std vector VertexPosition finePosBuffer nFineVerts std vector VertexColor tempClrBuffer nTempVerts std vector VertexColor fineClrBuffer nFineVerts Interpolate all primvar data -- separate buffers can be populated on separate threads if desired VertexPosition srcPos coarsePosBuffer 0 VertexPosition dstPos tempPosBuffer 0 VertexColor srcClr coarseClrBuffer 0 VertexColor dstClr tempClrBuffer 0 Far PrimvarRefiner primvarRefiner refiner for int level 1 level maxlevel level primvarRefiner . Interpolate level , srcPos , dstPos primvarRefiner . InterpolateVarying level , srcClr , dstClr srcPos dstPos , dstPos refiner - GetLevel level . GetNumVertices srcClr dstClr , dstClr refiner - GetLevel level . GetNumVertices Interpolate the last level into the separate buffers for our final data primvarRefiner . Interpolate maxlevel , srcPos , finePosBuffer primvarRefiner . InterpolateVarying maxlevel , srcClr , fineClrBuffer Visualization with Maya print a MEL script that generates colored particles at the location of the refined vertices dont forget to turn shading on in the viewport to see the colors int nverts nFineVerts Output particle positions printf particle for int vert 0 vert nverts vert float const pos finePosBuffer vert . GetPoint printf -p f f f n , pos 0 , pos 1 , pos 2 printf n Set particle point size 20 -- very large printf addAttr -is true -ln pointSize -at long -dv 20 particleShape1 n Add per-particle color attribute rgbPP printf addAttr -ln rgbPP -dt vectorArray particleShape1 n Set per-particle color values from our primvar data printf setAttr particleShape1.rgbPP -type vectorArray d , nverts for int vert 0 vert nverts vert float const color fineClrBuffer vert . GetPoint printf f f f n , color 0 , color 1 , color 2 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Creates FarTopologyRefiner from raw geometry see tutorial_1_1 for more details static Far TopologyRefiner createFarTopologyRefiner Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"far_tutorial_2_1.html\"\n- }, {\n \"title\": \"far_tutorial_2_2.cpp\",\n \"text\": \"far_tutorial_2_2.cpp far_tutorial_2_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_2far_tutorial_2_2.cpp ------------------------------------------------------------------------------ Tutorial description Building on tutorial 0, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and face-varying primvar data. The resulting interpolated data is output as an obj file, with the face-varying data recorded in the uv texture layout. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Face-varying implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Face-varying container implementation. We are using a uv texture layout as a face-varying primitive variable attribute. Because face-varying data is specified per-face-per-vertex, we cannot use the same container that we use for vertex or varying data. We specify a new container, which only carries u,v coordinates. Similarly to our Vertex container, we add a minimalistic interpolation interface with a Clear and AddWithWeight methods. struct FVarVertexUV Minimal required interface ---------------------- void Clear u v 0.0f void AddWithWeight FVarVertexUV const src , float weight u weight src . u v weight src . v Basic uv layout channel float u , v struct FVarVertexColor Minimal required interface ---------------------- void Clear r g b a 0.0f void AddWithWeight FVarVertexColor const src , float weight r weight src . r g weight src . g b weight src . b a weight src . a Basic color layout channel float r , g , b , a ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h vertex primitive variable data topology static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 face-varying primitive variable data topology for UVs static float g_uvs 14 2 0.375 , 0.00 , 0.625 , 0.00 , 0.375 , 0.25 , 0.625 , 0.25 , 0.375 , 0.50 , 0.625 , 0.50 , 0.375 , 0.75 , 0.625 , 0.75 , 0.375 , 1.00 , 0.625 , 1.00 , 0.875 , 0.00 , 0.875 , 0.25 , 0.125 , 0.00 , 0.125 , 0.25 static int g_nuvs 14 static int g_uvIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 9 , 8 , 1 , 10 , 11 , 3 , 12 , 0 , 2 , 13 face-varying primitive variable data topology for color static float g_colors 24 4 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 , 1.0 static int g_ncolors 24 static int g_colorIndices 24 0 , 3 , 9 , 6 , 7 , 10 , 15 , 12 , 13 , 16 , 21 , 18 , 19 , 22 , 4 , 1 , 5 , 23 , 17 , 11 , 20 , 2 , 8 , 14 using namespace OpenSubdiv ------------------------------------------------------------------------------ int main int , char int maxlevel 3 typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY options . SetFVarLinearInterpolation Sdc Options FVAR_LINEAR_NONE Populate a topology descriptor with our raw data Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices int channelUV 0 int channelColor 1 Create a face-varying channel descriptor Descriptor FVarChannel channels 2 channels channelUV . numValues g_nuvs channels channelUV . valueIndices g_uvIndices channels channelColor . numValues g_ncolors channels channelColor . valueIndices g_colorIndices Add the channel topology to the main descriptor desc . numFVarChannels 2 desc . fvarChannels channels Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options Uniformly refine the topology up to maxlevel note fullTopologyInLastLevel must be true to work with face-varying data Far TopologyRefiner UniformOptions refineOptions maxlevel refineOptions . fullTopologyInLastLevel true refiner - RefineUniform refineOptions Allocate and initialize the vertex primvar data see tutorial 2 for more details. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 for int i 0 i g_nverts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Allocate and initialize the first channel of face-varying primvar data UVs std vector FVarVertexUV fvBufferUV refiner - GetNumFVarValuesTotal channelUV FVarVertexUV fvVertsUV fvBufferUV 0 for int i 0 i g_nuvs i fvVertsUV i . u g_uvs i 0 fvVertsUV i . v g_uvs i 1 Allocate interpolate the face-varying primvar data colors std vector FVarVertexColor fvBufferColor refiner - GetNumFVarValuesTotal channelColor FVarVertexColor fvVertsColor fvBufferColor 0 for int i 0 i g_ncolors i fvVertsColor i . r g_colors i 0 fvVertsColor i . g g_colors i 1 fvVertsColor i . b g_colors i 2 fvVertsColor i . a g_colors i 3 Interpolate both vertex and face-varying primvar data Far PrimvarRefiner primvarRefiner refiner Vertex srcVert verts FVarVertexUV srcFVarUV fvVertsUV FVarVertexColor srcFVarColor fvVertsColor for int level 1 level maxlevel level Vertex dstVert srcVert refiner - GetLevel level -1 . GetNumVertices FVarVertexUV dstFVarUV srcFVarUV refiner - GetLevel level -1 . GetNumFVarValues channelUV FVarVertexColor dstFVarColor srcFVarColor refiner - GetLevel level -1 . GetNumFVarValues channelColor primvarRefiner . Interpolate level , srcVert , dstVert primvarRefiner . InterpolateFaceVarying level , srcFVarUV , dstFVarUV , channelUV primvarRefiner . InterpolateFaceVarying level , srcFVarColor , dstFVarColor , channelColor srcVert dstVert srcFVarUV dstFVarUV srcFVarColor dstFVarColor Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nuvs refLastLevel . GetNumFVarValues channelUV int ncolors refLastLevel . GetNumFVarValues channelColor int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print uvs int firstOfLastUvs refiner - GetNumFVarValuesTotal channelUV - nuvs for int fvvert 0 fvvert nuvs fvvert FVarVertexUV const uv fvVertsUV firstOfLastUvs fvvert printf vt f f n , uv . u , uv . v Print colors int firstOfLastColors refiner - GetNumFVarValuesTotal channelColor - ncolors for int fvvert 0 fvvert ncolors fvvert FVarVertexColor const c fvVertsColor firstOfLastColors fvvert printf c f f f f n , c . r , c . g , c . b , c . a Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face Far ConstIndexArray fuvs refLastLevel . GetFaceFVarValues face , channelUV all refined Catmark faces should be quads assert fverts . size 4 fuvs . size 4 printf f for int vert 0 vert fverts . size vert OBJ uses 1-based arrays... printf dd , fverts vert 1 , fuvs vert 1 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_2_2.html\"\n }, {\n- \"title\": \"hbr_tutorial_2.cpp\",\n- \"text\": \"hbr_tutorial_2.cpp hbr_tutorial_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_2hbr_tutorial_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cassert include cstdio ------------------------------------------------------------------------------ For this tutorial, we have to flesh out the Vertex class further. Note that now the copy constructor, Clear and AddwithWeight methods have been implemented to interpolate our float3 position data. This vertex specialization pattern leaves client-code free to implement arbitrary vertex primvar data schemes or none at all to conserve efficiency struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge Hmesh createMesh ------------------------------------------------------------------------------ int main int , char Hmesh hmesh createMesh int maxlevel 2 , 2 levels of subdivision firstface 0 , marker to the first face index of level 2 firstvertex 0 marker to the first vertex index of level 2 Refine the mesh to maxlevel for int level 0 level maxlevel level Total number of faces in the mesh, across all levels Note this function iterates over the list of faces and can be slow int nfaces hmesh - GetNumFaces if level maxlevel -1 Save our vertex marker firstvertex hmesh - GetNumVertices Iterate over the faces of the current level of subdivision for int face firstface face nfaces face Hface f hmesh - GetFace face Note hole tags would have to be dealt with here. f - Refine Save our face index marker for the next level firstface nfaces Output OBJ of the highest level refined ----------- Print vertex positions int nverts hmesh - GetNumVertices for int vert firstvertex vert nverts vert float const pos hmesh - GetVertex vert - GetData . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face firstface face hmesh - GetNumFaces face Hface f hmesh - GetFace face assert f - GetNumVertices 4 printf f for int vert 0 vert 4 vert OBJ uses 1-based arrays printf d , f - GetVertex vert - GetID - firstvertex 1 printf n ------------------------------------------------------------------------------ Creates an Hbr mesh see hbr_tutorial_0 and hbr_tutorial_1 for more details Hmesh createMesh Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish return hmesh ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"far_tutorial_2_1.cpp\",\n+ \"text\": \"far_tutorial_2_1.cpp far_tutorial_2_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_2_1far_tutorial_2_1.cpp ------------------------------------------------------------------------------ Tutorial description Building on tutorial 0, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate additional sets of primvar data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. We are adding a per-vertex color attribute to our primvar data. While they are separate properties and exist in separate buffers as when read from an Alembic file they are both of the form float3 and so we can use the same underlying type. While color and position may be the same, well make the color a varying primvar, e.g. it is constrained to being linearly interpolated between vertices, rather than smoothly like position and other vertex data. struct Point3 Minimal required interface ---------------------- Point3 void Clear void 0 _point 0 _point 1 _point 2 0.0f void AddWithWeight Point3 const src , float weight _point 0 weight src . _point 0 _point 1 weight src . _point 1 _point 2 weight src . _point 2 Public interface ------------------------------------ void SetPoint float x , float y , float z _point 0 x _point 1 y _point 2 z const float GetPoint const return _point private float _point 3 typedef Point3 VertexPosition typedef Point3 VertexColor ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f Per-vertex RGB color data static float g_colors 8 3 1.0f , 0.0f , 0.5f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 0.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 0.0f , 0.0f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv static Far TopologyRefiner createFarTopologyRefiner ------------------------------------------------------------------------------ int main int , char int maxlevel 5 Far TopologyRefiner refiner createFarTopologyRefiner Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate buffers for vertex primvar data. We assume we received the coarse data for the mesh in separate buffers from some other source, e.g. an Alembic file. Meanwhile, we want buffers for the lastfinest subdivision level to persist. We have no interest in the intermediate levels. Determine the sizes for our needs int nCoarseVerts g_nverts int nFineVerts refiner - GetLevel maxlevel . GetNumVertices int nTotalVerts refiner - GetNumVerticesTotal int nTempVerts nTotalVerts - nCoarseVerts - nFineVerts Allocate and initialize the primvar data for the original coarse vertices std vector VertexPosition coarsePosBuffer nCoarseVerts std vector VertexColor coarseClrBuffer nCoarseVerts for int i 0 i nCoarseVerts i coarsePosBuffer i . SetPoint g_verts i 0 , g_verts i 1 , g_verts i 2 coarseClrBuffer i . SetPoint g_colors i 0 , g_colors i 1 , g_colors i 2 Allocate intermediate and final storage to be populated std vector VertexPosition tempPosBuffer nTempVerts std vector VertexPosition finePosBuffer nFineVerts std vector VertexColor tempClrBuffer nTempVerts std vector VertexColor fineClrBuffer nFineVerts Interpolate all primvar data -- separate buffers can be populated on separate threads if desired VertexPosition srcPos coarsePosBuffer 0 VertexPosition dstPos tempPosBuffer 0 VertexColor srcClr coarseClrBuffer 0 VertexColor dstClr tempClrBuffer 0 Far PrimvarRefiner primvarRefiner refiner for int level 1 level maxlevel level primvarRefiner . Interpolate level , srcPos , dstPos primvarRefiner . InterpolateVarying level , srcClr , dstClr srcPos dstPos , dstPos refiner - GetLevel level . GetNumVertices srcClr dstClr , dstClr refiner - GetLevel level . GetNumVertices Interpolate the last level into the separate buffers for our final data primvarRefiner . Interpolate maxlevel , srcPos , finePosBuffer primvarRefiner . InterpolateVarying maxlevel , srcClr , fineClrBuffer Visualization with Maya print a MEL script that generates colored particles at the location of the refined vertices dont forget to turn shading on in the viewport to see the colors int nverts nFineVerts Output particle positions printf particle for int vert 0 vert nverts vert float const pos finePosBuffer vert . GetPoint printf -p f f f n , pos 0 , pos 1 , pos 2 printf n Set particle point size 20 -- very large printf addAttr -is true -ln pointSize -at long -dv 20 particleShape1 n Add per-particle color attribute rgbPP printf addAttr -ln rgbPP -dt vectorArray particleShape1 n Set per-particle color values from our primvar data printf setAttr particleShape1.rgbPP -type vectorArray d , nverts for int vert 0 vert nverts vert float const color fineClrBuffer vert . GetPoint printf f f f n , color 0 , color 1 , color 2 printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Creates FarTopologyRefiner from raw geometry see tutorial_1_1 for more details static Far TopologyRefiner createFarTopologyRefiner Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"hbr_tutorial_2.html\"\n+ \"loc\": \"far_tutorial_2_1.html\"\n+ }, {\n+ \"title\": \"far_tutorial_1_2.cpp\",\n+ \"text\": \"far_tutorial_1_2.cpp far_tutorial_1_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_1_2far_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates two different styles of defining classes for interpolating primvar data with the template methods in Far. The most common usage involves data of a fixed size, so the focus here is on an alternative supporting variable length data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio using namespace OpenSubdiv Vertex data containers for interpolation - Coord3 is fixed to support 3 floats - Coord2 is fixed to support 2 floats - CoordBuffer can support a specified number of floats struct Coord3 Coord3 Coord3 float x , float y , float z _xyz 0 x , _xyz 1 y , _xyz 2 z void Clear _xyz 0 _xyz 1 _xyz 2 0.0f void AddWithWeight Coord3 const src , float weight _xyz 0 weight src . _xyz 0 _xyz 1 weight src . _xyz 1 _xyz 2 weight src . _xyz 2 float const Coords const return _xyz 0 private float _xyz 3 struct Coord2 Coord2 Coord2 float u , float v _uv 0 u , _uv 1 v void Clear _uv 0 _uv 1 0.0f void AddWithWeight Coord2 const src , float weight _uv 0 weight src . _uv 0 _uv 1 weight src . _uv 1 float const Coords const return _uv 0 private float _uv 2 struct CoordBuffer The head of an external buffer and stride is specified on construction CoordBuffer float data , int size _data data , _size size CoordBuffer _data 0 , _size 0 void Clear for int i 0 i _size i _data i 0.0f void AddWithWeight CoordBuffer const src , float weight assert src . _size _size for int i 0 i _size i _data i weight src . _data i float const Coords const return _data Defining to return a location elsewhere in the buffer is the key requirement to supporting interpolatible data of varying size CoordBuffer operator int index const return CoordBuffer _data index _size , _size private float _data int _size Global cube geometry from catmark_cube.h Topology static int g_nverts 8 static int g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 Primvar data static float g_verts 8 3 0.0f , 0.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 0.0f , 0.0f , 0.0f , 0.0f , 1.0f , 0.0f , 0.0f Creates FarTopologyRefiner from raw geometry above see tutorial_1_1 for more details static Far TopologyRefiner createFarTopologyRefiner typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner Overview of main - create a FarTopologyRefiner and uniformly refine it - allocate separate and combined data buffers for vertex positions and UVs - populate all refined data buffers and compare results - write the result in Obj format Disable warnings for exact floating point comparisons ifdef __INTEL_COMPILER pragma warning disable 1572 endif int main int , char Instantiate a FarTopologyRefiner from the global geometry Far TopologyRefiner refiner createFarTopologyRefiner Uniformly refine the topology up to maxlevel int maxlevel 2 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate and populate data buffers for vertex primvar data -- positions and UVs. We assign UV coordiantes by simply projectingassigning XY values. The position and UV buffers use their associated data types, while the combined buffer uses 5 floats per vertex. int numBaseVertices g_nverts int numTotalVertices refiner - GetNumVerticesTotal std vector Coord3 posData numTotalVertices std vector Coord2 uvData numTotalVertices int combinedStride 3 2 std vector float combinedData numTotalVertices combinedStride for int i 0 i numBaseVertices i posData i Coord3 g_verts i 0 , g_verts i 1 , g_verts i 2 uvData i Coord2 g_verts i 0 , g_verts i 1 float coordCombined combinedData i combinedStride coordCombined 0 g_verts i 0 coordCombined 1 g_verts i 1 coordCombined 2 g_verts i 2 coordCombined 3 g_verts i 0 coordCombined 4 g_verts i 1 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Coord3 posSrc posData 0 Coord2 uvSrc uvData 0 CoordBuffer combinedSrc combinedData 0 , combinedStride for int level 1 level maxlevel level int numLevelVerts refiner - GetLevel level -1 . GetNumVertices Coord3 posDst posSrc numLevelVerts Coord2 uvDst uvSrc numLevelVerts CoordBuffer combinedDst combinedSrc numLevelVerts primvarRefiner . Interpolate level , posSrc , posDst primvarRefiner . Interpolate level , uvSrc , uvDst primvarRefiner . Interpolate level , combinedSrc , combinedDst posSrc posDst uvSrc uvDst combinedSrc combinedDst Verify that the combined coords match the separate results for int i numBaseVertices i numTotalVertices i float const posCoords posData i . Coords float const uvCoords uvData i . Coords float const combCoords combinedData combinedStride i assert combCoords 0 posCoords 0 assert combCoords 1 posCoords 1 assert combCoords 2 posCoords 2 assert combCoords 3 uvCoords 0 assert combCoords 4 uvCoords 1 Output OBJ of the highest level refined Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int firstOfLastVerts numTotalVertices - refLastLevel . GetNumVertices Print vertex positions printf Vertices n for int vert firstOfLastVerts vert numTotalVertices vert float const pos combinedData vert combinedStride printf v f f f n , pos 0 , pos 1 , pos 2 printf UV coordinates n for int vert firstOfLastVerts vert numTotalVertices vert float const uv combinedData vert combinedStride 3 printf vt f f n , uv 0 , uv 1 Print faces int numFaces refLastLevel . GetNumFaces printf Faces n for int face 0 face numFaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face printf f for int fvert 0 fvert fverts . size fvert int objIndex 1 fverts fvert OBJ uses 1-based arrays... printf dd , objIndex , objIndex printf n delete refiner return EXIT_SUCCESS Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"far_tutorial_1_2.html\"\n }, {\n \"title\": \"far_tutorial_1_1.cpp\",\n \"text\": \"far_tutorial_1_1.cpp far_tutorial_1_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_1_1far_tutorial_1_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial presents in a very succinct way the requisite steps to instantiate and refine a mesh with Far from simple topological data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio ------------------------------------------------------------------------------ Vertex container implementation. struct Vertex Minimal required interface ---------------------- Vertex Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 ------------------------------------------------------------------------------ Cube geometry from catmark_cube.h static float g_verts 8 3 -0.5f , -0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , 0.5f , 0.5f , 0.5f , -0.5f , 0.5f , -0.5f , 0.5f , 0.5f , -0.5f , -0.5f , -0.5f , -0.5f , 0.5f , -0.5f , -0.5f static int g_nverts 8 , g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 using namespace OpenSubdiv ------------------------------------------------------------------------------ int main int , char Populate a topology descriptor with our raw data typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options int maxlevel 2 Uniformly refine the topology up to maxlevel refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate a buffer for vertex primvar data. The buffer length is set to be the sum of all children vertices up to the highest level of refinement. std vector Vertex vbuffer refiner - GetNumVerticesTotal Vertex verts vbuffer 0 Initialize coarse mesh positions int nCoarseVerts g_nverts for int i 0 i nCoarseVerts i verts i . SetPosition g_verts i 0 , g_verts i 1 , g_verts i 2 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Vertex src verts for int level 1 level maxlevel level Vertex dst src refiner - GetLevel level -1 . GetNumVertices primvarRefiner . Interpolate level , src , dst src dst Output OBJ of the highest level refined ----------- Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int nverts refLastLevel . GetNumVertices int nfaces refLastLevel . GetNumFaces Print vertex positions int firstOfLastVerts refiner - GetNumVerticesTotal - nverts for int vert 0 vert nverts vert float const pos verts firstOfLastVerts vert . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face 0 face nfaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face all refined Catmark faces should be quads assert fverts . size 4 printf f for int vert 0 vert fverts . size vert printf d , fverts vert 1 OBJ uses 1-based arrays... printf n delete refiner return EXIT_SUCCESS ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"far_tutorial_1_1.html\"\n }, {\n- \"title\": \"far_tutorial_1_2.cpp\",\n- \"text\": \"far_tutorial_1_2.cpp far_tutorial_1_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialsfartutorial_1_2far_tutorial_1_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial illustrates two different styles of defining classes for interpolating primvar data with the template methods in Far. The most common usage involves data of a fixed size, so the focus here is on an alternative supporting variable length data. include opensubdivfartopologyDescriptor.h include opensubdivfarprimvarRefiner.h include cstdio using namespace OpenSubdiv Vertex data containers for interpolation - Coord3 is fixed to support 3 floats - Coord2 is fixed to support 2 floats - CoordBuffer can support a specified number of floats struct Coord3 Coord3 Coord3 float x , float y , float z _xyz 0 x , _xyz 1 y , _xyz 2 z void Clear _xyz 0 _xyz 1 _xyz 2 0.0f void AddWithWeight Coord3 const src , float weight _xyz 0 weight src . _xyz 0 _xyz 1 weight src . _xyz 1 _xyz 2 weight src . _xyz 2 float const Coords const return _xyz 0 private float _xyz 3 struct Coord2 Coord2 Coord2 float u , float v _uv 0 u , _uv 1 v void Clear _uv 0 _uv 1 0.0f void AddWithWeight Coord2 const src , float weight _uv 0 weight src . _uv 0 _uv 1 weight src . _uv 1 float const Coords const return _uv 0 private float _uv 2 struct CoordBuffer The head of an external buffer and stride is specified on construction CoordBuffer float data , int size _data data , _size size CoordBuffer _data 0 , _size 0 void Clear for int i 0 i _size i _data i 0.0f void AddWithWeight CoordBuffer const src , float weight assert src . _size _size for int i 0 i _size i _data i weight src . _data i float const Coords const return _data Defining to return a location elsewhere in the buffer is the key requirement to supporting interpolatible data of varying size CoordBuffer operator int index const return CoordBuffer _data index _size , _size private float _data int _size Global cube geometry from catmark_cube.h Topology static int g_nverts 8 static int g_nfaces 6 static int g_vertsperface 6 4 , 4 , 4 , 4 , 4 , 4 static int g_vertIndices 24 0 , 1 , 3 , 2 , 2 , 3 , 5 , 4 , 4 , 5 , 7 , 6 , 6 , 7 , 1 , 0 , 1 , 7 , 5 , 3 , 6 , 0 , 2 , 4 Primvar data static float g_verts 8 3 0.0f , 0.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 1.0f , 1.0f , 1.0f , 0.0f , 1.0f , 0.0f , 1.0f , 1.0f , 0.0f , 0.0f , 0.0f , 0.0f , 1.0f , 0.0f , 0.0f Creates FarTopologyRefiner from raw geometry above see tutorial_1_1 for more details static Far TopologyRefiner createFarTopologyRefiner typedef Far TopologyDescriptor Descriptor Sdc SchemeType type OpenSubdiv Sdc SCHEME_CATMARK Sdc Options options options . SetVtxBoundaryInterpolation Sdc Options VTX_BOUNDARY_EDGE_ONLY Descriptor desc desc . numVertices g_nverts desc . numFaces g_nfaces desc . numVertsPerFace g_vertsperface desc . vertIndicesPerFace g_vertIndices Instantiate a FarTopologyRefiner from the descriptor Far TopologyRefiner refiner Far TopologyRefinerFactory Descriptor Create desc , Far TopologyRefinerFactory Descriptor Options type , options return refiner Overview of main - create a FarTopologyRefiner and uniformly refine it - allocate separate and combined data buffers for vertex positions and UVs - populate all refined data buffers and compare results - write the result in Obj format Disable warnings for exact floating point comparisons ifdef __INTEL_COMPILER pragma warning disable 1572 endif int main int , char Instantiate a FarTopologyRefiner from the global geometry Far TopologyRefiner refiner createFarTopologyRefiner Uniformly refine the topology up to maxlevel int maxlevel 2 refiner - RefineUniform Far TopologyRefiner UniformOptions maxlevel Allocate and populate data buffers for vertex primvar data -- positions and UVs. We assign UV coordiantes by simply projectingassigning XY values. The position and UV buffers use their associated data types, while the combined buffer uses 5 floats per vertex. int numBaseVertices g_nverts int numTotalVertices refiner - GetNumVerticesTotal std vector Coord3 posData numTotalVertices std vector Coord2 uvData numTotalVertices int combinedStride 3 2 std vector float combinedData numTotalVertices combinedStride for int i 0 i numBaseVertices i posData i Coord3 g_verts i 0 , g_verts i 1 , g_verts i 2 uvData i Coord2 g_verts i 0 , g_verts i 1 float coordCombined combinedData i combinedStride coordCombined 0 g_verts i 0 coordCombined 1 g_verts i 1 coordCombined 2 g_verts i 2 coordCombined 3 g_verts i 0 coordCombined 4 g_verts i 1 Interpolate vertex primvar data Far PrimvarRefiner primvarRefiner refiner Coord3 posSrc posData 0 Coord2 uvSrc uvData 0 CoordBuffer combinedSrc combinedData 0 , combinedStride for int level 1 level maxlevel level int numLevelVerts refiner - GetLevel level -1 . GetNumVertices Coord3 posDst posSrc numLevelVerts Coord2 uvDst uvSrc numLevelVerts CoordBuffer combinedDst combinedSrc numLevelVerts primvarRefiner . Interpolate level , posSrc , posDst primvarRefiner . Interpolate level , uvSrc , uvDst primvarRefiner . Interpolate level , combinedSrc , combinedDst posSrc posDst uvSrc uvDst combinedSrc combinedDst Verify that the combined coords match the separate results for int i numBaseVertices i numTotalVertices i float const posCoords posData i . Coords float const uvCoords uvData i . Coords float const combCoords combinedData combinedStride i assert combCoords 0 posCoords 0 assert combCoords 1 posCoords 1 assert combCoords 2 posCoords 2 assert combCoords 3 uvCoords 0 assert combCoords 4 uvCoords 1 Output OBJ of the highest level refined Far TopologyLevel const refLastLevel refiner - GetLevel maxlevel int firstOfLastVerts numTotalVertices - refLastLevel . GetNumVertices Print vertex positions printf Vertices n for int vert firstOfLastVerts vert numTotalVertices vert float const pos combinedData vert combinedStride printf v f f f n , pos 0 , pos 1 , pos 2 printf UV coordinates n for int vert firstOfLastVerts vert numTotalVertices vert float const uv combinedData vert combinedStride 3 printf vt f f n , uv 0 , uv 1 Print faces int numFaces refLastLevel . GetNumFaces printf Faces n for int face 0 face numFaces face Far ConstIndexArray fverts refLastLevel . GetFaceVertices face printf f for int fvert 0 fvert fverts . size fvert int objIndex 1 fverts fvert OBJ uses 1-based arrays... printf dd , objIndex , objIndex printf n delete refiner return EXIT_SUCCESS Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"hbr_tutorial_2.cpp\",\n+ \"text\": \"hbr_tutorial_2.cpp hbr_tutorial_2.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_2hbr_tutorial_2.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cassert include cstdio ------------------------------------------------------------------------------ For this tutorial, we have to flesh out the Vertex class further. Note that now the copy constructor, Clear and AddwithWeight methods have been implemented to interpolate our float3 position data. This vertex specialization pattern leaves client-code free to implement arbitrary vertex primvar data schemes or none at all to conserve efficiency struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 _position 0 _position 1 _position 2 0.0f void AddWithWeight Vertex const src , float weight _position 0 weight src . _position 0 _position 1 weight src . _position 1 _position 2 weight src . _position 2 void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge Hmesh createMesh ------------------------------------------------------------------------------ int main int , char Hmesh hmesh createMesh int maxlevel 2 , 2 levels of subdivision firstface 0 , marker to the first face index of level 2 firstvertex 0 marker to the first vertex index of level 2 Refine the mesh to maxlevel for int level 0 level maxlevel level Total number of faces in the mesh, across all levels Note this function iterates over the list of faces and can be slow int nfaces hmesh - GetNumFaces if level maxlevel -1 Save our vertex marker firstvertex hmesh - GetNumVertices Iterate over the faces of the current level of subdivision for int face firstface face nfaces face Hface f hmesh - GetFace face Note hole tags would have to be dealt with here. f - Refine Save our face index marker for the next level firstface nfaces Output OBJ of the highest level refined ----------- Print vertex positions int nverts hmesh - GetNumVertices for int vert firstvertex vert nverts vert float const pos hmesh - GetVertex vert - GetData . GetPosition printf v f f f n , pos 0 , pos 1 , pos 2 Print faces for int face firstface face hmesh - GetNumFaces face Hface f hmesh - GetFace face assert f - GetNumVertices 4 printf f for int vert 0 vert 4 vert OBJ uses 1-based arrays printf d , f - GetVertex vert - GetID - firstvertex 1 printf n ------------------------------------------------------------------------------ Creates an Hbr mesh see hbr_tutorial_0 and hbr_tutorial_1 for more details Hmesh createMesh Pyramid geometry from catmark_pyramid.h static float verts 5 3 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 2.0f , 0.0f , 0.0f , 0.0f , 2.0f , 0.0f , -2.0f , 0.0f , 0.0f static int nverts 5 , nfaces 5 static int facenverts 5 3 , 3 , 3 , 3 , 4 static int faceverts 16 0 , 1 , 2 , 0 , 2 , 3 , 0 , 3 , 4 , 0 , 4 , 1 , 4 , 3 , 2 , 1 OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Populate the vertices Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish return hmesh ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"far_tutorial_1_2.html\"\n+ \"loc\": \"hbr_tutorial_2.html\"\n }, {\n \"title\": \"hbr_tutorial_1.cpp\",\n \"text\": \"hbr_tutorial_1.cpp hbr_tutorial_1.cpp 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE httpsgithub.comPixarAnimationStudiosOpenSubdivblobreleasetutorialshbrtutorial_1hbr_tutorial_1.cpp ------------------------------------------------------------------------------ Tutorial description This tutorial shows how to safely create Hbr meshes from arbitrary topology. Because Hbr is a half-edge data structure, it cannot represent non-manifold topology. Ensuring that the geometry used is manifold is a requirement to use Hbr safely. This tutorial presents some simple tests to detect inappropriate topology. include opensubdivhbrmesh.h include opensubdivhbrcatmark.h include cstdio ------------------------------------------------------------------------------ struct Vertex Hbr minimal required interface ---------------------- Vertex Vertex int i Vertex Vertex const src _position 0 src . _position 0 _position 1 src . _position 1 _position 2 src . _position 2 void Clear void 0 void AddWithWeight Vertex const , float void AddVaryingWithWeight Vertex const , float Public interface ------------------------------------ void SetPosition float x , float y , float z _position 0 x _position 1 y _position 2 z const float GetPosition const return _position private float _position 3 typedef OpenSubdiv HbrMesh Vertex Hmesh typedef OpenSubdiv HbrFace Vertex Hface typedef OpenSubdiv HbrVertex Vertex Hvertex typedef OpenSubdiv HbrHalfedge Vertex Hhalfedge ------------------------------------------------------------------------------ Non-manifold geometry from catmark_fan.h o o f2 o------------o------------o f0 f1 o------------ o------------o The shared edge of a fan is adjacent to 3 faces, and therefore non-manifold. static float verts 8 3 -1.0 , 0.0 , -1.0 , -1.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , 0.0 , -1.0 , 1.0 , 0.0 , 0.0 , 1.0 , 0.0 , -1.0 , 0.0 , 1.0 , 0.0 , 0.0 , 1.0 , -1.0 static int nverts 8 , nfaces 3 static int facenverts 3 4 , 4 , 4 static int faceverts 12 0 , 1 , 2 , 3 , 3 , 2 , 4 , 5 , 3 , 2 , 6 , 7 ------------------------------------------------------------------------------ int main int , char OpenSubdiv HbrCatmarkSubdivision Vertex catmark new OpenSubdiv HbrCatmarkSubdivision Vertex Hmesh hmesh new Hmesh catmark Vertex v for int i 0 i nverts i v . SetPosition verts i 0 , verts i 1 , verts i 2 hmesh - NewVertex i , v Create the topology int fv faceverts for int i 0 i nfaces i int nv facenverts i bool valid true for int j 0 j nv j Hvertex const origin hmesh - GetVertex fv j , destination hmesh - GetVertex fv j 1 nv Hhalfedge const opposite destination - GetEdge origin Make sure that the vertices exist in the mesh if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n valid false break Check for a degenerate edge if origin destination printf An edge was specified that connected a vertex to itself n valid false break Check that no more than 2 faces are adjacent to the edge if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n valid false break Check that the edge is unique and oriented properly if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n valid false break if valid hmesh - NewFace nv , fv , 0 else printf Skipped face d n , i fv nv hmesh - SetInterpolateBoundaryMethod Hmesh k_InterpolateBoundaryEdgeOnly hmesh - Finish printf Created a fan with d faces and d vertices. n , hmesh - GetNumFaces , hmesh - GetNumVertices delete hmesh delete catmark ------------------------------------------------------------------------------ Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"hbr_tutorial_1.html\"\n }, {\n \"title\": \"hbr_tutorial_0.cpp\",\n@@ -126,114 +126,114 @@\n \"loc\": \"hbr_tutorial_0.html\"\n }, {\n \"title\": \"Using Hbr\",\n \"text\": \"Using Hbr Using Hbr 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Vertex Template API Creating a Mesh Instantiating an HbrMesh Creating Vertices Creating Faces Wrapping Things Up Boundary Interpolation Rules Adding Creases Vertex Creases Edge Creases Holes Hierarchical Edits Face-varying Data Instantiating the HbrMesh Setting the Face-Varying Data Retrieving the Face-Varying Data Valence Operators Managing Singular Vertices Note As of OpenSubdiv 3.0, all Hbr dependencies have been removed from the core APIs Sdc , Vtr , Far , Osd . The legacy source code of Hbr is provided purely for regression and legacy purposes. If your code is currently depending on Hbr functionality, we recommend migrating to the newer APIs as we cannot guarantee that this code will be maintained in future releases. For more information see the 3.0 release notes Vertex Template API The Hbr API abstracts the vertex class through templating. Client-code is expected to provide a vertex class that implements the requisite interpolation functionality. Here is an example of a simple vertex class that accounts for 3D position, but does not support arbitrary variables or varying interpolation. struct Vertex Vertex Vertex int i Vertex const Vertex src _pos 0 src . _pos 0 _pos 1 src . _pos 1 _pos 2 src . _pos 2 Vertex void AddWithWeight const Vertex src , float weight , void 0 _pos 0 weight src . _pos 0 _pos 1 weight src . _pos 1 _pos 2 weight src . _pos 2 void AddVaryingWithWeight const Vertex , float , void 0 void Clear void 0 _pos 0 _pos 1 _pos 2 0.0f void SetPosition float x , float y , float z _pos 0 x _pos 1 y _pos 2 z void ApplyVertexEdit const OpenSubdiv HbrVertexEdit Vertex edit const float src edit . GetEdit switch edit . GetOperation case OpenSubdiv HbrHierarchicalEdit Vertex Set _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Add _pos 0 src 0 _pos 1 src 1 _pos 2 src 2 break case OpenSubdiv HbrHierarchicalEdit Vertex Subtract _pos 0 - src 0 _pos 1 - src 1 _pos 2 - src 2 break void ApplyMovingVertexEdit const OpenSubdiv HbrMovingVertexEdit Vertex custom functions data not required by Hbr ------------------------- Vertex float x , float y , float z _pos 0 x _pos 1 y _pos 2 z const float GetPos const return _pos float _pos 3 In some cases, if only topological analysis is required, the class can be left un-implemented. Far and Osd for instance store vertex data in serialized interleaved vectors. Here is the OsdVertex class for reference class Vertex public Vertex Vertex int index Vertex Vertex const src void AddWithWeight Vertex const i , float weight , void 0 void AddVaryingWithWeight const Vertex i , float weight , void 0 void Clear void 0 void ApplyVertexEdit FarVertexEdit const Creating a Mesh The following tutorial walks through the steps of instantiating a simple Hbr mesh. The code found in regressioncommonshape_utils.h can also be used as an example. While this implementation covers many of Hbr s features, it does not provide coverage for the complete Renderman specification though. Instantiating an HbrMesh First we need to instantiate a mesh object. Hbr supports 3 subdivision schemes Catmull-Clark catmark Loop Bilinear The scheme is selected by passing an specialized instance of HbrSubdivisionT , HbrCatmarkSubdivisionT in this case. The scheme can be shared across multiple mesh objects, so we only need a single instance. static OpenSubdiv HbrCatmarkSubdivision Vertex _scheme OpenSubdiv HbrMesh Vertex mesh new OpenSubdiv HbrMesh Vertex _scheme Creating Vertices Adding vertices to the mesh is accomplished using the HbrMeshNewVertex method. Because Hbr uses a dedicated vertex allocator to help alleviate the performance impact of intensive fragmented memory allocations. This optimization results in the following design pattern Vertex vtx for int i 0 i numVerts i Vertex v mesh - NewVertex i , vtx v-SetPosition We instantiate a single default vertex object named vtx on the stack. We then recover the pointer to the actual vertex created in the mesh from the NewVertex method. Once we have recovered that pointer, we can set the data for our vertex by using any of the custom accessors. Creating Faces Once all the vertices have been registered in the mesh, we can start adding the faces with HbrMeshNewFace . Assuming we had an obj style reader, we need to know the number of vertices in the face and the indices of these vertices. for int f 0 f numFaces f int nverts obj - GetNumVertices f const int faceverts obj - GetFaceVerts f mesh - NewFace nv , fv , 0 However, Hbr is not able to handle non-manifold geometry. In order to avoid tripping asserts or causing memory violations, lets rewrite the previous loop with some some prototype code to check the validity of the topology. for int f 0 f numFaces f int nv obj - GetNumVertices f const int fv obj - GetFaceVerts f triangles only for Loop subdivision if scheme kLoop and nv 3 printf Trying to create a Loop subd with non-triangle face n continue now check the half-edges connectivity for int j 0 j nv j OpenSubdiv HbrVertex T origin mesh - GetVertex fv j OpenSubdiv HbrVertex T destination mesh - GetVertex fv j 1 nv OpenSubdiv HbrHalfedge T opposite destination - GetEdge origin if origin NULL destination NULL printf An edge was specified that connected a nonexistent vertex n continue if origin destination printf An edge was specified that connected a vertex to itself n continue if opposite opposite - GetOpposite printf A non-manifold edge incident to more than 2 faces was found n continue if origin - GetEdge destination printf An edge connecting two vertices was specified more than once. Its likely that an incident face was flipped n continue mesh - NewFace nv , fv , 0 Wrapping Things Up Once we have vertices and faces set in our mesh, we still need to wrap things up by calling HbrMeshFinish mesh - Finish Finish iterates over the mesh to apply the boundary interpolation rules and checks for singular vertices. At this point, there is one final topology check remaining to validate the mesh mesh - Finish if mesh - GetNumDisconnectedVertices printf The specified subdivmesh contains disconnected surface components. n abort or iterate over the mesh to remove the offending vertices Boundary Interpolation Rules The rule-set can be selected using the following accessors Vertex and varying data mesh - SetInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Face-varying data mesh - SetFVarInterpolateBoundaryMethod OpenSubdiv HbrMesh Vertex k_InterpolateBoundaryEdgeOnly Additional information on boundary interpolation rules can be found here Warning The boundary interpolation rules must be set before the call to HbrMeshFinish , which sets the sharpness values to boundary edges and vertices based on these rules. Adding Creases Hbr supports a sharpness attribute on both edges and vertices. Sharpness is set using the SetSharpnessfloat accessors. Vertex Creases Given an index, vertices are very easy to access in the mesh. int idx vertex index float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex idx if v v - SetSharpness std max 0.0f , sharp else printf cannot find vertex for corner tag d n , idx Edge Creases Usually, edge creases are described with a vertex indices pair. Here is some sample code to locate the matching half-edge and set a crease sharpness. int v0 , v1 vertex indices float sharp the edge sharpness OpenSubdiv HbrVertex Vertex v mesh - GetVertex v0 , w mesh - GetVertex v1 OpenSubdiv HbrHalfedge Vertex e 0 if v w if e v - GetEdge w 0 e w - GetEdge v if e e - SetSharpness std max 0.0f , sharp else printf cannot find edge for crease tag d,d n , v0 , v1 Holes Hbr faces support a hole tag. int idx the face index OpenSubdiv HbrFace Vertex f mesh - GetFace idx if f f - SetHole else printf cannot find face for hole tag d n , idx Note The hole tag is hierarchical sub-faces can also be marked as holes. See Hierarchical Edits Hierarchical Edits Hbr supports the following types of hierarchical edits Type Function Corner edits Modify vertex sharpness Crease edits Modify edge sharpness FaceEdit Modify custom face data FVarEdit Modify face-varying data VertexEdit Modify vertex and varying data HoleEdit Set hole tag Modifications are one of the following 3 operations Operation Set Add Subtract Here is a simple example that creates a hierarchical vertex edit. path 655, 2, 3, 0 int faceid 655 , nsubfaces 2 , subfaces 2 2 , 3 , vertexid 0 int offset 0 , offset to the vertex or varying data numElems 3 number of elements to apply the modifier to x,y,z 3 bool isP false shortcut to identify modifications to the vertex position P OpenSubdiv HbrHierarchicalEdit Vertex Operation op OpenSubdiv HbrHierarchicalEdit T Set float values 3 1.0f , 0.5f , 0.0f edit values OpenSubdiv HbrVertexEdit T edit new OpenSubdiv HbrVertexEdit T faceid , nsubfaces , subfaces , vertexid , offset , floatwidth , isP , op , values Face-varying Data Here is a walk-through of how to store face-varying data for a u,v pair. Unlike vertex and varying data which is accessed through the templated vertex API, face-varying data is directly aggregated as vectors of float data. Instantiating the HbrMesh The HbrMesh needs to retain some knowledge about the face-varying data that it carries in order to refine it correctly. int fvarwidth 2 total width of the fvar data static int indices 1 0 , 1 offset set to 0 widths 1 2 2 floats in a u,v pair int const fvarcount fvarwidth 0 1 0 , fvarindices fvarwidth 0 indices NULL , fvarwidths fvarwidth 0 widths NULL mesh new OpenSubdiv HbrMesh T _scheme , fvarcount , fvarindices , fvarwidths , fvarwidth Setting the Face-Varying Data After the topology has been created, Hbr is ready to accept face-varying data. Here is some sample code for int i 0 , idx 0 i numFaces i OpenSubdiv HbrFace Vertex f mesh - GetFace i int nv f - GetNumVertices note this is not the fastest way OpenSubdiv HbrHalfedge Vertex e f - GetFirstEdge for int j 0 j nv j , e e - GetNext OpenSubdiv HbrFVarData Vertex fvt e - GetOrgVertex - GetFVarData f float const fvdata GetFaceVaryingData i , j if not fvt . IsInitialized if no fvar daa exists yet on the vertex fvt . SetAllData 2 , fvdata else if not fvt . CompareAll 2 , fvdata if there already is fvar data and there is a boundary add the new data OpenSubdiv HbrFVarData T nfvt e - GetOrgVertex - NewFVarData f nfvt . SetAllData 2 , fvdata Retrieving the Face-Varying Data The HbrFVarData structures are expanded during the refinement process, with every sub-face being assigned a set of interpolated face-varying data. This data can be accessed in 2 ways From a face, passing a vertex index OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv f . GetFVarData vindex const float data fv . GetData From a vertex, passing a pointer to an incident face OpenSubdivHbrFaceVertex f OpenSubdiv HbrFVarData const fv myVertex . GetFVarData f const float data fv . GetData Valence Operators When manipulating meshes, it is often necessary to iterate over neighboring faces or vertices. Rather than gather lists of pointers and return them, Hbr exposes an operator pattern that guarantees consistent mesh traversals. The following example shows how to use an operator to count the number of neighboring vertices use HbrVertexGetValence for proper valence counts OpenSubdivHbrVertexVertex v class MyOperator public OpenSubdiv HbrVertexOperator Vertex public int count MyOperator count 0 virtual void operator OpenSubdiv HbrVertex Vertex v count MyOperator op v - ApplyOperatorSurroundingVertices op Managing Singular Vertices Certain topological configurations would force vertices to share multiple half-edge cycles. Because Hbr is a half-edge representation, these singular vertices have to be duplicated as part of the HbrMeshFinish phase of the instantiation. These duplicated vertices can cause problems for client-code that tries to populate buffers of vertex or varying data. The following sample code shows how to match the vertex data to singular vertex splits Populating an OsdCpuVertexBuffer with vertex data positions,... float const vtxData inMeshFn . getRawPoints returnStatus OpenSubdiv OsdCpuVertexBuffer vertexBuffer OpenSubdiv OsdCpuVertexBuffer Create numVertexElements , numFarVerts vertexBuffer - UpdateData vtxData , 0 , numVertices Duplicate the vertex data into the split singular vertices std vector std pair int , int const splits hbrMesh - GetSplitVertices for int i 0 i int splits . size i vertexBuffer - UpdateData vtxData splits i . second numVertexElements , splits i . first , 1 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"using_osd_hbr.html\"\n }, {\n- \"title\": \"Subdivision Surfaces\",\n- \"text\": \"Subdivision Surfaces Subdivision Surfaces 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Overview Piecewise Parametric Surfaces Parametric Patches Piecewise Surfaces Arbitrary Topology Regular versus Irregular Features Non-manifold Topology Subdivision versus Tessellation Subdivision Tessellation Which to Use Mesh Data and Topology Separating Data from Topology Vertex and Varying Data Face-Varying Data and Topology Schemes and Options Subdivision Schemes Boundary Interpolation Rules Face-varying Interpolation Rules Semi-Sharp Creases Other Options Chaikin Rule Triangle Subdivision Rule Overview Subdivision surfaces are a common modeling primitive that has gained popularity in animation and visual effects over the past decades. As the name suggests, subdivision surfaces are fundamentally surfaces . More specifically, subdivision surfaces are piecewise parametric surfaces defined over meshes of arbitrary topology -- both concepts that will be described in the sections that follow. Subdivision is both an operation that can be applied to a polygonal mesh to refine it, and a mathematical tool that defines the underlying smooth surface to which repeated subdivision of the mesh converges. Explicit subdivision is simple to apply some number of times to provide a smoother mesh, and that simplicity has historically lead to many tools representing the shape this way. In contrast, deriving the smooth surface that ultimately defines the shape -- its limit surface -- is considerably more complex but provides greater accuracy and flexibility. These differences have led to confusion in how some tools expose subdivision surfaces. The ultimate goal is to have all tools use subdivision surfaces as true surface primitives. The focus here is therefore less on subdivision and more on the nature of the surface that results from it. In addition to providing a consistent implementation of subdivision -- one that includes a number of widely used feature extensions -- a significant value of OpenSubdiv is that it makes the limit surface more accessible. Since its introduction, OpenSubdiv has received interest from users and developers with a wide variety of skills, interests and backgrounds. This document is intended to present subdivision surfaces from a perspective helpful in making use of OpenSubdiv. One purpose it serves is to provide a high level overview for those with less experience with the algorithms or mathematics of subdivision. The other is to provide an overview of the feature set available with OpenSubdiv, and to introduce those capabilities with the terminology used by OpenSubdiv as much of it is overloaded. Piecewise Parametric Surfaces Piecewise parametric surfaces are arguably the most widely used geometric representation in industrial design, entertainment and many other areas. Many of the objects we deal with everyday -- cars, mobile phones, laptops -- were all designed and visualized first as piecewise parametric surfaces before those designs were approved and pursued. Piecewise parametric surfaces are ultimately just collections of simpler modeling primitives referred to as patches. Patches constitute the pieces of the larger surface in much the same way as a face or polygon constitutes a piece of a polygonal mesh. Parametric Patches Patches are the building blocks of piecewise smooth surfaces, and many different kinds of patches have evolved to meet the needs of geometric modeling. Two of the more effective and common patches are illustrated below Single bicubic B-Spline patch Single bicubic Bezier patch Patches consist of a set of points or vertices that affect a rectangular piece of smooth surface triangular patches also exist. That rectangle is parameterized in its two directions, transforming a simple 2D rectangle into the 3D surface u,v 2D domain of a patch Mapping from u,v to x,y,z The points that control the shape of the surface are usually referred to as control points or control vertices, and the collection of the entire set defining a patch as the control mesh, the control hull, the control cage or simply the hull, the cage, etc. For the sake of brevity we will frequently use the term cage, which serves us more generally later. So a patch essentially consist of two entities its control points and the surface affected by them. The way the control points affect the surface is what makes the different types of patches unique. Even patches defined by the same number of points can have different behavior. Note that all 16 points of the B-Spline patch above are relatively far from the surface they define compared to the similar Bezier patch. The two patches in that example actually represent exactly the same piece of surface -- each with a set of control points having different effects on it. In mathematical terms, each control point has a basis function associated with it that affects the surface in a particular way when only that point is moved Bicubic B-Spline basis function Bicubic Bezier basis funciton It is these basis functions that often give rise to the names of the different patches. There are pros and cons to these different properties of the control points of patches, which become more apparent as we assemble patches into piecewise surfaces. Piecewise Surfaces Piecewise parametric surfaces are collections of patches. For rectangular patches, one of the simplest ways to construct a collection is to define a set of patches using a rectangular grid of control points Piecewise B-Spline surface Piecewise Bezier surface Note that we can overlap the points of adjacent B-spline patches. This overlapping means that moving one control point affects multiple patches -- but it also ensures that those patches always meet smoothly this was a design intention and not true for other patch types. Adjacent Bezier patches only share points at their boundaries and coordinating the points across those boundaries to keep the surface smooth is possible, but awkward. This makes B-splines a more favorable surface representation for interactive modeling, but Bezier patches serve many other useful purposes. A more complicated B-spline surface Part of a more complicated B-Spline surface Just as a patch consisted of a cage and a surface, the same is now true of the collection. The control cage is manipulated by a designer and the surface of each of the patches involved is displayed so they can assess its effect. Arbitrary Topology Piecewise surfaces discussed thus far have been restricted to collections of patches over regular grids of control points. There is a certain simplicity with rectangular parametric surfaces that is appealing, but a surface representation that supports arbitrary topology has many other advantages. Rectangular parametric surfaces gained widespread adoption despite their topological limitations, and their popularity continues today in some areas. Complex objects often need many such surfaces to represent them and a variety of techniques have evolved to assemble them effectively, including stitching multiple surfaces together or cutting holes into them trimming. These are complicated techniques, and while effective in some contexts e.g. industrial design they become cumbersome in others e.g. animation and visual effects. A single polygonal mesh can represent shapes with far more complexity than a single rectangular piecewise surface, but its faceted nature eventually becomes a problem. Subdivision surfaces combine the topological flexibility of polygonal meshes with the underlying smoothness of piecewise parametric surfaces. Just as rectangular piecewise parametric surfaces have a collection of control points its cage stored as a grid and an underlying surface, subdivision surfaces also have a collection of control points its cage stored as a mesh and an underlying surface often referred as its limit surface. Regular versus Irregular Features A mesh contains the vertices and faces that form the cage for the underlying surface, and the topology of that mesh can be arbitrarily complex. In areas where the faces and vertices of the mesh are connected to form rectangular grids, the limit surface becomes one of the rectangular piecewise parametric surfaces previously mentioned. These regions of the mesh are said to be regular they provide behavior familiar from the use of similar rectangular surfaces and their limit surface is relatively simple to deal with. All other areas are considered irregular they provide the desired topological flexibility and so are less familiar and less predictable in some cases and their limit surface can be much more complicated. Irregular features come in a number of forms. The most widely referred to is an extra-ordinary vertex, i.e. a vertex which, in the case of a quad subdivision scheme like Catmull-Clark, does not have four incident faces. Irregular vertex and incident faces Regular and irregular regions of the surface The presence of these irregular features makes the limit surface around them similarly irregular, i.e. it cannot be represented as simply as it can for regular regions. Its worth noting that irregular regions shrink in size and become more isolated as subdivision is applied. A face with a lot of extra-ordinary vertices around it makes for a very complicated surface, and isolating these features is a way to help deal with that complexity Two valence-5 vertices nearby Isolation subdivided once Isolation subdivided twice Its generally necessary to perform some kind of local subdivision in these areas to break these pieces of surface into smaller, more manageable pieces, and the term feature adaptive subdivision has become popular in recent years to describe this process. Whether this is done explicitly or implicitly, globally or locally, what matters most is that there is an underlying piece of limit surface for each face -- albeit a potentially complicated one at an irregular feature -- that can be evaluated in much the same way as rectangular piecewise surfaces. Patches of the regular regions Patches of the irregular region While supporting a smooth surface in these irregular areas is the main advantage of subdivision surfaces, both the complexity of the resulting surfaces and their quality are reasons to use them with care. When the topology is largely irregular, there is a higher cost associated with its surface, so minimizing irregularities is advantageous. And in some cases the surface quality, i.e. the perceived smoothness, of the irregular surfaces can lead to undesirable artefacts. An arbitrary polygonal mesh will often not make a good subdivision cage, regardless of how good that polygonal mesh appears. As with rectangular piecewise parametric surfaces, the cage should be shaped to affect the underlying surface it is intended to represent. See Modeling Tips for related recommendations. Non-manifold Topology Since the cage of a subdivision surface is stored in a mesh, and often manipulated in the same context as polygonal meshes, the topic of manifold versus non-manifold topology warrants some attention. There are many definitions or descriptions of what distinguishes a manifold mesh from one that is not. These range from concise but abstract mathematical definitions to sets of examples showing manifold and non-manifold meshes -- all have their value and an appropriate audience. The following is not a strict definition but serves well to illustrate most local topological configurations that cause a mesh to be non-manifold. Consider standing on the faces of a mesh and walking around each vertex in turn. Assuming a right-hand winding order of faces, stand on the side of the face in the positive normal direction. And when walking, step across each incident edge in a counter-clockwise direction to the next incident face. For an interior vertex start at the corner of any incident face walk around the vertex across each incident edge to the next unvisited face repeat if you arrive back where you started and any incident faces or edges were not visited, the mesh is non-manifold Similarly, for a boundary vertex start at the corner of the face containing the leading boundary edge walk around the vertex across each incident edge to the next unvisited face repeat if you arrive at another boundary edge and any incident faces or edges were not visited, the mesh is non-manifold If you can walk around all vertices this way and dont encounter any non-manifold features, the mesh is likely manifold. Obviously if a vertex has no faces, there is nothing to walk around and this test cant succeed, so it is again non-manifold. All of the faces around a vertex should also be in the same orientation, otherwise two adjacent faces have normals in opposite directions and the mesh will be considered non-manifold, so we should really include that constraint when stepping to the next face to be more strict. Consider walking around the indicated vertices of the following non-manifold meshes Edges with 2 incident faces Faces sharing a vertex but no edges As mentioned earlier, many tools do not support non-manifold meshes, and in some contexts, e.g. 3D printing, they should be strictly avoided. Sometimes a manifold mesh may be desired and enforced as an end result, but the mesh may temporarily become non-manifold due to a particular sequence of modeling operations. Rather than supporting or advocating the use of non-manifold meshes, OpenSubdiv strives to be robust in the presence of non-manifold features to simplify the usage of its clients -- sparing them the need for topological analysis to determine when OpenSubdiv can or cannot be used. Although subdivision rules are not as well standardized in areas where the mesh is not manifold, OpenSubdiv provides simple rules and a reasonable limit surface in most cases. Surface around edges with 2 incident faces Surface for faces sharing a vertex but no edges As with the case of regular versus irregular features, since every face has a corresponding piece of surface associated with it -- whether locally manifold or not -- the term arbitrary topology can be said to include non-manifold topology. Subdivision versus Tessellation The preceding sections illustrate subdivision surfaces as piecewise parametric surfaces of arbitrary topology. As piecewise parametric surfaces, they consist of a cage and the underlying surface defined by that cage. Two techniques used to display subdivision surfaces are subdivision and tessellation. Both have their legitimate uses, but there is an important distinction between them subdivision operates on a cage and produces a refined cage tessellation operates on a surface and produces a discretization of that surface The existence and relative simplicity of the subdivision algorithm makes it easy to apply repeatedly to approximate the shape of the surface, but with the result being a refined cage, that approximation is not always very accurate. When compared to a cage refined to a different level, or a tessellation that uses points evaluated directly on the limit surface, the discrepancies can be confusing. Subdivision Subdivision is the process that gives subdivision surfaces their name, but it is not unique to them. Being piecewise parametric surfaces, lets first look at subdivision in the context of the simpler parametric patches that comprise them. Subdivision is a special case of refinement , which is key to the success of some of the most widely used types of parametric patches and their aggregate surfaces. A surface can be refined when an algorithm exists such that more control points can be introduced while keeping the shape of the surface exactly the same . For interactive and design purposes, this allows a designer to introduce more resolution for finer control without introducing undesired side effects in the shape. For more analytical purposes, it allows the surface to be broken into pieces, often adaptively, while being faithful to the original shape. One reason why both B-spline and Bezier patches are so widely used is that both of them can be refined. Uniform subdivision -- the process of splitting each of the patches in one or both of its directions -- is a special case of refinement that both of these patch types support B-Spline surface and its cage Cage subdivided 1x Cage subdivided 2x In the cases illustrated above for B-Splines, the uniformly refined cages produce the same limit surface as the original granted in more pieces. So it is fair to say that both uniform B-splines and Bezier surfaces are subdivision surfaces. The limit surface remains the same with the many more control points roughly 4x with each iteration of subdivision, and those points are closer to but not on the surface. It may be tempting to use these new control points to represent the surface, but using the same number of points evaluated at corresponding uniformly spaced parametric locations on the surface is usually simpler and more effective. Note also that points of the cage typically do not have any normal vectors associated with them, though we can evaluate normals explicitly for arbitrary locations on the surface just as we do for position. So if displaying a cage as a shaded surface, normal vectors at each of the control points must be contrived. Both the positions and normals of the points on the finer cage are therefore both approximations. For more general subdivision surfaces, the same is true. Subdivision will refine a mesh of arbitrary topology, but the resulting points will not lie on the limit surface and any normal vectors contrived from and associated with these points will only be approximations to those of the limit surface. Tessellation There is little need to use subdivision to approximate a parametric surface when it can be computed directly, i.e. it can be tessellated. We can evaluate at arbitrary locations on the surface and connect the resulting points to form a tessellation -- a discretization of the limit surface -- that is far more flexible than the results achieved from uniform subdivision Uniform 3x3 tessellation of B-spline surface Curvature-adaptive tessellation of B-spline surface For a simple parametric surface, the direct evaluation of the limit surface is also simple, but for more complicated subdivision surfaces of arbitrary topology, this is less the case. The lack of a clear understanding of the relationship between the limit surface and the cage has historically lead to many applications avoiding tessellation. Its worth mentioning that subdivision can be used to generate a tessellation even when the limit surface is not available for direct evaluation. The recursive nature of subdivision does give rise to formulae that allow a point on the limit surface to be computed that corresponds to each point of the cage. This process is often referred to as snapping or pushing the points of the cage onto the limit surface. Subdivided 1x and snapped to limit surface Subdivided 2x and snapped to limit surface Since the end result is a connected set of points on the limit surface, this forms a tessellation of the limit surface, and we consider it a separate process to subdivision though it does make use of it. The fact that such a tessellation might have been achieved using subdivision is indistinguishable from the final result -- the same tessellation might just as easily have been generated by evaluating limit patches of the cage uniformly 2x, 4x, 8x, etc. along each edge. Which to Use Subdivision is undeniably useful in creating finer cages to manipulate the surface, but tessellation is preferred for displaying the surface when the patches are available for direct evaluation. There was a time when global refinement was pursued in limited circles as a way of rapidly evaluating parametric surfaces along isoparametric lines, but patch evaluation, i.e. tessellation, generally prevails. Considerable confusion has arisen due the way the two techniques have been employed and presented when displaying the shape in end-user applications. One can argue that if an application displays a representation of the surface that is satisfactory for its purposes, then it is not necessary to burden the user with additional terminology and choices. But when two representations of the same surface differ considerably between two applications, the lack of any explanation or control leads to confusion. As long as applications make different choices on how to display the surface, we seek a balance between simplicity and control. Since subdivided points do not lie on the limit surface, it is important to make it clear to users when subdivision is being used instead of tessellation. This is particularly true in applications where the cage and the surface are displayed in the same style as there is no visual cue for users to make that distinction. Mesh Data and Topology The ability of subdivision surfaces to support arbitrary topology leads to the use of meshes to store both the topology of the cage and the data values associated with its control points, i.e. its vertices. The shape of a mesh, or the subdivision surface that results from it, is a combination of the topology of the mesh and the position data associated with its vertices. When dealing with meshes there are advantages to separating the topology from the data, and this is even more important when dealing with subdivision surfaces. The shape referred to above is not just the shape of the mesh the cage in this case but could be the shape of a refined cage or the limit surface. By observing the roles that both the data and topology play in operations such as subdivision and evaluation, significant advantages can be gained by managing data, topology and the associated computations accordingly. While the main purpose of subdivision surfaces is to use position data associated with the vertices to define a smooth, continuous limit surface, there are many cases where non-positional data is associated with a mesh. That data may often be interpolated smoothly like position, but often it is preferred to interpolate it linearly or even make it discontinuous along edges of the mesh. Texture coordinates and color are common examples here. Other than position, which is assigned to and associated with vertices, there are no constraints on how arbitrary data can or should be associated or interpolated. Texture coordinates, for example, can be assigned to create a completely smooth limit surface like the position, linearly interpolated across faces, or even made discontinuous between them. There are, however, consequences to consider -- both in terms of data management and performance -- which are described below as the terminology and techniques used to achieve each are defined. Separating Data from Topology While the topology of meshes used to store subdivision surfaces is arbitrarily complex and variable, the topology of the parametric patches that make up its limit surface are simple and fixed. Bicubic B-Spline and Bezier patches are both defined by a simple 4x4 grid of control points and a set of basis functions for each point that collectively form the resulting surface. For such a patch, the position at a given parametric location is the result of the combination of position data associated with its control points and the weights of the corresponding basis functions weights being the values of basis functions evaluated at a parametric location. The topology and the basis functions remain the same, so we can make use of the weights independent of the data. If the positions of the control points change, we can simply recombine the new position data with the weights that we just used and apply the same combination. The fixed topology of a parametric patch and two shapes resulting from two sets of positions. Similarly, for a piecewise surface, the position at a given parametric location is the result of the single patch containing that parametric location evaluated at the given position. The control points involved are the subset of control points associated with that particular patch. If the topology of the surface is fixed, so too is the topology of the collection of patches that comprise that surface. If the positions of those control points change, we can recombine the new position data with the same weights for the subset of points associated with the patch. More complex but fixed topology of a surface and two shapes resulting from two sets of positions. This holds for a piecewise surface of arbitrary topology. Regardless of how complex the topology, as long as it remains fixed i.e. relationships between vertices, edges and faces does not change or anything other settings affecting subdivision rules, the same techniques apply. This is just one example of the value of separating computations involving topology from those involving the data. Both subdivision and evaluation can be factored into steps involving topology computing the weights and combining the data separately. Three shapes resulting from three sets of positions for a mesh of fixed topology. When the topology is fixed, enormous savings are possible by pre-computing information associated with the topology and organizing the data associated with the control points in a way that can be efficiently combined with it. This is key to understanding some of the techniques used to process subdivision surfaces. For a mesh of arbitrary topology, the control points of the underlying surface are the vertices, and position data associated with them is most familiar. But there is nothing that requires that the control points of a patch have to represent position -- the same techniques apply regardless of the type of data involved. Vertex and Varying Data The most typical and fundamental operation is to evaluate a position on the surface, i.e. evaluate the underlying patches of the limit surface using the x,y,z positions at the vertices of the mesh. Given a parametric u,v location on one such patch, the data-independent evaluation method first computes the weights and then combines the x,y,z vertex positions resulting in an x,y,z position at that location. But the weights and their combination can be applied to any data at the vertices, e.g. color, texture coordinates or anything else. Data associated with the vertices that is interpolated this way, including position, is said to be vertex data or to have vertex interpolation. Specifying other data as vertex data will result in it being smoothly interpolated in exactly the same way using exactly the same weights as the position. So to capture a simple 2D projection of the surface for texture coordinates, 2D values matching the x,y of the positions would be used. If linear interpolation of data associated with vertices is desired instead, the data is said to be varying data or to have varying interpolation. Here the non-linear evaluation of the patches defining the smooth limit surface is ignored and weights for simple linear interpolation are used. This is a common choice for texture coordinates as evaluation of texture without the need of bicubic patches is computationally cheaper. The linear interpolation will not capture the smoothness required of a true projection between the vertices, but both vertex and varying interpolation have their uses. Projected texture smoothly interpolated from vertex data Projected texture linearly interpolated from varying data Since both vertex and varying data is associated with vertices a unique value assigned to each, the resulting surface will be continuous -- piecewise smooth in the case of vertex data and piecewise linear in the case of varying. Face-Varying Data and Topology In order to support discontinuities in data on the surface, unlike vertex and varying data, there must be multiple values associated with vertices, edges andor faces, in order for a discontinuity to exist. Discontinuities are made possible by assigning values to the corners of faces, similar to the way in which vertices are assigned to the corners of faces when defining the topology of the mesh. Recalling the assignment of vertices to faces Vertex indices are assigned to all corners of each face as part of mesh construction and are often referred to as the face-vertices of an individual face or the mesh. All face-vertices that share the same vertex index will be connected by that vertex and share the same vertex data associated with it. By assigning a different set of indices to the face-vertices -- indices not referring to the vertices but some set of data to be associated with the corners of each face -- corners that share the same vertex no longer need to share the same data value and the data can be made discontinuous between faces This method of associating data values with the face-vertices of the mesh is said to be assigning face-varying data for face-varying interpolation. An interpolated value will vary continuously within a face i.e. the patch of the limit surface associated with the face but not necessarily across the edges or vertices shared with adjacent faces. Disjoint face-varying UV regions applied to the limit surface The combination of associating data values not with the vertices the control points but the face corners, and the resulting data-dependent discontinuities that result, make this a considerably more complicated approach than vertex or varying. The added complexity of the data alone is reason to only use it when necessary, i.e. when discontinuities are desired and present. Part of the complexity of dealing with face-varying data and interpolation is the way in which the interpolation behavior can be defined. Where the data is continuous, the interpolation can be specified to be as smooth as the underlying limit surface of vertex data or simply linear as achieved with varying data. Where the data is discontinuous -- across interior edges and around vertices -- the discontinuities create boundaries for the data, and partition the underlying surface into disjoint regions. The interpolation along these boundaries can also be specified as smooth or linear in a number of ways many of which have a historical basis. A more complete description of the different linear interpolation options with face-varying data and interpolation is given later. These options make it possible to treat the data as either vertex or varying, but with the added presence of discontinuities. An essential point to remember with face-varying interpolation is that each set of data is free to have its own discontinuities -- this leads to each data set having both unique topology and size. The topology specified for a collection of face-varying data is referred to as a channel and is unique to face-varying interpolation. Unlike vertex and varying interpolation, which both associate a data value with a vertex, the number of values in a face-varying channel is not fixed by the number of vertices or faces. The number of indices assigned to the face-corners will be the same for all channels, but the number of unique values referred to by these indices may not. We can take advantage of the common mesh topology in areas where the data is continuous, but we lose some of those advantages around the discontinuities. This results in the higher complexity and cost of a face-varying channel compared to vertex or varying data. If the topology for a channel is fixed, though, similar techniques can be applied to factor computation related to the topology so that changes to the data can be processed efficiently. Schemes and Options While previous sections have described subdivision surfaces in more general terms, this section describes a number of common variations often referred to as extensions to the subdivision algorithms and the ways that they are represented in OpenSubdiv. The number and nature of the extensions here significantly complicate what are otherwise fairly simple subdivision algorithms. Historically applications have supported either a subset or have had varying implementations of the same feature. OpenSubdiv strives to provide a consistent and efficient implementation of this feature set. Given the varying presentations of some of these features elsewhere, the naming chosen by OpenSubdiv is emphasized here. Subdivision Schemes OpenSubdiv provides two well known subdivision surface types -- Catmull-Clark often referred to more tersely as Catmark and Loop subdivision. Catmull-Clark is more widely used and suited to quad-dominant meshes, while Loop is preferred for and requires purely triangulated meshes. The many examples from previous sections have illustrated the more popular Catmull-Clark scheme. For an example of Loop Boundary Interpolation Rules Boundary interpolation rules control how subdivision and the limit surface behave for faces adjacent to boundary edges and vertices. The following choices are available via the enumeration SdcOptionsVtxBoundaryInterpolation Mode Behavior VTX_BOUNDARY_NONE No boundary edge interpolation is applied by default boundary faces are tagged as holes so that the boundary vertices continue to support the adjacent interior faces, but no surface corresponding to the boundary faces is generated boundary faces can be selectively interpolated by sharpening all boundary edges incident the vertices of the face VTX_BOUNDARY_EDGE_ONLY A sequence of boundary vertices defines a smooth curve to which the limit surface along boundary faces extends VTX_BOUNDARY_EDGE_AND_CORNER Similar to edge-only but the smooth curve resulting on the boundary is made to interpolate corner vertices vertices with exactly one incident face On a grid example In practice, it is rare to use no boundary interpolation at all -- this feature has its uses in allowing separate meshes to be seamlessly joined together by replicating the vertices along boundaries, but these uses are limited. Given the global nature of the setting, it is usually preferable to explicitly make the boundary faces holes in the areas where surfaces from separate meshes are joined, rather than sharpening edges to interpolate the desired boundaries everywhere else. The remaining edge only and edge and corner choices are then solely distinguished by whether or not the surface at corner vertices is smooth or sharp. Face-varying Interpolation Rules Face-varying interpolation rules control how face-varying data is interpolated both in the interior of face-varying regions smooth or linear and at the boundaries where it is discontinuous constrained to be linear or pinned in a number of ways. Where the topology is continuous and the interpolation chosen to be smooth, the behavior of face-varying interpolation will match that of the vertex interpolation. Choices for face-varying interpolation are most commonly available in the context of UVs for texture coordinates and a number of names for such choices have evolved in different applications over the years. The choices offered by OpenSubdiv cover a wide range of popular applications. The feature is named face-varying linear interpolation -- rather than boundary interpolation commonly used -- to emphasize that it can be applied to the entire surface not just boundaries and that the effects are to make the surface behave more linearly in various ways. The following choices are available for the SdcOptionsFVarLinearInterpolation enum -- the ordering here applying progressively more linear constraints Mode Behavior FVAR_LINEAR_NONE smooth everywhere the mesh is smooth FVAR_LINEAR_CORNERS_ONLY linearly interpolate sharpen or pin corners only FVAR_LINEAR_CORNERS_PLUS1 CORNERS_ONLY sharpening of junctions of 3 or more regions FVAR_LINEAR_CORNERS_PLUS2 CORNERS_PLUS1 sharpening of darts and concave corners FVAR_LINEAR_BOUNDARIES linear interpolation along all boundary edges and corners FVAR_LINEAR_ALL linear interpolation everywhere boundaries and interior These rules cannot make the interpolation of the face-varying data smoother than that of the vertices. The presence of sharp features of the mesh created by sharpness values, boundary interpolation rules, or the subdivision scheme itself e.g. Bilinear take precedence. All face-varying interpolation modes illustrated in UV space using a simple 4x4 grid of quads segmented into three UV regions their control point locations implied by interpolation in the FVAR_LINEAR_ALL case For those familiar, this shape and its assigned UV sets are available for inspection in the catmark_fvar_bound1 shape of OpenSubdivs example and regression shapes. Semi-Sharp Creases Just as some types of parametric surfaces support additional shaping controls to affect creasing along the boundaries between surface elements, OpenSubdiv provides additional sharpness values or weights associated with edges and vertices to achieve similar results over arbitrary topology. Setting sharpness values to a maximum value 10 in this case -- a number chosen for historical reasons effectively modifies the subdivision rules so that the boundaries between the piecewise smooth surfaces are infinitely sharp or discontinuous. But since real world surfaces never really have infinitely sharp edges, especially when viewed sufficiently close, it is often preferable to set the sharpness lower than this value, making the crease semi-sharp. A constant weight value assigned to a sequence of edges connected edges therefore enables the creation of features akin to fillets and blends without adding extra rows of vertices though that technique still has its merits Sharpness values range from 0-10, with a value of 0 or less having no effect on the surface and a value of 10 or more making the feature completely sharp. It should be noted that infinitely sharp creases are really tangent discontinuities in the surface, implying that the geometric normals are also discontinuous there. Therefore, displacing along the normal will likely tear apart the surface along the crease. If you really want to displace a surface at a crease, it may be better to make the crease semi-sharp. Other Options While the preceding options represent features available in a wide-variety of tools and modeling formats, a few others exist whose recognition and adoption is more limited. In some cases, they offer improvements to undesirable behavior of the subdivision algorithms, but their effects are less than ideal. Given both their limited effectiveness and lack of recognition, these options should be used with caution. Chaikin Rule The Chaikin Rule is a variation of the semi-sharp creasing method that attempts to improve the appearance of creases along a sequence of connected edges when the sharpness values differ. This choice modifies the subdivision of sharpness values using Chaikins curve subdivision algorithm to consider all sharpness values of edges around a common vertex when determining the sharpness of child edges. The creasing method can be set using the values defined in the enumeration SdcOptionsCreasingMethod Mode Behavior CREASE_UNIFORM Apply regular semi-sharp crease rules CREASE_CHAIKIN Apply Chaikin semi-sharp crease rules Example of contiguous semi-sharp creases interpolation Triangle Subdivision Rule The triangle subdivision rule is a rule added to the Catmull-Clark scheme that modifies the behavior at triangular faces to improve the undesirable surface artefacts that often result in such areas. Mode Behavior TRI_SUB_CATMARK Default Catmark scheme weights TRI_SUB_SMOOTH Smooth triangle weights Cylinder example This rule was empirically determined to make triangles subdivide more smoothly. However, this rule breaks the nice property that two separate meshes can be joined seamlessly by overlapping their boundaries i.e. when there are triangles at either boundary, it is impossible to join the meshes seamlessly Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"subdivision_surfaces.html\"\n- }, {\n \"title\": \"Vtr Overview\",\n \"text\": \"Vtr Overview Vtr Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Vectorized Topology Representation Vtr VtrLevel Topological Relationships Memory Efficiency VtrRefinement Parent-child and child-parent relationships Data flexibility Vectorized Topology Representation Vtr Vtr consists of a suite of classes that collectively provide an intermediate representation of topology that supports efficient refinement. Vtr is intended for internal use only and is currently accessed through the Far layer by the FarTopologyRefiner , which assembles these Vtr classes to meet the topological and refinement needs of the Far layer. What follows is therefore more intended to provide insite into the underlying architecture than to describe particular usage. For documentation more relevant to direct usage, proceed to the Far section previously noted. Vtr is vectorized in that its topological data is stored more as a collection of vectors of primitive elements rather than as the faces, vertices and edges that make up many other topological representations. It is essentially a structure-of-arrays SOA approach to topology in contrast to the more common array-of-structures pattern found in many other topological representations. Vtrs use of vectors allows it to be fairly efficient in its use of memory and similarly efficient to refine, but the topology is fixed once defined. Vtr classes are purely topological. They are even more independent of the representation of vertices, faces, etc. than Hbr in that they are not even parameterized by an interface to such components. So the same set of Vtr objects can eventually be used to serve more than one representation of these components. The primary requirement is that a mesh be expressable as an indexable set i.e. a vector or array of vertices, edges and faces. The index of a component uniquely identifies it and properties are retrieved by referring to it by index. Its worth qualifying the term topological here and elsewhere -- we generally refer to topology as subdivision topology rather than mesh topology. A subdivision hierarchy is impacted by the presence of semi-sharp creasing, as the subdivision rules change in response to that creasing. So subdivision topology includes the sharpness values assigned to edges and vertices that affect the semi-sharp creasing. The two primary classes in Vtr consist of VtrLevel - a class representing complete vertex topology for a level VtrRefinement - a class mapping a parent VtrLevel to a child level Others exist to represent the following selection and appropriate tagging of components for sparse refinement divergence of face-varying topology from the vertex topology mapping between face-varying topology at successive levels common low-level utilities, e.g. simple array classes VtrLevel VtrLevel is a complete topological description of a subdivision level, with the topological relations, sharpness values and component tags all stored in vectors literally stdvectors, but easily changed via typedefs. There are no classes or objects for the mesh component types i.e. faces, edges and vertices but simply an integer index to identify each. It can be viewed as a structure-of-arrays representation of the topology any property related to a particular component is stored in an array and accessible using the index identifying that component. So with no classes the for the components, its difficult to say what constitutes a vertex or a face they are each the sum of all the fields scattered amongst the many vectors included. Level represents a single level of a potential hierarchy and is capable of representing the complete base mesh. There are no members that relate data in one level to any other, either below or above. As such, any Level can be used as the base level for a new subdivision hierarchy potentially more than one. All relationships between separate levels are maintained in the VtrRefinement class. Topological Relationships Level requires the definition of and associations between a fixed set of indexable components for all three component types, i.e. an explicit edge list in addition to the expected set of vertices and faces. There are no explicit component objects in the representation, only an integer index VtrIndex identifying each component within the set and data associated with that component in the various vectors. The topology is stored as six sets of incident relations between the components two each for the two other component types incident each component type, i.e. for each face, its incident vertices and incident edges for each edge, its incident vertices and incident faces for each vertex, its incident edges and incident faces The collection of incidence relations is a vectorized variation of AIF the Adjacency and Incidence Framework. The set of these six incidence relations is not minimal only four are required, but that set excludes the most desired face-vertex relation but all six are kept and maintained to facilitate faster refinement. While the sizes of several vectors are directly proportional to the number of vertices, edges or faces to which the data is associated, the sizes of some of the vectors for these relations is more cumulative and so additional vectors of offsets is required typical of the face-vertex list commonly used as the minimal definition of mesh topology. Vectors for the sharpness values associated with crease edges and corner vertices are included and so sized according to the number of edges and vertices, along with additional tags for the components that may be helpful to refinement i.e. the type of subdivision Rule associated with each vertex. A Level is really just a container for data in a subdivision level, and so its public methods are primarily to access that data. Modification of the data is protected and only made available to classes that are intended to construct Levels currently the Far factory class that is responsible for building the base level, and the VtrRefinement class that constructs subsequent levels during refinement. Memory Efficiency One of the advantages in storing data in what is essentially a structure-of-arrays, rather than the array-of-structures more typical of topological representations, is that we can be more selective about memory usage in some cases. Particularly in the case of uniform refinement, when the data in subsequent levels is typically 4x its predecessor, we can minimize what we either generate or keep around at each level. For instance, if only a face-list is required at the finest level, we only need to generate one of the six topological relations the vertices incident each face. When we do keep Levels around in memory as is the case with the FarTopologyRefiner we do have do have the opportunity to prune what is not strictly necessary after the refinement. Just as with construction, whatever classes are privileged to construct a Level are likely those that will be privileged to prune its contents when needed. The current implementation of Level is far from optimal though -- there are opportunities for improvement. After one level of subdivision, the faces in a Level will be either all quads or tris. Having specializations for these cases and using the more general case in support of N-sided faces for the base level only is one possibility. Levels also allocate dozens of vectors in which to store all data. Since these vectors are of fixed size once created, they could be aggregated by partitioning one or a smaller number of larger block of memory into the desired pieces. The desire to make some of these improvements is part of why Vtr is not directly exposed for public use and instead exposed via Far. VtrRefinement While VtrLevel contains the topology for each subdivision level, VtrRefinement is responsible for creating a new level via refinement of an existing one, and for maintaining the relationships between the components in the parent and child levels. So a simplified view of a subdivision hierarchy with Vtr is a set of Levels with a Refinement between each successive pair. Refinement is a friend of Level and will populate a child level from a parent given a set of refinement parameters. Aside from parameters related to data or depth, there are two kinds of refinement supported uniform and sparse. The latter sparse refinement requires selection of an arbitrary set of components -- any dependent or neighboring components that are required for the limit will be automatically included. So feature-adaptive refinement is just one form of this selective sparse refinement, the criteria being the topological features of interest creases and extra-ordinary vertices. The intent is to eventually provide more flexibility to facilitate the refinement of particular regions of interest or more dynamicadaptive needs. Refinement has also been subclassed according to the type of topological split being performed, i.e. splitting all faces into quads or tris via the QuadRefinement and TriRefinement subclasses. As noted with VtrLevel , there is further room for improvement in memory andor performance here by combining more optimal specializations for both Refinement and Level -- with consideration of separating the uniform and sparse cases. Parent-child and child-parent relationships While Refinement populates a new child Level as part of its refinement operation, it also accumulates the relationships between the parent and child level and as with Level , this data is stored in vectors indexable by the components. The associations between components in the two levels was initially only uni-directional child components were associated with incident components of a parent component based on the parent components topology, so we had a parent-to-child mapping one to many. Storing the reverse child-to-parent mapping was avoided to reduce memory particularly in the case of uniform refinement as it often was not necessary, but a growing need for it, particularly in the case of sparse feature-adaptive refinement, lead to it being included. Data flexibility One of the advantages of the structure-of-arrays representation in both Level and Refinement is that we can make more dynamic choices about what type of data we choose to allocate and use based on needs. For instance, we can choose between maintaining the parent-child or child-parent mapping in Refinement , or both if needed, and we can remove one if no longer necessary. An active example of this is uniform refinement if we only require the face-vertex list at the finest subdivision level, there is no need to generate a complete topological description of that level as would be required of more traditional representations, and given that level is 4x the magnitude of its parent, the savings are considerable. Currently there is nothing specific to a subdivision scheme in the refinement other than the type of topological splitting to apply. The refinement does subdivide sharpness values for creasing, but that too is independent of scheme. Tags were added to the base level that are propagated through the refinement and these too are dependent on the scheme, but are applied externally. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"vtr_overview.html\"\n }, {\n \"title\": \"Tutorials\",\n \"text\": \"Tutorials Tutorials 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Bfr Tutorials 1. Basic Evaluation and Tessellation Tutorial 1.1 Tutorial 1.2 Tutorial 1.3 Tutorial 1.4 Tutorial 1.5 2. More on Tessellation Tutorial 2.1 Tutorial 2.2 3. Additional Topics Tutorial 3.1 Tutorial 3.2 Far Tutorials 1. Basic Construction and Interpolation Tutorial 1.1 Tutorial 1.2 2. Uniform Refinement and Primvar Data Types Tutorial 2.1 Tutorial 2.2 Tutorial 2.3 3. Creating a Custom FarTopologyRefinerFactory Tutorial 3.1 4. Construction and Usage of FarStencilTables Tutorial 4.1 Tutorial 4.2 Tutorial 4.3 5. Construction and Usage of FarPatchTables Tutorial 5.1 Tutorial 5.2 Tutorial 5.3 Osd Tutorials Tutorial 0 Hbr Tutorials Tutorial 0 Tutorial 1 Tutorial 2 The tutorial source code can be found in the github.com repository or in your local repository roottutorials . Bfr Tutorials All tutorials for the Bfr interface follow a similar pattern without any command line arguments, a default mesh usually a cube is used and the results printed to standard output in Obj format. Command line arguments can be used to specify an alternate mesh for input, as well as directing the output to a specified Obj file. Some tutorials may offer additional command line options to trigger internal options relevant to the topic, e.g. those illustrating tessellation may support a -quads option to use the option to tessellate quad-bases subdivision meshes with quads. 1. Basic Evaluation and Tessellation Tutorial 1.1 This tutorial illustrates the use of BfrSurfaceFactory and BfrSurface to evaluate points on the limit of each face. The limit positions at all corners of the face are evaluated and connected to the limit position in the center of the face -- creating a simple triangular tessellation. code Tutorial 1.2 This tutorial shows the added use of BfrTessellation to identify the set of points and connectivity for a uniform tessellation. Both a Surface and Tessellation is identified for each face, with the Tessellation indicating which points are to be evaluated by the Surface. code Tessellation patterns for quad-based subdivision schemes can optionally preserve quads left or be fully triangulated center, while triangular schemes always yield triangles right Tutorial 1.3 This tutorial extends the previous tutorial on uniform Tessellation by adding face-varying Surfaces to compute corresponding UVs for each evaluated position. code Tutorial 1.4 This tutorial extends the previous tutorial on uniform tessellation of position and UV by illustrating how additional mesh data interleaved with the position and UV data is easily handled. code Tutorial 1.5 This tutorial is similar to the first tutorial showing uniform tessellation of position but makes use of limit stencils for its evaluation of points of the tessellation pattern. code 2. More on Tessellation Tutorial 2.1 This tutorial extends the use of Tessellation to illustrate the use of non-uniform tessellation rates per edge. A simple edge-length metric is used to determine the tessellation rate for each edge of a face. code The following contrasts uniform tessellation left with the resulting length-based tessellations -- preserving quads center and fully triangulated right Tutorial 2.2 This tutorial is a more complex extension of the use of Tessellation that illustrates how the separation and association of tessellation data with the boundary and interior of the face can be used. Limit points evaluated on the vertices and edges of a face the boundary of the Tessellation are computed once and shared with adjacent faces -- creating a topologically watertight tessellation of the mesh. code 3. Additional Topics Tutorial 3.1 This tutorial shows a basic example of the more advanced topic of creating a subclass of SurfaceFactory adapted to a connected mesh representation -- requiring an implementation of the SurfaceFactoryMeshAdapter interface for that mesh. A simplified version of the implementation of FarTopologyRefiner is provided. Note that the code imported here is that of the main program, not the separate header and source files of the custom subclass illustrated -- which current documentation scripts cannot import. Tutorial 3.2 This tutorial shows how to initialize and retain Surfaces for later use. The simple uniform tessellation tutorial is modified to first create and populate a simple caching structure that initializes and stores the Surfaces for all faces of the mesh. The loop for each face of the mesh then retrieves its Surface and associated patch points from the cache. code Far Tutorials 1. Basic Construction and Interpolation Tutorial 1.1 This tutorial presents the requisite steps to instantiate a mesh as a FarTopologyRefiner from simple topological data and to interpolate vertex data associated with the mesh. code Tutorial 1.2 This tutorial makes use of a different vertex data definition for use when vertex data is of arbitrary width. Uniform refinement is applied to data buffers of three types two of fixed but different sizes and the third a union of the two that is dynamically sized and constructed. code 2. Uniform Refinement and Primvar Data Types Tutorial 2.1 Building on the basic tutorial, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and varying primvar data. code Tutorial 2.2 Building on the previous tutorial, this example shows how to instantiate a simple mesh, refine it uniformly and then interpolate both vertex and face-varying primvar data. The resulting interpolated data is output in Obj format, with the face-varying data recorded in the UV texture layout. code Tutorial 2.3 Building on previous tutorials, this example shows how to instantiate a simple mesh, refine it uniformly, interpolate both vertex and face-varying primvar data, and finally calculate approximated smooth normals. The resulting interpolated data is output in Obj format. code 3. Creating a Custom FarTopologyRefinerFactory Tutorial 3.1 Previous tutorials have instantiated topology from a simple face-vertex list via the FarTopologyDescriptor and its TopologyRefinerFactory. This tutorial shows how to more efficiently convert an existing high-level topology representation to a FarTopologyDescriptor with a custom factory class. code 4. Construction and Usage of FarStencilTables Tutorial 4.1 This tutorial shows how to create and manipulate a StencilTable. Factorized stencils are used to efficiently interpolate vertex primvar data buffers. code Tutorial 4.2 This tutorial shows how to create and manipulate StencilTables for both vertex and varying primvar data buffers vertex positions and varying colors. code Tutorial 4.3 This tutorial shows how to create and manipulate tables of cascading stencils to apply hierarchical vertex edits. code 5. Construction and Usage of FarPatchTables Tutorial 5.1 This tutorial shows how to compute points on the limit surface at arbitrary parametric locations using a FarPatchTable constructed from adaptive refinement. code Tutorial 5.2 Building on the previous tutorial, this example shows how to manage the limit surface of a potentially large mesh by creating and evaluating separate PatchTables for selected groups of faces of the mesh. code Tutorial 5.3 Building on the previous tutorials for both PatchTables and StencilTables, this example shows how to construct a LimitStencilTable to repeatedly evaluate an arbitrary collection of points on the limit surface. code Osd Tutorials Tutorial 0 This tutorial demonstrates the manipulation of Osd Evaluator and BufferDescriptor. code Hbr Tutorials Use of Hbr is no longer recommended -- these tutorials are included solely for historical reference. Tutorial 0 This tutorial presents, in a very succinct way, the requisite steps to instantiate an Hbr mesh from simple topological data. code Tutorial 1 This tutorial shows how to safely create Hbr meshes from arbitrary topology. Because Hbr is a half-edge data structure, it cannot represent non-manifold topology. Ensuring that the geometry used is manifold is a requirement to use Hbr safely. This tutorial presents some simple tests to detect inappropriate topology. code Tutorial 2 This tutorial shows how to subdivide uniformly a simple Hbr mesh. We are building upon previous tutorials and assuming a fully instantiated mesh we start with an HbrMesh pointer initialized from the same pyramid shape used in hbr_tutorial_0. We then apply the Refine function sequentially to all the faces in the mesh to generate several levels of uniform subdivision. The resulting data is then dumped to the terminal in Wavefront OBJ format for inspection. code Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"tutorials.html\"\n }, {\n- \"title\": \"Sdc Overview\",\n- \"text\": \"Sdc Overview Sdc Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Subdivision Core Sdc Types, Traits and Options Creasing support Scheme-specific support The FACE, EDGE and VERTEX interfaces The MASK interface Subdivision Core Sdc Sdc is the lowest level layer in OpenSubdiv. Its intent is to separate the core subdivision details from any particular representation of a mesh it was previously bound to Hbr to facilitate the generation of consistent results with other mesh representations, both internal and external to OpenSubdiv. The functionality can be divided roughly into three sections types, traits and options for the supported subdivision schemes computations required to support semi-sharp creasing computations for mask weights of subdivided vertices for all schemes For most common usage, familiarity with only the first of these is necessary -- primarily the use of public types and constants for the choice of subdivision scheme and its associated options. The latter two provide the basis for a more comprehensive implementation of subdivision, which requires considerably more understanding and effort. Overall, the approach was to extract the functionality at the lowest level possible. In some cases, the implementation is not far from being simple global functions. The intent was to start at a low level and build any higher level functionality as needed. What exists now is functional for ongoing development and anticipated needs within OpenSubdiv for the near future. The intent of Sdc is to provide the building blocks for OpenSubdiv and its clients to efficiently process the specific set of supported subdivision schemes. It is not intended to be a general framework for defining customized subdivision schemes. Types, Traits and Options The most basic type is the enum SdcSchemeType that identifies the fixed set of subdivision schemes supported by OpenSubdiv Bilinear , Catmark and Loop . With this alone, we intend to avoid all dynamic casting issues related to the scheme by simply adding members to the associated subclasses for inspection. In addition to the type enum itself, a class defining a fixed set of traits associated with each scheme is provided. While these traits are available as static methods in the interface of a class supporting more functionality for each scheme to be described shortly, the SchemeTypeTraits provide queries of the traits for a variable of type SdcSchemeType -- enabling parameterization of code by the value of a trait without templates or virtual inheritance a simple internal table of traits is constructed and trivially indexed. The second contribution is the collection of all variations in one place that can be applied to the subdivision schemes, i.e. the boundary interpolation rules, creasing method, edge subdivision choices, etc. The fact that these are all declared in one place alone should help clients see the full set of variations that are possible. A simple Options struct a set of bitfields aggregates all of these variations into a single object the equivalent of an integer in this case that are passed around to other Sdc classes andor methods and are expected to be used at a higher level both within OpenSubdiv and externally. By aggregating the options and passing them around as a group, it allows us to extend the set easily in future without the need to rewire a lot of interfaces to accommodate the new choice. Clients can enable new choices at the highest level and be assured that they will propagate to the lowest level where they are relevant. Unlike other options structs used elsewhere to specify variations of a particular method, SdcOptions defines all options that affect the shape of the underlying limit surface of a subdivision mesh. Other operations at higher levels in the library may have options that approximate the shape and so create a slightly different appearance, but SdcOptions is a fundamental part of the definition of the true limit surface. Creasing support Since the computations involved in the support of semi-sharp creasing are independent of the subdivision scheme, the goal in Sdc was to encapsulate all related creasing functionality in a similarly independent manner. Computations involving sharpness values are also much less dependent on topology -- there are vertices and edges with sharpness values, but knowledge of faces or boundary edges is not required, -- so the complexity of topological neighborhoods required for more scheme-specific functionality is arguably not necessary here. Creasing computations have been provided as methods defined on a Crease class that is constructed with a set of Options. Its methods typically take sharpness values as inputs and compute a corresponding set of sharpness values as a result. For the Uniform creasing method previously known as Normal , the computations may be so trivial as to question whether such an interface is worth it, but for Chaikin or other schemes in the future that are non-trivial, the benefits should be clear. Functionality is divided between both uniform and non-uniform, so clients have some control over avoiding unnecessary overhead, e.g. non-uniform computations typically require neighboring sharpness values around a vertex, while uniform does not. Also included as part of the Crease class is the Rule enum -- this indicates if a vertex is Smooth, Crease, Dart or Corner referred to as the mask in Hbr and is a function of the sharpness values at and around a vertex. Knowing the Rule for a vertex can accelerate mask queries, and the Rule can often be inferred based on the origin of a vertex e.g. it originated from the middle of a face, was the child of a Smooth vertex, etc.. Methods are defined for the Crease class to subdivide edge and vertex sharpness values determine the Rule for a vertex based on incident sharpness values determine the transitional weight between two sets of sharpness values Being all low-level and working directly on sharpness values, it is a clients responsibility to coordinate the application of any hierarchical crease edits with their computations. Similarly, in keeping with this as a low-level interface, values are passed as primitive arrays. This follows the trend in OpenSubdiv of dealing with data of various kinds e.g. weights, component indices, now sharpness values, etc. in small contiguous sets of values. In most internal cases we can refer to a set of values or gather what will typically be a small number of values on the stack for temporary use. Scheme-specific support While the SchemeTypeTraits class provides traits for each subdivision scheme supported by OpenSubdiv i.e. Bilinear , Catmark and Loop , the Scheme class provides these more directly, Additionally, the Scheme class provides methods for computing the various sets of weights used to compute new vertices resulting from subdivision. The collection of weights used to compute a single vertex at a new subdivision level is typically referred to as a mask . The primary purpose of the Scheme class is to provide such masks in a manner both general and efficient. Each subdivision scheme has its own values for its masks, and each are provided as specializations of the template class SchemeSchemeType TYPE . The intent is to minimize the amount of code specific to each scheme. The computation of mask weights for subdivided vertices is the most significant contribution of Sdc. The use of semi-sharp creasing with each non-linear subdivision scheme complicates what are otherwise simple masks determined solely by the topology, and packaging that functionality to achieve both the generality and efficiency desired has been a challenge. Mask queries are defined in the Scheme class template, which has specializations for each of the supported subdivision schemes. Mask queries are defined in terms of interfaces for two template parameters the first defining the topological neighborhood of a vertex, and a second defining a container in which to gather the individual weights template typename FACE , typename MASK void ComputeFaceVertexMask FACE const faceNeighborhood , MASK faceVertexMask , ... const Each mask query is expected to call methods defined for the FACE , EDGE or VERTEX classes to obtain the information they require typically these methods are simple queries about the topology and associated sharpness values. Clients are free to use their own mesh representations to gather the requested information as quickly as possible, or to cache some subset as member variables for immediate inline retrieval. In general, the set of weights for a subdivided vertex is dependent on the following the topology around the parent component from which the vertex originates the type of subdivision Rule applicable to the parent component the type of subdivision Rule applicable to the new child vertex a transitional weight blending the effect between differing parent and child rules This seems fairly straight-forward, until we look at some of the dependencies involved the parent Rule requires the sharpness values at and around the parent component the child Rule requires the subdivided sharpness values at and around the new child vertex though it can sometimes be trivially inferred from the parent the transitional weight between differing rules requires all parent and child sharpness values Clearly the sharpness values are inspected multiple times and so it pays to have them available for retrieval. Computing them on an as-needed basis may be simple for uniform creasing, but a non-uniform creasing method requires traversing topological neighborhoods, and that in addition to the computation itself can be costly. The point here is that it is potentially unreasonable to expect to evaluate the mask weights completely independent of any other consideration. Expecting and encouraging the client to have subdivided sharpness values first, for use in more than one place, is therefore recommended. The complexity of the general case above is also unnecessary for most vertices. Any client using Sdc typically has more information about the nature of the vertex being subdivided and much of this can be avoided -- particularly for the smooth interior case that often dominates. More on that in the details of the Scheme classes. Given that most of the complexity has been moved into the template parameters for the mask queries, the Scheme class remains fairly simple. Like the Crease class, it is instantiated with a set of Options to avoid them cluttering the interface. It is currently little more than a few methods for the limit and refinement masks for each vertex type, plus the few fixed traits of the scheme as static methods. The mask queries have been written in a way that greatly simplifies the specializations required for each scheme. The generic implementation for both the edge-vertex and vertex-vertex masks take care of all of the creasing logic, requiring only a small set of specific masks to be assigned for each Scheme smooth and crease masks for an edge-vertex, and smooth, crease and corner masks for a vertex-vertex. Other than the Bilinear case, which will specialize the mask queries to trivialize them for linear interpolation, the specializations for each Scheme should only require defining this set of masks -- and with two of them common edge-vertex crease and vertex-vertex corner the Catmark scheme only needs to define three. The FACE, EDGE and VERTEX interfaces Mask queries require an interface to a topological neighborhood, currently labeled FACE , EDGE and VERTEX . This naming potentially implies more generality than intended, as such classes are only expected to provide the methods required of the mask queries to compute its associated weights. While all methods must be defined, some may rarely be invoked, and the client has considerable flexibility in the implementation of these they can defer some evaluations lazily until required, or be pro-active and cache information in member variables for immediate access. An approach discussed in the past has alluded to iterator classes that clients would write to traverse their meshes. The mask queries would then be parameterized in terms of a more general and generic mesh component that would make use of more general traversal iterators. The advantage here is the iterators are written once, then traversal is left to the query and only what is necessary is gathered. The disadvantages are that clients are forced to write these to do anything, getting them correct and efficient may not be trivial or possible in some cases, and that the same data e.g. subdivided sharpness may be gathered or computed multiple times for different purposes. The other extreme was to gather everything possible required at once, but that is objectionable. The approach taken here provides a reasonable compromise between the two. The mask queries ask for exactly what they want, and the provided classes are expected to deliver it as efficiently as possible. In some cases the client may already be storing it in a more accessible form and general topological iteration can be avoided. The information requested of these classes in the three mask queries is as follows For FACE the number of incident vertices For EDGE the number of incident faces the sharpness value of the parent edge the sharpness values of the two child edges the number of vertices per incident face For VERTEX the number of incident faces the number of incident edges the sharpness value of the parent vertex the sharpness values for each incident parent edge the sharpness value of the child vertex the sharpness values for each incident child edge The latter should not be surprising given the dependencies noted above. There are also a few more to consider for future use, e.g. whether the EDGE or VERTEX is manifold or not. In most cases, additional information can be provided to the mask queries i.e. pre-determined Rules, and most of the child sharpness values are not necessary. The most demanding situation is a fractional crease that decays to zero -- in which case all parent and child sharpness values in the neighborhood are required to determine the proper transitional weight. The MASK interface Methods dealing with the collections of weights defining a mask are typically parameterized by a MASK template parameter that contains the weights. The set of mask weights is currently divided into vertex-weights, edge-weights and face-weights -- consistent with previous usage in OpenSubdiv and providing some useful correlation between the full set of weights and topology. The vertex-weights refer to parent vertices incident the parent component from which a vertex originated, the edge-weights the vertices opposite incident edges of the parent, and the face-weights the center of incident parent faces. Note the latter is NOT in terms of vertices of the parent but potentially vertices in the child originating from faces of the parent. This has been done historically in OpenSubdiv but is finding less use -- particularly when it comes to providing greater support for the Loop scheme -- and is a point needing attention. So the mask queries require the following capabilities assign the number of vertex, edge andor face weights retrieve the number of vertex, edge andor face weights assign individual vertex, edge andor face weights by index retrieve individual vertex, edge andor face weights by index through a set of methods required of all MASK classes. Since the maximum number of weights is typically known based on the topology, usage within Vtr, Far or Hbr is expected to simply define buffers on the stack. Another option is to utilize pre-allocated tables, partitioned into the three sets of weights on construction of a MASK , and populated by the mask queries. A potentially useful side-effect of this is that the client can define their weights to be stored in either single or double-precision. With that possibility in mind, care was taken within the mask queries to make use of a declared type in the MASK interface MASKWeight for intermediate calculations. Having support for double-precision masks in Sdc does enable it at higher levels in OpenSubdiv if later desired, and that support is made almost trivial with MASK being generic. It is important to remember here that these masks are being defined consistent with existing usage within OpenSubdiv both Hbr and the subdivision tables generated by Far . As noted above, the face weights correspond to the centers of incident faces, i.e. vertices on the same level as the vertex for which the mask is being computed, and not relative to vertices in the parent level as with the other sets of weights. It is true that the weights can be translated into a set in terms solely of parent vertices, but in the general case i.e. Catmark subdivision with non-quads in the base mesh this requires additional topological association. In general we would need N-3 weights for the N-3 vertices between the two incident edges, where N is the number of vertices of each face typically 4 even at level 0. Perhaps such a translation method could be provided on the mask class, with an optional indication of the incident face topology for the irregular cases. The Loop scheme does not have face weights , for a vertex-vertex mask, but for an edge-vertex mask it does require weights associated with the faces incident the edge -- either the vertex opposite the edge for each triangle, or its center which has no other use for Loop. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"sdc_overview.html\"\n- }, {\n- \"title\": \"3.0 - 3.6 Release Notes\",\n- \"text\": \"3.0 - 3.6 Release Notes 3.0 - 3.6 Release Notes 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.6 Release 3.6.0 - Sep 2023 Release 3.5 Release 3.5.1 - July 2023 Release 3.5.0 - Sep 2022 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.3 - Apr 2020 Release 3.4.0 - Jun 2019 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.2 - Jun 2018 Release 3.3.1 - Feb 1018 Release 3.3.0 - Aug 2017 Release 3.2 Release 3.2.0 - Feb 2017 Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.0 - Oct 2016 Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.4 - Feb 2016 Release 3.0.3 - Oct 2015 Release 3.0.2 - Aug 2015 Release 3.0.1 - Aug 2015 Release 3.0.0 - Jun 2015 Release 3.0.0 RC2 Release 3.0.0 RC1 Previous 2.x Release Notes Release 3.6 Release 3.6.0 - Sep 2023 Release 3.6.0 is a significant release with new features, several configuration improvements, and bug fixes. For more information on the following, see Release 3.6 Changes Updated Osd patch drawing shader source to exclude legacy shader constructs to improve compatibility with Vulkan, DX12, etc. GitHub 1320 Installed Osd patch evaluation headers to allow use from client shaders and compute kernels GitHub 1321 Updated CMake build to locate TBB using TBBs CMake config in order to support oneTBB GitHub 1319 Updated CMake FindOpenCL module to support parsing version information from recent OpenCL headers GitHub 1322 Removed obsolete .travis.yml GitHub 1324 Bug Fixes Fixed inconsistent warning levels for MSVC builds when using Ninja GitHub 1318 Fixed documentation build errors when using Ninja GitHub 1323 Fixed build errors resulting from oneTBB API changes GitHub 1317 Release 3.5 Release 3.5.1 - July 2023 Release 3.5.1 is a minor release including bug fixes and configuration improvements. Changes Updated CMake to set fallback CMAKE_CXX_STANDARD to C14 GitHub 1276 Updated CMake with OpenGL import targets to avoid link errors GitHub 1277 Updated CMake to set gpu architecture fallback only for older CUDA versions GitHub 965 1299 Updated CMake to use append for CMAKE_MODULE_PATH GitHub 1296 Fixed interface includes for CMake config GitHub 1278 Fixed warnings with newer and stricter use of Clang GitHub 1275 1289 1290 Fixed potential float constant cast errors for OpenCL GitHub 1285 Fixed generation of Apple Frameworks with no OSD_GPU targets enabled GitHub 1224 1236 Bug Fixes Fixed BfrSurface construction bug for rare topological case GitHub 1301 Fixed CUDA example dependencies with GLX on Linux GitHub 1294 Release 3.5.0 - Sep 2022 Release 3.5.0 is a significant release with new features, several configuration improvements, and a few other improvements and bug fixes. For more information on the following, see Release 3.5 Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases New Features Simplified Surface Evaluation Bfr Tessellation Patterns Bfr Changes Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.4 is a minor release including bug fixes and configuration improvements Changes The master branch on GitHub has been renamed release GitHub 1218 1219 The CMake configuration has been updated to allow use as a sub-project GitHub 1206 Removed obsolete references to hbr from examplesfarViewer GitHub 1217 Bug Fixes Fixed bug with sparse PatchTables and irregular face-varying seams GitHub 1203 Fixed loss of precision when using double precision stencil tables GitHub 1207 Fixed reset of FarTopologyRefinerGetMaxLevel after call to Unrefine GitHub 1208 Fixed linking with -ldl on unix systems GitHub 1196 Fixed naming and installation of macOS frameworks GitHub 1194 1201 Fixed GL version and extension processing and dynamic loading on macOS GitHub 1216 Fixed FindDocutils.cmake to be more robust GitHub 1213 1220 Fixed errors using build_scriptsbuild_osd.py with Python3 GitHub 1206 Release 3.4.3 - Apr 2020 Release 3.4.3 is a minor release including bug fixes and configuration improvements Changes GLEW is no longer required by default GitHub 1183 1184 Removed false Ptex link dependency from libosdCPU GitHub 1174 Removed false GLFW link dependency from DX11 and Metal examples GitHub 1178 Removed link dependency on unused TBB libraries GitHub 1064 Added option to disable building of dynamic shared libraries GitHub 1169 Added new tutorial for FarLimitStencilTable GitHub 1176 Updated use of EXT_direct_state_access to ARB_direct_state_access GitHub 1184 Fixed C strict aliasing warnings GitHub 1182 Fixed MSVC warnings in example code GitHub 1158 1172 Fixed compatibility with Visual Studio 2019 GitHub 1173 1189 Fixed CMake CMP0054 warnings GitHub 1180 Added prefix to OpenSubdiv CMake macros GitHub 1157 Moved utilities in examplescommon to regressioncommon GitHub 1167 Minor fixes to Far tutorials GitHub 1175 1177 Switched to Azure Pipelines for continuous integration testing instead of Travis-CI and AppVeyor GitHub 1168 1190 Bug Fixes Fixed selective boundary interpolation for case SdcOptionsVTX_BOUNDARY_NONE GitHub 1170 1171 Fixed static library linking to address missing symbols GitHub 1192 Additional fixes for dynamic and static linking GitHub 1193 Release 3.4.0 - Jun 2019 Release 3.4.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.4 New Features Triangular Patches for Loop subdivision Improvements to Introductory Documentation Sparse Patch Tables and Adaptive Refinement Full Support for Double Precision in Far Changes Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.3 is bug-fix release addressing regressions from release 3.3.2 Bug Fixes Fixed a regression in PatchTable construction with varying patches GitHub 976 Fixed a regression in PatchTable construction for face-varying patches GitHub 972 Fixed a bug in the initialization of FarSourcePatch GitHub 971 Release 3.3.2 - Jun 2018 Release 3.3.2 is a minor release with potentially significant performance improvements to the patch pre-processing stages Changes Improved performance of PatchTable construction GitHub 966 The resulting improved accuracy will produce slight numerical differences in computations involving patches, e.g. StencilTable and PatchTable evaluation Bug Fixes FarPatchTableFactory now supports PatchTable construction with ENDCAP_BILINEAR_BASIS specified Release 3.3.1 - Feb 1018 Release 3.3.1 is a minor bug-fix release Bug Fixes Fixed GLSLHLSLMetal patch shader code to resolve degenerate normals GitHub 947 Fixed problems with face-varying patches in uniform PatchTables GitHub 946 Fixed integer overflow bugs for large meshes in PatchTable factories GitHub 957 Fixed computation of PatchParam for triangle refinement GitHub 962 Changes Added build options NO_GLFW and NO_GLFW_X11 Added additional shapes with infinitely sharp creases to the Metal and DX11 example viewers Disabled GL tests during CI runs on Linux Improved stability of examplesglImaging in CI runs by testing GL version Release 3.3.0 - Aug 2017 Release 3.3.0 is significant release adding an Osd implementation for Apples Metal API New Features Added an Osd implementation for Apples Metal API Added the mtlViewer example Changes Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Release 3.2 Release 3.2.0 - Feb 2017 Release 3.2.0 is a minor release containing API additions and bug fixes New Features Extended FarStencilTableFactory to support face-varying Extended Osd Evaluator classes to support evaluation of 1st and 2nd derivatives Added an option to disable generation of legacy sharp corner patches Changes Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.1 is a minor bug-fix release. Bug Fixes Fixed a bug with non-manifold face-varying topology causing a crash during patch table creation Fixed GLEW compilation and linking with dynamic GLEW libraries on Windows Fixed GLFW linking with GLFW 3.2 on X11 platforms Release 3.1.0 - Oct 2016 Release 3.1.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.1 New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features Changes Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.5 is a minor stability release with performance and correctness bug fixes. Bug Fixes The previous release reduced transient memory use during PatchTable construction, but increased the amount of memory consumed by the resulting PatchTable itself, this regression has been fixed. The example Ptex texture sampling code has been fixed to prevent sampling beyond the texels for a face when multisample rasterization is enabled. Release 3.0.4 - Feb 2016 Release 3.0.4 is a minor stability release which includes important performance and bug fixes. New Features Added accessor methods to FarLimitStencilTable to retrieve limit stencil data including derivative weights Added support for OpenCL event control to OsdCLVertexBuffer and OsdCLEvaluator Changes Major reduction in memory use during FarPatchTable construction for topologies with large numbers of extraordinary features Improved performance for GL and D3D11 tessellation control hull shader execution when drawing BSpline patches with the single crease patch optimization enabled Bug Fixes Restored support for drawing with fractional tessellation Fixed far_tutorial_6 to refine primvar data only up to the number of levels produced by topological refinement Fixed build warnings and errors reported by Visual Studio 2015 Release 3.0.3 - Oct 2015 Release 3.0.3 is a minor stability release which includes important performance and bug fixes. New Features Smooth normal generation tutorial, far_tutorial_8 Changes Major performance improvement in PatchTable construction Improved patch approximations for non-manifold features Bug Fixes Fixed double delete in GLSL Compute controller Fixed buffer layout for GLSL Compute kernel Fixed GL buffer leak in OsdGLPatchTable Fixed out-of-bounds data access for TBB and OMP stencil evaluation Fixed WIN32_LEAN_AND_MEAN typo Fixed Loop-related shader issues glFVarViewer Release 3.0.2 - Aug 2015 Release 3.0.2 is a minor release for a specific fix. Bug Fixes Fixed drawing of single crease patches Release 3.0.1 - Aug 2015 Release 3.0.1 is a minor release focused on stability and correctness. Changes Added a references section to the documentation, please see References Removed references to AddVaryingWithWeight from examples and tutorials Added more regression test shapes Addressed general compiler warnings e.g. signed vs unsigned comparisons Addressed compiler warnings in the core libraries reported by GCCs -Wshadow Eased GCC version restriction, earlier requirement for version 4.8 or newer is no longer needed Replaced topology initialization assertions with errors Improved compatibility with ICC Improved descriptive content and formatting of Far error messages Improved build when configured to include no GPU specific code Bug Fixes Fixed handling of unconnected vertices to avoid out of bounds data access Fixed non-zero starting offsets for TbbEvalStencils and OmpEvalStencils Fixed FarStencilTableFactoryOptionsfactorizeIntermediateLevels Fixed FarPatchTablesFactoryOptionsgenerateAllLevels Fixed the behavior of VTX_BOUNDARY_NONE for meshes with bilinear scheme Fixed some template method specializations which produced duplicate definitions Disabled depth buffering when drawing the UI in the example viewers Disabled the fractional tessellation spacing option in example viewers since this mode is currently not supported Release 3.0.0 - Jun 2015 Release 3.0.0 is a major release with many significant improvements and changes. For more information on the following, please see Release 3.0 New Features Faster subdivision using less memory Support for non-manifold topology Face-Varying data specified topologically Elimination of fixed valence tables Single-crease patch for semi-sharp edges Additional irregular patch approximations Introduction of Stencil Tables Faster, simpler GPU kernels Unified adaptive shaders Updated coding style with namespaces More documentation and tutorials Bug Fixes Smooth Face-Varying interpolation around creases Release 3.0.0 RC2 New Features Documentation updates far_tutorial_3 updates for the multiple face-varying channels maya example plugin interpolates a UV channel and a vertex color channel Bug Fixes Fixed a LimitStencilTableFactory bug, which returns an invalid table PatchParam encoding changed to support refinement levels up to 10 Added Xinerama link dependency Fixed MSVC 32bit build problem Fixed minor cmake issues Fixed glViewerfarViewer stability bugs Release 3.0.0 RC1 Changes FarTopologyRefiner was split into several classes to clarify and focus the API. Interpolation of Vertex and Varying primvars in a single pass is no longer supported. The Osd layer was largely refactored. Previous 2.x Release Notes Previous releases Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"Subdivision Surfaces\",\n+ \"text\": \"Subdivision Surfaces Subdivision Surfaces 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Overview Piecewise Parametric Surfaces Parametric Patches Piecewise Surfaces Arbitrary Topology Regular versus Irregular Features Non-manifold Topology Subdivision versus Tessellation Subdivision Tessellation Which to Use Mesh Data and Topology Separating Data from Topology Vertex and Varying Data Face-Varying Data and Topology Schemes and Options Subdivision Schemes Boundary Interpolation Rules Face-varying Interpolation Rules Semi-Sharp Creases Other Options Chaikin Rule Triangle Subdivision Rule Overview Subdivision surfaces are a common modeling primitive that has gained popularity in animation and visual effects over the past decades. As the name suggests, subdivision surfaces are fundamentally surfaces . More specifically, subdivision surfaces are piecewise parametric surfaces defined over meshes of arbitrary topology -- both concepts that will be described in the sections that follow. Subdivision is both an operation that can be applied to a polygonal mesh to refine it, and a mathematical tool that defines the underlying smooth surface to which repeated subdivision of the mesh converges. Explicit subdivision is simple to apply some number of times to provide a smoother mesh, and that simplicity has historically lead to many tools representing the shape this way. In contrast, deriving the smooth surface that ultimately defines the shape -- its limit surface -- is considerably more complex but provides greater accuracy and flexibility. These differences have led to confusion in how some tools expose subdivision surfaces. The ultimate goal is to have all tools use subdivision surfaces as true surface primitives. The focus here is therefore less on subdivision and more on the nature of the surface that results from it. In addition to providing a consistent implementation of subdivision -- one that includes a number of widely used feature extensions -- a significant value of OpenSubdiv is that it makes the limit surface more accessible. Since its introduction, OpenSubdiv has received interest from users and developers with a wide variety of skills, interests and backgrounds. This document is intended to present subdivision surfaces from a perspective helpful in making use of OpenSubdiv. One purpose it serves is to provide a high level overview for those with less experience with the algorithms or mathematics of subdivision. The other is to provide an overview of the feature set available with OpenSubdiv, and to introduce those capabilities with the terminology used by OpenSubdiv as much of it is overloaded. Piecewise Parametric Surfaces Piecewise parametric surfaces are arguably the most widely used geometric representation in industrial design, entertainment and many other areas. Many of the objects we deal with everyday -- cars, mobile phones, laptops -- were all designed and visualized first as piecewise parametric surfaces before those designs were approved and pursued. Piecewise parametric surfaces are ultimately just collections of simpler modeling primitives referred to as patches. Patches constitute the pieces of the larger surface in much the same way as a face or polygon constitutes a piece of a polygonal mesh. Parametric Patches Patches are the building blocks of piecewise smooth surfaces, and many different kinds of patches have evolved to meet the needs of geometric modeling. Two of the more effective and common patches are illustrated below Single bicubic B-Spline patch Single bicubic Bezier patch Patches consist of a set of points or vertices that affect a rectangular piece of smooth surface triangular patches also exist. That rectangle is parameterized in its two directions, transforming a simple 2D rectangle into the 3D surface u,v 2D domain of a patch Mapping from u,v to x,y,z The points that control the shape of the surface are usually referred to as control points or control vertices, and the collection of the entire set defining a patch as the control mesh, the control hull, the control cage or simply the hull, the cage, etc. For the sake of brevity we will frequently use the term cage, which serves us more generally later. So a patch essentially consist of two entities its control points and the surface affected by them. The way the control points affect the surface is what makes the different types of patches unique. Even patches defined by the same number of points can have different behavior. Note that all 16 points of the B-Spline patch above are relatively far from the surface they define compared to the similar Bezier patch. The two patches in that example actually represent exactly the same piece of surface -- each with a set of control points having different effects on it. In mathematical terms, each control point has a basis function associated with it that affects the surface in a particular way when only that point is moved Bicubic B-Spline basis function Bicubic Bezier basis funciton It is these basis functions that often give rise to the names of the different patches. There are pros and cons to these different properties of the control points of patches, which become more apparent as we assemble patches into piecewise surfaces. Piecewise Surfaces Piecewise parametric surfaces are collections of patches. For rectangular patches, one of the simplest ways to construct a collection is to define a set of patches using a rectangular grid of control points Piecewise B-Spline surface Piecewise Bezier surface Note that we can overlap the points of adjacent B-spline patches. This overlapping means that moving one control point affects multiple patches -- but it also ensures that those patches always meet smoothly this was a design intention and not true for other patch types. Adjacent Bezier patches only share points at their boundaries and coordinating the points across those boundaries to keep the surface smooth is possible, but awkward. This makes B-splines a more favorable surface representation for interactive modeling, but Bezier patches serve many other useful purposes. A more complicated B-spline surface Part of a more complicated B-Spline surface Just as a patch consisted of a cage and a surface, the same is now true of the collection. The control cage is manipulated by a designer and the surface of each of the patches involved is displayed so they can assess its effect. Arbitrary Topology Piecewise surfaces discussed thus far have been restricted to collections of patches over regular grids of control points. There is a certain simplicity with rectangular parametric surfaces that is appealing, but a surface representation that supports arbitrary topology has many other advantages. Rectangular parametric surfaces gained widespread adoption despite their topological limitations, and their popularity continues today in some areas. Complex objects often need many such surfaces to represent them and a variety of techniques have evolved to assemble them effectively, including stitching multiple surfaces together or cutting holes into them trimming. These are complicated techniques, and while effective in some contexts e.g. industrial design they become cumbersome in others e.g. animation and visual effects. A single polygonal mesh can represent shapes with far more complexity than a single rectangular piecewise surface, but its faceted nature eventually becomes a problem. Subdivision surfaces combine the topological flexibility of polygonal meshes with the underlying smoothness of piecewise parametric surfaces. Just as rectangular piecewise parametric surfaces have a collection of control points its cage stored as a grid and an underlying surface, subdivision surfaces also have a collection of control points its cage stored as a mesh and an underlying surface often referred as its limit surface. Regular versus Irregular Features A mesh contains the vertices and faces that form the cage for the underlying surface, and the topology of that mesh can be arbitrarily complex. In areas where the faces and vertices of the mesh are connected to form rectangular grids, the limit surface becomes one of the rectangular piecewise parametric surfaces previously mentioned. These regions of the mesh are said to be regular they provide behavior familiar from the use of similar rectangular surfaces and their limit surface is relatively simple to deal with. All other areas are considered irregular they provide the desired topological flexibility and so are less familiar and less predictable in some cases and their limit surface can be much more complicated. Irregular features come in a number of forms. The most widely referred to is an extra-ordinary vertex, i.e. a vertex which, in the case of a quad subdivision scheme like Catmull-Clark, does not have four incident faces. Irregular vertex and incident faces Regular and irregular regions of the surface The presence of these irregular features makes the limit surface around them similarly irregular, i.e. it cannot be represented as simply as it can for regular regions. Its worth noting that irregular regions shrink in size and become more isolated as subdivision is applied. A face with a lot of extra-ordinary vertices around it makes for a very complicated surface, and isolating these features is a way to help deal with that complexity Two valence-5 vertices nearby Isolation subdivided once Isolation subdivided twice Its generally necessary to perform some kind of local subdivision in these areas to break these pieces of surface into smaller, more manageable pieces, and the term feature adaptive subdivision has become popular in recent years to describe this process. Whether this is done explicitly or implicitly, globally or locally, what matters most is that there is an underlying piece of limit surface for each face -- albeit a potentially complicated one at an irregular feature -- that can be evaluated in much the same way as rectangular piecewise surfaces. Patches of the regular regions Patches of the irregular region While supporting a smooth surface in these irregular areas is the main advantage of subdivision surfaces, both the complexity of the resulting surfaces and their quality are reasons to use them with care. When the topology is largely irregular, there is a higher cost associated with its surface, so minimizing irregularities is advantageous. And in some cases the surface quality, i.e. the perceived smoothness, of the irregular surfaces can lead to undesirable artefacts. An arbitrary polygonal mesh will often not make a good subdivision cage, regardless of how good that polygonal mesh appears. As with rectangular piecewise parametric surfaces, the cage should be shaped to affect the underlying surface it is intended to represent. See Modeling Tips for related recommendations. Non-manifold Topology Since the cage of a subdivision surface is stored in a mesh, and often manipulated in the same context as polygonal meshes, the topic of manifold versus non-manifold topology warrants some attention. There are many definitions or descriptions of what distinguishes a manifold mesh from one that is not. These range from concise but abstract mathematical definitions to sets of examples showing manifold and non-manifold meshes -- all have their value and an appropriate audience. The following is not a strict definition but serves well to illustrate most local topological configurations that cause a mesh to be non-manifold. Consider standing on the faces of a mesh and walking around each vertex in turn. Assuming a right-hand winding order of faces, stand on the side of the face in the positive normal direction. And when walking, step across each incident edge in a counter-clockwise direction to the next incident face. For an interior vertex start at the corner of any incident face walk around the vertex across each incident edge to the next unvisited face repeat if you arrive back where you started and any incident faces or edges were not visited, the mesh is non-manifold Similarly, for a boundary vertex start at the corner of the face containing the leading boundary edge walk around the vertex across each incident edge to the next unvisited face repeat if you arrive at another boundary edge and any incident faces or edges were not visited, the mesh is non-manifold If you can walk around all vertices this way and dont encounter any non-manifold features, the mesh is likely manifold. Obviously if a vertex has no faces, there is nothing to walk around and this test cant succeed, so it is again non-manifold. All of the faces around a vertex should also be in the same orientation, otherwise two adjacent faces have normals in opposite directions and the mesh will be considered non-manifold, so we should really include that constraint when stepping to the next face to be more strict. Consider walking around the indicated vertices of the following non-manifold meshes Edges with 2 incident faces Faces sharing a vertex but no edges As mentioned earlier, many tools do not support non-manifold meshes, and in some contexts, e.g. 3D printing, they should be strictly avoided. Sometimes a manifold mesh may be desired and enforced as an end result, but the mesh may temporarily become non-manifold due to a particular sequence of modeling operations. Rather than supporting or advocating the use of non-manifold meshes, OpenSubdiv strives to be robust in the presence of non-manifold features to simplify the usage of its clients -- sparing them the need for topological analysis to determine when OpenSubdiv can or cannot be used. Although subdivision rules are not as well standardized in areas where the mesh is not manifold, OpenSubdiv provides simple rules and a reasonable limit surface in most cases. Surface around edges with 2 incident faces Surface for faces sharing a vertex but no edges As with the case of regular versus irregular features, since every face has a corresponding piece of surface associated with it -- whether locally manifold or not -- the term arbitrary topology can be said to include non-manifold topology. Subdivision versus Tessellation The preceding sections illustrate subdivision surfaces as piecewise parametric surfaces of arbitrary topology. As piecewise parametric surfaces, they consist of a cage and the underlying surface defined by that cage. Two techniques used to display subdivision surfaces are subdivision and tessellation. Both have their legitimate uses, but there is an important distinction between them subdivision operates on a cage and produces a refined cage tessellation operates on a surface and produces a discretization of that surface The existence and relative simplicity of the subdivision algorithm makes it easy to apply repeatedly to approximate the shape of the surface, but with the result being a refined cage, that approximation is not always very accurate. When compared to a cage refined to a different level, or a tessellation that uses points evaluated directly on the limit surface, the discrepancies can be confusing. Subdivision Subdivision is the process that gives subdivision surfaces their name, but it is not unique to them. Being piecewise parametric surfaces, lets first look at subdivision in the context of the simpler parametric patches that comprise them. Subdivision is a special case of refinement , which is key to the success of some of the most widely used types of parametric patches and their aggregate surfaces. A surface can be refined when an algorithm exists such that more control points can be introduced while keeping the shape of the surface exactly the same . For interactive and design purposes, this allows a designer to introduce more resolution for finer control without introducing undesired side effects in the shape. For more analytical purposes, it allows the surface to be broken into pieces, often adaptively, while being faithful to the original shape. One reason why both B-spline and Bezier patches are so widely used is that both of them can be refined. Uniform subdivision -- the process of splitting each of the patches in one or both of its directions -- is a special case of refinement that both of these patch types support B-Spline surface and its cage Cage subdivided 1x Cage subdivided 2x In the cases illustrated above for B-Splines, the uniformly refined cages produce the same limit surface as the original granted in more pieces. So it is fair to say that both uniform B-splines and Bezier surfaces are subdivision surfaces. The limit surface remains the same with the many more control points roughly 4x with each iteration of subdivision, and those points are closer to but not on the surface. It may be tempting to use these new control points to represent the surface, but using the same number of points evaluated at corresponding uniformly spaced parametric locations on the surface is usually simpler and more effective. Note also that points of the cage typically do not have any normal vectors associated with them, though we can evaluate normals explicitly for arbitrary locations on the surface just as we do for position. So if displaying a cage as a shaded surface, normal vectors at each of the control points must be contrived. Both the positions and normals of the points on the finer cage are therefore both approximations. For more general subdivision surfaces, the same is true. Subdivision will refine a mesh of arbitrary topology, but the resulting points will not lie on the limit surface and any normal vectors contrived from and associated with these points will only be approximations to those of the limit surface. Tessellation There is little need to use subdivision to approximate a parametric surface when it can be computed directly, i.e. it can be tessellated. We can evaluate at arbitrary locations on the surface and connect the resulting points to form a tessellation -- a discretization of the limit surface -- that is far more flexible than the results achieved from uniform subdivision Uniform 3x3 tessellation of B-spline surface Curvature-adaptive tessellation of B-spline surface For a simple parametric surface, the direct evaluation of the limit surface is also simple, but for more complicated subdivision surfaces of arbitrary topology, this is less the case. The lack of a clear understanding of the relationship between the limit surface and the cage has historically lead to many applications avoiding tessellation. Its worth mentioning that subdivision can be used to generate a tessellation even when the limit surface is not available for direct evaluation. The recursive nature of subdivision does give rise to formulae that allow a point on the limit surface to be computed that corresponds to each point of the cage. This process is often referred to as snapping or pushing the points of the cage onto the limit surface. Subdivided 1x and snapped to limit surface Subdivided 2x and snapped to limit surface Since the end result is a connected set of points on the limit surface, this forms a tessellation of the limit surface, and we consider it a separate process to subdivision though it does make use of it. The fact that such a tessellation might have been achieved using subdivision is indistinguishable from the final result -- the same tessellation might just as easily have been generated by evaluating limit patches of the cage uniformly 2x, 4x, 8x, etc. along each edge. Which to Use Subdivision is undeniably useful in creating finer cages to manipulate the surface, but tessellation is preferred for displaying the surface when the patches are available for direct evaluation. There was a time when global refinement was pursued in limited circles as a way of rapidly evaluating parametric surfaces along isoparametric lines, but patch evaluation, i.e. tessellation, generally prevails. Considerable confusion has arisen due the way the two techniques have been employed and presented when displaying the shape in end-user applications. One can argue that if an application displays a representation of the surface that is satisfactory for its purposes, then it is not necessary to burden the user with additional terminology and choices. But when two representations of the same surface differ considerably between two applications, the lack of any explanation or control leads to confusion. As long as applications make different choices on how to display the surface, we seek a balance between simplicity and control. Since subdivided points do not lie on the limit surface, it is important to make it clear to users when subdivision is being used instead of tessellation. This is particularly true in applications where the cage and the surface are displayed in the same style as there is no visual cue for users to make that distinction. Mesh Data and Topology The ability of subdivision surfaces to support arbitrary topology leads to the use of meshes to store both the topology of the cage and the data values associated with its control points, i.e. its vertices. The shape of a mesh, or the subdivision surface that results from it, is a combination of the topology of the mesh and the position data associated with its vertices. When dealing with meshes there are advantages to separating the topology from the data, and this is even more important when dealing with subdivision surfaces. The shape referred to above is not just the shape of the mesh the cage in this case but could be the shape of a refined cage or the limit surface. By observing the roles that both the data and topology play in operations such as subdivision and evaluation, significant advantages can be gained by managing data, topology and the associated computations accordingly. While the main purpose of subdivision surfaces is to use position data associated with the vertices to define a smooth, continuous limit surface, there are many cases where non-positional data is associated with a mesh. That data may often be interpolated smoothly like position, but often it is preferred to interpolate it linearly or even make it discontinuous along edges of the mesh. Texture coordinates and color are common examples here. Other than position, which is assigned to and associated with vertices, there are no constraints on how arbitrary data can or should be associated or interpolated. Texture coordinates, for example, can be assigned to create a completely smooth limit surface like the position, linearly interpolated across faces, or even made discontinuous between them. There are, however, consequences to consider -- both in terms of data management and performance -- which are described below as the terminology and techniques used to achieve each are defined. Separating Data from Topology While the topology of meshes used to store subdivision surfaces is arbitrarily complex and variable, the topology of the parametric patches that make up its limit surface are simple and fixed. Bicubic B-Spline and Bezier patches are both defined by a simple 4x4 grid of control points and a set of basis functions for each point that collectively form the resulting surface. For such a patch, the position at a given parametric location is the result of the combination of position data associated with its control points and the weights of the corresponding basis functions weights being the values of basis functions evaluated at a parametric location. The topology and the basis functions remain the same, so we can make use of the weights independent of the data. If the positions of the control points change, we can simply recombine the new position data with the weights that we just used and apply the same combination. The fixed topology of a parametric patch and two shapes resulting from two sets of positions. Similarly, for a piecewise surface, the position at a given parametric location is the result of the single patch containing that parametric location evaluated at the given position. The control points involved are the subset of control points associated with that particular patch. If the topology of the surface is fixed, so too is the topology of the collection of patches that comprise that surface. If the positions of those control points change, we can recombine the new position data with the same weights for the subset of points associated with the patch. More complex but fixed topology of a surface and two shapes resulting from two sets of positions. This holds for a piecewise surface of arbitrary topology. Regardless of how complex the topology, as long as it remains fixed i.e. relationships between vertices, edges and faces does not change or anything other settings affecting subdivision rules, the same techniques apply. This is just one example of the value of separating computations involving topology from those involving the data. Both subdivision and evaluation can be factored into steps involving topology computing the weights and combining the data separately. Three shapes resulting from three sets of positions for a mesh of fixed topology. When the topology is fixed, enormous savings are possible by pre-computing information associated with the topology and organizing the data associated with the control points in a way that can be efficiently combined with it. This is key to understanding some of the techniques used to process subdivision surfaces. For a mesh of arbitrary topology, the control points of the underlying surface are the vertices, and position data associated with them is most familiar. But there is nothing that requires that the control points of a patch have to represent position -- the same techniques apply regardless of the type of data involved. Vertex and Varying Data The most typical and fundamental operation is to evaluate a position on the surface, i.e. evaluate the underlying patches of the limit surface using the x,y,z positions at the vertices of the mesh. Given a parametric u,v location on one such patch, the data-independent evaluation method first computes the weights and then combines the x,y,z vertex positions resulting in an x,y,z position at that location. But the weights and their combination can be applied to any data at the vertices, e.g. color, texture coordinates or anything else. Data associated with the vertices that is interpolated this way, including position, is said to be vertex data or to have vertex interpolation. Specifying other data as vertex data will result in it being smoothly interpolated in exactly the same way using exactly the same weights as the position. So to capture a simple 2D projection of the surface for texture coordinates, 2D values matching the x,y of the positions would be used. If linear interpolation of data associated with vertices is desired instead, the data is said to be varying data or to have varying interpolation. Here the non-linear evaluation of the patches defining the smooth limit surface is ignored and weights for simple linear interpolation are used. This is a common choice for texture coordinates as evaluation of texture without the need of bicubic patches is computationally cheaper. The linear interpolation will not capture the smoothness required of a true projection between the vertices, but both vertex and varying interpolation have their uses. Projected texture smoothly interpolated from vertex data Projected texture linearly interpolated from varying data Since both vertex and varying data is associated with vertices a unique value assigned to each, the resulting surface will be continuous -- piecewise smooth in the case of vertex data and piecewise linear in the case of varying. Face-Varying Data and Topology In order to support discontinuities in data on the surface, unlike vertex and varying data, there must be multiple values associated with vertices, edges andor faces, in order for a discontinuity to exist. Discontinuities are made possible by assigning values to the corners of faces, similar to the way in which vertices are assigned to the corners of faces when defining the topology of the mesh. Recalling the assignment of vertices to faces Vertex indices are assigned to all corners of each face as part of mesh construction and are often referred to as the face-vertices of an individual face or the mesh. All face-vertices that share the same vertex index will be connected by that vertex and share the same vertex data associated with it. By assigning a different set of indices to the face-vertices -- indices not referring to the vertices but some set of data to be associated with the corners of each face -- corners that share the same vertex no longer need to share the same data value and the data can be made discontinuous between faces This method of associating data values with the face-vertices of the mesh is said to be assigning face-varying data for face-varying interpolation. An interpolated value will vary continuously within a face i.e. the patch of the limit surface associated with the face but not necessarily across the edges or vertices shared with adjacent faces. Disjoint face-varying UV regions applied to the limit surface The combination of associating data values not with the vertices the control points but the face corners, and the resulting data-dependent discontinuities that result, make this a considerably more complicated approach than vertex or varying. The added complexity of the data alone is reason to only use it when necessary, i.e. when discontinuities are desired and present. Part of the complexity of dealing with face-varying data and interpolation is the way in which the interpolation behavior can be defined. Where the data is continuous, the interpolation can be specified to be as smooth as the underlying limit surface of vertex data or simply linear as achieved with varying data. Where the data is discontinuous -- across interior edges and around vertices -- the discontinuities create boundaries for the data, and partition the underlying surface into disjoint regions. The interpolation along these boundaries can also be specified as smooth or linear in a number of ways many of which have a historical basis. A more complete description of the different linear interpolation options with face-varying data and interpolation is given later. These options make it possible to treat the data as either vertex or varying, but with the added presence of discontinuities. An essential point to remember with face-varying interpolation is that each set of data is free to have its own discontinuities -- this leads to each data set having both unique topology and size. The topology specified for a collection of face-varying data is referred to as a channel and is unique to face-varying interpolation. Unlike vertex and varying interpolation, which both associate a data value with a vertex, the number of values in a face-varying channel is not fixed by the number of vertices or faces. The number of indices assigned to the face-corners will be the same for all channels, but the number of unique values referred to by these indices may not. We can take advantage of the common mesh topology in areas where the data is continuous, but we lose some of those advantages around the discontinuities. This results in the higher complexity and cost of a face-varying channel compared to vertex or varying data. If the topology for a channel is fixed, though, similar techniques can be applied to factor computation related to the topology so that changes to the data can be processed efficiently. Schemes and Options While previous sections have described subdivision surfaces in more general terms, this section describes a number of common variations often referred to as extensions to the subdivision algorithms and the ways that they are represented in OpenSubdiv. The number and nature of the extensions here significantly complicate what are otherwise fairly simple subdivision algorithms. Historically applications have supported either a subset or have had varying implementations of the same feature. OpenSubdiv strives to provide a consistent and efficient implementation of this feature set. Given the varying presentations of some of these features elsewhere, the naming chosen by OpenSubdiv is emphasized here. Subdivision Schemes OpenSubdiv provides two well known subdivision surface types -- Catmull-Clark often referred to more tersely as Catmark and Loop subdivision. Catmull-Clark is more widely used and suited to quad-dominant meshes, while Loop is preferred for and requires purely triangulated meshes. The many examples from previous sections have illustrated the more popular Catmull-Clark scheme. For an example of Loop Boundary Interpolation Rules Boundary interpolation rules control how subdivision and the limit surface behave for faces adjacent to boundary edges and vertices. The following choices are available via the enumeration SdcOptionsVtxBoundaryInterpolation Mode Behavior VTX_BOUNDARY_NONE No boundary edge interpolation is applied by default boundary faces are tagged as holes so that the boundary vertices continue to support the adjacent interior faces, but no surface corresponding to the boundary faces is generated boundary faces can be selectively interpolated by sharpening all boundary edges incident the vertices of the face VTX_BOUNDARY_EDGE_ONLY A sequence of boundary vertices defines a smooth curve to which the limit surface along boundary faces extends VTX_BOUNDARY_EDGE_AND_CORNER Similar to edge-only but the smooth curve resulting on the boundary is made to interpolate corner vertices vertices with exactly one incident face On a grid example In practice, it is rare to use no boundary interpolation at all -- this feature has its uses in allowing separate meshes to be seamlessly joined together by replicating the vertices along boundaries, but these uses are limited. Given the global nature of the setting, it is usually preferable to explicitly make the boundary faces holes in the areas where surfaces from separate meshes are joined, rather than sharpening edges to interpolate the desired boundaries everywhere else. The remaining edge only and edge and corner choices are then solely distinguished by whether or not the surface at corner vertices is smooth or sharp. Face-varying Interpolation Rules Face-varying interpolation rules control how face-varying data is interpolated both in the interior of face-varying regions smooth or linear and at the boundaries where it is discontinuous constrained to be linear or pinned in a number of ways. Where the topology is continuous and the interpolation chosen to be smooth, the behavior of face-varying interpolation will match that of the vertex interpolation. Choices for face-varying interpolation are most commonly available in the context of UVs for texture coordinates and a number of names for such choices have evolved in different applications over the years. The choices offered by OpenSubdiv cover a wide range of popular applications. The feature is named face-varying linear interpolation -- rather than boundary interpolation commonly used -- to emphasize that it can be applied to the entire surface not just boundaries and that the effects are to make the surface behave more linearly in various ways. The following choices are available for the SdcOptionsFVarLinearInterpolation enum -- the ordering here applying progressively more linear constraints Mode Behavior FVAR_LINEAR_NONE smooth everywhere the mesh is smooth FVAR_LINEAR_CORNERS_ONLY linearly interpolate sharpen or pin corners only FVAR_LINEAR_CORNERS_PLUS1 CORNERS_ONLY sharpening of junctions of 3 or more regions FVAR_LINEAR_CORNERS_PLUS2 CORNERS_PLUS1 sharpening of darts and concave corners FVAR_LINEAR_BOUNDARIES linear interpolation along all boundary edges and corners FVAR_LINEAR_ALL linear interpolation everywhere boundaries and interior These rules cannot make the interpolation of the face-varying data smoother than that of the vertices. The presence of sharp features of the mesh created by sharpness values, boundary interpolation rules, or the subdivision scheme itself e.g. Bilinear take precedence. All face-varying interpolation modes illustrated in UV space using a simple 4x4 grid of quads segmented into three UV regions their control point locations implied by interpolation in the FVAR_LINEAR_ALL case For those familiar, this shape and its assigned UV sets are available for inspection in the catmark_fvar_bound1 shape of OpenSubdivs example and regression shapes. Semi-Sharp Creases Just as some types of parametric surfaces support additional shaping controls to affect creasing along the boundaries between surface elements, OpenSubdiv provides additional sharpness values or weights associated with edges and vertices to achieve similar results over arbitrary topology. Setting sharpness values to a maximum value 10 in this case -- a number chosen for historical reasons effectively modifies the subdivision rules so that the boundaries between the piecewise smooth surfaces are infinitely sharp or discontinuous. But since real world surfaces never really have infinitely sharp edges, especially when viewed sufficiently close, it is often preferable to set the sharpness lower than this value, making the crease semi-sharp. A constant weight value assigned to a sequence of edges connected edges therefore enables the creation of features akin to fillets and blends without adding extra rows of vertices though that technique still has its merits Sharpness values range from 0-10, with a value of 0 or less having no effect on the surface and a value of 10 or more making the feature completely sharp. It should be noted that infinitely sharp creases are really tangent discontinuities in the surface, implying that the geometric normals are also discontinuous there. Therefore, displacing along the normal will likely tear apart the surface along the crease. If you really want to displace a surface at a crease, it may be better to make the crease semi-sharp. Other Options While the preceding options represent features available in a wide-variety of tools and modeling formats, a few others exist whose recognition and adoption is more limited. In some cases, they offer improvements to undesirable behavior of the subdivision algorithms, but their effects are less than ideal. Given both their limited effectiveness and lack of recognition, these options should be used with caution. Chaikin Rule The Chaikin Rule is a variation of the semi-sharp creasing method that attempts to improve the appearance of creases along a sequence of connected edges when the sharpness values differ. This choice modifies the subdivision of sharpness values using Chaikins curve subdivision algorithm to consider all sharpness values of edges around a common vertex when determining the sharpness of child edges. The creasing method can be set using the values defined in the enumeration SdcOptionsCreasingMethod Mode Behavior CREASE_UNIFORM Apply regular semi-sharp crease rules CREASE_CHAIKIN Apply Chaikin semi-sharp crease rules Example of contiguous semi-sharp creases interpolation Triangle Subdivision Rule The triangle subdivision rule is a rule added to the Catmull-Clark scheme that modifies the behavior at triangular faces to improve the undesirable surface artefacts that often result in such areas. Mode Behavior TRI_SUB_CATMARK Default Catmark scheme weights TRI_SUB_SMOOTH Smooth triangle weights Cylinder example This rule was empirically determined to make triangles subdivide more smoothly. However, this rule breaks the nice property that two separate meshes can be joined seamlessly by overlapping their boundaries i.e. when there are triangles at either boundary, it is impossible to join the meshes seamlessly Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"release_notes.html\"\n+ \"loc\": \"subdivision_surfaces.html\"\n }, {\n \"title\": \"Release Notes\",\n \"text\": \"Release Notes Release Notes 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 2.6.0 Release 2.5.1 Release 2.5.0 Release 2.4.1 Release 2.4.0 Release 2.3.5 Release 2.3.4 Release 2.3.3 Release 2.3.2 Release 2.3.1 Release 2.3.0 Release 2.2.0 Release 2.1.0 Release 2.0.1 Release 2.0.0 Release 1.2.4 Release 1.2.3 Release 1.2.2 Release 1.2.1 Release 1.2.0 Release 1.1.0 Release 1.0.0 Release 2.6.0 New Features Add subdivision kernels for ARM NEON Add OsdUtilVertexSplit which creates a vertex-varying data table by duplicating vertices in a FarMesh Add basic functions to work with FV data via evaluator API Changes Added Catmark restricted vertex compute kernels that optimize for vertices with no semi-sharp creases Fix accessor omissions in osdmesh.h Add support for different subdivision schemes for OsdUtilMesh Bug Fixes Fix crashes when using rather low-end cards like Intel ones Fix a bug in the creation of an edge-vertex kernel batch Fix mismatch in declaration and usage of OsdCudaComputeRestrictedVertexA Fix a bug in the vertex order for restricted Catmark vertex-vertex kernel batches Fix a bug in FarCatmarkSubdivisionTablesFactory that prevented the CATMARK_QUAD_FACE_VERTEX kernel from being selected for subdivision level 2 or greater. Fix a bug in OsdUtilVertexSplit that occurs when getting the address of the end of a stdvector Fix error in createCLBuffer that occurs when the buffer size is zero Fix a bug in the CUDA computeRestrictedEdge kernel Fix duplicate variables with identical name Fix osdutil build errors Fix cmake diagnostic messsage Release 2.5.1 New Features Add CATMARK_QUAD_FACE_VERTEX and CATMARK_TRI_QUAD_FACE_VERTEX compute kernels optimization that takes advantage of all-quads or all-triange-and-quads meshes Bug Fixes Fix a compiler error in the GLSL Transform Feedback kernels on OS X Fix boundary interpolation in osdutil Fix bilinear stencil tangent computions Release 2.5.0 New Features Add ability to generate triangle patches for a uniformly subdivided mesh Add new example topologySharing Add interleaved buffer mode in glViewer Add GLSL compute kernel to glBatchViewer Add TBB compute kernel to glBatchViewer Add a PullDown widget to our HUD in examplescommon GUI updates cosmetic changes to GL example code Adding a programmable image shader to gl_hud Code cleanup for GLFrameBuffer in examplescommon Implement C-API accessor to evaluator topology osdutil Add command line option to CMakes options Add a CMake option to disable OpenCL Add a FindCLEW.cmake module in anticipation of using CLEW as a dependency Integrate CLEW into osd library and examples Changes Change interleaved buffer support in OsdCompute Removed OsdVertexDescriptor and replaced with OsdVertexBufferDescriptor Reorganize ComputeContext and ComputeController. Reorganize EvalStencilContext and EvalStencilController Moved transient states current vertex buffer etc to controller Reorganize EvalLimitContext and EvalLimitController Moved transient states current vertex buffer etc to controller Fix adaptive isolation of sharp corner vertices Fix incorrect FarMeshFactory logic for isolating multiple corner vertices in corner patches Change EvalLimit Gregory patch kernels to the large weights table to accomodate higher valences Fix calculation of screen space LOD tess factors for transition corner patches. Add a public constructor to OsdMesh Decrease compiler warning thresholds and fix outstanding warnings Make PTex support optional Add a NO_MAYA flag to CMakeLists to disable all Autodesk Maya dependencies in the build Document NO_MAYA command line option Bug Fixes Fix mistakenly deleted memory barrier in glsl OsdCompute kernel. Fix shape_utils genRIB function to use streams correctly. Temporary workaround for the synchronization bug of glsl compute kernel Fix Hud display for higher DPI MBP retina Fix Hud d3d11 Fix examples to use GL timer query to measure the GPU draw timing more precisely Fix glViewer stop updating during freeze. Fix file permissions on farPatchTablesFactory.h Fix some meory leaks in adaptive evaluator osdutil Fix OsdUtilAdaptiveEvaluator concurrency issue Fix OsdUtilRefiner incorrect Invalid size of patch array error reporting. Fix OsdUtilPatchPartitioner failure for triangle patches Fixes a bug that causes OsdUtilPatchPartitioner to fail to rebuild the face-varying data table correctly for triangle patches. Add missing third parameter to templated OsdDrawContext usage osdutilbatch.h Return success status from openSubdiv_finishEvaluatorDescr osdutil Remove debugging stdcout calls osdutil Build errors warnings Fix OSX Core Profile build GLFrameBuffer Fix ptexViewer build error on OSX Fix framebuffer shader compiling for OSX Reordering includes to address a compile error on OSXglew environment Fix compilation errors with CLEW enabled Fix icc build problems Fix compiler warnings in OsdClVertexBuffer Fix compilation error on windowsmsvc2013 Fix build warningserrors with VS2010 Pro Fix Windows build warning in FarPatchTablesFactory Fix doxygen generation errors Release 2.4.1 Changes Add correct OpenSubdiv namespace beginend blocks. Bug Fixes Compile osdutil with -fPIC for correct linking. Fix a bug of OsdUtilMeshBatch, the varying buffer isnt computed with CL kernels Fix FindGLFW.cmake to use the GLFW_LOCATION environment variable in Windows Fix Draw contexts do not fully initialize patch arrays Release 2.4.0 New Features Adding functionality to store uniform face-varying data across multiple levels of subdivision Add OsdUtilPatchPartitioner. It splits patcharray into subsets so that clients can draw partial surfaces for both adaptive and uniform. Changes Remove FarMesh dependency from OsdContext. Use DSA APIs for GL buffer update if available. Refactor Far API replace void- of all kernel applications with CONTEXT template parameter. It eliminates many static_casts from void- for both far and osd classes. move the big switch-cases of far default kernel launches out of Refine so that osd controllers can arbitrary mix default kernels and custom kernels. change FarKernelBatchkernelType from enum to int, clients can add custom kernel types. remove a back-pointer to farmesh from subdivision table. untemplate all subdivision table classes and template their compute methods instead. Those methods take a typed vertex storage. remove an unused argument FarMesh from the constructor of subdivision table factories. Refactor FarSubdivisionTables. Delete scheme specialized subdivision tables. The base class FarSubdivisionTables already has all tables, so we just need scheme enum to identify which scheme the subdivision tables belong to. This brings a lot of code cleanups around far factory classes. Move FarMultiMeshFactory to OsdUtil. Move table splicing functions of FarMultiMeshFactory into factories Change PxOsdUtil prefix to final OsdUtil prefix. Improve error reporting in osdutil refinement classes, and fix a build issue Bug Fixes Fix another multi mesh splicing bug of face varying data. Make CMake path variables more robust Fixing a crash on Marvericks wglew Update dxViewer example documentation Fix wrong logic in openSubdiv_setEvaluatorCoarsePositions Remove debug print from adaptive evaluators initialization Release 2.3.5 New Features Add the ability to read obj files to the dxViewer example Add screen-capture function to ptexViewer Update documention for Xcode builds Add documentation boundary interpolation rules and face-varying boundary interpolation rules Changes Refactoring FarPatchTables and FarPatchTablesFactory Move GL vertex buffer VBO buffer allocation out of allocate and into BindVBO Enable uvViewer on OS X now that Mavericks is released. Replacing un-necessary dynamic_cast with reinterpret_cast within FarDispatcher Minor code cleanup of FarMeshFactory Remove address space qualifiers from OpenCL kernel functions Fix OpenCL initialization to be slightly more robust Add OpenCL header include paths where necessary Add static specifiers for non-kernel CL funcs at program scope Add stddef.h to pythonosdosdshim.i Modify ptexViewer and uvViewer shaders to address some portability issues Bug Fixes Fix Gregory Boundary patch buffer overrun Fix black texels when the resolution of a ptex face is less than 4 Fix a splicing bug in FarMultiMeshFactory Fix a build error when using older versions of GLFW Fix build warnings optimized Fix FindTBB.cmake Fix FindMaya.cmake Fix glViewer support for GLSL compute Fix ptexViewer enable specular pass in both IBL and point lighting Fix Zlib include in ptexViewer Fix ptexViewer shader errors. Fix osdPolySmooth Maya plugin Fix UV merging in osdPolySmooth code example Add cleanup function to osdPolySmooth Maya plugin Fix Maya OsdPolySmooth node component output Fix GLSL array instantiation syntax for glStencilViewer Fix examples to run correctly on high DPI displays with GLFW 3 Release 2.3.4 New Features Adding CPUOMPTBB Context Controller pairs for CPU evaluation of smooth normals Added adaptiveEvaluator class inspired by Sergeys work in blender OsdUtil Changes Changed the HUD to ignore mouse clicks when not visible. Updates for blender development OsdUtil Add C compatible API to access the adaptiveEvaluator class from non-C OsdUtil Update license headers to apache OsdUtil CMake build improvement make osd a cmake object library remove compiling redundancies Improve stringification of shaders kernels in CMake build Bug Fixes Fixed iOS build Fixed VS2010 warningserrors. Fix OsdCpuEvalLimitKernel Fix maxvalence calculation in FarMeshFactory Fix FarStencilFactory control stencil caching Removing assert for high-valence vertices running off limit tangent pre-computed table. Fix degenerate stencil limit tangent code path. Fix unused variable build warnings gcc 4.8.2 - Fedora 19 Fix build warning from osdutiladaptiveEvaluator.cpp Release 2.3.3 Changes Modify Far remapping of singular vertices to point to their source vertex. Refactoring Ptex Mipmap and Analytic Displacement code Adding some documentation for Chaikin crease rule Misc. improvements to PxOsdUtilsMesh Adding recommended isolation output to OsdPolySmooth node Bug Fixes Adding an error check on version parsing of main CMakeLists Fix regex in FindMaya.cmake that breaks with recent versions of Maya Fix crashes induced by typeid Fixed VS2010 build warning Fix build break in hbr_regression Fix incorrect capitalization in GL ptexViewer shader.glsl Fix OSX build add stdlib.h include Release 2.3.2 New Features Adding control cage drawing to ptexViewer Adding Maya osdPolySmooth plugin into OpenSubdiv examples. Changes Removing some glGetError checks that are causing problems for Autodesk D3D11DrawRegistry returns the common shader config for all non-tess patcharrays. Updates to simple cpu osdutil classes Bug Fixes Fix Hbr Chaikin crease rule Fix Chaikin tag parsing Fix return value of allocate function for OsdCPUGLVertxBuffer Fixed GLSL shader portability. Fix FindGLFW.cmake for GLFW 3.03 on OSX Fixed compiler warnings. Fixed VS2010 build errors Fixed WIN32 build error when no DXSDK installed. Fix OSX build stdlib.h needs to be included in glPtexMipmapTexture.h Fix for crash in new meshrefiner code in OsdUtil Release 2.3.1 New Features Add DX11 version of ptex mipmap loader Add DX11 ptex viewer work in progress Add DX11 fractional partitioning, normal derivatives computation Add memory usage controls to Ptex loader Add face-varying boundary interpolation parsing to shape_utils Add simple HbrMesh and FarMesh wrapper classes to osdutil Changes Amend language of attribution file NOTICE.txt Optimize a bit of ptex mipmap lookup. Show ptex memory usage in GL and DX11 ptexViewers Improve ptex guttering Addding some video links to our collection of external resources Bug Fixes Fix edge-only face-varying interpolation Fix Far to handle disconnected vertices in an Hbr mesh Fixed ptex cache resource release sequence Fix build symbol conflict in Far Fix patch parambuffer generation in OsdD3D11DrawContext Fix a minor osdutil build warning seen with gcc 4.8.1 Fix VS2010 build errors Release 2.3.0 New Features Added Analytical displacement mapping Analytic Displacement Mapping using Hardware Tessellation Niessner and Loop TOG 2013 Added a new ptex mipmap loader Added face varying macros for loop subdivision Added the uvViewer example to see how face varying interpolation rule works Added a slider component and cleanup hud code. Changes Adding license attribution files, improved language of the code headers Install documentation into the Filesystem Hierarchy Standard location Set GLFW_OPENGL_FORWARD_COMPAT on Mac OS to make samples work on that platform Added surface normal mode mipmap to ptxViewer Bug Fixes Fix a bug of bad fvar splicing for loop surface. Fix incorrect bilinear limit tangents in FarStencilTablesFactory Fix boundary interpolation rules doc Added an error check on updating cuda buffer Fix face varying rendering on loop surface Fixed glBatchViewer build for GLFW 2.x Expand search paths for FindGLFW.cmake for Debian and other Linux architectures Fix CMake executable builds for ICC Fix bhr baseline regression, so reference files are real OBJs Fixed clKernelBundle.cpp to build on Android. Fix misc build warings Release 2.2.0 New Features Added subdivision stencil functionality Far OsdEval Bug Fixes Fix D3D11DrawContext to check for NULL pointers Fix cpuEvalLimitController crash bug Fixed search path suffixes for ICC libs Fixed invalid initialization of glslTransformFeedback kernel. Release 2.1.0 New Features Added TBB Compute back-end on Linux contribution from Sheng Fu Added support for ICC compiler still Beta Changes Added constructor to OsdMesh with a FarMesh as input Modify CMake to name and sym-link DSOs based on Linux ABI versioning spec Added command line input to DX11 viewer FarMultiMesh can splice uniform and adaptive meshes together. Bug Fixes Fix FarMultiMesh splicing Removed unnecessary cudaThreadSynchronize calls. Fix glViewer overlapping HUD menus Fix facevarying rendering in glBatchViewer Fix build of GLSL transform feedback kernels Fix Getting Started documentation Release 2.0.1 New Features New CLA files to reflect Apache 2.0 licensing Changes Move all public headers to includeopensubdiv... Adding Osd documentation based on Siggraph slides Bug Fixes Fix incorrect transition pattern 3 in GLSL HLSL shaders Fix CMake build to not link GPU-based libraries into libosdCPU Fix support for GLEW on OSX Fix GLFW Xrandr xf86vmode dependency paths for X11 based systems Fix HUD display overlaps in code examples Fix FindGLEW.cmake to be aware of multiarch on linux systems Fix some hard-coded include paths in CMake build Release 2.0.0 New Features New CMake build flags NO_LIB, NO_CUDA, NO_PYTHON Changes OpenSubdiv is now under Apache 2.0 license HbrHalfedge and HbrFVarData copy constructors are now private Documentation style matched to graphics.pixar.com new content Add an animation freeze button to ptexViewer Variable name changes for better readability across all example shader code Bug Fixes Fix incorrect patch generation for patches with 2 non-consecutive boundary edges Fix undefined gl_PrimitiveID shader build errors Fix for shader macro OSD_DISPLACEMENT_CALLBACK Fix out-of-bounds stdvector access in FarPatchTablesFactory Release 1.2.4 New Features Adding support for fractional tessellation of patches Adding a much needed API documention system based on Docutils RST markup Adding support for face-varying interpolation in GLSL APIs Adding varying data buffers to OsdMesh Adding accessors to the vertex buffers in OsdGlMesh Adding face-varying data to regression shapes Changes Cleanup of common bicubic patch shader code GLSL HLSL for portability ATI OSX drivers Bug Fixes Fix FarVertexEditTablesFactory to insert properly vertex edit batches fixes incorrect hierarchical hole in regression shape Fix FarPatchMap quadtree to not drop top-level non-quad faces Fix Gregory patches bug with incorrect max-valence Fix FarPatchTablesGetNumFaces and FarPatchTablesGetFaceVertices functions to return the correct values Fix face indexing GLSL code ptex works on non-quads again Fix face-varying data splicing in FarMultiMeshFactory Fix ptex face indexing in FarMultiMeshFactory Fix glew include to not break builds Fix Clang ICC build failures with FarPatchTables Fix build and example code to work with GFLW 3.0 Fix cmake to have ptex dynamically linked in OSX Release 1.2.3 New Features Adding Varying and Face-Varying data interpolation to EvalLimit Changes EvalLimit API refactor the EvalContext now has dedicated structs to track all the vertex, varying and face-varying data streams. Also renamed some buffers into tables to maintain code consistency EvalLimit optimization switch serial indexing to a quad-tree based search Bug Fixes Face-varying data bug fixes making sure the data is carried around appropriately Fixes for OpenCL use with the new batching APIs GLSL general shader code cleanup fixes for better portability GLSL Tranform Feedback initialization fix Critical fix for FarMultiMesh batching indexing was incorrect Fix osdutil CL implementation protect includes on systems with no OpenCL SDK installed Fix face-varying interpolation on adaptive patches FarPatchTables fix IsFeatureAdaptive to return the correct answer Fix Far factories to handle the absence of face-varying data correctly. Many GLSL shader code style fixes which should help with ATI OSX shader compiling Release 1.2.2 New Features Introducing the EvalLimit API the Eval module aims at providing support for computational tasks that are not related to drawing the surfaces. The EvalLimit sub-module provides an API that enables client code to evaluate primitive variables on the limit surface. OsdxxxComputeController minor optimization. Added early exit to Refine method to avoid unnecessary interop. Changes OsdGLDawContext minor API change. Protecting some member variables and adding const accessors OsdError minor API refactor, added Warning functions. Bug Fixes Fix Ptex bug prevent corner texel guttering code to from going into infinite loops Adding the ability for a FarMeshFactory to construct patchTables starting from firstLevel in uniform subdivision mode Consolidating the color coding of bicubic patch types through all our our code examples this is used mostly as a debugging tool Fixing some MSVC build warnings Update to the outdated README.md Release 1.2.1 New Features Added CUDA runtime error checking Release 1.2.0 Changes Major Far refactor around patchTables to introduce the draw batching API Renaming osd_util to osdutil Bug Fixes Fix GLSL transform feedback initialization bug in ptexViewer Minor bug typo fixes Release 1.1.0 New Features release initiated because of the switch to Git Flow Release 1.0.0 Oringal release Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_notes_2x.html\"\n }, {\n- \"title\": \"Overview of Release 3.6\",\n- \"text\": \"Overview of Release 3.6 Overview of Release 3.6 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Modern Graphics APIs and Parallel Computation Updated Third-party APIs and Tools API Additions Additions to OsdPatchShaderSource Osd extensions for patch evaluation from client shaders and compute kernels Other Changes Deprecation Announcements Improvements Bug Fixes New Features The purpose of this release is to address concerns which improve support for current typical use cases and provide support for significant new use cases. Modern Graphics APIs and Parallel Computation OpenSubdiv is organized as a set of components for working with subdivision surface representations, i.e. Bfr, Far, Vtr, Sdc along with a collection of back-end components in Osd supporting the use of specific low-level subsystems to work with subdivision surface data. These back-end components in Osd have taken many forms including in some cases specific complete GPU shaders along with controller classes to manage compilation and execution of these shaders. In practice it has been more effective for Osd to simply supply the functions needed to operate on subdivision surface data, allowing the client application or client library to take care of using these functions from client provided shaders and computation kernels using client provided execution controllers. This has been the direction for the Osd library for some time and the changes implemented in this release make this even more straightforward. The existing methods OsdGLSLPatchShaderSourceGetPatchBasisShaderSource OsdHLSLPatchShaderSourceGetPatchBasisShaderSource OsdMTLPatchShaderSourceGetPatchBasisShaderSource continue to return shader source strings at runtime which contain definitions and functions allowing client shader code to evaluate values and first and second derivatives on the piecewise parametric patches resulting from subdivison refinement. The identical code is now available at compile time as opensubdivosdpatchBasis.h and is essentially a shader interface that can be used from client kernels including those implemented using TBB, CUDA, C, etc. Similarly, the new methods OsdGLSLPatchShaderSourceGetPatchDrawingShaderSource OsdHLSLPatchShaderSourceGetPatchDrawingShaderSource OsdMTLPatchShaderSourceGetPatchDrawingShaderSource return shader source strings at runtime which contain definitions and functions allowing clients to draw the piecewise parametric patches resulting from subdivision, e.g. using GPU tessellation shaders or GPU mesh shaders. The returned shader source has been stripped of resource binding and other potentially problematic defintions since these are usually best handled by client shader code. These methods have been tested successfully with new client code using Vulkan and DirectX 12 in addition to existing client code using OpenGL, Metal, DirectX 11, etc. Updated Third-party APIs and Tools While the methods described above will be the most effective way to use OpenSubdiv, some of the existing back-end components have been updated to accommodate evolving third-party APIs and tools. Specifically, the TBB implementation has been updated to allow use with the oneTBB API while continuing to maintain compatibility with earlier releases of TBB. Also, there have been minor fixes to the CMake build to accommodate using the Ninja build system and also systems with OpenCL 3.0. API Additions See associated Doxygen for full details. Additions to OsdPatchShaderSource GLSLPatchShaderSourceGetPatchDrawingShaderSource HLSLPatchShaderSourceGetPatchDrawingShaderSource MTLPatchShaderSourceGetPatchDrawingShaderSource Osd extensions for patch evaluation from client shaders and compute kernels struct OsdPatchArray and OsdPatchArrayInit struct OsdPatchCoord and OsdPatchCoordInit struct OsdPatchParam and OsdPatchParamInit OsdPatchParamGetFaceId OsdPatchParamGetU OsdPatchParamGetV OsdPatchParamGetTransition OsdPatchParamGetBoundary OsdPatchParamGetNonQuadRoot OsdPatchParamGetDepth OsdPatchParamGetParamFraction OsdPatchParamIsRegular OsdPatchParamIsTriangleRotated OsdPatchParamNormalize OsdPatchParamUnnormalize OsdPatchParamNormalizeTriangle OsdPatchParamUnnormalizeTriangle OsdEvaluatePatchBasisNormalized OsdEvaluatePatchBasis Other Changes Deprecation Announcements The methods OsdTbbEvaluatorSetNumThreads and OsdOmpEvaluatorSetNumThreads have been marked deprecated. Improvements Updated Osd patch drawing shader source to exclude legacy shader constructs to improve compatibility with Vulkan, DX12, etc. GitHub 1320 Installed Osd patch evaluation headers to allow use from client shaders and compute kernels GitHub 1321 Updated CMake build to locate TBB using TBBs CMake config in order to support oneTBB GitHub 1319 Updated CMake FindOpenCL module to support parsing version information from recent OpenCL headers GitHub 1322 Removed obsolete .travis.yml GitHub 1324 Bug Fixes Fixed inconsistent warning levels for MSVC builds when using Ninja GitHub 1318 Fixed documentation build errors when using Ninja GitHub 1323 Fixed build errors resulting from oneTBB API changes GitHub 1317 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"3.0 - 3.6 Release Notes\",\n+ \"text\": \"3.0 - 3.6 Release Notes 3.0 - 3.6 Release Notes 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.6 Release 3.6.0 - Sep 2023 Release 3.5 Release 3.5.1 - July 2023 Release 3.5.0 - Sep 2022 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.3 - Apr 2020 Release 3.4.0 - Jun 2019 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.2 - Jun 2018 Release 3.3.1 - Feb 1018 Release 3.3.0 - Aug 2017 Release 3.2 Release 3.2.0 - Feb 2017 Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.0 - Oct 2016 Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.4 - Feb 2016 Release 3.0.3 - Oct 2015 Release 3.0.2 - Aug 2015 Release 3.0.1 - Aug 2015 Release 3.0.0 - Jun 2015 Release 3.0.0 RC2 Release 3.0.0 RC1 Previous 2.x Release Notes Release 3.6 Release 3.6.0 - Sep 2023 Release 3.6.0 is a significant release with new features, several configuration improvements, and bug fixes. For more information on the following, see Release 3.6 Changes Updated Osd patch drawing shader source to exclude legacy shader constructs to improve compatibility with Vulkan, DX12, etc. GitHub 1320 Installed Osd patch evaluation headers to allow use from client shaders and compute kernels GitHub 1321 Updated CMake build to locate TBB using TBBs CMake config in order to support oneTBB GitHub 1319 Updated CMake FindOpenCL module to support parsing version information from recent OpenCL headers GitHub 1322 Removed obsolete .travis.yml GitHub 1324 Bug Fixes Fixed inconsistent warning levels for MSVC builds when using Ninja GitHub 1318 Fixed documentation build errors when using Ninja GitHub 1323 Fixed build errors resulting from oneTBB API changes GitHub 1317 Release 3.5 Release 3.5.1 - July 2023 Release 3.5.1 is a minor release including bug fixes and configuration improvements. Changes Updated CMake to set fallback CMAKE_CXX_STANDARD to C14 GitHub 1276 Updated CMake with OpenGL import targets to avoid link errors GitHub 1277 Updated CMake to set gpu architecture fallback only for older CUDA versions GitHub 965 1299 Updated CMake to use append for CMAKE_MODULE_PATH GitHub 1296 Fixed interface includes for CMake config GitHub 1278 Fixed warnings with newer and stricter use of Clang GitHub 1275 1289 1290 Fixed potential float constant cast errors for OpenCL GitHub 1285 Fixed generation of Apple Frameworks with no OSD_GPU targets enabled GitHub 1224 1236 Bug Fixes Fixed BfrSurface construction bug for rare topological case GitHub 1301 Fixed CUDA example dependencies with GLX on Linux GitHub 1294 Release 3.5.0 - Sep 2022 Release 3.5.0 is a significant release with new features, several configuration improvements, and a few other improvements and bug fixes. For more information on the following, see Release 3.5 Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases New Features Simplified Surface Evaluation Bfr Tessellation Patterns Bfr Changes Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Release 3.4 Release 3.4.4 - Feb 2021 Release 3.4.4 is a minor release including bug fixes and configuration improvements Changes The master branch on GitHub has been renamed release GitHub 1218 1219 The CMake configuration has been updated to allow use as a sub-project GitHub 1206 Removed obsolete references to hbr from examplesfarViewer GitHub 1217 Bug Fixes Fixed bug with sparse PatchTables and irregular face-varying seams GitHub 1203 Fixed loss of precision when using double precision stencil tables GitHub 1207 Fixed reset of FarTopologyRefinerGetMaxLevel after call to Unrefine GitHub 1208 Fixed linking with -ldl on unix systems GitHub 1196 Fixed naming and installation of macOS frameworks GitHub 1194 1201 Fixed GL version and extension processing and dynamic loading on macOS GitHub 1216 Fixed FindDocutils.cmake to be more robust GitHub 1213 1220 Fixed errors using build_scriptsbuild_osd.py with Python3 GitHub 1206 Release 3.4.3 - Apr 2020 Release 3.4.3 is a minor release including bug fixes and configuration improvements Changes GLEW is no longer required by default GitHub 1183 1184 Removed false Ptex link dependency from libosdCPU GitHub 1174 Removed false GLFW link dependency from DX11 and Metal examples GitHub 1178 Removed link dependency on unused TBB libraries GitHub 1064 Added option to disable building of dynamic shared libraries GitHub 1169 Added new tutorial for FarLimitStencilTable GitHub 1176 Updated use of EXT_direct_state_access to ARB_direct_state_access GitHub 1184 Fixed C strict aliasing warnings GitHub 1182 Fixed MSVC warnings in example code GitHub 1158 1172 Fixed compatibility with Visual Studio 2019 GitHub 1173 1189 Fixed CMake CMP0054 warnings GitHub 1180 Added prefix to OpenSubdiv CMake macros GitHub 1157 Moved utilities in examplescommon to regressioncommon GitHub 1167 Minor fixes to Far tutorials GitHub 1175 1177 Switched to Azure Pipelines for continuous integration testing instead of Travis-CI and AppVeyor GitHub 1168 1190 Bug Fixes Fixed selective boundary interpolation for case SdcOptionsVTX_BOUNDARY_NONE GitHub 1170 1171 Fixed static library linking to address missing symbols GitHub 1192 Additional fixes for dynamic and static linking GitHub 1193 Release 3.4.0 - Jun 2019 Release 3.4.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.4 New Features Triangular Patches for Loop subdivision Improvements to Introductory Documentation Sparse Patch Tables and Adaptive Refinement Full Support for Double Precision in Far Changes Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Release 3.3 Release 3.3.3 - Jul 2018 Release 3.3.3 is bug-fix release addressing regressions from release 3.3.2 Bug Fixes Fixed a regression in PatchTable construction with varying patches GitHub 976 Fixed a regression in PatchTable construction for face-varying patches GitHub 972 Fixed a bug in the initialization of FarSourcePatch GitHub 971 Release 3.3.2 - Jun 2018 Release 3.3.2 is a minor release with potentially significant performance improvements to the patch pre-processing stages Changes Improved performance of PatchTable construction GitHub 966 The resulting improved accuracy will produce slight numerical differences in computations involving patches, e.g. StencilTable and PatchTable evaluation Bug Fixes FarPatchTableFactory now supports PatchTable construction with ENDCAP_BILINEAR_BASIS specified Release 3.3.1 - Feb 1018 Release 3.3.1 is a minor bug-fix release Bug Fixes Fixed GLSLHLSLMetal patch shader code to resolve degenerate normals GitHub 947 Fixed problems with face-varying patches in uniform PatchTables GitHub 946 Fixed integer overflow bugs for large meshes in PatchTable factories GitHub 957 Fixed computation of PatchParam for triangle refinement GitHub 962 Changes Added build options NO_GLFW and NO_GLFW_X11 Added additional shapes with infinitely sharp creases to the Metal and DX11 example viewers Disabled GL tests during CI runs on Linux Improved stability of examplesglImaging in CI runs by testing GL version Release 3.3.0 - Aug 2017 Release 3.3.0 is significant release adding an Osd implementation for Apples Metal API New Features Added an Osd implementation for Apples Metal API Added the mtlViewer example Changes Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Release 3.2 Release 3.2.0 - Feb 2017 Release 3.2.0 is a minor release containing API additions and bug fixes New Features Extended FarStencilTableFactory to support face-varying Extended Osd Evaluator classes to support evaluation of 1st and 2nd derivatives Added an option to disable generation of legacy sharp corner patches Changes Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Release 3.1 Release 3.1.1 - Jan 2017 Release 3.1.1 is a minor bug-fix release. Bug Fixes Fixed a bug with non-manifold face-varying topology causing a crash during patch table creation Fixed GLEW compilation and linking with dynamic GLEW libraries on Windows Fixed GLFW linking with GLFW 3.2 on X11 platforms Release 3.1.0 - Oct 2016 Release 3.1.0 is a significant release with several new features, bug fixes, and general code and configuration improvements. For more information on the following, please see Release 3.1 New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features Changes Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Release 3.0 Release 3.0.5 - Mar 2016 Release 3.0.5 is a minor stability release with performance and correctness bug fixes. Bug Fixes The previous release reduced transient memory use during PatchTable construction, but increased the amount of memory consumed by the resulting PatchTable itself, this regression has been fixed. The example Ptex texture sampling code has been fixed to prevent sampling beyond the texels for a face when multisample rasterization is enabled. Release 3.0.4 - Feb 2016 Release 3.0.4 is a minor stability release which includes important performance and bug fixes. New Features Added accessor methods to FarLimitStencilTable to retrieve limit stencil data including derivative weights Added support for OpenCL event control to OsdCLVertexBuffer and OsdCLEvaluator Changes Major reduction in memory use during FarPatchTable construction for topologies with large numbers of extraordinary features Improved performance for GL and D3D11 tessellation control hull shader execution when drawing BSpline patches with the single crease patch optimization enabled Bug Fixes Restored support for drawing with fractional tessellation Fixed far_tutorial_6 to refine primvar data only up to the number of levels produced by topological refinement Fixed build warnings and errors reported by Visual Studio 2015 Release 3.0.3 - Oct 2015 Release 3.0.3 is a minor stability release which includes important performance and bug fixes. New Features Smooth normal generation tutorial, far_tutorial_8 Changes Major performance improvement in PatchTable construction Improved patch approximations for non-manifold features Bug Fixes Fixed double delete in GLSL Compute controller Fixed buffer layout for GLSL Compute kernel Fixed GL buffer leak in OsdGLPatchTable Fixed out-of-bounds data access for TBB and OMP stencil evaluation Fixed WIN32_LEAN_AND_MEAN typo Fixed Loop-related shader issues glFVarViewer Release 3.0.2 - Aug 2015 Release 3.0.2 is a minor release for a specific fix. Bug Fixes Fixed drawing of single crease patches Release 3.0.1 - Aug 2015 Release 3.0.1 is a minor release focused on stability and correctness. Changes Added a references section to the documentation, please see References Removed references to AddVaryingWithWeight from examples and tutorials Added more regression test shapes Addressed general compiler warnings e.g. signed vs unsigned comparisons Addressed compiler warnings in the core libraries reported by GCCs -Wshadow Eased GCC version restriction, earlier requirement for version 4.8 or newer is no longer needed Replaced topology initialization assertions with errors Improved compatibility with ICC Improved descriptive content and formatting of Far error messages Improved build when configured to include no GPU specific code Bug Fixes Fixed handling of unconnected vertices to avoid out of bounds data access Fixed non-zero starting offsets for TbbEvalStencils and OmpEvalStencils Fixed FarStencilTableFactoryOptionsfactorizeIntermediateLevels Fixed FarPatchTablesFactoryOptionsgenerateAllLevels Fixed the behavior of VTX_BOUNDARY_NONE for meshes with bilinear scheme Fixed some template method specializations which produced duplicate definitions Disabled depth buffering when drawing the UI in the example viewers Disabled the fractional tessellation spacing option in example viewers since this mode is currently not supported Release 3.0.0 - Jun 2015 Release 3.0.0 is a major release with many significant improvements and changes. For more information on the following, please see Release 3.0 New Features Faster subdivision using less memory Support for non-manifold topology Face-Varying data specified topologically Elimination of fixed valence tables Single-crease patch for semi-sharp edges Additional irregular patch approximations Introduction of Stencil Tables Faster, simpler GPU kernels Unified adaptive shaders Updated coding style with namespaces More documentation and tutorials Bug Fixes Smooth Face-Varying interpolation around creases Release 3.0.0 RC2 New Features Documentation updates far_tutorial_3 updates for the multiple face-varying channels maya example plugin interpolates a UV channel and a vertex color channel Bug Fixes Fixed a LimitStencilTableFactory bug, which returns an invalid table PatchParam encoding changed to support refinement levels up to 10 Added Xinerama link dependency Fixed MSVC 32bit build problem Fixed minor cmake issues Fixed glViewerfarViewer stability bugs Release 3.0.0 RC1 Changes FarTopologyRefiner was split into several classes to clarify and focus the API. Interpolation of Vertex and Varying primvars in a single pass is no longer supported. The Osd layer was largely refactored. Previous 2.x Release Notes Previous releases Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"release_36.html\"\n+ \"loc\": \"release_notes.html\"\n+ }, {\n+ \"title\": \"Sdc Overview\",\n+ \"text\": \"Sdc Overview Sdc Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Subdivision Core Sdc Types, Traits and Options Creasing support Scheme-specific support The FACE, EDGE and VERTEX interfaces The MASK interface Subdivision Core Sdc Sdc is the lowest level layer in OpenSubdiv. Its intent is to separate the core subdivision details from any particular representation of a mesh it was previously bound to Hbr to facilitate the generation of consistent results with other mesh representations, both internal and external to OpenSubdiv. The functionality can be divided roughly into three sections types, traits and options for the supported subdivision schemes computations required to support semi-sharp creasing computations for mask weights of subdivided vertices for all schemes For most common usage, familiarity with only the first of these is necessary -- primarily the use of public types and constants for the choice of subdivision scheme and its associated options. The latter two provide the basis for a more comprehensive implementation of subdivision, which requires considerably more understanding and effort. Overall, the approach was to extract the functionality at the lowest level possible. In some cases, the implementation is not far from being simple global functions. The intent was to start at a low level and build any higher level functionality as needed. What exists now is functional for ongoing development and anticipated needs within OpenSubdiv for the near future. The intent of Sdc is to provide the building blocks for OpenSubdiv and its clients to efficiently process the specific set of supported subdivision schemes. It is not intended to be a general framework for defining customized subdivision schemes. Types, Traits and Options The most basic type is the enum SdcSchemeType that identifies the fixed set of subdivision schemes supported by OpenSubdiv Bilinear , Catmark and Loop . With this alone, we intend to avoid all dynamic casting issues related to the scheme by simply adding members to the associated subclasses for inspection. In addition to the type enum itself, a class defining a fixed set of traits associated with each scheme is provided. While these traits are available as static methods in the interface of a class supporting more functionality for each scheme to be described shortly, the SchemeTypeTraits provide queries of the traits for a variable of type SdcSchemeType -- enabling parameterization of code by the value of a trait without templates or virtual inheritance a simple internal table of traits is constructed and trivially indexed. The second contribution is the collection of all variations in one place that can be applied to the subdivision schemes, i.e. the boundary interpolation rules, creasing method, edge subdivision choices, etc. The fact that these are all declared in one place alone should help clients see the full set of variations that are possible. A simple Options struct a set of bitfields aggregates all of these variations into a single object the equivalent of an integer in this case that are passed around to other Sdc classes andor methods and are expected to be used at a higher level both within OpenSubdiv and externally. By aggregating the options and passing them around as a group, it allows us to extend the set easily in future without the need to rewire a lot of interfaces to accommodate the new choice. Clients can enable new choices at the highest level and be assured that they will propagate to the lowest level where they are relevant. Unlike other options structs used elsewhere to specify variations of a particular method, SdcOptions defines all options that affect the shape of the underlying limit surface of a subdivision mesh. Other operations at higher levels in the library may have options that approximate the shape and so create a slightly different appearance, but SdcOptions is a fundamental part of the definition of the true limit surface. Creasing support Since the computations involved in the support of semi-sharp creasing are independent of the subdivision scheme, the goal in Sdc was to encapsulate all related creasing functionality in a similarly independent manner. Computations involving sharpness values are also much less dependent on topology -- there are vertices and edges with sharpness values, but knowledge of faces or boundary edges is not required, -- so the complexity of topological neighborhoods required for more scheme-specific functionality is arguably not necessary here. Creasing computations have been provided as methods defined on a Crease class that is constructed with a set of Options. Its methods typically take sharpness values as inputs and compute a corresponding set of sharpness values as a result. For the Uniform creasing method previously known as Normal , the computations may be so trivial as to question whether such an interface is worth it, but for Chaikin or other schemes in the future that are non-trivial, the benefits should be clear. Functionality is divided between both uniform and non-uniform, so clients have some control over avoiding unnecessary overhead, e.g. non-uniform computations typically require neighboring sharpness values around a vertex, while uniform does not. Also included as part of the Crease class is the Rule enum -- this indicates if a vertex is Smooth, Crease, Dart or Corner referred to as the mask in Hbr and is a function of the sharpness values at and around a vertex. Knowing the Rule for a vertex can accelerate mask queries, and the Rule can often be inferred based on the origin of a vertex e.g. it originated from the middle of a face, was the child of a Smooth vertex, etc.. Methods are defined for the Crease class to subdivide edge and vertex sharpness values determine the Rule for a vertex based on incident sharpness values determine the transitional weight between two sets of sharpness values Being all low-level and working directly on sharpness values, it is a clients responsibility to coordinate the application of any hierarchical crease edits with their computations. Similarly, in keeping with this as a low-level interface, values are passed as primitive arrays. This follows the trend in OpenSubdiv of dealing with data of various kinds e.g. weights, component indices, now sharpness values, etc. in small contiguous sets of values. In most internal cases we can refer to a set of values or gather what will typically be a small number of values on the stack for temporary use. Scheme-specific support While the SchemeTypeTraits class provides traits for each subdivision scheme supported by OpenSubdiv i.e. Bilinear , Catmark and Loop , the Scheme class provides these more directly, Additionally, the Scheme class provides methods for computing the various sets of weights used to compute new vertices resulting from subdivision. The collection of weights used to compute a single vertex at a new subdivision level is typically referred to as a mask . The primary purpose of the Scheme class is to provide such masks in a manner both general and efficient. Each subdivision scheme has its own values for its masks, and each are provided as specializations of the template class SchemeSchemeType TYPE . The intent is to minimize the amount of code specific to each scheme. The computation of mask weights for subdivided vertices is the most significant contribution of Sdc. The use of semi-sharp creasing with each non-linear subdivision scheme complicates what are otherwise simple masks determined solely by the topology, and packaging that functionality to achieve both the generality and efficiency desired has been a challenge. Mask queries are defined in the Scheme class template, which has specializations for each of the supported subdivision schemes. Mask queries are defined in terms of interfaces for two template parameters the first defining the topological neighborhood of a vertex, and a second defining a container in which to gather the individual weights template typename FACE , typename MASK void ComputeFaceVertexMask FACE const faceNeighborhood , MASK faceVertexMask , ... const Each mask query is expected to call methods defined for the FACE , EDGE or VERTEX classes to obtain the information they require typically these methods are simple queries about the topology and associated sharpness values. Clients are free to use their own mesh representations to gather the requested information as quickly as possible, or to cache some subset as member variables for immediate inline retrieval. In general, the set of weights for a subdivided vertex is dependent on the following the topology around the parent component from which the vertex originates the type of subdivision Rule applicable to the parent component the type of subdivision Rule applicable to the new child vertex a transitional weight blending the effect between differing parent and child rules This seems fairly straight-forward, until we look at some of the dependencies involved the parent Rule requires the sharpness values at and around the parent component the child Rule requires the subdivided sharpness values at and around the new child vertex though it can sometimes be trivially inferred from the parent the transitional weight between differing rules requires all parent and child sharpness values Clearly the sharpness values are inspected multiple times and so it pays to have them available for retrieval. Computing them on an as-needed basis may be simple for uniform creasing, but a non-uniform creasing method requires traversing topological neighborhoods, and that in addition to the computation itself can be costly. The point here is that it is potentially unreasonable to expect to evaluate the mask weights completely independent of any other consideration. Expecting and encouraging the client to have subdivided sharpness values first, for use in more than one place, is therefore recommended. The complexity of the general case above is also unnecessary for most vertices. Any client using Sdc typically has more information about the nature of the vertex being subdivided and much of this can be avoided -- particularly for the smooth interior case that often dominates. More on that in the details of the Scheme classes. Given that most of the complexity has been moved into the template parameters for the mask queries, the Scheme class remains fairly simple. Like the Crease class, it is instantiated with a set of Options to avoid them cluttering the interface. It is currently little more than a few methods for the limit and refinement masks for each vertex type, plus the few fixed traits of the scheme as static methods. The mask queries have been written in a way that greatly simplifies the specializations required for each scheme. The generic implementation for both the edge-vertex and vertex-vertex masks take care of all of the creasing logic, requiring only a small set of specific masks to be assigned for each Scheme smooth and crease masks for an edge-vertex, and smooth, crease and corner masks for a vertex-vertex. Other than the Bilinear case, which will specialize the mask queries to trivialize them for linear interpolation, the specializations for each Scheme should only require defining this set of masks -- and with two of them common edge-vertex crease and vertex-vertex corner the Catmark scheme only needs to define three. The FACE, EDGE and VERTEX interfaces Mask queries require an interface to a topological neighborhood, currently labeled FACE , EDGE and VERTEX . This naming potentially implies more generality than intended, as such classes are only expected to provide the methods required of the mask queries to compute its associated weights. While all methods must be defined, some may rarely be invoked, and the client has considerable flexibility in the implementation of these they can defer some evaluations lazily until required, or be pro-active and cache information in member variables for immediate access. An approach discussed in the past has alluded to iterator classes that clients would write to traverse their meshes. The mask queries would then be parameterized in terms of a more general and generic mesh component that would make use of more general traversal iterators. The advantage here is the iterators are written once, then traversal is left to the query and only what is necessary is gathered. The disadvantages are that clients are forced to write these to do anything, getting them correct and efficient may not be trivial or possible in some cases, and that the same data e.g. subdivided sharpness may be gathered or computed multiple times for different purposes. The other extreme was to gather everything possible required at once, but that is objectionable. The approach taken here provides a reasonable compromise between the two. The mask queries ask for exactly what they want, and the provided classes are expected to deliver it as efficiently as possible. In some cases the client may already be storing it in a more accessible form and general topological iteration can be avoided. The information requested of these classes in the three mask queries is as follows For FACE the number of incident vertices For EDGE the number of incident faces the sharpness value of the parent edge the sharpness values of the two child edges the number of vertices per incident face For VERTEX the number of incident faces the number of incident edges the sharpness value of the parent vertex the sharpness values for each incident parent edge the sharpness value of the child vertex the sharpness values for each incident child edge The latter should not be surprising given the dependencies noted above. There are also a few more to consider for future use, e.g. whether the EDGE or VERTEX is manifold or not. In most cases, additional information can be provided to the mask queries i.e. pre-determined Rules, and most of the child sharpness values are not necessary. The most demanding situation is a fractional crease that decays to zero -- in which case all parent and child sharpness values in the neighborhood are required to determine the proper transitional weight. The MASK interface Methods dealing with the collections of weights defining a mask are typically parameterized by a MASK template parameter that contains the weights. The set of mask weights is currently divided into vertex-weights, edge-weights and face-weights -- consistent with previous usage in OpenSubdiv and providing some useful correlation between the full set of weights and topology. The vertex-weights refer to parent vertices incident the parent component from which a vertex originated, the edge-weights the vertices opposite incident edges of the parent, and the face-weights the center of incident parent faces. Note the latter is NOT in terms of vertices of the parent but potentially vertices in the child originating from faces of the parent. This has been done historically in OpenSubdiv but is finding less use -- particularly when it comes to providing greater support for the Loop scheme -- and is a point needing attention. So the mask queries require the following capabilities assign the number of vertex, edge andor face weights retrieve the number of vertex, edge andor face weights assign individual vertex, edge andor face weights by index retrieve individual vertex, edge andor face weights by index through a set of methods required of all MASK classes. Since the maximum number of weights is typically known based on the topology, usage within Vtr, Far or Hbr is expected to simply define buffers on the stack. Another option is to utilize pre-allocated tables, partitioned into the three sets of weights on construction of a MASK , and populated by the mask queries. A potentially useful side-effect of this is that the client can define their weights to be stored in either single or double-precision. With that possibility in mind, care was taken within the mask queries to make use of a declared type in the MASK interface MASKWeight for intermediate calculations. Having support for double-precision masks in Sdc does enable it at higher levels in OpenSubdiv if later desired, and that support is made almost trivial with MASK being generic. It is important to remember here that these masks are being defined consistent with existing usage within OpenSubdiv both Hbr and the subdivision tables generated by Far . As noted above, the face weights correspond to the centers of incident faces, i.e. vertices on the same level as the vertex for which the mask is being computed, and not relative to vertices in the parent level as with the other sets of weights. It is true that the weights can be translated into a set in terms solely of parent vertices, but in the general case i.e. Catmark subdivision with non-quads in the base mesh this requires additional topological association. In general we would need N-3 weights for the N-3 vertices between the two incident edges, where N is the number of vertices of each face typically 4 even at level 0. Perhaps such a translation method could be provided on the mask class, with an optional indication of the incident face topology for the irregular cases. The Loop scheme does not have face weights , for a vertex-vertex mask, but for an edge-vertex mask it does require weights associated with the faces incident the edge -- either the vertex opposite the edge for each triangle, or its center which has no other use for Loop. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"sdc_overview.html\"\n }, {\n \"title\": \"Overview of Release 3.5\",\n \"text\": \"Overview of Release 3.5 Overview of Release 3.5 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Simplified Surface Evaluation Tessellation Patterns API Additions New classes in namespace Bfr Additions to FarTopologyLevel Additions to nested Options classes in Far Other Changes Deprecation Announcements Improvements Bug Fixes New Features Simplified Surface Evaluation The new Bfr interface provides an alternative to Far and Osd for evaluating the limit surface -- treating a subdivision mesh as a piecewise parameteric surface primitive . The Bfr interface is named for Base Face Representation as all concepts and classes relate to the individual faces of the original unrefined mesh, i.e. its base faces. Each base face has a piece of limit surface associated with it BfrSurface that is parameterized BfrParameterization and so can be evaluated and tessellated The limit surface for each face can be identified and evaluated independently of any other faces without any global pre-processing of a connected mesh. The resulting evaluation interface is much simpler, more flexible and more scalable than those assembled with the table-based class in Far -- providing a preferable alternative for many CPU-based use cases though not all. See the Bfr Overview documentation for more details. Tessellation Patterns In addition to evaluation, the Bfr interface includes a Tessellation class that provides tessellation patterns for all faces of a base mesh. A Tessellation does not encapsulate the entire tessellation process but simply provides topological patterns to assemble such a process. All faces of a mesh have a Parameterization which can be used to define a Tessellation with the specification of one or more tessellation rates. A single tessellation rate defines simple uniform tessellations while tessellation rates for each edge provide more complex non-uniform patterns A small set of options is also available to define the resulting patterns e.g. the preservation of quad faces with quad-based subdivision schemes above left and center and to generate its output in a more favorable form. Tessellation patterns do not support the full flexibility of typical hardware tessellation e.g. no fractional tessellation but do provide some useful alternatives to hardware tessellation e.g. the quad preservation previously noted, and more uniform triangles for triangular patches above right . The Tessellation class is also completely independent of evaluation in Bfr , and so can be used with any other evaluation interface. See the Tessellation subsection of the Bfr Overview for more details. API Additions See associated Doxygen for full details. New classes in namespace Bfr class Parameterization class Surface class SurfaceFactory class SurfaceFactoryCache class SurfaceFactoryMeshAdapter class RefinerSurfaceFactory class Tessellation Additions to FarTopologyLevel TopologyLevelIsVertexCorner TopologyLevelIsVertexRegular TopologyLevelIsVertexInfSharp TopologyLevelIsVertexSemiSharp TopologyLevelIsEdgeInfSharp TopologyLevelIsEdgeSemiSharp Additions to nested Options classes in Far PatchTableFactoryOptionsSetMaxIsolationLevel TopologyRefinerUniformOptionsSetRefinementLevel TopologyRefinerAdaptiveOptionsSetMaxIsolationLevel TopologyRefinerAdaptiveOptionsSetMaxSecondaryLevel Other Changes Deprecation Announcements Hbr is deprecated and will be removed from subsequent releases Improvements Suppression of GCC compiler warnings GitHub 1253, 1254, 1270 Additional methods for FarTopologyLevel GitHub 1227, 1255 Improved mixed partial derivative at Gregory patch corners GitHub 1252 Minor improvements to Far tutorials GitHub 1226, 1241 Added CMake config GitHub 1242 Updated CMake minimum version to 3.12 GitHub 1237, 1261 Updated documentation build scripts for Python 3 1265, 1266 Updated stringify build tool for improved cross compilation support GitHub 1267 Added NO_MACOS_FRAMEWORKS build option GitHub 1238 Updated Azure pipelines agents for Unbuntu and macOS GitHub 1247, 1256 Removed obsolete AppVeyor and Travis CI scripts GitHub 1259 Bug Fixes Cache active program for OsdGLComputeEvaluator GitHub 1244 Fixed member initialization warnings in OsdD3D11ComputeEvaluator GitHub 1239 Fixed GLSL shader source to remove storage qualifiers from struct members GitHub 1271 Fixed use of CMake variables for Apple builds GitHub 1235 Fixed build errors when using OpenGL without GLFW GitHub 1257 Fixed links to embedded videos GitHub 1231 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_35.html\"\n }, {\n \"title\": \"Overview of Release 3.4\",\n \"text\": \"Overview of Release 3.4 Overview of Release 3.4 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Triangular Patches for Loop Subdivision Major Improvements to Introductory Documentation Sparse Patch Tables Support for Double Precision in Far API Additions Far extensions for triangular patches Construction and refinement of topology Construction and interface of FarPatchTable Construction and use of Far stencil tables Far class templates for double precision Far member functions converted to templates for double precision OsdMeshBits OsdPatchArray Osd extensions for patch evaluation common to all shaders Osd extensions for patch tessellation common to all shaders Other Changes Improvements Bug Fixes New Features Triangular Patches for Loop Subdivision Support for the drawing and evaluation of Loop subdivision meshes with triangular patches was added. This includes the full set of Far and Osd interfaces for both evaluation and drawing. The feature set supported for Loop subdivision now matches that of Catmark, including creases, face-varying patches, non-manifold topology, etc. The long standing requirement that Loop meshes be purely triangular remains, as Loop subdivision is not defined for non-triangular faces. And as is the case with the use of the Catmark scheme, application of Loop subdivision to dense, poorly modeled meshes may lead to unexpectedly poor performance andor surface quality. The patch representation used for Loop subdivision is intended to exactly match the underlying limit surface where regular, and so uses quartic triangular Box-splines. This is in contrast to approaches that use simpler patches to approximate the Loop limit surface everywhere. As with Catmark, Gregory patches are used to approximate irregular areas. Though other choices are available that compromise surface quality in favor of improved performance, they may be less effective with Loop than they are with Catmark. Major Improvements to Introductory Documentation A significant rewrite of the Subdivision Surfaces page is included in this release. The new documentation emphasizes the piecewise parametric surface nature of subdivision surfaces and the implications of supporting arbitary topology . As a true surface primitive, the distinction between the control points and the limit surface and the corresponding operations of subdivision and tessellation that are applied to them is made clear. Sparse Patch Tables Interfaces in Far for the construction of PatchTables and the required adaptive refinement have been extended to apply to an arbitrary subset of faces. This allows patches for either large meshes or meshes that may otherwise benefit from some kind of partioning e.g. areas of static and dynamic topology to be managed in an arbitrary number of groups. In the extreme, a PatchTable forming the tree of patches for a single base face can be constructed. Client data buffers for the base mesh do not need to be partitioned and base mesh topology can be shared by multiple instances of FarTopologyRefiner used to create corresponding instances of FarPatchTables. See the new Far tutorial 5.2 for a simple example. Support for Double Precision in Far Classes and interfaces in Far have been adapted to allow support for double precision via templates parameterized for float or double. Class templates for major classes such as FarStencilTable have been introduced and the original classes preserved for compatibility. Other classes such as FarPatchTable have had methods overloaded or replaced with template functions to support both single and double precision. Internally, all use of floating point constants and math library functions has been adapted to maximize accuracy appropriate to the precision of the template instance. Interfaces in Osd have not been extended. The extensions in Far provide the basis for extensions in Osd, but demand is limited. For those benefiting from such Osd extensions, contributions are welcomed. See the revised Far tutorial 5.1 that constructs a FarPatchTable for a simple example. API Additions See associated Doxygen for full details. Far extensions for triangular patches enum PatchDescriptorTypeGREGORY_TRIANGLE PatchParamNormalizeTriangle PatchParamUnnormalizeTriangle PatchParamIsTriangleRotated Construction and refinement of topology overloaded TopologyRefinerFactoryCreate extensions to TopologyRefinerRefineAdaptive Construction and interface of FarPatchTable overloaded PatchTableFactoryCreate PatchTableFactoryGetRefineAdaptiveOptions member PatchTableFactoryOptionsincludeBaseLevelIndices member PatchTableFactoryOptionsincludeFVarBaseLevelIndices member PatchTableFactoryOptionsgenerateVaryingTables member PatchTableFactoryOptionsgenerateVaryingLocalPoints member PatchTableFactoryOptionssetPatchPrecisionDouble member PatchTableFactoryOptionssetFVarPatchPrecisionDouble PatchTableGetFVarPatchDescriptorRegular PatchTableGetFVarPatchDescriptorIrregular PatchTableGetFVarValueStride Construction and use of Far stencil tables overloaded StencilTableUpdateValues enum LimitStencilTableFactoryMode member LimitStencilTableFactoryOptionsinterpolationMode member LimitStencilTableFactoryOptionsfvarChannel Far class templates for double precision class StencilReal class StencilTableReal class StencilTableFactoryReal class LimitStencilReal class LimitStencilTableReal class LimitStencilTableFactoryReal class PrimvarRefinerReal Far member functions converted to templates for double precision PatchParamNormalize PatchParamUnnormalize PatchTableEvaluateBasis PatchTableEvaluateBasisVarying PatchTableEvaluateBasisFaceVarying PatchTableGetLocalPointStencilTable PatchTableGetLocalPointVaryingStencilTable PatchTableGetLocalPointFaceVaryingStencilTable PatchMapFindPatch OsdMeshBits enumeration MeshEndCapBilinearBasis OsdPatchArray GetDescriptorRegular GetDescriptorIrregular GetPatchTyperRegular GetPatchTyperIrregular GetStride Osd extensions for patch evaluation common to all shaders struct OsdPatchArray and OsdPatchArrayInit struct OsdPatchCoord and OsdPatchCoordInit struct OsdPatchParam and OsdPatchParamInit OsdPatchParamGetFaceId OsdPatchParamGetU OsdPatchParamGetV OsdPatchParamGetTransition OsdPatchParamGetBoundary OsdPatchParamGetNonQuadRoot OsdPatchParamGetDepth OsdPatchParamGetParamFraction OsdPatchParamIsRegular OsdPatchParamIsTriangleRotated OsdPatchParamNormalize OsdPatchParamUnnormalize OsdPatchParamNormalizeTriangle OsdPatchParamUnnormalizeTriangle OsdEvaluatePatchBasisNormalized OsdEvaluatePatchBasis Osd extensions for patch tessellation common to all shaders OsdInterpolatePatchCoordTriangle OsdComputePerPatchVertexBoxSplineTriangle OsdEvalPatchBezierTriangle OsdEvalPatchGregoryTriangle OsdGetTessLevelsUniformTriangle OsdEvalPatchBezierTessLevels OsdEvalPatchBezierTriangleTessLevels OsdGetTessParameterizationTriangle Other Changes Improvements Added new build script GitHub 1068 Added support for newer DirectX SDKs GitHub 1066 Patch arrays extended to support combined regular and irregular types GitHub 995 FarPatchTables and adaptive refinement supported for Bilinear scheme GitHub 1035 New FarPatchTableFactory method to determine adaptive refinement options GitHub 1047 New FarPatchTableFactory options to align primvar buffers of uniform tables GitHub 986 FarStencilTableUpdateValues overloaded to support separate base buffer GitHub 1011 FarLimitStencilTableFactory updated to create face-varying tables GitHub 1012 Regular patches on boundaries no longer require additional isolation GitHub 1025 Inclusion of OpenSubdiv header files in source code now consistent GitHub 767 Re-organization of and additions to Far tutorials GitHub 1083 Examples now use common command-line conventions and parsing GitHub 1056 Bug Fixes Fixed FarPrimvarRefiner internal limitFVar prototype GitHub 979 Fixed FarStencilTable append when base StencilTable empty GitHub 982 Patches around non-manifold vertices now free of cracks GitHub 1013 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_34.html\"\n }, {\n+ \"title\": \"Overview of Release 3.6\",\n+ \"text\": \"Overview of Release 3.6 Overview of Release 3.6 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Modern Graphics APIs and Parallel Computation Updated Third-party APIs and Tools API Additions Additions to OsdPatchShaderSource Osd extensions for patch evaluation from client shaders and compute kernels Other Changes Deprecation Announcements Improvements Bug Fixes New Features The purpose of this release is to address concerns which improve support for current typical use cases and provide support for significant new use cases. Modern Graphics APIs and Parallel Computation OpenSubdiv is organized as a set of components for working with subdivision surface representations, i.e. Bfr, Far, Vtr, Sdc along with a collection of back-end components in Osd supporting the use of specific low-level subsystems to work with subdivision surface data. These back-end components in Osd have taken many forms including in some cases specific complete GPU shaders along with controller classes to manage compilation and execution of these shaders. In practice it has been more effective for Osd to simply supply the functions needed to operate on subdivision surface data, allowing the client application or client library to take care of using these functions from client provided shaders and computation kernels using client provided execution controllers. This has been the direction for the Osd library for some time and the changes implemented in this release make this even more straightforward. The existing methods OsdGLSLPatchShaderSourceGetPatchBasisShaderSource OsdHLSLPatchShaderSourceGetPatchBasisShaderSource OsdMTLPatchShaderSourceGetPatchBasisShaderSource continue to return shader source strings at runtime which contain definitions and functions allowing client shader code to evaluate values and first and second derivatives on the piecewise parametric patches resulting from subdivison refinement. The identical code is now available at compile time as opensubdivosdpatchBasis.h and is essentially a shader interface that can be used from client kernels including those implemented using TBB, CUDA, C, etc. Similarly, the new methods OsdGLSLPatchShaderSourceGetPatchDrawingShaderSource OsdHLSLPatchShaderSourceGetPatchDrawingShaderSource OsdMTLPatchShaderSourceGetPatchDrawingShaderSource return shader source strings at runtime which contain definitions and functions allowing clients to draw the piecewise parametric patches resulting from subdivision, e.g. using GPU tessellation shaders or GPU mesh shaders. The returned shader source has been stripped of resource binding and other potentially problematic defintions since these are usually best handled by client shader code. These methods have been tested successfully with new client code using Vulkan and DirectX 12 in addition to existing client code using OpenGL, Metal, DirectX 11, etc. Updated Third-party APIs and Tools While the methods described above will be the most effective way to use OpenSubdiv, some of the existing back-end components have been updated to accommodate evolving third-party APIs and tools. Specifically, the TBB implementation has been updated to allow use with the oneTBB API while continuing to maintain compatibility with earlier releases of TBB. Also, there have been minor fixes to the CMake build to accommodate using the Ninja build system and also systems with OpenCL 3.0. API Additions See associated Doxygen for full details. Additions to OsdPatchShaderSource GLSLPatchShaderSourceGetPatchDrawingShaderSource HLSLPatchShaderSourceGetPatchDrawingShaderSource MTLPatchShaderSourceGetPatchDrawingShaderSource Osd extensions for patch evaluation from client shaders and compute kernels struct OsdPatchArray and OsdPatchArrayInit struct OsdPatchCoord and OsdPatchCoordInit struct OsdPatchParam and OsdPatchParamInit OsdPatchParamGetFaceId OsdPatchParamGetU OsdPatchParamGetV OsdPatchParamGetTransition OsdPatchParamGetBoundary OsdPatchParamGetNonQuadRoot OsdPatchParamGetDepth OsdPatchParamGetParamFraction OsdPatchParamIsRegular OsdPatchParamIsTriangleRotated OsdPatchParamNormalize OsdPatchParamUnnormalize OsdPatchParamNormalizeTriangle OsdPatchParamUnnormalizeTriangle OsdEvaluatePatchBasisNormalized OsdEvaluatePatchBasis Other Changes Deprecation Announcements The methods OsdTbbEvaluatorSetNumThreads and OsdOmpEvaluatorSetNumThreads have been marked deprecated. Improvements Updated Osd patch drawing shader source to exclude legacy shader constructs to improve compatibility with Vulkan, DX12, etc. GitHub 1320 Installed Osd patch evaluation headers to allow use from client shaders and compute kernels GitHub 1321 Updated CMake build to locate TBB using TBBs CMake config in order to support oneTBB GitHub 1319 Updated CMake FindOpenCL module to support parsing version information from recent OpenCL headers GitHub 1322 Removed obsolete .travis.yml GitHub 1324 Bug Fixes Fixed inconsistent warning levels for MSVC builds when using Ninja GitHub 1318 Fixed documentation build errors when using Ninja GitHub 1323 Fixed build errors resulting from oneTBB API changes GitHub 1317 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"release_36.html\"\n+ }, {\n \"title\": \"Overview of Release 3.3\",\n \"text\": \"Overview of Release 3.3 Overview of Release 3.3 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Metal Compute and Tessellation API Additions OsdMTLContext OsdMTLComputeEvaluator OsdMTLStencilTable OsdMTLMeshInterface OsdMTLPatchTable OsdMTLLegacyGregoryPatchTable OsdPatchShaderSource OsdCPUMTLVertexBuffer Other Changes Improvements New Features Metal Compute and Tessellation Added support for drawing and evaluation using Apples Metal API for high performance and low-overhead GPU access. This includes the full set of Osd interfaces needed to draw using Metal graphics rendering including tessellation shaders and evaluate stencils and patch tables using Metal compute processing. Also includes an example mtlViewer that can be built to run on either macOS or iOS. Metal Graphics Rendering with Tessellation Metal Patch Evaluation using Compute Processing API Additions See associated Doxygen for full details. OsdMTLContext device and commandQueue member data OsdMTLComputeEvaluator Create EvalStencils EvalPatches EvalPatchesVarying EvalPatchesFaceVarying Compile Synchronize OsdMTLStencilTable Create GetSizesBuffer GetIndicesBuffer GetDuWeightsBuffer GetDvWeightsBuffer GetDuuWeightsBuffer GetDuvWeightsBuffer GetDvvWeightsBuffer GetNumStencils OsdMTLMeshInterface GetNumVertices GetMaxValence UpdateVertexBuffer UpdateVaryingBuffer Refine Synchronize GetPatchTable GetFarPatchTable BindVertexBuffer BindVaryingBuffer OsdMTLPatchTable Create GetPatchArrays GetPatchIndexBuffer GetPatchParamBuffer GetVaryingPatchArrays GetVaryingPatchIndexBuffer GetNumFVarChannels GetFVarPatchArrays GetFVarPatchIndexBuffer GetFVarPatchParamBuffer OsdMTLLegacyGregoryPatchTable UpdateVertexBuffer GetVertexBuffer GetVertexValenceBuffer GetQuadOffsetsBuffer OsdPatchShaderSource GetCommonShaderSource GetPatchBasisShaderSource GetVertexShaderSource GetHullShaderSource GetDomainShaderSource OsdCPUMTLVertexBuffer Create UpdateData GetNumElements GetNumVertices BindCpuBuffer BindMTLBuffer BindVBO Other Changes Improvements Fixed several instances of local variable shadowing that could cause build warnings Updated continuous-integration build scripts and added testing on macOS Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_33.html\"\n }, {\n \"title\": \"Overview of Release 3.2\",\n \"text\": \"Overview of Release 3.2 Overview of Release 3.2 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Face-Varying Stencil Evaluation 1st and 2nd Derivative Evaluation Smooth Corner Patch API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdMesh OsdMeshBits FarPatchTableFactoryOptions FarStencilTableFactory FarStencilTableFactoryOptions Other Changes Improvements Bug Fixes New Features Face-Varying Stencil Evaluation Face-Varying primvar values may now be refined using stencil tables. The stencil table for a face-varying channel is created by specifying the desired fvarChannel and setting the FarStencilTableFactoryOption interpolationMode to INTERPOLATE_FACE_VARYING when creating the stencil table. 1st and 2nd Derivative Evaluation The Osd Evaluator API has been extended to support 1st derivative and 2nd partial derivative evaluation for stencils and patches. 1st Derivative Surface Normal 2nd Derivative Surface Curvature On the left is an example of computing a surface normal at each point using the evaluated 1st derivatives, while on the right is an example of computing surface curvature at each point using the evaluated 2nd partial derivatives. Smooth Corner Patch An option has been added to disable the legacy behavior of generating a sharp-corner patch at a smooth corner. Corners which are actually sharp will continue to generate sharp-corner patches. The differences between the two methods is most apparent at low-levels of feature isolation. This feature is controlled by the generateLegacySharpCornerPatches option added to FarPatchTableFactoryOptions. Sharp Corner Patch legacy behavior Smooth Corner Patch On the left is the legacy behavior of generating sharp corner patches at smooth corners. The image on the right shows the correct smooth corner patches generated when this legacy behavior is disabled. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc Create EvalStencils EvalPatches EvalPatchesVarying EvalPatchesFaceVarying OsdMesh Create OsdMeshBits member MeshUseSmoothCornerPatch FarPatchTableFactoryOptions member generateLegacySharpCornerPatches FarStencilTableFactory enumeration ModeINTERPOLATE_FACE_VARYING AppendLocalPointStencilTableFaceVarying FarStencilTableFactoryOptions member fvarChannel Other Changes Improvements Corrected numerous spelling errors in doxygen comments Updated glFVarViewer with improved error detection and command line parsing Added option to build using MSVC with static CRT Bug Fixes Fixed a double delete of GL program in OsdGLComputeEvaluator Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_32.html\"\n }, {\n- \"title\": \"Overview of Release 3.1\",\n- \"text\": \"Overview of Release 3.1 Overview of Release 3.1 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdCpuPatchTable, GLPatchTable, etc OsdMeshBits OsdPatchParam OsdGLSLPatchShaderSource, HLSLPatchShaderSource FarLimitStencil FarLimitStencilTable FarLimitStencilTableFactoryOptions FarPatchParam FarPatchTable FarPatchTableFactoryOptions FarTopologyLevel FarTopologyRefinerAdaptiveOptions Other Changes Improvements Bug Fixes New Features Bicubic Face-Varying Patches The motivation for this feature is to improve drawing and evaluation of face-varying primvar values for all face-varying interpolation options . A common use of non-linear face-varying data is to capture a UV projection on the surface. The following example shows a simple shape with the face-varying interpolation option assigned to a non-linear choice to achieve the desired projection in this case FVAR_LINEAR_NONE Linear Face-Varying Patches Bicubic Face-Varying Patches The result on the left shows the old linearly interpolated patches, which ignores any non-linear settings. The result on the right shows the new use of bicubic face-varying patches to accurately interpolate the desired projection. Generation of a full face-varying patch representation can be enabled using a new option in FarPatchTableFactoryOptions. Additionally, topological refinement can be improved to consider fvar channel topology using a new option in FarTopologyRefinerAdaptiveOptions. See the API additions below and their associated Doxygen text for more details. Evaluation of patch basis weights for all patch types as been added to the GPU shader source provided by OsdGLSLPatchShaderSource, and OsdHLSLPatchShaderSource. Use of non-linear face-varying patches increases the storage size of the patch table and may also require additional data access and computation while drawing. Varying and Face-Varying Evaluation This feature extends existing evaluation methods to support evaluation of varying and face-varying primvar data at arbitrary limit surface locations. Varying Primvar Evaluation Face-Varying Primvar Evaluation The image on the left shows evaluation of varying primvar values and the image on the right shows evaluation of face-varying primvar values. The EvaluateBasis API of FarPatchTable has been extended as well as the OSD Evaluator API. Second Order Derivative Evaluation This feature extends the FarLimitStencilTable and FarPatchTable interfaces to support evaluation of 2nd order partial derivatives. The generation of derivative values for FarLimitStencilTable is controlled by new options that can be specified when creating the stencil table. Additionally, the implementation exposes a more accurate method to compute derivatives for Gregory basis patches. This can be enabled using the CMake configuration and compile time definition OPENSUBDIV_GREGORY_EVAL_TRUE_DERIVATIVES. Separate Levels of Feature Isolation The primary motivation for this feature is to reduce the number of patches generated by adaptive refinement when they can be adequately represented at a lower level. A single level of isolation must be as high as the greatest semi-sharp feature to properly resolve the shape of that feature. That high isolation level generates many unnecessary patches for smooth extra-ordinary vertices. In the following example, a single semi-sharp vertex is refined to level 5 Single Isolation Level 5 Primary Level 5, Secondary Level 2 Single isolation to level 5 on the left results in 312 patches. The right shows the semi-sharp feature isolated to 5, but with the new secondary level set to 2, the number of patches is reduced to 123. The second specified level of adaptive refinement is used to halt isolation for features that typically do not require the specified maximum. These include interior and boundary extra-ordinary vertices and those infinitely sharp patches that correspond to boundary extra-ordinary patches. The secondary level is available as a new option in FarTopologyRefinerAdaptiveOptions. Sharp Patches for Infinitely Sharp Features The motivation for sharp patches is to accurately represent the limit surface of infinitely sharp features, which otherwise can only be approximated by very high levels of adaptive refinement, resulting in many unnecessary patches. The true limit surface for regular faces along an infinitely sharp crease is a regular B-Spline patch -- the same as regular faces along a boundary. Similarly, the limit surface for faces around an extra-ordinary vertex on an infinitely sharp crease is the same as that of faces around an extra-ordinary vertex on a boundary. So these patches are identified and isolated to the same degree -- the regular patches as soon as possible, and the irregular patches to the depth specified. Consider the following regressionshapecatmark_cube_creases2 Level 5 without Sharp Patches Level 5 with Sharp Patches Level 2 with Sharp Patches Without use of sharp patches on the left, isolating to level 5 generates 1764 patches and does still not capture the sharp edges. With sharp patches in the center, isolating to the same degree level 5 reduces the number of patches to 96 and captures the sharp edges. The sharp features can be captured at a lower degree with comparable accuracy as illustrated on the right where isolation to level 2 further reduces the number of patches to 42. The use of infinitely sharp patches can be enabled both at a high level as an new option to OsdMesh, or more directly when adaptively refining or construction the patch tables in FarTopologyRefinerAdaptiveOptions and FarPatchTableFactoryOptions. Given the improved accuracy and reduced patches by the use of simple regular patches, we would prefer that this be the default behavior, but it was made an explicit option in order to avoid disrupting existing usage. In a future major release this feature will hopefully be the norm. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc EvalPatchesVarying EvalPatchesFaceVarying OsdCpuPatchTable, GLPatchTable, etc GetFVarPatchArrayBuffer GetFVarPatchIndexBuffer GetFVarPatchIndexSize GetFVarPatchParamBuffer GetFVarPatchParamSize GetNumFVarChannels GetVaryingPatchArrayBuffer GetVaryingPatchIndexBuffer GetVaryingPatchIndexSize OsdMeshBits member MeshFVarAdaptive member MeshUseInfSharpPatch OsdPatchParam IsRegular Unnormalize extensions to Set OsdGLSLPatchShaderSource, HLSLPatchShaderSource GetPatchBasisShaderSource FarLimitStencil GetDuuWeights GetDuvWeights GetDvvWeights extensions to LimitStencil FarLimitStencilTable GetDuuWeights GetDuvWeights GetDvvWeights Update2ndDerivs extensions to LimitStencilTable FarLimitStencilTableFactoryOptions member generate1stDerivatives member generate1stDerivatives extensions to LimitTableStencilFactoryCreate FarPatchParam IsRegular Unnormalize extensions to Set FarPatchTable ComputeLocalPointValuesFaceVarying ComputeLocalPointValuesVarying GetFVarPatchDescriptor GetFVarPatchParam GetNumLocalPointsFaceVarying GetNumLocalPointsVarying GetPatchArrayVaryingVertices GetPatchArrayFVarPatchParam GetPatchArrayFVarValues GetPatchFVarPatchParam GetPatchVaryingVertices GetVaryingPatchDescriptor GetVaryingVertices EvaluateBasisFaceVarying EvaluateBasisVarying extensions to EvaluateBasis FarPatchTableFactoryOptions member useInfSharpPatch member genenerateFVarLegacyLinearPatches FarTopologyLevel DoesEdgeFVarTopologyMatch DoesFaceFVarTopologyMatch DoesVertexFVarTopologyMatch IsEdgeBoundary IsEdgeNonManifold IsVertexBoundary IsVertexNonManifold FarTopologyRefinerAdaptiveOptions member secondaryLevel member useInfSharpPatch member considerFVarChannels Other Changes Improvements Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"release_31.html\"\n- }, {\n \"title\": \"Overview of Release 3.0\",\n \"text\": \"Overview of Release 3.0 Overview of Release 3.0 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Release 3.0 Subdivision Core Sdc Topology and Refinement Limit Properties and Patches Faster Evaluation and Display Updated Source-Code Style Documentation and Tutorials Additional Resources Porting Guide Subdivision Compatibility Release 3.0 OpenSubdiv 3.0 represents a landmark release, with profound changes to the core algorithms, simplified APIs, and streamlined GPU execution. Providing faster, more efficient, and more flexible subdivision code remains our principal goal. To achieve this, OpenSubdiv 3.0 introduces many improvements that constitute a fairly radical departure from previous versions. This document highlights some of the major changes that have gone in to the 3.0 release. Subdivision Core Sdc In consideration of past, present and future topological representations, all low-level details fundamental to subdivision and the specific subdivision schemes have been factored into a new low-level layer called Sdc SubDivision Core. This layer encapsulates the full set of applicable options, the formulae required to support semi-sharp creasing, the formulae for the refinement masks of each subdivision scheme, etc. As initially conceived, its goal was often expressed as separating the math from the mesh. Sdc provides the low-level nuts and bolts to provide a subdivision implementation consistent with OpenSubdiv. It is used by OpenSubdivs libraries and may also be useful in providing an existing clients implementation with the details necessary to make that implementation consistent with OpenSubdiv. Topology and Refinement OpenSubdiv 3.0 introduces a new intermediate internal topological representation named Vtr Vectorized Topology Representation. Compared to the Hbr library used in previous versions, Vtr is much more efficient for the kinds of topological analysis required by Far and is more flexible. While Hbr is no longer used by OpenSubdiv, it will remain in the source distribution for legacy and regression purposes. Faster Subdivision A major focus of the 3.0 release is performance, and the improvement to the initial refinement of a mesh required for topological analysis is close to an order magnitude often much more for uniform, but less for adaptive. Supporting for Non-manifold Topology With topology conversion no longer constrained by Hbr, OpenSubdiv is no longer restricted to meshes of manifold topology. With one exception non-triangles with Loop subdivision, any set of faces and vertices that can be represented in common container formats such as Obj or Alembic can be represented and subdivided. With future efforts to bring the functionality for the Loop scheme up to par with Catmark, that last remaining topological restriction will be removed. Simpler Conversion of Topology Several entry-points are now available for client topology, rather than the single incremental assembly of an HbrMesh that previously existed. The new topological relationships can be populated using either a high-level interface where simplicity has been emphasized, or a more complex lower-level interface for enhanced efficiency. Face Varying Topology Previously, face-varying data was assigned by value to the vertex for each face, and whether or not the set of values around a vertex was continuous was determined by comparing these values later. In some cases this could result in two values that were not meant to be shared being welded together. Face-varying data is now specified topologically just as the vertex topology is defined from a set of vertices and integer references indices to these vertices for the corner of each face, face-varying topology is defined from a set of values and integer references indices to these values for the corner of each face. So if values are to be considered distinct around a vertex, they are given distinct indices and no comparison of any data is ever performed. Note that the number of vertices and values will typically differ, but since indices are assigned to the corners of all faces for both, the total number of indices assigned to all faces will be the same. This ensures that OpenSubdivs face-varying topology matches what is often specified in common geometry container formats like Obj, Alembic and USD. Multiple channels of face-varying data can be defined and each is topologically independent of the others. Limit Properties and Patches A fundamental goal of OpenSubdiv is to provide an accurate and reliable representation of the limit surface. Improvements have been made both to the properties positions and tangents at discrete points in the subdivision hierarchy, as well as to the representations of patches used for the continuous limit surface between them. Removed Fixed Valence Tables Limit properties of extra-ordinary vertices are computed for arbitrary valence and new patch types no longer rely on small table sizes. All tables that restricted the valence of a vertex to some relatively small table size have now been removed. The only restriction on valence that exists is within the new topology representation, which restricts it to the size of an unsigned 16-bit integer 65,535. This limit could also be removed, by recompiling with a certain size changed from 16- to 32-bits, but doing so would increase the memory cost for all common cases. We feel the 16-bit limit is a reasonable compromise. Single Crease Patch OpenSubdiv 3.0 newly implements efficient evaluation of semi-smooth creases using single crease patches. With this optimization, high-order edge sharpness tags can be handled very efficiently for both computation time and memory consumption. Niessner et al., Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces. Eurographics Short Papers. 2012. httpresearch.microsoft.comen-usumpeoplecloopEG2012.pdf New Irregular Patch Approximations While legacy Gregory patch support is still available, we have introduced several new options for representing irregular patches Legacy Gregory, fast Gregory Basis stencils, and BSpline patches. Gregory basis stencils provide the same high quality approximation of Legacy Gregory patches, but execute considerably faster with a simpler GPU representation. While BSpline patches are not as close an approximation as Gregory patches, they enable an entire adaptively refined mesh to be drawn with screen space tessellation via a single global shader configuration Gregory Basis patches require one additional global shader configuration. The new implementations of the GregoryBasis and BSpline approximations relax the previous max valence limit. Legacy Gregory patch still has a limitation of max valence typically 24, depending on the hardware capability of GL_MAX_VARYING_VECTORS. Users are still encouraged to use models with vertices of low valence for both improved model quality and performance. Faster Evaluation and Display OpenSubdiv 3.0 also introduces new data structures and algorithms that greatly enhance performance for the common case of repeated evaluation both on the CPU and GPU. Introducing Stencil Tables OpenSubdiv 3.0 replaces the serialized subdivision tables with factorized stencil tables. The SubdivisionTables class of earlier releases contained a large number of data inter-dependencies, which incurred penalties from fences or force additional kernel launches. Most of these dependencies have now been factorized away in the pre-computation stage, yielding stencil tables FarStencilTable instead. Stencils remove all data dependencies and simplify all the computations into a single trivial kernel. This simplification results in a faster pre-computation stage, faster execution on GPU, with less driver overhead. The new stencil tables Compute back-end is supported on all the same platforms as previous releases except GCD. Faster, Simpler GPU Kernels On the GPU side, the replacement of subdivision tables with stencils greatly reduces bottlenecks in compute, yielding as much as a 4x interpolation speed-up. At the same time, stencils reduce the complexity of interpolation to a single kernel launch per primitive, a critical improvement for mobile platforms. As a result of these changes, compute batching is now trivial, which in turn enabled API simplifications in the Osd layer. Unified Adaptive Shaders Adaptive tessellation shader configurations have been greatly simplified. The number of shader configurations has been reduced from a combinatorial per-patch explosion down to a constant two global configurations. This massive improvement over the 2.x code base results in significantly faster load times and a reduced per-frame cost for adaptive drawing. Similar to compute kernel simplification, this shader simplification has resulted in additional simplifications in the Osd layer. Updated Source-Code Style OpenSubdiv 3.0 replaces naming prefixes with C namespaces for all API layers, bringing the source style more in line with contemporary specifications mostly inspired from the Google C Style Guide . The large-scale changes introduced in this release generally break compatibility with existing client-code. However, this gives us the opportunity to effect some much needed updates to our code-style guidelines and general conventions, throughout the entire OpenSubdiv code-base. We are hoping to drastically improve the quality, consistency and readability of the source code. Documentation and Tutorials The documentation has been reorganized and fleshed out. This release introduces a number of new tutorials . The tutorials provide an easier entry point for learning the API than do the programs provided in examples. The examples provide more fleshed out solutions and are a good next step after the tutorials are mastered. Additional Resources Porting Guide Please see the Porting Guide for help on how to port existing code written for OpenSubdiv 2.x to the new 3.0 release. Subdivision Compatibility The 3.0 release has made some minor changes to the subdivision specification and rules. See Subdivision Compatibility for a complete list. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"release_30.html\"\n }, {\n- \"title\": \"Porting Guide 2.x to 3.0\",\n- \"text\": \"Porting Guide 2.x to 3.0 Porting Guide 2.x to 3.0 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Porting Guide 2.x to 3.0 Source Code Organization Hbr Layer Translation Subdivision Schemes and Options in Sdc Specifying Face Varying Topology and Options Far Layer Translation Ordering of Refined Vertices Osd Layer Translation Controller Objects ComputeContext, DrawContext EvalLimitContext OsdMesh OsdKernelBatch OsdVertex Feature Adaptive Shader Changes End Cap Strategies Changes to Subdivision Build Support for Combining 2.x and 3.0 Porting Guide 2.x to 3.0 This document is a high-level description of how to port exiting OpenSubdiv 2.x code to use OpenSubdiv 3.0. NOTE If your questions are not answered here, please contact us on the OpenSubdiv forum and we will be happy to help Source Code Organization Given the scale of functional changes that were being made to the public interface, we took the opportunity in 3.0 to update the coding style and organization -- most notably making use of namespaces for each library. Subdirectory Namespace Relevance hbr NA Historical, no longer used sdc Sdc New, low-level, public options, constants, etc. vtr Vtr New, internal use, topology representation far Far Revised, similar functionality with new API osd Osd Revised, similar functionality with new API Hbr Layer Translation Client mesh topology is now translated into an instance of FarTopologyRefiner instead of HbrMesh. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshVTX_TYPE FarTopologyRefiner The FarTopologyRefiner is now the core representation of topology from which all other major classes in Far and Osd are constructed. It was designed to support efficient refinement uniform or sparse of a base mesh of arbitrary topology no manifold restrictions. Once constructed it can be directly refined to meet some need, or passed to other contexts that will refine it to meet their needs. In contrast to directly assembling an HbrMesh, the TopologyRefiner, like other classes in Far, requires a Factory class for its construction. One of the early goals of these factories was to allow a client to convert their existing boundary representation -- with its full topological traversal abilities -- directly into the TopologyRefiners representation. While this is now possible, this also represents the most complex construction process and is only recommended for usage where this conversion process is critical. Details on how to construct a TopologyRefiner can be found in the Far overview documentation. Additionally, documentation for FarTopologyRefinerFactoryMESH outlines the requirements, and Far tutorial 3.1 tutorialsfartutorial_3_1 provides an example of a factory for directly converting HbrMeshes to TopologyRefiners. Its worth a reminder here that FarTopologyRefiner contains only topological information which does include sharpness, since that is considered relating to subdivision topology and not the positions or other data associated with a mesh. While HbrMeshT required some definition of a vertex type T and dimensions of face-varying data, TopologyRefiner is more clearly separated from the data. So the construction of the TopologyRefiner does not involve data specification at all. Subdivision Schemes and Options in Sdc The creation of a new TopologyRefiner requires specification of a subdivision scheme and a set of options that are applicable to all schemes. With HbrMesh, the scheme was specified by declaring a static instance of a specific subclass of a subdivision object, and the options were specified with a number of methods on the different classes. Such general information about the schemes has now been encapsulated in the Sdc layer for use throughout OpenSubdiv. The subdivision scheme is now a simple enumerated type SdcSchemeType and the entire set of options that can be applied to a scheme is encapsulated in a single simple struct of flags and enumerated types SdcOptions. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshTSetInterpolateBoundaryMethod SdcOptionsSetVtxBoundaryInterpolation HbrMeshTSetFVarInterpolateBoundaryMethod SdcOptionsSetFVarLinearInterpolation HbrSubdivisionTSetCreaseSubdivisionMethod SdcOptionsSetCreasingMethod Specifying Face Varying Topology and Options Both the way in which face varying data is associated with a mesh and the options used to control its interpolation have changed. The documentation on Compatibility with OpenSubdiv 2.x details the equivalence of interpolation options between Hbr and the new SdcOptionsFVarLinearInterpolation enum, while the section on Face Varying Interpolation illustrates their effects. Face varying data is now specified by index rather than by value, or as often stated, it is specified topologically. Just as vertices for faces are specified by indices into a potential buffer of positions, face varying values are specified by indices into a potential buffer of values. Both vertices and face varying values frequently referred to as FVarValues in the API are assigned and associated with the corners of all faces. In many cases this will simplify representation as many common geometry container formats such as Obj or Alembic specify texture coordinates the same way. For other cases, where a value per face-corner is provided with no indication of which values incident each vertex should be considered shared, it will be necessary to determine shared indices for values at each vertex if any non-linear interpolation is desired. Far Layer Translation While TopologyRefiner was introduced into Far as the new intermediate topology representation, several other changes were made to classes in Far to provide more modular building blocks for use by the Osd layer or directly. OpenSubdiv 2.x OpenSubdiv 3.0 FarMeshU NA, no longer needed FarSubdivisionTables FarStencilTable FarPatchTables FarPatchTable Ordering of Refined Vertices The FarMesh was previously responsible for refining an HbrMesh -- generating new vertices and faces in successive levels of refinement in the FarSubdivisionTables. Vertices were grouped and reordered from the native ordering of HbrMesh so that vertices requiring similar processing were consecutive. Such grouping alleviated most of the idiosyncrasies of HbrMeshs native ordering but not all. FarToplogyRefiner is inherently a collection of refinement levels, and within each refined level so excluding the base level, all components are still grouped for the same reasons. There are two issues here though the ordering of these groups has changed though an option exists to preserve it the ordering of components within these groups is not guaranteed to have been preserved Vertices in a refined level are grouped according to the type of component in the parent level from which they originated, i.e. some vertices originate from the center of a face face-vertices, some from an edge edge-vertices and some from a vertex vertex-vertices. Note that there is a conflict in terminology here -- face-vertices and edge-vertices most often refer to vertices incident a face or edge -- but for the sake of this discussion, we use them to refer to the component from which a child vertex originates. The following table shows the ordering of these groups in 2.x and the two choices available in 3.0. The option is the orderVerticesFromFacesFirst flag that can be set in the Option structs passed to the uniform and adaptive refinement methods of TopologyRefiner Version and option Vertex group ordering 2.x face-vertices, edge-vertices, vertex-vertices 3.0 default vertex-vertices, face-vertices, edge-vertices 3.0 orderVerticesFromFacesFirst true face-vertices, edge-vertices, vertex-vertices The decision to change the default ordering was based on common feedback the rationale was to allow a trivial mapping from vertices in the cage to their descendants at all refinement levels. While the grouping is fundamental to the refinement process, the ordering of the groups is internally flexible, and the full set of possible orderings can be made publicly available in future if there is demand for such flexibility. The ordering of vertices within these groups was never clearly defined given the way that HbrMesh applied its refinement. For example, for the face-vertices in a level, it was never clear which face-vertices would be first as it depended on the order in which HbrMesh traversed the parent faces and generated them. Given one face, HbrMesh would often visit neighboring faces first before moving to the next intended face. The ordering with FarTopologyRefiner is much clearer and predictable. Using the face-vertices as an example, the order of the face-vertices in level N1 is identical to the order of the parent faces in level N from which they originated. So if we have face-vertices Vi , Vj and Vk at some level, originating from faces Fi , Fj and Fk in the previous level, they will be ordered in increasing order of i , j and k . For uniform refinement the ordering of face vertices Vi will therefore exactly match the ordering of the parent faces Fi . For adaptive or otherwise sparse refinement, the subset of Vi will be ordered similarly, just with components missing from those not refined. The same is true of all vertices, i.e. edge-vertices and vertex-vertices, and also for other components in refined levels, i.e. the child faces and edges. For child faces and edges, more than one will originate from the same parent face or edge. In addition to the overall ordering based on the parent faces or edges, another ordering is imposed on multiple children originating from the same face or edge. They will be ordered based on the corner or end-vertex with which they are associated. In the case of refined faces, another way to view the ordering is to consider the way that faces are originally defined -- by specifying the set of vertices for the corners of each face, often aggregated into a single large array. The ordering of the set of refined faces for each level will correspond directly to such an array of vertices per face in the previous level. Osd Layer Translation Two big changes in the 3.0 API have allowed the Osd layer to be significantly simpler, the first is the move to stencil tables from subdivision tables and the second is shader simplification. With this refactoring, the focus has been to use more meaningful names and to make the data contained within an object more apparent. Controller Objects The API-specific ComputeController has been replaced with the Evaluator . It reflects the fact that stencil compute batches are significantly simpler than subdivision table compute batches. The name Evaluator was chosen with the hope that is more meaningful than the generic ComputeController moniker the Evaluator evaluates stencil and patch tables. In the 2.x code base, subdiv level buffers were always required to be allocated contiguously, however in 3.0 with the shift to stencil tables, this strict allocation scheme is no longer required. As a result, the EvalStencils and EvalPatches methods now accept both a source and a destination descriptor. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeControllerRefine Osd...EvaluatorEvalStencils ComputeControllerSynchronize Osd...EvaluatorSynchronize EvalStencilsControllerUpdateValues Osd...EvaluatorEvalStencils EvalStencilsControllerUpdateDerivs Osd...EvaluatorEvalStencils EvalLimitControllerEvalLimitSample Osd...EvaluatorEvalPatches Also note that OsdVertexDescriptor has been renamed, however its data members and semantic purpose remains the same OpenSubdiv 2.x OpenSubdiv 3.0 OsdVertexBufferDescriptor OsdBufferDescriptor ComputeContext, DrawContext ComputeContext and DrawContext have been replaced with API-specific StencilTable and PatchTable objects, for example OsdGLStencilTableSSBO. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeContext Osd...StencilTable e.g. GLStencilTableTBO EvalStencilsContext Osd...StencilTable DrawContext Osd...PatchTable e.g. GLPatchTable EvalLimitContext The data stored in EvalLimitContext has been merged into the Evaluator class as well. EvalCoords have been moved into their own type, OsdPatchCoords. The primary change here is that the PTex face ID is no longer part of the data structure, rather the client can use a FarPatchMap to convert from PTex face ID to a FarPatchTablePatchHandle. OpenSubdiv 2.x OpenSubdiv 3.0 EvalLimitContext PatchTable EvalLimitContextEvalCoords OsdPatchCoords types.h OsdMesh While not strictly required, OsdMesh is still supported in 3.0 as convenience API for allocating buffers. OsdMesh serves as a simple way to allocate all required data, in the location required by the API for example, GPU buffers for OpenGL. OsdKernelBatch No translation, it is no longer part of the API. OsdVertex No translation, it is no longer part of the API. Feature Adaptive Shader Changes In 3.0, the feature adaptive screen-space tessellation shaders have been dramatically simplified, and the client-facing API has changed dramatically as well. The primary shift is to reduce the total number of shader combinations, and as a result, some of the complexity management mechanisms are no longer necessary. In the discussion below, some key changes are highlighted, but deep integrations may require additional discussion please feel free to send follow up questions to the OpenSubdiv google group. The number of feature adaptive shaders has been reduced from N to exactly 1 or 2, depending on how end-caps are handled. Osd layer no longer compiles shaders, rather it returns shader source for the client to compile. This source is obtained via OsdGLSLHLSLPatchShaderSource. The API exposed in shaders to access patch-based data has been consolidated and formalized, see osdglslPatchCommon.glsl and osdhlslPatchCommon.hlsl for details. Patches are no longer rotated and transition patches have been eliminated, simplifying PatchDescriptor to a 4 bits. Additionally, FarPatchTablesDescriptor has been moved into its own class in the Far namespace. The following table outlines the API translation between 2.x and 3.0 OpenSubdiv 2.x OpenSubdiv 3.0 OsdDrawContextPatchDescriptor NA, no longer needed. OsdDrawContextPatchArray OSdPatchArray types.h FarPatchTablesPatchDescriptor FarPatchDescriptor patchDescriptor.h FarPatchTablesPatchArray made private. End Cap Strategies By default, OpenSubdiv uses Gregory patches to approximate the patches around extraordinary vertices at the maximum isolation level, this process is referred to as end-capping. If ENDCAP_BSPLINE_BASIS is specified to PatchTableFactoryOptions, BSpline patches are used, which gives less accuracy, but it makes possible to render an entire mesh in a single draw call. Both patches require additional control points that are not part of the mesh, we refer to these as local points. In 3.0, the local points of those patches are computed by applying a stencil table to refined vertices to construct a new stencil table for the local points. Since this new stencil table is topologically compatible with the primary stencil table for refinement, it is convenient and efficient to splice those stencil tables together. This splicing can be done in the following way FarStencilTable const refineStencils FarStencilTableFactoryCreatetopologyRefiner FarPatchTable cosnt patchTable FarPatchTableFactoryCreatetopologyRefiner FarStencilTable const localPointStencils patchTable-GetLocalPointStencilTable FarStencilTable const splicedStencils FarStencilTableFactoryAppendLocalPointStencilTablestopologyRefiner, refineStencils, localPointStencils NOTE Once the spliced stencil table is created, the refined stencils can be released, but the local point stencils are owned by patchTable, it should not be released. OpenSubdiv 3.0 also supports 2.x style Gregory patches, if ENDCAP_LEGACY_GREGORY is specified to PatchTableFactoryOptions. In this case, such an extra stencil splicing isnt needed, however clients must still bind additional buffers VertexValence buffer and QuadOffsets buffer. See OsdGLLegacyGregoryPatchTable for additional details. Changes to Subdivision The refactoring of OpenSubdiv 3.0 data representations presented a unique opportunity to revisit some corners of the subdivision specification and remove or update some legacy features -- none of which was taken lightly. More details are provided in Subdivision Compatibility , while the following offers a quick overview All face-varying interpolation options have been combined into a single enum. Vertex interpolation options have been renamed or removed The naming of the standard creasing method has changed from Normal to Uniform . Unused legacy modes of the smoothtriangle option have been removed. The averaging of Chaikin creasing with infinitely sharp edges has changed. Support for Hierarchical Edits has been removed. Build Support for Combining 2.x and 3.0 Running OpenSubdiv 2.0 and 3.0 in a single process is supported, however some special care must be taken to avoid namespace collisions, both in terms of run-time symbols avoid using OpenSubdivOsd, for example and in terms of build-time search paths. To support both OpenSubdiv 2.0 and 3.0 in your build environment, you can prefix the header install directory of OpenSubdiv 3.0. Do this using the build flag CMAKE_INCDIR_BASE when configuring cmake i.e. -DCMAKE_INCDIR_BASEincludeopensubdiv3 and then including files from opensubdiv3... in client code. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"title\": \"Overview of Release 3.1\",\n+ \"text\": \"Overview of Release 3.1 Overview of Release 3.1 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE New Features Bicubic Face-Varying Patches Varying and Face-Varying Evaluation Second Order Derivative Evaluation Separate Levels of Feature Isolation Sharp Patches for Infinitely Sharp Features API Additions OsdCpuEvaluator, GLComputeEvaluator, etc OsdCpuPatchTable, GLPatchTable, etc OsdMeshBits OsdPatchParam OsdGLSLPatchShaderSource, HLSLPatchShaderSource FarLimitStencil FarLimitStencilTable FarLimitStencilTableFactoryOptions FarPatchParam FarPatchTable FarPatchTableFactoryOptions FarTopologyLevel FarTopologyRefinerAdaptiveOptions Other Changes Improvements Bug Fixes New Features Bicubic Face-Varying Patches The motivation for this feature is to improve drawing and evaluation of face-varying primvar values for all face-varying interpolation options . A common use of non-linear face-varying data is to capture a UV projection on the surface. The following example shows a simple shape with the face-varying interpolation option assigned to a non-linear choice to achieve the desired projection in this case FVAR_LINEAR_NONE Linear Face-Varying Patches Bicubic Face-Varying Patches The result on the left shows the old linearly interpolated patches, which ignores any non-linear settings. The result on the right shows the new use of bicubic face-varying patches to accurately interpolate the desired projection. Generation of a full face-varying patch representation can be enabled using a new option in FarPatchTableFactoryOptions. Additionally, topological refinement can be improved to consider fvar channel topology using a new option in FarTopologyRefinerAdaptiveOptions. See the API additions below and their associated Doxygen text for more details. Evaluation of patch basis weights for all patch types as been added to the GPU shader source provided by OsdGLSLPatchShaderSource, and OsdHLSLPatchShaderSource. Use of non-linear face-varying patches increases the storage size of the patch table and may also require additional data access and computation while drawing. Varying and Face-Varying Evaluation This feature extends existing evaluation methods to support evaluation of varying and face-varying primvar data at arbitrary limit surface locations. Varying Primvar Evaluation Face-Varying Primvar Evaluation The image on the left shows evaluation of varying primvar values and the image on the right shows evaluation of face-varying primvar values. The EvaluateBasis API of FarPatchTable has been extended as well as the OSD Evaluator API. Second Order Derivative Evaluation This feature extends the FarLimitStencilTable and FarPatchTable interfaces to support evaluation of 2nd order partial derivatives. The generation of derivative values for FarLimitStencilTable is controlled by new options that can be specified when creating the stencil table. Additionally, the implementation exposes a more accurate method to compute derivatives for Gregory basis patches. This can be enabled using the CMake configuration and compile time definition OPENSUBDIV_GREGORY_EVAL_TRUE_DERIVATIVES. Separate Levels of Feature Isolation The primary motivation for this feature is to reduce the number of patches generated by adaptive refinement when they can be adequately represented at a lower level. A single level of isolation must be as high as the greatest semi-sharp feature to properly resolve the shape of that feature. That high isolation level generates many unnecessary patches for smooth extra-ordinary vertices. In the following example, a single semi-sharp vertex is refined to level 5 Single Isolation Level 5 Primary Level 5, Secondary Level 2 Single isolation to level 5 on the left results in 312 patches. The right shows the semi-sharp feature isolated to 5, but with the new secondary level set to 2, the number of patches is reduced to 123. The second specified level of adaptive refinement is used to halt isolation for features that typically do not require the specified maximum. These include interior and boundary extra-ordinary vertices and those infinitely sharp patches that correspond to boundary extra-ordinary patches. The secondary level is available as a new option in FarTopologyRefinerAdaptiveOptions. Sharp Patches for Infinitely Sharp Features The motivation for sharp patches is to accurately represent the limit surface of infinitely sharp features, which otherwise can only be approximated by very high levels of adaptive refinement, resulting in many unnecessary patches. The true limit surface for regular faces along an infinitely sharp crease is a regular B-Spline patch -- the same as regular faces along a boundary. Similarly, the limit surface for faces around an extra-ordinary vertex on an infinitely sharp crease is the same as that of faces around an extra-ordinary vertex on a boundary. So these patches are identified and isolated to the same degree -- the regular patches as soon as possible, and the irregular patches to the depth specified. Consider the following regressionshapecatmark_cube_creases2 Level 5 without Sharp Patches Level 5 with Sharp Patches Level 2 with Sharp Patches Without use of sharp patches on the left, isolating to level 5 generates 1764 patches and does still not capture the sharp edges. With sharp patches in the center, isolating to the same degree level 5 reduces the number of patches to 96 and captures the sharp edges. The sharp features can be captured at a lower degree with comparable accuracy as illustrated on the right where isolation to level 2 further reduces the number of patches to 42. The use of infinitely sharp patches can be enabled both at a high level as an new option to OsdMesh, or more directly when adaptively refining or construction the patch tables in FarTopologyRefinerAdaptiveOptions and FarPatchTableFactoryOptions. Given the improved accuracy and reduced patches by the use of simple regular patches, we would prefer that this be the default behavior, but it was made an explicit option in order to avoid disrupting existing usage. In a future major release this feature will hopefully be the norm. API Additions See associated Doxygen for full details. OsdCpuEvaluator, GLComputeEvaluator, etc EvalPatchesVarying EvalPatchesFaceVarying OsdCpuPatchTable, GLPatchTable, etc GetFVarPatchArrayBuffer GetFVarPatchIndexBuffer GetFVarPatchIndexSize GetFVarPatchParamBuffer GetFVarPatchParamSize GetNumFVarChannels GetVaryingPatchArrayBuffer GetVaryingPatchIndexBuffer GetVaryingPatchIndexSize OsdMeshBits member MeshFVarAdaptive member MeshUseInfSharpPatch OsdPatchParam IsRegular Unnormalize extensions to Set OsdGLSLPatchShaderSource, HLSLPatchShaderSource GetPatchBasisShaderSource FarLimitStencil GetDuuWeights GetDuvWeights GetDvvWeights extensions to LimitStencil FarLimitStencilTable GetDuuWeights GetDuvWeights GetDvvWeights Update2ndDerivs extensions to LimitStencilTable FarLimitStencilTableFactoryOptions member generate1stDerivatives member generate1stDerivatives extensions to LimitTableStencilFactoryCreate FarPatchParam IsRegular Unnormalize extensions to Set FarPatchTable ComputeLocalPointValuesFaceVarying ComputeLocalPointValuesVarying GetFVarPatchDescriptor GetFVarPatchParam GetNumLocalPointsFaceVarying GetNumLocalPointsVarying GetPatchArrayVaryingVertices GetPatchArrayFVarPatchParam GetPatchArrayFVarValues GetPatchFVarPatchParam GetPatchVaryingVertices GetVaryingPatchDescriptor GetVaryingVertices EvaluateBasisFaceVarying EvaluateBasisVarying extensions to EvaluateBasis FarPatchTableFactoryOptions member useInfSharpPatch member genenerateFVarLegacyLinearPatches FarTopologyLevel DoesEdgeFVarTopologyMatch DoesFaceFVarTopologyMatch DoesVertexFVarTopologyMatch IsEdgeBoundary IsEdgeNonManifold IsVertexBoundary IsVertexNonManifold FarTopologyRefinerAdaptiveOptions member secondaryLevel member useInfSharpPatch member considerFVarChannels Other Changes Improvements Enabled the use of CMakes folder feature Removed the use of iso646 alternative keywords and, or, not, etc. to improve portability Added numerical valued preprocessor directives OPENSUBDIV_VERSION_MAJOR, etc. to opensubdivversion.h Improved documentation for FarPatchParam and added Unnormalize to complement Normalize Added additional topology queries to FarTopologyLevel Updated glFVarViewer and glEvalLimit viewer to make use of bicubic face-varying patches Updated glViewer and dxViewer to add a toggle for InfSharpPatch Updated dxPtexViewer for improved feature parity with glPtexViewer Improved far_regression to exercise shapes independent of Hbr compatibility Added support for Appveyor continuous integration testing Removed cmakeFindIlmBase Removed mayaPolySmooth example Bug Fixes Fixed Ptex version parsing and compatibility issues Fixed compatibility issues with VS2015 Fixed bug interpolating face-varying data with Bilinear scheme Fixed bug with refinement using Chaikin creasing Fixed bugs with HUD sliders in the example viewers Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n- \"loc\": \"porting.html\"\n+ \"loc\": \"release_31.html\"\n }, {\n \"title\": \"References\",\n \"text\": \"References References 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE References References Analytic Displacement Mapping using Hardware Tessellation Matthias Niessner, Charles Loop ACM Transactions on Graphics, Vol. 32 No. 3 Article 26 June 2013 httpresearch.microsoft.comen-usumpeoplecloopTOG2013.pdf httpdoi.org10.11452487228.2487234 Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, Mark Meyer, and Tony DeRose ACM Transactions on Graphics, Vol. 31 No. 1 Article 6 January 2012 httpresearch.microsoft.comen-usumpeopleclooptog2012.pdf httpdoi.org10.11452077341.2077347 Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, and Guenter Greiner. Eurographics Proceedings, Cagliari, 2012 httpresearch.microsoft.comen-usumpeoplecloopEG2012.pdf httpdoi.org10.2312confEG2012short041-044 Approximating Subdivision Surfaces with Gregory Patches for Hardware Tessellation Charles Loop, Scott Schaefer, Tianyun Ni, Ignacio Castano SIGGRAPH Asia Conference Proceedings 2009 httpwww.dgp.toronto.edupeoplestamrealityResearchpdfsig98.pdf httpdoi.org10.11451661412.1618497 GPU Smoothing of Quad Meshes T. L. Ni, Y. Yeo, A. Myles, V. Goel and J. Peters Proc. IEEE SMI 2008 httpwww.cise.ufl.eduresearchSurfLabpaperssmi08.pdf httpdoi.org10.1109SMI.2008.4547938 Fast Parallel Construction of Smooth Surfaces from Meshes with TriQuadPent Facets A. Myles and T. Ni and J. Peters Eurographics Symposium on Geometry Processing 2008 httpswww.cise.ufl.eduresearchSurfLabpapers08poly.pdf httpdoi.org10.1111j.1467-8659.2008.01276.x Approximating Catmull-Clark Subdivision Surfaces with Bicubic Patches Charles Loop, Scott Schaefer ACM Transactions on Graphics, Vol. 27 No. 1 Article 8 March 2008 httpresearch.microsoft.comen-usumpeoplecloopacctog.pdf httpdoi.org10.11451330511.1330519 Rapid Evaluation of Catmull-Clark Subdivision Surfaces Jeffrey Bolz and Peter Schroder Web3D Proceedings 2002 httpwww.multires.caltech.edupubsfastsubd.pdf httpdoi.org10.1145504502.504505 Piecewise Smooth Subdivision Surfaces with Normal Control Henning Biermann, Adi Levin and Denis Zorin SIGGRAPH 2000 Conference Proceedings httpmrl.nyu.edudzorinpapersbiermann2000pss.pdf httpdoi.org10.1145344779.344841 Subdivision for Modeling and Animation Denis Zorin, Peter Schroder Course Notes of SIGGRAPH 1999 httpwww.multires.caltech.edupubssig99notes.pdf Exact Evaluation of Catmull-Clark Subdivision Surfaces at Arbitrary Parameter Values Jos Stam SIGGRAPH 98 Conference Proceedings, Annual Conference Series, July 1998 httpwww.dgp.toronto.edupeoplestamrealityResearchpdfsig98.pdf httpdoi.org10.1145280814.280945 Subdivision Surfaces in Character Animation Tony DeRose, Michael Kass, Tien Truong Proceedings of SIGGRAPH 1998 httpgraphics.pixar.comlibraryGeripaper.pdf httpdoi.org10.1145280814.280826 Efficient, Fair Interpolation Using Catmull-Clark Surfaces Mark Halstead, Michael Kass, Tony DeRose SIGGRAPH 93 Conference Proceedings httpgraphics.pixar.comlibraryFairSubdivisionpaper.pdf httpdoi.org10.1145166117.166121 Recursively generated B-spline surfaces on arbitrary topological meshes Catmull, E. Clark, J. Computer-Aided Design 10 6 1978 httpdoi.org10.10160010-448528782990110-0 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"references.html\"\n }, {\n+ \"title\": \"Porting Guide 2.x to 3.0\",\n+ \"text\": \"Porting Guide 2.x to 3.0 Porting Guide 2.x to 3.0 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Porting Guide 2.x to 3.0 Source Code Organization Hbr Layer Translation Subdivision Schemes and Options in Sdc Specifying Face Varying Topology and Options Far Layer Translation Ordering of Refined Vertices Osd Layer Translation Controller Objects ComputeContext, DrawContext EvalLimitContext OsdMesh OsdKernelBatch OsdVertex Feature Adaptive Shader Changes End Cap Strategies Changes to Subdivision Build Support for Combining 2.x and 3.0 Porting Guide 2.x to 3.0 This document is a high-level description of how to port exiting OpenSubdiv 2.x code to use OpenSubdiv 3.0. NOTE If your questions are not answered here, please contact us on the OpenSubdiv forum and we will be happy to help Source Code Organization Given the scale of functional changes that were being made to the public interface, we took the opportunity in 3.0 to update the coding style and organization -- most notably making use of namespaces for each library. Subdirectory Namespace Relevance hbr NA Historical, no longer used sdc Sdc New, low-level, public options, constants, etc. vtr Vtr New, internal use, topology representation far Far Revised, similar functionality with new API osd Osd Revised, similar functionality with new API Hbr Layer Translation Client mesh topology is now translated into an instance of FarTopologyRefiner instead of HbrMesh. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshVTX_TYPE FarTopologyRefiner The FarTopologyRefiner is now the core representation of topology from which all other major classes in Far and Osd are constructed. It was designed to support efficient refinement uniform or sparse of a base mesh of arbitrary topology no manifold restrictions. Once constructed it can be directly refined to meet some need, or passed to other contexts that will refine it to meet their needs. In contrast to directly assembling an HbrMesh, the TopologyRefiner, like other classes in Far, requires a Factory class for its construction. One of the early goals of these factories was to allow a client to convert their existing boundary representation -- with its full topological traversal abilities -- directly into the TopologyRefiners representation. While this is now possible, this also represents the most complex construction process and is only recommended for usage where this conversion process is critical. Details on how to construct a TopologyRefiner can be found in the Far overview documentation. Additionally, documentation for FarTopologyRefinerFactoryMESH outlines the requirements, and Far tutorial 3.1 tutorialsfartutorial_3_1 provides an example of a factory for directly converting HbrMeshes to TopologyRefiners. Its worth a reminder here that FarTopologyRefiner contains only topological information which does include sharpness, since that is considered relating to subdivision topology and not the positions or other data associated with a mesh. While HbrMeshT required some definition of a vertex type T and dimensions of face-varying data, TopologyRefiner is more clearly separated from the data. So the construction of the TopologyRefiner does not involve data specification at all. Subdivision Schemes and Options in Sdc The creation of a new TopologyRefiner requires specification of a subdivision scheme and a set of options that are applicable to all schemes. With HbrMesh, the scheme was specified by declaring a static instance of a specific subclass of a subdivision object, and the options were specified with a number of methods on the different classes. Such general information about the schemes has now been encapsulated in the Sdc layer for use throughout OpenSubdiv. The subdivision scheme is now a simple enumerated type SdcSchemeType and the entire set of options that can be applied to a scheme is encapsulated in a single simple struct of flags and enumerated types SdcOptions. OpenSubdiv 2.x OpenSubdiv 3.0 HbrMeshTSetInterpolateBoundaryMethod SdcOptionsSetVtxBoundaryInterpolation HbrMeshTSetFVarInterpolateBoundaryMethod SdcOptionsSetFVarLinearInterpolation HbrSubdivisionTSetCreaseSubdivisionMethod SdcOptionsSetCreasingMethod Specifying Face Varying Topology and Options Both the way in which face varying data is associated with a mesh and the options used to control its interpolation have changed. The documentation on Compatibility with OpenSubdiv 2.x details the equivalence of interpolation options between Hbr and the new SdcOptionsFVarLinearInterpolation enum, while the section on Face Varying Interpolation illustrates their effects. Face varying data is now specified by index rather than by value, or as often stated, it is specified topologically. Just as vertices for faces are specified by indices into a potential buffer of positions, face varying values are specified by indices into a potential buffer of values. Both vertices and face varying values frequently referred to as FVarValues in the API are assigned and associated with the corners of all faces. In many cases this will simplify representation as many common geometry container formats such as Obj or Alembic specify texture coordinates the same way. For other cases, where a value per face-corner is provided with no indication of which values incident each vertex should be considered shared, it will be necessary to determine shared indices for values at each vertex if any non-linear interpolation is desired. Far Layer Translation While TopologyRefiner was introduced into Far as the new intermediate topology representation, several other changes were made to classes in Far to provide more modular building blocks for use by the Osd layer or directly. OpenSubdiv 2.x OpenSubdiv 3.0 FarMeshU NA, no longer needed FarSubdivisionTables FarStencilTable FarPatchTables FarPatchTable Ordering of Refined Vertices The FarMesh was previously responsible for refining an HbrMesh -- generating new vertices and faces in successive levels of refinement in the FarSubdivisionTables. Vertices were grouped and reordered from the native ordering of HbrMesh so that vertices requiring similar processing were consecutive. Such grouping alleviated most of the idiosyncrasies of HbrMeshs native ordering but not all. FarToplogyRefiner is inherently a collection of refinement levels, and within each refined level so excluding the base level, all components are still grouped for the same reasons. There are two issues here though the ordering of these groups has changed though an option exists to preserve it the ordering of components within these groups is not guaranteed to have been preserved Vertices in a refined level are grouped according to the type of component in the parent level from which they originated, i.e. some vertices originate from the center of a face face-vertices, some from an edge edge-vertices and some from a vertex vertex-vertices. Note that there is a conflict in terminology here -- face-vertices and edge-vertices most often refer to vertices incident a face or edge -- but for the sake of this discussion, we use them to refer to the component from which a child vertex originates. The following table shows the ordering of these groups in 2.x and the two choices available in 3.0. The option is the orderVerticesFromFacesFirst flag that can be set in the Option structs passed to the uniform and adaptive refinement methods of TopologyRefiner Version and option Vertex group ordering 2.x face-vertices, edge-vertices, vertex-vertices 3.0 default vertex-vertices, face-vertices, edge-vertices 3.0 orderVerticesFromFacesFirst true face-vertices, edge-vertices, vertex-vertices The decision to change the default ordering was based on common feedback the rationale was to allow a trivial mapping from vertices in the cage to their descendants at all refinement levels. While the grouping is fundamental to the refinement process, the ordering of the groups is internally flexible, and the full set of possible orderings can be made publicly available in future if there is demand for such flexibility. The ordering of vertices within these groups was never clearly defined given the way that HbrMesh applied its refinement. For example, for the face-vertices in a level, it was never clear which face-vertices would be first as it depended on the order in which HbrMesh traversed the parent faces and generated them. Given one face, HbrMesh would often visit neighboring faces first before moving to the next intended face. The ordering with FarTopologyRefiner is much clearer and predictable. Using the face-vertices as an example, the order of the face-vertices in level N1 is identical to the order of the parent faces in level N from which they originated. So if we have face-vertices Vi , Vj and Vk at some level, originating from faces Fi , Fj and Fk in the previous level, they will be ordered in increasing order of i , j and k . For uniform refinement the ordering of face vertices Vi will therefore exactly match the ordering of the parent faces Fi . For adaptive or otherwise sparse refinement, the subset of Vi will be ordered similarly, just with components missing from those not refined. The same is true of all vertices, i.e. edge-vertices and vertex-vertices, and also for other components in refined levels, i.e. the child faces and edges. For child faces and edges, more than one will originate from the same parent face or edge. In addition to the overall ordering based on the parent faces or edges, another ordering is imposed on multiple children originating from the same face or edge. They will be ordered based on the corner or end-vertex with which they are associated. In the case of refined faces, another way to view the ordering is to consider the way that faces are originally defined -- by specifying the set of vertices for the corners of each face, often aggregated into a single large array. The ordering of the set of refined faces for each level will correspond directly to such an array of vertices per face in the previous level. Osd Layer Translation Two big changes in the 3.0 API have allowed the Osd layer to be significantly simpler, the first is the move to stencil tables from subdivision tables and the second is shader simplification. With this refactoring, the focus has been to use more meaningful names and to make the data contained within an object more apparent. Controller Objects The API-specific ComputeController has been replaced with the Evaluator . It reflects the fact that stencil compute batches are significantly simpler than subdivision table compute batches. The name Evaluator was chosen with the hope that is more meaningful than the generic ComputeController moniker the Evaluator evaluates stencil and patch tables. In the 2.x code base, subdiv level buffers were always required to be allocated contiguously, however in 3.0 with the shift to stencil tables, this strict allocation scheme is no longer required. As a result, the EvalStencils and EvalPatches methods now accept both a source and a destination descriptor. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeControllerRefine Osd...EvaluatorEvalStencils ComputeControllerSynchronize Osd...EvaluatorSynchronize EvalStencilsControllerUpdateValues Osd...EvaluatorEvalStencils EvalStencilsControllerUpdateDerivs Osd...EvaluatorEvalStencils EvalLimitControllerEvalLimitSample Osd...EvaluatorEvalPatches Also note that OsdVertexDescriptor has been renamed, however its data members and semantic purpose remains the same OpenSubdiv 2.x OpenSubdiv 3.0 OsdVertexBufferDescriptor OsdBufferDescriptor ComputeContext, DrawContext ComputeContext and DrawContext have been replaced with API-specific StencilTable and PatchTable objects, for example OsdGLStencilTableSSBO. OpenSubdiv 2.x OpenSubdiv 3.0 ComputeContext Osd...StencilTable e.g. GLStencilTableTBO EvalStencilsContext Osd...StencilTable DrawContext Osd...PatchTable e.g. GLPatchTable EvalLimitContext The data stored in EvalLimitContext has been merged into the Evaluator class as well. EvalCoords have been moved into their own type, OsdPatchCoords. The primary change here is that the PTex face ID is no longer part of the data structure, rather the client can use a FarPatchMap to convert from PTex face ID to a FarPatchTablePatchHandle. OpenSubdiv 2.x OpenSubdiv 3.0 EvalLimitContext PatchTable EvalLimitContextEvalCoords OsdPatchCoords types.h OsdMesh While not strictly required, OsdMesh is still supported in 3.0 as convenience API for allocating buffers. OsdMesh serves as a simple way to allocate all required data, in the location required by the API for example, GPU buffers for OpenGL. OsdKernelBatch No translation, it is no longer part of the API. OsdVertex No translation, it is no longer part of the API. Feature Adaptive Shader Changes In 3.0, the feature adaptive screen-space tessellation shaders have been dramatically simplified, and the client-facing API has changed dramatically as well. The primary shift is to reduce the total number of shader combinations, and as a result, some of the complexity management mechanisms are no longer necessary. In the discussion below, some key changes are highlighted, but deep integrations may require additional discussion please feel free to send follow up questions to the OpenSubdiv google group. The number of feature adaptive shaders has been reduced from N to exactly 1 or 2, depending on how end-caps are handled. Osd layer no longer compiles shaders, rather it returns shader source for the client to compile. This source is obtained via OsdGLSLHLSLPatchShaderSource. The API exposed in shaders to access patch-based data has been consolidated and formalized, see osdglslPatchCommon.glsl and osdhlslPatchCommon.hlsl for details. Patches are no longer rotated and transition patches have been eliminated, simplifying PatchDescriptor to a 4 bits. Additionally, FarPatchTablesDescriptor has been moved into its own class in the Far namespace. The following table outlines the API translation between 2.x and 3.0 OpenSubdiv 2.x OpenSubdiv 3.0 OsdDrawContextPatchDescriptor NA, no longer needed. OsdDrawContextPatchArray OSdPatchArray types.h FarPatchTablesPatchDescriptor FarPatchDescriptor patchDescriptor.h FarPatchTablesPatchArray made private. End Cap Strategies By default, OpenSubdiv uses Gregory patches to approximate the patches around extraordinary vertices at the maximum isolation level, this process is referred to as end-capping. If ENDCAP_BSPLINE_BASIS is specified to PatchTableFactoryOptions, BSpline patches are used, which gives less accuracy, but it makes possible to render an entire mesh in a single draw call. Both patches require additional control points that are not part of the mesh, we refer to these as local points. In 3.0, the local points of those patches are computed by applying a stencil table to refined vertices to construct a new stencil table for the local points. Since this new stencil table is topologically compatible with the primary stencil table for refinement, it is convenient and efficient to splice those stencil tables together. This splicing can be done in the following way FarStencilTable const refineStencils FarStencilTableFactoryCreatetopologyRefiner FarPatchTable cosnt patchTable FarPatchTableFactoryCreatetopologyRefiner FarStencilTable const localPointStencils patchTable-GetLocalPointStencilTable FarStencilTable const splicedStencils FarStencilTableFactoryAppendLocalPointStencilTablestopologyRefiner, refineStencils, localPointStencils NOTE Once the spliced stencil table is created, the refined stencils can be released, but the local point stencils are owned by patchTable, it should not be released. OpenSubdiv 3.0 also supports 2.x style Gregory patches, if ENDCAP_LEGACY_GREGORY is specified to PatchTableFactoryOptions. In this case, such an extra stencil splicing isnt needed, however clients must still bind additional buffers VertexValence buffer and QuadOffsets buffer. See OsdGLLegacyGregoryPatchTable for additional details. Changes to Subdivision The refactoring of OpenSubdiv 3.0 data representations presented a unique opportunity to revisit some corners of the subdivision specification and remove or update some legacy features -- none of which was taken lightly. More details are provided in Subdivision Compatibility , while the following offers a quick overview All face-varying interpolation options have been combined into a single enum. Vertex interpolation options have been renamed or removed The naming of the standard creasing method has changed from Normal to Uniform . Unused legacy modes of the smoothtriangle option have been removed. The averaging of Chaikin creasing with infinitely sharp edges has changed. Support for Hierarchical Edits has been removed. Build Support for Combining 2.x and 3.0 Running OpenSubdiv 2.0 and 3.0 in a single process is supported, however some special care must be taken to avoid namespace collisions, both in terms of run-time symbols avoid using OpenSubdivOsd, for example and in terms of build-time search paths. To support both OpenSubdiv 2.0 and 3.0 in your build environment, you can prefix the header install directory of OpenSubdiv 3.0. Do this using the build flag CMAKE_INCDIR_BASE when configuring cmake i.e. -DCMAKE_INCDIR_BASEincludeopensubdiv3 and then including files from opensubdiv3... in client code. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"porting.html\"\n+ }, {\n \"title\": \"OSD Tessellation shader Interface\",\n \"text\": \"OSD Tessellation shader Interface OSD Tessellation shader Interface 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Basic Tessellation Control Shader Example for B-Spline patches Tessellation Evaluation Shader Example for B-Spline patches Basis Conversion B-spline Patch Gregory Basis Patch Box-spline Triangle Patch Gregory Triangle Patch Legacy Gregory Patch 2.x compatibility Tessellation levels Tessellation levels at each tessellated vertex Tessellation levels computed at each patch Uniform Screenspace Basic Starting with 3.0, Osd tessellation shaders can be used as a set of functions from client shader code. In order to tessellate Osd patches, client shader code should perform the following steps regular B-spline patch case In a tessellation control shader fetch a PatchParam for the current patch call OsdComputePerPatchVertexBSpline to compute OsdPerPatchVertexBezier. compute tessellation level. To prevent cracks on transition patches, two vec4 parameters tessOuterHi, tessOuterLo will be needed in addition to built-in gl_TessLevelInnerOuters. In a tessellation evaluation shader call OsdGetTessParameterization to remap gl_TessCoord to a patch parameter at which to evaluate. call OsdEvalPatchBezierOsdEvalPatchGregory to evaluate the current patch. The following is a minimal example of GLSL code explaining how client shader code uses OpenSubdiv shader functions to tessellate patches of a patch table. Tessellation Control Shader Example for B-Spline patches layout vertices 16 out in vec3 position patch out vec4 tessOuterLo , tessOuterHi out OsdPerPatchVertexBezier v void main Get a patch param from texture buffer. ivec3 patchParam OsdGetPatchParam gl_PrimitiveID Compute per-patch vertices. OsdComputePerPatchVertexBSpline patchParam , gl_InvocationID , position , v Compute tessellation factors. if gl_InvocationID 0 vec4 tessLevelOuter vec4 0 vec2 tessLevelInner vec2 0 OsdGetTessLevelsUniform patchParam , tessLevelOuter , tessLevelInner , tessOuterLo , tessOuterHi gl_TessLevelOuter 0 tessLevelOuter 0 gl_TessLevelOuter 1 tessLevelOuter 1 gl_TessLevelOuter 2 tessLevelOuter 2 gl_TessLevelOuter 3 tessLevelOuter 3 gl_TessLevelInner 0 tessLevelInner 0 gl_TessLevelInner 1 tessLevelInner 1 Tessellation Evaluation Shader Example for B-Spline patches layout quads in patch in vec4 tessOuterLo , tessOuterHi in OsdPerPatchVertexBezier v uniform mat4 mvpMatrix void main Compute tesscoord. vec2 UV OsdGetTessParameterization gl_TessCoord . xy , tessOuterLo , tessOuterHi vec3 P vec3 0 , dPu vec3 0 , dPv vec3 0 vec3 N vec3 0 , dNu vec3 0 , dNv vec3 0 ivec3 patchParam inpt 0 . v . patchParam Evaluate patch at the tess coord UV OsdEvalPatchBezier patchParam , UV , v , P , dPu , dPv , N , dNu , dNv Apply model-view-projection matrix. gl_Position mvpMatrix vec4 P , 1 Basis Conversion B-spline Patch The following diagram shows how the Osd shaders process b-spline patches. While regular patches are expressed as b-spline patches in FarPatchTable, the Osd shader converts them into Bezier basis patches for simplicity and efficiency. This conversion is performed in the tessellation control stage. The boundary edge evaluation and single crease matrix evaluation are also resolved during this conversion. OsdComputePerPatchVertexBSpline can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBSpline ivec3 patchParam , int ID , vec3 cv 16 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezier function. void OsdEvalPatchBezier ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 16 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Basis Patch In a similar way, Gregory basis patches are processed as follows OsdComputePerPatchVertexGregoryBasis can be used for the Gregory patches although no basis conversion involved for the Gregory patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregory function. void OsdEvalPatchGregory ivec3 patchParam , vec2 UV , vec3 cv 20 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Box-spline Triangle Patch While regular triangle patches are expressed as triangular box-spline patches in FarPatchTable, the Osd shader converts them into triangular Bezier patches for consistency. This conversion is performed in the tessellation control stage. The boundary edge evaluation is resolved during this conversion. OsdComputePerPatchVertexBoxSplineTriangle can be used for this process. The resulting Bezier control vertices are stored in OsdPerPatchVertexBezier struct. void OsdComputePerPatchVertexBoxSplineTriangle ivec3 patchParam , int ID , vec3 cv 12 , out OsdPerPatchVertexBezier result The tessellation evaluation shader takes an array of OsdPerPatchVertexBezier struct, and then evaluates the patch using the OsdEvalPatchBezierTriangle function. void OsdEvalPatchBezierTriangle ivec3 patchParam , vec2 UV , OsdPerPatchVertexBezier cv 15 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Gregory Triangle Patch OsdComputePerPatchVertexGregoryBasis can be used for the quartic triangular Gregory patches although no basis conversion involved for the Gregory triangle patches and the resulting vertices are stored in a OsdPerPatchVertexGreogryBasis struct. void OsdComputePerPatchVertexGregoryBasis ivec3 patchParam , int ID , vec3 cv , out OsdPerPatchVertexGregoryBasis result The tessellation evaluation shader takes an array of OsdPerPatchVertexGregoryBasis struct, and then evaluates the patch using the OsdEvalPatchGregoryTriangle function. void OsdEvalPatchGregoryTriangle ivec3 patchParam , vec2 UV , vec3 cv 18 , out vec3 P , out vec3 dPu , out vec3 dPv , out vec3 N , out vec3 dNu , out vec3 dNv Legacy Gregory Patch 2.x compatibility OpenSubdiv 3.0 also supports 2.x style Gregory patch evaluation see far_overview. In order to evaluate a legacy Gregory patch, client needs to bind extra buffers and to perform extra steps in the vertex shader as shown in the following diagram Tessellation levels Osd provides both uniform and screen-space adaptive tessellation level computation. Because of the nature of feature adaptive subdivision , we need to pay extra attention for a patchs outer tessellation level for the screen-space adaptive case so that cracks dont appear. An edge of the patch marked as a transition edge is split into two segments Hi and Lo. The Osd shaders uses these two segments to ensure the same tessellation along the edge between different levels of subdivision. In the following example, suppose the left hand side patch has determined the tessellation level of its right edge to be 5. gl_TessLevelOuter is set to 5 for the edge, and at the same time we also pass 2 and 3 to the tessellation evaluation shader as separate levels for the two segments of the edge split at the middle. Tessellation levels at each tessellated vertex The tessellation evaluation shader takes gl_TessCoord and those two values, and remaps gl_TessCoord using OsdGetTessParameterization or OsdGetTessLevelParameterizationTriangle to ensure the parameters are consistent across adjacent patches. vec2 OsdGetTessParameterization vec2 uv , vec4 tessOuterLo , vec4 tessOuterHi vec2 OsdGetTessParameterizationTriangle vec3 uvw , vec4 tessOuterLo , vec4 tessOuterHi Tessellation levels computed at each patch These tessellation levels can be computed the corresponding method in the tesselation control shader. Note that these functions potentially requires all bezier control points, you need to call barrier to ensure the conversion is done for all invocations. See osdglslPatchBSpline.glsl for more details. Uniform void OsdGetTessLevelsUniform ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdGetTessLevelsUniformTriangle ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Screenspace void OsdEvalPatchBezierTessLevels OsdPerPatchVertexBezier cpBezier 16 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi void OsdEvalPatchBezierTriangleTessLevels vec3 cv 15 , ivec3 patchParam , out vec4 tessLevelOuter , out vec2 tessLevelInner , out vec4 tessOuterLo , out vec4 tessOuterHi Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"osd_shader_interface.html\"\n }, {\n \"title\": \"OSD Overview\",\n \"text\": \"OSD Overview OSD Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE OpenSubdiv Osd Refinement Limit Stencil Evaluation Limit Evaluation with PatchTable OpenGLDX11Metal Drawing with Hardware Tessellation InterleavedBatched Buffer Configuration Cross-Platform Implementation OpenSubdiv Osd Osd contains device dependent code that makes Far structures available on various backends such as TBB, CUDA, OpenCL, GLSL, etc. The main roles of Osd are Refinement Compute stencil-based uniformadaptive subdivision on CPUGPU backends Limit Stencil Evaluation Compute limit surfaces by limit stencils on CPUGPU backends Limit Evaluation with PatchTable Compute limit surfaces by patch evaluation on CPUGPU backends OpenGLDX11Metal Drawing with hardware tessellation Provide GLSLHLSLMetal tessellation functions for patch table InterleavedBatched buffer configuration Provide consistent buffer descriptor to deal with arbitrary buffer layout. Cross-Platform Implementation Provide convenient classes to interop between compute and draw APIs These are independently used by clients. For example, a client can use only the limit stencil evaluation, or a client can refine subdivision surfaces and draw them with the PatchTable and Osd tessellation shaders. All device specific evaluation kernels are implemented in the Evaluator classes. Since Evaluators dont own vertex buffers, clients should provide their own buffers as a source and destination. There are some interop classes defined in Osd for convenience. OpenSubdiv utilizes a series of regression tests to compare and enforce identical results across different computational devices. Refinement Osd supports both uniform and feature adaptive subdivision. Once clients create a FarStencilTable for the topology, they can convert it into device-specific stencil tables if necessary. The following table shows which evaluator classes and stencil table interfaces can be used together. Note that while Osd provides these stencil table classes which can be easily constructed from FarStencilTable, clients arent required to use these table classes. Clients may have their own entities as a stencil tables as long as EvaluatorEvalStencils can access the necessary interfaces. Backend Evaluator class compatible stencil table CPU CPU single-threaded CpuEvaluator FarStencilTable TBB CPU multi-threaded TbbEvaluator FarStencilTable OpenMP CPU multi-threaded OmpEvaluator FarStencilTable CUDA GPU CudaEvaluator CudaStencilTable OpenCL CPUGPU CLEvaluator CLStencilTable GL ComputeShader GPU GLComputeEvaluator GLStencilTableSSBO GL Transform Feedback GPU GLXFBEvaluator GLStencilTableTBO DX11 ComputeShader GPU D3D11ComputeEvaluator D3D11StencilTable Metal GPU MTLComputeEvaluator MTLStencilTable Limit Stencil Evaluation Limit stencil evaluation is quite similar to refinement in Osd . At first clients create FarLimitStencilTable for the locations to evaluate the limit surfaces, then convert it into an evaluator compatible stencil table and call EvaluatorEvalStencils. Limit Evaluation with PatchTable Another way to evaluate the limit surfaces is to use the PatchTable. Once all control vertices and local points are resolved by the stencil evaluation, Osd can evaluate the limit surfaces through the PatchTable. Backend Evaluator class compatible patch table CPU CPU single-threaded CpuEvaluator CpuPatchTable TBB CPU multi-threaded TbbEvaluator CpuPatchTable OpenMP CPU multi-threaded OmpEvaluator CpuPatchTable CUDA GPU CudaEvaluator CudaPatchTable OpenCL CPUGPU CLEvaluator CLPatchTable GL ComputeShader GPU GLComputeEvaluator GLPatchTable GL Transform Feedback GPU GLXFBEvaluator GLPatchTable DX11 ComputeShader GPU D3D11ComputeEvaluator not yet supported D3D11PatchTable Metal ComputeShader GPU MTLComputeEvaluator MTLPatchTable Release Notes 3.x Osd evaluation backends EvaluatorEvalPatches do not support evaluation of single-crease or Legacy Gregory patch types. OpenGLDX11Metal Drawing with Hardware Tessellation One of the most interesting use cases of the Osd layer is realtime drawing of subdivision surfaces using hardware tessellation. This is somewhat similar to limit evaluation with PatchTable described above. Drawing differs from limit evaluation in that Osd provides shader snippets for patch evaluation and clients will inject them into their own shader source. See shader interface for a more detailed discussion of the shader interface. InterleavedBatched Buffer Configuration All Osd layer APIs assume that each primitive variables to be computed points, colors, uvs ... are contiguous arrays of 32bit floating point values. The Osd API refers to such an array as a buffer. A buffer can exist on CPU memory or GPU memory. Osd Evaluators typically take one source buffer and one destination buffer, or three destination buffers if derivatives are being computed. Osd Evaluators also take BufferDescriptors, that are used to specify the layout of the source and destination buffers. A BufferDescriptor is a struct of 3 integers which specify an offset, length and stride. For example Vertex 0 Vertex 1 ... X Y Z X Y Z ... The layout of this buffer can be described as Osd BufferDescriptor desc offset 0 , length 3 , stride 3 BufferDescriptor can be used for an interleaved buffer too. Vertex 0 Vertex 1 ... X Y Z R G B A X Y Z R G B A ... Osd BufferDescriptor xyzDesc 0 , 3 , 7 Osd BufferDescriptor rgbaDesc 3 , 4 , 7 Although the source and destination buffers dont need to be the same buffer for EvalStencils, adaptive patch tables are constructed to first index the coarse vertices and the refined vertices immediately afterward. In this case, the BufferDescriptor for the destination should include the offset as the number of coarse vertices to be skipped. Coarse vertices n Src Refined vertices Dst Vertex 0 Vertex 1 ... Vertex n Vertex n1 X Y Z X Y Z ... X Y Z X Y Z ... Osd BufferDescriptor srcDesc 0 , 3 , 3 Osd BufferDescriptor dstDesc n 3 , 3 , 3 Also note that the source descriptor doesnt have to start with offset 0. This is useful when a client has a big buffer with multiple objects batched together. Cross-Platform Implementation One of the key goals of OpenSubdiv is to achieve as much cross-platform flexibility as possible and leverage all optimized hardware paths where available. This can be very challenging as there is a very large variety of plaftorms and APIs available, with very distinct capabilities. In Osd , Evaluators dont care about interops between those APIs. All Evaluators have two kinds of APIs for both EvalStencils and EvalPatches. Explicit signatures which directly take device-specific buffer representation e.g., pointer for CpuEvaluator, GLuint buffer for GLComputeEvaluator, etc. Generic signatures which take arbitrary buffer classes. The buffer class is required to have a certain method to return the device-specific buffer representation. The later interface is useful if the client supports multiple backends at the same time. The methods that need to be implemented for the Evaluators are Evaluator class object method CpuEvaluator TbbEvaluator OmpEvaluator pointer to cpu memory BindCpuBuffer CudaEvaluator pointer to cuda memory BindCudaBuffer CLEvaluator cl_mem BindCLBuffer GLComputeEvaluator GLXFBEvaluator GL buffer object BindVBO D3D11ComputeEvaluator D3D11 UAV BindD3D11UAV MTLComputeEvaluator MTLBuffer BindMTLBuffer The buffers can use these methods as a trigger of interop. Osd provides a default implementation of interop buffer for most of the backend combinations. For example, if the client wants to use CUDA as a computation backend and use OpenGL as the drawing API, OsdCudaGLVertexBuffer fits the case since it implements BindCudaBuffer and BindVBO. Again, clients can implement their own buffer class and pass it to the Evaluators. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"osd_overview.html\"\n }, {\n+ \"title\": \"mtlViewer\",\n+ \"text\": \"mtlViewer mtlViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION KEYBOARD CONTROLS SEE ALSO SYNOPSIS open mtlViewer.app --args -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION mtlViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. mtlViewer running on macOS mtlViewer running on iOS KEYBOARD CONTROLS q quit f fit frame - increase decrease tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"mtlviewer.html\"\n+ }, {\n \"title\": \"mtlPtexViewer\",\n \"text\": \"mtlPtexViewer mtlPtexViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION KEYBOARD CONTROLS SEE ALSO SYNOPSIS open mtlPtexViewer.app --args -yup -u -a -l isolation level ptex color file ptex displacement file DESCRIPTION mtlPtexViewer is a stand-alone application demonstrating shading with color and displacement ptex maps. Multiple controls are available to experiment with the algorithms. KEYBOARD CONTROLS q quit f fit frame - increase decrease tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"mtlptexviewer.html\"\n }, {\n \"title\": \"Modeling Tips\",\n \"text\": \"Modeling Tips Modeling Tips 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Topology Use Fewer Spans Avoid High Valence vertices Edge-Loop Transitions Practical Topology Primer Triangles and N-Gons Semi-Sharp Creases Use crease sets Additional Resources The following sections describe common techniques specific to modeling with subdivision surfaces. Note The following information contains techniques specific to the Catmull-Clark subdivision scheme. Some elements need to be adjusted for Loop surfaces. Topology Well-constructed subdivision meshes have several important properties They consist primarily of regular faces quads for Catmull-Clark, tris for Loop They contain few extraordinary vertices They efficiently describe the intended shape They are topologically manifold Use Fewer Spans While polygon models need to use a large number of spans to approximate smooth curved surfaces, subdivision models require significantly fewer control points. In most situations, 6 spans are enough to create accurate circular shapes, and 4 is often enough to approximate background objects. Avoid High Valence vertices A high valence vertex is a vertex connected to more than 4 adjacent edges. High valence vertices cause several problems when subdivided The Catmull-Clark scheme can produce wavy surfaces when a revolution vertex is surrounded by triangles see here High valence vertices incur fairly large performance hits Currently, OpenSubdiv has a hard constraint imposed by GPU shaders on the maximum valence of a vertex 27 on current hardware Instead, here are some topological strategies to cap revolution shapes Note that all these cylinders use only quad faces, and all the vertices in the caps have a valence of 4 except the bottom left example Edge-Loop Transitions It is often necessary to vary the density of control vertices over the surface mesh areas around the fingers of a hand require more CVs than the comparatively simpler region around the palm. It is important to handle the topology around these transitions efficiently. One strategy is to use extraordinary vertices, such as this example, using a valence 5 vertex to expand 3 edge loops into 5. Practical Topology Primer Some real-world examples showing how to produce detailed shapes with sparse topology, few extraordinary vertices, and no high-valence revolution poles. Triangles and N-Gons Used sparsely, non-quads can be very useful to gather 3 or more diverging edge-loops. These are often encountered in highly deforming areas with curvature saddle-points ex arm-torso connection. The strategic placement of a pentagon in one of these critical spots ensures that the surface remains smooth, while allowing for complex topology to flow around. Semi-Sharp Creases Semi-sharp creases can be a very powerful tool for hard-surface modeling. Both edges and vertices can be tagged with a sharpness value. Crease sharpness values range from 0 smooth to 10 infinitely sharp It is generally cheaper to use creases whenever possible, instead of adding extra edgesedge-loops. However... Creases introduce extra computation costs that are proportional to the sharpness value. So... Sharpness values above 5 should rarely be needed. The following sections introduce some techniques to best leverage them. Use crease sets Complex hard-surface models giant robots, vehicles, buildings... are likely to tag large number of edges it is extremely useful to organize these edgesedge loops into logical sets with descriptive names. Edges or vertices in a crease set group all share the same sharpness value. If you are modeling with Maya, the CreaseSetEditor implements this type of workflow. Additionally, for debugging purposes, it is often very helpful if the name of a set contains the sharpness value ex topDeck_2. Besides authoring convenience, one of the benefits of having many edge-loops share identical sharpness values is that it enables very powerful performance optimizations within the feature adaptive algorithm faster renders less memory. Additional Resources An excellent short tutorial from the Guerrilla CG Project that illustrates many of the common pitfalls of subdivision modeling, and the strategies to overcome them Ivo Kos, Modelling Technical Director at Pixar Animation Studios, shows some of the modeling techniques he uses when modeling props and architecture sets for feature films. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"mod_notes.html\"\n }, {\n- \"title\": \"mtlViewer\",\n- \"text\": \"mtlViewer mtlViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION KEYBOARD CONTROLS SEE ALSO SYNOPSIS open mtlViewer.app --args -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION mtlViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. mtlViewer running on macOS mtlViewer running on iOS KEYBOARD CONTROLS q quit f fit frame - increase decrease tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"mtlviewer.html\"\n- }, {\n \"title\": \"License\",\n \"text\": \"License License 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Open Source License OpenSubdiv is covered by a modified Apache 2.0 license included below, and is free to use for commercial or non-commercial use. All Pixar patents in the area of subdivision surface algorithms have also been released for public use. We welcome any involvement in the development or extension of this code in fact, we would love it. Please contact us if you are interested. For information on Apache licenses, see httpwww.apache.orglicenses The following license text describes the open source policy adopted by Pixar and is included in every source file. Copyright 2013 Pixar Licensed under the Apache License, Version 2.0 the Apache License with the following modification you may not use this file except in compliance with the Apache License and the following modification to it Section 6. Trademarks. is deleted and replaced with 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor and its affiliates, except as required to comply with Section 4c of the License and to reproduce the content of the NOTICE file. You may obtain a copy of the Apache License at httpwww.apache.orglicensesLICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the Apache License with the above modification is distributed on an AS IS BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the Apache License for the specific language governing permissions and limitations under the Apache License. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"license.html\"\n }, {\n \"title\": \"Introduction\",\n \"text\": \"Introduction Introduction 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Introduction Why Fast Subdivision Research Heritage Licensing Contributing External Resources Introduction OpenSubdiv is a set of open source libraries that implement high performance subdivision surface subdiv evaluation on massively parallel CPU and GPU architectures. This code path is optimized for drawing deforming surfaces with static topology at interactive framerates. OpenSubdiv is an API ready to be integrated into 3rd party digital content creation tools. It is not an application, nor a tool that can be used directly to create digital assets. Why Fast Subdivision Subdivision surfaces are commonly used for final rendering of character shapes for a smooth and controllable limit surfaces. However, subdivision surfaces in interactive apps are typically drawn as their polygonal control hulls because of performance. The polygonal control hull is an approximation that is offset from the true limit surface. Looking at an approximation in the interactive app makes it difficult to see exact contact, like fingers touching a potion bottle or hands touching a cheek. It also makes it difficult to see poke-throughs in cloth simulation if the skin and cloth are both approximations. This problem is particularly bad when one character is much larger than another and unequal subdiv face sizes cause approximation errors to be magnified. Maya and Pixars proprietary Presto animation system can take 100ms to subdivide a character of 30,000 polygons to the second level of subdivision 500,000 polygons. Being able to perform the same operation in less than 3ms allows the user to interact with the smooth, accurate limit surface at all times. Research The new GPU technology behind OpenSubdiv is the result of a joint research effort between Pixar and Microsoft. Feature Adaptive GPU Rendering of Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, Mark Meyer, and Tony DeRose ACM Transactions on Graphics, Vol. 31 No. 1 Article 6 January 2012 httpgraphics.pixar.comlibraryGPUSubdivRenderingApaper.pdf Efficient Evaluation of Semi-Smooth Creases in Catmull-Clark Subdivision Surfaces Matthias Niessner, Charles Loop, and Guenter Greiner. Eurographics Proceedings, Cagliari, 2012 httpsniessnerlab.orgpapers20121semismoothniessner2012efficient.pdf Analytic Displacement Mapping using Hardware Tessellation Matthias Niessner, Charles Loop ACM Transactions on Graphics, Vol. 32 No. 3 Article 26 June 2013 httpsniessnerlab.orgpapers20133analyticniessner2013analytic.pdf Heritage This is the fifth-generation subdiv library in use by Pixars proprietary animation system in a lineage that started with code written by Tony DeRose and Tien Truong for Geris Game in 1996. Each generation has been a from-scratch rewrite that has built upon our experience using subdivision surfaces to make animated films. This code is live, so Pixars changes to OpenSubdiv for current and future films will be released as open source at the same time they are rolled out to Pixar animation production. Subdivision for Modeling and Animation Denis Zorin, Peter Schroder Course Notes of SIGGRAPH 1999 httpwww.multires.caltech.edupubssig99notes.pdf Subdivision Surfaces in Character Animation Tony DeRose, Michael Kass, Tien Truong Proceedings of SIGGRAPH 1998 httpgraphics.pixar.comlibraryGeripaper.pdf Recursively generated B-spline surfaces on arbitrary topological meshes Catmull, E. Clark, J. Computer-Aided Design 10 6 1978 Licensing OpenSubdiv is covered by the Apache License, and is free to use for commercial or non-commercial use. This is the same code that Pixar uses internally for animated film production. Our intent is to encourage a geometry standard for subdivision surfaces, by providing consistent i.e. yielding the same limit surface, high performance implementations on a variety of platforms. Why Apache We were looking for a commercial-friendly license that would convey our patents to the end users. This quickly narrowed the field to Microsoft Public License or Apache. Initially we chose MSPL because it handled trademarks better. But at the request of several companies we gave Apache another look, and decided to go with Apache with a very slight modification that simply says you cannot use any contributors trademarks. In other words, you can use OpenSubdiv to make a product, but you cannot use a Luxo Lamp or other character, etc. when marketing your product. License Header Contributing For details on how to contribute to OpenSubdiv, see the page on Contributing External Resources Pixar Research Pixar RD Portal Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n@@ -256,49 +256,49 @@\n \"loc\": \"glviewer.html\"\n }, {\n \"title\": \"glStencilViewer\",\n \"text\": \"glStencilViewer glStencilViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glStencilViewer -f -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION glStencilViewer is a stand-alone application that showcases the application of pre-computed stencil tables to a collection of geometric test shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glstencilviewer.html\"\n }, {\n+ \"title\": \"glPaintTest\",\n+ \"text\": \"glPaintTest glPaintTest 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS glPaintTest -f -yup -l adaptive refinement level objfiles -catmark -loop DESCRIPTION glPaintTest is a small stand-alone application showing the potential of using GPU limit tessellation for painting and sculpting applications. OPTIONS See the description of the common comand line options for the subset of common options supported here. KEYBOARD CONTROLS c use texture as color d use texture as displacement SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"glpainttest.html\"\n+ }, {\n \"title\": \"glShareTopology\",\n \"text\": \"glShareTopology glShareTopology 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glShareTopology -u -a -l refinement level DESCRIPTION glShareTopology is a stand-alone application that showcases the implementation of topology instancing across Compute contexts. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glsharetopology.html\"\n }, {\n \"title\": \"glPtexViewer\",\n \"text\": \"glPtexViewer glPtexViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS glPtexViewer -f -yup -u -a -l isolation level -c animation loops -e environment map -d HDR diffuse map -s HDR specular map --disp displacement scale --bump bump scale ptex color file ptex displacement file ptex occlusion file ptex specular file objfiles DESCRIPTION glPtexViewer is a stand-alone application that showcases advanced HDR shading with color, displacement, occlusion and specular ptex maps. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. -e environment map A low dynamic range spherical environment map used as a background. Ideally, a color-normalized version of the HDR light probe. -d HDR diffuse map An HDR file containing a diffuse environment map typically they are low resolution blurry hemispherical convolutions of the environment light probe. -s environment map An HDR file containing a specular environment map. --disp displacement scale A scalar multiplier for the shader displacement values. --bump displacement scale A scalar multiplier for the shader bump values. ptex color file A ptex file containing RGB channels read as material albedo color. ptex displacement file A single-channel ptex file preferably float precision containing the displacement values. ptex occlusion file A single-channel ptex file preferably 8 bits precision containing a pre-computed ambient occlusion signal. ptex specular file A single-channel ptex file preferably 8 bits precision applied to modulate the specular reflectance of the material KEYBOARD CONTROLS q quit esc hide GUI x save screenshot f fit frame - increase decrease tessellation rate r reload and re - compile the shader files e draw normals SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glptexviewer.html\"\n }, {\n- \"title\": \"glPaintTest\",\n- \"text\": \"glPaintTest glPaintTest 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS glPaintTest -f -yup -l adaptive refinement level objfiles -catmark -loop DESCRIPTION glPaintTest is a small stand-alone application showing the potential of using GPU limit tessellation for painting and sculpting applications. OPTIONS See the description of the common comand line options for the subset of common options supported here. KEYBOARD CONTROLS c use texture as color d use texture as displacement SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"glpainttest.html\"\n- }, {\n \"title\": \"glFVarViewer\",\n \"text\": \"glFVarViewer glFVarViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glFVarViewer -f -u -a -l refinement level -c animation loops objfiles -catmark -loop -bilinear DESCRIPTION glFVarViewer is a stand-alone application that allows the inspection of face-varying data interpolation. The window displays 2 views left side regular 3D view of the model, with a procedural u,v texture right side a 2D view of the face-varying u,v pair The HUD allows interactive manipulation of the various face-varying boundary interpolation rules and tags. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glfvarviewer.html\"\n }, {\n- \"title\": \"FAR Overview\",\n- \"text\": \"FAR Overview FAR Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Feature Adaptive Representation Far Topology Refinement Primvar Refinement FarTopologyRefiner FarTopologyRefinerFactory FarPrimvarRefiner FarPatchTable Patch Arrays Patch Types Patch Parameterization Single-Crease Patches Local Points Legacy Gregory Patches FarStencilTable Advantages Principles Cascading Stencils Limit Stencils Sample Location On Extraordinary Faces Code example Feature Adaptive Representation Far Far is the primary API layer for processing client-supplied mesh data into subdivided surfaces. The Far interface may be used directly and also may be used to prepare mesh data for further processing by Osd . The two main aspects of the subdivision process are Topology Refinement and Primvar Refinement . Topology Refinement Topology refinement is the process of splitting the mesh topology according to the specified subdivison rules to generate new topological vertices, edges, and faces. This process is purely topological and does not depend on the speciific values of any primvar data point positions, etc. Topology refinement can be either uniform or adaptive, where extraordinary features are automatically isolated see feature adaptive subdivision . The Far topology classes present a public interface for the refinement functionality provided in Vtr , The main classes in Far related to topology refinement are TopologyRefiner A class encapsulating mesh refinement. TopologyLevel A class representing one level of refinement within a TopologyRefiner. TopologyRefinerFactoryMESH A factory class template specialized in terms of the applications mesh representation used to construct TopologyRefiner instances. Primvar Refinement Primvar refinement is the process of computing values for primvar data points, colors, normals, texture coordinates, etc by applying weights determined by the specified subdivision rules. There are many advantages gained by distinguishing between topology refinement and primvar interpolation including the ability to apply a single static topological refinement to multiple primvar instances or to different animated primvar time samples. Far supports methods to refine primvar data at the locations of topological vertices and at arbitrary locations on the subdivision limit surface. The main classes in Far related to primvar refinement are PrimvarRefiner A class implementing refinement of primvar data at the locations of topological vertices. PatchTable A representation of the refined surface topology that can be used for efficient evaluation of primvar data at arbitrary locations. StencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement. LimitStencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement at arbitrary limit surface locations. FarTopologyRefiner TopologyRefiner is the building block for many other useful classes in Far . It performs refinement of an arbitrary mesh and provides access to the refined mesh topology. It can be used for primvar refinement directly using PrimvarRefiner or indirectly by being used to create a stencil table , or a patch table , etc. TopologyRefiner provides the public refinement methods RefineUniform and RefineAdapative which perform refinement operations using Vtr. TopologyRefiner provides access to the refined topology via TopologyLevel instances. FarTopologyRefinerFactory Consistent with other classes in Far, instances of TopologyRefiner are created by a factory class -- in this case FarTopologyRefinerFactory. Here we outline several approaches for converting mesh topology into the required FarTopologyRefiner. Additional documentation is provided with the FarTopologyRefinerFactoryMESH class template used by all, and each has a concrete example provided in one of the tutorials or in the Far code itself. There are three ways to create TopologyRefiners use the existing TopologyRefinerFactoryTopologyDescriptor with a populated instance of TopologyDescriptor specialize TopologyRefinerFactoryclass MESH for more efficient conversion, using only face-vertex information fully specialize TopologyRefinerFactorclass MESH for most control over conversion Use the FarTopologyDescriptor FarTopologyDescriptor is a simple struct that can be initialized to refer to raw mesh topology information -- primarily a face-vertex list -- and then passed to a provided factory class to create a TopologyRefiner from each. Topologically, the minimal requirement consists of the number of vertices and faces of the mesh an array containing the number of vertices per face an array containing the vertices assigned to each face These last two define one of the six topological relations that are needed internally by Vtr, but this one relation is sufficient to construct the rest. Additional members are available to assign sharpness values per edge andor vertex, hole tags to faces, or to define multiple sets channels of face-varying data. Almost all of the Far tutorials i.e. tutorialsfartutorial_ illustrate use of the TopologyDescriptor and its factory for creating TopologyRefiners, i.e. TopologyRefinerFactoryTopologyDescriptor. For situations when users have raw mesh data and have not yet constructed a boundary representation of their own, it is hoped that this will suffice. Options have even been provided to indicate that raw topology information has been defined in a left-hand winding order and the factory will handle the conversion to right-hand counter-clockwise winding on-the-fly to avoid unnecessary data duplication. Custom Factory for Face Vertices If the nature of the TopologyDescriptors data expectations is not helpful, and so conversion to large temporary arrays would be necessary to properly make use of it, it may be worth writing a custom factory. Specialization of TopologyRefinerFactoryclass MESH should be done with care as the goal here is to maximize the performance of the conversion and so minimize overhead due to runtime validation. The template provides the high-level construction of the required topology vectors of the underlying Vtr. There are two ways to write such a factory provide only the face-vertex information for topology and let the factory infer all edges and other relationships, or provide the complete edge list and all other topological relationships directly. The latter is considerably more involved and described in a following section. The definition of TopologyRefinerFactoryTopologyDescriptor provides a clear and complete example of constructing a TopologyRefiner with minimal topology information, i.e. the face-vertex list. The class template TopologyRefinerFactoryMESH documents the needs here and the TopologyDescriptor instantiation and specialization should illustrate that. Custom Factory for Direct Conversion Fully specializing a factory for direct conversion is needed only for those requiring ultimate control and is not generally recommended. It is recommended that one of the previous two methods initially be used to convert your mesh topology into a TopologyRefiner. If the conversion performance is critical, or significant enough to warrant improvement, then it is worth writing a factory for full topological conversion. Writing a custom factory requires the specificationspecialization of two methods with the following purpose specify the sizes of topological data so that vectors can be pre-allocated assign the topological data to the newly allocated vectors As noted above, the assumption here is that the clients boundary-rep knows best how to retrieve the data that we require most efficiently. After the factory class gathers sizing information and allocates appropriate memory, the factory provides the client with locations of the appropriate tables to be populated using the same Array classes and interface used to access the tables. The client is expected to load a complete topological description along with additional optional data, i.e. the six topological relations required by Vtr, oriented when manifold sharpness values for edges andor vertices optional additional tags related to the components, e.g. holes optional values-per-face for face-varying channels optional This approach requires dealing directly with edges, unlike the other two. In order to convert edges into a TopologyRefiners representation, the edges need to be expressed as a collection of known size N -- each of which is referred to directly by indices 0,N-1. This can be awkward for representations such as half-edge or quad-edge that do not treat the instance of an edge uniquely. Particular care is also necessary when representing non-manifold features. The previous two approaches will construct non-manifold features as required from the face-vertex list -- dealing with degenerate edges and other non-manifold features as encountered. When directly translating full topology it is necessary to tag non-manifold features, and also to ensure that certain edge relationships are satisfied in their presence. More details are available with the assembly methods of the factory class template. While there is plenty of opportunity for user error here, that is no different from any other conversion process. Given that Far controls the construction process through the Factory class, we do have ample opportunity to insert runtime validation, and to vary that level of validation at any time on an instance of the Factory. The factory does provide run-time validation on the topology constructed that can be used for debugging purposes. A common base class has been created for the factory class, i.e. template class MESH class TopologyRefinerFactory public TopologyRefinerFactoryBase both to provide common code independent of MESH and also potentially to protect core code from unwanted specialization. FarPrimvarRefiner PrimvarRefiner supports refinement of arbitrary primvar data at the locations of topological vertices. A PrimvarRefiner accesses topology data directly from a TopologyRefiner. Different methods are provided to support three different classes of primvar interpolation. These methods may be used to refine primvar data to a specified refinement level. Interpolate... Interpolate using vertex weights InterpolateVarying... Interpolate using linear weights InterpolateFaceVarying... Interpolate using face-varying weights Additional methods allow primvar data to be interpolated to the final limit surface including the calculation of first derivative tangents. Limitdst Interpolate to the limit surface using vertex weights Limitdst, dstTan1, dstTan2 Interpolate including first derivatives to the limit surface using vertex weights LimitFaceVarying... Interpolate to the limit surface using face-varying weights PrimarRefiner provides a straightforward interface for refining primvar data, but depending on the application use case, it can be more efficient to create and use a StencilTable , or PatchTable , to refine primvar data. FarPatchTable PatchTable is the collection of patches derived from the refined faces of a particular mesh topology. This collection is created using FarPatchTableFactory from an instance of FarTopologyRefiner after refinement has been applied. Patch Arrays The PatchTable is organized into patch arrays. All patches in each array have the same type except for face-varying patch arrays which may have a mix of regular and irregular patch types. The PatchDescriptor provides the fundamental description of a patch, including the number of control points per patch as well as the basis for patch evaluation. Each patch in the array is associated with a PatchParam which specifies additional information about the individual patch. Patch Types The following are the different patch types that can be represented in the PatchTable Patch Type CVs Description NON_PATCH na Undefined patch type POINTS 1 Points useful for cage drawing LINES 2 Lines useful for cage drawing QUADS 4 Bi-linear quadrilaterals TRIANGLES 3 Linear triangles LOOP 12 Quartic triangular Box-spline patches REGULAR 16 Bi-cubic B-spline patches GREGORY 4 Legacy Gregory patches GREGORY_BOUNDARY 4 Legacy Gregory Boundary patches GREGORY_BASIS 20 Bi-cubic quadrilateral Gregory patches GREGORY_TRIANGLE 18 Quartic triangular Gregory patches The type of a patch dictates the number of control vertices expected in the table as well as the method used to evaluate values. Patch Parameterization Here we describe the encoding of the patch parameterization for quadrilateral patches. The encoding for triangular patches is similar, please see the API documentation of FarPatchParam for details. Each patch represents a specific portion of the parametric space of the coarse topological face identified by the PatchParam FaceId. As topological refinement progresses through successive levels, each resulting patch corresponds to a smaller and smaller subdomain of the face. The PatchParam UV origin describes the mapping from the uv domain of the patch to the uv subdomain of the topological face. We encode this uv origin using log2 integer values for compactness and efficiency. It is important to note that this uv parameterization is the intrinsic parameterization within a given patch or coarse face and is distinct from any client specified face-varying channel data. Patches which result from irregular coarse faces non-quad faces in the Catmark scheme are offset by the one additional level needed to quadrangulate the irregular face. It is the indices of these offset faces that are stored in the PatchParam and used in other classes such as the FarPatchMap. These offset indices can be identified from the coarse face using the FarPtexIndices class when needed. A patch along an interpolated boundary edge is supported by an incomplete sets of control vertices. For consistency, patches in the PatchTable always have a full set of control vertex indices and the PatchParam Boundary bitmask identifies which control vertices are incomplete the incomplete control vertex indices are assigned values which duplicate the first valid index. Each bit in the boundary bitmask corresponds to one edge of the patch starting from the edge from the first vertex and continuing around the patch. With feature adaptive refinement, regular B-spline basis patches along interpolated boundaries will fall into one of the eight cases four boundary and four corner illustrated below Transition edges occur during feature adaptive refinement where a patch at one level of refinement is adjacent to pairs of patches at the next level of refinement. These T-junctions do not pose a problem when evaluating primvar data on patches, but they must be taken into consideration when tessellating patches e.g. while drawing in order to avoid cracks. The PatchParam Transition bitmask identifies the transition edges of a patch. Each bit in the bitmask corresponds to one edge of the patch just like the encoding of boundary edges. After refining an arbitrary mesh, any of the 16 possible transition edge configurations might occur. The method of handling transition edges is delegated to patch drawing code. Single-Crease Patches Using single-crease patches allows a mesh with creases to be represented with many fewer patches than would be needed otherwise. A single-crease patch is a variation of a regular BSpline patch with one additional crease sharpness parameter. Release Notes 3.x Evaluation of single-crease patches is currently only implemented for OSD patch drawing, but we expect to implement support in all of the evaluation code paths for future releases. Local Points The control vertices represented by a PatchTable are primarily refined points, i.e. points which result from applying the subdivision scheme uniformly or adaptively to the points of the coarse mesh. However, the final patches generated from irregular faces, e.g. patches incident on an extraordinary vertex might have a representation which requires additional local points. Legacy Gregory Patches Using Gregory patches to approximate the surface at the final patches generated from irregular faces is an alternative representation which does not require any additional local points to be computed. Instead, when Legacy Gregory patches are used, the PatchTable must also have an alternative representation of the mesh topology encoded as a vertex valence table and a quad offsets table. FarStencilTable The base container for stencil data is the StencilTable class. As with most other Far entities, it has an associated StencilTableFactory that requires a TopologyRefiner Advantages Stencils are used to factorize the interpolation calculations that subdivision schema apply to vertices of smooth surfaces. If the topology being subdivided remains constant, factorizing the subdivision weights into stencils during a pre-compute pass yields substantial amortizations at run-time when re-posing the control cage. Factorizing the subdivision weights also allows to express each subdivided vertex as a weighted sum of vertices from the control cage. This step effectively removes any data inter-dependency between subdivided vertices the computations of subdivision interpolation can be applied to each vertex in parallel without any barriers or constraint. The Osd classes leverage these properties by exploiting CPU and GPU parallelism. Principles Iterative subdivision algorithms converge towards the limit surface by successively refining the vertices of the coarse control cage. Each successive iteration interpolates the new vertices by applying polynomial weights to a basis of supporting vertices . The interpolation calculations for any given vertex can be broken down into sequences of multiply-add operations applied to the supporting vertices. Stencil table encodes a factorization of these weighted sums each stencils is created by combining the list of control vertices from the 1-ring. With iterative subdivision, each refinement step is dependent upon the previous subdivision step being completed, and a substantial number of steps may be required in order approximate the limit each subdivision step incurs an O4 n growing amount of computations. Instead, once the weights of the contributing coarse control vertices for a given refined vertex have been factorized, it is possible to apply the stencil and directly obtain the interpolated vertex data without having to process the data for the intermediate refinement levels. Cascading Stencils Client-code can control the amount of factorization of the stencils the tables can be generated with contributions all the way from a basis of coarse vertices, or reduced only to contributions from vertices from the previous level of refinement. The latter mode allows client-code to access and insert modifications to the vertex data at set refinement levels -- creating what are often referred to as hierarchical edits . Once the edits have been applied by the client-code, another set of stencils can be used to smooth the vertex data to a higher level of refinement. See implementation details, see the Far cascading stencil tutorial Limit Stencils Stencil tables can be trivially extended from discrete subdivided vertices to arbitrary locations on the limit surface. Aside from extraordinary points, every location on the limit surface can be expressed as a closed-form weighted average of a set of coarse control vertices from the 1-ring surrounding the face. The weight accumulation process is similar the control cage is adaptively subdivided around extraordinary locations. A stencil is then generated for each limit location simply by factorizing the bi-cubic Bspline patch weights over those of the contributing basis of control-vertices. The use of bi-cubic patches also allows the accumulation of analytical derivatives, so limit stencils carry a set of weights for tangent vectors. Once the stencil table has been generated, limit stencils are the most direct and efficient method of evaluation of specific locations on the limit of a subdivision surface, starting from the coarse vertices of the control cage. Also just as discrete stencils, limit stencils that are factorized from coarse control vertices do not have inter-dependencies and can be evaluated in parallel. For implementation details, see the glStencilViewer code example. Sample Location On Extraordinary Faces Each stencil is associated with a singular parametric location on the coarse mesh. The parametric location is defined as face location and local 0.0 - 1.0 u,v triplet In the case of face that are not quads, a parametric sub-face quadrant needs to be identified. This can be done either explicitly or implicitly by using the unique ptex face indices for instance. Code example When the control vertices controlPoints move in space, the limit locations can be very efficiently recomputed simply by applying the blending weights to the series of coarse control vertices class StencilType public void Clear memset x , 0 , sizeof StencilType void AddWithWeight StencilType const cv , float weight x cv . x weight y cv . y weight z cv . z weight float x , y , z std vector StencilType controlPoints , points , utan , vtan Update points by applying stencils controlStencils . UpdateValues StencilType controlPoints 0 , points 0 Update tangents by applying derivative stencils controlStencils . UpdateDerivs StencilType controlPoints 0 , utan 0 , vtan 0 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n- \"tags\": \"\",\n- \"loc\": \"far_overview.html\"\n- }, {\n \"title\": \"glEvalLimit\",\n \"text\": \"glEvalLimit glEvalLimit 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS glEvalLimit -f -yup -u -a -l refinement level objfiles -catmark -loop -bilinear DESCRIPTION glEvalLimit is a stand-alone application that showcases the limit surface Eval module. On the given shape, random samples are generated in local s,t space. Vertex, varying and face-varying data is then computed on the surface limit and displayed as colors. In order to emphasize the dynamic nature of the EvalLimit API, where the locations can be arbitrarily updated before each evaluation, the glEvalLimit example treats each sample as a ST particle. ST Particles are a simplified parametric-space particle dynamics simulation each particle is assigned a location on the subdivision surface limit that is composed of a unique ptex face index, with a local s,t parametric pair. The system also generates an array of parametric velocities ds, dt for each particle. An Update function then applies the velocities to the locations and moves the points along the parametric space. Face boundaries are managed using a ptex adjacency table obtained from the FarTopologyRefiner. Every time a particle moves outside of the 0.0f, 1.0f parametric range, a warp function moves it to the neighboring face, or bounces it, if the edge happens to be a boundary. Note currently the adjacency code does not handle diagonal crossings, nor crossings between quad and non-quad faces. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"glevallimit.html\"\n }, {\n \"title\": \"Getting Started\",\n \"text\": \"Getting Started Getting Started 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Downloading the code Branches Git Flow Checking out branches API Versions Making Changes Code Overview Downloading the code The code is hosted on a Github public repository. Download and setup information for Git tools can be found here . You can access the OpenSubdiv Git repository at httpsgithub.comPixarAnimationStudiosOpenSubdiv From there, there are several ways of downloading the OpenSubdiv source code. Zip archive downloaded from here Using a GUI client you can find a list here Please refer to the documentation of your preferred application. From the GitShell, Cygwin or the CLI assuming that you have the Git tools installed, you can clone the OpenSubdiv repository directly with the following command git clone https github.comPixarAnimationStudiosOpenSubdiv.git These methods only pull static archives, which is are not under the version control system and therefore cannot pull updates or push changes back. If you intend on contributing features or fixes to the main trunk of the code, you will need to create a free Github account and clone a fork of the OpenSubdiv repository. Submissions to the main code trunk can be sent using Gits pull-request mechanisms. Please note that we are using the git flow tools so all changes should be made to our dev branch. Before we can accept submissions however, we will need a signed Contributors License Agreement . Branches Git Flow Since version 1.1.0, OpenSubdiv has adopted the Git Flow branching model . Our active development branch is named dev all new features and bug fixes should be submitted to this branch. The changes submitted to the dev branch are periodically patched to the release branch as new versions are released. Checking out branches The Git Flow tools are not a requisite for working with the OpenSubdiv code base, but new work should always be performed in the dev branch, or dedicated feature-branches. By default, a cloned repository will be pointing to the release branch. You can switch to the dev branch using the following command git checkout dev You can check that the branch has now been switched simply with git branch Which should return dev release API Versions OpenSubdiv maintains an internal API versioning system. The version number can be read from the file .opensubdivversion.h . Following the Git-Flow pattern, our releases are indexed using Gits tagging system. List of the existing tags git tag -- list Checking out version 1.2.0 git checkout v1_2_0 Making Changes Direct push access to the OpenSubdiv repository is currently limited to a small internal development team. External code should be submitted by sending Git pull-requests from forks of our dev branch. Code Overview The OpenSubdiv code base contains the following main areas Directory Contents .opensubdiv The main subdivision APIs Sdc, Vtr, Far and Osd. .examples A small collection of standalone applications that illustrate how to deploy the various features and optimizations of the OpenSubdiv APIs. The GL-based examples rely on the cross-platform GLFW API for interactive window management, while the DirectX ones are OS-native. .tutorials Tutorials showing how to manipulate the APIs of OpenSubdiv. .documentation The reStructuredText source files along with python scripts that generate the HTML documentation site. .regression Standalone regression tests and baseline data to help maintain the integrity of our APIs. If GPU SDKs are detected, some tests will attempt to run computations on those GPUs. Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"getting_started.html\"\n }, {\n+ \"title\": \"FAR Overview\",\n+ \"text\": \"FAR Overview FAR Overview 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE Feature Adaptive Representation Far Topology Refinement Primvar Refinement FarTopologyRefiner FarTopologyRefinerFactory FarPrimvarRefiner FarPatchTable Patch Arrays Patch Types Patch Parameterization Single-Crease Patches Local Points Legacy Gregory Patches FarStencilTable Advantages Principles Cascading Stencils Limit Stencils Sample Location On Extraordinary Faces Code example Feature Adaptive Representation Far Far is the primary API layer for processing client-supplied mesh data into subdivided surfaces. The Far interface may be used directly and also may be used to prepare mesh data for further processing by Osd . The two main aspects of the subdivision process are Topology Refinement and Primvar Refinement . Topology Refinement Topology refinement is the process of splitting the mesh topology according to the specified subdivison rules to generate new topological vertices, edges, and faces. This process is purely topological and does not depend on the speciific values of any primvar data point positions, etc. Topology refinement can be either uniform or adaptive, where extraordinary features are automatically isolated see feature adaptive subdivision . The Far topology classes present a public interface for the refinement functionality provided in Vtr , The main classes in Far related to topology refinement are TopologyRefiner A class encapsulating mesh refinement. TopologyLevel A class representing one level of refinement within a TopologyRefiner. TopologyRefinerFactoryMESH A factory class template specialized in terms of the applications mesh representation used to construct TopologyRefiner instances. Primvar Refinement Primvar refinement is the process of computing values for primvar data points, colors, normals, texture coordinates, etc by applying weights determined by the specified subdivision rules. There are many advantages gained by distinguishing between topology refinement and primvar interpolation including the ability to apply a single static topological refinement to multiple primvar instances or to different animated primvar time samples. Far supports methods to refine primvar data at the locations of topological vertices and at arbitrary locations on the subdivision limit surface. The main classes in Far related to primvar refinement are PrimvarRefiner A class implementing refinement of primvar data at the locations of topological vertices. PatchTable A representation of the refined surface topology that can be used for efficient evaluation of primvar data at arbitrary locations. StencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement. LimitStencilTable A representation of refinement weights suitable for efficient parallel processing of primvar refinement at arbitrary limit surface locations. FarTopologyRefiner TopologyRefiner is the building block for many other useful classes in Far . It performs refinement of an arbitrary mesh and provides access to the refined mesh topology. It can be used for primvar refinement directly using PrimvarRefiner or indirectly by being used to create a stencil table , or a patch table , etc. TopologyRefiner provides the public refinement methods RefineUniform and RefineAdapative which perform refinement operations using Vtr. TopologyRefiner provides access to the refined topology via TopologyLevel instances. FarTopologyRefinerFactory Consistent with other classes in Far, instances of TopologyRefiner are created by a factory class -- in this case FarTopologyRefinerFactory. Here we outline several approaches for converting mesh topology into the required FarTopologyRefiner. Additional documentation is provided with the FarTopologyRefinerFactoryMESH class template used by all, and each has a concrete example provided in one of the tutorials or in the Far code itself. There are three ways to create TopologyRefiners use the existing TopologyRefinerFactoryTopologyDescriptor with a populated instance of TopologyDescriptor specialize TopologyRefinerFactoryclass MESH for more efficient conversion, using only face-vertex information fully specialize TopologyRefinerFactorclass MESH for most control over conversion Use the FarTopologyDescriptor FarTopologyDescriptor is a simple struct that can be initialized to refer to raw mesh topology information -- primarily a face-vertex list -- and then passed to a provided factory class to create a TopologyRefiner from each. Topologically, the minimal requirement consists of the number of vertices and faces of the mesh an array containing the number of vertices per face an array containing the vertices assigned to each face These last two define one of the six topological relations that are needed internally by Vtr, but this one relation is sufficient to construct the rest. Additional members are available to assign sharpness values per edge andor vertex, hole tags to faces, or to define multiple sets channels of face-varying data. Almost all of the Far tutorials i.e. tutorialsfartutorial_ illustrate use of the TopologyDescriptor and its factory for creating TopologyRefiners, i.e. TopologyRefinerFactoryTopologyDescriptor. For situations when users have raw mesh data and have not yet constructed a boundary representation of their own, it is hoped that this will suffice. Options have even been provided to indicate that raw topology information has been defined in a left-hand winding order and the factory will handle the conversion to right-hand counter-clockwise winding on-the-fly to avoid unnecessary data duplication. Custom Factory for Face Vertices If the nature of the TopologyDescriptors data expectations is not helpful, and so conversion to large temporary arrays would be necessary to properly make use of it, it may be worth writing a custom factory. Specialization of TopologyRefinerFactoryclass MESH should be done with care as the goal here is to maximize the performance of the conversion and so minimize overhead due to runtime validation. The template provides the high-level construction of the required topology vectors of the underlying Vtr. There are two ways to write such a factory provide only the face-vertex information for topology and let the factory infer all edges and other relationships, or provide the complete edge list and all other topological relationships directly. The latter is considerably more involved and described in a following section. The definition of TopologyRefinerFactoryTopologyDescriptor provides a clear and complete example of constructing a TopologyRefiner with minimal topology information, i.e. the face-vertex list. The class template TopologyRefinerFactoryMESH documents the needs here and the TopologyDescriptor instantiation and specialization should illustrate that. Custom Factory for Direct Conversion Fully specializing a factory for direct conversion is needed only for those requiring ultimate control and is not generally recommended. It is recommended that one of the previous two methods initially be used to convert your mesh topology into a TopologyRefiner. If the conversion performance is critical, or significant enough to warrant improvement, then it is worth writing a factory for full topological conversion. Writing a custom factory requires the specificationspecialization of two methods with the following purpose specify the sizes of topological data so that vectors can be pre-allocated assign the topological data to the newly allocated vectors As noted above, the assumption here is that the clients boundary-rep knows best how to retrieve the data that we require most efficiently. After the factory class gathers sizing information and allocates appropriate memory, the factory provides the client with locations of the appropriate tables to be populated using the same Array classes and interface used to access the tables. The client is expected to load a complete topological description along with additional optional data, i.e. the six topological relations required by Vtr, oriented when manifold sharpness values for edges andor vertices optional additional tags related to the components, e.g. holes optional values-per-face for face-varying channels optional This approach requires dealing directly with edges, unlike the other two. In order to convert edges into a TopologyRefiners representation, the edges need to be expressed as a collection of known size N -- each of which is referred to directly by indices 0,N-1. This can be awkward for representations such as half-edge or quad-edge that do not treat the instance of an edge uniquely. Particular care is also necessary when representing non-manifold features. The previous two approaches will construct non-manifold features as required from the face-vertex list -- dealing with degenerate edges and other non-manifold features as encountered. When directly translating full topology it is necessary to tag non-manifold features, and also to ensure that certain edge relationships are satisfied in their presence. More details are available with the assembly methods of the factory class template. While there is plenty of opportunity for user error here, that is no different from any other conversion process. Given that Far controls the construction process through the Factory class, we do have ample opportunity to insert runtime validation, and to vary that level of validation at any time on an instance of the Factory. The factory does provide run-time validation on the topology constructed that can be used for debugging purposes. A common base class has been created for the factory class, i.e. template class MESH class TopologyRefinerFactory public TopologyRefinerFactoryBase both to provide common code independent of MESH and also potentially to protect core code from unwanted specialization. FarPrimvarRefiner PrimvarRefiner supports refinement of arbitrary primvar data at the locations of topological vertices. A PrimvarRefiner accesses topology data directly from a TopologyRefiner. Different methods are provided to support three different classes of primvar interpolation. These methods may be used to refine primvar data to a specified refinement level. Interpolate... Interpolate using vertex weights InterpolateVarying... Interpolate using linear weights InterpolateFaceVarying... Interpolate using face-varying weights Additional methods allow primvar data to be interpolated to the final limit surface including the calculation of first derivative tangents. Limitdst Interpolate to the limit surface using vertex weights Limitdst, dstTan1, dstTan2 Interpolate including first derivatives to the limit surface using vertex weights LimitFaceVarying... Interpolate to the limit surface using face-varying weights PrimarRefiner provides a straightforward interface for refining primvar data, but depending on the application use case, it can be more efficient to create and use a StencilTable , or PatchTable , to refine primvar data. FarPatchTable PatchTable is the collection of patches derived from the refined faces of a particular mesh topology. This collection is created using FarPatchTableFactory from an instance of FarTopologyRefiner after refinement has been applied. Patch Arrays The PatchTable is organized into patch arrays. All patches in each array have the same type except for face-varying patch arrays which may have a mix of regular and irregular patch types. The PatchDescriptor provides the fundamental description of a patch, including the number of control points per patch as well as the basis for patch evaluation. Each patch in the array is associated with a PatchParam which specifies additional information about the individual patch. Patch Types The following are the different patch types that can be represented in the PatchTable Patch Type CVs Description NON_PATCH na Undefined patch type POINTS 1 Points useful for cage drawing LINES 2 Lines useful for cage drawing QUADS 4 Bi-linear quadrilaterals TRIANGLES 3 Linear triangles LOOP 12 Quartic triangular Box-spline patches REGULAR 16 Bi-cubic B-spline patches GREGORY 4 Legacy Gregory patches GREGORY_BOUNDARY 4 Legacy Gregory Boundary patches GREGORY_BASIS 20 Bi-cubic quadrilateral Gregory patches GREGORY_TRIANGLE 18 Quartic triangular Gregory patches The type of a patch dictates the number of control vertices expected in the table as well as the method used to evaluate values. Patch Parameterization Here we describe the encoding of the patch parameterization for quadrilateral patches. The encoding for triangular patches is similar, please see the API documentation of FarPatchParam for details. Each patch represents a specific portion of the parametric space of the coarse topological face identified by the PatchParam FaceId. As topological refinement progresses through successive levels, each resulting patch corresponds to a smaller and smaller subdomain of the face. The PatchParam UV origin describes the mapping from the uv domain of the patch to the uv subdomain of the topological face. We encode this uv origin using log2 integer values for compactness and efficiency. It is important to note that this uv parameterization is the intrinsic parameterization within a given patch or coarse face and is distinct from any client specified face-varying channel data. Patches which result from irregular coarse faces non-quad faces in the Catmark scheme are offset by the one additional level needed to quadrangulate the irregular face. It is the indices of these offset faces that are stored in the PatchParam and used in other classes such as the FarPatchMap. These offset indices can be identified from the coarse face using the FarPtexIndices class when needed. A patch along an interpolated boundary edge is supported by an incomplete sets of control vertices. For consistency, patches in the PatchTable always have a full set of control vertex indices and the PatchParam Boundary bitmask identifies which control vertices are incomplete the incomplete control vertex indices are assigned values which duplicate the first valid index. Each bit in the boundary bitmask corresponds to one edge of the patch starting from the edge from the first vertex and continuing around the patch. With feature adaptive refinement, regular B-spline basis patches along interpolated boundaries will fall into one of the eight cases four boundary and four corner illustrated below Transition edges occur during feature adaptive refinement where a patch at one level of refinement is adjacent to pairs of patches at the next level of refinement. These T-junctions do not pose a problem when evaluating primvar data on patches, but they must be taken into consideration when tessellating patches e.g. while drawing in order to avoid cracks. The PatchParam Transition bitmask identifies the transition edges of a patch. Each bit in the bitmask corresponds to one edge of the patch just like the encoding of boundary edges. After refining an arbitrary mesh, any of the 16 possible transition edge configurations might occur. The method of handling transition edges is delegated to patch drawing code. Single-Crease Patches Using single-crease patches allows a mesh with creases to be represented with many fewer patches than would be needed otherwise. A single-crease patch is a variation of a regular BSpline patch with one additional crease sharpness parameter. Release Notes 3.x Evaluation of single-crease patches is currently only implemented for OSD patch drawing, but we expect to implement support in all of the evaluation code paths for future releases. Local Points The control vertices represented by a PatchTable are primarily refined points, i.e. points which result from applying the subdivision scheme uniformly or adaptively to the points of the coarse mesh. However, the final patches generated from irregular faces, e.g. patches incident on an extraordinary vertex might have a representation which requires additional local points. Legacy Gregory Patches Using Gregory patches to approximate the surface at the final patches generated from irregular faces is an alternative representation which does not require any additional local points to be computed. Instead, when Legacy Gregory patches are used, the PatchTable must also have an alternative representation of the mesh topology encoded as a vertex valence table and a quad offsets table. FarStencilTable The base container for stencil data is the StencilTable class. As with most other Far entities, it has an associated StencilTableFactory that requires a TopologyRefiner Advantages Stencils are used to factorize the interpolation calculations that subdivision schema apply to vertices of smooth surfaces. If the topology being subdivided remains constant, factorizing the subdivision weights into stencils during a pre-compute pass yields substantial amortizations at run-time when re-posing the control cage. Factorizing the subdivision weights also allows to express each subdivided vertex as a weighted sum of vertices from the control cage. This step effectively removes any data inter-dependency between subdivided vertices the computations of subdivision interpolation can be applied to each vertex in parallel without any barriers or constraint. The Osd classes leverage these properties by exploiting CPU and GPU parallelism. Principles Iterative subdivision algorithms converge towards the limit surface by successively refining the vertices of the coarse control cage. Each successive iteration interpolates the new vertices by applying polynomial weights to a basis of supporting vertices . The interpolation calculations for any given vertex can be broken down into sequences of multiply-add operations applied to the supporting vertices. Stencil table encodes a factorization of these weighted sums each stencils is created by combining the list of control vertices from the 1-ring. With iterative subdivision, each refinement step is dependent upon the previous subdivision step being completed, and a substantial number of steps may be required in order approximate the limit each subdivision step incurs an O4 n growing amount of computations. Instead, once the weights of the contributing coarse control vertices for a given refined vertex have been factorized, it is possible to apply the stencil and directly obtain the interpolated vertex data without having to process the data for the intermediate refinement levels. Cascading Stencils Client-code can control the amount of factorization of the stencils the tables can be generated with contributions all the way from a basis of coarse vertices, or reduced only to contributions from vertices from the previous level of refinement. The latter mode allows client-code to access and insert modifications to the vertex data at set refinement levels -- creating what are often referred to as hierarchical edits . Once the edits have been applied by the client-code, another set of stencils can be used to smooth the vertex data to a higher level of refinement. See implementation details, see the Far cascading stencil tutorial Limit Stencils Stencil tables can be trivially extended from discrete subdivided vertices to arbitrary locations on the limit surface. Aside from extraordinary points, every location on the limit surface can be expressed as a closed-form weighted average of a set of coarse control vertices from the 1-ring surrounding the face. The weight accumulation process is similar the control cage is adaptively subdivided around extraordinary locations. A stencil is then generated for each limit location simply by factorizing the bi-cubic Bspline patch weights over those of the contributing basis of control-vertices. The use of bi-cubic patches also allows the accumulation of analytical derivatives, so limit stencils carry a set of weights for tangent vectors. Once the stencil table has been generated, limit stencils are the most direct and efficient method of evaluation of specific locations on the limit of a subdivision surface, starting from the coarse vertices of the control cage. Also just as discrete stencils, limit stencils that are factorized from coarse control vertices do not have inter-dependencies and can be evaluated in parallel. For implementation details, see the glStencilViewer code example. Sample Location On Extraordinary Faces Each stencil is associated with a singular parametric location on the coarse mesh. The parametric location is defined as face location and local 0.0 - 1.0 u,v triplet In the case of face that are not quads, a parametric sub-face quadrant needs to be identified. This can be done either explicitly or implicitly by using the unique ptex face indices for instance. Code example When the control vertices controlPoints move in space, the limit locations can be very efficiently recomputed simply by applying the blending weights to the series of coarse control vertices class StencilType public void Clear memset x , 0 , sizeof StencilType void AddWithWeight StencilType const cv , float weight x cv . x weight y cv . y weight z cv . z weight float x , y , z std vector StencilType controlPoints , points , utan , vtan Update points by applying stencils controlStencils . UpdateValues StencilType controlPoints 0 , points 0 Update tangents by applying derivative stencils controlStencils . UpdateDerivs StencilType controlPoints 0 , utan 0 , vtan 0 Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n+ \"tags\": \"\",\n+ \"loc\": \"far_overview.html\"\n+ }, {\n \"title\": \"dxPtexViewer\",\n \"text\": \"dxPtexViewer dxPtexViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS KEYBOARD CONTROLS SEE ALSO SYNOPSIS dxPtexViewer -f -yup -u -a -l isolation level -c animation loops -e environment map -d HDR diffuse map -s HDR specular map --disp displacement scale ptex color file ptex displacement file ptex occlusion file ptex specular file objfiles DESCRIPTION dxPtexViewer is a stand-alone application that showcases advanced HDR shading with color, displacement, occlusion and specular ptex maps. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. -y Swap Z-up geometry to Y-UP. -e environment map A low dynamic range spherical environment map used as a background. Ideally, a color-normalized version of the HDR light probe. -d HDR diffuse map An HDR file containing a diffuse environment map typically they are low resolution blurry hemispherical convolutions of the environment light probe. -s environment map An HDR file containing a specular environment map. --disp displacement scale A scalar multiplier for the shader displacement values. ptex color file A ptex file containing RGB channels read as material albedo color. ptex displacement file A single-channel ptex file preferrably float precision containing the displacement values. ptex occlusion file A single-channel ptex file preferrably 8 bits precision containing a pre-computed ambient occlusion signal. ptex specular file A single-channel ptex file preferrably 8 bits precision applied to modulate the specular reflectance of the material objfiles A sequence of obj files used as an animation loop the topology has to match the data contained in all the ptex files KEYBOARD CONTROLS q quit esc hide GUI f fit frame - increase decrese tessellation rate SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n \"tags\": \"\",\n \"loc\": \"dxptexviewer.html\"\n }, {\n \"title\": \"dxViewer\",\n \"text\": \"dxViewer dxViewer 3.6.0 User Docs API Docs Release Notes Forum Github OSD_ARTICLE_TITLE SYNOPSIS DESCRIPTION OPTIONS SEE ALSO SYNOPSIS dxViewer -f -yup -u -a -l refinement level -c animation loops objfiles -catmark -loop -bilinear DESCRIPTION dxViewer is a stand-alone application that showcases the application of uniform and feature adaptive subdivision schemes to a collection of geometric shapes. Multiple controls are available to experiment with the algorithms. OPTIONS See the description of the common comand line options for the subset of common options supported here. SEE ALSO Other examples glViewer , glFVarViewer , glEvalLimit , glStencilViewer , glPtexViewer , glPaintTest , glShareTopology , dxViewer , dxPtexViewer , Generated on 2024-01-06 1418 UTC. User Docs API Docs Release Notes Forum TM 1986 - 2017 PIXAR. ALL RIGHTS RESERVED. Terms of Use\",\n"}]}, {"source1": "./usr/share/doc/opensubdiv/doxy_html/a00701.html", "source2": "./usr/share/doc/opensubdiv/doxy_html/a00704.html", "comments": ["Files 12% similar despite different names"], "unified_diff": "@@ -1,15 +1,15 @@\n \n \n \n \n \n \n \n-OpenSubdiv: opensubdiv/far/topologyRefinerFactory.h File Reference\n+OpenSubdiv: opensubdiv/far/topologyRefiner.h File Reference\n \n \n \n \n \n \n \n@@ -61,15 +61,15 @@\n
\n
\n
\n \n \n
\n \n
\n
\n \n
\n \n-
topologyRefinerFactory.h File Reference
\n+
topologyRefiner.h File Reference
\n
\n
\n
#include "../version.h"
\n-#include "../far/topologyRefiner.h"
\n-#include "../far/error.h"
\n-#include <cassert>
\n+#include "../sdc/types.h"
\n+#include "../sdc/options.h"
\n+#include "../far/types.h"
\n+#include "../far/topologyLevel.h"
\n+#include <vector>
\n
\n-

Go to the source code of this file.

\n+

Go to the source code of this file.

\n \n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n-\n-\n+\n+\n \n

\n Classes

class  TopologyRefinerFactoryBase
 Private base class of Factories for constructing TopologyRefiners. More...
class  TopologyRefiner
 Stores topology data for a specified set of refinement options. More...
 
class  TopologyRefinerFactory< MESH >
 Factory for constructing TopologyRefiners from specific mesh classes. More...
struct  TopologyRefiner::UniformOptions
 Uniform refinement options. More...
 
struct  TopologyRefinerFactory< MESH >::Options
 Options related to the construction of each TopologyRefiner. More...
struct  TopologyRefiner::AdaptiveOptions
 Adaptive refinement options. More...
 
\n \n \n \n \n \n+\n+\n \n \n

\n Namespaces

namespace  OpenSubdiv
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Vtr
 
namespace  OpenSubdiv::OPENSUBDIV_VERSION::Far
 
\n
\n
\n \n
\n \n
\n \n \n", "details": [{"source1": "html2text {}", "source2": "html2text {}", "unified_diff": "@@ -1,34 +1,37 @@\n [Logo] OpenSubdiv\n Loading...\n Searching...\n No Matches\n _\bC_\bl_\ba_\bs_\bs_\be_\bs | _\bN_\ba_\bm_\be_\bs_\bp_\ba_\bc_\be_\bs\n-topologyRefinerFactory.h File Reference\n+topologyRefiner.h File Reference\n #include \"../version.h\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\"\n-#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\be_\br_\br_\bo_\br_\b._\bh\"\n-#include \n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bs_\bd_\bc_\b/_\bo_\bp_\bt_\bi_\bo_\bn_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\by_\bp_\be_\bs_\b._\bh\"\n+#include \"_\b._\b._\b/_\bf_\ba_\br_\b/_\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bL_\be_\bv_\be_\bl_\b._\bh\"\n+#include \n _\bG_\bo_\b _\bt_\bo_\b _\bt_\bh_\be_\b _\bs_\bo_\bu_\br_\bc_\be_\b _\bc_\bo_\bd_\be_\b _\bo_\bf_\b _\bt_\bh_\bi_\bs_\b _\bf_\bi_\bl_\be_\b.\n C\bCl\bla\bas\bss\bse\bes\bs\n- class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\bB_\ba_\bs_\be\n-\u00a0 Private base class of Factories for constructing TopologyRefiners.\n+ class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br\n+\u00a0 Stores topology data for a specified set of refinement options.\n _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n- class \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bM_\bE_\bS_\bH_\b _\b>\n-\u00a0 Factory for constructing TopologyRefiners from specific mesh classes.\n- _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bU_\bn_\bi_\bf_\bo_\br_\bm_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 Uniform refinement options. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n-struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b<_\b _\bM_\bE_\bS_\bH_\b _\b>_\b:_\b:_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n-\u00a0 _\bO_\bp_\bt_\bi_\bo_\bn_\bs related to the construction of each _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br. _\bM_\bo_\br_\be_\b._\b._\b.\n+struct \u00a0 _\bT_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b:_\b:_\bA_\bd_\ba_\bp_\bt_\bi_\bv_\be_\bO_\bp_\bt_\bi_\bo_\bn_\bs\n+\u00a0 Adaptive refinement options. _\bM_\bo_\br_\be_\b._\b._\b.\n \u00a0\n N\bNa\bam\bme\bes\bsp\bpa\bac\bce\bes\bs\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv\n \u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN\n \u00a0\n+namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bV_\bt_\br\n+\u00a0\n namespace \u00a0 _\bO_\bp_\be_\bn_\bS_\bu_\bb_\bd_\bi_\bv_\b:_\b:_\bO_\bP_\bE_\bN_\bS_\bU_\bB_\bD_\bI_\bV_\b__\bV_\bE_\bR_\bS_\bI_\bO_\bN_\b:_\b:_\bF_\ba_\br\n \u00a0\n * _\bo_\bp_\be_\bn_\bs_\bu_\bb_\bd_\bi_\bv\n * _\bf_\ba_\br\n- * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\bF_\ba_\bc_\bt_\bo_\br_\by_\b._\bh\n+ * _\bt_\bo_\bp_\bo_\bl_\bo_\bg_\by_\bR_\be_\bf_\bi_\bn_\be_\br_\b._\bh\n * Generated on Sat Jan 6 2024 14:18:14 for OpenSubdiv by _\b[_\bd_\bo_\bx_\by_\bg_\be_\bn_\b]1.9.8\n"}]}]}]}]}]}