OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:oldDigest
(Results
1 - 2
of
2
) sorted by null
/libcore/luni/src/test/java/com/android/org/bouncycastle/crypto/digests/
DigestTest.java
35
* @param
oldDigest
The old digest implementation, provided by Bouncy Castle
38
public void doTestMessageDigest(Digest
oldDigest
, Digest newDigest) {
43
byte[] oldHash = new byte[
oldDigest
.getDigestSize()];
47
oldDigest
.getAlgorithmName(), newDigest.getAlgorithmName());
51
((ExtendedDigest)
oldDigest
).getByteLength(),
63
oldDigest
.update(data, 0, data.length);
65
int oldLength =
oldDigest
.doFinal(oldHash, 0);
96
Digest
oldDigest
= new MD5Digest();
98
doTestMessageDigest(
oldDigest
, newDigest);
105
Digest
oldDigest
= new SHA1Digest()
[
all
...]
/external/chromium_org/third_party/WebKit/Source/core/inspector/
DOMPatchSupport.cpp
164
bool DOMPatchSupport::innerPatchNode(Digest*
oldDigest
, Digest* newDigest, ExceptionState& es)
166
if (
oldDigest
->m_sha1 == newDigest->m_sha1)
169
Node* oldNode =
oldDigest
->m_node;
186
if (
oldDigest
->m_attrsSHA1 != newDigest->m_attrsSHA1) {
207
bool result = innerPatchChildren(oldElement,
oldDigest
->m_children, newDigest->m_children, es);
461
bool DOMPatchSupport::removeChildAndMoveToNew(Digest*
oldDigest
, ExceptionState& es)
463
RefPtr<Node> oldNode =
oldDigest
->m_node;
472
UnusedNodesMap::iterator it = m_unusedNodesMap.find(
oldDigest
->m_sha1);
483
for (size_t i = 0; i <
oldDigest
->m_children.size(); ++i) {
484
if (!removeChildAndMoveToNew(
oldDigest
->m_children[i].get(), es)
[
all
...]
Completed in 4291 milliseconds