zoukankan      html  css  js  c++  java
  • WPF PrintDialog 支持选择打印范围

    坑爹的PrintDialog 其实并没有队PageRange这个属性做处理。自己处理一下~
     public class PrintDialogWithPageRange:PrintDialog
        {
            public new void PrintDocument(DocumentPaginator doc, string desp)
            {
                if (this.PageRangeSelection == PageRangeSelection.AllPages)
                {
                    base.PrintDocument(doc,desp);
                }
                else
                {
                    string timeStamp = DateTime.Now.DayOfYear.ToString() + DateTime.Now.Hour + DateTime.Now.Minute + DateTime.Now.Second;
                    string pack = "pack://temp" + timeStamp + ".xps";
                    var ms = new MemoryStream();
                    var package = Package.Open(ms, FileMode.Create, FileAccess.ReadWrite);
                    PackageStore.AddPackage(new Uri(pack), package);
                    var xpsDoc = new XpsDocument(package, CompressionOption.SuperFast, pack);
                    var xpsDocumentWriter = XpsDocument.CreateXpsDocumentWriter(xpsDoc);
                    xpsDocumentWriter.Write(doc);
                    var fdsCopy = xpsDoc.GetFixedDocumentSequence();

                    var xdw =System.Printing.PrintQueue.CreateXpsDocumentWriter(this.PrintQueue);
                    var vtxd = (VisualsToXpsDocument)xdw.CreateVisualsCollator();
                    for (int i = this.PageRange.PageFrom - 1; i < this.PageRange.PageTo; i++)
                    {
                        var v = fdsCopy.DocumentPaginator.GetPage(i).Visual;
                        var cv = new ContainerVisual();
                        cv.Children.Add(v);
                        vtxd.Write(cv, this.PrintTicket);
                        cv.Children.Remove(v); 
                    }
                    vtxd.EndBatchWrite();
                    xpsDoc.Close();
                    ms.Close();
                    ms.Dispose();
                }
            }

        } 

  • 相关阅读:
    [LeetCode 220.] 存在重复元素 III
    C++ 构造函数 & 析构函数
    [LeetCode 891.] 子序列宽度之和【hard】
    [LeetCode 447.] Number of Boomerangs
    HJ93 数组分组
    HJ77 火车进站
    [LeetCode 338.] 比特位计数
    线段树
    大数量问题的一般解决方法
    字典树
  • 原文地址:https://www.cnblogs.com/kklldog/p/2984074.html
Copyright © 2011-2022 走看看