backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity
Files
280fc90fcecbca71559e05c7d2aa320e5980da0d
C-Plus-Plus/dir_296d53ceaeaa7e099814a6def439fe8a.html
github-actions f1abbec8bd Documentation for 247301c5b5
2020-07-02 12:52:33 +00:00

205 lines
21 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math Directory Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('dir_296d53ceaeaa7e099814a6def439fe8a.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">math Directory Reference</div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
Files</h2></td></tr>
<tr class="memitem:d4/d5d/math_2armstrong__number_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html">armstrong_number.cpp</a></td></tr>
<tr class="memdesc:d4/d5d/math_2armstrong__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to check if a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number">Armstrong/Narcissistic number</a> in decimal system. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:de/dcf/binary__exponent_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</a></td></tr>
<tr class="memdesc:de/dcf/binary__exponent_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find Binary Exponent Iteratively and Recursively. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d5/df6/check__amicable__pair_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr>
<tr class="memdesc:d5/df6/check__amicable__pair_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers">amicable pair</a> or not. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:db/d93/check__prime_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d93/check__prime_8cpp.html">check_prime.cpp</a></td></tr>
<tr class="memdesc:db/d93/check__prime_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is &lt;= 1 or if it is even except 2, break the loop and return false telling number is not prime. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d5/d67/complex__numbers_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></td></tr>
<tr class="memdesc:d5/d67/complex__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d7/d89/double__factorial_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d89/double__factorial_8cpp.html">double_factorial.cpp</a></td></tr>
<tr class="memdesc:d7/d89/double__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial">double factorial</a>: \(n!!\). <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:da/d23/eulers__totient__function_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d23/eulers__totient__function_8cpp.html">eulers_totient_function.cpp</a></td></tr>
<tr class="memdesc:da/d23/eulers__totient__function_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's Totient</a> function. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/d5d/extended__euclid__algorithm_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.cpp</a></td></tr>
<tr class="memdesc:d9/d5d/extended__euclid__algorithm_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">GCD using <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">extended Euclid's algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/d00/factorial_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d00/factorial_8cpp.html">factorial.cpp</a></td></tr>
<tr class="memdesc:d9/d00/factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ program to find factorial of given number. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d2/d0b/fast__power_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d0b/fast__power_8cpp.html">fast_power.cpp</a></td></tr>
<tr class="memdesc:d2/d0b/fast__power_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Faster computation for \(a^b\). <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/d89/fibonacci_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></td></tr>
<tr class="memdesc:d9/d89/fibonacci_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generate fibonacci sequence. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d32/fibonacci__fast_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></td></tr>
<tr class="memdesc:d4/d32/fibonacci__fast_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Faster computation of Fibonacci series. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:de/de4/fibonacci__large_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/de4/fibonacci__large_8cpp.html">fibonacci_large.cpp</a></td></tr>
<tr class="memdesc:de/de4/fibonacci__large_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/da0/gcd__iterative__euclidean_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></td></tr>
<tr class="memdesc:d4/da0/gcd__iterative__euclidean_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm">Euclidean algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d1/d11/gcd__of__n__numbers_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.cpp</a></td></tr>
<tr class="memdesc:d1/d11/gcd__of__n__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This program aims at calculating the GCD of n numbers by division method. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d45/gcd__recursive__euclidean_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></td></tr>
<tr class="memdesc:d4/d45/gcd__recursive__euclidean_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm">Euclidean algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d6/d9d/large__factorial_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d9d/large__factorial_8cpp.html">large_factorial.cpp</a></td></tr>
<tr class="memdesc:d6/d9d/large__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute factorial of any arbitratily large number/. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d86/large__number_8h"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d86/large__number_8h.html">large_number.h</a> <a href="d4/d86/large__number_8h_source.html">[code]</a></td></tr>
<tr class="memdesc:d4/d86/large__number_8h"><td class="mdescLeft">&#160;</td><td class="mdescRight">Library to perform arithmatic operations on arbitrarily large numbers. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d21/least__common__multiple_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d6/d42/miller__rabin_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d42/miller__rabin_8cpp.html">miller_rabin.cpp</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d8/d53/modular__inverse__fermat__little__theorem_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></td></tr>
<tr class="memdesc:d8/d53/modular__inverse__fermat__little__theorem_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem">Fermat's Little Theorem</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/da2/number__of__positive__divisors_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></td></tr>
<tr class="memdesc:d0/da2/number__of__positive__divisors_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to calculate number of divisors. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:df/def/power__for__huge__numbers_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></td></tr>
<tr class="memdesc:df/def/power__for__huge__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute powers of large numbers. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:db/d0d/prime__factorization_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d0d/prime__factorization_8cpp.html">prime_factorization.cpp</a></td></tr>
<tr class="memdesc:db/d0d/prime__factorization_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prime factorization of positive integers. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:de/d9b/prime__numbers_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d9b/prime__numbers_8cpp.html">prime_numbers.cpp</a></td></tr>
<tr class="memdesc:de/d9b/prime__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get list of prime numbers. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d9c/primes__up__to__billion_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></td></tr>
<tr class="memdesc:d4/d9c/primes__up__to__billion_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute prime numbers upto 1 billion. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/d08/realtime__stats_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></td></tr>
<tr class="memdesc:d0/d08/realtime__stats_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute statistics for data entered in rreal-time. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></td></tr>
<tr class="memdesc:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main). <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:da/d24/sqrt__double_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></td></tr>
<tr class="memdesc:da/d24/sqrt__double_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method">bisection method</a> of root-finding. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:de/d47/string__fibonacci_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d47/string__fibonacci_8cpp.html">string_fibonacci.cpp</a></td></tr>
<tr class="memdesc:de/d47/string__fibonacci_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This Programme returns the Nth fibonacci as a string. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d83/sum__of__digits_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></td></tr>
<tr class="memdesc:d4/d83/sum__of__digits_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to find the Sum of Digits of input integer. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink