Skip to main content

apt from src

 apt install dpkg-dev devscripts
apt build-dep <package-name>
debuild -b -uc -us
-b: Build binary packages only
-uc: Prevent signing of chainlog
-us: Prevent signing of Source Code

  dpkg-buildpackage -b -uc -us

apt-get source --compile <package-name>

   apt install zathura-dev libjbig2dec0-dev  libmupdf-dev libopenjp2-7-dev libssl-dev


  https://debian-handbook.info/browse/stable/debian-packaging.html



  https://git.pwmt.org/pwmt/zathura/-/issues/174

 [libmupdf-dev] unable to link against libmupdf.a
  https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=617253
 
 
   RFP: zathura-mupdf -- mupdf backend for zathura
  https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=833068
 
   [mupdf] Please support to compile fitz as a .so
  https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=719351
     mupdf upstreams says "fitz is still immature and should not be
exposed nor dynamically linked" (#719351)

 RFP: zathura-mupdf -- mupdf backend for zathura
  https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=731447
This is blocked by a proper fix for #617253. Ideally, mupdf would start
to provide a shared library (#719351) and commit to a somewhat stable
API. mupdf needs to get in a better shape before zathura-pdf-mupdf can
be packaged
https://gitlab.com/paretje/zathura-pdf-mupdf

  https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=1073285
 

 
 

Comments

Post a Comment

Popular posts from this blog

xdm linux merge incomplete download parts

 some download stuck at 99.99% , merge them regardless got to ~/.xdm-app-data/Data/*.state cat dec.py import os import re # Define the pattern to extract the segment number pattern = re.compile(r'seg-(\d+)-v1-a1\.ts') # Get the current working directory current_directory = os.getcwd() # List to hold tuples of (segment_number, filename) files_with_segments = [] # Iterate through files in the current directory for filename in os.listdir(current_directory): match = pattern.search(filename) if match: # Extract the segment number as an integer segment_number = int(match.group(1)) # Add the tuple (segment_number, filename) to the list files_with_segments.append((segment_number, filename)) # Sort the list by the segment number (numerical sort) files_with_segments.sort(key=lambda x: x[0]) # Open the filelist.txt for writing with open('filelist.txt', 'w') as filelist: for _, filename in files_with_segments: file...
Post a Comment
Read more

kde on debian

https://wiki.debian.org/KDE sudo apt install   xserver-xorg-input-libinput xserver-xorg-video-intel  sudo apt install plasma-desktop plasma-workspace-wayland  sddm  issue  file:///usr/share/plasma/plasmoids/org.kde.plasma.kickoff/contents/ui/Kickoff.qml:157:34: Type FullRepresentat ion unavailable file:///usr/share/plasma/plasmoids/org.kde.plasma.kickoff/contents/ui/FullRepresentation.qml:80:22: Type Norma lPage unavailable file:///usr/share/plasma/plasmoids/org.kde.plasma.kickoff/contents/ui/NormalPage.qml:43:13: Type Footer unavai lable file:///usr/share/plasma/plasmoids/org.kde.plasma.kickoff/contents/ui/Footer.qml:155:5: Type LeaveButtons unav ailable file:///usr/share/plasma/plasmoids/org.kde.plasma.kickoff/contents/ui/LeaveButtons.qml:14:1: module "org.kde.k itemmodels" is not installed # upower , it is installed by powerdevil though sudo apt install kde-config-gtk-style  kde-config-gtk-style-preview   breeze-gtk-theme  sudo apt i...
Post a Comment
Read more

rsa encryption

 choose two large  prime number p (prime 1) and q (prime 2)   n = p x q , where n is called the modulus for encryption and decryption   φ = ( p - 1) x ( q -1) is called Euler's totient function for n= pq For a given positive integer n, Euler's totient function ϕ(n) is defined as the number of positive integers less than or equal to n that are coprime (i.e., share no common factors) with n. ϕ( n ) = n ∏ p ∣ n ( 1 − 1 p )     \phi(n) = n \prod_{p \mid n} \left(1 - \frac{1}{p}\right)   p ∣ n means that p p divides n , and is a prime factor greater than 1  i  n    example , n=2*3=6 with factors f=1 , 2 , 3 , 4 , 5,6 factors Two numbers are coprime if their greatest common divisor (GCD) is 1 here find gcd(f,n)=1  only 1 and 5 are coprime with 6  φ =1*2 =2   choose e less  than φ , such that  e is co prime with φ , ie  e has no common factor with φ except 1 mathematically : gcd ( e , φ ...
Post a Comment
Read more