Home
last modified time | relevance | path

Searched refs:newBlocks (Results 1 – 25 of 116) sorted by relevance

12345

/dports/security/keybase/client-v5.7.1/shared/chat/blocking/block-modal/
H A Dindex.tsx23 newBlocks: NewBlocksMap
136 newBlocks: new Map(),
166 const {newBlocks} = this.state
176 const {newBlocks} = this.state
189 this.setState({newBlocks: new Map(newBlocks)})
193 const {newBlocks} = this.state
198 this.setState({newBlocks: new Map(newBlocks)})
203 const {newBlocks} = this.state
212 this.setState({newBlocks: new Map(newBlocks)})
225 this.setState({newBlocks: new Map(newBlocks)})
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/SPIRV-Tools/src/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
48 for (auto& bb : newBlocks) { in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/devel/intel-graphics-compiler/SPIRV-Tools/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
43 for (auto& bb : newBlocks) { in InlineExhaustive()
46 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
48 for (auto& bb : newBlocks) { in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
48 for (auto& bb : newBlocks) { in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/spirv-tools/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
48 for (auto& bb : newBlocks) { in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/graphics/spirv-tools/SPIRV-Tools-2021.4/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
43 for (auto& bb : newBlocks) { in InlineExhaustive()
46 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/SPIRV-Tools/src/source/opt/
H A Dinline_exhaustive_pass.cpp31 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineExhaustive() local
33 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineExhaustive()
38 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineExhaustive()
48 for (auto& bb : newBlocks) { in InlineExhaustive()
51 bi = bi.InsertBefore(&newBlocks); in InlineExhaustive()
H A Dinline_opaque_pass.cpp73 std::vector<std::unique_ptr<BasicBlock>> newBlocks; in InlineOpaque() local
75 if (!GenInlineCode(&newBlocks, &newVars, ii, bi)) { in InlineOpaque()
81 if (newBlocks.size() > 1) UpdateSucceedingPhis(newBlocks); in InlineOpaque()
84 bi = bi.InsertBefore(&newBlocks); in InlineOpaque()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/muq2/modules/Approximation/src/GaussianProcesses/
H A DProductKernel.cpp134 …std::vector<std::shared_ptr<muq::Modeling::LinearOperator>> newBlocks( periodicF->GetBlocks().size… in GetProductStateSpace() local
135 for(int i=0; i<newBlocks.size(); ++i) in GetProductStateSpace()
136 newBlocks.at(i) = muq::Modeling::KroneckerSum(otherF, periodicF->GetBlock(i) ); in GetProductStateSpace()
138 auto newF = std::make_shared<muq::Modeling::BlockDiagonalOperator>(newBlocks); in GetProductStateSpace()
141 for(int i=0; i<newBlocks.size(); ++i) in GetProductStateSpace()
142newBlocks.at(i) = std::make_shared<muq::Modeling::KroneckerProductOperator>(otherL, periodicL->Get… in GetProductStateSpace()
144 auto newL = std::make_shared<muq::Modeling::BlockDiagonalOperator>(newBlocks); in GetProductStateSpace()
150 for(int i=0; i<newBlocks.size(); ++i) in GetProductStateSpace()
153 auto newH = std::make_shared<muq::Modeling::BlockRowOperator>(newBlocks); in GetProductStateSpace()
160 for(int i=0; i<newBlocks.size(); ++i) in GetProductStateSpace()
[all …]
/dports/net/syncthing/syncthing-1.18.1/syncthing/lib/model/
H A Dblockpullreorderer.go84 newBlocks := make([]protocol.BlockInfo, 0, len(blocks))
88 newBlocks = append(newBlocks, chunks[p.myIndex]...)
104 newBlocks = append(newBlocks, chunks[idx]...)
107 return newBlocks
/dports/devel/juce/JUCE-f37e9a1/modules/juce_audio_formats/format/
H A Djuce_BufferingAudioFormatReader.cpp141 OwnedArray<BufferedBlock> newBlocks; in readNextBufferChunk() local
145 newBlocks.add (blocks.getUnchecked(i)); in readNextBufferChunk()
147 if (newBlocks.size() == numBlocks) in readNextBufferChunk()
149 newBlocks.clear (false); in readNextBufferChunk()
157 newBlocks.add (new BufferedBlock (*source, p, samplesPerBlock)); in readNextBufferChunk()
164 newBlocks.swapWith (blocks); in readNextBufferChunk()
168 newBlocks.removeObject (blocks.getUnchecked(i), false); in readNextBufferChunk()
/dports/audio/libopenshot-audio/libopenshot-audio-0.2.2/JuceLibraryCode/modules/juce_audio_formats/format/
H A Djuce_BufferingAudioFormatReader.cpp142 OwnedArray<BufferedBlock> newBlocks; in readNextBufferChunk() local
146 newBlocks.add (blocks.getUnchecked(i)); in readNextBufferChunk()
148 if (newBlocks.size() == numBlocks) in readNextBufferChunk()
150 newBlocks.clear (false); in readNextBufferChunk()
158 newBlocks.add (new BufferedBlock (*source, p, samplesPerBlock)); in readNextBufferChunk()
165 newBlocks.swapWith (blocks); in readNextBufferChunk()
169 newBlocks.removeObject (blocks.getUnchecked(i), false); in readNextBufferChunk()
/dports/devel/hadoop2/hadoop-2.7.2-src/hadoop-hdfs-project/hadoop-hdfs/src/main/java/org/apache/hadoop/hdfs/protocol/
H A DLocatedBlocks.java145 public void insertRange(int blockIdx, List<LocatedBlock> newBlocks) { in insertRange() argument
148 for(int newIdx = 0; newIdx < newBlocks.size() && oldIdx < blocks.size(); in insertRange()
150 long newOff = newBlocks.get(newIdx).getStartOffset(); in insertRange()
156 blocks.set(oldIdx, newBlocks.get(newIdx)); in insertRange()
158 blocks.addAll(oldIdx, newBlocks.subList(insStart, insEnd)); in insertRange()
167 insEnd = newBlocks.size(); in insertRange()
169 blocks.addAll(oldIdx, newBlocks.subList(insStart, insEnd)); in insertRange()
/dports/devel/hadoop/hadoop-1.2.1/src/hdfs/org/apache/hadoop/hdfs/protocol/
H A DLocatedBlocks.java125 public void insertRange(int blockIdx, List<LocatedBlock> newBlocks) { in insertRange() argument
128 for(int newIdx = 0; newIdx < newBlocks.size() && oldIdx < blocks.size(); in insertRange()
130 long newOff = newBlocks.get(newIdx).getStartOffset(); in insertRange()
136 blocks.set(oldIdx, newBlocks.get(newIdx)); in insertRange()
138 blocks.addAll(oldIdx, newBlocks.subList(insStart, insEnd)); in insertRange()
147 insEnd = newBlocks.size(); in insertRange()
149 blocks.addAll(oldIdx, newBlocks.subList(insStart, insEnd)); in insertRange()
/dports/net-im/matterircd/matterircd-0.25.0/vendor/github.com/mattermost/mattermost-server/v6/shared/markdown/
H A Dblocks.go77 …if newBlocks := blockStart(markdown, indentation, r, openBlocks[:lastMatchIndex+1], openBlocks[las…
81 if addedBlocks := container.AddChild(newBlocks); addedBlocks != nil {
112 if newBlocks := container.AddChild([]Block{paragraph}); newBlocks != nil {
115 openBlocks = append(openBlocks, newBlocks...)
/dports/net-im/matterircd/matterircd-0.25.0/vendor/github.com/mattermost/mattermost-server/v5/shared/markdown/
H A Dblocks.go77 …if newBlocks := blockStart(markdown, indentation, r, openBlocks[:lastMatchIndex+1], openBlocks[las…
81 if addedBlocks := container.AddChild(newBlocks); addedBlocks != nil {
112 if newBlocks := container.AddChild([]Block{paragraph}); newBlocks != nil {
115 openBlocks = append(openBlocks, newBlocks...)
/dports/net-im/matterbridge/matterbridge-1.22.3/vendor/github.com/mattermost/mattermost-server/v5/utils/markdown/
H A Dblocks.go77 …if newBlocks := blockStart(markdown, indentation, r, openBlocks[:lastMatchIndex+1], openBlocks[las…
81 if addedBlocks := container.AddChild(newBlocks); addedBlocks != nil {
112 if newBlocks := container.AddChild([]Block{paragraph}); newBlocks != nil {
115 openBlocks = append(openBlocks, newBlocks...)
/dports/www/mattermost-server/mattermost-server-6.0.2/shared/markdown/
H A Dblocks.go77 …if newBlocks := blockStart(markdown, indentation, r, openBlocks[:lastMatchIndex+1], openBlocks[las…
81 if addedBlocks := container.AddChild(newBlocks); addedBlocks != nil {
112 if newBlocks := container.AddChild([]Block{paragraph}); newBlocks != nil {
115 openBlocks = append(openBlocks, newBlocks...)

12345