+ sort(uniforms, &uniform_name_compare);
+
+ for(unsigned i=0; i<uniform_blocks.size(); ++i)
+ {
+ UniformBlockInfo &block = uniform_blocks[i];
+ const vector<string> &names = block_uniform_names[i];
+ for(vector<string>::const_iterator j=names.begin(); j!=names.end(); ++j)
+ {
+ // The element is already known to be present
+ UniformInfo &uni = *lower_bound(uniforms, *j, &name_search<UniformInfo>);
+ block.uniforms.push_back(&uni);
+ uni.block = █
+ }
+ block.layout_hash = compute_layout_hash(block.uniforms);
+ }