• C# Lodop与C-Lopdop选择打印机


    原文:https://www.cnblogs.com/huaxie/p/9766886.html

              https://www.cnblogs.com/huaxie/p/10857490.html

    https://blog.csdn.net/zhou120189162/article/details/79937432

    //SET_PRINTER_INDEX(oIndexOrName);按序号或名称指定打印机,选定后禁止手工重选;
    
    CreateOneFormPage();
    LODOP.SET_PRINT_MODE("TRYLINKPRINTER_NOALERT",true);//这个语句设置网络共享打印机连接不通时是否提示一下
    if (LODOP.SET_PRINTER_INDEX(0))//这里指定第0号打印机打印
    LODOP.PRINT();

           

    1.C-Lopdop选择打印机(C-Lodop特有的函数Create_Printer_List)

    C-Lodop获取打印机列表Create_Printer_List,此方法Lodop不支持,是C-Lodop特有的函数,客户端本地打印单独用c-lodop,或集中打印等,可以获得本机或云主机的打印机列表。

    2.Lodop选择打印机

    <head>
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
    <title>WEB打印控件LODOP</title>
    <script language="javascript" src="LodopFuncs.js"></script>
    <style>
    </style>
    </head>
    <input type="button" value="选择打印机" onclick="creatPrintList()" > <select id="PrinterList" size="1" style="margin-top:10px;"></select>
    <input type="button" value="选择打印机" onclick="creatPrintList2()" > <select id="PrinterList2" size="1" style="margin-top:10px;"></select> 
    
    <script language="javascript" type="text/javascript">   
            var LODOP; //声明为全局变量 
           function creatPrintList(){
            LODOP=getLodop(); 
            var iPrinterCount=LODOP.GET_PRINTER_COUNT();
            for(var i=0;i<iPrinterCount;i++){
                   var option=document.createElement('option');
                   option.innerHTML=LODOP.GET_PRINTER_NAME(i);
                   option.value=i;
                document.getElementById('PrinterList').appendChild(option);
            };    
           document.getElementById('PrinterList').style.display='block';
           };
    
           function creatPrintList2(){
        if (document.getElementById('PrinterList2').innerHTML!="") return;
        //点第二次以上,在列表已经填充不为空情况下,不再执行后面的代码,直接返回,避免重新装载打印机。
            LODOP=getLodop(); 
            var iPrinterCount=LODOP.GET_PRINTER_COUNT();
            for(var i=0;i<iPrinterCount;i++){
                   var option=document.createElement('option');
                   option.innerHTML=LODOP.GET_PRINTER_NAME(i);
                   option.value=i;
                document.getElementById('PrinterList2').appendChild(option);
            };    
           document.getElementById('PrinterList2').style.display='block';
           };
        function prn1_preview() {
            LODOP=getLodop(); 
            LODOP.PRINT_INIT("");
            LODOP.SET_PRINTER_INDEX(document.getElementById("PrinterList").value);    
            LODOP.SET_PRINT_PAGESIZE(1,300,500,"");
            LODOP.ADD_PRINT_TEXT(4,62,150,40,"文字");
            LODOP.PREVIEW();    
        };
    </script> 
    </body>
  • 相关阅读:
    BFS POJ 2251 Dungeon Master
    DFS POJ 1321 棋盘问题
    构造 Codeforces Round #275 (Div. 2) C. Diverse Permutation
    线段树+树状数组+贪心 HDOJ 5338 ZZX and Permutations
    快速幂取模 POJ 3761 bubble sort
    矩阵快速幂 POJ 3070 Fibonacci
    矩阵快速幂 POJ 3735 Training little cats
    DP+矩阵快速幂 HDOJ 5318 The Goddess Of The Moon
    L2-001. 紧急救援(PAT)~最短路应用
    ~psd面试 求最长回文序列 DP求解
  • 原文地址:https://www.cnblogs.com/zhang1f/p/11409045.html
Copyright © 2020-2023  润新知