summaryrefslogtreecommitdiffstats
path: root/googlemock
diff options
context:
space:
mode:
authorCopybara-Service <copybara-worker@google.com>2023-08-23 16:30:13 (GMT)
committerCopybara-Service <copybara-worker@google.com>2023-08-23 16:30:13 (GMT)
commit460ae98267b83db4ca2730d368d53f8aee3b636e (patch)
treebd4964dca5999601cbeef8463a5c9aa2c4ac5fa4 /googlemock
parentcb5cd96bcafc15eaaf73517357b596e9ca1e71b4 (diff)
parentf0eae4b3995b77cfbb49cc91f98da5d1f3c4fe05 (diff)
downloadgoogletest-460ae98267b83db4ca2730d368d53f8aee3b636e.zip
googletest-460ae98267b83db4ca2730d368d53f8aee3b636e.tar.gz
googletest-460ae98267b83db4ca2730d368d53f8aee3b636e.tar.bz2
Merge pull request #4349 from sthd:httpToHttps
PiperOrigin-RevId: 559452348 Change-Id: I6f72001fd6b8e5a739c34121c8847c281d563b0f
Diffstat (limited to 'googlemock')
-rw-r--r--googlemock/README.md6
-rw-r--r--googlemock/src/gmock-matchers.cc2
2 files changed, 4 insertions, 4 deletions
diff --git a/googlemock/README.md b/googlemock/README.md
index 7da6065..e1103b1 100644
--- a/googlemock/README.md
+++ b/googlemock/README.md
@@ -8,8 +8,8 @@ derive better designs of your system and write better tests.
It is inspired by:
* [jMock](http://www.jmock.org/)
-* [EasyMock](http://www.easymock.org/)
-* [Hamcrest](http://code.google.com/p/hamcrest/)
+* [EasyMock](https://easymock.org/)
+* [Hamcrest](https://code.google.com/p/hamcrest/)
It is designed with C++'s specifics in mind.
@@ -36,5 +36,5 @@ Details and examples can be found here:
* [gMock Cheat Sheet](https://google.github.io/googletest/gmock_cheat_sheet.html)
GoogleMock is a part of
-[GoogleTest C++ testing framework](http://github.com/google/googletest/) and a
+[GoogleTest C++ testing framework](https://github.com/google/googletest/) and a
subject to the same requirements.
diff --git a/googlemock/src/gmock-matchers.cc b/googlemock/src/gmock-matchers.cc
index 07bba4f..81a5b7e 100644
--- a/googlemock/src/gmock-matchers.cc
+++ b/googlemock/src/gmock-matchers.cc
@@ -120,7 +120,7 @@ GTEST_API_ std::string FormatMatcherDescription(
// [1] Cormen, et al (2001). "Section 26.2: The Ford-Fulkerson method".
// "Introduction to Algorithms (Second ed.)", pp. 651-664.
// [2] "Ford-Fulkerson algorithm", Wikipedia,
-// 'http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm'
+// 'https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm'
class MaxBipartiteMatchState {
public:
explicit MaxBipartiteMatchState(const MatchMatrix& graph)