| henrike@webrtc.org | 0e118e7 | 2013-07-10 00:45:36 +0000 | [diff] [blame] | 1 | /* |
| 2 | * libjingle |
| 3 | * Copyright 2004--2010, Google Inc. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions are met: |
| 7 | * |
| 8 | * 1. Redistributions of source code must retain the above copyright notice, |
| 9 | * this list of conditions and the following disclaimer. |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * 3. The name of the author may not be used to endorse or promote products |
| 14 | * derived from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
| 19 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 20 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| 21 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; |
| 22 | * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| 23 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR |
| 24 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF |
| 25 | * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #ifndef TALK_BASE_VERSIONPARSING_H_ |
| 29 | #define TALK_BASE_VERSIONPARSING_H_ |
| 30 | |
| 31 | #include <string> |
| 32 | |
| 33 | namespace talk_base { |
| 34 | |
| 35 | // Parses a version string into an array. "num_expected_segments" must be the |
| 36 | // number of numerical segments that the version is expected to have (e.g., |
| 37 | // "1.1.2.0" has 4). "version" must be an array of that length to hold the |
| 38 | // parsed numbers. |
| 39 | // Returns "true" iff successful. |
| 40 | bool ParseVersionString(const std::string& version_str, |
| 41 | int num_expected_segments, |
| 42 | int version[]); |
| 43 | |
| 44 | // Computes the lexicographical order of two versions. The return value |
| 45 | // indicates the order in the standard way (e.g., see strcmp()). |
| 46 | int CompareVersions(const int version1[], |
| 47 | const int version2[], |
| 48 | int num_segments); |
| 49 | |
| 50 | } // namespace talk_base |
| 51 | |
| 52 | #endif // TALK_BASE_VERSIONPARSING_H_ |